View source for Functions(The Cartesian Product Definition)


[[File:Cartesian Product qtl1.svg|thumb|Cartesian product <math>\scriptstyle A \times B</math> of the sets <math>\scriptstyle A=\{x,y,z\}</math> and <math>\scriptstyle B=\{1,2,3\}</math>]]

In mathematics, specifically set theory, the '''Cartesian product''' of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs (''a'', ''b'') where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is
: <math>A\times B = \{(a,b)\mid a \in A \ \mbox{ and } \ b \in B\}.</math>

A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product ''rows'' × ''columns'' is taken, the cells of the table contain ordered pairs of the form (row value, column value).

One can similarly define the Cartesian product of ''n'' sets, also known as an '''''n''-fold Cartesian product''', which can be represented by an ''n''-dimensional array, where each element is an ''n''-tuple. An ordered pair is a 2-tuple or couple. More generally still, one can define the Cartesian product of an indexed family of sets.

The Cartesian product is named after René Descartes, whose formulation of analytic geometry gave rise to the concept, which is further generalized in terms of direct product.

== Examples ==

=== A deck of cards ===
[[File:Piatnikcards.jpg|thumb|Standard 52-card deck]]

An illustrative example is the standard 52-card deck. The standard playing card ranks {A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, 2} form a 13-element set. The card suits {♠, {{color|#c00000|♥}}, {{color|#c00000|♦}}, ♣} form a four-element set. The Cartesian product of these sets returns a 52-element set consisting of 52 ordered pairs, which correspond to all 52 possible playing cards. 

''Ranks'' × ''Suits'' returns a set of the form {(A,&nbsp;♠), (A,&nbsp;{{color|#c00000|♥}}), (A,&nbsp;{{color|#c00000|♦}}), (A,&nbsp;♣), (K,&nbsp;♠), …, (3,&nbsp;♣), (2,&nbsp;♠), (2,&nbsp;{{color|#c00000|♥}}), (2,&nbsp;{{color|#c00000|♦}}), (2,&nbsp;♣)}.

''Suits'' × ''Ranks'' returns a set of the form {(♠,&nbsp;A), (♠,&nbsp;K), (♠,&nbsp;Q), (♠,&nbsp;J), (♠,&nbsp;10), …, (♣,&nbsp;6), (♣,&nbsp;5), (♣,&nbsp;4), (♣,&nbsp;3), (♣,&nbsp;2)}.

These two sets are distinct, even disjoint.

=== A two-dimensional coordinate system ===
[[File:Cartesian-coordinate-system.svg|thumb|Cartesian coordinates of example points]]

The main historical example is the Cartesian plane in analytic geometry. In order to represent geometrical shapes in a numerical way, and extract numerical information from shapes' numerical representations, René Descartes assigned to each point in the plane a pair of real numbers, called its coordinates. Usually, such a pair's first and second components are called its ''x'' and ''y'' coordinates, respectively (see picture). The set of all such pairs (i.e., the Cartesian product ℝ×ℝ, with ℝ denoting the real numbers) is thus assigned to the set of all points in the plane.

== Most common implementation (set theory) ==

A formal definition of the Cartesian product from set-theoretical principles follows from a definition of ordered pair. The most common definition of ordered pairs, Kuratowski's definition, is <math>(x, y) = \{\{x\},\{x, y\}\}</math>. Under this definition, <math>(x, y)</math> is an element of <math>\mathcal{P}(\mathcal{P}(X \cup Y))</math>, and <math>X\times Y</math> is a subset of that set, where <math>\mathcal{P}</math> represents the power set operator. Therefore, the existence of the Cartesian product of any two sets in ZFC follows from the axioms of pairing, union, power set, and specification. Since functions are usually defined as a special case of relations, and relations are usually defined as subsets of the Cartesian product, the definition of the two-set Cartesian product is necessarily prior to most other definitions.

=== Non-commutativity and non-associativity ===
Let ''A'', ''B'', ''C'', and ''D'' be sets.

The Cartesian product ''A'' × ''B'' is not commutative,
: <math>A \times B \neq B \times A,</math>
because the ordered pairs are reversed unless at least one of the following conditions is satisfied:
* ''A'' is equal to ''B'', or
* ''A'' or ''B'' is the empty set.

For example:
: ''A'' = {1,2}; ''B'' = {3,4}
:: ''A'' × ''B'' = {1,2} × {3,4} = {(1,3), (1,4), (2,3), (2,4)}
:: ''B'' × ''A'' = {3,4} × {1,2} = {(3,1), (3,2), (4,1), (4,2)}

: ''A'' = ''B'' = {1,2}
:: ''A'' × ''B'' = ''B'' × ''A'' = {1,2} × {1,2} = {(1,1), (1,2), (2,1), (2,2)}

: ''A'' = {1,2}; ''B'' = ∅
:: ''A'' × ''B'' = {1,2} × ∅ = ∅
:: ''B'' × ''A'' = ∅ × {1,2} = ∅

Strictly speaking, the Cartesian product is not associative (unless one of the involved sets is empty).
: <math>(A\times B)\times C \neq A \times (B \times C)</math>
If for example ''A''&nbsp;=&nbsp;{1}, then (''A'' × ''A'') × ''A'' = {((1, 1), 1)} ≠ {(1, (1, 1))} = ''A'' × (''A'' × ''A'').

=== Intersections, unions, and subsets ===
{{multiple image
|align=center
| total_width = 750
|image1=CartDistr_svg.svg
|caption1=Example sets<br>
{{color|#0000c0|''A''}}&thinsp;=&thinsp;{''y''&thinsp;∈&thinsp;[[real numbers|ℝ]] :&thinsp;1&thinsp;≤&thinsp;''y''&thinsp;≤&thinsp;4}, {{color|#c00000|''B''}}&thinsp;=&thinsp;{''x''&thinsp;∈&thinsp;ℝ : 2&thinsp;≤&thinsp;''x''&thinsp;≤&thinsp;5}, <br />
and {{color|#00c000|''C''}} = {''x''&thinsp;∈&thinsp;ℝ : 4&thinsp;≤&thinsp;''x''&thinsp;≤&thinsp;7}, demonstrating <br />
''A'' × (''B''∩''C'') = ({{highlight|''A''×''B''|#FCC6C6}}) ∩ ({{highlight|''A''×''C''|#C6FCC6}}), <br />
''A'' × (''B''∪''C'') = ({{highlight|''A''×''B''|#FCC6C6}}) ∪ ({{highlight|''A''×''C''|#C6FCC6}}), and <br />
''A'' × (''B''{{hsp}}\{{hsp}}''C'') = ({{highlight|''A''×''B''|#FCC6C6}}) \ ({{highlight|''A''×''C''|#C6FCC6}})
|image2=CartInts_svg.svg
|caption2=Example sets <br />
{{color|#c00000|''A''}}&thinsp;=&thinsp;{''x''&thinsp;∈&thinsp;ℝ : 2&thinsp;≤&thinsp;''x''&thinsp;≤&thinsp;5}, {{color|#00c000|''B''}}&thinsp;=&thinsp;{''x''&thinsp;∈&thinsp;ℝ : 3&thinsp;≤&thinsp;''x''&thinsp;≤&thinsp;7}, <br />
{{color|#c00000|''C''}}&thinsp;=&thinsp;{''y''&thinsp;∈&thinsp;ℝ :&thinsp;1&thinsp;≤&thinsp;''y''&thinsp;≤&thinsp;3}, {{color|#00c000|''D''}}&thinsp;=&thinsp;{''y''&thinsp;∈&thinsp;ℝ : 2&thinsp;≤&thinsp;''y''&thinsp;≤&thinsp;4}, demonstrating <br />
{{highlight|(''A''∩''B'') × (''C''∩''D'')|#FCFCC6}} = ({{highlight|''A''×''C''|#FCC6C6}}) ∩ ({{highlight|''B''×''D''|#C6FCC6}}).
|image3=CartUnion_svg.svg
|caption3={{highlight|(''A''∪''B'') × (''C''∪''D'')|#E0E0FC}} ≠ ({{highlight|''A''×''C''|#FCC6C6}}) ∪ ({{highlight|''B''×''D''|#C6FCC6}}) can be seen from the same example.
}}
The Cartesian product satisfies the following property with respect to intersections (see middle picture).
: <math>(A \cap B) \times (C \cap D) = (A \times C) \cap (B \times D)</math>

In most cases, the above statement is not true if we replace intersection with union (see rightmost picture).
: <math>(A \cup B) \times (C \cup D) \neq (A \times C) \cup (B \times D)</math>

In fact, we have that:
: <math>(A \times C) \cup (B \times D) = [(A \setminus B) \times C] \cup [(A \cap B) \times (C \cup D)] \cup [(B \setminus A) \times D]</math>

For the set difference, we also have the following identity:
: <math>(A \times C) \setminus (B \times D) = [A \times (C \setminus D)] \cup [(A \setminus B) \times C] </math>

Here are some rules demonstrating distributivity with other operators (see leftmost picture):
: <math>\begin{align}
       A \times (B \cap C) &= (A \times B) \cap (A \times C), \\
       A \times (B \cup C) &= (A \times B) \cup (A \times C), \\
  A \times (B \setminus C) &= (A \times B) \setminus (A \times C),
\end{align}</math>
: <math>(A \times B)^\complement = \left(A^\complement \times B^\complement\right) \cup \left(A^\complement \times B\right) \cup \left(A \times B^\complement\right)\!,</math>

where <math>A^\complement</math> denotes the absolute complement of ''A''.

Other properties related with subsets are:
:<math>\text{if } A \subseteq B \text{, then } A \times C \subseteq B \times C;</math>
:<math>\text{if both } A,B \neq \emptyset \text{, then } A \times B \subseteq C \times D \!\iff\! A \subseteq C \text{ and } B \subseteq D.</math>

=== Cardinality ===

The cardinality of a set is the number of elements of the set. For example, defining two sets: ''A'' = {a, b} and ''B'' = {5, 6}. Both set ''A'' and set ''B'' consist of two elements each. Their Cartesian product, written as ''A'' × ''B'', results in a new set which has the following elements:
: ''A'' × ''B'' = {(a,5), (a,6), (b,5), (b,6)}.

where each element of ''A'' is paired with each element of ''B'', and where each pair makes up one element of the output set.
The number of values in each element of the resulting set is equal to the number of sets whose Cartesian product is being taken; 2 in this case.
The cardinality of the output set is equal to the product of the cardinalities of all the input sets. That is,
: |''A'' × ''B''| = |''A''| · |''B''|.

In this case, |''A'' × ''B''| = 4

Similarly
: |''A'' × ''B'' × ''C''| = |''A''| · |''B''| · |''C''|
and so on.

The set ''A'' × ''B'' is infinite if either ''A'' or ''B'' is infinite, and the other set is not the empty set.

== Cartesian products of several sets ==

=== ''n''-ary Cartesian product ===
The Cartesian product can be generalized to the '''''n''-ary Cartesian product''' over ''n'' sets ''X''<sub>1</sub>, ..., ''X<sub>n</sub>'' as the set

: <math>X_1\times\cdots\times X_n = \{(x_1, \ldots, x_n) \mid x_i \in X_i \ \text{for every} \ i \in \{1, \ldots, n\} \}</math>

of ''n''-tuples. If tuples are defined as nested ordered pairs, it can be identified with (''X''<sub>1</sub> × ⋯ × ''X''<sub>''n''−1</sub>) × ''X<sub>n</sub>''. If a tuple is defined as a function on {1, 2, …, ''n''} that takes its value at ''i'' to be the ''i''th element of the tuple, then the Cartesian product ''X''<sub>1</sub>×⋯×''X''<sub>''n''</sub> is the set of functions

: <math>\{ x:\{1,\ldots,n\}\to X_1\cup\cdots\cup X_n \ | \ x(i)\in X_i \ \text{for every} \ i \in \{1, \ldots, n\} \}.</math>

=== ''n''-ary Cartesian power ===
The '''Cartesian square''' of a set ''X'' is the Cartesian product ''X''<sup>2</sup> = ''X'' × ''X''.
An example is the 2-dimensional plane '''R'''<sup>2</sup> = '''R''' × '''R''' where '''R''' is the set of real numbers: '''R'''<sup>2</sup> is the set of all points (''x'',''y'') where ''x'' and ''y'' are real numbers.

The ''' ''n''-ary Cartesian power''' of a set ''X'', denoted <math>X^n</math>, can be defined as

: <math> X^n = \underbrace{ X \times X \times \cdots \times X }_{n}= \{ (x_1,\ldots,x_n) \ | \ x_i \in X \ \text{for every} \ i \in \{1, \ldots, n\} \}.</math>

An example of this is '''R'''<sup>3</sup> = '''R''' × '''R''' × '''R''', with '''R''' again the set of real numbers, and more generally '''R'''<sup>''n''</sup>.

The ''n''-ary Cartesian power of a set ''X'' is isomorphic to the space of functions from an ''n''-element set to ''X''.  As a special case, the 0-ary Cartesian power of ''X'' may be taken to be a singleton set, corresponding to the empty function with codomain ''X''.

=== Infinite Cartesian products ===
It is possible to define the Cartesian product of an arbitrary (possibly infinite) indexed family of sets. If ''I'' is any index set, and <math>\{X_i\}_{i\in I}</math> is a family of sets indexed by ''I'', then the Cartesian product of the sets in <math>\{X_i\}_{i\in I}</math> is defined to be 

: <math>\prod_{i \in I} X_i = \left\{\left. f: I \to \bigcup_{i \in I} X_i\ \right|\ (\forall i)(f(i) \in X_i)\right\},</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<sub>i</sub>''.  Even if each of the ''X<sub>i</sub>'' is nonempty, the Cartesian product may be empty if the axiom of choice, which is equivalent to the statement that every such product is nonempty, is not assumed.

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'''.

'''Cartesian power''' is a Cartesian product where all the factors ''X<sub>i</sub>'' are the same set ''X''. In this case, 
: <math>\prod_{i \in I} X_i = \prod_{i \in I} X</math> 
is the set of all functions from ''I'' to ''X'', and is frequently denoted ''X<sup>I</sup>''. This case is important in the study of cardinal exponentiation. An important special case is when the index set is <math>\mathbb{N}</math>, the natural numbers: this Cartesian product is the set of all infinite sequences with the ''i''th term in its corresponding set ''X<sub>i</sub>''. For example, each element of 
: <math>\prod_{n = 1}^\infty \mathbb R = \mathbb R \times \mathbb R \times \cdots</math>
can be visualized as a vector with countably infinite real number components. This set is frequently denoted <math>\mathbb{R}^\omega</math>, or <math>\mathbb{R}^{\mathbb{N}}</math>.

== Other forms ==

=== Abbreviated form ===
If several sets are being multiplied together (e.g., ''X''<sub>1</sub>, ''X''<sub>2</sub>, ''X''<sub>3</sub>, …), then some authors choose to abbreviate the Cartesian product as simply <big>×</big>''X''<sub>''i''</sub>.

=== Cartesian product of functions ===
If ''f'' is a function from ''A'' to ''B'' and ''g'' is a function from ''X'' to ''Y'', then 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>

This can be extended to tuples and infinite collections of functions.
This is different from the standard Cartesian product of functions considered as sets.

=== Cylinder ===
Let <math>A</math> be a set and <math>B \subseteq A</math>. Then the ''cylinder'' of <math>B</math> with respect to <math>A</math> is the Cartesian product <math>B \times A</math> of <math>B</math> and <math>A</math>. 

Normally, <math>A</math> is considered to be the universe of the context and is left away. For example, if <math>B</math> is a subset of the natural numbers <math>\mathbb{N}</math>, then the cylinder of <math>B</math> is <math>B \times \mathbb{N}</math>.

== Definitions outside set theory ==

===Category theory===
Although the Cartesian product is traditionally applied to sets, category theory provides a more general interpretation of the product of mathematical structures. This is distinct from, although related to, the notion of a Cartesian square in category theory, which is a generalization of the fiber product.

Exponentiation is the right adjoint of the Cartesian product; thus any category with a Cartesian product (and a final object) is a Cartesian closed category.

===Graph theory===
In graph theory, the Cartesian product of two graphs ''G'' and ''H'' is the graph denoted by ''G'' × ''H'', whose vertex set is the (ordinary) Cartesian product ''V''(''G'') × ''V''(''H'') and such that two vertices (''u'',''v'') and (''u''′,''v''′) are adjacent in ''G'' × ''H'', if and only if ''u'' = ''u''′ and ''v'' is adjacent with ''v''′ in ''H'', ''or'' ''v'' = ''v''′ and ''u'' is adjacent with ''u''′ in ''G''.  The Cartesian product of graphs is not a product in the sense of category theory.  Instead, the categorical product is known as the tensor product of graphs.

== Licensing == 
Content obtained and/or adapted from:
* [https://en.wikipedia.org/wiki/Cartesian_product Cartesian product, Wikipedia] under a CC BY-SA license