Download Cartesian product exercise, college study notes - Cartesian product and more Exercises Calculus in PDF only on Docsity!
Cartesian Product (exercise)
Sunil Kumar Singh
This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License †
Note : The results of some of the questions (3 - 7) are of generic nature. As such, they can also be treated as theorems on Cartesian products.
1 Worked out exercises
Problem 1 : Cartesian product " A × B " consists of 6 elements. If three of these are (1,2), (2,3) and (3,3), then nd Cartesian product set " B × A ". Solution : We need to know two sets A and B in order to evaluate " B × A ". First elements of ordered pairs of " A × B " are elements of set A. Hence, 1,2 and 3 are the elements of set A. On the other hand, second elements of ordered pairs of AXB are elements of set B. Hence, 2 and 3 are elements of set B. Now, it is given that there are total 6 elements in the Cartesian product, which is equal to the product of numbers of elements in two sets i.e. 3 X 2. It means that we have identi ed all elements of sets A and B.
A = { 1 , 2 , 3 }
B = { 2 , 3 }
Following the rule for writing Cartesian product in terms of ordered pairs, we have :
⇒ B × A = {(1, 2) , (1, 3) , (2, 2) , (2, 3) , (3, 2) , (3, 3)}
Problem 2 : Two sets are given as : A = {1,2} and B = {3,4}. Find the total numbers of subsets of " A × B ". Also write power set of AXB in roaster form. Solution : The total numbers of elements in the Cartesian product " A × B " is pq, where p and q are the numbers of elements in the individual sets A and B respectively. The all possible subsets that can be formed including empty set and the product " A × B " itself is :
n = 2pq^ = 2^2 X^2 = 2^4 = 16 Now, the Cartesian product is : ∗Version 1.2: Aug 27, 2009 8:11 am GMT- †http://creativecommons.org/licenses/by/2.0/
⇒ A × B = {(1, 3) , (1, 4) , (2, 3) , (2, 4)}
The corresponding power set comprises of empty set, 4 sets with elements comprising of one element plus 6 sets with elements comprising of two elements taken at a time plus 4 sets with elements comprising of three elements taken at a time plus set itself. There are total of 16 subsets. The power set is set of all subsets as its elements :
⇒ P (A × B) = {φ, {(1, 3)}, {(1, 4)}, {(2, 3)}, {(2, 4)},
It is easy to follow a scheme to write combination in which order is not relevant. We can denote each of the ordered pair with a symbol like :
A × B = {a, b, c, d} As pointed out for generating combination for ordered pair, we can start with the left element and keep changing the last element of the combination till all combinations are exhausted. Here, power set in terms of symbols is :
P (A × B) = {φ, {a}, {b}, {c}, {d},
{(a, b) , {(a, c)}, {(a, d)}, {(b, c) , {(b, d)}, {(c, d)},
{(a, b, c)}, {(a, b, d)}, {(a, c, d)}, {(b, c, d)},
{(a, b, c, d)}}
Problem 3 : If " A ⊂ B " and "C" is any non-empty set, then prove that :
A × C ⊂ B × C Solution : Let us rst discuss the logic of the relation here. The elements of set A are common to set B. Now Cartesian product of set "A" with set C will yield ordered pairs, which are common with the ordered pairs of the Cartesian product "B" with "C". However, as set B is either larger than or equal to, but not smaller than A, it follows that above relation should hold. Now, we prove the relation analytically. Let an arbitrary ordered pair (x,y) belongs to Cartesian product " A × C ".
(x, y) ∈ A × C According to de nition of Cartesian product,
⇒ x ∈ A and y ∈ C
⇒ (x ∈ A and x ∈ C) and (y ∈ B and y ∈ D) Applying de nition of intersection,
⇒ (x ∈ A ∩ C) and (y ∈ B ∩ D) Again, applying de nition of Cartesian product,
⇒ (x, y) ∈ (A ∩ C) X (B ∩ D) This means that :
⇒ (A × B) ∩ (C × D) ⊂ (A ∩ C) × (B ∩ D) Similarly, starting from RHS, we can prove that :
⇒ (A ∩ C) × (B ∩ D) ⊂ (A × B) ∩ (C × D) If sets are subsets of each other, then they are equal. Hence,
⇒ (A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D)
Problem 6 : Let A and B be two non-empty sets. If the numbers of common elements be n between sets A and B, then nd the common elements between Cartesian products A × B and B × A . Solution : The common elements between sets A and B is n. This means :
n (A ∩ B) = n We are required to evaluate the expression,
n [(A × B) ∩ (B × A)] We have earlier seen that four given sets,
(A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D) If we put C = B and D = A in this equation, then expression on the left hand side of the equation becomes what is required.
⇒ (A × B) ∩ (B × A) = (A ∩ B) × (B ∩ A)
⇒ n [(A × B) ∩ (B × A)] = n [(A ∩ B)] × n [(B ∩ A)]
⇒ n [(A × B) ∩ (B × A)] = nXn = n^2
Problem 7 : Let A, B and C be three sets. Then prove that :
AX (B′ ∪ C′) ′ = (A × B) ∩ (A × C) Solution : From rst De-morgan's theorem, we know that :
(B ∪ C) ′ = B′ ∩ C′ Applying to the LHS, we have :
⇒ A × (B′ ∪ C′) ′ = A × [(B′) ′ ∩ (C′) ′] Now, component of complement set is set itself. Hence,
⇒ A × (B′ ∪ C′) ′ = A × (B ∩ C) Applying distributive property of product operator over intersection operator, we have :
⇒ A × (B′ ∪ C′) ′ = (A × B) ∩ (A × C)
Problem 8 : Let A, B and C be three sets. Then prove that :
AX (B′ ∩ C′) ′ = (A × B) ∪ (A × C) Solution : From second De-morgan's theorem, we know that :
(B ∩ C) ′ = B′ ∪ C′ Applying to the LHS, we have :
⇒ A × (B′ ∩ C′) ′ = A × [(B′) ′ ∪ (C′) ′] Now, component of complement set is set itself. Hence,
⇒ A × (B′ ∩ C′) ′ = A × (B ∪ C) Applying distributive property of product operator over union operator, we have :
⇒ A × (B′ ∩ C′) ′ = (A × B) ∪ (A × C)
