Sets Made Simple: Types, Subsets, Venn Diagrams and the Counting Formula

A friendly, first-principles walk through Class 11 Sets — what a set really is, its types, subsets and power sets, union/intersection/complement, and the n(A∪B) counting formula, with a fully solved survey problem. Your foundation for JEE, NEET and CUET.

Reviewed by (19 years teaching)Written with AI helpReport a mistake

8 min read · Published 23 July 2026

Part of Class 11 (CBSE) prep

Think of a WhatsApp Group

Picture your class WhatsApp group. A person is either a member or not — there is no 'maybe'. Nobody is added twice, and it does not matter who joined first. That is exactly a set: a well-defined collection of distinct things, with no repeats and no order. Master this one idea, dost, and the whole chapter falls into place — and you will reuse it all through JEE, NEET and CUET.

What Is a Set, Really?

A set is a well-defined collection of distinct objects. The key phrase is 'well-defined': for any object you must be able to answer a clear yes or no to 'does it belong?'. So 'the vowels in the English alphabet' is a set, but 'the beautiful cities of India' is not — 'beautiful' means different things to different people. We name sets with capital letters (A, B, X); the objects inside are called elements or members. We write a ∈ A to say 'a belongs to A', and b ∉ A to say 'b does not belong to A'.

Two ways to write a set. Roster (list) form: list every element in braces — V = {a, e, i, o, u}. Set-builder form: state the shared property — V = {x : x is a vowel in the English alphabet}. The colon ':' (or '|') is read as 'such that'. Repetition and order do not matter: {1, 2, 2, 3} = {3, 2, 1} = {1, 2, 3}.

Types of Sets You Must Know

Type of setMeaningExample
Empty (null) setHas no elements; written ∅ or { }{x : x is real, x² = −1} = ∅
Singleton setHas exactly one element{0}
Finite setCounting of elements comes to an end{1, 2, 3, 4}
Infinite setCounting never endsN = {1, 2, 3, …}
Equal setsExactly the same elements (A = B){1, 2, 3} = {3, 1, 2}
Equivalent setsSame number of elements, n(A) = n(B){a, b, c} and {1, 2, 3}
Universal set (U)Contains all objects under discussionFor digits, U = {0, 1, …, 9}
The empty set trips many students. ∅ (or { }) has zero elements. But {0} is NOT empty — it holds one element, the number 0. And {∅} is not empty either — it is a set holding one element, namely the empty set. Also remember: n(A), the cardinal number of A, simply counts its distinct elements, so n({a, b, c}) = 3.

Subsets and Power Sets

If every element of A is also in B, we say A is a subset of B, written A ⊆ B. Two facts follow at once: every set is a subset of itself (A ⊆ A), and the empty set is a subset of every set (∅ ⊆ A). If A ⊆ B but A ≠ B — that is, B has at least one extra element — then A is a proper subset of B, written A ⊂ B. The set of all subsets of A is its power set, P(A). If A has n elements, then P(A) has 2ⁿ elements, and the number of proper subsets is 2ⁿ − 1.

Listing every subset of a 3-element set

Let A = {1, 2, 3}, so the number of elements n = 3.

Number of subsets = 2ⁿ = 2³ = 8.

Size 0: ∅

Size 1: {1}, {2}, {3}

Size 2: {1, 2}, {1, 3}, {2, 3}

Size 3: {1, 2, 3}

Count: 1 + 3 + 3 + 1 = 8 subsets — matches 2³. ✓

So the power set P(A) has 8 elements, and A has 2³ − 1 = 7 proper subsets.

Union, Intersection and Complement

Union: A ∪ B = {x : x ∈ A or x ∈ B} (everything in either set; 'or' includes 'both'). Intersection: A ∩ B = {x : x ∈ A and x ∈ B} (only the common elements). Difference: A − B = {x : x ∈ A and x ∉ B} (in A but not in B). Complement: A′ = U − A = {x : x ∈ U and x ∉ A} (everything in U outside A). If A ∩ B = ∅ the sets are disjoint. Handy laws: (A′)′ = A, and De Morgan's rules (A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′.
Two mistakes examiners love to catch. (1) ∈ vs ⊂: the symbol ∈ links an element to a set (2 ∈ {1, 2, 3}), while ⊆/⊂ links a set to a set ({2} ⊆ {1, 2, 3}). Writing '2 ⊆ {1, 2, 3}' or '{2} ∈ {1, 2, 3}' is wrong. (2) A complement A′ only makes sense once the universal set U is fixed — the same set A can have different complements under different U.

Venn Diagrams and the Counting Formula

A Venn diagram draws U as a rectangle and each set as a circle inside it; the overlap shows common elements. To count elements of finite sets: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). We subtract n(A ∩ B) because the overlap was counted twice. For three sets: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(C ∩ A) + n(A ∩ B ∩ C).

Solved: a cricket-and-football survey

In a class of 40 students, 24 like cricket (C), 16 like football (F), and 6 like both.

Given: n(C) = 24, n(F) = 16, n(C ∩ F) = 6, total = 40.

At least one game: n(C ∪ F) = n(C) + n(F) − n(C ∩ F) = 24 + 16 − 6 = 34.

Neither game: total − n(C ∪ F) = 40 − 34 = 6.

Only cricket: n(C) − n(C ∩ F) = 24 − 6 = 18.

Only football: n(F) − n(C ∩ F) = 16 − 6 = 10.

Check: 18 (only C) + 10 (only F) + 6 (both) + 6 (neither) = 40. ✓

Quick Revision

  • A set is a well-defined collection of distinct, unordered elements; use ∈ / ∉ for membership.
  • Write sets in roster form {a, e, i, o, u} or set-builder form {x : x is a vowel}.
  • Know the types: empty, singleton, finite, infinite, equal, equivalent, universal.
  • ∅ is a subset of every set; a set with n elements has 2ⁿ subsets and 2ⁿ − 1 proper subsets.
  • A ∪ B = 'or', A ∩ B = 'and', A − B = 'in A not B', A′ = U − A; disjoint means A ∩ B = ∅.
  • Counting formula: n(A ∪ B) = n(A) + n(B) − n(A ∩ B).

Quick check

The set A = {a, b, c, d} has how many proper subsets?

Ready to test yourself?

Lock it in with the practice test for this chapter.

Take the practice test

Keep studying

See all Class 11 (CBSE) study material →