Q.Consider the sets φ, A = { 1, 3 }, B = {1, 5, 9}, C = {1, 3, 5, 7, 9}. Insert the symbol ⊂ or ⊄ between each of the following pair of sets:
Concept understanding — Subset Listing
Subset Listing: A First Look
Let's build this from the ground up — no jargon, just intuition first.
1. The Intuition: What does "subset" mean?
Imagine you have a set — a collection of distinct objects. For example:
Set A = {apple, banana, cherry}
Now, a subset is simply a selection of some (or all, or none) of these objects, taken from the original set.
- You could pick all three → {apple, banana, cherry}
- You could pick just two → {apple, banana}
- You could pick just one → {cherry}
- You could pick none → {} (the empty set)
Each of these is a subset of the original set.
2. The Precise Definition
Definition: A set B is a subset of a set A if every element of B is also an element of A.
We write this as:
B⊆A
If B is not a subset of A, we write:
B⊆A
Key points to remember:
-
Every set is a subset of itself.
Example: {apple, banana} ⊆ {apple, banana}
-
The empty set ∅ (or {}) is a subset of every set.
Why? Because it has no elements, so there's nothing to violate the condition.
-
If B is a subset of A but B=A, we call B a proper subset.
Notation: B⊂A (some books use ⊊)
3. How to "list" all subsets
Subset listing means writing down every possible subset of a given set.
Example: Set S={a,b}
All subsets:
- ∅ (empty set)
- {a}
- {b}
- {a,b} (the set itself)
So the list of all subsets is:
{∅,{a},{b},{a,b}}
How many subsets does a set have?
If a set has n elements, it has exactly 2n subsets.
- n=0 → 20=1 subset (just the empty set)
- n=1 → 21=2 subsets
- n=2 → 22=4 subsets (as above)
- n=3 → 23=8 subsets
Why 2n?
For each element, you have 2 choices: include it or exclude it. Multiply these choices: 2×2×⋯×2 (n times) = 2n.
4. A systematic way to list subsets
For a set with n elements, you can use a binary counting method:
- Label each element with a position (1st, 2nd, 3rd, ...)
- Count from 0 to 2n−1 in binary
- Each binary number tells you which elements to include (1 = include, 0 = exclude)
Example: S={a,b,c} (3 elements)
| Binary | Subset |
|---|---|
| 000 | ∅ |
| 001 | {c} |
| 010 | {b} |
| 011 | {b,c} |
| 100 | {a} |
| 101 | {a,c} |
| 110 | {a,b} |
| 111 | {a,b,c} |
That's all 8 subsets.
5. Why does this matter?
Subset listing is the foundation for:
- Probability (sample spaces and events)
- Combinatorics (counting possibilities)
- Set theory (understanding relationships between sets)
- Computer science (power sets, Boolean algebra)
Quick Check: Test Yourself
Q: List all subsets of T={x,y}.
Answer:
∅, {x}, {y}, {x,y}
Q: How many subsets does a set with 5 elements have?
Answer: 25=32
Remember: Subset listing is just systematically writing down every possible selection from a set — from picking nothing to picking everything. That's all there is to it.
Searches like "how to list all subsets of a set" and "number of subsets formula 2 to the power n" point straight to the Sets chapter of the NCERT/CBSE Class 11 Mathematics syllabus, where subset listing is introduced. The binary-counting method for listing subsets is also a handy shortcut for JEE Main set-theory and probability questions.
Why this formula?
Okay, let's break down Subset Listing from the ground up. The core idea is simple: given a set, how do we systematically list all its subsets, and why does the formula 2n work?
1. The Core Question
Imagine you have a set with n elements, like S={a,b,c} (so n=3). A subset is any collection of elements from S, including the empty set {} and the set itself {a,b,c}.
The key formula is:
Total number of subsets of a set with n elements = 2n
Let's see why this is true, not just memorize it.
2. The "Decision" or "Binary Choice" Reasoning
The most intuitive derivation comes from thinking about each element individually.
For each element in the original set, when building a subset, you have exactly two choices:
- Include the element in the subset.
- Exclude the element from the subset.
This is a fundamental, independent decision for every element.
Example with S={a,b,c}
- For element a: Choose IN or OUT. (2 choices)
- For element b: Choose IN or OUT. (2 choices)
- For element c: Choose IN or OUT. (2 choices)
Since these choices are independent (choosing for a doesn't affect the choice for b), the total number of distinct combinations of choices is the product of the number of choices for each element:
2×2×2=23=8
This directly gives the 8 subsets of {a,b,c}:
- {} (all OUT)
- {a} (a IN, b OUT, c OUT)
- {b}
- {c}
- {a,b}
- {a,c}
- {b,c}
- {a,b,c} (all IN)
3. The General Formula (Derivation)
For a set with n elements, you have n independent binary decisions. Therefore:
Total subsets=n times2×2×⋯×2=2n
This is the fundamental reason the formula holds. It's not a coincidence; it's a direct consequence of the counting principle for independent events.
4. Why This Matters for Exams
- Don't just memorize 2n. If a question asks "How many subsets does a set with 5 elements have?", you can instantly say 25=32. But if they ask why, you now have the reasoning.
- Watch out for "proper subsets". A proper subset is any subset except the original set itself. So the number of proper subsets is 2n−1.
- Watch out for "non-empty subsets". That's 2n−1 as well (excluding the empty set).
- Watch out for "non-empty proper subsets". That's 2n−2 (excluding both the empty set and the original set).
5. Quick Summary Table
| Type of Subset | Formula | Reasoning |
|---|---|---|
| All subsets | 2n | n independent binary choices (include/exclude) |
| Proper subsets | 2n−1 | All subsets minus the set itself |
| Non-empty subsets | 2n−1 | All subsets minus the empty set |
| Non-empty proper subsets | 2n−2 | All subsets minus the set itself and the empty set |
Final takeaway: The formula 2n is not magic. It's the product of n independent "yes/no" decisions. Always trace back to that binary choice when you need to derive or explain it.
X⊂Y means every element of X is also in Y; if even one element of X is missing from Y, write X⊂Y.
(i) ϕ has no elements, so it is a subset of every set ⟹ϕ⊂B.
(ii) A={1,3}, B={1,5,9}: 3∈A but 3∈/B ⟹A⊂B.
(iii) A={1,3}, C={1,3,5,7,9}: both 1 and 3 are in C ⟹A⊂C.
(iv) B={1,5,9}, C={1,3,5,7,9}: every element of B is in C ⟹B⊂C.
(i) ϕ⊂B (ii) A⊂B (iii) A⊂C (iv) B⊂C
The empty set is a subset of every set, and X⊂Y means every element of X is also in Y. Checking each pair: (i) ϕ⊂B,
(ii) A⊂B,
(iii) A⊂C,
(iv) B⊂C.
Understanding the subset relation
X⊂Y ("X is a subset of Y") means every element of X is also an element of Y. To decide the symbol, check each element of the first set against the second: if all of them are found in the second set, use ⊂; if even one is missing, use ⊂.
Given: ϕ (empty set), A={1,3}, B={1,5,9}, C={1,3,5,7,9}.
(i) ϕ and B
The empty set contains no elements at all, so there is nothing in it that could fail to be in B. By definition, the empty set is a subset of every set.
ϕ⊂B
(ii) A and B
A={1,3}, B={1,5,9}.
- 1∈A and 1∈B — passes.
- 3∈A but 3∈/B — fails.
Since not every element of A is in B, A is not a subset of B.
A⊂B
(iii) A and C
A={1,3}, C={1,3,5,7,9}.
- 1∈A and 1∈C — passes.
- 3∈A and 3∈C — passes.
Every element of A is in C, so A is a subset of C.
A⊂C
(iv) B and C
B={1,5,9}, C={1,3,5,7,9}.
- 1∈B and 1∈C — passes.
- 5∈B and 5∈C — passes.
- 9∈B and 9∈C — passes.
Every element of B is in C, so B is a subset of C.
B⊂C
Don't confuse ∈ (element of) with ⊂ (subset of) — ∈ relates an element to a set, while ⊂ relates two sets to each other.
(i) ϕ⊂B (ii) A⊂B (iii) A⊂C (iv) B⊂C
Method: Subset Test by Element Checking
This method checks whether every element of the first set is also present in the second set.
- If yes → the first set is a subset (⊂) of the second.
- If even one element is missing → it is not a subset (⊂).
Steps
- List all elements of the first set.
- Check each element — is it present in the second set?
- Decision:
- All found → ⊂
- Any missing → ⊂
Applying to each pair
(i) ϕ…B
- ϕ has no elements.
- There is no element to check — the condition "every element is present" is vacuously true.
- Result: ϕ⊂B
(ii) A…B
- A={1,3}, B={1,5,9}
- Check: 1∈B ✓, 3∈B ✗ (3 is not in B)
- Result: A⊂B
(iii) A…C
- A={1,3}, C={1,3,5,7,9}
- Check: 1∈C ✓, 3∈C ✓
- Result: A⊂C
(iv) B…C
- B={1,5,9}, C={1,3,5,7,9}
- Check: 1∈C ✓, 5∈C ✓, 9∈C ✓
- Result: B⊂C
Final Answer
| Pair | Symbol |
|---|---|
| ϕ…B | ⊂ |
| A…B | ⊂ |
| A…C | ⊂ |
| B…C | ⊂ |
🧠 The Core Idea: Subset vs. Element
Before we list mistakes, remember the two key symbols:
- ⊂ (subset): Every element of the first set must be in the second set.
- ∈ (element): The entire thing on the left is a single member of the set on the right.
Mixing these up is the #1 cause of errors.
✗ Common Mistake #1: Confusing ⊂ with ∈
Example from the list:
Statement (v): {a}∈{a,b,c}
Why it’s wrong:
- {a} is a set containing the letter a.
- {a,b,c} contains the elements a, b, and c — not the set {a}.
- So {a} is not an element of {a,b,c}.
✓ Correct thinking:
- {a}⊂{a,b,c} is true (every element of {a} is in the big set).
- {a}∈{a,b,c} is false unless the big set explicitly contains a set as an element, e.g., {a,{a},b}.
How to avoid:
Ask yourself: “Is the left side a single object inside the right side, or is it a collection whose members are inside?”
✗ Common Mistake #2: Forgetting that ⊂ requires all elements
Example from the list:
Statement (iii): {1,2,3}⊂{1,3,5}
Why it’s wrong:
- The left set has 1,2,3.
- The right set has 1,3,5.
- 2 is missing from the right set. So it’s false.
✓ Correct thinking:
- For ⊂ to be true, every element of the first set must appear in the second. One missing element = false.
How to avoid:
Check each element one by one. If even one is missing, the statement is false.
✗ Common Mistake #3: Misreading “not a subset” (⊂)
Example from the list:
Statement (i): {a,b}⊂{b,c,a}
Why it’s wrong:
- The left set has a and b.
- The right set has b,c,a — both a and b are present.
- So {a,b} is a subset. The statement says it is not a subset — that’s false.
✓ Correct thinking:
- {a,b}⊂{b,c,a} is true.
- Therefore {a,b}⊂{b,c,a} is false.
How to avoid:
First check if it is a subset. Then apply the “not” (⊂) to decide true/false.
✗ Common Mistake #4: Overlooking the definition of the set on the right
Example from the list:
Statement (ii): {a,e}⊂{x:x is a vowel in the English alphabet}
Why it’s correct (but often marked wrong by students):
- Vowels: a,e,i,o,u.
- The left set has a and e — both are vowels.
- So it is a subset — true.
Common error: Students sometimes think “vowel” means only a,e,i,o,u but then forget to check if a and e are actually in that list. Or they misread the set-builder notation.
How to avoid:
Write out the actual elements of the set described in words. Then compare.
✗ Common Mistake #5: Not simplifying the set before comparing
Example from the list:
Statement (vi): {x:x is an even natural number less than 6}⊂{x:x is a natural number which divides 36}
Step-by-step:
-
Left set: even natural numbers less than 6 → {2,4}
-
Right set: natural numbers that divide 36 → {1,2,3,4,6,9,12,18,36}
-
Both 2 and 4 are in the right set → true.
Common error: Students guess without listing. They might think “divides 36” means only {1,2,3,4,6} or forget 4 divides 36.
How to avoid:
Always list the elements of both sets explicitly before comparing.
✓ Quick Summary Table
| Statement | True/False | Key Reason |
|---|---|---|
| (i) {a,b}⊂{b,c,a} | False | It is a subset |
| (ii) {a,e}⊂vowels | True | Both are vowels |
| (iii) {1,2,3}⊂{1,3,5} | False | 2 missing |
| (iv) {a}⊂{a,b,c} | True | a is in the set |
| (v) {a}∈{a,b,c} | False | {a} is not an element |
| (vi) even < 6 ⊂ divides 36 | True | {2,4} both divide 36 |
🧪 Final Exam Tip
When in doubt, write it out.
Convert set-builder to roster form. Then check element by element. Never skip this step — it’s where most marks are lost.
- KCET 2026Set UNKNOWN1 markMCQQ.If A={a,b,c,d,e,f}, then the number of subsets of A which contains at least 2 elements is (A) 64 (B) 65 (C) 57 (D) 59
›Reveal solutionSolution
Count all subsets of the 6-element set, then subtract the subsets with 0 or 1 elements.
Step 1 — Total number of subsets
A={a,b,c,d,e,f} has n(A)=6 elements, so the total number of subsets is 26=64.
Step 2 — Subtract subsets with fewer than 2 elements
Subsets with 0 elements: just the empty set, (06)=1.
Subsets with 1 element: (16)=6.
So subsets with fewer than 2 elements number 1+6=7.
Step 3 — Subsets with at least 2 elements
64−7=57
✓Final answerThe correct option is (C) — 57.
- COMEDK 2025Set 2025-E1 markMCQQ.Two finite sets have m and n elements. The total number of proper subsets of the first set is 119 more than the total number of subsets of the second set. Find the value of m−n (A) 4 (B) 6 (C) 8 (D) 1
›Reveal solutionSolution
The key idea is that the number of proper subsets of a set with m elements is 2m−1, and the number of subsets of a set with n elements is 2n. The given difference leads to 2m−2n=120, which factors as 2n(2m−n−1)=120, giving m−n=4.
We start by recalling the fundamental counting of subsets. For any finite set with k elements, the total number of subsets (including the empty set and the set itself) is 2k. A proper subset is any subset except the set itself, so the number of proper subsets is 2k−1.
The problem tells us:
- First set has m elements, so its proper subsets count = 2m−1.
- Second set has n elements, so its total subsets count = 2n.
- The difference is 119: (2m−1)−2n=119.
Let’s solve step by step.
- Set up the equation
2m−1−2n=119
Simplify:
2m−2n=120
- Factor the left side Since m>n (otherwise the difference couldn’t be positive), factor out 2n:
2n(2m−n−1)=120
-
Find integer powers of 2 that divide 120
120=23×15=8×15. So 2n must be a power of 2 that divides 120. The possible values for 2n are 1,2,4,8 (since 16 does not divide 120).
- If 2n=1, then n=0 and 2m−n−1=120 → 2m=121, not a power of 2.
- If 2n=2, then n=1 and 2m−1−1=60 → 2m−1=61, not a power of 2.
- If 2n=4, then n=2 and 2m−2−1=30 → 2m−2=31, not a power of 2.
- If 2n=8, then n=3 and 2m−3−1=15 → 2m−3=16, so m−3=4 → m=7.
-
Compute m−n
With m=7 and n=3, we get:
m−n=4
TipNotice that 120=8×15 and 15=24−1. This directly gives 2n=8 and 2m−n=16, so m−n=4 without checking other cases.
Watch outA common mistake is to forget that “proper subsets” excludes the set itself, so the first term is 2m−1, not 2m. Also, don’t confuse “subsets” (including empty set) with “proper subsets”.
✓Final answerThe correct option is (A).
ANSWER: A
- COMEDK 2024Set 2024-E1 markMCQQ.Two finite sets have 'm' and 'n' number of elements respectively. The total number of subsets of the first set is 112 more than the total number of subsets of the second set. Then the values of m and n are respectively. (A) 7, 4 (B) 7, 7 (C) 4, 4 (D) 4, 7
›Reveal solutionSolution
The number of subsets of a set with k elements is 2k. Setting 2m=2n+112 and testing small powers of 2 gives m=7, n=4, so the correct option is (A).
The key idea is that the number of subsets of a finite set grows exponentially with its size. For a set with k elements, the total number of subsets (including the empty set and the set itself) is 2k. The problem gives a relationship between two such powers of 2, and we need to find which pair (m,n) satisfies it.
- Translate the problem into an equation. The first set has m elements, so it has 2m subsets. The second set has n elements, so it has 2n subsets. The statement says:
2m=2n+112.
This is a simple exponential Diophantine equation.
-
Reason about the sizes.
Since 2m is larger than 2n by 112, m must be greater than n. Also, 112 is not a power of 2 (powers of 2 near 112 are 64, 128), so the difference is not trivial. We can try small values.
-
Test plausible values.
Let’s list powers of 2:
k123456782k248163264128256
We need 2m−2n=112.
- If m=7, then 27=128. Then 2n=128−112=16, so n=4. This works perfectly.
- If m=8, then 28=256. Then 2n=256−112=144, which is not a power of 2.
- If m=6, then 26=64, which is already less than 112, so impossible. Thus the only solution in small integers is m=7, n=4.
- Check the options. Option (A) is (7, 4). Option (D) is (4, 7), which would give 24=16 and 27=128, so 16=128+112? That’s false. So only (A) works.
Watch outA common mistake is to reverse the order: the first set has more subsets, so its size must be larger. Option (D) swaps them and gives a negative difference.
TipYou can also factor: 2n(2m−n−1)=112. Since 112 = 16×7, and 2m−n−1 must be odd, we get 2n=16 and 2m−n−1=7, so n=4 and m−n=3, giving m=7.
✓Final answerThe correct option is (A).
ANSWER: A
- COMEDK 2022Set 20221 markMCQQ.Total number of elements in the power set of A containing 17 elements is (A) 217+1 (B) 217−1 (C) 172−1 (D) 217
›Reveal solutionSolution
With n = 17, the power set has 2¹⁷ elements.
Concept: For a set with n elements, |P(A)| = 2ⁿ.
With n = 17, the power set has 2¹⁷ elements.
✓Final answerThe correct option is (D) — 217
ANSWER: D
- COMEDK 2021Set 20211 markMCQQ.Total number of elements in the power set of A containing 15 elements is (A) 215 (B) 152 (C) 215−1 (D) 215 − 1
›Reveal solutionSolution
The options are printed with lost superscripts; option (A) is 2^15, which is the required count. (Options (C)/(D) show 2^15 - 1, which would be the number of proper subsets, not the size of the power set.)
Concept: if a set A has n elements, its power set P(A) (the set of all subsets, including the empty set and A itself) has 2^n elements.
Here n = 15, so the number of elements of the power set is 2^15 (= 32768).
The options are printed with lost superscripts; option (A) is 2^15, which is the required count. (Options (C)/(D) show 2^15 - 1, which would be the number of proper subsets, not the size of the power set.)
✓Final answerThe correct option is (A) — 215
ANSWER: A
🎓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.