Q.Let A = { a, e, i, o, u} and B = { a, b, c, d }. Is A a subset of B ? No. (Why?). Is B a subset of A? No. (Why?)
🔒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 →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} |
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. …
A⊆B requires every element of A to be in B; one missing element is enough to disprove it.
Is A⊆B? A={a,e,i,o,u}, B={a,b,c,d}: e∈A but e∈/B (also i,o,u) ⟹ A is not a subset of B. …
A⊆B fails whenever some element of A is missing from B, and vice versa. Here A={a,e,i,o,u} and B={a,b,c,d} share only the element a — every other element of each set is missing from the other, so A is not a subset of B, and B is not a subset of A.
Understanding why the subset test can fail both ways
A⊆B holds only when every element of A is also in B. To disprove it, it is enough to find just one element of A that is not in B.
Is A a subset of B?
A={a,e,i,o,u}, B={a,b,c,d}.
- Check each element of A against B: a∈B, but e∈/B.
- Since e∈A and e∈/B, the subset condition already fails on this one element (i, o, and u also fail the same way, but one counterexample is enough).
- A is not a subset of B, because A contains vowels like e,i,o,u that B does not have.
Is B a subset of A?
B={a,b,c,d}, A={a,e,i,o,u}.
- Check each element of B against A: a∈A, but b∈/A. …
1. Concept First — Set Membership and Subsets
The idea being tested here is Set Membership and Subset Relationship.
- A set is a collection of distinct objects (elements).
- A set A is a subset of set B (written A⊆B) if every element of A is also an element of B.
- If even one element of A is not in B, then A is not a subset of B.
Intuition: Think of a subset like a "smaller club within a bigger club." If you want to say "all members of Club A are also members of Club B," you must check every single member of A. If any member of A is missing from B, the statement fails.
2. Step-by-Step Reasoning
Step 1: Check if A⊆B
We have:
- A={a,e,i,o,u}
- B={a,b,c,d}
What we need to do: For each element in A, check if it is present in B.
- a is in B? ✓ Yes (both sets contain a).
- e is in B? ✗ No — B has only a,b,c,d.
- i is in B? ✗ No.
- o is in B? ✗ No.
- u is in B? ✗ No.
Conclusion: Since e,i,o,u are not in B, A is not a subset of B.
Why this matters: The condition for subset is all elements must match. Even one missing element breaks the relationship.
Step 2: Check if B⊆A
Now reverse the roles:
- B={a,b,c,d}
- A={a,e,i,o,u}
Check each element of B against A:
- a is in A? ✓ Yes.
- b is in A? ✗ No — A contains only vowels.
- c is in A? ✗ No.
- d is in A? ✗ No.
Conclusion: Since b,c,d are not in A, B is not a subset of A.
3. Final Answer
-
A⊆B? No.
Reason: e,i,o,u∈A but e,i,o,u∈/B.
-
B⊆A? No. …
The Correct Answer
If A⊂B, then A∪B=B.
Why?
Because every element of A is already inside B. So when you take the union (all elements in A or in B), you don’t add anything new beyond what B already has. The union just gives back B.
Common Mistakes & How to Avoid Them
Mistake 1: Writing A∪B=A
- What students think: “Since A is inside B, the union is just the smaller set A.”
- Why it’s wrong: The union must include everything from both sets. B has extra elements that A doesn’t have — those must be included.
- How to avoid: Draw a Venn diagram. Shade A and B separately, then shade the union. You’ll see the larger set B is fully covered.
Mistake 2: Writing A∪B=A∩B
- What students think: “If one is inside the other, union and intersection are the same.”
- Why it’s wrong:
- A∪B = all elements in either set = B (the bigger one).
- A∩B = only elements in both sets = A (the smaller one). They are equal only if A=B.
- How to avoid: Memorise the difference:
- Union → bigger set (or equal).
- Intersection → smaller set (or equal).
Mistake 3: Forgetting the special case A=B
- What students think: “If A⊂B, then A is strictly smaller.”
- Why it’s wrong: In many textbooks, A⊂B allows A=B (some use ⊆ for that). If A=B, then A∪B=A=B — still correct, but students sometimes panic. …
- 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. …
- 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. …
- 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. …
- 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ⁿ. …
- 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). …
🎓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.