Sets, Power Set and Algebra of Sets: JEE Main
Reviewed Last updated 2026-11-20. Syllabus topic: Sets, power set and algebra of sets.
In short. A set with n elements has 2ⁿ subsets, so its power set has 2ⁿ elements. Union, intersection and complement obey the distributive and De Morgan laws, and n(A union B) = n(A) + n(B) - n(A intersection B) turns most word problems into arithmetic.
- A set with n elements has 2ⁿ subsets, 2ⁿ - 1 proper subsets and 2ⁿ - 2 non-empty proper subsets.
- De Morgan: (A union B)' = A' intersection B' and (A intersection B)' = A' union B'.
- A - B = A intersection B' and A is a subset of B exactly when A union B = B.
- Inclusion-exclusion: n(A union B union C) = sum of singles - sum of pairs + triple.
- When every element independently chooses a state, the count is (number of states)ⁿ, for example 3ⁿ pairs (A, B) with A union B = X.
Syllabus line: SETS, RELATIONS AND FUNCTIONS: Sets and their representation; Union, intersection and complement of sets and their algebraic properties; Power set; Relations, type of relations, equivalence relations, functions; one-one, into and onto functions, the composition of functions. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 1 (https://jeemain.nta.nic.in/document/syllabus-2026/))
Before you start
Prerequisites
- Combinations and selections: Subset counting uses C(n,k) and the idea of in-or-out choices. Read this first if C(n,k) is not automatic.
Related topics
- Relations and equivalence relations
- Functions: one-one, onto and composition
- Combinations and selections
- Sets, Relations and Functions (lesson planned)
The concept step by step
Step 1: Describe a set and test equality
A set is described by listing its elements or by a rule. Repeats and order are ignored. To show A = B, prove A is a subset of B and B is a subset of A. Keep phi (no elements) and phi (one element) apart.
Step 2: Operations and complement
Union means or, intersection means and, complement means not, and A - B means in A and not in B, which is A intersection B'. Draw a Venn diagram with every region labelled; most identities become visible at once.
Step 3: Algebraic laws and De Morgan
Union and intersection are commutative, associative and distribute over each other. De Morgan flips the operation when a complement is taken: the complement of a union is the intersection of the complements, and the other way round. Use these to simplify expressions.
Step 4: The power set
Each element is in or out of a subset, so n elements give 2ⁿ subsets. Remove phi and the set itself for non-empty proper subsets (2ⁿ - 2). Applying the rule twice gives 2^(2ⁿ) for P(P(A)). Remember that P(phi) = phi.
Step 5: Counting with inclusion-exclusion
Add the single sizes, subtract the pairwise overlaps, add back the triple overlap. For exactly-k questions subtract the multiple-counted pieces. For pairs of subsets of X, assign each element a state; the count is the number of states raised to n(X).
Worked examples
Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.
Example 1 (easy)
A set has 5 elements. Find the number of non-empty proper subsets.
| Step | Marks |
|---|---|
| The total number of subsets is 2⁵ = 32. | 1 |
| Remove the empty set and the set itself: 32 - 2. | 1 |
| The number of non-empty proper subsets is 30. | 1 |
| Total: 3 marks | 3 |
Answer: 30
Fast method: Use 2ⁿ - 2.
Sanity check: The 5 singletons and 5 sets of size 4 alone give 10, and C(5,2) + C(5,3) = 20 more, so 30 is of the right size.
Example 2 (easy)
In a universal set of 40 elements, n(A) = 18, n(B) = 12 and n(A intersection B) = 5. Find n(A' intersection B').
| Step | Marks |
|---|---|
| n(A union B) = 18 + 12 - 5 = 25. | 1 |
| By De Morgan, A' intersection B' = (A union B)'. | 1 |
| Its size is 40 - 25 = 15. | 1 |
| Total: 3 marks | 3 |
Answer: 15
Fast method: Complement of the union: 40 - (18 + 12 - 5).
Sanity check: The union cannot exceed 40 and the complement 15 lies between 0 and 40, as it must.
Example 3 (medium)
Among the integers 1 to 30, how many are divisible by 4 but not by 6?
| Step | Marks |
|---|---|
| Multiples of 4 up to 30 are 4, 8, ..., 28: 7 numbers. | 1 |
| Those also divisible by 6 are divisible by 12: 12 and 24. | 1 |
| A - B = A minus (A intersection B) gives 7 - 2 = 5. | 1 |
| Total: 3 marks | 3 |
Answer: 5
Fast method: n(A - B) = n(A) - n(A intersection B), with the intersection being multiples of lcm(4,6) = 12.
Sanity check: The five numbers are 4, 8, 16, 20, 28, none divisible by 6.
Example 4 (medium)
If A has 3 elements, find the number of elements in P(P(A)). Why is 2⁶ wrong?
| Step | Marks |
|---|---|
| n(P(A)) = 2³ = 8. | 1 |
| P(P(A)) is the power set of a set with 8 elements, so it has 2⁸ elements. | 1 |
| 2⁸ = 256, not 2⁶ = 64. | 1 |
| Total: 3 marks | 3 |
Answer: 256
Fast method: Apply the power set rule twice: 2^(2ⁿ).
Sanity check: A set with 8 elements has 256 subsets, far more than the 8 of P(A), which fits the doubling at each application.
Example 5 (hard, multi-step)
In a class of 60 students, 28 play cricket, 25 football and 20 hockey; 10 play cricket and football, 8 play football and hockey, 6 play cricket and hockey, and 3 play all three. How many play exactly two of the sports?
| Step | Marks |
|---|---|
| Number playing at least one: 28 + 25 + 20 - 10 - 8 - 6 + 3 = 52 (so 8 play none). | 2 |
| Each student counted in a pairwise intersection who plays all three is counted three times there. | 1 |
| Exactly two = (10 + 8 + 6) - 3 x 3 = 15. | 2 |
| So 15 students play exactly two sports. | 1 |
| Total: 6 marks | 6 |
Answer: 15
Fast method: Exactly two = sum of pairwise intersections - 3 x triple intersection.
Sanity check: Exactly one = 52 - 15 - 3 = 34, and 34 + 15 + 3 + 8 (none) = 60, the class size.
Example 6 (hard, multi-step)
X has 5 elements. Find the number of ordered pairs (A, B) of subsets of X with A union B = X and A intersection B having exactly one element.
| Step | Marks |
|---|---|
| Choose the single common element: 5 ways. | 1 |
| Each of the other 4 elements must be in A only or B only (not both, not neither): 2 ways each, 2⁴ = 16. | 2 |
| Total = 5 x 16 = 80. | 1 |
| Total: 4 marks | 4 |
Answer: 80
Fast method: Choose the shared element, then split the rest into two states each: n x 2^(n-1).
Sanity check: The 3⁵ = 243 pairs with union X include 80 with exactly one common element, a proper part, as it should be.
Formulas and units
| Result | Formula | Valid when | Units or note | Worked example |
|---|---|---|---|---|
| Subsets of an n-set | n(P(A)) = 2ⁿ | A finite with n elements | dimensionless count | Example 1 |
| Proper / non-empty proper subsets | 2ⁿ - 1 / 2ⁿ - 2 | A finite with n elements, n >= 1 for the second form | dimensionless count | Example 1 |
| Double power set | n(P(P(A))) = 2^(2ⁿ) | A finite with n elements | dimensionless count | Example 4 |
| Two sets | n(A union B) = n(A) + n(B) - n(A int B) | A and B finite sets | dimensionless count | Example 2 |
| Exactly one of two | n(A) + n(B) - 2 n(A int B) | A and B finite sets | dimensionless count | none |
| Three sets | sum singles - sum pairs + triple | A, B, C finite sets (inclusion-exclusion) | dimensionless count | Example 5 |
| De Morgan | (A union B)' = A' int B'; (A int B)' = A' union B' | A and B subsets of a universal set | sets | Example 2 |
| Pairs (A, B) of subsets of an n-set | A union B = X: 3ⁿ; A subset of B: 3ⁿ; disjoint: 3ⁿ | A, B subsets of an n-element set X | dimensionless count | none |
Common mistakes and speed
- Counting P(P(A)) as 2^(2n). Why it tempts: Applying the rule twice looks like doubling the exponent, but the second power set works on 2ⁿ elements.
- Using 4 states per element for A union B = X. Why it tempts: Two sets suggest 2 x 2 = 4 choices, but the state "in neither" is not allowed when the union is the whole set.
- Forgetting to subtract the empty set or the set itself in "non-empty proper". Why it tempts: 2ⁿ is the first formula recalled and the words proper and non-empty are read last.
- Taking the number "exactly one" as n(A union B). Why it tempts: The union includes the people in both sets, which the question excludes.
Time per question and fast method
Target: about 80 seconds per question.
Decide the type first: a power-set count is 2ⁿ (or 2^(2ⁿ)), a survey is inclusion-exclusion, a pair-of-subsets count is statesⁿ. Write the Venn regions only when a question asks for exactly one or exactly two.
Recall quiz
Pick an option for each question. Your answers stay on this page and are not sent anywhere.
Score: 0 of 6 correct. Pick an option for each question.
Practice
- A set A has 4 elements. The number of proper subsets of the power set of A is Verified (T1)
- In a survey of 100 people, 60 like tea, 45 like coffee and 20 like neither drink. The number of people who… Verified (T1)
- The number of integers from 1 to 100 (both included) that are divisible by at least one of 2, 3 and 5 is Verified (T1)
- Let X = 1, 2, 3, 4, 5, 6. The number of ordered pairs (A, B) of subsets of X with A union B = X is Verified (T1)
- Let X = 1, 2, 3, 4. The number of ordered pairs (A, B) of subsets of X such that A is a proper subset of B is Verified (T3)
Previous-year questions
Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.
Going deeper and revision
Representation, types and equality of sets
A set is a collection of distinct, well-defined objects. It is written in roster form 1, 2, 3 or set-builder form x : x is a positive integer less than 4. Order and repetition do not matter, so 1, 2, 2, 3 = 3, 1, 2. The empty set (phi) has no elements, and phi is not empty: it has one element. A is a subset of B when every element of A is in B; every set is a subset of itself and phi is a subset of every set. A proper subset is a subset that is not equal to the set. Intervals such as [1, 5] and the sets N, Z, Q, R are the usual universal sets in exam questions. Two sets are equal exactly when each is a subset of the other, which is the standard way to prove a set identity.
Union, intersection, complement, difference and the algebraic laws
A union B holds elements in A or B or both; A intersection B holds elements in both; the complement A' holds elements of the universal set not in A; the difference A - B = A intersection B' holds elements of A not in B. Laws: commutative, associative, idempotent (A union A = A), identity (A union phi = A, A intersection U = A), distributive A intersection (B union C) = (A intersection B) union (A intersection C) and the dual, and De Morgan (A union B)' = A' intersection B', (A intersection B)' = A' union B'. The following are equivalent: A is a subset of B, A union B = B, A intersection B = A, B' is a subset of A', and A - B = phi. The symmetric difference (A - B) union (B - A) holds elements in exactly one of A and B.
Power set: size, structure and edge cases
The power set P(A) is the set of all subsets of A. If n(A) = n then n(P(A)) = 2ⁿ, because each element is either in or out of a subset; subsets of size k number C(n,k) and these add to 2ⁿ. P(A) is never empty because it contains phi and A. Edge cases that examiners use: P(phi) = phi has 1 element, P(P(phi)) has 2 elements, and n(P(P(A))) = 2^(2ⁿ). Also A is a subset of B exactly when P(A) is a subset of P(B), and P(A) intersection P(B) = P(A intersection B), but P(A) union P(B) is a subset of P(A union B) with equality only when one of A, B contains the other. The number of subsets of A that contain a fixed k elements is 2^(n-k).
Counting with sets: inclusion-exclusion and three-state choices
For finite sets n(A union B) = n(A) + n(B) - n(A intersection B), and for three sets n(A union B union C) = n(A) + n(B) + n(C) - n(A intersection B) - n(B intersection C) - n(A intersection C) + n(A intersection B intersection C). The number in exactly one of A and B is n(A) + n(B) - 2 n(A intersection B). Exactly two of three sets: sum of pairwise intersections - 3 x triple intersection. For problems about pairs of subsets of X with n elements, give each element a state: for A union B = X there are 3 states (A only, B only, both), so 3ⁿ pairs; for A intersection B = phi also 3ⁿ (A only, B only, neither); for A a subset of B also 3ⁿ (neither, B only, both). Edge case: always subtract the degenerate cases when the word proper or non-empty appears.
Memory hook
Suppose a mess offers dal, sabzi and curd, and you may put each of them on your plate or leave it out. Each item is either in or out, so the number of possible plates, counting the empty plate, is 2 x 2 x 2 = 8.
- Suppose we list the plates by number of items: the empty plate (1 way), one item (3 ways), two items (3 ways), all three (1 way).
- Adding, 1 + 3 + 3 + 1 = 8, the same as the direct count 2³.
- Taking the full thali as the universal set, "dal or sabzi" is a union and "dal and sabzi" an intersection; the plates without dal are the complement of the plates with dal.
A plate is a subset of the menu, so all possible plates form the power set, which has 2ⁿ elements for n items.
Each item is in or out, so n items make 2ⁿ subsets.
Revision card
Try to answer each without looking above.
- How many subsets, proper subsets and non-empty proper subsets does an n-element set have?
- State both De Morgan laws.
- Write A - B in terms of intersection and complement.
- How many elements does P(P(A)) have for n(A) = n?
- Write inclusion-exclusion for three sets.
- How many ordered pairs (A, B) of subsets of an n-set satisfy A union B = X, and why?
Sources and review
Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.
- Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (by the verifier; see the report)
- Reviewer: independent verifier agent run (not the author)
- Date: 2026-11-20
- Defects found: 1; fixed: 1
- Report: content/reviews/learn5-set-2026-11-20.md
Textbook references
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 1: Sets, 1.5 Equal Sets (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 1: Sets, 1.6 Subsets (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 1: Sets, 1.10 Complement of a Set (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 1: Sets, Summary Summary (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 1: Sets, 1.9 Operations on Sets (read 2026-11-22)
Sources used
- Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 1, line id jee-main-2026-U01 in syllabus/lines/jee-main/2026.json
- NCERT Class 11 Mathematics, Sets (read as a reference for scope only; content written fresh for this site, textbook section references still pending)
How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.