CHAPTER

1
Relations and
Functions
1.1 Introduction 1.3 Types of Functions
1.2 Types of Relations

Topicwise Analysis of Last 10 Years’ CBSE Board Questions (2020-2011)

11 VSA
10 SA
LA 1
9
Number of questions →

LA 2
8
7
6
5
4
3
2
1
0
1.1 1.2 1.3 1.4
Topic →

8 Maximum weightage is of Composition of 8 Maximum LA 1 & LA 2 type questions were

Functions and Invertible Function asked from Composition of Functions and
Invertible Function

QUICK RECAP

RELATION of A, then relation R on A is called an empty

relation i.e., R = f ⊂ A × A.
8 A relation R from a set A to a set B is a subset
of A × B. So, we say R ⊆ A × B. A relation Universal Relation
from a set A to itself is called a relation in A. X If each element of A is related to every
Empty Relation element of A, then relation R in A is called
X If no element of A is related to any element universal relation i.e., R = A × A.
2 CBSE Champion Mathematics Class 12

8 A relation R in a set A is called distinct elements of A have distinct

(i) reflexive, if (a, a) ∈ R, for all a ∈ A images in B i.e., for a, b ∈ A, f(a) = f(b)
(ii) symmetric, if (a, b) ∈ R ⇒ (b, a) ∈ R, ⇒a=b
for all a, b ∈ A (ii) onto or surjective function, if for every
(iii) transitive, if (a, b) ∈ R and (b, c) ∈ R element b ∈ B, there exists some a ∈ A
⇒ (a, c) ∈ R, for all a, b, c ∈ A such that f(a) = b.
X A relation R in a set A is called an equivalence X A function f : A → B is called bijective
relation, if it is reflexive, symmetric and function, if it is both one-one and onto
transitive. function.
X In a relation R in a set A, the set of all elements
related to any element a ∈ A is denoted by
[a] i.e., [a] = {x ∈ A : (x, a) ∈ R}
Here, [a] is called an equivalence class of
a ∈ A.
FUNCTION
8 A relation f from a set A to a set B is called a
function if
(i) for each a ∈ A, there exists some b ∈ B
such that (a, b) ∈ f i.e., f(a) = b
(ii) (a, b) ∈ f and (a, c) ∈ f ⇒ b = c
X A function f : A → B is called
(i) one-one or injective function, if
Relations and Functions 3

Previous Years’ CBSE

PREVIOUS Board
YEARS MCQS Questions

1.2 Types of Relations 11. Show t hat t he rel at i on S i n t he s e t

A = {x ∈ Z : 0 ≤ x ≤ 12} given by
VSA (1 mark) S = {(a, b) : a, b ∈ Z, |a – b| is divisible by 3}
1. A relation R in a set A is called , if is an equivalence relation. (AI 2019)
(a 1, a 2) ∈ R implies (a 2, a 1) ∈ R, for all 12. Let A = {1, 2, 3, ..., 9} and R be the relation in
a1, a2 ∈ A. (2020) A × A defined by (a, b) R (c, d) if a + d = b + c
2. A relation in a set A is called for (a, b), (c, d) in A × A. Prove that R is
relation, if each element of A is related to an equivalence relation. Also obtain the
itself. (2020) equivalence class [(2, 5)].  (Delhi 2014)

3. If R = {(x, y) : x + 2y = 8} is a relation on N, 13. Let R be a relation defined on the set of

write the range of R.  (AI 2014) natural numbers N as follow :
R = {(x, y) | x ∈ N, y ∈ N and 2x + y = 24}
4. Let R = {(a, a3) : a is a prime number less
Find the domain and range of the relation R.
than 5} be a relation. Find the range of R.
Also, find if R is an equivalence relation or
(Foreign 2014)
not. (Delhi 2014 C)
5. Let R be the equivalence relation in the set
A = {0, 1, 2, 3, 4, 5} given by LA 2 (6 marks)
R = {(a, b) : 2 divides (a – b)}. Write the 14. Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that
equivalence class [0]. (Delhi 2014 C)
R = {(a, b) : a, b ∈ A, |a – b| is divisible
6. State the reason for the relation R in the set by 4}, is an equivalence relation. Find the
{1, 2, 3} given by R = {(1, 2), (2, 1)} not to be set of all elements related to 1. Also write the
transitive.  (Delhi 2011) equivalence class [2]. (2018)

