Show that for any sets \(A\) and \(B,\)
\(A = ( A \cap B ) \cup ( A – B )\) and \(A \cup ( B – A ) = ( A \cup B)\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine set A is a bag of fruits. Some fruits are also in bag B, and some are not. Every fruit in bag A either belongs to both bags or belongs only to bag A. Put those two groups back together and you get the original bag A. The second idea is similar: adding to bag A whatever is only in bag B gives you the same result as combining both bags fully. These two simple sorting tricks show that the sets match perfectly.
Answer: Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).
To prove that two sets are equal, we usually show they contain exactly the same elements. A very common technique is the double-inclusion method: show the first set is a subset of the second, and the second is a subset of the first. Here we use the key definitions: \( A \cap B \) is the set of elements in both \( A \) and \( B \); \( A - B \) (also written \( A \setminus B \)) is the set of elements in \( A \) but not in \( B \); and \( A \cup B \) is the set of elements in \( A \) or in \( B \) (or both). The idea behind the first identity is that any element of \( A \) either also lies in \( B \) (so it is in \( A \cap B \)) or does not lie in \( B \) (so it is in \( A - B \)). This splits \( A \) into two disjoint parts whose union rebuilds \( A \).
Definitions used: \( A \cap B = \{ x : x \in A \text{ and } x \in B \} \), \( A - B = \{ x : x \in A \text{ and } x \notin B \} \), \( A \cup B = \{ x : x \in A \text{ or } x \in B \} \).
Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).
A common mistake is assuming the two pieces \( A \cap B \) and \( A - B \) can overlap or that some element of \( A \) fits in neither. In fact every element of \( A \) lies in exactly one of them, since it either belongs to \( B \) or does not — you must consider both cases to complete the proof.
Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).
One common mistake: Students often try to prove set equality by working only in one direction (e.g., only showing the left side is a subset of the right), forgetting that they must also prove the reverse inclusion to conclude the sets are truly equal.
Answer: Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).
Question: For any two sets \( P \) and \( Q \), prove the following two identities: (i) \( P = (P \cap Q) \cup (P \cap Q') \) (ii) \( (P \setminus Q) \cup (Q \setminus P) = (P \cup Q) \setminus (P \cap Q) \)
Solution: Part (i): Prove \( P = (P \cap Q) \cup (P \cap Q') \) We use the distributive law on the right-hand side. Right-hand side: \[ (P \cap Q) \cup (P \cap Q') \] Apply the distributive law \( A \cap (B \cup C) = (A \cap B) \cup (A \cap C) \) in reverse: \[ = P \cap (Q \cup Q') \] Since \( Q \cup Q' = U \) (the universal set), we get: \[ = P \cap U = P \] Hence \( P = (P \cap Q) \cup (P \cap Q') \) is proved. Note: \( P \cap Q' = P \setminus Q \), so this also says \( P = (P \cap Q) \cup (P \setminus Q) \), confirming that \( P \) is partitioned into elements in \( Q \) and elements not in \( Q \). Part (ii): Prove \( (P \setminus Q) \cup (Q \setminus P) = (P \cup Q) \setminus (P \cap Q) \) Rewrite using set difference as intersection with complement. Left-hand side: \[ (P \setminus Q) \cup (Q \setminus P) = (P \cap Q') \cup (Q \cap P') \] Right-hand side: \[ (P \cup Q) \setminus (P \cap Q) = (P \cup Q) \cap (P \cap Q)' \] By De Morgan's law, \( (P \cap Q)' = P' \cup Q' \), so the right-hand side becomes: \[ (P \cup Q) \cap (P' \cup Q') \] Expand using the distributive law: \[ = [P \cap (P' \cup Q')] \cup [Q \cap (P' \cup Q')] \] Expand each bracket: \[ = [(P \cap P') \cup (P \cap Q')] \cup [(Q \cap P') \cup (Q \cap Q')] \] Since \( P \cap P' = \emptyset \) and \( Q \cap Q' = \emptyset \): \[ = [\emptyset \cup (P \cap Q')] \cup [(Q \cap P') \cup \emptyset] \] \[ = (P \cap Q') \cup (Q \cap P') \] \[ = (P \setminus Q) \cup (Q \setminus P) \] This equals the left-hand side, so the identity is proved.
Answer: Both identities are proved: (i) \( P = (P \cap Q) \cup (P \cap Q') \) follows from the distributive law and \( Q \cup Q' = U \). (ii) \( (P \setminus Q) \cup (Q \setminus P) = (P \cup Q) \setminus (P \cap Q) \) follows by expanding both sides using De Morgan's law and distributivity.
Question: For any two sets \( X \) and \( Y \), prove the following: (i) \( X \cup (Y \setminus X) = X \cup Y \) (ii) \( X \setminus (X \cap Y) = X \setminus Y \)
Solution: Part (i): Prove \( X \cup (Y \setminus X) = X \cup Y \) We use the definition \( Y \setminus X = Y \cap X' \). Left-hand side: \[ X \cup (Y \setminus X) = X \cup (Y \cap X') \] Apply the distributive law \( A \cup (B \cap C) = (A \cup B) \cap (A \cup C) \): \[ = (X \cup Y) \cap (X \cup X') \] Since \( X \cup X' = U \): \[ = (X \cup Y) \cap U = X \cup Y \] Hence \( X \cup (Y \setminus X) = X \cup Y \) is proved. Part (ii): Prove \( X \setminus (X \cap Y) = X \setminus Y \) Rewrite using the definition of set difference. Left-hand side: \[ X \setminus (X \cap Y) = X \cap (X \cap Y)' \] Apply De Morgan's law: \( (X \cap Y)' = X' \cup Y' \): \[ = X \cap (X' \cup Y') \] Apply the distributive law: \[ = (X \cap X') \cup (X \cap Y') \] Since \( X \cap X' = \emptyset \): \[ = \emptyset \cup (X \cap Y') = X \cap Y' \] Right-hand side: \[ X \setminus Y = X \cap Y' \] Both sides equal \( X \cap Y' \), so the identity is proved.
Answer: Both identities are proved: (i) \( X \cup (Y \setminus X) = X \cup Y \) by using distributivity and \( X \cup X' = U \). (ii) \( X \setminus (X \cap Y) = X \setminus Y \) by using De Morgan's law and distributivity, both sides simplifying to \( X \cap Y' \).
Question: For any two sets A and B, prove the following identities: (i) \( B = (A \cap B) \cup (B \setminus A) \) and (ii) \( (A \setminus B) \cup B = A \cup B \).
Answer: Both identities are proved: \( B = (A \cap B) \cup (B \setminus A) \) and \( (A \setminus B) \cup B = A \cup B \).