1

Parisharam GOAT (2026)

Relations and Function Practice Sheet

TOPIC TO BE COVERED AS PER CBSE  Identity Relation

LATEST CURRICULUM 2024-25 A relation R in a set A is called an identity relation,
Types of relations: reflexive, symmetric, transitive where R  {(a, a), a  A} .
and equivalence relations.
One to one and onto functions Example :
Let A = {1, 2, 3, 4} and let R be a relation in A, given
Relation: Let A and B be two non-empty sets. Then by R = {(1, 1), (2, 2), (3, 3), (4, 4)}
a relation from set A to set B is a subset of A × B.
If number of elements in set A and set B are p and q  Reflexive Relation
respectively, Means n(A) = p, n(B) = q, then A relation R in a set A is called a Reflexive relation,
2 if (a, a) R , for all a  A .
No. of relation of A × A = 2 p
2
No. of relation of B × B = 2q Example :
No. of relation of A × B = Let A = {1, 2, 3, 4} and let R be a relation in A, given
No. of relation of B × A = 2pq by
R  {(1,1),(2,2),(3,3),(4,4)}
No. of Non-Empty R  {(1,1),(2,2),(3,3),(4,4),(1,2)}
Relation of A × A =  2 p  1
2 R  {(1,1),(2,2),(3,3),(4,4),(2,3),(1,3),(3,1)}
 

No. of non-empty relation of B × B =  2q  1 

2
Symmetric Relation
  A relation R in a set A is called a symmetric relation,
No. of non-empty relation of A × B = No. of Relation if (a, b)  R, then (b, a)  R for all a, b  A .
of B × A = (2pq – 1)
Example :
Different types of relations Let A = {1, 2, 3, 4} and let R be a relation in A, given
 Empty Relation or Void Relation by
A relation R in a set A is called an empty relation, R = {(1, 1), (2, 2), (3, 3)}.
if no element of A is related to any element of A R = {(1, 2), (2, 1), (3, 3)}.
and we denote such a relation by . R = {(1, 1), (2, 2), (3, 3), (4, 4), (2, 3), (1, 3), (3, 1)
(3, 2)}
Example: Let A = {1, 2, 3, 4} and let R be a relation
in A , given by R  {(a, b) : a  b  20} .  Transitive Relation
A relation R in a set A is called a transitive relation,
 Universal Relation if (a, b)  R and (b, c)  R, then (a, c)  R for all a,
A relation R in a set A is called an universal b, c  A
relation, if each element of A is related to every
element of A . Or
Example: Let A = {1, 2, 3, 4} and let R be a relation
in A, given by R  {(a, b) : a  b  0} . (a, b)  R and (b, c)  R for all a, b, c  A
 2

Example: Method to check the injectivity (One-One) of a

Let {1, 2, 3, 4} and let R be a relation in A, given by function
R = {(1, 1), (2, 2), (3, 3)}. (i) Take two arbitrary elements x, y (say) in the
(According to second condition) domain of f .
R = {(1, 2), (2, 1), (1, 1), (2, 2)}. (ii) Solve f (x) = f (y). If f (x) = f (y) give x  y only,
(According to first condition) then f : A  B is a one-one function
R = {(2, 3), (1, 3), (3, 1), (3, 2), (3, 3), (2, 2), (1, 1)} (or an injection). Otherwise not.

If function is given in the form of ordered pairs and if

 Equivalence Relation two ordered pairs do not have same second element
A relation R in a set A is said to be an equivalence then function is one-one.
relation if it is reflexive, symmetric and transitive.
Number of one-one functions (injections):
Function: If A and B are finite sets having m and n elements
Let A and B be two non-empty sets. A relation from respectively, then number of one-one functions from
set A to set B is called a function (or a mapping or a A and B = npm is n  m and 0, if n  m .
map) if each element of set A has a unique image in If f (x) is not one-one function, then its Many-one
set B. function.

Onto function (surjection) : A function f : A  B is

Remark:
onto if each element of B has its preimage in A. In
If (a, b)  f then ‘b’ is called the image of ‘a’ under f other words, Range of f = co-domain of f .
and ‘a’ is called pre-image of ‘b’. e.g. The following arrow-diagram shows onto
function.
No. of functions: Let A and B be two non-empty
finite sets such that n(A) = p and n(B) = q, then
number of functions from A to A = qp.

