Cartesian product

format_list_bulleted Contenido keyboard_arrow_down
ImprimirCitar
Cartesian product of assemblies

In mathematics, the Cartesian product of two sets is an operation, which results in another set, whose elements are all the ordered pairs that can be formed such that the first element of the ordered pair belongs to the set. first set and the second element belongs to the second set.

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

Example

For example, given the sets:

A={1,2,3,4!{displaystyle A={1,2,3,4}

and

B={a,b!{displaystyle B={a,b}

your cartesian product of A times B is:

b(1,b)(2,b)(3,b)(4,b)a(1,a)(2,a)(3,a)(4,a)A× × B1234{displaystyle {begin{array}{rącccccc}b hypo(1,b)}{(2,b) hypo(2,b)}{(3,b)}{,b)}{b)}{b}{b}{b) age(3,b) alien(3,b) age(3,b) age(4,b)}{b) age(4, b\\times b\\pos(4,b) age(4, b}{\\pos(4}{pos(4}{pos(4}{pos(4b)}{\pos(4}{\pos(4}{\b) ages b}{\\pos(4}{b) ages b}{pos(4}{b)}{\pos(4}{\\pos(4}{b)}{array}{b)}{array}{b)}{array}{\b)}{\b)}{

what is rendered:

A× × B={(1,a),(1,b),(2,a),(2,b),(3,a),(3,b),(4,a),(4,b)!{displaystyle Atimes B={(1,a),(1,b),(2,a),(2,b),(3,a),(3,b),(4,a),(4,b)}

and the Cartesian product of B times A is:

4(a,4)(b,4)3(a,3)(b,3)2(a,2)(b,2)1(a,1)(b,1)B× × Aab{displaystyle {begin{array}{rącc}4 nightmare(a,4)}{(b,4)3}{3}{3}{a,32}{2}{b,}{1}{1}{1}{1}{b,}{3}{3}{b,}{b,}}{b,}}{b,}}{b,}{b

what is rendered:

B× × A={(a,1),(a,2),(a,3),(a,4),(b,1),(b,2),(b,3),(b,4)!{displaystyle Btimes A={(a,1),(a,2),(a,3),(a,4),(b,1),(b,2),(b,3),(b,4)}}

See that:

(1,a)I was. I was. (a,1){displaystyle (1,a)neq (a,1)}

Since they are ordered pairs.

Definition

Is a collection of two distinguished objects as first and second, and is denoted as (a, b), where a is the "first element" and b the “second element”. Given two sets A and B, their Cartesian product is the set of all ordered pairs that can be formed with these two sets:

The Cartesian product of A and B is the whole A × B whose elements are the ordered pairs (a, b)Where a is an element of A and b an element of B:

A× × B={(a,b):a한 한 Aandb한 한 B!{displaystyle Atimes B={(a,b):ain A;{text{y}}{;;bin B}}}}

The Cartesian square of a set can then be defined as A2 = A × A.

The whole Z2 can be visualized as the set of points in the plane whose coordinates are integers.

Examples

Integer numbers

Let also be the set of all integers Z = {..., −2, −1, 0, +1, +2,...}. The Cartesian product of Z with itself is Z2 = Z × Z = { (0,0), (0, +1), (0, −1), (0, +2),..., (+1, 0),... (−1, 0),... }, that is, the set of ordered pairs whose components are integers. To represent the integers, the number line is used, and to represent the set Z2, a Cartesian plane is used (in the image).

Painting and brushes

Let the sets be T of paint tubes, and P of brushes:

T={{displaystyle T={{,}Correspon T0.svg, Correspon T1.svg, Correspon T2.svg, Correspon T3.svg!{displaystyle},}
P={{displaystyle P={{,}Correspon P0.svg, Correspon P1.svg, Correspon P2.svg, Correspon P3.svg, Correspon P4.svg!{displaystyle},}

The Cartesian product of these two sets, T × P, contains all possible pairings of paint tubes and brushes. Similar to the case of a Cartesian plane in the previous example, this set can be represented by a table:

Correspon P4.svgCorresCartesi 40.svgCorresCartesi 41.svgCorresCartesi 42.svgCorresCartesi 43.svg
Correspon P3.svgCorresCartesi 30.svgCorresCartesi 31.svgCorresCartesi 32.svgCorresCartesi 33.svg
Correspon P2.svgCorresCartesi 20.svgCorresCartesi 21.svgCorresCartesi 22.svgCorresCartesi 23.svg
Correspon P1.svgCorresCartesi 10.svgCorresCartesi 11.svgCorresCartesi 12.svgCorresCartesi 13.svg
Correspon P0.svgCorresCartesi 00.svgCorresCartesi 01.svgCorresCartesi 02.svgCorresCartesi 03.svg
Correspon T0.svgCorrespon T1.svgCorrespon T2.svgCorrespon T3.svg

Properties

The empty set acts as the zero of the Cartesian product, since it does not have elements to build ordered pairs:

A Cartesian product where some factor is the empty set is empty. In particular:

A× × ∅ ∅ =∅ ∅ × × A=∅ ∅ {displaystyle Atimes varnothing =varnothing times A=varnothing }

The Cartesian product of two sets is not commutative in general, except in very special cases. The same goes for the associative property.

Generally:

A× × BI was. I was. B× × A,A× × (B× × C)I was. I was. (A× × B)× × C{displaystyle Atimes Bneq Btimes Aquadquad Atimes (Btimes C)neq (Atimes B)times C}

Since the cartesian product can be represented as a table or a cartesian plane, it is easy to see that the product set is the product of the cardinals of each factor:

  • The Cartesian product of a finite number of finite sets is finite in turn. In particular, its cardinal is the product of the cardinals of each factor:

日本語A1× × ...... × × An日本語=日本語A1日本語⋅ ⋅ ...... ⋅ ⋅ 日本語An日本語{displaystyle 日本語A_{1}times ldots times A_{n}You have to do it.

  • The Cartesian product of a family of non-empty assemblies that includes some infinite set is infinite in turn.

In set theory, the previous formula of the cardinal of the Cartesian product as the product of the cardinals of each factor, still holds true using infinite cardinals.

Generalizations

Finite case

Given a finite number of sets A1, A 2,..., An, its Cartesian product is defined as the set n-tuples whose first element is in A1, whose second element is in A2, etc.

Cartesian product of a finite number of sets A1,... An is the set of n-tuplas whose element k- that belongs to Akfor each 1 ≤ kn:

A1× × ...... × × An={(a1,...... ,an):a1한 한 A1,...... ,an한 한 An!{displaystyle A_{1}times ldots times A_{n}={(a_{1},ldotsa_{n}):a_{1}in A_{1},,ldots,a_{n}in A_{n}}}}

We can then define Cartesian powers of order higher than 2, as A3 = A × A × A, etc. Depending on the definition of n-tuple that is adopted, this generalization can be built from the basic definition as:

A1× × ...... × × An=A1× × (A2× × (...... × × An)...... ){displaystyle A_{1}times ldots times A_{n}=A_{1}times (A_{2}times (ldots times A_{n})ldots}}}

or similar constructs.

Infinite case

In the case of an arbitrary (possibly infinite) family of sets, the way to define the Cartesian product is to change the tuple concept to a more comfortable one. If the family is indexed, an application traversing the index set is the object that distinguishes who is the "kth entry":

The Cartesian product of an indexed family of sets F =Ai!i I is the set of applications f: I F whose domain is the index set I and their images are elements of some Aiwho fulfill that for each i I Got it. f(i) Ai:

i한 한 IAi={f:I→ → F日本語for eachi한 한 I,f(i)한 한 Ai!{displaystyle prod _{iin I}A_{i}=left{f:Ito bigcup F Δ{text{ every }iin I,f(i)in A_{i}right}}}

where F denotes the union of all Ai. Given a j I, the projection onto the j coordinate is the map:

π π j: i한 한 IAi→ → Aj,π π j(f)=f(j){displaystyle pi _{j}:prod _{iin I}A_{i}to A_{j} pi _{j}(f)=f(j)}

In the case of a finite family of sets {A1,..., A n} indexed by the set In = {1,..., n}, depending on the definition of n-tuple adopted, or the applications f: Ini Ai of the previous definition are precisely n-tuples, or there is a natural identification between both objects; Therefore, the previous definition can be considered as the most general.

Unlike the finite case, however, the existence of such applications is not justified by the most basic hypotheses of set theory. These maps are in fact choice functions whose existence can only be shown in general if the axiom of choice is assumed. In fact, the existence of choice functions (when all members of F are non-empty) is equivalent to such an axiom.

Contenido relacionado

Topological space

A topological space is a mathematical structure that allows the formal definition of concepts such as convergence, connectivity, continuity, and neighborhood...

Complementary angles

The complementary angles are those angles whose measures add up to 90 sexagesimal degrees, that is, if two complementary angles are in turn consecutive, their...

Infinite

The concept of infinity appears in various branches of mathematics, philosophy and astronomy, in reference to a quantity without limit or without end, as...
Más resultados...
Tamaño del texto:
undoredo
format_boldformat_italicformat_underlinedstrikethrough_ssuperscriptsubscriptlink
save