Show that \(A\cup B=A\cap B\) implies \(A = B\).
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
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 \).
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.
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 \).
Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).
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.
Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).
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.
Answer: Since \( A \subseteq B \) and \( B \subseteq A \), we conclude \( A = B \). Hence \( A \cup B = A \cap B \) implies \( A = B \).
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 \))
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)
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 \).
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 \).