One-one function (injection):

A function f : A  B is said to be a one-one function
or an injection, if different elements of A have
Number of onto function (surjection): If A and B
different images in B.
are two sets having m and n elements respectively
such that 1 n  m , then number of onto functions
n
from A to B is (1)nr n C , . r m
r 1
Into function: A function f : A  B is an into function
if there exists an element in B having no pre-image in
A.
Clearly, f : A  B is a one-one function.
In other words, f : A  B is an into function if it is
But g : X  Y is not one-one function because two not an onto function
distinct elements x1 and x3 have the same image under e.g, The following arrow diagram shows into
function g. function.
 3

One-one onto function (bijection) : A function

f : A  B is a bijection, if it is one-one as well as onto.
In other words, a function f : A  B is a bijection if
(i) It is one-one i.e., f (x) = f (y)  x = y for all x, y
 A.
(ii) It is onto i.e., for all y  B, there exists x  A
such that f (x) = y.
Clearly, f is a bijection since it is both injective as
Method to find onto or into function:
well as surjective.
Step-1 : find the range of the given function
Step-2 : if the range of the given function is equal to
its co-domain, then it is onto otherwise into

Type of Functions
Name of Definition Domain Range Graph
Function
1. Identify The function f : R  R defined by R R
Function f  x  x  x  R

2. Constant The function f : R  R defined by R (c)

Function f  x  c  x  R

3. Polynomial The function f : R  R defined by

Function f  x   p0  p1x  p2 x2  pn xn
where n  N and
p0 , p1, p2 , pn  R  x  R
4. Rational The function f defined by
Function P  x
f  x  , where P(x) and
Q  x
Q(x) are polynomial functions,
Q(x)  0
 4

5. Modulus The function f : R  R defined by R [0, )

Function  x, x  0
f  x  x    xR
 x, x  0

6. Signum The function f : R  R defined by R {–1, 0,

Function x 1, x  0 1}
 , x0 
f  x   x  1, x0
0, 
x  0 0, x  0


7. Greatest The function f : R  R defined by R Z

Integer  x, x  Z

Function f  x   x   integer less than
 equal to x, x  Z


8. Linear The function f : R  R defined by R R

Function f  x  mx  c, x  R where
m and c are constants
 5

Exercise
1. Consider the set A = {1, 2, 3}, then write smallest
equivalence relation on A .
(1) {}
(2) {(1, 1)} 9.
(3) {(1, 1), (2, 2), (3, 3)}
(4) {(3, 3)}

2. Consider the set A containing 5 elements, then the Let N be the set of natural numbers and the function f
total number of injective functions from A onto itself : N  N be defined by f  n  2n  3  n  N .
are Then f is
(1) 5 (2) 25 (1) Surjective (2) Injective
(3) 120 (4) 125 (3) Bijective (4) None of these

3. If A = {d, 0, e} then the number of relations on A × A are

10. Let f : R  R be defined by f  x   x2  1 . Then, pre-
(1) 3 (2) 8
(3) 15 (4) 512 images of 17 and –3, respectively, are
(1) f, {4, –4} (2) {3, –3}, 
4. If A = {2023, 2024} then the number of non-empty (3) {4, –4},  (4) {4, –4}, {2, –2}
relations on A × A are
(1) 1 (2) 4 11. Let A  1,2,3 and let
R  1,1 ,  2,2 , 3,3 , 1,3 , 3,2 , 1,2 . Then,
(3) 15 (4) 16

5. If A  {2023,2024) then the number of Reflexive R is

