SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q6

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Proving Set Identities using Element Method

Detailed Explanation

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

Formula Used

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

Solution

  1. Step 1: First prove \( A = (A \cap B) \cup (A - B) \). We show each side is a subset of the other. Start with the right side. If \( x \in (A \cap B) \cup (A - B) \), then \( x \in A \cap B \) or \( x \in A - B \). In both cases \( x \in A \). So \( (A \cap B) \cup (A - B) \subseteq A \).
  2. Step 2: Now take the reverse inclusion. Let \( x \in A \). Either \( x \in B \) or \( x \notin B \). If \( x \in B \), then \( x \in A \) and \( x \in B \), so \( x \in A \cap B \). If \( x \notin B \), then \( x \in A \) and \( x \notin B \), so \( x \in A - B \). In either case \( x \in (A \cap B) \cup (A - B) \). Hence \( A \subseteq (A \cap B) \cup (A - B) \).
  3. Step 3: Since both inclusions hold, the two sets are equal: \[ A = (A \cap B) \cup (A - B). \] This proves the first identity.
  4. Step 4: Now prove \( A \cup (B - A) = A \cup B \). First take an element of the left side. Let \( x \in A \cup (B - A) \). Then \( x \in A \) or \( x \in B - A \). If \( x \in A \), then \( x \in A \cup B \). If \( x \in B - A \), then \( x \in B \), so \( x \in A \cup B \). Hence \( A \cup (B - A) \subseteq A \cup B \).
  5. Step 5: Now take the reverse. Let \( x \in A \cup B \), so \( x \in A \) or \( x \in B \). If \( x \in A \), then \( x \in A \cup (B - A) \). If \( x \notin A \) but \( x \in B \), then \( x \in B \) and \( x \notin A \), which means \( x \in B - A \), so \( x \in A \cup (B - A) \). Hence \( A \cup B \subseteq A \cup (B - A) \).
  6. Step 6: Both inclusions give equality: \[ A \cup (B - A) = A \cup B. \] This proves the second identity.

Final Answer

Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Goal: Prove \( A = (A \cap B) \cup (A - B) \) by showing both subset directions. We use the double-inclusion method: prove \( (A \cap B) \cup (A - B) \subseteq A \) first. Let \( x \in (A \cap B) \cup (A - B) \). Then either \( x \in A \cap B \) or \( x \in A - B \). In the first case, \( x \in A \) (by definition of intersection). In the second case, \( x \in A \) (by definition of set difference). So in both cases \( x \in A \), which means \( (A \cap B) \cup (A - B) \subseteq A \). — Reason: Any element from the right side must come from \( A \), so the right side cannot contain elements outside \( A \).
  2. Step 2: Now prove the reverse: \( A \subseteq (A \cap B) \cup (A - B) \). Let \( x \in A \). There are exactly two possibilities: either \( x \in B \) or \( x \notin B \). If \( x \in B \), then \( x \in A \) and \( x \in B \), so \( x \in A \cap B \), which means \( x \in (A \cap B) \cup (A - B) \). If \( x \notin B \), then \( x \in A \) and \( x \notin B \), so \( x \in A - B \), which again means \( x \in (A \cap B) \cup (A - B) \). — Reason: Every element of \( A \) either belongs to \( B \) or does not, and each case places it in one of the two parts on the right side.
  3. Step 3: Since we have shown \( (A \cap B) \cup (A - B) \subseteq A \) and \( A \subseteq (A \cap B) \cup (A - B) \), we conclude \[ A = (A \cap B) \cup (A - B) \] — Reason: When two sets are subsets of each other, they must be equal. This completes the proof of the first identity.
  4. Step 4: Goal: Prove \( A \cup (B - A) = A \cup B \) using the same double-inclusion strategy. First, show \( A \cup (B - A) \subseteq A \cup B \). Let \( x \in A \cup (B - A) \). Then either \( x \in A \) or \( x \in B - A \). If \( x \in A \), then \( x \in A \cup B \). If \( x \in B - A \), then \( x \in B \) (by definition of set difference), so \( x \in A \cup B \). Therefore \( A \cup (B - A) \subseteq A \cup B \). — Reason: Every element on the left must land in \( A \) or \( B \), confirming it belongs to \( A \cup B \).
  5. Step 5: Now show the reverse inclusion: \( A \cup B \subseteq A \cup (B - A) \). Let \( x \in A \cup B \). Then \( x \in A \) or \( x \in B \). If \( x \in A \), then directly \( x \in A \cup (B - A) \). If \( x \in B \) but \( x \notin A \), then \( x \in B - A \), so \( x \in A \cup (B - A) \). If \( x \in B \) and \( x \in A \), then \( x \in A \), so \( x \in A \cup (B - A) \). In every possible case, \( x \in A \cup (B - A) \). — Reason: Elements of \( A \cup B \) fall into overlapping cases, and each case is handled separately to confirm membership on the left side.
  6. Step 6: Since \( A \cup (B - A) \subseteq A \cup B \) and \( A \cup B \subseteq A \cup (B - A) \), we conclude \[ A \cup (B - A) = A \cup B \] — Reason: Mutual subset inclusion implies set equality. This completes the proof of the second identity.

