|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Redirect|Cartesian square|Cartesian squares in category theory|Cartesian square (category theory)}}
| |
| [[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]], a '''Cartesian product''' is a [[mathematical operation]] which returns a [[set (mathematics)|set]] (or '''product set''') from multiple sets. That is, for sets ''A'' and ''B'', the Cartesian product {{nowrap|''A'' × ''B''}} is the set of all ordered pairs {{nowrap|(a, b)}} where {{nowrap|a ∈ ''A''}} and {{nowrap|b ∈ ''B''}}.
| |
|
| |
|
| The simplest case of a Cartesian product is the '''Cartesian square''', which returns a set from two sets. A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product {{nowrap|''rows'' × ''columns''}} is taken, the cells of the table contain ordered pairs of the form {{nowrap|(row value, column value)}}.
| |
|
| |
|
| A Cartesian product of ''n'' sets can be represented by an array of ''n'' dimensions, where each element is an ''n''-[[tuple]]. An ordered pair is a 2-tuple.
| | It involves expertise and knowledge of various tools and technologies used for creating websites. Offshore expert Word - Press developers high level of interactivity, accessibility, functionality and usability of our website can add custom online to using. * A community forum for debate of the product together with some other customers in the comments spot. In the recent years, there has been a notable rise in the number of companies hiring Indian Word - Press developers. You can customize the appearance with PSD to Word - Press conversion ''. <br><br>As you know today Word - Press has turn out to be a tremendously popular open source publishing and blogging display place. The higher your blog ranks on search engines, the more likely people will find your online marketing site. There are number of web services that offer Word press development across the world. Furthermore, with the launch of Windows 7 Phone is the smart phone market nascent App. W3C compliant HTML and a good open source powered by Word - Press CMS site is regarded as the prime minister. <br><br>The entrepreneurs can easily captivate their readers by using these versatile themes. Note: at a first glance WP Mobile Pro themes do not appear to be glamorous or fancy. You've got invested a great cope of time developing and producing up the topic substance. Newer programs allow website owners and internet marketers to automatically and dynamically change words in their content to match the keywords entered by their web visitors in their search queries'a feat that they cannot easily achieve with older software. Should you cherished this post in addition to you would want to obtain more information regarding [http://dinky.in/?BackupPlugin189708 wordpress backup plugin] i implore you to go to our own web-page. Premium vs Customised Word - Press Themes - Premium themes are a lot like customised themes but without the customised price and without the wait. <br><br>The disadvantage is it requires a considerable amount of time to set every thing up. * Robust CRM to control and connect with your subscribers. A higher percentage of women are marrying at older ages,many are delaying childbearing until their careers are established, the divorce rate is high and many couples remarry and desire their own children. If you choose a blog then people will be able to post articles on your site and people will be able to make comments on your posts (unless you turn comments off). Where from they are coming, which types of posts are getting top traffic and many more. <br><br>This advice is critical because you don't want to waste too expensive time establishing your Word - Press blog the exact method. It can run as plugin and you can still get to that whole database just in circumstance your webhost does not have a c - Panel area. It can be concluded that white label SEO comprise of a third party who resells a contract involving IT expert or consultant, SEO professional and end user. Word - Press is the most popular personal publishing platform which was launched in 2003. Verify whether your company has a team of developers or programmers having hands-on experience and knowledge about all Word - Press concepts. |
| | |
| The Cartesian product is named after [[René Descartes]],<ref>cartesian. (2009). In Merriam-Webster Online Dictionary. Retrieved December 1, 2009, from http://www.merriam-webster.com/dictionary/cartesian</ref> whose formulation of [[analytic geometry]] gave rise to the concept.
| |
| | |
| == Examples ==
| |
| | |
| === A deck of cards ===
| |
| | |
| An illustrative example is the [[standard 52-card deck]]. The [[Playing_cards#Anglo-American|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 {{nowrap|{♠, ♥, ♦, ♣} }} form a 4-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.
| |
| | |
| {{nowrap|''Ranks'' × ''Suits''}} returns a set of the form {(A, ♠), (A, ♥), (A, ♦), (A, ♣), (K, ♠), ..., (3, ♣), (2, ♠), (2, ♥), (2, ♦), (2, ♣)}.
| |
| | |
| {{nowrap|''Suits'' × ''Ranks''}} returns a set of the form {(♠, A), (♠, K), (♠, Q), (♠, J), (♠, 10), ..., (♣, 6), (♣, 5), (♣, 4), (♣, 3), (♣, 2)}.
| |
| | |
| === A two-dimensional coordinate system ===
| |
| | |
| An example in [[analytic geometry]] is the [[Cartesian plane]]. The Cartesian plane is the result of the Cartesian product of two sets ''X'' and ''Y'', which refer to points on the x-axis and points on the y-axis, respectively. This Cartesian product can be denoted as {{nowrap|''X'' × ''Y''}}. This produces the set of all possible [[ordered pair]]s 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). Alternatively, the Cartesian product can be denoted as {{nowrap|''Y'' × ''X''}}, in which case the first component of the order pair is a member of ''Y'' and the second component of the ordered pair is a member of ''X''. The Cartesian product is consequently not [[commutative]].
| |
| | |
| :<math>X\times Y = \{\,(x,y)\mid x\in X \ \and \ y\in Y\,\}.</math> <ref>Warner, S: ''Modern Algebra'', page 6. Dover Press, 1990.</ref>
| |
| :<math>Y\times X = \{\,(y,x)\mid y\in Y \ \and \ x\in X\,\}.</math>
| |
| :<math>X\times Y \neq Y\times X</math>
| |
| | |
| == Most common implementation (set theory) ==
| |
| {{main|Implementation of mathematics in set theory}}
| |
| | |
| A formal definition of the Cartesian product from [[set theory|set-theoretical]] principles follows from a definition of [[ordered pair]]. The most common definition of ordered pairs, the [[Ordered pair#Kuratowski definition|Kuratowski definition]], is <math>(x, y) = \{\{x\},\{x, y\}\}</math>. Note that, under this definition, <math>X\times Y \subseteq \mathcal{P}(\mathcal{P}(X \cup Y))</math>, where <math>\mathcal{P}</math> represents the [[power set]]. Therefore, the existence of the Cartesian product of any two sets in [[ZFC]] follows from the axioms of [[axiom of pairing|pairing]], [[axiom of union|union]], [[axiom of power set|power set]], and [[axiom schema of specification|specification]]. Since [[function (mathematics)|functions]] are usually defined as a special case of [[relation (mathematics)|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 {{nowrap|''A'' × ''B''}} is not [[commutative]],
| |
| :<math>A \times B \neq B \times A,</math>
| |
| because the [[ordered pair]]s are reversed except if at least one of the following conditions is satisfied:<ref name="cnx"/>
| |
| * ''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 above conditions occurs).
| |
| :<math>(A\times B)\times C \neq A \times (B \times C)</math>
| |
| | |
| === Intersections, unions, and subsets ===
| |
| The Cartesian product behaves nicely with respect to [[Intersection (set theory)|intersections]]. | |
| :<math>(A \cap B) \times (C \cap D) = (A \times C) \cap (B \times D)</math><ref name="planetmath">{{planetmath reference|id=359|title=CartesianProduct}}</ref> | |
| | |
| Notice that in most cases the above statement is not true if we replace intersection with [[Union (set theory)|union]].
| |
| :<math>(A \cup B) \times (C \cup D) \neq (A \times C) \cup (B \times D)</math>
| |
| | |
| Here are some rules demonstrating distributivity with other operators:<ref name="cnx">Singh, S. (2009, August 27). ''Cartesian product''. Retrieved from the Connexions Web site: http://cnx.org/content/m15207/1.5/</ref>
| |
| :<math>A \times (B \cap C) = (A \times B) \cap (A \times C),</math>
| |
| :<math>A \times (B \cup C) = (A \times B) \cup (A \times C),</math>
| |
| :<math>A \times (B \setminus C) = (A \times B) \setminus (A \times C),</math>
| |
| :<math>(A \times B)^c = (A^c \times B^c) \cup (A^c \times B) \cup (A \times B^c).</math><ref name="planetmath"/>
| |
| | |
| Other properties related with [[subset]]s 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 \and B \subseteq D.</math><ref>Cartesian Product of Subsets. (2011, February 15). ''ProofWiki''. Retrieved 05:06, August 1, 2011 from http://www.proofwiki.org/w/index.php?title=Cartesian_Product_of_Subsets&oldid=45868</ref>
| |
| | |
| === Cardinality ===
| |
| The [[cardinality]] of a set is the number of elements of the set. For example, defining two sets: {{nowrap|1=''A'' = {a, b}} } and {{nowrap|1=''B'' = {5, 6}.}} Both set ''A'' and set ''B'' consist of two elements each. Their Cartesian product, written as {{nowrap|''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 paired 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; 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''|.
| |
| Similarly
| |
| :|''A'' × ''B'' × ''C''| = |''A''| · |''B''| · |''C''|
| |
| and so on.
| |
| | |
| The cardinality of {{nowrap|''A'' × ''B''}} is [[infinity]] if either ''A'' or ''B'' has infinite elements and the other set is not the empty set.<ref>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</ref>
| |
| | |
| == Cartesian square and Cartesian power ==
| |
| The '''Cartesian square''' (or '''binary Cartesian product''') of a set ''X'' is the Cartesian product {{nowrap|1=''X''<sup>2</sup> = ''X'' × ''X''}}.
| |
| An example is the 2-dimensional [[plane (mathematics)|plane]] {{nowrap|1='''R'''<sup>2</sup> = '''R''' × '''R'''}} where '''R''' is the set of [[real number]]s – all points {{nowrap|(''x'',''y'')}} where ''x'' and ''y'' are real numbers (see the [[Cartesian coordinate system]]).
| |
| | |
| == Higher powers of a set ==
| |
| | |
| The '''cartesian power''' of a [[Set (mathematics)|set]] ''X'' 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 all} \ 1 \le i \le n \}.</math>
| |
| | |
| An example of this is {{nowrap|1='''R'''<sup>3</sup> = '''R''' × '''R''' × '''R'''}}, with '''R''' again the set of real numbers, and more generally '''R'''<sup>''n''</sup>.
| |
| | |
| == Generalized powers from different sets ==
| |
| | |
| === <var>n</var>-ary product ===
| |
| | |
| The Cartesian product can be generalized to the '''''n''-ary Cartesian product''' over ''n'' sets ''X''<sub>1</sub>, ..., ''X<sub>n</sub>'': | |
| | |
| :<math>X_1\times\cdots\times X_n = \{(x_1, \ldots, x_n) : x_i \in X_i \}.</math>
| |
| | |
| It is a set of [[tuple|''n''-tuple]]s. If tuples are defined as [[Tuple#Tuples_as_nested_ordered_pairs|nested ordered pairs]], it can be identified to {{nowrap|(''X''<sub>1</sub> × ... × ''X<sub>n−1</sub>'') × ''X<sub>n</sub>''}}.
| |
| | |
| The ''n''-ary cartesian power of a set ''X'' is [[isomorphism|isomorphic]] to the space of [[function (mathematics)|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 [[Infinity|infinite]]) [[indexed family]] of sets. If ''I'' is any [[index set]], and <math>\left\{X_i\,|\,i\in I\right\}</math> is a collection of sets indexed by ''I'', then the Cartesian product of the sets in ''X'' is defined to be
| |
| | |
| :<math>\prod_{i \in I} X_i = \left\{ f : I \to \bigcup_{i \in I} X_i\ \Big|\ (\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 (mathematics)|projection map]]'''.
| |
| | |
| An important 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 [[Euclidean vector|vector]] with countably infinite real number components. This set is frequently denoted <math>\mathbb{R}^\omega</math>, or <math>\mathbb{R}^{\mathbb{N}}</math>.
| |
| | |
| The special case '''Cartesian exponentiation''' occurs when all the factors ''X<sub>i</sub>'' involved in the product 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]].
| |
| | |
| 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 {{nowrap|{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]].
| |
| | |
| == 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<ref>Osborne, M., and Rubinstein, A., 1994. ''A Course in Game Theory''. MIT Press.</ref> 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'', their '''Cartesian product''' {{nowrap|''f'' × ''g''}} is a function from {{nowrap|''A'' × ''X''}} to {{nowrap|''B'' × ''Y''}} with
| |
| :<math>(f\times g)(a, b) = (f(a), g(b)).</math>
| |
| | |
| This can be extended to [[tuple]]s and infinite collections of functions.
| |
| Note that this is different from the standard cartesian product of functions considered as sets.
| |
| | |
| == Definitions outside of Set theory ==
| |
| | |
| ===Category theory===
| |
| Although the Cartesian product is traditionally applied to sets, [[category theory]] provides a more general interpretation of the [[product (category theory)|product]] of mathematical structures. This is distinct from, although related to, the notion of a [[Cartesian square (category theory)|Cartesian square]] in category theory, which is a generalization of the [[fiber product]].
| |
| | |
| [[Exponential object|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 graphs|Cartesian product of two graphs]] ''G'' and ''H'' is the graph denoted by {{nowrap|''G'' × ''H''}} whose [[vertex (graph theory)|vertex]] set is the (ordinary) Cartesian product {{nowrap|''V''(''G'') × ''V''(''H'')}} and such that two vertices (''u'',''v'') and (''u''′,''v''′) are adjacent in {{nowrap|''G'' × ''H''}} if and only if {{nowrap|1=''u'' = ''u''′}} and ''v'' is adjacent with ''v''′ in ''H'', ''or'' {{nowrap|1=''v'' = ''v''′}} and ''u'' is adjacent with ''u''′ in ''G''. The Cartesian product of graphs is not a [[product (category theory)|product]] in the sense of category theory. Instead, the categorical product is known as the [[tensor product of graphs]].
| |
| | |
| ==See also==
| |
| * [[Exponential object]]
| |
| * [[Binary relation]]
| |
| * [[Coproduct]]
| |
| * [[Empty product]]
| |
| * [[Product (category theory)]]
| |
| * [[Product topology]]
| |
| * [[Finitary relation]]
| |
| * [[Ultraproduct]]
| |
| * [[Product type]]
| |
| * [[Euclidean space]]
| |
| * [[total order#Orders on the Cartesian product of totally ordered sets|orders on '''R'''<sup>''n''</sup>]]
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| | |
| ==External links==
| |
| * [http://www.apronus.com/provenmath/cartesian.htm Cartesian Product at ProvenMath]
| |
| * {{springer|title=Direct product|id=p/d032730}}
| |
| * [http://education-portal.com/academy/lesson/how-to-find-the-cartesian-product.html How to find the Cartesian Product, Education Portal Academy]
| |
| {{Set theory}}
| |
| | |
| [[Category:Basic concepts in set theory]]
| |
| [[Category:Binary operations]]
| |
| [[Category:Axiom of choice]]
| |