SOLVER7 Study. Nothing Else.
Exercise 1.5 Q4(i)

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Verifying De Morgan's Law: (A ∪ B)′ = A′ ∩ B′

Detailed Explanation

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.

Formula Used

De Morgan's first law: \[(A \cup B)' = A' \cap B'\] where \( A' = U \setminus A \).

Solution

  1. Step 1: Write down the given sets. \[U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}\] \[A = \{2, 4, 6, 8\}, \quad B = \{2, 3, 5, 7\}\]
  2. Step 2: Find \( A \cup B \) by collecting every element that is in A or in B (list each element only once). \[A \cup B = \{2, 3, 4, 5, 6, 7, 8\}\]
  3. Step 3: Find the left-hand side \( (A \cup B)' \) by removing all elements of \( A \cup B \) from \( U \). The elements left are those in U but not in \( A \cup B \). \[(A \cup B)' = \{1, 9\}\]
  4. Step 4: Now find the complements separately. \( A' \) is U with the elements of A removed. \[A' = \{1, 3, 5, 7, 9\}\] Similarly \( B' \) is U with the elements of B removed. \[B' = \{1, 4, 6, 8, 9\}\]
  5. Step 5: Find the right-hand side \( A' \cap B' \) by taking only the elements common to both \( A' \) and \( B' \). The common elements are 1 and 9. \[A' \cap B' = \{1, 9\}\]
  6. Step 6: Compare both sides. \[(A \cup B)' = \{1, 9\} = A' \cap B'\] Since the left-hand side equals the right-hand side, the law is verified.

Final Answer

Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Record the given sets clearly: \[U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}\] \[A = \{2, 4, 6, 8\}, \quad B = \{2, 3, 5, 7\}\] — Reason: Having all three sets written out makes it easy to spot which elements belong where without confusion later.
  2. Step 2: Compute the union \( A \cup B \) by listing every element that appears in \( A \) or \( B \) or both, writing each element only once: \[A \cup B = \{2, 3, 4, 5, 6, 7, 8\}\] — Reason: We need \( A \cup B \) before we can find its complement on the left-hand side.
  3. Step 3: Find the left-hand side \( (A \cup B)' \) by removing every element of \( A \cup B \) from \( U \). The elements 1 and 9 are the only ones in \( U \) that do not appear in \( A \cup B \): \[(A \cup B)' = \{1, 9\}\] — Reason: By definition, the complement keeps only the elements of \( U \) that are not in the given set.
  4. Step 4: Determine \( A' \) by removing all elements of \( A \) from \( U \): \[A' = \{1, 3, 5, 7, 9\}\] — Reason: We need the individual complements to evaluate the right-hand side \( A' \cap B' \).
  5. Step 5: Determine \( B' \) by removing all elements of \( B \) from \( U \): \[B' = \{1, 4, 6, 8, 9\}\] — Reason: Both complements must be ready before we can intersect them.
  6. Step 6: Find the right-hand side \( A' \cap B' \) by keeping only the elements that appear in both \( A' \) and \( B' \). Comparing the two lists, the shared elements are 1 and 9: \[A' \cap B' = \{1, 9\}\] — Reason: Intersection retains only the common elements, which is exactly what De Morgan's law predicts should match \( (A \cup B)' \).
  7. Step 7: Compare the two sides: Left-hand side \( (A \cup B)' = \{1, 9\} \) and right-hand side \( A' \cap B' = \{1, 9\} \). Since both sides are identical, the law is verified: \[(A \cup B)' = A' \cap B'\] — Reason: Verification requires showing that LHS and RHS produce exactly the same set.

Final Answer

Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[U = \{1,2,3,4,5,6,7,8,9\}, \quad A = \{2,4,6,8\}, \quad B = \{2,3,5,7\}\]
  2. Step 2: LHS: \[A \cup B = \{2,3,4,5,6,7,8\} \implies (A \cup B)' = \{1,9\}\]
  3. Step 3: RHS: \[A' = \{1,3,5,7,9\}, \quad B' = \{1,4,6,8,9\} \implies A' \cap B' = \{1,9\}\]

Answer: Both sides equal \( \{1, 9\} \), so \( (A \cup B)' = A' \cap B' \) is verified.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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

  1. Step 1: Find A ∪ B: Combine all elements that belong to either A or B (without repetition). \[ A \cup B = \{1, 2, 3, 5, 6, 7, 9, 10\} \]
  2. Step 2: Find (A ∪ B)' — the Left-Hand Side: The complement of \( A \cup B \) consists of all elements in U that are NOT in \( A \cup B \). \[ (A \cup B)' = U \setminus (A \cup B) = \{4, 8\} \]
  3. Step 3: Find A': The complement of A consists of all elements in U that are NOT in A. \[ A' = U \setminus A = \{2, 4, 6, 8, 10\} \]
  4. Step 4: Find B': The complement of B consists of all elements in U that are NOT in B. \[ B' = U \setminus B = \{1, 4, 5, 8, 9\} \]
  5. Step 5: Find A' ∩ B' — the Right-Hand Side: The intersection of A' and B' consists of all elements common to both A' and B'. \[ A' \cap B' = \{2, 4, 6, 8, 10\} \cap \{1, 4, 5, 8, 9\} = \{4, 8\} \]
  6. Step 6: Compare Both Sides: We have obtained: Left-Hand Side: \( (A \cup B)' = \{4, 8\} \) Right-Hand Side: \( A' \cap B' = \{4, 8\} \) Since both sides are equal, De Morgan's Law \( (A \cup B)' = A' \cap B' \) is verified.

Answer: Both sides equal \( \{4, 8\} \), so \( (A \cup B)' = A' \cap B' \) is verified.

Everything you get with Solver7

More questions in Sets