SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q4

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Equivalence of Four Set Conditions

Detailed Explanation

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.

Formula Used

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

Solution

  1. Step 1: Prove (i) implies (ii): Assume \( A \subset B \). We must show \( A - B = \emptyset \). Suppose, if possible, \( A - B \ne \emptyset \). Then there exists some element \( x \) with \( x \in A \) and \( x \notin B \). But since \( A \subset B \), every element of \( A \) lies in \( B \), so \( x \in B \). This contradicts \( x \notin B \). Hence no such element exists, and \( A - B = \emptyset \).
  2. Step 2: Prove (ii) implies (iii): Assume \( A - B = \emptyset \). This means there is no element that is in \( A \) but not in \( B \), so every element of \( A \) is in \( B \), i.e. \( A \subset B \). Now consider \( A \cup B \). Clearly \( B \subseteq A \cup B \) always. For the reverse, take any \( x \in A \cup B \), so \( x \in A \) or \( x \in B \). If \( x \in A \), then since \( A \subset B \) we get \( x \in B \); if \( x \in B \), then \( x \in B \) directly. So \( A \cup B \subseteq B \). Combining both, \( A \cup B = B \).
  3. Step 3: Prove (iii) implies (iv): Assume \( A \cup B = B \). We know \( A \subseteq A \cup B \), so \( A \subseteq B \), which means \( A \subset B \). Now consider \( A \cap B \). Take any \( x \in A \). Since \( A \subset B \), we have \( x \in B \) too, so \( x \in A \cap B \). Thus \( A \subseteq A \cap B \). Also \( A \cap B \subseteq A \) always holds. Therefore \( A \cap B = A \).
  4. Step 4: Prove (iv) implies (i): Assume \( A \cap B = A \). Take any \( x \in A \). Then \( x \in A \cap B \) because \( A = A \cap B \). By the meaning of intersection, \( x \in A \cap B \) gives \( x \in A \) and \( x \in B \), so in particular \( x \in B \). Hence every element of \( A \) lies in \( B \), which means \( A \subset B \).
  5. Step 5: Complete the cycle: We have shown (i) \( \Rightarrow \) (ii) \( \Rightarrow \) (iii) \( \Rightarrow \) (iv) \( \Rightarrow \) (i). Because this forms a closed cycle, starting from any one condition we can logically reach every other condition. Therefore all four conditions imply one another.

