1

RELATIONS AND FUNCTIONS

Age Weight
Consider the relationship between the weight of five students and
(years) (kg)
their ages as shown below.
10 31
We can represent this information as a set of ordered pairs. An 12 36
age of 10 years would correspond to a weight of 31 kg. An age of 16 years 14 48
would correspond to a weight of 53 kg and so on. This type of information 16 53
18 65
represents a relation between two sets of data. This information could
then be represented as a set of ordered pairs.
{( 10, 31), ( 12, 36), ( 14, 48), (16, 53), (18, 65)}
The set of all first elements of the ordered pair is called the domain of the relation and is
referred to as the independent variable. The set of all second elements is called the range and
is referred to as the dependent variable.
For the above example,
the domain = {10, 12, 14, 16, 18}
Summary
the range = {31, 36, 48, 53, 65}
corresponds to
− value − value
Domain defining Range
relationship

[Independent variable] [Dependent variable]

A relation is any subset of the Cartesian plane and can be

represented by a set of ordered pairs {( , )}.
 1. Relation and Function

Definition
Let A and B be two non-empty sets, then every subset of A × B defines a relation from A
to B and every relation from A to B is a subset of A × B. Let R Í A ´ B and (a, b)Î R. Then we say
that a is related to b by the relation R and write it as a R b. If (a, b)Î R , we write it as a R b .

(1) Total number of relations: Let A and B be two non-empty finite sets consisting of m and n
elements respectively. Then × consists of ordered pairs. So, total number of subsets of
× is . Since each subset of A × B defines relation from A to B, so total number of relations
from A to B is 2 . Among these 2 relations the void relation  and the universal relation ×
are trivial relations from A to B.

(2) Domain and range of a relation: Let R be a relation from a set A to a set. Then the set of all
first components or coordinates of the ordered pairs belonging to R is called the domain of R, while
the set of all second components or coordinates of the ordered pairs in R is called the range of R.
Thus, ( ) = { ∶ ( , )Î } and ( ) = { ∶ ( , )Î } . It is evident from the
definition that the domain of a relation from A to B is a subset of A and its range is a subset of B.

(3) Relation on a set: Let A be a non-void set. Then, a relation from A to itself i.e. a subset of
× is called a relation on set A.

Types of Relations
1) Empty relation: A relation R in a set A is called empty relation, if no element of A is
related to any element of A, i.e., = ∅⊂ × .
Example: Let A be the set of all students of a boy’s school.
The relation R in A given by R = {(a, b): a is sister of b}
2) Universal relation: A relation R in a set A is called universal relation, if each element of
A is related to every element of A, i.e., = × .
Example: Let A be the set of all students of a boy’s school.
The relation R in A given by R = {(a, b): the difference between heights of a and b
is less than 3 meters}
3) Identity relation: Let A be a set. Then the relation IA = {(a, a): a  A} on A is called the
identity relation on A.
Example: On the set A = {1, 2, 3}, R = {(1, 1), (2, 2), (3, 3)} is the identity relation on A.
4) Reflexive relation: A relation R on a set A is said to be reflexive if every element of A is
related to itself. Thus,
R is reflexive  (a, a)  R for all a  A.
A relation R on a set A is not reflexive if there exists an element a  A such that (a, a)  R.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 13
 1. Relation and Function
Example: Let A = {1, 2, 3} and R = {(1, 1); (1, 3)} Then R is not reflexive since 3  A but
(3, 3)  R

 The identity relation on a non-void set A is always reflexive relation

on A. However, a reflexive relation on A is not necessarily the identity
relation on A.
 The universal relation on a non-void set A is reflexive.

5) Symmetric relation: A relation R on a set A is said to be a symmetric relation iff

( , )Î  ( , )Î for all a, b  A
i.e.  for all a, b  A.
it should be noted that R is symmetric iff R1  R.
Example:

 The identity and the universal relations on a non-void set are

symmetric relations.
 A relation R on a set A is not a symmetric relation if there are at least
two elements a, b A such that (a, b) R but (b, a) R.
 A reflexive relation on a set A is not necessarily symmetric.

6) Transitive relation: Let A be any set. A relation R on set A is said to be a transitive relation
iff
( , )Î and ( , )Î  ( , )Î for all a, b, c  A
i.e., and  for all a, b, c  A.
In other words, if a is related to b, b is related to c, then a is related to c.
Transitivity fails only when there exists a, b, c such that , but .
Example: Consider the set A = {1, 2, 3} and the relations R1  {(1, 2),(1,3)}; R2 =
{(1, 2)}; R3 = {(1, 1)}; R4 = {(1, 2), (2, 1), (1, 1)} Then R1 , R2 , R3 are transitive while R4 is
not transitive since in R4 ,(2, 1) R4 ;(1, 2) R4 but (2, 2) R4 .

 The identity and the universal relations on a non-void set are

transitive.
 The relation ‘is congruent to’ on the set T of all triangles in a plane is
a transitive relation.

7) Equivalence relation: A relation R on a set A is said to be an equivalence relation on A

