Cartesian product of sets
The Cartesian product of sets is a binary operation where the operands are sets, and the operator is 'x'. Its data sets A and B, the Cartesian product of A and B indicate A x B.
The Cartesian product A x B returns a collection whose elements are ordered pairs , given that x belongs to A B eya, a generic element of A x B (x, y), ie an ordered pair consisting of an element (x) the first set (A) and an element (y) (B).
Tuesday, March 8, 2011
Magnetic Earrings In Hornsby
is a representation 
A x B = {(x, y)
and A x B = {(x, y) mathematical functions, we can say that the Cartesian product A x B is a relation R: A to B, more precisely, a function F: A to B, since every element of A has an image in B. Therefore, any report (or function) of two existing sets, is simply a subset of the Cartesian product of the sets were. Here's an example:
A = {a, b, c, d, e, f, g, h, i}
B = {l, m, n, o, p, q, r, s, t} Given a relation R: From A to B open a proposition p (x, y): 'x ∈ A y ∈ B with x ∈ A y ∈ B
We report as a result of all the ordered pairs (x, y), each pair in R if the first element belongs to A and the second belongs to B, then the set of pairs appears to be the Cartesian product A x B, we can state with C.
Additional Details: Between A and B of the example you can establish a correspondence as A and B have the same cardinality (the same number of elements), so I'm equipotent.
can still further the operation of Cartesian product here:
Cartesian product - Wikipedia
.
Rate this article on MySpace
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment