Mathematics · Sets and Functions · Chapter notes

Sets · Class 11 Maths Notes

Class 11 notes on Sets: notation, types of sets, the power set, operations with Venn diagrams, De Morgan's laws and the cardinality formula, with worked examples and a formula sheet.

Class 11JEE MainCBSE BoardsNCERTFree, no sign up
14Pages
5Sections
VennDiagrams

In short

A set is a well-defined collection, and that phrase is doing real work: membership must be decidable, so the collection of tall people is not a set. Everything else in the chapter is notation for combining sets, plus one counting formula, n(A∪B) = n(A) + n(B) − n(A∩B), that removes the double count.

Contents
  1. 1What Is a Set? Notation and description
  2. 2Types of Sets Empty, finite, equal, subsets
  3. 3The Power Set and Counting Subsets
  4. 4Operations on Sets Union, intersection, De Morgan
  5. 5The Cardinality Formula Inclusion-exclusion
  6. ·Sets: One-Page Formula Sheet
1

What Is a Set?

A set is simply a well-defined collection of distinct objects. That word well-defined is the whole idea: given any object, there must be an unambiguous yes or no answer to whether it belongs. Sets are the language in which all of modern mathematics is written.

NOTATION AND MEMBERSHIP

Sets are named with capital letters and their members listed in braces. If a is a member of A we write a ∈ A; if not, a ∉ A. Order does not matter and repetition is ignored: {1, 2, 2, 3} is the same set as {1, 2, 3}.

★ TWO WAYS TO DESCRIBE A SET

Roster (tabular) form: list every element, for example A = {2, 4, 6, 8}.
Set-builder form: state the defining property, for example A = {x : x is an even natural number less than 10}. Set-builder is essential when a set is infinite or too large to list.

2

Types of Sets

A handful of named sets appear again and again. Knowing them removes most of the confusion in this chapter.

SetMeaningExample
Empty (null) set ∅Has no elements{x : x² = −1, x real}
SingletonExactly one element{5}
Finite setCountable, ends{1, 2, 3}
Infinite setNever endsN, Z, R
Equal setsSame elements{1,2}={2,1}
Equivalent setsSame number of elements{a,b} & {1,2}
★ SUBSETS

A is a subset of B (written A ⊆ B) if every element of A is also in B. If A ⊆ B but A ≠ B, then A is a proper subset (A ⊂ B). The empty set is a subset of every set, and every set is a subset of itself.

3

The Power Set and Counting Subsets

Collecting all subsets of a set produces a new, larger set, and counting them gives a clean formula that JEE loves.

★ POWER SET

The power set P(A) is the set of all subsets of A, including ∅ and A itself. If A has n elements, then:

number of subsets = 2n
number of proper subsets = 2n − 1
number of non-empty subsets = 2n − 1

Each element is either in or out of a given subset, two choices each, giving 2n combinations.

EXAMPLE · COUNTING SUBSETS

If A = {a, b, c}, then n = 3, so A has 2³ = 8 subsets and 8 − 1 = 7 proper subsets. For a set of 5 elements there are 2⁵ = 32 subsets and 31 proper subsets.

4

Operations on Sets

Sets combine through three basic operations. A Venn diagram makes each one obvious.

★ UNION, INTERSECTION, DIFFERENCE

Union A ∪ B: everything in A or B (or both).
Intersection A ∩ B: only what is in both.
Difference A − B: in A but not in B.
Complement A': everything in the universal set U that is not in A.

UABA∩B
A Venn diagram of two sets inside the universal set U. The overlap is the intersection A∩B; together the two circles form the union A∪B.
UABCthree-set regions: singles, pairs, and the centre A∩B∩C
Three overlapping sets create seven distinct regions: three for elements in one set only, three for each pair's overlap, and one central region for A∩B∩C.
★ DE MORGAN'S LAWS

Two identities that convert complements of combinations, used constantly in logic and probability:

(A ∪ B)' = A' ∩ B'
(A ∩ B)' = A' ∪ B'

In words: the complement of a union is the intersection of the complements, and vice versa. The operation flips when you take the complement.

5

The Cardinality Formula

Counting the elements of a union is one of the most common exam applications, especially in word problems.

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(C∩A) + n(A∩B∩C)
WHY SUBTRACT THE OVERLAP

When you add n(A) and n(B), the elements in both sets get counted twice, so you subtract n(A ∩ B) once to correct it. This is the inclusion-exclusion principle, and the three-set version simply extends the same idea.

EXAMPLE · A SURVEY PROBLEM

In a class, 30 students like tea, 25 like coffee, and 12 like both. How many like at least one? n(T ∪ C) = 30 + 25 − 12 = 43. If the class has 50 students, then 50 − 43 = 7 like neither.

Sets: One-Page Formula Sheet

Everything for revision day.
BASICS
set: well-defined collection
a ∈ A or a ∉ A
roster vs set-builder
order & repeats ignored
TYPES
∅: empty set
singleton: one element
equal: same elements
equivalent: same count
SUBSETS
A ⊆ B: all of A in B
A ⊂ B: proper subset
∅ ⊆ every set
A ⊆ A always
POWER SET
P(A): all subsets
subsets = 2^n
proper = 2^n − 1
non-empty = 2^n − 1
OPERATIONS
A∪B: in either
A∩B: in both
A−B: in A not B
A': complement in U
KEY LAWS
De Morgan: (A∪B)'=A'∩B'
(A∩B)'=A'∪B'
n(A∪B)=n(A)+n(B)−n(A∩B)
inclusion-exclusion
You have read it

Now play it.

Reading a chapter and understanding it are different things. In the app this chapter becomes a game you play, a short read, then practice that tests you at every step. A full chapter, understood, in 45 to 60 minutes. Free to start.

  1. A Logic Bloom concept game: a simulation you change and watch, before any of the language
    PlayA game built for the concept
  2. A short NCERT-aligned explainer in the Logic Bloom app
    ReadThe short NCERT explainer
  3. Timed practice questions in the Logic Bloom app
    PracticeTimed, until it sticks

Still stuck at 11pm? TarQPro reads the answer you got wrong and teaches the idea behind it, not just the right option.