Let A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8}. Ve

1.	Let A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8}. Verify that : i. A x C B x D ii. A x (B ∩ C) = (A x B) ∩ (A x C)
Answer» Given : A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8} (i) To prove : A × C ⊂ B × D LHS : A × C = {(1, 5), (1, 6), (2, 5), (2, 6)} RHS : B × D = {(1, 5), (1, 6), (1, 7), (1, 8), (2, 5), (2, 6), (2, 7), (2, 8), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8)} Since, all elements of A × C is in B × D. ∴We can A × C ⊂ B × D (ii) To prove : A × (B ∩ C) = (A × B) ∩ (A × C) LHS : (B ∩ C) = ∅ A × (B ∩ C) = ∅ RHS : (A × B) = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 1), (2, 2), (2, 3), (2, 4)} (A × C) = {(1, 5), (1, 6), (2, 5), (2, 6)} Since, there is no common element between A × B and A × C ⇒ (A × B) ∩ (A × C) = ∅ ∴ LHS = RHS

Let A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8}. Verify that : i. A x C B x D ii. A x (B ∩ C) = (A x B) ∩ (A x C)

Answer»

Given : A = {1, 2}, B = {1, 2, 3, 4}, C = {5, 6} and D = {5, 6, 7, 8}

(i) To prove : A × C ⊂ B × D

LHS : A × C = {(1, 5), (1, 6), (2, 5), (2, 6)}

RHS : B × D = {(1, 5), (1, 6), (1, 7), (1, 8), (2, 5), (2, 6), (2, 7), (2, 8), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8)}

Since, all elements of A × C is in B × D.

∴We can A × C ⊂ B × D

(ii) To prove : A × (B ∩ C) = (A × B) ∩ (A × C)

LHS : (B ∩ C) = ∅

A × (B ∩ C) = ∅

RHS : (A × B) = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 1), (2, 2), (2, 3), (2, 4)}

(A × C) = {(1, 5), (1, 6), (2, 5), (2, 6)}

Since, there is no common element between A × B and A × C

⇒ (A × B) ∩ (A × C) = ∅

∴ LHS = RHS

Discussion

No Comment Found

Related InterviewSolutions

In fig. shows a relationship between the sets P and Q. Write this relation in :a. Set builder form b. Roster form c. What is its domain and range?
Let A = {1, 2, 3, 4, 5, 6}. Let R be a relation on A defined by R = {(a, b): a, b A, b is exactly divisible by a} i. Write R in roster form ii. Find the domain of R iii. Find the range of R.
Let `A = {1, 2, 3, 4, 6}`. Let R be the relation on A defined by `{(adot b): a , b in A , b`is exactly divisible by a}.(i) Write R in roster form(ii) Find the domain of R(iii) Find the range of R.
Let `A={1,2,3,5}" and "B={4,6,9}.` Define a relation from A to B, given by `R={(a,b):a inA,b inB" and "(a-b)" is odd"}.` (i) Write R in roster form. (ii) Find dom (R) and range (R).
Show that the relation R on the set Z of integers, given by R = {(a, b) : 2 divides a – b}, is an equivalence relation.
Let W denote the words in the English dictionary. Let the relation R be defined by R = {(x, y) ∈ W × W : the words x and y have at least one letter in common}. Then R is (a) Reflexive and transitive, not symmetric (b) Reflexive and symmetric and not transitive (c) Symmetric and transitive, not reflexive (d) Reflexive, symmetric and transitive
Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, the minimum number of ordered pairs which can be added to R to make it an equivalence relation is(a) 2 (b) 3 (c) 5 (d) 7
If R be a relation defined as a R b ⇔ | a | < b, then R is(a) Reflexive only (b) Symmetric only (c) Transitive only (d) Reflexive and transitive but not symmetric
Let I be the set of integers and R be a relation on I defined by R = {(x, y) : (x – y) is divisible by 11, x, y ∈ I}. Then R is(a) An equivalence relation (b) Symmetric only (c) Reflexive only (d) Transitive only
Let Z be the set of integers. Then the relation R = {(a, b) : a, b ∈ Z and (a + b) is even} defined on Z is(a) Only symmetric (b) Symmetric and transitive only (c) An equivalence relation (d) None of the above