By the end of this chapter you'll be able to…

  • 1Represent sets in roster form and set-builder form and convert between the two
  • 2Classify sets as empty, finite, infinite, equal, and identify subsets and proper subsets
  • 3Compute power sets and apply the formula that |P(A)| = 2ⁿ
  • 4Perform union, intersection, difference, and complement operations and verify De Morgan's laws
  • 5Apply the cardinal number formula n(A∪B) = n(A)+n(B)−n(A∩B) to solve word problems
💡
Why this chapter matters
Sets form the foundational language of all mathematics — every subsequent chapter in Class 11 and 12 uses set notation. Mastering this chapter ensures fluency in mathematical communication and underpins probability, relations, and functions.

Sets

"A set is a Many that allows itself to be thought of as a One." — Georg Cantor

1. Chapter Overview

A SET is a well-defined collection of distinct objects. This is the FOUNDATION CHAPTER of Class 11 mathematics — the language and notation of sets is used throughout the entire syllabus. This chapter covers: representation of sets, types of sets, subsets, Venn diagrams (visual intuition), and operations on sets (union, intersection, difference, complement).


2. What Is a Set?

  • A SET is a well-defined COLLECTION of DISTINCT objects
  • The objects in a set are called ELEMENTS or MEMBERS
  • 'Well-defined' = given any object, you can UNAMBIGUOUSLY say whether it belongs to the set or not
  • Notation: Sets are denoted by CAPITAL letters (A, B, C...). Elements by small letters (a, b, x, y...)
  • 'a ∈ A' means 'a is an element of A'
  • 'b ∉ A' means 'b is NOT an element of A'

Representation of Sets

  • Roster (Tabular) form: List all elements within braces {}. Example: A = {2, 4, 6, 8}
  • Set-builder form: Describe the property that defines the elements. Example: A = {x : x is an even natural number less than 10}

3. Types of Sets

TypeDefinitionExample
Empty (Null) SetA set with NO elements. Denoted by ∅ or {}.{x : x is a natural number less than 1}
Singleton SetA set with EXACTLY ONE element{5}, {a}
Finite SetEmpty OR has a finite number of elements that can be COUNTED{1, 2, 3, ..., 100}
Infinite SetHas UNLIMITED (uncountable) number of elementsN = {1, 2, 3, ...} — the set of natural numbers
Equal SetsTwo sets with EXACTLY the SAME elements. Order doesn't matter.{1, 2, 3} = {3, 1, 2}