relations on A × A are (1) Reflexive and symmetric but not transitive
(1) 2 (2) 4 (2) Reflexive and transitive but not symmetric
(3) 8 (4) 16 (3) Symmetric and transitive but not reflexive
(4) An equivalence relation
6. If A = {s, u, v}, then the number of Symmetric
relations on A × A are 12. Let A  a, b, c and let
(1) 8 (2) 9 R   a, a  ,  a, b  , b, a  . Then, R is
(3) 32 (4) 64
(1) Reflexive and symmetric but not transitive
(2) Reflexive and transitive but not symmetric
7. If the number of one-one functions that can defined
(3) Symmetric and transitive but not reflexive
from A  4,8,12,16 to B is 5040, then n(B) =
(4) An equivalence relation
(1) 7 (2) 3
Let A  1,2,3 and let
(3) 6 (4) 10
13.
R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)}
8. The graph of the function f : R  A defined by
Then, R is
y = f (x) is given below, then find A such that function
(1) Reflexive and symmetric but not transitive
f (x) is onto function
(2) Symmetric and transitive but not reflexive
(1) [–1, 5] (2) [–5, 5]
(3) Reflexive and transitive but not symmetric
(3) [–5, 1] (4) R
(4) An equivalence relation
 6

14. Let S be the set of all straight lines in a plane. Let R 19. Let f ; [2, )  R be the function defined by f (x) =
be a relation on S defined by aRb  a  b . x2 – 4x + 5, then the range of f is
Then, R is (1) R (2) 1,
(1) Reflexive but neither symmetric nor transitive (3) 4, (4) 5,
(2) Symmetric but neither reflexive nor transitive
(3) Transitive but neither reflexive nor symmetric 20. Let A = {3, 5}. Then the number of reflexive relations
(4) An equivalence relation on A is
(1) 2 (2) 4
15. Let S be the set of all real numbers and let R be a (3) 0 (4) 8
relation on S , defined by aRb  1  ab  0 .
21. Let R be a relation in the set N given by
Then, R is
R  { a, b : a  b  2, b  6} . Then
(1) Reflexive and symmetric but not transitive
(2) Reflexive and transitive but not symmetric (1) 8,7 R (2)  6,8 R
(3) Symmetric and transitive but not reflexive (3) 3,8 R (4)  2,4 R
(4) None of these
22. A relation R defined on set A  {x : x  Z and
16. Let S be the set of all triangles in a plane and let R 0  x  10} as R   x, y   x  y is given to be an
be a relation on S defined by Δ1SΔ2  Δ1  Δ2 . equivalence relation. The number of equivalence
Then, R is classes is
(1) Reflexive and symmetric but not transitive (1) 1 (2) 2
(2) Reflexive and transitive but not symmetric (3) 10 (4) 11
(3) Symmetric and transitive but not reflexive
23. A relation R defined on a set of human beings as
(4) An equivalence relation
R   x, y  : x is 5 cm shorter than y} is
17. Let S be the set of all straight lines in a plane. Let R (1) Reflexive only
(2) Reflexive and symmetric
be a relation on S defined by aRb  a || b
(3) Symmetric and transitive
Then, R is
(4) Neither reflexive, nor symmetric nor transitive.
(1) Reflexive and symmetric but not transitive
(2) Reflexive and transitive but not symmetric 24. If A  {a, b, c) , then the relation R = {(b, c)} on A is
(3) Symmetric and transitive but not reflexive (1) Reflexive only
(4) An equivalence relation (2) Symmetric only
(3) Transitive only
18. Let Z be the set of all integers and let R be a relation (4) Reflexive and transitive only
on Z defined by aRb   a  b is divisible by 3.
25. The relation ‘R’ in N  N such that
Then, R is
(1) Reflexive and symmetric but not transitive
 a, b Rc, d   a  d  b  c is
(1) Reflexive but not symmetric
(2) Reflexive and transitive but not symmetric
(2) Reflexive and transitive but not symmetric
(3) Symmetric and transitive but not reflexive
(3) An equivalence relation
(4) An equivalence relation
(4) None of these
 7

26. The relation R defined on the set A  1,2,3,4,5 by 32. Show that the relation R in the set A  1,2,3,4,5

 
R   a, b : a2  b2  16 , is given by given by R  { a, b : a  b is even}, is an
equivalence relation. Show that all the elements of
(1) 1,1 ,  2,1 , 3,1 ,  4,1 ,  2,3 {1, 3, 5} are related to each other and all the elements
(2)  2,2 , 3,2 ,  4,2 ,  2,4 of {2, 4} are related to each other. But no element of
{1, 3, 5} is related to any element of
(3) 3,3 ,  4,3 , 5,4, 3,4 {2, 4}.
(4) None of these
33. Show that each of the relation R in the set
27. If the function f : R  1, 1  A defined by A  x  Z :0  x  12 , given by

