SOLVER7 Study. Nothing Else.
Chapter 1 Miscellaneous Examples Q25

Show that \(A\cup B=A\cap B\) implies \(A = B\).

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine two bags of marbles. The union bag holds every marble from both bags. The intersection bag holds only marbles found in both bags. Normally the union bag is bigger. But if the union bag and intersection bag are identical, both bags must already hold the exact same marbles. There is no marble in one bag that is missing from the other. So the two original bags are perfectly equal to each other.

Answer: Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).

📖 Proving A = B from A ∪ B = A ∩ B

Detailed Explanation

Two sets are equal when they contain exactly the same elements. A standard way to prove \( A = B \) is to show that \( A \subseteq B \) and \( B \subseteq A \). We also use two basic facts: every element of a set lies in the union of that set with another, so \( A \subseteq A \cup B \) and \( B \subseteq A \cup B \); and every element of an intersection lies in each set, so \( A \cap B \subseteq A \) and \( A \cap B \subseteq B \). The given condition \( A \cup B = A \cap B \) links these facts together and forces the two sets to be identical.

Formula Used

Set equality by double inclusion: \( A = B \iff A \subseteq B \text{ and } B \subseteq A \). Also \( A \subseteq A \cup B \), \( B \subseteq A \cup B \), \( A \cap B \subseteq A \), \( A \cap B \subseteq B \).

Solution

  1. Step 1: We are given \( A \cup B = A \cap B \). Our goal is to prove \( A = B \). We will do this by showing both \( A \subseteq B \) and \( B \subseteq A \).
  2. Step 2: Prove \( A \subseteq B \). Take any element \( x \in A \). Since \( A \subseteq A \cup B \), we have \( x \in A \cup B \). Using the given condition \( A \cup B = A \cap B \), this means \( x \in A \cap B \). But \( A \cap B \subseteq B \), so \( x \in B \). Therefore every element of \( A \) lies in \( B \), which gives \( A \subseteq B \).
  3. Step 3: Prove \( B \subseteq A \). Take any element \( y \in B \). Since \( B \subseteq A \cup B \), we have \( y \in A \cup B \). Using \( A \cup B = A \cap B \), this means \( y \in A \cap B \). But \( A \cap B \subseteq A \), so \( y \in A \). Therefore every element of \( B \) lies in \( A \), which gives \( B \subseteq A \).
  4. Step 4: We have shown \( A \subseteq B \) and \( B \subseteq A \). By the double inclusion rule, this proves \( A = B \).

Final Answer

Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).

Common Mistake

A common mistake is to try proving equality by manipulating the sets without using the double-subset method, or to assume \( A = B \) at the start. The correct approach is to pick an arbitrary element and trace it through the union/intersection relations to establish both inclusions separately.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify what is given and what must be proved. We are given the condition \( A \cup B = A \cap B \) and must prove \( A = B \). — Reason: Stating the hypothesis and goal clearly prevents confusion in the proof.
  2. Step 2: Choose the proof strategy. We will show \( A \subseteq B \) and \( B \subseteq A \) separately, then combine them. — Reason: By the double-inclusion principle, proving both inclusions is exactly what guarantees \( A = B \).
  3. Step 3: Prove \( A \subseteq B \). Let \( x \) be any element with \( x \in A \). Because every element of \( A \) belongs to the union, we get \( x \in A \cup B \). Now apply the given condition \( A \cup B = A \cap B \) to conclude \( x \in A \cap B \). Since membership in the intersection forces membership in each individual set, we obtain \( x \in B \). Thus every element of \( A \) is in \( B \), so \( A \subseteq B \). — Reason: We used \( A \subseteq A \cup B \) and \( A \cap B \subseteq B \) as bridge facts, with the hypothesis linking the union to the intersection.
  4. Step 4: Prove \( B \subseteq A \). Let \( y \) be any element with \( y \in B \). Because every element of \( B \) belongs to the union, we get \( y \in A \cup B \). Applying the given condition \( A \cup B = A \cap B \) gives \( y \in A \cap B \). Since \( A \cap B \subseteq A \), we conclude \( y \in A \). Hence every element of \( B \) is in \( A \), so \( B \subseteq A \). — Reason: The argument mirrors Step 3, this time using \( B \subseteq A \cup B \) and \( A \cap B \subseteq A \).
  5. Step 5: Combine both inclusions. We have established \( A \subseteq B \) and \( B \subseteq A \). By the double-inclusion principle, this means \( A = B \). — Reason: Neither inclusion alone is enough; having both directions simultaneously is the definition of set equality.

Final Answer

Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).

Common Mistake

One common mistake: students try to prove \( A = B \) by only showing \( A \subseteq B \) and forget to separately verify \( B \subseteq A \) — a single inclusion is not sufficient to conclude equality.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( A \cup B = A \cap B \). Using \( A \subseteq A \cup B \), for any \( x \in A \): \( x \in A \cup B = A \cap B \), so \( x \in B \). Thus \( A \subseteq B \).
  2. Step 2: Using \( B \subseteq A \cup B \), for any \( y \in B \): \( y \in A \cup B = A \cap B \), so \( y \in A \). Thus \( B \subseteq A \).
  3. Step 3: \( A \subseteq B \) and \( B \subseteq A \) together imply \( A = B \).

Answer: Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).

➕ More Examples

More Examples

Example 1

Question: Let P and Q be any two sets such that \( P \setminus Q = Q \setminus P \). Show that \( P = Q \).

