Cartesian product

In mathematics, specifically set theory, the Cartesian product of two sets $A$ and $B$ , denoted $A \times B$ , is the set of all ordered pairs $(a, b)$ where $a$ is in $A$ and $b$ is in $B$ .^[1] In terms of set-builder notation, that is $A\times B=\{(a,b)\mid a\in A\ {\mbox{ and }}\ b\in B\}.$ ^[2]^[3]

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).^[4]

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,^[5] whose formulation of analytic geometry gave rise to the concept, which is further generalized in terms of direct product.

Set-theoretic definition

A rigorous definition of the Cartesian product requires a domain to be specified in the set-builder notation. In this case the domain would have to contain the Cartesian product itself. For defining the Cartesian product of the sets $A$ and $B$ , with the typical Kuratowski's definition of a pair $(a,b)$ as $\{\{a\},\{a,b\}\}$ , an appropriate domain is the set ${\mathcal {P}}({\mathcal {P}}(A\cup B))$ where ${\mathcal {P}}$ denotes the power set. Then the Cartesian product of the sets $A$ and $B$ would be defined as^[6] $A\times B=\{x\in {\mathcal {P}}({\mathcal {P}}(A\cup B))\mid \exists a\in A\ \exists b\in B:x=(a,b)\}.$

Examples

A deck of cards

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 {♠, ♥, ♦, ♣} 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, ♠), (A, ♥), (A, ♦), (A, ♣), (K, ♠), ..., (3, ♣), (2, ♠), (2, ♥), (2, ♦), (2, ♣)}.

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

These two sets are distinct, even disjoint, but there is a natural bijection between them, under which (3, ♣) corresponds to (♣, 3) and so on.

A two-dimensional coordinate system

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 $\mathbb {R} \times \mathbb {R}$ , with $\mathbb {R}$ denoting the real numbers) is thus assigned to the set of all points in the plane.^[7]

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 $(x,y)=\{\{x\},\{x,y\}\}$ . Under this definition, $(x,y)$ is an element of ${\mathcal {P}}({\mathcal {P}}(X\cup Y))$ , and $X\times Y$ is a subset of that set, where ${\mathcal {P}}$ 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 \times B$ is not commutative, $A\times B\neq B\times A,$ ^[4] because the ordered pairs are reversed unless at least one of the following conditions is satisfied:^[8]

$A$ is equal to $B$ , or
$A$ or $B$ is the empty set.

For example:

A = {1,2}

;

B = {3,4}

A \times B = {1,2} \times {3,4} = {(1,3), (1,4), (2,3), (2,4)}

B \times A = {3,4} \times {1,2} = {(3,1), (3,2), (4,1), (4,2)}

A = B = {1,2}

A \times B = B \times A = {1,2} \times {1,2} = {(1,1), (1,2), (2,1), (2,2)}

A = {1,2}; B = \emptyset

A \times B = {1,2} \times \emptyset = \emptyset

B \times A = \emptyset \times {1,2} = \emptyset

Strictly speaking, the Cartesian product is not associative (unless one of the involved sets is empty). $(A\times B)\times C\neq A\times (B\times C)$ If for example $A = {1}$ , then $(A \times A) \times A = {((1, 1), 1)} \neq$ ${(1, (1, 1))} = A \times (A \times A)$ .

Intersections, unions, and subsets

Example sets

$A = [1,4]$ , $B = [2,5]$ , and
$C = [4,7]$ , demonstrating
$A \times (B \cap C) = (A \times B) \cap (A \times C)$ ,
$A \times (B \cup C) = (A \times B) \cup (A \times C)$ , and

A × (B \ C) = (A×B) \ (A×C)

Example sets

$A = [2,5]$ , $B = [3,7]$ , $C = [1,3]$ ,
$D = [2,4]$ , demonstrating

(A \cap B) \times (C \cap D) = (A \times C) \cap (B \times D)

.

(A \cup B) \times (C \cup D) \neq (A \times C) \cup (B \times D)

can be seen from the same example.

The Cartesian product satisfies the following property with respect to intersections (see middle picture). $(A\cap B)\times (C\cap D)=(A\times C)\cap (B\times D)$

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

In fact, we have that: $(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]$

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

Here are some rules demonstrating distributivity with other operators (see leftmost picture):^[8] ${\begin{aligned}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{aligned}}$ $(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)\!,$ where $A^{\complement }$ denotes the absolute complement of $A$ .

Other properties related with subsets are:

{\text{if }}A\subseteq B{\text{, then }}A\times C\subseteq B\times C;

${\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.$ ^[9]

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 \times B$ , results in a new set which has the following elements:

A \times 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 \times B | = | A | \cdot | B |

.^[4]

In this case, $| A \times B | = 4$

Similarly,

| A \times B \times C | = | A | \cdot | B | \cdot | C |

and so on.

The set $A \times B$ is infinite if either $A$ or $B$ is infinite, and the other set is not the empty set.^[10]

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 1, ..., X n$ as the set $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\}\}$

of $n$ -tuples. If tuples are defined as nested ordered pairs, it can be identified with $(X 1 \times ... \times X n -1) \times X n$ . 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 1 \times ... \times X n$ is the set of functions $\{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\}\}.$

n-ary Cartesian power

The Cartesian square of a set $X$ is the Cartesian product $X 2 = X \times X$ . An example is the 2-dimensional plane $R 2 = R \times R$ where $R$ is the set of real numbers:^[1] $R 2$ is the set of all points $(x, y)$ where $x$ and $y$ are real numbers (see the Cartesian coordinate system).

