Class 11 Maths Sets Relations and Functions — Samacheer Kalvi Notes
Complete Samacheer Kalvi Class 11 Maths Chapter 1 notes: sets, types of sets, Venn diagrams, relations, functions, domain, range, and board exam tips.
Updated 8 June 20266 min read
Quick Summary
Sets, Relations and Functions is the foundation of Class 11 Maths. It introduces the language of modern mathematics — sets give a way to group objects, relations describe connections between sets, and functions are the core tool used in calculus, algebra, and beyond. Every subsequent chapter builds on this one.
Key Concepts
Concept
Definition
Set
Well-defined collection of distinct objects
Subset
A ⊆ B if every element of A is in B
Power set
P(A) = set of all subsets of A; if \
A\
= n, \
P(A)\
= 2ⁿ
Union A ∪ B
All elements in A or B or both
Intersection A ∩ B
Elements common to A and B
Complement A'
Elements in universal set U but not in A
Relation
Subset of A × B (set of ordered pairs)
Function
Relation where each input has exactly one output
Domain
Set of all valid inputs of a function
Co-domain
Set from which outputs are taken
Range
Set of actual outputs (Range ⊆ Co-domain)
Types of Sets
Empty set (∅): No elements. \|∅\| = 0
Singleton: Exactly one element
Finite / Infinite: Countable vs uncountable elements
Equal sets: Same elements (order doesn't matter)
Equivalent sets: Same cardinality (same number of elements)
Universal set (U): Contains all sets under discussion
Set Operations and Laws
Law
Statement
Commutative
A ∪ B = B ∪ A; A ∩ B = B ∩ A
Associative
(A ∪ B) ∪ C = A ∪ (B ∪ C)
Distributive
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
De Morgan's
(A ∪ B)' = A' ∩ B'; (A ∩ B)' = A' ∪ B'
Identity
A ∪ ∅ = A; A ∩ U = A
Complement
A ∪ A' = U; A ∩ A' = ∅
Cardinality formula: \
A ∪ B\
= \
A\
+ \
B\
− \
A ∩ B\
For three sets: \
A ∪ B ∪ C\
= \
A\
+ \
B\
+ \
C\
− \
A ∩ B\
− \
B ∩ C\
− \
A ∩ C\
+ \
A ∩ B ∩ C\
Relations
A relation R from set A to set B is a subset of A × B.
Domain of R: All first elements (x values)
Range of R: All second elements (y values)
Inverse relation R⁻¹: Swap each ordered pair — (a, b) → (b, a)
Types of Relations on a Set A
Type
Condition
Reflexive
(a, a) ∈ R for all a ∈ A
Symmetric
(a, b) ∈ R ⟹ (b, a) ∈ R
Transitive
(a,b) ∈ R and (b,c) ∈ R ⟹ (a,c) ∈ R
Equivalence
Reflexive + Symmetric + Transitive
Functions
A function f : A → B assigns each element of A exactly one element of B.
Types of Functions
Type
Condition
One-one (injective)
Different inputs → different outputs: f(a) = f(b) ⟹ a = b
Onto (surjective)
Every element of co-domain has a pre-image: Range = Co-domain
Bijective
One-one AND onto
Many-one
Two or more inputs map to same output
Into
Range ⊊ Co-domain (not onto)
Composition of Functions
If f : A → B and g : B → C, then (g ∘ f)(x) = g(f(x))
Note: g ∘ f ≠ f ∘ g in general.
Inverse Function
f⁻¹ exists only if f is bijective. If f(a) = b, then f⁻¹(b) = a.
Worked Examples
Example 1: If A = {1, 2, 3} and B = {4, 5}, find \
A × B\
and list A × B.
Solution: \
A × B\
= 3 × 2 = 6. A × B = {(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)}
Example 2: If \
A\
= 40, \
B\
= 30, \
A ∪ B\
= 55, find \
A ∩ B\
.
Solution: \
A ∩ B\
= \
A\
+ \
B\
− \
A ∪ B\
= 40 + 30 − 55 = 15
Example 3: Determine if f(x) = 2x + 3 is bijective. Solution: One-one: f(a) = f(b) ⟹ 2a + 3 = 2b + 3 ⟹ a = b ✓. Onto: for every y ∈ ℝ, x = (y−3)/2 ∈ ℝ ✓. So bijective, f⁻¹(x) = (x − 3)/2.
Important Questions
One Mark
Define a function. Give one example.
State De Morgan's laws.
If \|A\| = 3, what is \|P(A)\|?
What is the domain of f(x) = 1/(x − 2)?
Define an equivalence relation.
Short Answer (3 marks)
If A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, find A ∪ B, A ∩ B, A − B, and B − A.
Verify De Morgan's law for A = {1,2,3}, B = {2,3,4}, U = {1,2,3,4,5}.
Show that f(x) = x² from ℝ → ℝ is neither one-one nor onto.
Long Answer (5 marks)
Using the formula \|A ∪ B ∪ C\|, solve: In a class of 60 students, 30 study Maths, 25 study Physics, 20 study Chemistry. 10 study both M and P, 8 study both P and C, 7 study both M and C, and 5 study all three. How many study none?
Define types of functions with examples. Prove that f : ℝ → ℝ defined by f(x) = 3x − 5 is bijective and find its inverse.
Common Mistakes
Confusing equal sets (same elements) with equivalent sets (same count).
Writing A × B when B × A is asked — order matters in Cartesian products.
Concluding a function is onto without checking Range = Co-domain.
Forgetting f⁻¹ requires f to be bijective — not all functions have an inverse.
Misapplying De Morgan's law — the complement goes on each set, union ↔ intersection flips.
Board Exam Tips
Venn diagrams with 3 sets and cardinality problems appear almost every year as 3-mark or 5-mark questions — practise the inclusion-exclusion formula with numbers.
"Prove f is bijective" is a standard 5-mark question — always show one-one first, then onto, then state the conclusion.
Domain questions: check for zero denominator, negative under square root, negative under log.
JEE/NEET: composition of functions and inverse functions are tested frequently.
Frequently Asked Questions
A relation is any set of ordered pairs (x, y). A function is a relation where every element of the domain has exactly one image in the co-domain — no x maps to two different y values.