Q.Write down all the subsets of the following sets
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 →A subset is any collection of elements from a set, including the empty set and the set itself. For a set with elements, there are exactly subsets.
Why Subsets Work This Way
When we form subsets, we're making a yes-or-no decision for each element: include it or leave it out. This binary choice for every element explains why a set with elements has subsets. The empty set is always a subset (we said "no" to everything), and the original set is always a subset of itself (we said "yes" to everything).
The key insight: subsets don't create new elements or change order—they simply select which elements to keep.
Finding All Subsets
(i) Subsets of
This set has element, so we expect subsets.
- The empty subset: Choose no elements →
- The full set: Choose the element →
The subsets are:
(ii) Subsets of
This set has elements, so we expect subsets.
- Choose neither element:
- Choose only :
- Choose only :
- Choose both elements:
The subsets are:
(iii) Subsets of
This set has elements, so we expect subsets.
We can organize them by size:
| Size | Subsets |
|---|---|
| 0 elements | |
| 1 element | |
| 2 elements | |
| 3 elements |
The subsets are:
To avoid missing subsets, list them systematically by size (as shown above) or use binary counting: represent each subset by a binary number where means "include" and means "exclude."
(iv) Subsets of …
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.