Final 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.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Prove (i) implies (ii): Assume \( A \subset B \). We want to show \( A - B = \emptyset \). Suppose for contradiction that \( A - B \ne \emptyset \). Then there exists some \( x \) with \( x \in A \) and \( x \notin B \). But \( A \subset B \) forces every element of \( A \) to belong to \( B \), so \( x \in B \), contradicting \( x \notin B \). Therefore no such \( x \) can exist, and we conclude \( A - B = \emptyset \). — Reason: If every element of \( A \) is already inside \( B \), nothing from \( A \) can be left outside \( B \), making the difference empty.
  2. Step 2: Prove (ii) implies (iii): Assume \( A - B = \emptyset \). This says there is no element belonging to \( A \) that stays outside \( B \), which means every element of \( A \) must lie in \( B \), i.e. \( A \subset B \). Now take any element \( x \in A \cup B \). By definition of union, \( x \in A \) or \( x \in B \). If \( x \in A \), then since \( A \subset B \) we get \( x \in B \). If \( x \in B \), then \( x \in B \) directly. In both cases \( x \in B \), so \( A \cup B \subseteq B \). Also, any \( x \in B \) satisfies \( x \in A \cup B \), giving \( B \subseteq A \cup B \). Together, \( A \cup B = B \). — Reason: An empty difference means \( A \) adds nothing new beyond what \( B \) already contains, so unioning them does not change \( B \).
  3. Step 3: Prove (iii) implies (iv): Assume \( A \cup B = B \). We want to show \( A \cap B = A \). Take any \( x \in A \). Since \( x \in A \), certainly \( x \in A \cup B \). Because \( A \cup B = B \), we get \( x \in B \). So \( x \in A \) and \( x \in B \), meaning \( x \in A \cap B \). Thus \( A \subseteq A \cap B \). Conversely, by definition of intersection, every element of \( A \cap B \) is in \( A \), so \( A \cap B \subseteq A \). Both inclusions together give \( A \cap B = A \). — Reason: Since \( A \cup B = B \) tells us \( A \subset B \), every element of \( A \) is shared with \( B \), making the intersection exactly \( A \).
  4. Step 4: Prove (iv) implies (i): Assume \( A \cap B = A \). Take any \( x \in A \). Since \( A \cap B = A \), we have \( x \in A \cap B \). By the definition of intersection this means \( x \in A \) and \( x \in B \). In particular \( x \in B \). Since \( x \) was an arbitrary element of \( A \), we conclude \( A \subset B \). — Reason: The intersection \( A \cap B \) only keeps elements that are in both sets; if this intersection equals \( A \) itself, every element of \( A \) must already be in \( B \).
  5. Step 5: Conclude equivalence: We have established the cycle \( (i) \Rightarrow (ii) \Rightarrow (iii) \Rightarrow (iv) \Rightarrow (i) \). Starting from any one of the four conditions, we can follow the arrows around the cycle to reach any other condition, so all four are logically equivalent. — Reason: A cyclic chain of implications is the most efficient way to establish mutual equivalence among multiple statements without checking every possible pair separately.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: (i) ⟹ (ii): Assume \( A \subset B \). If \( A - B \ne \emptyset \), then \( \exists \, x \in A \) with \( x \notin B \), contradicting \( A \subset B \). Hence \( A - B = \emptyset \).
  2. Step 2: (ii) ⟹ (iii): Assume \( A - B = \emptyset \), so every \( x \in A \) satisfies \( x \in B \), giving \( A \subset B \). Then \( A \cup B = B \) because any \( x \in A \cup B \) is already in \( B \), and \( B \subset A \cup B \) always holds.
  3. Step 3: (iii) ⟹ (iv): Assume \( A \cup B = B \). For any \( x \in A \), we have \( x \in A \cup B = B \), so \( x \in A \cap B \). Also \( A \cap B \subset A \) always. Hence \( A \cap B = A \).
  4. Step 4: (iv) ⟹ (i): Assume \( A \cap B = A \). For any \( x \in A \), we have \( x \in A \cap B \), so \( x \in B \). Hence \( A \subset 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.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: (i) implies (ii) — Show that \( A \subseteq B \Rightarrow B' \subseteq A' \): Assume \( A \subseteq B \). Let \( x \in B' \). Then \( x \notin B \). Since \( A \subseteq B \), every element of A is in B, so \( x \notin A \), which means \( x \in A' \). Hence \( B' \subseteq A' \).
  2. Step 2: (ii) implies (iii) — Show that \( B' \subseteq A' \Rightarrow A \cap B' = \emptyset \): Assume \( B' \subseteq A' \). Suppose \( x \in A \cap B' \). Then \( x \in A \) and \( x \in B' \). Since \( B' \subseteq A' \), we get \( x \in A' \), i.e. \( x \notin A \). This contradicts \( x \in A \). Therefore no such \( x \) exists, so \( A \cap B' = \emptyset \).
  3. Step 3: (iii) implies (iv) — Show that \( A \cap B' = \emptyset \Rightarrow A' \cup B = U \): Recall that for any sets, \( A \cap B' = \emptyset \) if and only if \( A \subseteq B \) (this will be confirmed in Step 4). We also know by De Morgan's law that the complement of \( A \cap B' \) equals \( A' \cup B \). Since \( A \cap B' = \emptyset \), taking complements on both sides gives \[ (A \cap B')' = \emptyset' \] which means \[ A' \cup B = U. \]
  4. Step 4: (iv) implies (i) — Show that \( A' \cup B = U \Rightarrow A \subseteq B \): Assume \( A' \cup B = U \). Let \( x \in A \). Then \( x \notin A' \). Since \( A' \cup B = U \) and \( x \in U \), we have \( x \in A' \cup B \). Because \( x \notin A' \), it must be that \( x \in B \). Since \( x \in A \) was arbitrary, we conclude \( A \subseteq B \).
  5. Step 5: Conclusion: We have shown the cycle of implications: (i) \( \Rightarrow \) (ii), (ii) \( \Rightarrow \) (iii), (iii) \( \Rightarrow \) (iv), and (iv) \( \Rightarrow \) (i). Therefore all four conditions are mutually equivalent.

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.

Everything you get with Solver7

More questions in Sets