iff
(i) It is reflexive i.e. (a, a)  R for all a  A
(ii) It is symmetric i.e. (a, b)  R  (b, a)  R, for all a, b  A

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 14
 1. Relation and Function
(iii) It is transitive i.e. (a, b)  R and (b, c)  R  (a, c)  R for all a, b, c  A.

Example:

TYPES/ NATURE OF
REFLEXIVE SYMMETRY TRANSITIVE
RELATION
≮ < but ≮ < , < and <
LESS THAN (<)
1≮1 1 < 2 but 2 ≮ 1 1 < 2, 2 < 3 and 1 < 3

LESS THAN AND EQUAL ≤ ≤ but ≰ ≤ , ≤ and ≤

(≤) 1≤1 1 ≤ 2 but 2 ≰ 1 1 ≤ 2, 2 ≤ 3 and 1 ≤ 3

∥ ∥ and ∥ ∥ , ∥ and ∥
PARALLEL LINES (∥)
∥ ∥ and ∥ ∥ , ∥ and ∥

PERPENDICULAR LINES ⟂̷ ⊥ and ⊥ ⊥ , ⊥ but ⟂̷

(⊥) ⟂̷ ⊥ and ⊥ ⊥ , ⊥ but ⟂̷

∼ and ∼ ∼ , ∼ and ∼
∼
SIMILAR TRIANGLE (∼) ∠ ∼∠ and ∠ ∼∠ ,∠ ∼∠
∠ ∼∠
∠ ∼∠ and ∠ ∼∠
≅ and ≅ ≅ , ≅ but ≅
CONGRUENCE ≅
∠ ≅∠ and ∠ ≅∠ ,∠ ≅∠
TRIANGLE (≅) ∠ ≅∠
∠ ≅∠ and ∠ ≅∠

Congruence Modulo
, ∈ . ℎ
≡ ( ) ( − )

 If ≡ ( ) and x is any integer then + ≡ + ( )

 If ≡ ( ) and c ≡ ( ) then + ≡ + ( )
 If ≡ ( ) and c ≡ ( ) then ≡ ( )
 ≡ ( )⇒ ≡ ( ) where = × gcd ( , ).
 ≡ ( )⇒ ≡ ( ) if gcd( , ) = 1.

Example: Show that the relation ~ on given by ~ = {(a, b): ≡ ( )} is an

equivalence relation.

Reflexive
a ≡ a (mod m)
m| (a − a), m|0, congruence is reflexive
Symmetric

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 15
 1. Relation and Function
If a ≡ b (mod m), then b ≡ a (mod m)
m| (a − b) if and only if m| (b − a), congruence is symmetric
Transitive
If a ≡ b (mod m) and b ≡ c (mod m), then a ≡ c (mod m)
m|(a−b) and m|(b−c). Then m divides the sum (a−b) + (b−c) = a − c
congruence is transitive

Example: Find least non-negative integer r such that

a. × × × ≡ ( )
b. 6× × × (− )≡ ( )
c. ( )+ ( )≡ ( )
d. × ≡ ( )
Solution:
a. × × × ≡ ( )
 7 × (11 × 1 + 2) × (11 × 2 + 1) × (11 × 37 + 6) ≡ ( 11)
7×2×1×6≡ ( 11)
 84 ≡ ( 11)
 11 × 7 + 7 ≡ ( 11)
 =7
b. 6× × × (− )≡ ( )
 6× (8 × 2 + 2) × (8 × 3 + 3) × {8 × (−28) − 1} ≡ ( 8)
 6× 2 × 3 × (−1) ≡ ( 8)
 −36 ≡ ( 8)
 8 × (−4) − 4 ≡ ( 8)
 −4 ≡ ( 8)
 −4 + 8 ≡ ( 8)
4≡ ( 8)
 =4
c. ( )+ ( )≡ ( )
 (4 × 309 + 1)( 4) + (4 × 246 + 1)( 4) ≡ ( 4)
1( 4) + 1( 4) ≡ ( 4)
2( 4) ≡ ( 4)
 =2
d. × ≡ ( )
 (4 × 484 + 0) × (4 × 2197 + 1) ≡ ( 4)
0 × 1 ≡ ( 4)

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 16
 1. Relation and Function
0 ≡ ( 4)
 =0

S = The set of all students of a Vidyalaya from class – I to XII

R = students of same class
Is R equivalence Relation?

EQUIVALANCE CLASS

Let X be a set with an equivalence relation ~ defined on it. The Equivalence Class of x∈X,
denoted by [x]~ .

[ ]~ = { ∈ : ~ }

for a set X with an equivalence relation

1. ∈ [ ] (∵ ~ )
2. ~ ⟺ [ ]~[ ]
3. ℎ [ ] = [ ] or [ ] ∪ [ ] = ∅
4. ⋃ ∈ [ ]=

PARTITION

let , , , , ………, are said to be partition of non-empty set X

1. ⊆ , ⊆ , ⊆ , ⊆ , ⊆ ………, ⊆
2. ∩ =∅ ≠
3. ∪ ∪ ∪ ∪ ∪………∪ =