x2 (i) R  { a, b : a  b is a multiple of 4 }
f  x  is Surjective, then A =
1  x2 (ii) R   a, b  : a  b
(1) R (2) R – {1, –1} is an equivalence relation. Find the set of all elements
(3) [0, 1) (4) [0, ] related to 1 in each case.

28. For real numbers x and y , define xRy if and only if 34. Show that the relation R defined in the set A of all
x  y  2 is an irrational number. Then the relation triangles as R  T1,T2  : T1 is similar to T2 is
R is equivalence relation. Consider three right angle
(1) Reflexive (2) Symmetric triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13
(3) Transitive (4) None of these and T3 with sides 6, 8, 10. Which triangles among T1,
T2 and T3 are related?
29. Let A = {1, 2, 3}. Then, the number of relations
containing (1, 2) and (1, 3) which are reflexive and 35. Show that the relation R in the set A of points in a
symmetric but not transitive is plane given by R = {(P, Q) : distance of the point P
(1) 1 (2) 2 from the origin is same as the distance of the point Q
(3) 3 (4) 4 from the origin}, is an equivalence relation. Further,
show that the set of all points related to a point P 
(0, 0) is the circle passing through P with origin as
30. Which of the following is not an equivalence relation
centre.
on Z ?
(1) aRb  a  b is an even integer
36. Let A and B be sets. Show that f : A × B  B × A such
(2) aRb  a  b is an even integer
that f (a, b) = (b, a) is bijective function.
(3) aRb  a  b
(4) aRb  a  b
37. Let f : N  N be defined by
n 1
31. Let A = {1, 2, 3}. Then number of equivalence  2 , if n is odd
relations containing (1, 2) is f  n   for all n  N .
n , if n is even
(1) 1 (2) 2  2
(3) 3 (4) 4
State whether the function f is bijective. Justify
your answer.
 8

38. Show that the Signum Function f : R  R, given by 45. Show that the function f : R  R defined by
 1, if x  0 x2
 f  x  ;  x  R , is neither one-one nor onto.
f  x   0, if x  0 x2  1
 1, if x  0

is neither one-one nor onto. 46. Check whether the relation R in the set Z of integers
defined as R  ( a, b : a  b is "divisible by 2"} is
39. Let A = R – {3} and B = R – {1}. Consider the
reflexive, symmetric, transitive or Equivalence.
 x2
function f : A  B defined by f  x     . Is
 x 3
47. Let N be the set of all natural numbers and let R be
f one-one and onto? Justify your answer.
a relation on N  N , defined by Show that R is an
40. Show that the function equivalence relation.
f : R  {x  R : –1 < x < 1} (i)  a, b Rc, d   a  d  b  c
defined by f  x  
x
, x  R is one one and onto (ii)  a, b Rc, d   ad  bc
1 x
1 1 1 1
function. (iii)  a, b  R  c, d     
a d b c

41. Let A = {1, 2, 3,….9} and R be the relation in A × A (iv)  a, b R c, d   ad b  c  bc  a  d 

defined by (a, b) R(c, d) if a + d = b + c for
(a, b), (c, d) in A × A. Prove that R is an equivalence 48. Let A = R – {1}, f ; A  A is a mapping defined by
relation and also obtain the equivalent class [(2, 5)]. ˆ
x2
f  x  , show that f is one-one and onto.
42. If A = {1, 2, 3, 4}, define relations on A which have x 1
properties of being:
(a) Reflexive, transitive but not symmetric 49. For real numbers x and y , define xRy if and only if
(b) Symmetric but neither reflexive nor transitive
x  y  2 is an irrational number. Then check the
(c) Reflexive, symmetric and transitive.
reflexivity, Symmetricity and Transitivity of the
43. Let R be relation defined on the set of natural number relation R .
N as follows:
R   x, y  : x  N , y  N ,2x  y  41 . 50. (a) A relation R on set A  1,2,3,4,5 is defined as
Find the domain and range of the relation R. Also
verify whether R is reflexive, symmetric and
 
R   x, y  : x2  y2  8 . Check whether the