SA (2 marks) 15. Let N denote the set of all natural numbers

and R be the relation on N × N defined by
7. Check if the relation R in the set  of real (a, b) R(c, d) if ad(b + c) = bc(a + d). Show
numbers defined as R = {(a, b) : a < b} is that R is an equivalence relation.
(i) symmetric, (ii) transitive. (2020) (Delhi 2015)
LA 1 (4 marks) 16. Show that the relation R in the set A = {1, 2,
3, 4, 5} given by R = {(a, b) : |a – b| is divisible
8. Let N be the set of natural numbers and R
by 2} is an equivalence relation. Write all the
be the relation on N × N defined by (a, b) R
equivalence classes of R. (AI 2015 C)
(c, d) iff ad = bc for all a, b, c, d ∈ N. Show
that R is an equivalence relation. (2020)
1.3 Types of Functions
9. Show that the relation R in the set A = {1, 2, 3,
4, 5, 6} given by R = {(a, b) : |a – b| is divisible VSA (1 mark)
by 2} is an equivalence relation. (2020) 17. Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let
10. Show that the relation R on defined as f = {(1, 4), (2, 5), (3, 6)} be a function from A
R = {(a, b) : a ≤ b}, is reflexive and transitive to B, state whether f is one-one or not.
but not symmetric. (Delhi 2019) (AI 2011)
4

LA 1 (4 marks)
18. Show that the function f : (–∞, 0) → (–1, 0)
x
defined by f(x) = , x ∈ (–∞, 0) is one-
1+ x
one and onto. (2020) 

19. Show that f : N → N, given by

 x + 1, if x is odd
f (x ) = 
 x − 1, if x is even
is both one-one and onto.  (AI 2012) 
20. Let f : N → N be defined by
n + 1
 ,if n is odd
f (n) =  2 for all n ∈ N
 n , if n is even
 2
Find whether the function f is bijective. 
(Delhi 2012 C)
21. If f : R → R be the function defined by
f(x) = 4x3 + 7, show that f is a bijection.
(Delhi 2011 C)

22. Show that the function f : W → W defined by
n + 1, if n is even
f (n) = 
n − 1, if n is odd
is a bijective function.  (AI 2011 C)



 
 