The $n$ -ary Cartesian power of a set $X$ , denoted $X^{n}$ , can be defined as $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\}\}.$

An example of this is $R 3 = R \times R \times R$ , with $R$ again the set of real numbers,^[1] and more generally $R n$ .

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 $\{X_{i}\}_{i\in I}$ is a family of sets indexed by $I$ , then the Cartesian product of the sets in $\{X_{i}\}_{i\in I}$ is defined to be $\prod _{i\in I}X_{i}=\left\{\left.f:I\to \bigcup _{i\in I}X_{i}\ \right|\ \forall i\in I.\ f(i)\in X_{i}\right\},$ that is, the set of all functions defined on the index set $I$ such that the value of the function at a particular index $i$ is an element of X_i. Even if each of the X_i 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. $\prod _{i\in I}X_{i}$ may also be denoted ${\mathsf {X}}$ ${}_{i\in I}X_{i}$ .^[11]

For each $j$ in $I$ , the function $\pi _{j}:\prod _{i\in I}X_{i}\to X_{j},$ defined by $\pi _{j}(f)=f(j)$ is called the $j$ -th projection map.

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

Other forms

Abbreviated form

If several sets are being multiplied together (e.g., $X 1, X 2, X 3, ...$ ), then some authors^[12] choose to abbreviate the Cartesian product as simply $\times X i$ .

Cartesian product of functions

If $f$ is a function from $X$ to $A$ and $g$ is a function from $Y$ to $B$ , then their Cartesian product $f \times g$ is a function from $X \times Y$ to $A \times B$ with $(f\times g)(x,y)=(f(x),g(y)).$

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 $A$ be a set and $B\subseteq A$ . Then the cylinder of $B$ with respect to $A$ is the Cartesian product $B\times A$ of $B$ and $A$ .

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

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 \times H$ , whose vertex set is the (ordinary) Cartesian product $V (G) \times V (H)$ and such that two vertices $(u, v)$ and $(u', v')$ are adjacent in $G \times 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.

References

^ ^a ^b ^c Weisstein, Eric W. "Cartesian Product". MathWorld. Retrieved September 5, 2020.
^ Warner, S. (1990). Modern Algebra. Dover Publications. p. 6.
^ Nykamp, Duane. "Cartesian product definition". Math Insight. Retrieved September 5, 2020.
^ ^a ^b ^c "Cartesian Product". web.mnstate.edu. Archived from the original on July 18, 2020. Retrieved September 5, 2020.
^ "Cartesian". Merriam-Webster.com. 2009. Retrieved December 1, 2009.
^ Corry, S. "A Sketch of the Rudiments of Set Theory" (PDF). Retrieved May 5, 2023.
^ Goldberg, Samuel (1986). Probability: An Introduction. Dover Books on Mathematics. Courier Corporation. p. 41. ISBN 9780486652528.
^ ^a ^b Singh, S. (August 27, 2009). Cartesian product. Retrieved from the Connexions Web site: http://cnx.org/content/m15207/1.5/
^ Cartesian Product of Subsets. (February 15, 2011). ProofWiki. Retrieved 05:06, August 1, 2011 from https://proofwiki.org/w/index.php?title=Cartesian_Product_of_Subsets&oldid=45868
^ Peter S. (1998). A Crash Course in the Mathematics of Infinite Sets. St. John's Review, 44(2), 35–59. Retrieved August 1, 2011, from http://www.mathpath.org/concepts/infinity.htm
^ F. R. Drake, Set Theory: An Introduction to Large Cardinals, p. 24. Studies in Logic and the Foundations of Mathematics, vol. 76 (1978). ISBN 0-7204-2200-0.
^ Osborne, M., and Rubinstein, A., 1994. A Course in Game Theory. MIT Press.

External links

[:1-1] Weisstein, Eric W. "Cartesian Product". MathWorld. Retrieved September 5, 2020.

[2] Warner, S. (1990). Modern Algebra. Dover Publications. p. 6.

[3] Nykamp, Duane. "Cartesian product definition". Math Insight. Retrieved September 5, 2020.

[:2-4] "Cartesian Product". web.mnstate.edu. Archived from the original on July 18, 2020. Retrieved September 5, 2020.

[5] "Cartesian". Merriam-Webster.com. 2009. Retrieved December 1, 2009.

[6] Corry, S. "A Sketch of the Rudiments of Set Theory" (PDF). Retrieved May 5, 2023.

[7] Goldberg, Samuel (1986). Probability: An Introduction. Dover Books on Mathematics. Courier Corporation. p. 41. ISBN 9780486652528.

[cnx-8] Singh, S. (August 27, 2009). Cartesian product. Retrieved from the Connexions Web site: http://cnx.org/content/m15207/1.5/

[9] Cartesian Product of Subsets. (February 15, 2011). ProofWiki. Retrieved 05:06, August 1, 2011 from https://proofwiki.org/w/index.php?title=Cartesian_Product_of_Subsets&oldid=45868

[10] Peter S. (1998). A Crash Course in the Mathematics of Infinite Sets. St. John's Review, 44(2), 35–59. Retrieved August 1, 2011, from http://www.mathpath.org/concepts/infinity.htm

[11] F. R. Drake, Set Theory: An Introduction to Large Cardinals, p. 24. Studies in Logic and the Foundations of Mathematics, vol. 76 (1978). ISBN 0-7204-2200-0.

[12] Osborne, M., and Rubinstein, A., 1994. A Course in Game Theory. MIT Press.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo