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. …
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2025Set ANNUAL1 markMCQQ.The number of non-empty proper subsets of the set A containing n elements is(a) 2n(b) 2n−1(c) 2n+1(d) 2n+1
›Reveal solutionSolution
A set with n elements has 2n subsets in total; removing only the set itself (the standard convention this question bank uses for "proper subset") leaves 2n−1.
A set A with n elements has exactly 2n subsets in all, since each of the n elements is independently either included or excluded (2 choices per element, so 2×2×⋯×2 (n times) =2n).
A proper subset of A is any subset that is not equal to A itself, so removing the one subset equal to A gives 2n−1 proper subsets.
…
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2025Set ANNUAL1 markMCQQ.Assertion (A): Let A={1,2,3}, B={1,2,3,4} then B⊂A. Reason (R): If every element of X is also an element of Y, then X is a subset of Y.(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).(b) Both Assertion (A) and Reason (R) are true and Reason (R) is not the correct explanation of the Assertion (A).(c) Assertion (A) is true, but Reason (R) is false.(d) Assertion (A) is false, but Reason (R) is false.
›Reveal solutionSolution
A={1,2,3} and B={1,2,3,4}: since 4∈B but 4∈/A, B⊂A — the Assertion is false.
Assertion (A) claims B⊂A where A={1,2,3}, B={1,2,3,4}. For B⊂A to hold, EVERY element of B must also be in A. But 4∈B while 4∈/A, so the containment fails — Assertion (A) is FALSE. (In fact it is A that is a proper subset of B, the reverse of what's claimed.)
Reason (R) states the correct, standard definition of "subset" (if every element of X is also in Y, then X is a subset of Y) — as a definition, (R) itself is a TRUE statement.
…
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2023Set ANNUAL1 markQ.If A = {a, b, c}, write down the power set of A.
›Reveal solutionSolution
The power set of A={a,b,c} has 23=8 elements: the empty set, every single-element subset, every pair, and A itself.
The power set P(A) of a set A is the set of all subsets of A, including the empty set ∅ and A itself. For a set with n elements, P(A) has 2n elements. Here A={a,b,c} has n=3 elements, so P(A) has 23=8 elements.
Listing every subset by size:
- Size 0: ∅ …
🎓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.