Solution: We use the double-inclusion method to show \( P \subseteq Q \) and \( Q \subseteq P \). Step 1: Show \( P \subseteq Q \). Let \( x \in P \). We consider two cases. Case (i): Suppose \( x \notin Q \). Then \( x \in P \) and \( x \notin Q \), which means \( x \in P \setminus Q \). Since \( P \setminus Q = Q \setminus P \), we have \( x \in Q \setminus P \). But \( Q \setminus P \) contains only elements that are in Q and NOT in P. So \( x \notin P \), which contradicts our assumption that \( x \in P \). Hence Case (i) is impossible. Case (ii): Therefore \( x \in Q \). Since every \( x \in P \) must satisfy \( x \in Q \), we conclude \( P \subseteq Q \). Step 2: Show \( Q \subseteq P \). Let \( y \in Q \). We consider two cases. Case (i): Suppose \( y \notin P \). Then \( y \in Q \) and \( y \notin P \), which means \( y \in Q \setminus P \). Since \( P \setminus Q = Q \setminus P \), we have \( y \in P \setminus Q \). But \( P \setminus Q \) contains only elements in P and NOT in Q. So \( y \notin Q \), contradicting \( y \in Q \). Hence Case (i) is impossible. Case (ii): Therefore \( y \in P \). Since every \( y \in Q \) must satisfy \( y \in P \), we conclude \( Q \subseteq P \). Step 3: Conclusion. Since \( P \subseteq Q \) and \( Q \subseteq P \), we have \( P = Q \). Hence proved.

Answer: P = Q (proved by double inclusion using the given condition \( P \setminus Q = Q \setminus P \))

Example 2

Question: For any two sets A and B, prove that if \( A \cup B = B \) and \( A \cap B = A \), then \( A = B \) if and only if \( A = B \). Further, show that the condition \( A \cup B = A \cap B \) is equivalent to \( A \subseteq B \) and \( B \subseteq A \) simultaneously, and hence deduce \( A = B \).

Solution: We need to prove: if \( A \cup B = A \cap B \), then \( A = B \). Assume \( A \cup B = A \cap B \). Call this common set S, so \( S = A \cup B = A \cap B \). Step 1: Show \( A \subseteq B \). Let \( a \in A \). Since \( A \subseteq A \cup B \), we have \( a \in A \cup B = S \). Also, since \( S = A \cap B \), we get \( a \in A \cap B \). By definition of intersection, \( a \in A \) and \( a \in B \). In particular, \( a \in B \). Since every element of A belongs to B, we conclude \[ A \subseteq B. \] Step 2: Show \( B \subseteq A \). Let \( b \in B \). Since \( B \subseteq A \cup B \), we have \( b \in A \cup B = S \). Also, since \( S = A \cap B \), we get \( b \in A \cap B \). By definition of intersection, \( b \in A \) and \( b \in B \). In particular, \( b \in A \). Since every element of B belongs to A, we conclude \[ B \subseteq A. \] Step 3: Conclude A = B. We have shown \( A \subseteq B \) and \( B \subseteq A \). By the definition of set equality, two sets are equal if and only if each is a subset of the other. Therefore \[ A = B. \] Hence, \( A \cup B = A \cap B \) implies \( A = B \). This also confirms that the condition \( A \cup B = A \cap B \) is precisely the simultaneous requirement \( A \subseteq B \) and \( B \subseteq A \), which is the definition of equality.

Answer: A = B (proved: the condition \( A \cup B = A \cap B \) forces every element of A into B and vice versa, giving \( A \subseteq B \) and \( B \subseteq A \), hence A = B)

🎯 Try a Similar Question

Try a Similar Question

Question: Let A and B be two sets such that their symmetric difference is empty, i.e., \( A \triangle B = \emptyset \), where \( A \triangle B = (A \setminus B) \cup (B \setminus A) \). Prove that \( A = B \).

Solution

  1. Step 1: Recall the definition of symmetric difference: The symmetric difference of sets A and B is defined as \( A \triangle B = (A \setminus B) \cup (B \setminus A) \), where \( A \setminus B \) contains elements in A but not in B, and \( B \setminus A \) contains elements in B but not in A.
  2. Step 2: Use the given condition: We are given that \( A \triangle B = \emptyset \). Since \( A \triangle B = (A \setminus B) \cup (B \setminus A) \), and a union of two sets is empty only when both sets are themselves empty, we conclude: \( A \setminus B = \emptyset \) and \( B \setminus A = \emptyset \).
  3. Step 3: Deduce A ⊆ B from the first condition: The condition \( A \setminus B = \emptyset \) means there is no element that belongs to A but not to B. Therefore, every element of A must belong to B, which gives us \( A \subseteq B \).
  4. Step 4: Deduce B ⊆ A from the second condition: The condition \( B \setminus A = \emptyset \) means there is no element that belongs to B but not to A. Therefore, every element of B must belong to A, which gives us \( B \subseteq A \).
  5. Step 5: Conclude A = B: Since \( A \subseteq B \) and \( B \subseteq A \), by the definition of set equality, we conclude \( A = B \). Thus, \( A \triangle B = \emptyset \) implies \( A = B \).

Answer: Since \( A \setminus B = \emptyset \) implies \( A \subseteq B \), and \( B \setminus A = \emptyset \) implies \( B \subseteq A \), we have both subsets holding simultaneously, which by definition means \( A = B \). Hence \( A \triangle B = \emptyset \) implies \( A = B \).

Everything you get with Solver7

More questions in Sets