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

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

Solution

👶 Simple Explanation

Simple Explanation

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.

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

Detailed Explanation

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\} \).

Formula Used

De Morgan's Law: \[(A \cap B)' = A' \cup B'\] where for any set \( X \), the complement is \( X' = U \setminus X \).

Solution

  1. Step 1: Write down the given sets: We are given \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \), \( A = \{2, 4, 6, 8\} \) and \( B = \{2, 3, 5, 7\} \). We will use these throughout.
  2. Step 2: Find A ∩ B (for the left side): The intersection contains elements common to both \( A \) and \( B \). The only common element is \( 2 \). So \[A \cap B = \{2\}.\]
  3. Step 3: Find (A ∩ B)' — the left-hand side: The complement contains all elements of \( U \) that are not in \( A \cap B = \{2\} \). Removing \( 2 \) from \( U \) gives \[(A \cap B)' = \{1, 3, 4, 5, 6, 7, 8, 9\}.\]
  4. Step 4: Find A' (for the right side): The complement of \( A \) contains all elements of \( U \) not in \( A = \{2, 4, 6, 8\} \). So \[A' = \{1, 3, 5, 7, 9\}.\]
  5. Step 5: Find B': The complement of \( B \) contains all elements of \( U \) not in \( B = \{2, 3, 5, 7\} \). So \[B' = \{1, 4, 6, 8, 9\}.\]
  6. Step 6: Find A' ∪ B' — the right-hand side: The union collects all elements appearing in \( A' \) or \( B' \) (without repeating). Combining \( A' = \{1, 3, 5, 7, 9\} \) and \( B' = \{1, 4, 6, 8, 9\} \) gives \[A' \cup B' = \{1, 3, 4, 5, 6, 7, 8, 9\}.\]
  7. Step 7: Compare both sides: The left-hand side is \( (A \cap B)' = \{1, 3, 4, 5, 6, 7, 8, 9\} \) and the right-hand side is \( A' \cup B' = \{1, 3, 4, 5, 6, 7, 8, 9\} \). Since both sets are identical, the law is verified.

Final Answer

Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Record all given sets clearly: \( U = \\{1, 2, 3, 4, 5, 6, 7, 8, 9\\} \), \( A = \\{2, 4, 6, 8\\} \), and \( B = \\{2, 3, 5, 7\\} \). — Reason: Having all sets written explicitly prevents errors when picking common or missing elements in later steps.
  2. Step 2: Find \( A \cap B \) by listing only elements that appear in BOTH \( A \) and \( B \). Checking each element of \( A \): 2 is in \( B \), 4 is not, 6 is not, 8 is not. Therefore \[A \cap B = \\{2\\}.\] — Reason: We need \( A \cap B \) first because the left-hand side \( (A \cap B)' \) requires it.
  3. Step 3: Compute the left-hand side \( (A \cap B)' \) by removing the elements of \( A \cap B = \\{2\\} \) from \( U \). Removing 2 from \( \\{1, 2, 3, 4, 5, 6, 7, 8, 9\\} \) gives \[(A \cap B)' = \\{1, 3, 4, 5, 6, 7, 8, 9\\}.\] — Reason: This is the left-hand side (LHS) of De Morgan's Law; we will compare it with the right-hand side at the end.
  4. Step 4: Find \( A' \) by removing elements of \( A = \\{2, 4, 6, 8\\} \) from \( U \). Elements remaining in \( U \) are 1, 3, 5, 7, 9. Therefore \[A' = \\{1, 3, 5, 7, 9\\}.\] — Reason: We need \( A' \) as the first part of the right-hand side \( A' \cup B' \).
  5. Step 5: Find \( B' \) by removing elements of \( B = \\{2, 3, 5, 7\\} \) from \( U \). Elements remaining in \( U \) are 1, 4, 6, 8, 9. Therefore \[B' = \\{1, 4, 6, 8, 9\\}.\] — Reason: We need \( B' \) as the second part of the right-hand side \( A' \cup B' \).
  6. Step 6: Compute the right-hand side \( A' \cup B' \) by combining all elements that appear in \( A' = \\{1, 3, 5, 7, 9\\} \) or \( B' = \\{1, 4, 6, 8, 9\\} \) (or both), without repetition: \[A' \cup B' = \\{1, 3, 4, 5, 6, 7, 8, 9\\}.\] — Reason: The union collects every element from either set, giving us the complete right-hand side to compare against the LHS.
  7. Step 7: Compare LHS and RHS: Left-hand side is \( (A \cap B)' = \\{1, 3, 4, 5, 6, 7, 8, 9\\} \) and right-hand side is \( A' \cup B' = \\{1, 3, 4, 5, 6, 7, 8, 9\\} \). Since both sets are identical, the law is verified. — Reason: Verification requires showing both sides produce exactly the same set, element by element.

Final Answer

Both sides equal \( \{1, 3, 4, 5, 6, 7, 8, 9\} \), hence \[(A \cap B)' = A' \cup B'\] is verified.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \), \( A = \{2, 4, 6, 8\} \), \( B = \{2, 3, 5, 7\} \)
  2. Step 2: LHS: \( A \cap B = \{2\} \), so \( (A \cap B)' = \{1, 3, 4, 5, 6, 7, 8, 9\} \)
  3. Step 3: RHS: \( A' = \{1, 3, 5, 7, 9\} \), \( B' = \{1, 4, 6, 8, 9\} \), so \( A' \cup B' = \{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.

➕ 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 = \{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\} \)

Example 2

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\} \)

🎯 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, 4, 5, 6\} \). 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, 4, 5, 6, 7, 9\}\]
  2. Step 2: Find (A ∪ B)' — the Left-Hand Side: The complement of \( A \cup B \) contains all elements in \( U \) that are NOT in \( A \cup B \). Since \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \) and \( A \cup B = \{1, 2, 3, 4, 5, 6, 7, 9\} \), we get: \[(A \cup B)' = \{8, 10\}\]
  3. Step 3: Find A': The complement of A contains all elements in U not in A. Since \( A = \{1, 3, 5, 7, 9\} \): \[A' = \{2, 4, 6, 8, 10\}\]
  4. Step 4: Find B': The complement of B contains all elements in U not in B. Since \( B = \{2, 3, 4, 5, 6\} \): \[B' = \{1, 7, 8, 9, 10\}\]
  5. Step 5: Find A' ∩ B' — the Right-Hand Side: The intersection of \( A' \) and \( B' \) contains only elements common to both: \[A' \cap B' = \{2, 4, 6, 8, 10\} \cap \{1, 7, 8, 9, 10\} = \{8, 10\}\]
  6. Step 6: Compare LHS and RHS: We have found: LHS: \( (A \cup B)' = \{8, 10\} \) RHS: \( A' \cap B' = \{8, 10\} \) Since LHS = RHS, De Morgan's Law is verified.

Answer: Both sides equal \( \{8, 10\} \), hence \[(A \cup B)' = A' \cap B'\] is verified.

Everything you get with Solver7

More questions in Sets