Example:
a. { , , }
b. { }, { , }
c. { }, { }, { }

Answer:

a. {( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , )}
b. {( , ), ( , ), ( , ), ( , ), ( , )}
c. {( , ), ( , ), ( , )}

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 17
 1. Relation and Function

MULTIPLE CHOICE QUESTION

1. Let X= {1,2,3} and R is relation defined in the set X as R = {(1,3), (2,2), (3,2)} then
the minimum ordered pairs should include in relation R to make it reflexive and
symmetric is
a) (1,1), (2,3) and (1,2) b) (3,3), (3,1), and (1,2)
c) (1,1), (3,3), (3,1), and (2,3) d) (1,1), (3,3), (3,1), and (1,2)
2. A relation R is defined as follows on N. Which of the following is reflexive relation.
a) R= {(x, y):x>y, x, y ϵN} b) R= {(x, y):x+ y=10, x, yϵ N}
c) R= {(x, y):x+4y=10, x, y ϵN} d) R= {(x, y): xy is a square number x,yϵ N}
3. The number of equivalence relations that can be defined in the set A= {1,2,3} which
containing the elements (1,2) is
a) 0 b) 1 c) 2 d) 3
2
4. A relation R is defined on Z as aRb if and only if -7ab + 6 2=0 then R is
a) Reflexive and symmetric b) symmetric and not Reflexive
c) transitive but not Reflexive d) Reflexive but not symmetric
5. A relation R is defined on Z as aRb if and only if a-b+ √2 is an irrational number then R is
a) Reflexive b) symmetric and Reflexive
c) transitive and Reflexive d) none of these
6. Let R be a relation on the set L of lines defined by l1 R l2 if l1 is perpendicular to l2, then
relation R is
a) reflexive and symmetric b) symmetric and transitive
c) equivalence relation d) symmetric
7. Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R
in set of triangles defined as R = {(Δ1, Δ2): Δ1 is similar to Δ2}. Which triangles belong to the
same equivalence class?
a) T1 and T2 b) T2 and T3 c) T1 and T3 d) T1 and T4
8. Given set A ={1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be
a) reflexive if (1, 1) is added b) symmetric if (2, 3) is added
c) transitive if (1, 1) is added d) symmetric if (3, 2) is added
9. Given set A = {a, b, c}. An identity relation in set A is

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 18
 1. Relation and Function
a) R = {(a, b), (a, c)} b) R = {(a, a), (b, b), (c, c)}
c) R = {(a, a), (b, b), (c, c), (a, c)} d) R= {(c, a), (b, a), (a, a)}
10. Let R be a relation defined on Z by ⇔ ≥ , Then R is:
a) symmetric, transitive but not reflexive
b) Reflexive, symmetric but not transitive
c) Reflexive and transitive but not symmetric
d) an equivalence relation
11. Let R be a relation defined on Z as follows:( , ) ∈ ⟺ | − | ≤ 1. Then R is:
a) Reflexive and transitive b) Reflexive and symmetric
c) Symmetric and transitive d) an equivalence relation
12. If A= {1,2,3} and Let R = {(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)}, Then R is:
a) symmetric, transitive but not reflexive
b) Reflexive, symmetric but not transitive
c) Reflexive and transitive but not symmetric
d) an equivalence relation
13. Let R be a relation defined on Z as follows:( , ) ∈ ⟺ + = 25. Then domain of R
is:
a) {3,4,5} b) {0,3,4,5} c) {0, ±3, ±4, ±5} d) none of these
14. The relation R defined on the set A= {1,2,3,4,5} = {( , ): | − | < 16} is given by:
a) {(1,1), (2,1), (3,1), (4,1), (2,3)} b) {(2,2), (3,2), (4,2), (2,4))}
c) {(3,3), (4,3), (5,4), (3,4)} d) none of these
15. A relation R defined from {2,3,4,5} to {3,6,7,10} by: ⟺ . Then
range of R is given by:
a) {2,3,5} b) {3,5} c) {2,3,4} d) {2,3,4,5}

SHORT TYPE QUESTION

1. Let Z be the set of integers and R be a relation defined in Z such that if ( – )
is divisible by 5. Then R partitions the set Z into ______ pairwise disjoint subsets.
2. Consider set = {1, 2, 3} and the relation = {(1, 2)} , then? is a transitive relation.
State true or false.
3. Every relation which is symmetric and transitive is reflexive also. State true or false.
4. Let R be a relation in set N, given by = {( , ): = – 2, > 6} then (3, 8) ∈ R.
State true or false with reason.
5. Let R be a relation defined as R = {(x, x), (y, y), (z, z), (x, z)} in set A = {x, y, z} then R is
(reflexive/symmetric) relation.
6. Let R be a relation in the set of natural numbers N defined by R = {(a, b) ∈ N × N: a< b}. Is
relation R reflexive? Give a reason.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 19
 1. Relation and Function
