Cartesian product

[edit] Americola's celebrity biographies are provided by AmericolaWiki, a celebrity wiki. You can help contribute to Americola and edit this article.

In mathematics, the Cartesian product is a direct product of sets. Specifically, the Cartesian product of two sets X and Y, denoted X × Y, is the set of all possible ordered pairs whose first component is a member of X and whose second component is a member of Y:

<math>X\times Y = \{(x,y) | x\in X\;\mathrm{and}\;y\in Y\}. </math>

The Cartesian product is named after René Descartes whose formulation of analytic geometry gave rise to this concept.

For example, the Cartesian product of the thirteen-element set of standard playing card ranks {Ace, King, Queen, Jack, 10, 9, 8, 7, 6, 5, 4, 3, 2} and the four-element set of card suits {♠, ♥, ♦, ♣} is the 52-element set of playing cards {(Ace, ♠), (King, ♠), ..., (2, ♠), (Ace, ♥), ..., (3, ♣), (2, ♣)}. The Cartesian product has 52 elements because that is the product of 13 times 4.

Contents 1 Cartesian square and n-ary product 2 Infinite products 3 Abbreviated form 4 Cartesian product of functions 5 Category theory 6 See also 7 External links 8 References

Cartesian square and n-ary product

The Cartesian square (or binary Cartesian product) of a set X is the Cartesian product X² = X × X. An example is the 2-dimensional plane R² = R × R where R is the set of real numbers - all points (x,y) where x and y are real numbers (see the Cartesian coordinate system).

This can be generalized to the n-ary Cartesian product over n sets X₁, ..., X_n:

<math>X_1\times\cdots\times X_n = \{(x_1, \ldots, x_n) \mid x_1\in X_1\;\mathrm{and}\;\cdots\;\mathrm{and}\;x_n\in X_n\}.</math>

Indeed, it can be identified to (X₁ × ... × X_n-1) × X_n. It is a set of n-tuples.

An example of this is the Euclidean 3-space R³ = R × R × R, with R again the set of real numbers.

As an aid to its calculation, a table can be drawn up, with one set as the rows and the other as the columns, and forming the ordered pairs, the cells of the table by choosing the element of the set from the row and the column.

Infinite products

The above definition is usually all that's needed for the most common mathematical applications. However, it is possible to define the Cartesian product over an arbitrary (possibly infinite) collection of sets. If I is any index set, and

<math>\{X_i\ | i \in I\}</math>

is a collection of sets indexed by I, then we define

<math>\prod_{i \in I} X_i = \{ f : I \to \bigcup_{i \in I} X_i\ |\ (\forall i)(f(i) \in X_i)\},</math>

that is, the set of all functions defined on the index set such that the value of the function at a particular index i is an element of X_i .

For each j in I, the function

<math> \pi_{j} : \prod_{i \in I} X_i \to X_{j},</math>

defined by

<math> \pi_{j}(f) = f(j),\,</math>

is called the j ^th projection map.

An n-tuple can be viewed as a function on {1, 2, ..., n} that takes its value at i to be the i ^th element of the tuple. Hence, when I is {1, 2, ..., n} this definition coincides with the definition for the finite case. In the infinite case this is a family.

One particular and familiar infinite case is when the index set is <math>\mathbb N,</math> the natural numbers: this is just the set of all infinite sequences with the i ^th term in its corresponding set X_i . Once again, <math>\mathbb R</math> provides an example of this:

<math>\prod_{n = 1}^\infty \mathbb R =\mathbb{R}^\omega= \mathbb R \times \mathbb R \times \cdots</math>

is the collection of infinite sequences of real numbers, and it is easily visualized as a vector or tuple with an infinite number of components. Another special case (the above example also satisfies this) is when all the factors X_i involved in the product are the same, being like "Cartesian exponentiation." Then the big union in the definition is just the set itself, and the other condition is trivially satisfied, so this is just the set of all functions from I to X.

Otherwise, the infinite cartesian product is less intuitive; though valuable in its applications to higher mathematics.

The assertion that the Cartesian product of an arbitrary collection of non-empty sets is non-empty is equivalent to the axiom of choice.

Abbreviated form

If several sets are being multiplied together, e.g. <math>X_1, X_2, X_3, ...</math>, then some authors ^[1] choose to abbreviate the Cartesian product as simply <math>\times X_i</math>.

Cartesian product of functions

If f is a function from A to B and g is a function from X to Y, their cartesian product f×g is a function from A×X to B×Y with

<math>(f\times g)(a, x) = (f(a), g(x))</math>

As above this can be extended to tuples and infinite collections of functions.

Category theory

Although the Cartesian product is traditionally applied to sets, category theory provides a more general interpretation of the product of mathematical structures.

See also

• Binary relation
• Direct product
• Empty product
• Product (category theory)
• Product topology
• Relation (mathematics)

Wikipedia information about Cartesian product This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Cartesian product". It may not have been reviewed by professional editors (see full disclaimer). Help contribute to Americola and edit this article.