Table of Contents

Last modified on June 27th, 2024

The cartesian product of two or more sets is a set of all ordered pairs in which the first element comes from the first set and the next from the second.

If A and B are two sets, their cartesian product is written as A Ã— B. It is also called the cross-product.

In the set builder notation, A Ã— B is written as:

**A Ã— B = {(a,b) | a âˆˆ A, b âˆˆ B}**

Here, *a* belongs to set A, and *b* belongs to set B.

If A = {p, q, r} and B = {7, 8, 9} are two non-empty sets, then their cartesian product is:

A Ã— B = {(p, 7), (p, 8), (p, 9), (q, 7), (q, 8), (q, 9)}

Similarly, we can find the cartesian product of B Ã— A.

B Ã— A = {(7, p), (7, q), (7, r), (8, p), (8, q), (8, r), (9, p), (9, q), (9, r)}

Thus, in general, A Ã— B â‰ B Ã— A

If both sets are the same, A = B, then A Ã— B is called the cartesian square of set A, and it is written as A^{2}

**A**^{2}** = A Ã— A = {(a,b): a âˆˆ A, b âˆˆ A}**

Here, we also conclude that if A = B, then A Ã— B = B Ã— A

The cartesian product of any set and an empty set produces the empty set. If A is a set and É¸ is an empty set, then A Ã— É¸ = {(a, b) | a âˆˆ A, b âˆˆ É¸}

In general, the cartesian product of two sets results in an empty set if and only if either of the sets is null.

Symbolically, if A = É¸ or B = É¸, then A Ã— B = É¸

The cartesian product can be defined and extended to more than two sets. The cartesian product of more than two sets is a larger set containing every ordered pair of all the given set elements.

In the set builder notation, A Ã— B Ã— C is written as:

**A Ã— B Ã— C = {(a,b,c) | a âˆˆ A, b âˆˆ B, c âˆˆ C}**

If A = {5, 6}, B = {s, t}, and C = {g, h}, to find the cartesian product of A Ã— B Ã— C, we first find the cartesian product of A Ã— B followed by the (A Ã— B) Ã— C

A Ã— B = {(5, s), (5, t), (6, s), (6, t)}

Now, A Ã— B Ã— C = {(5, s), (5, t), (6, s), (6, t)} Ã— {g, h}

â‡’ A Ã— B Ã— C = {(5, s, g), (5, s, h), (5, t, g), (5, t, h), (6, s, g), (6, s, h), (6, t, g), (6, t, h)}

The cartesian product depends on the order of sets, and it is thus non-commutative.

If A and B are two sets, then **A Ã— B â‰ B Ã— A**

The cartesian product is not associative. If A, B, and C are three sets, then **(A Ã— B) Ã— C â‰ A Ã— (B Ã— C)**

**Intersection of Sets**

If A, B, and C are three sets, then according to the distributive property of the intersection of sets **A Ã— (B âˆ© C) = (A Ã— B) âˆ© (A Ã— C)**

**Union of Sets**

If A, B, and C are three sets, then according to the distributive property of the union of sets **A Ã— (B âˆª C) = (A Ã— B) âˆª (A Ã— C)**

The cardinality of the cartesian product of sets A and B is the total number of ordered pairs in A Ã— B.

If x is the number of elements in set A, and y is the number of elements in set B, then the cardinality of the Cartesian product of sets A and B is xy.

Mathematically, it is written as if n(A) = x, n(B) = y, then n(A Ã— B) = n(A) Ã— n(B) = xy.

Similarly, for n number of sets, n(A_{1}Ã—â€¦Ã— A_{n}) = n(A_{1}) Ã— â€¦ Ã— n(A_{n})

**Find the cartesian product of sets A and B. Given A = {1, 3, 7} and B = {4, 8}.**

Solution:

Thus, A Ã— B = {(1, 4), (1, 8), (3, 4), (3, 8), (7, 4), (7, 8)}

**Find D ^{2} when D = {c, g, k}.**

Solution:

Thus, D^{2} = {(c, c), (c, g), (c, k), (g, c), (g, g), (g, k), (k, c), (k, g), (k, k)}

Last modified on June 27th, 2024