7. Let A be any non-empty set and P(A) be the power set of A. A relation R defined on P(A)
by X R Y ⇔ X ∩ Y = X, X, Y ∈ P(A). Examine whether? is symmetric.
8. State the reason for the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} not to be
transitive.
9. Show that the relation R in the set {1,2,3} given by R = {(1,1), (2, 2), (3, 3), (1, 2), (2,3)} is
reflexive but neither symmetric nor transitive.
10. . Let A = {3, 4, 5} and relation R on set A is defined as R = {(a, b) e A x A: a – b –
10). Is relation an empty relation?
11. Given set A = {a, b} and relation R on A is defined as R = {(a, a), (b, b)}. Is relation
an identity relation?
12. Let set A represents the set of all the girls of a particular class. Relation R on A is
defined as R = {(a, b) ∈ A × A: difference between weights of a and b is less than 30kg}.
Show that relation R is a universal relation.
13. State the reason for the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} not to be
transitive.
14. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (2,1)}. Then
determine whether R is reflexive, symmetric and transitive.
15. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3), (3 ,
1)}.Then determine whether R is reflexive, symmetric and transitive.
16. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}. Then
determine whether R is reflexive, symmetric and transitive.
17. Let A = {1, 2, 3} and consider the relation R = {(1, 1), (1, 2), (2, 1)}. Then determine whether
R is reflexive, symmetric and transitive.
18. Let A = {1, 2, 3} and consider the relation R = {(1, 3)}. Then determine whether R is reflexive,
symmetric and transitive.
19. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3)}. Then determine whether
R is reflexive, symmetric and transitive.
20. Let A = {1, 2, 3} and R = {(1, 1), (2, 3), (1, 2)} be a relation on A, then write the minimum
number of ordered pairs to be added in R to make R reflexive and transitive.
21. Write the maximum number of equivalence relations on the set {1, 2, 3}.
22. Let R be a relation on the set N be defined by {(x, y): x, y  N, 2x + y = 41}. Then determine
whether R is reflexive, symmetric and transitive.
23. Relation R in the set Z of all integers defined as R = {(x, y): x – y is an even integer}.
Determine whether R is reflexive, symmetric and transitive.
24. Let R be the relation on the set of all real numbers defined by a R b iff |a – b| ≤ 1. Then
determine whether R is reflexive, symmetric and transitive.
25. Relation R in the set A = {1, 2, 3, 4, 5, 6, 7, 8} as R = {(x, y): x divides y}. Determine whether
R is reflexive, symmetric and transitive.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 20
 1. Relation and Function
26. Let L denote the set of all straight lines in a plane. Let a relation R be defined by l1 R l2 if
and only if l1 is perpendicular to l2, l1, l2  L. Determine whether R is reflexive, symmetric
and transitive.
27. If A = {a, b, c} then find the number of relations containing (a, b) and (a, c) which are
reflexive and symmetric but not transitive.
28. The relation R in the set {1, 2, 3, ..., 13, 14} is defined by R = {(x, y): 3x – y = 0}. Determine
whether R is reflexive, symmetric and transitive.
29. The relation R in the set of natural numbers N is defined by R = {(x, y): x > y}. Determine
whether R is reflexive, symmetric and transitive.
30. Let W denote the set of words in English dictionary. Define the relation R by R=
{(x, y):x, y ∈W such that x and y have at least one letter in common}. Show that
this relation R is reflexive and symmetric but not transitive
31. Check whether the relation R on the set N of natural numbers given by R= {(a, b):
b is a multiple of a} is reflexive, symmetric and transitive
3
32. Check whether the relation R on set of all real numbers R as R= {(a, b): a ≤ } is
reflexive, symmetric and transitive
33. Let R be a relation defined on the set of natural numbers N as = {( , ): ,
∈ ,2 + = 11}. Verify whether R is reflexive, symmetric and transitive

LONG TYPE QUESTION

1. Show that the relation on the set A={x∈Z:0≤x≤12} given by R= {(a, b) :| - | is
divisible by 4} is an equivalence relation Find all elements related to 1, equivalence
class [1].
2. Prove that the relation R in the set Z of integers defined as R= {(a, b): a + b is
divisible by 2} is an equivalence relation. Write the equivalence class [ 0].
3. Let N be the set of natural numbers and R be the relation on NXN defined by (a, b)
R (c, d) if only if ad=bc for all a, b, c, d∈ N. Show that R is an equivalence relation.
4. Let A= {1,2, 3, …,9} and R be the relation on A×A defined as (a, b) R (c, d) if and
only if a+d = b+c. Prove that R is an equivalence relation also obtain the
equivalence class [(2,5)].
5. Let R be the relation on N×N defined by (a, b) R (c, d) if and only if ad (b+c) =bc
(a+ d), Prove that R is an equivalence relation.
6. Show that the relation R defined on the set N×N defined as (a, b) R (c, d) if and
2
only if + 2= 2+ 2
is an equivalence relation.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 21
 1. Relation and Function

ASSERTION AND REASONING QUESTION

