Class 12 Maths – Chapter 1: Relations
and Functions
1. Types of Relations
Relation:
A relation is a subset of the Cartesian product A × B, i.e., a set of ordered pairs.
Example: If A = {1, 2}, B = {3, 4}, then A × B = {(1,3), (1,4), (2,3), (2,4)}
A relation R from A to B could be: R = {(1,3), (2,4)}
Types of Relations:
Type of Relation Meaning Example
Empty relation No element is related R=∅
Universal relation Every element of A is R=A×B
related to every element of
B
Identity relation Every element is related to R = {(a,a) | a ∈ A}
itself only
Reflexive (a,a) ∈ R for all a ∈ A R = {(1,1), (2,2)}
Symmetric If (a,b) ∈ R, then (b,a) ∈ R R = {(1,2), (2,1)}
Transitive If (a,b) ∈ R and (b,c) ∈ R, R = {(1,2), (2,3), (1,3)}
then (a,c) ∈ R
Equivalence Relation Satisfies reflexive, All 3 above hold
symmetric, and transitive
2. Functions
Function:
A relation f: A → B is a function if every element of A has exactly one image in B.
Key words: Each input gives one output.
Types of Functions:
Type Meaning
One-One (Injective) Different inputs → different outputs
Onto (Surjective) Every element in codomain has a pre-image
One-One & Onto (Bijective) Both injective and surjective → perfect
match
Constant Function Every input maps to same output
Identity Function f(x) = x
Example: f(x) = x² from ℝ to ℝ is not one-one, but from ℝ⁺ to ℝ⁺ is one-one.
3. Composition of Functions
If f: A → B and g: B → C, then (g ∘ f)(x) = g(f(x))
Tip: g∘f = apply f first, then g
4. Inverse of a Function
A function has an inverse only if it is bijective.
If f: A → B is bijective, then f⁻¹: B → A exists, such that:
f(f⁻¹(y)) = y and f⁻¹(f(x)) = x
5. Important Properties
Properties of Equivalence Relation:
- Reflexive
- Symmetric
- Transitive
Example: "is congruent to" in geometry.
Domain, Codomain, and Range:
- Domain: Input values (set A)
- Codomain: Possible outputs (set B)
- Range: Actual outputs from f(x)
Quick Tricks to Remember
✔️RST → Reflexive, Symmetric, Transitive = Equivalence
✔️One-One → Unique Output
✔️Onto → Everything in codomain is used
✔️Bijective → Perfect Pairing → Inverse exists
✔️Identity: f(x) = x
✔️Constant: f(x) = k (same value always)
Practice Questions
1. 📝 Determine if a relation is reflexive/symmetric/transitive.
2. 📝 Check if a function is one-one or onto.
3. 📝 Compose two given functions.
4. 📝 Find inverse of a bijective function.
5. 📝 Define domain and range of given functions.
