Cartesian product

From formulasearchengine
Revision as of 08:52, 25 August 2012 by en>EmausBot (r2.7.2+) (Robot: Modifying ar:جداء ديكارتي)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}}Template:Main other In mathematics, a Cartesian product (or product set) is a construction to build a new set out of a number of given sets. Each member of the Cartesian product corresponds to the selection of one element each in every one of those sets. The Cartesian product is named after René Descartes,[1] whose formulation of analytic geometry gave rise to this concept.

The Cartesian product of two sets X (for example the points on an x-axis) and Y (for example the points on a y-axis), 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 (e.g., the whole of the x–y plane):


For example, the Cartesian product of the 13-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 all possible playing cards: ranks × suits = {(Ace, ♠), (King, ♠), ..., (2, ♠), (Ace, ♥), ..., (3, ♣), (2, ♣)}. The corresponding Cartesian product has 52 = 13 × 4 elements. The Cartesian product of the suits × ranks would still be the 52 pairings, but in the opposite order {(♠, Ace), (♠, King), ...}. Ordered pairs (a kind of tuple) have order, but sets are unordered. The order in which the elements of a set are listed is irrelevant; the deck can be shuffled and it is still the same set of cards.

A Cartesian product of two finite sets can be represented by a table, 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.

Set-theoretical definition


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, the Kuratowski definition, is . Note that, under this definition, , where represents the power set. 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.

Basic properties

Let A, B, C, and D be sets.

The Cartesian product A × B is not commutative,

because the ordered pairs are reversed except if at least one condition is satisfied:[3]

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 the above condition occurs).

Other set operations

The Cartesian product acts nicely with respect to intersections.


Notice that in most cases the above statement is not true if we replace intersection with union.

However, for intersection and union it holds for:[3]


Other properties related with subset are:



The cardinality of a set is similar to the number of elements of the set. For a simpler 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)}.

Each element of A is combined with each element of B. Each pair makes up one element of the output set. The number of values in each pair is equal to the number of sets whose cartesian product is being taken; hence 2 in this case. The cardinality of the result set is equal to the product of the cardinalities of all the input sets. That is,

|A × B| = |A| · |B|

and similarly

|A × B × C| = |A| · |B| · |C|

and so on.

The cardinality of A × B is also infinity if A or B is an infinite set.[6]

n-ary product

The Cartesian product can be generalized to the n-ary Cartesian product over n sets X1, ..., Xn:

It is a set of n-tuples. If tuples are defined as nested ordered pairs, it can be identified to (X1 × ... × Xn-1) × Xn.

Cartesian square and Cartesian power

The Cartesian square (or binary Cartesian product) of a set X is the Cartesian product X2 = X × X. An example is the 2-dimensional plane R2 = 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).

The cartesian power of a set X can be defined as:

An example of this is R3 = R × R × R, with R again the set of real numbers, and more generally Rn.

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 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 is a collection of sets indexed by I, then the Cartesian product of the sets in X is defined to be

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 Xi . Even if each of the is nonempty, the Cartesian product may be empty in general. The axiom of choice postulates that the product is nonempty.

For each j in I, the function

defined by πj(f) = f(j) is called the j -th projection map.

An important case is when the index set is , the natural numbers: this Cartesian product is the set of all infinite sequences with the i -th term in its corresponding set X. For example, each element of

can be visualized as a vector with an infinite number of real-number components. This set is frequently denoted , or .

The special case Cartesian exponentiation occurs when all the factors Xi involved in the product are the same set X. In this case,

is the set of all functions from I to X, and is frequently denoted . This case is important in the study of cardinal exponentiation.

The definition of finite Cartesian products can be seen as a special case of the definition for infinite products. In this interpretation, 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 (in some settings, this is taken as the very definition of an n-tuple).

Nothing in the definition of an infinite Cartesian product implies that the Cartesian product of nonempty sets must itself be nonempty. This assertion is equivalent to the axiom of choice.

Abbreviated form

If several sets are being multiplied together, e.g. X1, X2, X3, …, then some authors[7] choose to abbreviate the Cartesian product as simply ×Xi.

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

As above this can be extended to tuples and infinite collections of functions. Note that this is different from the standard cartesian product of functions considered as sets.

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(GV(H) and such that two vertices (u,v) and (u′,v′) are adjacent in G×H if and only if u = v and u' is adjacent with v' in H, or u' = v' and u is adjacent with v 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.

See also


  1. cartesian. (2009). In Merriam-Webster Online Dictionary. Retrieved December 1, 2009, from
  2. Warner, S: Modern Algebra, page 6. Dover Press, 1990.
  3. 3.0 3.1 Singh, S. (2009, August 27). Cartesian product. Retrieved from the Connexions Web site:
  4. 4.0 4.1 Template:Planetmath reference
  5. Cartesian Product of Subsets. (2011, February 15). ProofWiki. Retrieved 05:06, August 1, 2011 from
  6. 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
  7. Osborne, M., and Rubinstein, A., 1994. A Course in Game Theory. MIT Press.

External links

am:ርቢ ስብስብ ar:جداء ديكارتي be:Дэкартавы здабытак be-x-old:Дэкартавы здабытак bg:Декартово произведение ca:Producte cartesià cs:Kartézský součin da:Kartesiansk produkt de:Kartesisches Produkt et:Otsekorrutis es:Producto cartesiano eo:Kartezia multipliko fa:ضرب دکارتی fr:Produit cartésien gd:Toradh Cartesach gl:Produto cartesiano ko:곱집합 is:Faldmengi it:Prodotto cartesiano he:מכפלה קרטזית ka:დეკარტული ნამრავლი lt:Dekarto sandauga lmo:Cungjuunt prudüit hu:Descartes-szorzat ms:Hasil darab Descartes nl:Cartesisch product ja:直積集合 no:Kartesisk produkt nn:Kartesisk produkt oc:Produch cartesian pms:Prodot cartesian pl:Iloczyn kartezjański pt:Produto cartesiano ro:Produs cartezian ru:Прямое произведение sk:Karteziánsky súčin sl:Kartezični produkt sr:Декартов производ fi:Karteesinen tulo sv:Cartesisk produkt ta:கார்ட்டீசியன் பெருக்கற்பலன் uk:Декартів добуток множин vi:Tích Descartes zh-classical:直積 zh-yue:笛卡兒積 zh:笛卡儿积