Understanding Cartesian Product in Mathematics
Translated by
ScribdTranslationsUnderstanding Cartesian Product in Mathematics
Translated by
ScribdTranslationsJob Title:
Cartesian product
Jordi Julián Villa Aragón
University of La Guajira
Program: systems engineering
City (department):
Maicao (La Guajira)
27/11/2020
Cartesian product
Inmathematicsthe Cartesian product of twosetsit is aoperation, which results in another set,
whoseelementsthey are all theordered pairsthat can be formed so that the first element of
the first element belongs to the first set and the second element belongs to the second set.
The Cartesian product gets its name fromRené Descartes, whose formulation of theanalytical geometrygod
origin to this concept.
Definition of Cartesian Product
Before delving into the establishment of the meaning of Cartesian product, it is necessary to
it is necessary for us to determine the etymological origin of the two words that give it
shape:
Product derives from Latin, from 'productus', which is equivalent to 'produced' and is the result of the
sum of the prefix 'pro-', synonymous with 'forward', and the adjective 'ductus', which can be translated
like "guided".
Cartesian, for its part, comes from 'Cartesius' which was the Latin name of the French philosopher René
Descartes, who was the one who shaped Cartesianism or Cartesian dualism. This doctrine or
the ideology aimed to establish, among many other things, that the human being was
composed of two substances: the extensive and the thinking.
The notion of Cartesian product is used in the field ofmathematics, more
precisely in the field ofalgebraThe cartesian product reveals an order relation
between two sets, constituting a third set.
The Cartesian product of a set A and a set B is the set consisting of
the totality of ordered pairs that have a first component in A and a second
component inB.
Let's see aexampleIf the set A is formed by the elements 3, 5, 7, and 9, while
the set Balberga the elements myr, the Cartesian product of both sets is the
next:
A x B = {(3,m), (3,r), (5,m), (5,r), (7,m), (7,r), (9,r), (9,r)}
The Cartesian product, therefore, is made up of all the ordered pairs that can be formed.
to form from two certain onessets. Each ordered pair consists of two elements:
the first element belongs to one set and the second element to the other. If we continue with
In our example, in the ordered pair (3, m), 3 is the first element (corresponds to set A).
you are the second element (belonging to set B).
It is important to establish, in addition to everything mentioned, that when we talk about products
Cartesian we have to refer to two cases or types of possible generalizations.
Thus, on one hand, there is the so-called finite case, which is one that starts from a finite number.
of sets (A1, A2, A3…An). Its Cartesian product would come to be the group of
numbered lists whose element is in A1, the second in A2...
The infinite case would be one in which, starting from a large family of sets with all the
infinite probability and of an arbitrary nature when defining the relevant Cartesian product
what is the definition of the mentioned numbered lists would be replaced by another.
Let's assume that in a house, there are three people (Carlos, Juany, and Antonia) and two books.
(Hopscotch and One Hundred Years of Solitude). The Cartesian product of both sets
(peopleybooks) will be made up of all possible distributions of the literary works among
the individuals.
Properties of the Cartesian product.
3.3.2.1A⊂ X∧ B⊂ Y⇔ A x B⊂ X x Y.
3.3.2.2A x B = 0⇔ A = 0∨ B = 0.
3.3.2.3A is not equal to B∧ A x B ≠ 0⇒ A x B ≠ B x A.
3.3.2.4A x (B • C) = (A x B)( A x C).
3.3.2.5A x (B + C) = (A x B) + (A x C).
Demonstration of [Link]:
Suppose that A x B = 0. Reasoning by contradiction, if A ≠ 0 and B ≠ 0; then
there exist elements a and b such that a∈ A and B∈ B. Then the couple (a,b)∈ A x B, in contradiction
with the hypothesis that A x B = 0.
Reciprocally, if A = 0, then A x B must be 0, because if it happens that A x B ≠ 0, there will exist (a, b)
∈ A x B then a∈ In contradiction to the assumption that A = 0.
Similarly, the reasoning applies in the case where B = 0.
Demonstration of [Link]: (x, y)∈ A x (B • C)⇔ x∈ A∧ y∈ B • C.⇔ x∈ A∧ ( y∈ B∧ y∈ C).
⇔ ( x∈A∧ y∈ B)∧ (x∈ A∧ y∈ C).⇔ (x, y)∈ A x B∧ (x, y)∈ A x C.⇔ (x, y)∈ (A x B) •
(A x C).
3.3.3 Number of elements of the Cartesian product. (Counting techniques). For sets
Given finite A and B:
| A x B | = | A| | B|.
Product rules.
For finite sets A1, A2,..., Ak, it has:
k
A1x A2x ... x An|= ∏ | Aj|
j=1
More generally, suppose that a set can be regarded as a
set of k-ordered tuples of the form (a 1, a2ak) with the following structure. There are
1possible elections of a1. Given to1, there is n2possible elections of a2Given to1y
a2there is n3possible elections of a3.
In general given to1, a2,..., aj-1 there are njpossible elections of ajSo the set
it has n1, n2,..., nkelements.
Example 5: Calculate the number of ways to select five cards with replacement from a
deck of 52 cards.
Solution: In this problem, ordered quintets of playing cards must be considered.
replacement means that each card is returned to the deck before drawing a new card. The
the set of ways to select 5 cards with replacement is in one-to-one correspondence
pro:
D x D x D x D x D = D5.
Where D is the set of cards with 52 elements. Therefore, the set of cards has
525elements.
Example 6: Calculate the number of ways to select five cards without replacement from a
deck of 52 cards.
Solution: This time the product rule cannot be applied since not all are allowed.
the quintillas arranged in D5Specifically, quintillas where repetition occurs are prohibited.
a letter. However, it is possible to reason in the following way: The first letter can
select from 52 ways. Once selected, the second card can be chosen from 51
ways. The third card can be chosen in 50 ways, the fourth in 49, and the fifth in 48. From
In this way, you can choose 5 cards without replacement from 52 • 51 • 50 • 49 • 48 different ways.