Final Answer

Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Identity 1 — RHS ⊆ LHS: Let \( x \in (A \cap B) \cup (A - B) \). Then \( x \in A \cap B \) or \( x \in A - B \). In either case \( x \in A \). So \( (A \cap B) \cup (A - B) \subseteq A \).
  2. Identity 1 — LHS ⊆ RHS: Let \( x \in A \). Case 1: \( x \in B \) implies \( x \in A \cap B \). Case 2: \( x \notin B \) implies \( x \in A - B \). In both cases \( x \in (A \cap B) \cup (A - B) \). So \( A \subseteq (A \cap B) \cup (A - B) \). Hence \( A = (A \cap B) \cup (A - B) \).
  3. Identity 2 — RHS ⊆ LHS: Let \( x \in A \cup B \). Case 1: \( x \in A \) implies \( x \in A \cup (B - A) \). Case 2: \( x \in B \) and \( x \notin A \) implies \( x \in B - A \), so \( x \in A \cup (B - A) \). Thus \( A \cup B \subseteq A \cup (B - A) \).
  4. Identity 2 — LHS ⊆ RHS: Let \( x \in A \cup (B - A) \). Then \( x \in A \) or \( x \in B - A \). Since \( B - A \subseteq B \), in both cases \( x \in A \cup B \). So \( A \cup (B - A) \subseteq A \cup B \). Hence \( A \cup (B - A) = A \cup B \).

Answer: Both identities are proved: \( A = (A \cap B) \cup (A - B) \) and \( A \cup (B - A) = A \cup B \).

➕ More Examples

More Examples

Example 1

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.

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Proof of Identity (i): Show RHS ⊆ LHS: We need to prove \( B = (A \cap B) \cup (B \setminus A) \). Let \( x \in (A \cap B) \cup (B \setminus A) \). Then either \( x \in A \cap B \) or \( x \in B \setminus A \). If \( x \in A \cap B \), then \( x \in B \). If \( x \in B \setminus A \), then \( x \in B \) and \( x \notin A \), so again \( x \in B \). In both cases \( x \in B \), so \( (A \cap B) \cup (B \setminus A) \subseteq B \).
  2. Proof of Identity (i): Show LHS ⊆ RHS: Now let \( x \in B \). Either \( x \in A \) or \( x \notin A \). Case 1: If \( x \in A \), then \( x \in A \) and \( x \in B \), so \( x \in A \cap B \subseteq (A \cap B) \cup (B \setminus A) \). Case 2: If \( x \notin A \), then \( x \in B \) and \( x \notin A \), so \( x \in B \setminus A \subseteq (A \cap B) \cup (B \setminus A) \). In both cases \( x \in (A \cap B) \cup (B \setminus A) \), so \( B \subseteq (A \cap B) \cup (B \setminus A) \).
  3. Conclusion for Identity (i): Since \( (A \cap B) \cup (B \setminus A) \subseteq B \) and \( B \subseteq (A \cap B) \cup (B \setminus A) \), we conclude \[ B = (A \cap B) \cup (B \setminus A). \] Identity (i) is proved.
  4. Proof of Identity (ii): Show LHS ⊆ RHS: We need to prove \( (A \setminus B) \cup B = A \cup B \). Let \( x \in (A \setminus B) \cup B \). Then either \( x \in A \setminus B \) or \( x \in B \). If \( x \in A \setminus B \), then \( x \in A \), so \( x \in A \cup B \). If \( x \in B \), then clearly \( x \in A \cup B \). Therefore \( (A \setminus B) \cup B \subseteq A \cup B \).
  5. Proof of Identity (ii): Show RHS ⊆ LHS: Now let \( x \in A \cup B \). Then \( x \in A \) or \( x \in B \). Case 1: If \( x \in B \), then \( x \in (A \setminus B) \cup B \). Case 2: If \( x \in A \) but \( x \notin B \), then \( x \in A \setminus B \subseteq (A \setminus B) \cup B \). Case 3: If \( x \in A \) and \( x \in B \), then \( x \in B \subseteq (A \setminus B) \cup B \). In all cases \( x \in (A \setminus B) \cup B \), so \( A \cup B \subseteq (A \setminus B) \cup B \).
  6. Conclusion for Identity (ii): Since \( (A \setminus B) \cup B \subseteq A \cup B \) and \( A \cup B \subseteq (A \setminus B) \cup B \), we conclude \[ (A \setminus B) \cup B = A \cup B. \] Identity (ii) is proved.

Answer: Both identities are proved: \( B = (A \cap B) \cup (B \setminus A) \) and \( (A \setminus B) \cup B = A \cup B \).

Everything you get with Solver7

More questions in Sets