In the following questions, a statement of assertion (A) is followed by a statement of Reason
(R). Choose the correct answer out of the following choices.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
1. ASSERTION: A relation R in the set R defined as = {( , ): ≤ )} is reflexive and
transitive but not symmetric.
REASON: A relation R in a set A is said to be reflexive if ( , ) ∈ , for every ∈ .
2. ASSERTION: A relation R = (1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} is reflexive defined on the set
{1,2,3}.
REASON: A relation R in a set A is said to be reflexive if ( , ) ∈ , for every ∈ .
3. ASSERTION: A relation = {( 1, 2): 1 2} is an equivalence
relation defined on the set L of all lines in a plane
REASON: A relation R in a set A is said to be an equivalence relation if R is reflexive,
symmetric and transitive.
4. ASSERTION: A relation R in the set {1,2,3} given by = {(1,2), (2,1)} is symmetric and
transitive but not reflexive.
REASON: A relation R in the set {1,2,3} given by R = (1,2), (2,1)} is symmetric but neither
reflexive nor transitive.
5. ASSERTION: A relation R in the set = {1,2,3,4,5} given by = {( , ): | - | } is
an equivalence relation.
REASON: No element of {1,3,5} is related to any element of {2,4}

CASE BASED QUESTION

1. During a Swachh Bharat Abhiyan

organizing committee wanted collect
and segregate Metal, Paper, glass,
batteries, organic and plastic waste. In
the set of all participants a relation R
defined as R= {(x, y) ∈R: both the
participants x and y collect the same
type of waste} Based on the information

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 22
 1. Relation and Function
given above answer the following questions
(i) Check whether R is an Equivalence relation in the set of all participants
(ii) In how many groups the participants are divided on the basis of their waste collection
assumes that there are participants to collect all type of waste
(iii) State whether the waste collected from different groups are segregated or not?
2. Physical education teacher asked the class
teacher to form four teams with 12 members
each out of the 48 students for a Kabaddi
match. The class teacher asked to the
students to form teams in such way that
“two students are in the same team if
difference of their roll numbers is divisible by
4” Based on the above information answer
the following questions
(a) Is it possible to form the teams by the method adopted by class teacher?
(b) Which roll numbers are members of the team in which roll number 5 belongs?
(c) If R is a relation defined in the set of roll numbers as R={(x,y):difference of x and y is
divisible by 4 } show that R is an equivalence relation?
3. Farmers plant sapling along straight lines
parallel to each other as in figure. Let us
assume that saplings are planted along the
line y=x +1 and parallel to it. Let L be the set
of all lines on the field.
Answer the following using the above
information
(i) 1 be a relation defined on L as 1= {( 1, 2): 1 ∥ 2, where 1, 2∈L} then 1 is ……...
(a) Equivalence relation (b)only Reflexive
(c)Not reflexive (d) Symmetric but not transitive
(ii) Which of the following line is related the line y=x+1 as per definition of the relation 1

(a) 2x-y+5=0 (b) 2x+y=5 (c) 2x-2y=10 (d) x+y=1

(iii) 2 be a relation defined on L as 2= {( 1, 2): 1⟂ 2, where 1, 2∈L} then 2 is ……...
(a) symmetric but neither reflexive nor transitive
(b) reflexive and symmetric but not transitive
(c) reflexive but neither symmetric not transitive
(d) 2 is an equivalence relation
(iv) The function f: R→R defined by f(x)=x+1 is …….
(a) Injective but not surjective (b) Surjective but not injective
(c) Bijective (d) Neither Injective Not Surjective

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 23
 1. Relation and Function
(v) Let function f: R→R defined by f(x)=x+1 then range of
(a) Q (b) Z (c) W (d) R
4. Sherlin and Danju are playing Ludo by rolling the dice alternately
was observed that the possible outcome of the die belongs to the
set B= {1,2,3,4,5,6}. Let A ={S, D},be the set of all players
Answer the following questions
(i) Let R: B→B defined as R={(x,y): y is divisible by x} then R is
(a) reflexive and transitive but not symmetric
(b) reflexive and symmetric not transitive
(c) Not reflexive but symmetric and transitive
(d) Equivalence relation
(ii) How many relations can be defined from A to B
(a) 24 (b) 236 (c) 28 (d) 212
(iii) How many functions can be defined from A to B
(a) 36 (b) 64 (c) 720 (d) 1024
(iv) Let 1 be a relation on B defined as 1= {(1,2),(2,2),(1,3),(3,4),(3,1),(4,3),(5,5)}
then 1 is
(a) Symmetric (b) Reflexive (c) Transitive (d) None of these
(v) How many surjections can be defined from A to B
(a) 30 (b) 0 (c) 32 (d) 64

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 24
 1. Relation and Function

Definition
.

Independent
input variable

input domain

( )
Dependent
variable
output output
range

. . ’ ℎ − − .

RELATION FUNCTION

a 1 a 1 a 1 a 1

b 2 b 2 b 2 b 2

c 3 c 3 c 3 c 3

d 4 d 4 d 4 d 4

one-one one-many many-one many-many

ℎ ℎ − .

ℎ ( )
− .

: → ℎ ℎ .

NOTATION

PROTOTYPE: : →
DEFINITION: →

( )=

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 25
 1. Relation and Function

