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 \cup B)' = A' \cap B'\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine a big bag of numbered balls: 1 through 9. Two friends, A and B, each pick some balls. The 'complement' of a friend's group is simply the balls they did NOT pick. De Morgan's Law says something clever: if you look at all the balls neither friend picked, it is the same as finding what A did not pick AND what B did not pick together. Both ways of looking give you the same leftover balls — numbers 1 and 9 — which proves the law works.
Answer: Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.
The complement of a set \( A \), written \( A' \), contains all elements of the universal set \( U \) that are NOT in \( A \). De Morgan's first law states that the complement of a union equals the intersection of the complements. To verify it here, we compute the left-hand side \( (A \cup B)' \) and the right-hand side \( A' \cap B' \) separately, then check that both give the same set. The union \( A \cup B \) collects elements in A or B (or both), while the intersection \( A' \cap B' \) collects elements common to both complements.
De Morgan's first law: \[(A \cup B)' = A' \cap B'\] where \( A' = U \setminus A \).
Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.
A common mistake is writing \( (A \cup B)' = A' \cup B' \) instead of using intersection. De Morgan's law flips the operation: the complement of a union becomes the intersection of complements, not the union.
Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.
One common mistake: Students often forget to include ALL elements of \( U \) when listing a complement — they only check against one of the two sets instead of against \( U \) itself, causing them to miss elements that belong to the complement.
Answer: Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), \( A = \{1, 3, 5, 7, 9\} \) and \( B = \{2, 3, 6, 7, 10\} \). Verify that \( (A \cup B)' = A' \cap B' \).
Solution: We are given the universal set \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), \( A = \{1, 3, 5, 7, 9\} \), and \( B = \{2, 3, 6, 7, 10\} \). Step 1: Find \( A \cup B \). \[ A \cup B = \{1, 2, 3, 5, 6, 7, 9, 10\} \] Step 2: Find \( (A \cup B)' \), the complement of \( A \cup B \) with respect to \( U \). The elements in \( U \) but not in \( A \cup B \) are \( 4 \) and \( 8 \). \[ (A \cup B)' = \{4, 8\} \] Step 3: Find \( A' \), the complement of \( A \) with respect to \( U \). The elements in \( U \) but not in \( A \) are \( 2, 4, 6, 8, 10 \). \[ A' = \{2, 4, 6, 8, 10\} \] Step 4: Find \( B' \), the complement of \( B \) with respect to \( U \). The elements in \( U \) but not in \( B \) are \( 1, 4, 5, 8, 9 \). \[ B' = \{1, 4, 5, 8, 9\} \] Step 5: Find \( A' \cap B' \), the intersection of \( A' \) and \( B' \). The elements common to both \( A' \) and \( B' \) are \( 4 \) and \( 8 \). \[ A' \cap B' = \{4, 8\} \] Step 6: Compare both sides. We have \( (A \cup B)' = \{4, 8\} \) and \( A' \cap B' = \{4, 8\} \). Since both sides are equal, De Morgan's Law is verified: \[ (A \cup B)' = A' \cap B' \]
Answer: Both \( (A \cup B)' \) and \( A' \cap B' \) equal \( \{4, 8\} \), hence De Morgan's Law is verified.
Question: Let \( U = \{a, b, c, d, e, f, g, h\} \), \( P = \{a, c, e, g\} \) and \( Q = \{b, c, d, e\} \). Verify that \( (P \cap Q)' = P' \cup Q' \).
Solution: We are given the universal set \( U = \{a, b, c, d, e, f, g, h\} \), \( P = \{a, c, e, g\} \), and \( Q = \{b, c, d, e\} \). Step 1: Find \( P \cap Q \). The elements common to both \( P \) and \( Q \) are \( c \) and \( e \). \[ P \cap Q = \{c, e\} \] Step 2: Find \( (P \cap Q)' \), the complement of \( P \cap Q \) with respect to \( U \). The elements in \( U \) but not in \( P \cap Q \) are \( a, b, d, f, g, h \). \[ (P \cap Q)' = \{a, b, d, f, g, h\} \] Step 3: Find \( P' \), the complement of \( P \) with respect to \( U \). The elements in \( U \) but not in \( P \) are \( b, d, f, h \). \[ P' = \{b, d, f, h\} \] Step 4: Find \( Q' \), the complement of \( Q \) with respect to \( U \). The elements in \( U \) but not in \( Q \) are \( a, f, g, h \). \[ Q' = \{a, f, g, h\} \] Step 5: Find \( P' \cup Q' \), the union of \( P' \) and \( Q' \). Combining all elements from \( P' \) and \( Q' \) without repetition: \[ P' \cup Q' = \{a, b, d, f, g, h\} \] Step 6: Compare both sides. We have \( (P \cap Q)' = \{a, b, d, f, g, h\} \) and \( P' \cup Q' = \{a, b, d, f, g, h\} \). Since both sides are equal, De Morgan's second Law is verified: \[ (P \cap Q)' = P' \cup Q' \]
Answer: Both \( (P \cap Q)' \) and \( P' \cup Q' \) equal \( \{a, b, d, f, g, h\} \), hence De Morgan's Law is verified.
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), \( A = \{1, 3, 5, 7, 9\} \), and \( B = \{2, 3, 6, 7, 10\} \). Verify that \( (A \cup B)' = A' \cap B' \).
Answer: Both sides equal \( \{4, 8\} \), so \( (A \cup B)' = A' \cap B' \) is verified.