Q.Using properties of sets, show that
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 →Both identities are absorption laws: a set absorbs its intersection or union with any other set. We prove each using subset arguments and set-theoretic definitions.
These two results capture a fundamental property of sets: when you combine a set with something "derived from itself," you simply get the original set back. The first says that adding elements that are already in (namely ) doesn't change . The second says that keeping only elements of from a larger collection () leaves you with itself.
The standard technique is to prove set equality by showing each side is a subset of the other: if and only if and .
(i) Proving
1. Show
Take any element . By definition of union, either or .
If , we're done.
If , then by definition of intersection, and . In particular, .
Either way, . Therefore .
2. Show
Take any element . By definition of union, immediately implies (since the union contains everything in ).
Therefore .
3. Conclude equality
Since both inclusions hold, .
The key insight: is always a subset of , so taking the union with adds nothing new.
(ii) Proving
1. Show
Take any element . By definition of intersection, and .
The first condition alone tells us .
Therefore .
2. Show …
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.