(x, f(x))

range
range

co-domain
f(x)
x
f(x)

x domain
domain co-domain

IMAGES

y
A
x

ℎ ℎ
−

( )={ |∃ , = ( )}
1 a A
f(A)

2 b

3 c

4 d
X Y
5 e

x f(x)
( )={ |∃ , = ( )}

= {1,2,3}
ℎ { , }
So, ( ) = { , }
ℎ { , , , }

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 26
 1. Relation and Function
PREIMAGES

 1 ℎ .
 {2,3} ℎ .
1 a
The preimage of co-domain is the set of all element of the
2 b domain to map to it.
3 c ( )={ | = ( )}
 ( )=1
4 d  ( ) = {2,3}
5 e =f inverse

TESTING FOR A FUNCTION BY VERTICAL LINE TEST:

A relation f: A  B is a function or not it can be checked by a graph of the relation. If it is

possible to draw a vertical line which cuts the given curve at more than one point then the given
relation is not a function and when this vertical line means line parallel to Y-axis cuts the curve at
only one point then it is a function. Figure (iii) and (iv) represents a function.

() ( ) ( ) ( )

NUMBER OF FUNCTIONS:

Let X and Y be two finite sets having m and n elements respectively. Then each element
of set X can be associated to any one of n elements of set Y. So, total number of functions from
set X to set Y is nm .

ALGEBRA OF FUNCTIONS:

SCALAR MULTIPLICATION : ( )( )= ( ), where c is a scalar

ADDITION : ( + )( )= ( ) + ( )
SUBSTRACTION : ( − )( )= ( ) − ( )
MULTIPLICATION : ( )( )= ( ) ( )
( )
DIVISION : ( )= , where ( ) ≠ 0
( )

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 27
 1. Relation and Function

DOMAIN AND RANGE OF SOME STANDARD FUNCTIONS

FUNCTION FORMULA DOMAIN RANGE GRAPH

CONSTANT ( )= . { .}

IDENTITY ( )=

SQUARE ( )= ∪ {0}

CUBE ( )=

1
RATIONAL ( )= − {0} − {0}

SQUARE ROOT ( )=√ ∪ {0} ∪ {0}

MODULUS ( )=| | ∪ {0}

SIGNUM ( )= ( ) {−1,0,1}

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 28
 1. Relation and Function

GREATEST
( )=[ ]
INTEGER

EXPONENTIAL ( )= , >0

( ) = log ,
LOGARITHM
>0

SINE ( )= ( ) [−1,1]

COSINE ( )= ( ) [−1,1]

(2 + 1)
− ,
TANGENT ( )= ( ) 2
∈

COTANGENT ( )= ( ) −{ }, ∈

(2 + 1)
− ,
SECANT ( )= ( ) 2 − (−1,1)
∈

COSECANT ( )= ( ) −{ }, ∈
− (−1,1)

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 29
 1. Relation and Function

Types of Functions

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 different images in B. Thus,

f : A  B is one-one.
 ¹ Þ ( )¹ ( ) for all a, b  A
 ( )= ( )Þ = for all a, b  A.

A B A B

1 a 1 a
2 b 2 b
3 c 3 c
4 d 4 d
e e

Method to check the injectivity of a function

Step I: Take two arbitrary elements x, y (say) in the domain of f.
Step II: Put f(x)  f(y).
Step III: Solve f(x)  f(y). If f(x)  f(y) gives x = y only, then f: A  B is a one-one function
(or an injection). Otherwise not.

 If function is given in the form of ordered pairs and if two ordered pairs do not
have same second element then function is one-one.
 If the graph of the function y = f(x) is given and each line parallel to x-axis
cuts the given curve at maximum one point then function is one-one.

 If A and B are finite sets having m and n elements respectively, then number
, ≥
of one-one functions from A to B =
, <

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 30
 1. Relation and Function

Many-one function:
A function f : A  B is said to be a many-one function if two or more elements of set A have the
same image in B. Thus,
∶ ® − ℎ , Î ℎ ℎ

A B A B

1 a 1 a
2 b 2 b
3 c 3 c
4 d 4 d
e e

¹ ( )= ( ).

 If function is given in the form of set of ordered pairs and the second
element of at least two ordered pairs are same then function is many-one.
 If the graph of y f(x) is given and the line parallel to x-axis cuts the
curve at more than one point then function is many-one.

 If the domain of the function is in one quadrant, then the trigonometrical

functions are always one-one.
 If trigonometrical function changes its sign in two consecutive quadrants,
then it is one-one but if it does not change the sign then it is many-one.

 In three consecutive quadrants trigonometrical functions are always

many-one.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 31
 1. Relation and Function

Onto function (surjection):

A function f: A  B is onto if each element of B has its pre-image in A. Therefore,

( )Î , " Î ℎ .
In other words, = − .

A B A B

1 a 1 a
2 b 2 b
3 c 3 c
4 d 4

 If A and B are two sets having m and n elements respectively such that 1  n  m, then

number of onto functions from A to B is = ∑ (− )

Into function:

