Show that the following four conditions are equivalent : (i) \(A \subset B\) (ii) \( A - B=\phi\) (iii) \(A \cup B = B\) (iv)\(A \cap B = A\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine set A is a small bag and set B is a big bag. Every marble in the small bag also lives in the big bag. Because of this, taking marbles from A that are not in B gives you nothing at all. Also, combining both bags still looks like just the big bag. Picking only marbles that appear in both bags gives you exactly the small bag. All four of these facts are really saying the same one thing — A fits completely inside B.
Answer: Since \( (i) \Rightarrow (ii) \Rightarrow (iii) \Rightarrow (iv) \Rightarrow (i) \), the four conditions \( A \subset B \), \( A - B = \emptyset \), \( A \cup B = B \) and \( A \cap B = A \) are all equivalent.
When we say four conditions are equivalent, we mean each condition implies every other condition. Instead of proving all pairs separately, we prove them in a cycle: (i) implies (ii), (ii) implies (iii), (iii) implies (iv), and (iv) implies (i). Once this cycle is complete, starting from any condition you can reach any other, so all four are equivalent. Here \( A \subset B \) means every element of \( A \) is also in \( B \). The difference \( A - B \) is the set of elements in \( A \) that are not in \( B \). We use the meanings of subset, union, intersection and difference throughout.
Definitions used: \( A \subset B \) means \( x \in A \Rightarrow 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 \} \); \( A \cap B = \{ x : x \in A \text{ and } x \in B \} \).
Since \( (i) \Rightarrow (ii) \Rightarrow (iii) \Rightarrow (iv) \Rightarrow (i) \), the four conditions \( A \subset B \), \( A - B = \emptyset \), \( A \cup B = B \) and \( A \cap B = A \) are all equivalent.
A common mistake is trying to prove each of the 12 possible implications separately, which is unnecessary. Setting up a single cyclic chain (i) implies (ii) implies (iii) implies (iv) implies (i) is enough to establish full equivalence, and it saves a lot of work.
Since \( (i) \Rightarrow (ii) \Rightarrow (iii) \Rightarrow (iv) \Rightarrow (i) \), the four conditions \( A \subset B \), \( A - B = \emptyset \), \( A \cup B = B \) and \( A \cap B = A \) are all equivalent.
One common mistake: Students often try to prove only one or two implications and conclude equivalence prematurely. Equivalence requires that every condition can lead to every other; proving a full cycle (i) → (ii) → (iii) → (iv) → (i) is the minimal complete argument.
Answer: Since \( (i) \Rightarrow (ii) \Rightarrow (iii) \Rightarrow (iv) \Rightarrow (i) \), the four conditions \( A \subset B \), \( A - B = \emptyset \), \( A \cup B = B \) and \( A \cap B = A \) are all equivalent.
Question: Let P and Q be any two sets. Show that the following four conditions are equivalent: (i) \( P \subseteq Q \) (ii) \( P \cap Q' = \emptyset \) (iii) \( P \cup Q = Q \) (iv) \( P \cap Q = P \)
Solution: We prove the equivalence by establishing the cycle of implications: (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i). Step 1: Prove (i) \( \Rightarrow \) (ii). Assume \( P \subseteq Q \). Suppose, for contradiction, that \( P \cap Q' \ne \emptyset \). Then there exists an element \( x \) such that \( x \in P \cap Q' \), which means \( x \in P \) and \( x \in Q' \), i.e. \( x \notin Q \). But since \( P \subseteq Q \) and \( x \in P \), we must have \( x \in Q \). This is a contradiction. Therefore \( P \cap Q' = \emptyset \). Step 2: Prove (ii) \( \Rightarrow \) (iii). Assume \( P \cap Q' = \emptyset \). We show \( P \cup Q = Q \). Since \( Q \subseteq P \cup Q \) always holds, it suffices to show \( P \cup Q \subseteq Q \). Let \( x \in P \cup Q \). Then \( x \in P \) or \( x \in Q \). If \( x \in Q \), we are done. If \( x \in P \), then since \( P \cap Q' = \emptyset \), \( x \) cannot belong to \( Q' \), so \( x \in Q \). In both cases \( x \in Q \). Hence \( P \cup Q \subseteq Q \), giving \( P \cup Q = Q \). Step 3: Prove (iii) \( \Rightarrow \) (iv). Assume \( P \cup Q = Q \). We show \( P \cap Q = P \). Since \( P \cap Q \subseteq P \) always holds, it suffices to show \( P \subseteq P \cap Q \). Let \( x \in P \). Then \( x \in P \cup Q \). By assumption \( P \cup Q = Q \), so \( x \in Q \). Therefore \( x \in P \) and \( x \in Q \), giving \( x \in P \cap Q \). Hence \( P \subseteq P \cap Q \), so \( P \cap Q = P \). Step 4: Prove (iv) \( \Rightarrow \) (i). Assume \( P \cap Q = P \). Let \( x \in P \). Since \( P = P \cap Q \), we have \( x \in P \cap Q \), which means \( x \in Q \). Hence every element of \( P \) belongs to \( Q \), i.e. \( P \subseteq Q \). Since (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i), all four conditions are equivalent.
Answer: All four conditions — (i) \( P \subseteq Q \), (ii) \( P \cap Q' = \emptyset \), (iii) \( P \cup Q = Q \), (iv) \( P \cap Q = P \) — are mutually equivalent, proved via the cyclic chain of implications.
Question: For any two sets X and Y, show that the following statements are equivalent: (i) \( X \subseteq Y \) (ii) \( Y' \subseteq X' \) (iii) \( X \cup Y = Y \) (iv) \( X - Y = \emptyset \)
Solution: We prove equivalence by the cyclic chain (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i). Step 1: Prove (i) \( \Rightarrow \) (ii). Assume \( X \subseteq Y \). Let \( x \in Y' \), so \( x \notin Y \). Since \( X \subseteq Y \), if \( x \) were in \( X \) then \( x \) would be in \( Y \), a contradiction. Therefore \( x \notin X \), meaning \( x \in X' \). Hence \( Y' \subseteq X' \). Step 2: Prove (ii) \( \Rightarrow \) (iii). Assume \( Y' \subseteq X' \). We show \( X \cup Y = Y \). Clearly \( Y \subseteq X \cup Y \). It remains to show \( X \cup Y \subseteq Y \). Let \( x \in X \cup Y \). If \( x \in Y \), done. If \( x \notin Y \), then \( x \in Y' \). By assumption \( Y' \subseteq X' \), so \( x \in X' \), meaning \( x \notin X \). But \( x \in X \cup Y \) and \( x \notin X \) forces \( x \in Y \), a contradiction. So \( x \in Y \) in all cases, giving \( X \cup Y \subseteq Y \). Hence \( X \cup Y = Y \). Step 3: Prove (iii) \( \Rightarrow \) (iv). Assume \( X \cup Y = Y \). Recall that \( X - Y = X \cap Y' \). Let \( x \in X - Y \). Then \( x \in X \) and \( x \notin Y \). Since \( x \in X \), we have \( x \in X \cup Y = Y \). But this contradicts \( x \notin Y \). Therefore no such \( x \) exists, and \( X - Y = \emptyset \). Step 4: Prove (iv) \( \Rightarrow \) (i). Assume \( X - Y = \emptyset \), i.e. \( X \cap Y' = \emptyset \). Let \( x \in X \). If \( x \notin Y \) then \( x \in Y' \), so \( x \in X \cap Y' = \emptyset \), a contradiction. Therefore \( x \in Y \). Since every element of \( X \) belongs to \( Y \), we have \( X \subseteq Y \). The cyclic chain is complete, so all four conditions are equivalent.
Answer: All four conditions — (i) \( X \subseteq Y \), (ii) \( Y' \subseteq X' \), (iii) \( X \cup Y = Y \), (iv) \( X - Y = \emptyset \) — are mutually equivalent, proved via the cyclic chain of implications.
Question: Show that the following four conditions are equivalent for any two sets A and B: (i) \( A \subseteq B \) (ii) \( B' \subseteq A' \) (iii) \( A \cap B' = \emptyset \) (iv) \( A \cup B' = B' \cup A \) simplifies so that \( A' \cup B = U \) (the universal set). Prove the equivalence by showing (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i).
Answer: Since (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i), the four conditions \( A \subseteq B \), \( B' \subseteq A' \), \( A \cap B' = \emptyset \), and \( A' \cup B = U \) are all equivalent to one another.