If \(U=\{1, 2, 3, 4, 5, 6, 7, 8, 9\}, \ A=\{2, 4, 6, 8\}\) and \(B=\{ 2, 3, 5, 7\}.\) Verify that \( (A \cap B)' = A' \cup B'\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you have a bag of numbered balls from 1 to 9. Set A holds the even ones and Set B holds some others. Finding what is NOT in both groups together is like picking out the balls left on the table. De Morgan's Law says two different ways of doing this always give the same leftover balls. One way starts from the middle, the other starts from the edges. Both roads lead to the same place — the numbers \( \{1, 3, 4, 5, 6, 7, 8, 9\} \).
Answer: Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.
The complement of a set contains all elements of the universal set that are NOT in that set. De Morgan's laws connect complements with union and intersection. The law we are verifying here says that the complement of an intersection equals the union of the complements. To verify it, we compute the left-hand side \( (A \cap B)' \) and the right-hand side \( A' \cup B' \) separately, then check that both give the same set. Here the universal set is \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \).
De Morgan's Law: \[(A \cap B)' = A' \cup B'\] where for any set \( X \), the complement is \( X' = U \setminus X \).
Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.
A common mistake is to wrongly write \( (A \cap B)' = A' \cap B' \). Remember that under De Morgan's law the intersection becomes a union: the complement of an intersection is the UNION of the complements, not the intersection.
Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.
One common mistake: Students sometimes compute \( A \cup B \) instead of \( A \cap B \) when finding the left-hand side, or they forget to take the complement of the result, leading to an incorrect LHS that will never match the RHS.
Answer: Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), \( A = \{1, 3, 5, 7, 9\} \) and \( B = \{1, 2, 3, 4, 5\} \). Verify that \( (A \cap B)' = A' \cup B' \).
Solution: Step 1: Find \( A \cap B \). \[ A \cap B = \{1, 3, 5\} \] Step 2: Find the complement of \( A \cap B \) with respect to \( U \). \[ (A \cap B)' = U \setminus (A \cap B) = \{2, 4, 6, 7, 8, 9, 10\} \] Step 3: Find \( A' \) and \( B' \). \[ A' = U \setminus A = \{2, 4, 6, 8, 10\} \] \[ B' = U \setminus B = \{6, 7, 8, 9, 10\} \] Step 4: Find \( A' \cup B' \). \[ A' \cup B' = \{2, 4, 6, 8, 10\} \cup \{6, 7, 8, 9, 10\} = \{2, 4, 6, 7, 8, 9, 10\} \] Step 5: Compare both sides. Left-hand side: \( (A \cap B)' = \{2, 4, 6, 7, 8, 9, 10\} \) Right-hand side: \( A' \cup B' = \{2, 4, 6, 7, 8, 9, 10\} \) Since both sides are equal, De Morgan's Law is verified.
Answer: \( (A \cap B)' = A' \cup B' = \{2, 4, 6, 7, 8, 9, 10\} \)
Question: Let \( U = \{a, b, c, d, e, f, g, h\} \), \( P = \{a, c, e, g\} \) and \( Q = \{b, c, d, e, f\} \). Verify that \( (P \cap Q)' = P' \cup Q' \).
Solution: Step 1: Find \( P \cap Q \). \[ P \cap Q = \{c, e\} \] Step 2: Find the complement of \( P \cap Q \) with respect to \( U \). \[ (P \cap Q)' = U \setminus (P \cap Q) = \{a, b, d, f, g, h\} \] Step 3: Find \( P' \) and \( Q' \). \[ P' = U \setminus P = \{b, d, f, h\} \] \[ Q' = U \setminus Q = \{a, g, h\} \] Step 4: Find \( P' \cup Q' \). \[ P' \cup Q' = \{b, d, f, h\} \cup \{a, g, h\} = \{a, b, d, f, g, h\} \] Step 5: Compare both sides. Left-hand side: \( (P \cap Q)' = \{a, b, d, f, g, h\} \) Right-hand side: \( P' \cup Q' = \{a, b, d, f, g, h\} \) Since both sides are equal, De Morgan's Law is verified.
Answer: \( (P \cap Q)' = P' \cup Q' = \{a, b, d, f, g, h\} \)
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), \( A = \{1, 3, 5, 7, 9\} \), and \( B = \{2, 3, 4, 5, 6\} \). Verify that \( (A \cup B)' = A' \cap B' \).
Answer: Both sides equal \( \{8, 10\} \), hence \[(A \cup B)' = A' \cap B'\] is verified.