Show that \(A \cap B = A \cap C\) need not imply \(B = C.\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine two boxes, \( B \) and \( C \), each sharing some toys with a small bag \( A \). Both boxes give the same toys to bag \( A \). That does NOT mean the two boxes are identical — each box can have extra toys that bag \( A \) never sees. So when we check the overlap with \( A \), the hidden extras stay hidden. Two different sets can look the same when compared through \( A \), yet still be different from each other.
Answer: With \( A = \{1,2\} \), \( B = \{1,2,3\} \), \( C = \{1,2,4\} \), we get \( A \cap B = A \cap C = \{1,2\} \) but \( B \ne C \). Hence \( A \cap B = A \cap C \) need not imply \( B = C \).
In ordinary numbers, if \( a \cdot b = a \cdot c \) and \( a \ne 0 \), we can cancel \( a \) to get \( b = c \). Students often try to apply the same 'cancellation' idea to sets, expecting that \( A \cap B = A \cap C \) should give \( B = C \). But intersection only looks at the elements that are common to \( A \). Any element that lies OUTSIDE \( A \) is completely ignored by \( A \cap B \) and \( A \cap C \). So two different sets \( B \) and \( C \) can share exactly the same overlap with \( A \) while differing in elements that are not in \( A \). To prove that a statement 'need not' be true, we do not prove it in general — we only need to display ONE counterexample where the hypothesis holds but the conclusion fails.
\( A \cap B = \{ x : x \in A \text{ and } x \in B \} \)
With \( A = \{1,2\} \), \( B = \{1,2,3\} \), \( C = \{1,2,4\} \), we get \( A \cap B = A \cap C = \{1,2\} \) but \( B \ne C \). Hence \( A \cap B = A \cap C \) need not imply \( B = C \).
Treating intersection like number multiplication and 'cancelling' \( A \) to conclude \( B = C \). Cancellation is not valid for intersection because elements outside \( A \) are ignored; equal intersections only pin down the part of \( B \) and \( C \) that lies inside \( A \).
With \( A = \{1,2\} \), \( B = \{1,2,3\} \), \( C = \{1,2,4\} \), we get \( A \cap B = A \cap C = \{1,2\} \) but \( B \ne C \). Hence \( A \cap B = A \cap C \) need not imply \( B = C \).
One common mistake: students assume set intersection behaves like multiplication of numbers and try to 'cancel' \( A \) from both sides — but intersection only captures elements common with \( A \), so any elements of \( B \) or \( C \) that lie outside \( A \) are completely ignored, allowing \( B \) and \( C \) to differ without affecting the intersection.
Answer: With \( A = \{1,2\} \), \( B = \{1,2,3\} \), \( C = \{1,2,4\} \), we get \( A \cap B = A \cap C = \{1,2\} \) but \( B \ne C \). Hence \( A \cap B = A \cap C \) need not imply \( B = C \).
Question: Let \( A = \{2, 4, 6\} \), \( B = \{2, 4, 7, 9\} \), and \( C = \{2, 4, 11, 13\} \). Verify that \( A \cap B = A \cap C \) and yet \( B \ne C \), thereby showing that \( A \cap B = A \cap C \) does not imply \( B = C \).
Solution: Step 1: Compute \( A \cap B \). We need elements that belong to both \( A = \{2, 4, 6\} \) and \( B = \{2, 4, 7, 9\} \). \[ A \cap B = \{2, 4\} \] Step 2: Compute \( A \cap C \). We need elements that belong to both \( A = \{2, 4, 6\} \) and \( C = \{2, 4, 11, 13\} \). \[ A \cap C = \{2, 4\} \] Step 3: Compare the two intersections. Since \( A \cap B = \{2, 4\} \) and \( A \cap C = \{2, 4\} \), we have \[ A \cap B = A \cap C \] Step 4: Check whether \( B = C \). \( B = \{2, 4, 7, 9\} \) and \( C = \{2, 4, 11, 13\} \). The element \( 7 \in B \) but \( 7 \notin C \), so \[ B \ne C \] Conclusion: We have exhibited sets \( A \), \( B \), \( C \) for which \( A \cap B = A \cap C \) yet \( B \ne C \). The elements \( 7, 9 \) (in \( B \) but not in \( A \)) and \( 11, 13 \) (in \( C \) but not in \( A \)) do not affect the intersection with \( A \), so they remain hidden from the equation \( A \cap B = A \cap C \). This proves that \( A \cap B = A \cap C \) need not imply \( B = C \).
Answer: With \( A = \{2, 4, 6\} \), \( B = \{2, 4, 7, 9\} \), \( C = \{2, 4, 11, 13\} \): \( A \cap B = A \cap C = \{2, 4\} \) but \( B \ne C \), so the implication does not hold in general.
Question: Using the universal set \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \), let \( A = \{1, 3, 5\} \), \( B = \{1, 3, 5, 8, 10\} \), and \( C = \{1, 3, 5, 4, 6\} \). Show that \( A \cap B = A \cap C \) but \( B \ne C \).
Solution: Step 1: Compute \( A \cap B \). \( A = \{1, 3, 5\} \) and \( B = \{1, 3, 5, 8, 10\} \). Elements common to both: \[ A \cap B = \{1, 3, 5\} \] Step 2: Compute \( A \cap C \). \( A = \{1, 3, 5\} \) and \( C = \{1, 3, 5, 4, 6\} \). Elements common to both: \[ A \cap C = \{1, 3, 5\} \] Step 3: Verify \( A \cap B = A \cap C \). Both intersections equal \( \{1, 3, 5\} \), so \[ A \cap B = A \cap C \] Step 4: Check whether \( B = C \). \( B = \{1, 3, 5, 8, 10\} \) and \( C = \{1, 3, 5, 4, 6\} \). Since \( 8 \in B \) but \( 8 \notin C \), the sets differ: \[ B \ne C \] Observation: The sets \( B \) and \( C \) each contain \( A \) as a subset. Their extra elements — \( \{8, 10\} \) for \( B \) and \( \{4, 6\} \) for \( C \) — lie outside \( A \), so they contribute nothing to the intersection with \( A \). This is precisely why the equality of intersections does not force \( B = C \). Conclusion: The example confirms that \( A \cap B = A \cap C \) is possible even when \( B \ne C \), so the statement \( A \cap B = A \cap C \Rightarrow B = C \) is false in general.
Answer: With \( A = \{1, 3, 5\} \), \( B = \{1, 3, 5, 8, 10\} \), \( C = \{1, 3, 5, 4, 6\} \): \( A \cap B = A \cap C = \{1, 3, 5\} \) but \( B \ne C \), so \( A \cap B = A \cap C \) does not imply \( B = C \).
Question: Give a counterexample to show that \( A \cup B = A \cup C \) need not imply \( B = C \).
Answer: With \( A = \{3, 4, 5\} \), \( B = \{3, 6\} \), \( C = \{4, 6\} \), we get \( A \cup B = A \cup C = \{3, 4, 5, 6\} \) but \( B \ne C \). Hence \( A \cup B = A \cup C \) need not imply \( B = C \).