Q.Show that the following four conditions are equivalent :
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The four statements all say the same thing: every element of is also in . By proving a cycle of implications — (i) ⇒ (ii) ⇒ (iii) ⇒ (iv) ⇒ (i) — we show they are logically equivalent.
The heart of this problem is understanding that subset () is the most fundamental idea here, and the other three conditions are just different ways of writing the same relationship. Each one captures the fact that has no elements outside .
Let’s walk through the proof in a clean cycle.
1. (i) ⇒ (ii): If , then
The set difference means “elements in but not in ”. If every element of is already in (that’s what means), then there is nothing in that is missing from . So has no elements — it’s the empty set.
Think of as “the part of that doesn’t cover”. If covers all of , that part is nothing.
2. (ii) ⇒ (iii): If , then
tells us that no element of lies outside . That means every element of is actually in . So is a subset of (we’ve just rediscovered (i)!). Now look at : it contains everything in and everything in . But since all of is already inside , the union doesn’t add anything new — it’s just itself.
Formally: because .
3. (iii) ⇒ (iv): If , then …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.