Some Standard Sets of Numbers

  • N: Natural numbers = {1, 2, 3, ...}
  • W: Whole numbers = {0, 1, 2, 3, ...}
  • Z: Integers = {..., -2, -1, 0, 1, 2, ...}
  • Q: Rational numbers = {p/q : p, q ∈ Z, q ≠ 0}
  • R: Real numbers
  • T (or Q'): Irrational numbers

4. Subsets

Definition

  • A set A is a SUBSET of B (A ⊆ B) if EVERY element of A is also an element of B
  • A ⊆ A (every set is a subset of ITSELF)
  • ∅ ⊆ A (the empty set is a subset of EVERY set)

Proper Subset

  • A is a PROPER subset of B (A ⊂ B) if A ⊆ B AND A ≠ B (B has at least one element not in A)

Key Facts

  • A = B if and only if A ⊆ B AND B ⊆ A
  • Power Set P(A): The set of ALL subsets of A. If A has n elements, P(A) has 2ⁿ elements.
  • Universal Set (U): The set containing ALL elements under consideration in a given context

Intervals as Subsets of R

NotationMeaning
(a, b){x : a < x < b} — OPEN interval
[a, b]{x : a ≤ x ≤ b} — CLOSED interval
[a, b){x : a ≤ x < b} — Semi-open/closed
(a, b]{x : a < x ≤ b} — Semi-open/closed

5. Venn Diagrams

  • VISUAL representation of sets using overlapping circles within a rectangle (the Universal set)
  • Developed by John Venn (1834–1923)
  • Powerful for understanding set operations visually
  • Union (A ∪ B): ALL elements in A OR B (or both). Shade combined region.
  • Intersection (A ∩ B): Elements COMMON to BOTH A and B. Shade overlap.
  • Difference (A − B): Elements in A but NOT in B.
  • Complement (A' or Aᶜ): Elements in U that are NOT in A.

6. Operations on Sets

Union — A ∪ B

  • A ∪ B = {x : x ∈ A OR x ∈ B}
  • Commutative: A ∪ B = B ∪ A
  • Associative: (A ∪ B) ∪ C = A ∪ (B ∪ C)
  • A ∪ ∅ = A. A ∪ U = U. A ∪ A = A.

Intersection — A ∩ B

  • A ∩ B = {x : x ∈ A AND x ∈ B}
  • Commutative: A ∩ B = B ∩ A
  • Associative: (A ∩ B) ∩ C = A ∩ (B ∩ C)
  • A ∩ ∅ = ∅. A ∩ U = A. A ∩ A = A.

Distributive Laws

  • A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
  • A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Complement of a Set — A'

  • A' = U − A = {x ∈ U : x ∉ A}
  • (A')' = A
  • A ∪ A' = U. A ∩ A' = ∅.
  • De Morgan's Laws:
    • (A ∪ B)' = A' ∩ B'
    • (A ∩ B)' = A' ∪ B'

Difference — A − B

  • A − B = {x : x ∈ A AND x ∉ B}

Cardinal Number

  • n(A ∪ B) = n(A) + n(B) — n(A ∩ B)
  • n(A ∪ B ∪ C) = n(A) + n(B) + n(C) — n(A ∩ B) — n(B ∩ C) — n(A ∩ C) + n(A ∩ B ∩ C)

7. Practical Applications

  • Sets are used in: probability, logic, database queries, computer science, statistics
  • Venn diagrams: visualise survey problems (how many people like tea, coffee, both, neither?)
  • The language of mathematics is built on SET THEORY

8. Exam Focus

  1. Roster vs Set-builder form
  2. Subsets, proper subsets, power set (2ⁿ formula)
  3. Intervals as subsets of R
  4. Union, Intersection — laws (commutative, associative, distributive)
  5. De Morgan's Laws
  6. Cardinal number formula — n(A ∪ B)
  7. Venn diagram problem-solving

9. Key Formulas

  • n(Power Set) = 2ⁿ (where n = number of elements in original set)
  • n(A ∪ B) = n(A) + n(B) — n(A ∩ B)
  • De Morgan: (A ∪ B)' = A' ∩ B' ; (A ∩ B)' = A' ∪ B'
  • Distributive: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

10. Conclusion

Sets are the ALPHABET of mathematical language:

  • Element, subset, union, intersection — vocabulary you'll use in EVERY subsequent math chapter
  • Venn diagrams — the visual tool for understanding logical relationships
  • De Morgan's Laws — fundamental to logic, probability, and computer science

'In the beginning, God created the integers. All the rest is the work of man.' — Leopold Kronecker. And the integers, gathered together, form a set. Mathematics begins here.

Key formulas & results

Everything you need to memorise, in one card. Screenshot this for revision.

Cardinality of Union (two sets)
n(A∪B) = n(A) + n(B) − n(A∩B)
Used to solve survey-type word problems
Cardinality of Union (three sets)
n(A∪B∪C) = n(A)+n(B)+n(C)−n(A∩B)−n(B∩C)−n(A∩C)+n(A∩B∩C)
Extension for three overlapping sets
Power Set Cardinality
|P(A)| = 2ⁿ
n is the number of elements in set A
De Morgan's Law (complement of union)
(A∪B)' = A'∩B'
Complement distributes by flipping union to intersection
De Morgan's Law (complement of intersection)
(A∩B)' = A'∪B'
Complement distributes by flipping intersection to union
Distributive Law
A∪(B∩C) = (A∪B)∩(A∪C)
Union distributes over intersection
⚠️

Common mistakes & fixes

These are the exact errors that cost students marks in board exams. Read them once, save yourself the trouble.

WATCH OUT
Writing the empty set as {∅} instead of ∅ or {}
{∅} is a set CONTAINING the empty set (it has one element). The empty set itself is ∅ or {} with no elements.
WATCH OUT
Confusing subset (⊆) with proper subset (⊂)
A⊆A is always true (every set is a subset of itself). A⊂A is NEVER true — a proper subset requires at least one extra element in the other set.
WATCH OUT
Forgetting that ∅ is a subset of every set
∅⊆A is true for any set A. The empty set is a subset of every set, including itself.
WATCH OUT
Using n(A)+n(B) without subtracting n(A∩B) in union problems
Elements in the intersection are counted twice when you add n(A) and n(B). Always subtract n(A∩B): n(A∪B) = n(A)+n(B)−n(A∩B).

Practice problems

Try each one yourself before tapping "Show solution". Active recall > rereading.

Q1EASY· Power Set
If A = {a, b, c}, write the power set P(A) and state its cardinality.
Show solution
P(A) = {∅, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}}. Cardinality = 2³ = 8 elements.
Q2MEDIUM· Cardinality Formula
In a class of 60 students, 35 play cricket, 28 play football, and 15 play both. How many students play neither sport?
Show solution
Step 1: n(C∪F) = n(C)+n(F)−n(C∩F) = 35+28−15 = 48. Step 2: Students playing at least one sport = 48. Step 3: Students playing neither = 60−48 = 12.
Q3HARD· De Morgan's Laws
If U = {1,2,3,4,5,6,7,8}, A = {1,3,5,7}, B = {2,3,4,5}, verify De Morgan's law: (A∪B)' = A'∩B'.
Show solution
Step 1: A∪B = {1,2,3,4,5,7}. Step 2: (A∪B)' = U−(A∪B) = {6,8}. Step 3: A' = {2,4,6,8}, B' = {1,6,7,8}. Step 4: A'∩B' = {6,8}. Since (A∪B)' = A'∩B' = {6,8}, De Morgan's law is verified.

5-minute revision

The whole chapter, distilled. Read this the night before the exam.

  • Empty set ∅ has 0 elements; power set of A with n elements has exactly 2ⁿ subsets
  • A⊆B means every element of A is in B; A=B iff A⊆B AND B⊆A
  • n(A∪B) = n(A)+n(B)−n(A∩B): must subtract the intersection to avoid double-counting
  • De Morgan's Laws: (A∪B)' = A'∩B' and (A∩B)' = A'∪B'
  • Distributive Laws: A∪(B∩C)=(A∪B)∩(A∪C) and A∩(B∪C)=(A∩B)∪(A∩C)
  • Complement: A∪A'=U and A∩A'=∅ and (A')'=A
  • Open interval (a,b) excludes endpoints; closed interval [a,b] includes them
  • Standard sets: N⊂W⊂Z⊂Q⊂R; every real number is either rational or irrational

CBSE marks blueprint

Where the marks come from in this chapter — so you can plan your prep.

Typical chapter weightage: 4-6 marks

Question typeMarks eachTypical countWhat it tests
Short Answer21-2Roster/set-builder form conversion, power set, subset identification
Long Answer41Word problem using n(A∪B) formula or Venn diagram with three sets
Prep strategy
  • Memorise the cardinal number formulas for two and three sets — they appear in almost every exam
  • Practice converting between roster and set-builder form with varied examples (number sets, alphabet sets)
  • Draw Venn diagrams for every word problem — visual representation prevents formula errors

Where this shows up in the real world

This chapter isn't just an exam topic — it lives in the world around you.

Database Queries (SQL)

SQL UNION and INTERSECT operations are direct implementations of set union and intersection — used in every database-driven application.

Market Research Surveys

When analysing survey results ('how many customers use product A AND B'), the cardinal number formula n(A∪B) prevents double-counting respondents.

Logic and Circuit Design

De Morgan's laws are fundamental in digital electronics — they allow AND gates to be converted to OR gates, simplifying circuit design.

Exam strategy

Battle-tested tips from teachers and toppers for this chapter.

  1. For word problems, define sets clearly first (e.g., let C = set of cricket players) before applying any formula
  2. In three-set problems, always fill in the Venn diagram from the innermost region (A∩B∩C) outward
  3. When asked to verify De Morgan's laws, compute both sides independently and show they match
  4. Don't leave the power set question partially done — list ALL 2ⁿ subsets systematically to avoid missing any

Going beyond the textbook

For olympiad aspirants and curious learners — topics that build on this chapter.

  • Symmetric difference: A△B = (A−B)∪(B−A) — properties and inclusion-exclusion with multiple sets
  • Infinite set cardinality: Cantor's notion that N and Z have the same cardinality (countably infinite) but R is uncountably infinite

Where else this chapter is tested

CBSE board isn't the only one — other exams test this chapter too.

CBSE Class 11 BoardHigh
JEE MainMedium
NDA MathematicsMedium

Questions students ask

The real ones — pulled from the Q&A community and tutor sessions.

No. {0} is a set containing the number 0 — it has one element. The empty set ∅ has zero elements.

2⁴ = 16 subsets, including ∅ and the set itself. Among these, 14 are proper subsets (all except the set itself).

Only when A and B are DISJOINT — they share no common elements (A∩B = ∅). Otherwise you must subtract n(A∩B).
Verified by the tuition.in editorial team
Last reviewed on 26 May 2026. Written and reviewed by subject-matter experts — read about our process.
Editorial process →
Header Logo