Detailed Solutions
1. A relation R in a set A is called symmetric, if 4. Given relation is
(a1, a2) ∈ R implies (a2, a1) ∈ R, for all a1, a2 ∈ A. R = {(a, a3) : a is a prime number less than 5}.
\ R = {(2, 8), (3, 27)}
2. A relation in a set A is called reflexive
So, the range of R is {8, 27}.
relation, if each element of A is related to itself.
5. Here, R = {(a, b) ∈ A × A : 2 divides (a – b)}
3. Here, R = {(x, y) : x + 2y = 8}, where x, y ∈ N.
This is the given equivalence relation, where
For x = 1, 3, 5, ...
A = {0, 1, 2, 3, 4, 5}
x + 2y = 8 has no solution in N.
\ Equivalence class of [0] is {0, 2, 4}.
For x = 2, we have 2 + 2y = 8 ⇒ y = 3
For x = 4, we have 4 + 2y = 8 ⇒ y = 2 6. For transitivity of a relation,
For x = 6 , we have 6 + 2y = 8 ⇒ y = 1 if (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R
For x = 8, 10, ... We have, R = {(1, 2), (2, 1)}
x + 2y = 8 has no solution in N. (1, 2) ∈ R and (2, 1) ∈ R but (1, 1) ∉ R
\ Range of R = {y : (x, y) ∈ R} = { 1, 2, 3} \ R is not transitive.
6 CBSE Champion Mathematics Class 12

7. We have, R = {(a, b) : a < b}, where a, b ∈  ⇒ a – c = ±2 k3, k3 ∈ N

(i) Symmetry : Let (x, y) ∈ R, i.e., x R y ⇒ x < y ⇒ |a – c| is divisible by 2 ⇒ (a, c) ∈ R
But y < x, so (x, y) ∈ R ⇒ (y, x) ∉ R \ R is transitive.
Thus, R is not symmetric. Hence, R is an equivalence relation.
(ii) Transitive : Let (x, y) ∈ R and (y, z) ∈ R 10. We have, R = {(a, b) : a ≤ b, a, b ∈ }
⇒ x < y and y < z ⇒ x < z (i) Reflexive : Since a ≤ a
⇒ (x, z) ∈ R. Thus, R is transitive.
\ a R a ∀ a ∈R
8. (i) Reflexivity : Let (a, b) be an arbitrary Hence, R is reflexive.
element of N × N. Then, we have (a, b) ∈ N × N ∀ (ii) Symmetric : Let a, b ∈ R such that
a, b ∈ N aRb ⇒ a ≤ b ⇒ / b≤a
⇒ ab = ba (By commutativity of multiplication)
Hence R is not symmetric.
⇒ (a, b) R (a, b)
(iii) Transitive : Let a, b, c ∈ R
Thus, (a, b) R (a, b) for all (a, b) ∈ N × N
such that aRb and bRc
So, R is reflexive.
Now, aRb ⇒ a ≤ b  ... (i)
(ii) Symmetry : Let (a, b), (c, d) ∈ N × N such
and bRc ⇒ b ≤ c  ... (ii)
that (a, b) R (c, d) ⇒ ad = bc ⇒ bc = ad ⇒ cb = da
From (i) and (ii), we have
 (By commutativity of multiplication)
a≤b≤c⇒a≤c
⇒ (c, d) R (a, b)
\ aRc
Thus, (a, b) R (c, d)
Hence, relation R is transitive.
⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ N × N
So, R is symmetric. 11. We have, A = {x ∈ Z : 0 ≤ x ≤ 12}
(iii) Transitivity : Let (a, b), (c, d), (e, f) ∈ N × N \ A = {0, 1, 2, 3, ......, 12}
such that (a, b) R (c, d) and (c, d) R (e, f) Also, S = {(a, b) : a, b ∈ Z , | a − b | is divisible by 3}
Now, (a, b) R (c, d) ⇒ ad = bc...(i) (i) Reflexive : For any a ∈ A,
and (c, d) R (e, f) ⇒ cf = de...(iii) |a – a| = 0, which is divisible by 3
Multiplying (i) and (ii), we get ad ⋅ cf = bc ⋅ de Thus, (a, a) ∈ S ∴ S is reflexive.
⇒ af = be ⇒ (a, b) R (e, f)
(ii) Symmetric : For any a, b ∈ A, let (a, b) ∈ S
Thus, (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (e, f)
⇒ | a − b | is divisible by 3
So R is transitive.
\ R is an equivalence relation. ⇒ | b − a | is divisible by 3 ⇒ (b, a) ∈ S
i.e. (a, b) ∈ S ⇒ (b, a) ∈ S
9. We have,A = {1, 2, 3, 4, 5, 6} and R = {(a, b) :
|a – b| is divisible by 2} \ S is symmetric.
(i) Reflexive : For any a ∈ A (iii) Transitive : For any a, b, c ∈ A
|a – a| = 0, which is divisible by 2. Let (a, b) ∈ S and (b, c) ∈ S
Thus, (a, a) ∈ R. So, R is reflexive. ⇒ |a – b| is divisible by 3 and |b – c| is divisible
(ii) Symmetric : For any a, b ∈ A by 3
Let (a, b) ∈ R ⇒ (a – b) = ±3k1 and (b – c) = ±3k2; k1, k2 ∈ N
⇒ |a – b| is divisible by 2 ⇒ (a – b) + (b – c) = ±3(k1 + k2)
⇒ |b – a| is divisible by 2 ⇒ (a – c) = ±3(k1 + k2) ; k1, k2 ∈ N
⇒ (b, a) ∈ R ⇒ |a – c| is a multiple of 3
\ (a, b) ∈ R ⇒ (b, a) ∈ R ⇒ |a – c| is divisible by 3 ⇒ (a, c) ∈ S
\ R is symmetric. \ S is transitive.
(iii) Transitive : For any a, b, c ∈ A Hence, S is an equivalence relation.
Let (a, b) ∈ R and (b, c) ∈ R 12. Given A = {1, 2, 3, 4,...,9} ⊂ N, the set of
⇒ |a – b| is divisible by 2 and |b – c| is divisible natural numbers.
by 2. To show : R is an equivalence relation.
⇒ a – b = ±2 k1 and b – c = ± 2k2, k1, k2 ∈ N (i) Reflexivity : Let (a, b) be an arbitrary element of
⇒ a – b + b – c = ±2(k1 + k2) A × A. Then, we have (a, b) ∈ A × A ⇒ a, b ∈ A
Relations and Functions 7
⇒ a+b=b+a ⇒ |a – b| is a multiple of 4 and |b – c| is a multiple of 4
(by commutativity of addition on A ⊂ N) ⇒ a – b = ± 4k1 and b – c = ± 4k2; k1, k2 ∈ N
⇒ (a, b) R (a, b) ⇒ (a – b) + (b – c) = ± 4 (k1 + k2); k1, k2 ∈ N
Thus, (a, b) R (a, b) for all (a, b) ∈ A × A ⇒ a – c = ± 4 (k1 + k2); k1, k2 ∈ N
So, R is reflexive. ⇒ |a – c| is a multiple of 4 ⇒ (a , c) ∈ S
(ii) Symmetry: Let (a, b), (c, d) ∈ A × A such that \ S is transitive.
(a, b) R (c, d) ⇒ a + d = b + c ⇒ b + c = a + d Hence, S is an equivalence relation.
⇒ c+b=d+a The set of elements related to 1 is {5, 9}.
(by commutativity of addition on A ⊂ N) Equivalence class for [2] is {2, 6, 10}.
⇒ (c, d) R (a, b). 15. (i) Reflexivity : Let (a, b) be an arbitrary
Thus, (a, b) R (c, d) element of N × N. Then, (a, b) ∈ N × N
⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ A × A. ⇒ ab(b + a) = ba(a + b)
So, R is symmetric. [by commutativity of addition and multiplication
(iii) Transitivity: Let (a, b), (c, d), (e, f) ∈ A × A on N]
such that (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (a, b)
Now, (a, b) R (c, d) ⇒ a + d = b + c ...(i) So, R is reflexive on N × N.
and (c, d) R (e, f) ⇒ c + f = d + e...(ii) (ii) Symmetry : Let (a, b), (c, d) ∈ N × N be such
Adding (i) and (ii), we get that (a, b) R (c, d).
(a + d) + (c + f) = (b + c) + (d + e) ⇒ ad(b + c) = bc(a + d)
⇒ a + f = b + e ⇒ (a, b) R (e, f) ⇒ cb(d + a) = da(c + b)
Thus, (a, b) R (c, d) and (c, d) R (e, f) [by commutativity of addition and multiplication
⇒ (a, b) R (e, f). on N]
So, R is transitive. Thus, (a, b) R (c, d) ⇒ (c, d) R (a, b) for all
\ R is an equivalence relation. (a, b), (c, d) ∈ N × N.
Equivalence class for [(2, 5)] is {(1, 4), (2, 5), (3, 6), So, R is symmetric on N × N.
(4, 7), (5, 8), (6, 9)}. (iii) Transitivity : Let (a, b), (c, d), (e, f) ∈ N × N
13. Here, R = {(x, y) | x ∈ N, y ∈ N and 2x + y = 24} be such that
Domain of R = {1, 2, 3, 4, ..., 11} (a, b) R (c, d) and (c, d) R (e, f). Then,
Range of R = {2, 4, 6, 8, 10, 12 ,..., 22} (a, b) R (c, d) ⇒ ad(b + c) = bc(a + d)
R is not reflexive as if (2, 2) ∈ R b+c a+d 1 1 1 1
⇒ = ⇒ + = + ...(i)
⇒ 2 × 2 + 2 = 6 ≠ 24 bc ad b c a d
In fact R is neither symmetric nor transitive.
and (c, d) R (e, f) ⇒ cf(d + e) = de(c + f)
⇒ R is not an equivalence relation.
d +e c+ f 1 1 1 1
14. We have, A = {x ∈ Z : 0 ≤ x ≤ 12} ⇒ = ⇒ + = + ...(ii)
de cf d e c f
\ A = {0, 1, 2, 3, ..., 12}
Adding (i) and (ii), we get
and S = {(a, b) : |a – b| is a multiple of 4}
(i) Reflexive : For any a ∈ A, 1 1  1 1  1 1  1 1 
|a – a| = 0, which is a multiple of 4. b + c +d + e =a + d +c + f 
       
Thus, (a, a) ∈ S 1 1 1 1 b+e a+ f
\ S is reflexive. ⇒ + = + ⇒ =
b e a f be af
(ii) Symmetric : For any a, b ∈ A,
Let (a, b) ∈ S ⇒ af(b + e) = be(a + f)
⇒ |a – b| is a multiple of 4 ⇒ (a, b) R (e, f)
⇒ |b – a| is a multiple of 4 ⇒ (b, a) ∈ S So, R is transitive on N × N.
i.e., (a, b) ∈ S ⇒ (b, a) ∈ S Hence, R is an equivalence relation.
\ S is symmetric. 16. Refer to answer 14.
(iii) Transitive : For any a, b, c ∈ A, Further R has only two equivalence classes, namely
Let (a, b) ∈ S and (b, c) ∈ S [1] = [3] = [5] = {1, 3, 5} and [2] = [4] = {2, 4}.
8 CBSE Champion Mathematics Class 12

17. A = {1, 2, 3}, B = {4, 5, 6, 7} and 20. (i) Injectivity :

f = {(1, 4), (2, 5), (3, 6)} 1 +1 2
We have, f(1) = 4, f(2) = 5 and f(3) = 6. Distinct Here, f (1) = =1, f (2) = =1 ,
2 2
elements of A have distinct images in B. Hence, f 3 +1 4
is a one-one function. f (3) = = 2, f (4) = = 2
2 2
x (2k − 1) + 1
18. Given, f(x) = , x  (, 0) Thus, f (2k − 1) = = k and
1 x 2
x 2k
= (Q x ∈ (–∞, 0), |x| = –x) f (2k ) = =k
1− x 2
For one-one : Let f(x1) = f(x2), x1x2 ∈ (–∞ , 0) ⇒ f(2k – 1) = f(2k), where k ∈ N
x1 x But, 2k – 1 ≠ 2k, ⇒ f is not one-one.
⇒ = 2
1 − x1 1 − x2 Hence, f is not bijective.
⇒ x1(1 – x2) = x2(1 – x1) 21. Here, f(x) = 4x3 + 7
⇒ x1 – x1x2 = x2 – x1x2 ⇒ x1 = x2 Let x1, x2 ∈ R s.t.
Hence, if f(x1) = f(x2), then x1 = x2 f(x1) = f(x2)
\ f is one-one ⇒ 4x13 + 7 = 4x23 + 7 ⇒ 4x13 = 4x23 ⇒ x13 = x23
For onto : Let f(x) = y ⇒ x13 – x23 = 0
x
⇒ y= ⇒ y(1 – x) = x ⇒ y – xy = x ⇒ (x1 – x2) (x12 + x1x2 + x22) = 0
1− x y ⇒ x1 – x2 = 0
⇒ x + xy = y ⇒ x (1 + y) = y ⇒ x = [Q x12 + x1x2 + x22 = 0 has no real roots]
1+ y
Here, y ∈ (–1, 0) ⇒ x1 = x2
So, x is defined for all values of y. \ f : R → R is one-one.
\ f is onto Again " y ∈ R (co-domain), we find x ∈ R
19. Here, f : N → N s.t. (domain) s.t. f(x) = y
 x + 1, if x is odd ⇔ 4x3 + 7 = y ⇔ 4x3 = y – 7
f (x ) = 
 x − 1, if x is even ⇔ x3 = y − 7 ⇔ x = 3 y − 7 ∈ R
Let x, y ∈N s.t. f(x) = f(y) 4 4
We shall show that x = y (Q x = a, a ∈ R has always one real root)
3

(i) If x and y both are even Hence, f is onto

f(x) = f(y) ⇒ x – 1 = y – 1 ⇒ x = y So, f : R → R is a bijection.
(ii) If x and y both are odd 22. Refer to answer 19.
f(x) = f(y) ⇒ x + 1 = y + 1 ⇒ x = y
23. (d) : Here, f, g : R → R s.t.
(iii) If x is odd and y is even
f(x) = f(y) ⇒ x + 1 = y – 1
⇒ y–x=2 ...(1)
R.H.S. is even but L.H.S. is odd.
⇒ Equation (1) in N is not possible.
⇒ (iii) does not arise.
(iv) If x is even and y is odd, does not arise.
In any case, f(x) = f(y) ⇒ x = y
⇒ f is one-one
For any y ∈ N (co-domain), y can be even or odd
When y is odd, y + 1 is even, so
f(y + 1) = (y + 1) – 1 = y
When y is even, y – 1 is odd, so
f(y – 1) = (y – 1) + 1 = y 
⇒ f : N → N is onto.
Hence, f is both one-one and onto.