A function f : A  B is an into function if there exists an element in B having no pre-image in A.

In other words, f : A  B is an into function if it is not an onto function.

A B A B

1 a 1 a
2 b 2 b
3 c 3 c
4 d 4 d
e e

Method to find onto or into function

(a)If range = co-domain, then f(x) is onto and if range is a proper subset of the co-domain,
then f(x) is into.
(b)Solve f(x)  y by taking x as a function of y i.e., g(y) (say).
(c) Now if g(y) is defined for each y co-domain and g(y) domain for y  co-domain, then
f(x) is onto and if any one of the above requirements is not fulfilled, then f(x) is into.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 32
 1. Relation and Function

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 well as surjective.

 If A and B are finite sets and f: A  B is a bijection, then A and B have the same
number of elements. If A has n elements, then the number of bijection from A to B is
the total number of arrangements of n items taken all at a time i.e. n! .

EXAMPLE -1.1
Function f : N  N, f(x)  2x  3 is
(a) One-one onto (b) One-one into (c) Many-one onto (d) Many –one into
Solution: (b) f is one-one because
f(x1)  f(x2)
 2x1  3  2x2  3
 x1  x2
Further let y=f(x)
 y  2x  3
 y -3 2x

 =

So, ( )= ∉ ( ), when x=1,2,3 etc

 f is into which shows that f is one-one into.

EXAMPLE -1.2
The function f : R  R defined by f(x)  (x  1)(x  2)(x  3) is
(a) One-one but not onto (b) Onto but not one-one
(c) Both one-one and onto (d) Neither one-one nor onto
Solution: (b) We have f(x)  (x  1)(x  2)(x  3)
 f(1)  f(2)  f(3)  0
 f(x) is not one-one
For each y  R, there exists x  R such that f(x)  y.
Therefore f is onto.
Hence, f : R  R is onto but not one-one.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 33
 1. Relation and Function

EXAMPLE -1.3

Let A = R – {3} and B = R – {1}. Consider the function f: A  B defined by ( )= is

one-one and onto.

Solution: given : → , ( )=

Let ( )= ( )
 =

( − 2)( − 3) = ( − 3)( − 2)
 −2 −3 +6= −3 −2 +6
 =
 f is a one-one
Further let = ( )
 =

 ( − 3) = −2
 −3 = −2
 − =3 −2
 ( − 1) = 3 − 2
 =

Therefore, for any , there exist

 f is onto
 f is one-one onto

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 34
 1. Relation and Function

MULTIPLE CHOICE QUESTION

2
1. If the function f :2,)→ B defined by ( ) = - 4 + 5 is a bijection, then B is:
a) R b) 1,) c) 4,) d) 5,)
2. Let function : −{ }→ − {1} be defined by ( ) = ∶ ≠ then.

a) f is one-one but not onto b) f is onto but not one-one

c) f is one-one and onto d) None of these
3. Let function : [0, ∞) → be defined by ( ) = is;

a) f is both one-one and onto b) f is one-one but not onto

c) f is onto but not one-one d) f is neither one-one nor onto
4. Which of the following function from Z to itself are bijections?
a) ( ) = b) ( ) = +2 c) ( ) = 2 + 1 d) ( ) = +
5. The function : → be defined by ( ) = ( − 1)( − 2)( − 3) is;
a) f is both one-one and onto b) f is one-one but not onto
c) f is onto but not one-one d) f is neither one-one nor onto
6. Let : → be defined as ( ) = 3 . Choose the correct answer
a) f is both one-one and onto b) f is one-one but not onto
c) f is onto but not one-one d) f is neither one-one nor onto
2
7. Let X= {x : ∈ } and the function f: N->X is defined as f(x)=x2, x ∈ N then the
function f is ?
a) Bijective b) Not bijective c) Surjective only d) Injective only
8. Let f: R->R defined as f(x)=4+3cosx then f(x) is
a) Bijective b) One to one but not onto
c) Onto but not one to one d) Neither one to one nor onto
9. The number of one-to-one functions that can be defined from the set {1,2,3,4,5}
to {a, b}
a) 5 b) 0 c) 2 d) 3

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 35
 1. Relation and Function

SHORT TYPE QUESTION

1. Prove that the function : → , given by f(x) = 2x, is one – one.

2. Consider State whether the function is one – one, onto or bijective : → defined by f(x)
=1+x2.
3. State whether the function is one – one, onto or bijective : → defined by
f(x) = 3 –4x .
4. Let f : R → R be defined as f ( ) = | |. Check whether f is one-one and onto?
5. Let f : R → R be defined as f ( ) = [ ]. Check whether f is one-one and onto?
6. State whether the function : → given by ( ) = 7 is injective, surjective or both.
4
7. Show that the function : → be defined as ( ) = is neither one-one nor onto.
8. If ( ) = 4, then write the number of one-one functions from
9. If F= {(1,2), (2,4), (3,1), (4, k)} is a one – to - one function from set A to A, where A=
{1,2,3,4} then find the value of k, also find the number of bijections can defined
from A to A.
10. A relation f defined in the set of real numbers R as = ( , ): √ = Verify whether f is
a function from R to R.
11. Show that the function f: RR given by f(x)=4x3+7 is a bijection