transitive. relation R is reflexive, symmetric and

transitive.
44. Consider a function f : R   7,  given by
OR
f  x   16x2  24x  7 , where R+ is the set of all
positive real numbers. Show that function is one-one
(b) A function f is defined from R  R as f (x) = ax
and onto both.
+ b, such that f (1) = 1 and f (2) = 3. Find function
f (x). Hence, check whether function
f (x) is one-one and onto or not.
 9

51. A relation R is defined on a set of real numbers R Gajender and a daughter Suman while Mrs.
as R = {(x, y) : x, y is an irrational number}. Madhulika has 2 sons Shashank and Pradeep and 2
Check whether R is reflexive, symmetric and daughters Sweety and Anju. They all Lived together
transitive or not. and everyone shares equal responsibilities
within the family. Every member of the family
52. A class-room teacher is keen to assess the learning of emotionally attaches to each other in their happiness
her students the concept of "relations" taught to them. and sadness. They help each other in their bad times
She writes the following five relations each defined which give the feeling of security.
on the set A = {1, 2, 3} : A family provides love, warmth and security to its all
R1 = {(2, 3), (3, 2)} members throughout the life which makes it a
R2 = {(2, 3), (3, 2)} complete family. A good and healthy family makes a
R3 = {(1, 2), (2, 1), (1, 1)} good society and ultimately a good society involves
R4 = {(1, 1), (1, 2), (3, 3), (2, 2)} in making a good country.
R5 = {(1, 1), (1, 2), (3, 3), (2, 2), (2, 1), (2, 3), (3, 2)}
The students are asked to answer the following
questions about the above relations :
(i) Identify the relation which is reflexive, transitive
but not symmetric.
(ii) Identify the relation which is reflexive and
symmetric but not transitive.
(iii) (a) Identify the relations which are symmetric
but neither reflexive nor transitive.

OR On the basis of above information, answer the

following questions:
(iii) (b) What pairs should be added to the relation
R2 to make it an equivalence relation? 53. Consider Relation R in the set A of members of
Mr. D. N. Sharma and his family at a particular time
CASE STUDIES (a) If R  { x, y  : x and y live in the same
A person without family is not complete in this world
locality), then R show that R is reflexive
because family is an integral part of all of us Human
Relation.
deigns are considered as the social animals living in
(b) If R  { x, y  : x is exactly 7 cm taller than y},
group called as family. Family plays many important
roles throughout the life. then R show that R is not Symmetric relation.
Mr. D.N. Sharma is an Honest person who is living (c) If R  { x, y  : x is wife of y} , then show that R
happily with his family. He has a son Vidya and a is Transitive only.
Daughter Madhulika. Mr. Vidya has 2 sons Tarun and
 10

SOLUTIONS
1. (3) 18. (4)

2. (3) 19. (2)

3. (4) 20. (2)

4. (3) 21. (2)

5. (2) 22. (4)

6. (4) 23. (4)

7. (4) 24. (3)

8. (1) 25. (3)

9. (2) 26. (4)

10. (3) 27. (3)

11. (2) 28. (1)

12. (3) 29. (1)

13. (1) 30. (3)

14. (2) 31. (2)

15. (1) 32. Prove

16. (4) 33. Prove

17. (4) 34. Prove

 11

35. Prove 47. Prove

36. Prove 48. Prove

37. It is not bijective 49. The relation R is

Reflexive: yes
38. Prove Symmetric: No
Transitive: No
39. Yes the function f (x) is one-one and onto.
50. (a) The relation R is reflexive.
40. Prove (b) Yes, The function f (x) is one-one and onto.

41. Prove 51. R is symmetric

42. (a) R1 = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 3), 52. (i) R4
(1, 3)} (ii) R5
(b) R2 = {(1, 2), (2, 1)} (iii) (a) R1, R2, R3
(c) R3 = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1)} (b) {(1, 1), (2, 2), (3, 3)}

43. Domain = {1, 2, 3…..20} 53. (a) Prove

Range = {1, 3, 5….39} (b) Prove
(c) Prove
44. Prove

45. Prove

46. Prove

For Such More Free Pdfs Join Our Telegram Channel - https://t.me/Maths_by_DeepakBhattSir

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if