LONG TYPE QUESTION

1. Prove that the Greatest Integer Function f : R R, given by f (x) = [x], is neither one-one
or onto, where [x] denotes the greatest integer less than or equal to x.
2. Show that the Modulus Function f : R R, given by f (x) = | x |, is neither one-one nor onto,
where | x | is x, if x is positive or 0 and | x | is – x, if x is negative.
3. In each of the following cases, state whether the function is one-one, onto or bijective.
Justify your answer.
(i) f : R  R defined by f (x) = 3 – 4x (ii) f : R  R defined by f (x) = 1 + x2.
4. Let A and B be sets. Show that f : A × B  B × A such that f (a, b) = (b, a) is bijective
function.
5. Let f : N  N be defined by
+1
,
( )= 2 ∈
,
2
State whether the function f is bijective. Justify your answer
6. Consider f : R  R given by f (x) = 4x + 3. Show that f is one-one and onto.

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 36
 1. Relation and Function
7. Consider f : R+ [– 5, ) given by f (x) = 9x2 + 6x – 5. Show that f is one-one and onto.
+1 ,
8. Show that f : N  N , given by ( ) = is both one-one and onto.
−1 ,

9. Consider ∶ − − → − given by ( ) = . Show that f is bijective.

2
10. Prove that the function : → , defined by ( ) = + + 1 is one-one but not onto.

11. Let ∶ − − → be a function defined as ( ) = . Show that f is one-one

function. Also check whether f is an onto function or not.

12. Show that f : N  N , given by ( ) = is neither one to one nor onto.

ASSERTION AND REASONING QUESTION

In the following questions, a statement of assertion (A) is followed by a statement of Reason
(R). Choose the correct answer out of the following choices.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
1. ASSERTION: Every even function y = f(x) is not one-one for all in x ∈ Df .
REASON: Even function is symmetrical about y – axis.
2. ASSERTION: The Modulus function : → , given by ( ) = | | is not onto.
REASON: A function : → is onto if and only if Range of = .
3. ASSERTION: The Modulus function : → , given by ( ) = [ ] is one-one
REASON: : → is said to be one-one if for every , ∈ , ( ) = ( ).
4. ASSERTION: A mapping shown in the arrow diagram, the function : → , is injective.

5 7

6 9

7 10

8 8

REASON: A function : → is said to be onto if every element of B has a pre-image in

A.
5. ASSERTION: A function is said to be bijective if it is one-one and onto.
REASON: The signum function : → , given by

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 37
 1. Relation and Function
1 >0
( )= 0 = 0 is bijective.
−1 <0
6. ASSERTION: Let A and B be two sets. A function : × → × such that ( , )=( ,
) is one one.
REASON: A function : → is said to be one-one if for every , ∈ , ( ) = ( ).

CASE BASED QUESTION

1. Raji visited the Exhibition along with her family.

The Exhibition had a huge swing, which attracted
many children. Raji found that the swing traced
2
the path of a parabola as given by = . above
answer the following questions
(a) Let f: N→N be defined by f(x) = x². Then which
type of the function is f?
(b) Let f: N→R be defined by f(x)=x2. Range of the
function among the following is:
(c) The function f: Z→Z defined by f(x) = x². Then which type of the function is f?
2. In a Master chef competition final round 3
chef were selected and Judges assigned
three dishes D= { 1, 2, 3,} to the
participants P= { 1, 2, 3,} and asked
them to prepare dishes as per the
following rules.
Rule A: everybody has to prepare exactly
one dish
Rule B: No two participant is allowed to prepare same dish
Rule C: All the dish must be prepared in the competition
(a) In how many ways all participants can choose a Dish as per rule A? Justify your answer
(b) In how many ways everybody can choose a dish to prepare as per Rule B? Justify your
answer
(c) If ow many ways all participants can prepare exactly one dish as per rule C, Justify your
answer

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 38
 1. Relation and Function
CONCEPT MAP

DOMAIN CODOMAIN
CARTESIAN First elements in Second elements

ordered pairs in ordered pairs

PRODUCT
× = ∈ ∈
{( , )| ∈ , ∈ }
RANGE
Subset of
RELATION
Codomain
REFLEXIVE ⊆ ×
RELATION EMPTY
( , ) ∀ ∈ RELATION
TYPES OF ∅=
RELATION

SYMMETRY UNIVERSAL
RELATION RELATION
EQUIVALENCE
( , )
× =
( , ) ∀ , ∈ RELATION
,
&

TRANSITIVE
RELATION
( , )
FUNCTION
,( , )
( , ) ∀ , , ∈ : →

ONTO
: →

ONE-ONE
∃
: → .
− RANGE=CODOMAIN

TYPES OF
FUNCTION INTO
MANY-ONE : →
: → ∃
−

BIJECTIVE
: →

Ganita Karmasala
Bijaya Ranjan Karmi CLASS XII | CBSE | MATHEMATICS | 2024-25 | Page 39