Topic Practice 1

1 Find the domain and range of the following relations.

(i) R={(−3 ,2) ,(−2 , 4),(0 , 5) ,(2 ,6)}

(ii) S={(x , y):2 x+ y=7 , x , y ∈ N }

(iii) R={( a ,a 2 ) : a is a prime number less than 8}

(iv) S={(c , d ): d=¿ c−1∨, c ∈ Z and ¿ c∨¿ 4 }

2 If R is a relation 'is divisor of ' from the set A={1 , 2, 3 } to B={4 ,10 , 15 },
then write down the set of ordered pairs corresponding to R .

3 State the reason for the relation R in the set {1 , 2 ,3 } given by

R={(1, 2), (2 ,1)} is not to be transitive.

[Foreign 2011]

4 Let A={0 , 1 ,2 , 3 } and define a relation R on A as

R={(0 , 0),(0 ,1),(0 , 3),(1 , 0),(1 ,1),(2 ,2),(3 , 0),(3 ,3)}. Is R reflexive, symmetric
and transitive?

[NCERT Exemplar]

5 The following relations are defined on a set P={a , b , c } as follows

(i) R1={(a , b),(a , c),(a , a),(b ,b) ,(c , c ),(b , c), (c , a),(c ,b)}

(ii) R2={(b , c),(a , b),(c , a)}

(iii) R3={(b , c)}

Find whether or not each of the given relations are reflexive, symmetric
and transitive.

6 For real numbers x and y , define xRy if and only if x− y + √ 2 is an irrational

number. Is R transitive? Explain your answer.
7 Let A={a , b , c } and the relation R be defined on A as R={(a , a) ,(b , c),(a ,b) }
. Then, write minimum number of ordered pairs to be added in R to make R
reflexive and transitive.

8 Check if the relation R in the set R of real numbers defined as

R={(a , b): a<b } is
(i) symmetric,
(ii) transitive.

[All India 2020]

9 The following relations are defined on the set of real numbers as follows

(i) R1={(a , b):∨a∨≤ b }

(ii) R2={(a , b):a−b> 0 }

(iii) R3={(a , b):1−ab>0 }

Check whether the above relations are reflexive, symmetric and transitive.

10 Show that the relation S in the set R of real numbers defined as

S={(a , b): a ,b ∈ R and a ≤ b3 } is neither reflexive nor symmetric nor transitive.

[Delhi 2010]
11 Let N be the set of all natural numbers and let R be a relation in N ,
defined by R={(a , b): a is a multiple of b }.

Show that R is reflexive and transitive but not symmetric.

12 Let A be the set of all points in a plane and R be a relation on A defined

as R={(P , Q) : distance between P and Q is less than 2 units}.

Show that R is reflexive and symmetric but not transitive.

13 Let R be a relation defined on the set of natural numbers N as

R={(x , y): x ∈ N , y ∈ N and 2 x+ y=24 ). Then, find the domain and range of
the relation R. Also, find whether R is an equivalence relation or not.

[Delhi 2014C]
14 Let A={1 , 2, 3 }. Then, find the number of equivalence relations
containing (1 , 2).

15 Show that the relation R in the set Z of integers given by R={(a , b):2
divides (a−b)} is an equivalence relation.

[NCERT]

16 Show that the relation R defined on the set A of all triangles in a plane
as R={( T 1 , T 2 ) :T 1 is similar to T 2 } is an equivalent relation.

17 Let R be a relation on the set A of ordered pairs of positive integers

defined by (x , y )R (u , v ) if and only if xv= yu. Show that R is an equivalence
relation.

[NCERT]

18 If N denotes the set of all natural numbers and R is the relation on N × N

defined by (a ,b) R(c , d) , if ad (b+c )=bc (a+ d). Show that R is an equivalence
relation. [CBSE 2023; Delhi 2015]

19 Show that the relation R defined by (a ,b) R(c , d) ⇒ a+d=b +c on the set
N × N is an equivalence relation.

[All India 2010]

20 Show that the union of two equivalence relations on a set is not

necessarily an equivalence relation on the set.

21 Let A={x ∈ Z :0 ≤ x ≤ 12}. Show that R={(a , b): a ,b ∈ A ,∨a−b∨¿ is divisible

by 4} is an equivalence relation. Find the set of all elements related to 1 .
Also, write the equivalence class [2].

[CBSE 2018]

22 Show that the relation R in the set

A={1 , 2, 3 , 4 ,5 } given by R={(a , b):∨a−b∨¿ is even } is an equivalence
relation. Also, show that all elements of {1 , 3 , 5} are related to each other
and all the elements of {2 , 4 } are related to each other, but no element of
{1 , 3 , 5} is related to any element of {2 , 4 }.
[NCERT]

23 Show that the relation R in the set A of points in a plane given by

R={(P , Q) : distance of the point P from the origin is same as the distance of
the point Q 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 centre.

[NCERT]

24 Let X ={1 , 2 ,3 , 4 ,5 , 6 , 7 , 8 , 9 }. Let R1 be a by 3 ) and R2 be another relation

on X given by R2={(x , y):{x , y }⊂{1 , 4 , 7 } or {x , y }⊂ {2 , 5 ,8 } or {x , y }⊂ {3 , 6 , 9 }}
. Show that R1=R 2.

[NCERT] relation on X given by R1={(x , y): x− y is divisible

25 In the set of natural numbers N , define a relation R as follows

∀ n , m∈ N ,nRm , if on division by 5 each of the integers n and m leaves the
remainder less than 5 , i.e. one of numbers 0 , 1 ,2 , 3 and 4 . Show that R is an
equivalence relation. Also, obtain the pairwise disjoint subset determined
by R.

[NCERT Exemplar]

26 A Relation R is defined on a set of real numbers R as R={(x , y)=x ⋅ y is an

irrational number } check whether R is reflexive, symmetric and transitive
or not.

[CBSE 2023]

8. Given, A=¿ Set of real numbers and R={(a , b): a<b }

Symmetric Let (a ,b)∈ R , then a< b or a=b.

If a=b, then b=a

But if we consider a< b, then b ≮ a ⇒(b , a)∉ R .

e.g. 4 <5 but 5 ≮ 4

So, R is not symmetric.

Transitive Let (a ,b),(b ,c )∈ R, then
(a ,b)∈ R ⇒ a<b

(b , c )∈ R⇒ b< c

From Eqs. (i) and (ii), we get a< c

⇒(a , c )∈ R

So, R is transitive.

9. Similar as Example 7 and 8.

Ans. (i) R1 is only transitive.

(ii) R2 is only transitive.

(iii) R3 is only symmetric.

Domain ¿ {−3 ,−2,−1 ,0 ,1 , 2 ,3 },

Range ¿ {0 ,1 , 2 ,3 , 4 }

2. Here, R={(a , b):b /a ; a ∈ A ,b ∈ B }

¿ {(1 , 4),(1 ,10),(1 , 15),( 2, 4 ), (2 ,10),(3 , 15)}

3. Here, (1 , 2)∈ R and (2 , 1)∈ R , but (1 , 1)∉ R .

Hence, R is not transitive.

4. Hint (i) R is reflexive, as (a ,a)∈ R , ∀ a ∈ A .

(ii) R is symmetric, as (0 , 1)∈ R ⇒ (1 , 0)∈ R
and
(0 , 3)∈ R ⇒(3 , 0)∈ R

(iii) R is not transitive, as (3 , 0),(0 , 1)∈ R ⇏(3 ,1)∈ R .

[Ans. Reflexive, symmetric and not transitive]

5. Similar as Example 2.
Ans. (i) R1 is only reflexive.
(ii) R2 is neither reflexive nor symmetric nor transitive.

(iii) R3 is only transitive.

6. Hint Consider (x , y )=(1 , √3) and ( y , z)=( √ 3 , √2)

Ans. No

7. For R to be reflexive, (b , b) and (c , c) should belong to R and for R to

be transitive (a ,c ) should belong to R, as (a ,b)∈ R and (b , c )∈ R.
Hence, minimum number of ordered pairs to be added in R is 3 .

8. Similar as Example 7.

9. Similar as Example 9.

10.Given, A=¿ Set of all points in a plane.

R=¿ {( P , Q): Distance between P and Q is less
than 2 units }

Reflexive Let P ∈ A be any arbitrary point. Then, distance between P and P

is 0 , which is less than 2 units.
⇒(P , P)∈ R

Thus, (P , P)∈ R for all P ∈ A

So, R is reflexive.

Symmetric Let P , Q∈ A such that (P , Q)∈ R , i.e. distance between P and Q is

less than 2 units.
⇒ Distance between Q and P is less than 2 units.

⇒ (Q , P)∈ R

So, R is symmetric.

Transitive Consider the points P , Q and S having coordinates (0 , 0),(1 , 0) and

(2 , 0), respectively. We can which is less than 2 units and also the distance
between Q and S is 1 unit. observe that, the distance between P and Q is 1
unit,
But the distance between P and S is 2 units, which is not less than 2 units.

Thus, (P , Q)∈ R ,(Q , S)∈ R but (P , S)∉ R .

So, R is not transitive.

13.Given, R={(x , y): x ∈ N , y ∈ N and 2 x+ y=24 }

Here if x=1, then y=22
[ ∵ put x=1 in 2 x + y=24 , we get y =22]

If x=2 , then y=20 ; If x=3 , then y=18 ;

If x=4 , then y=16 ; If x=5 , then y=14 ;
If x=6 , then y=12 ; If x=7 , then y=10 ;
If x=8 , then y=8; If x=9 , then y=6 ;
If x=10 , then y =4 ; If x=11, then y=2;
∴ R={(1 ,22),(2 , 20),(3 , 18),(4 ,16),(5 , 14),(6 , 12),( 7 ,10), (8 , 8),(9 , 6),(10 , 4),(11, 2) }

Hence, domain ¿ {1 , 2 ,3 , 4 , 5 ,6 ,7 , 8 , 9 , 10 ,11}

and range ¿ {22 , 20 , 18 ,16 , 14 ,12 , 10 ,8 , 6 , 4 , 2}.

Reflexive Clearly, 1 ∈ N but (1 , 1)∉ R , so R is not reflexive.

Hence, R is not an equivalence relation.

14.It is given that, A={1 , 2, 3 }. An equivalence relation is reflexive,

symmetric and transitive.
The smallest equivalence relation containing (1 , 2) is given by
R1={(1 , 1),(2 , 2),(3 ,3),(1 , 2),(2 , 1)}

Now, we are left with only four pairs, (2 , 3),(3 ,2) ,(1 ,3) and (3 , 1). If we add
any one pair [say (2 , 3)¿ to R1, then for symmetry, we must add (3 , 2).

Also, for transitivity, we are required to add (1 , 3) and (3 , 1) .

Hence, the only equivalence relation (bigger than R1 ) is the universal

relation.

This shows that, the total number of equivalence relations containing (1 , 2)

is two.
 15.Given, R={(a , b):2 divides (a−b)}
and Z=¿ Set of integers

Reflexive Let a ∈ Z be any arbitrary element.

Now, if (a ,a)∈ R , then 2 divides a−a , which is true.

So, R is reflexive.

Symmetric Let a , b ∈ Z , such that

(a ,b)∈ R ⇒ 2 divides (a−b)⇒ 2 divides [−(a−b)]

⇒ 2 divides (b−a)⇒(b , a)∈ R

So, R is symmetric.

Transitive Let a , b , c ∈ Z , such that (a ,b)∈ R and (b , c )∈ R

⇒ a−b and b−c both are divisible by 2 .

⇒ a−b+ b−c is divisible by 2 .

⇒ (a−c) is divisible by 2 .

⇒(a , c )∈ R

So, R is transitive.

Thus, R is reflexive, symmetric and transitive.

Hence, R is an equivalence relation.

16.Similar as Example 12.

17.Given, A=N × N and a relation R on A , defined as (x , y )R (u , v ), iff
xv= yu.

Reflexive Let (x , y )∈ A be any arbitrary element.

Now, we have to show that (x , y )R (x , y ).

Clearly, xy= yx ⇒(x , y )R (x , y )

∵ (x , y)∈ A was arbitrary.

∴ (x , y)R (x , y ), ∀ (x , y )∈ A

So, R is reflexive.

Symmetric Let (x , y ) and (u , v )∈ A such that

(x , y )R (u , v ).

Now, we have to show that (u , v )R (x , y ), i.e. uy=vx .

∵ (x , y )R (u , v )
⇒ xv= yu
⇒ yu=xv
⇒ uy=vx
⇒ (u , v )R (x , y )

So, R is symmetric.

Transitive Let (x , y ),(u , v ) and (a ,b)∈ A , such that (x , y )R (u , v ) and

(u , v )R (a , b)

Now, we have to show that (x , y )R (a , b), i.e. xb= ya.

∵ (x , y )R(u , v)⇒ xv= yu
and (u , v )R (a , b)⇒ ub=va

a
Now, multiplying both sides of Eq. (i) by u , we get

xv ( au ) ¿ yu ( ua )= yu( au ) ¿ ⇒ ¿ xb ¿= ya ¿ ⇒¿ ¿ (x , y )R(a , b)¿

⇒ ¿

So, R is transitive.

Hence, R is an equivalence relation.

18.We have a relation R on N × N defined by (a ,b) R(c , d) , if

ad (b+c )=bc (a+ d)
Reflexive Let (a ,b)∈ N × N be any arbitrary element.

We have to show that (a ,b) R(a ,b), i.e.

ab (b+ a)=ba( a+b), which is always true, as natural numbers are
commutative under usual multiplication and addition.

Since, (a ,b)∈ N × N was arbitrary, so R is reflexive.

Symmetric Let (a ,b),(c , d )∈ N × N

such that (a ,b) R(c , d) , i.e. ad (b+c )=bc (a+ d)

We have to show that (c , d) R(a ,b) ,

i.e. cb (d +a)=da(c +b)

From Eq. (i), we have ad (b+c )=bc (a+ d)

⇒ da(c +b)=cb(d+ a)

¿ natural numbers are commutative under usual addition and

multiplication]
⇒ cb(d + a)=da(c+ b)

⇒(c , d)R (a , b)

So, R is symmetric.

Transitive Let (a ,b),(c , d ) and (e , f )∈ N × N such that (a ,b) R(c , d) and

(c , d) R(e , f ).

∵
b+ c a+ d
⇒ =
bc ad
1 1 1 1
⇒ + = +
c b d a
and (c , d) R(e , f )⇒ cf (d+ e)=de ⁡(c+ f )
d +e c + f
⇒ =
de cf
1 1 1 1
⇒ + = +
e d f c

Now, adding Eqs. (ii) and (iii), we get

( )( ) (
1 1
+ + +
c b
1 1
e d
¿
1 1
d a )( )
+ + +
1 1
1 1
f c = + ¿⇒¿¿
a f
e+b
be
¿=
f +a
af
¿⇒ ¿ ¿ af (e+b) ¿=be(f +a)¿ ⇒ ¿ ¿ af (b+e) ¿=
⇒ ¿

So, R is transitive.

Hence, R is an equivalence relation.

19.Similar as Question 18.

20.Let A={1 , 2, 3 } and R1 and R2 be the relations on A is defined as

R1={(1 , 1),(2 , 2),(3 ,3),(1 , 2),(2 , 1)}

and R2={(1 , 1),(2 , 2),(3 ,3),(2 , 3),(3 , 2)}

It can be easily seen that R1 and R2 are the equivalence relations on A .

Now, R1 ∪ R 2={(1 ,1),(2 , 2),(3 , 3),(1 ,2),(2 ,1) ,(2 ,3),

Here, (1 , 2),(2 , 3)∈ R 1 ∪ R2

But, (1 , 3)∉ R 1 ∪ R2

So, R1 ∪ R 2 is not transitive.

Hence, R1 ∪ R 2 is not an equivalence relation.

21.Given, a relation R on A={0 , 1 ,2 , 3 , … ,12 } defined as

R={(a , b): a ,b ∈ A ,∨a−b∨¿ is divisible by 4}

To show R is an equivalence relation

(i) Reflexivity Let a ∈ A be an arbitrary element.

Then ¿ a−a∨¿ 0, which is divisible by 4 .

∴ (a ,a)∈ R

But a ∈ A was arbitrary.

∴ (a ,a)∈ R , ∀ a ∈ A

Thus, R is reflexive.
(ii) Symmetricity Let a , b ∈ A such that (a ,b)∈ R
∵ (a ,b)∈ R

∴∨a−b∨¿ is divisible by 4 .

⇒∨−(b−a)∨¿ is divisible by 4 . ⇒∨b−a∨¿ is divisible by 4 .

⇒ (b , a)∈ R

Thus, (a ,b)∈ R ⇒ (b , a) ∈ R

Hence, R is symmetric.

(iii) Transitivity Let a , b , c ∈ A such that (a ,b)∈ R and (b , c )∈ R

∵ (a ,b) and (b , c ) belongs to R .

∴ Both ¿ a−b∨¿ and ¿ b−c∨¿ are divisible by 4 ,

Let ¿ a−b∨¿ 4 λ and ¿ b−c∨¿ 4 μ for some real numbers λ and μ.

∴ a−b=± 4 λ and b−c=± 4 μ

Now, consider a−c=(a−b)+(b−c)

¿ ± 4 λ ± 4 μ=4(± λ ± μ)

which is divisible by 4 .
∴∨a−c∨¿ is divisible by 4 .

⇒ (a , c )∈ R

Thus (a ,b)∈ R ,(b , c)∈ R ⇒ (a , c)∈ R

Hence, R is transitive.

From above, we can conclude that R is an equivalence relation.

Clearly, the set of all elements related to 1

¿ Equivalence class of 1

¿ {a ∈ A :(1 , a)∈ R }
¿ {a ∈ A :∨1−a∨¿ is divisible by 4}

¿ {1 , 5 , 9 }

Similarly, [2]={a ∈ A :∨2−a∨¿ is divisible by 4}

¿ {2 , 6 , 10 }

22.Given, A={1 , 2, 3 , 4 ,5 } and R={(a , b):∨a−b∨¿ is even }.

Reflexive For any a ∈ A , we have ¿ a−a∨¿ 0, which is even.

Thus, (a ,a)∈ R , ∀ a ∈ A

So, R is reflexive.

Symmetric Let a , b ∈ A such that (a ,b)∈ R ⇒∨a−b∨¿ is even.

⇒∨−(b−a)∨¿ is even.

⇒∨b−a∨¿ is even.

⇒ (b , a)∈ R .

So, R is symmetric.

Transitive Let a , b , c ∈ A such that (a ,b)∈ R and (b , c )∈ R

⇒∨a−b∨¿ is even and ¿ b−c∨¿ is even.

⇒ ¿ and b both are even or both are odd) and ( b and c both are even or
both are odd)

Case I When b is even.

In this case, a is even and c is even ⇒∨a−c∨¿ is even ⇒ (a , c )∈ R .

Case II When b is odd.

In this case, a is odd and c is odd

⇒∨a−c∨¿ is even ⇒ (a , c )∈ R

Thus, (a ,b)∈ R ,(b , c)∈ R ⇒ (a , c)∈ R

So, R is transitive.

Hence, R is an equivalence relation.

Now, all elements of the set {1 , 3 , 5} are related to each other as all the
elements of this set are odd.

So, the modulus of the difference between any two elements will be even.

Similarly, all elements of the set {2 , 4 } are related to each other as all the
elements of this set are even. So, the modulus of the difference between
any two elements will be even.

But no element of the set {1 , 3 , 5} can be related to any element of {2 , 4 } as

all the elements of set {1 , 3 , 5} are odd and all the elements of set {2 , 4 } are
even.

So, the modulus of the difference between the two elements each from
these two subsets [as 3-2=1 not even, 5−2=3 not even, etc] will not be
even.

23.Given, A={ all points in a plane } and

R={(P , Q) : distance of the point P from the origin is the same as the
distance of the point Q from the origin}

Reflexive Let P ∈ A be any arbitrary point. Then, distance of a point P from

the origin is always same.
∴ (P , P)∈ R

So, R is reflexive.

Symmetric Let (P , Q)∈ R , where P , Q∈ A .

⇒ The distance of point P from the origin is same as the distance of point Q
from the origin.
⇒ The distance of point Q from the origin is same as the distance of point P
from the origin.
⇒ (Q , P)∈ R
Thus, (P , Q)∈ R ⇒ (Q , P)∈ R, where P , Q∈ A .

So, R is symmetric.

Transitive Let (P , Q),(Q , S )∈ R , where P , Q, S ∈ A .

⇒
and
OP=OQ
OQ=OS }
⇒ OP=OS

i.e. the distance of points P and S from the origin is same.

⇒ (P , S) ∈ R

So, R is transitive.

Hence, R is an equivalence relation on A .

Let P ≠(0 , 0) be a fixed point in the plane and Q(x , y) be any point in the
plane related to P, i.e. (P , Q)∈ R or distance of P from origin is same as
distance of Q from origin.

Then, OP=OQ=k (say)

∵ OQ= √¿ ¿

∴ k= √ x 2 + y 2 ⇒ x2 + y 2=k 2

This is an equation of the circle with centre (0 , 0) and radius k (distance of

point P from origin). Thus, all the points related to P satisfy this equation.
Hence, the set of all points related to a point P ≠(0 , 0) is the circle passing
through P with origin as centre.

24.Note that the characteristic of sets {1 , 4 ,7 }, {2 , 5 ,8 } and {3 , 6 , 9 } is that

difference between any two elements of these sets is a multiple of 3 .
Therefore, (x , y )∈ R1 ⇒ x− y is divisible by 3
⇒ x− y is a multiple of 3

⇒ { x , y }⊂ {1 , 4 ,7 } or {x , y }⊂ {2 , 5 ,8 } or {x , y }⊂ {3 , 6 , 9 }

⇒(x , y )∈ R2

Hence, R1 ⊆ R 2.

Similarly, (x , y )∈ R2 ⇒{x , y }⊂ {1 , 4 , 7 } or
{x , y }⊂ {2 , 5 ,8 } or {x , y }⊂ {3 , 6 , 9 }⇒ x− y is divisible by 3 ⇒( x , y )∈ R 1.

This shows that R2 ⊆ R1.

Hence, R1=R 2.

25. R is reflexive, since for each a ∈ N , aRa.

R is symmetric, since if aRb , then bRa for a , b ∈ N .

Also, R is transitive, since for a , b , c ∈ N , if aRb and bRc , then aRc .

Hence, R is an equivalence relation in N which will partition the set N into

the pairwise disjoint subsets.

The equivalence classes are as mentioned below

A0 ={ Set of numbers, which leaves remainder 0}

¿ {5 , 10 , 15 ,20 , … }

A1={ Set of numbers, which leaves remainder 1}

¿ {1 , 6 , 11, 16 ,21 , … }

A2={ Set of numbers, which leaves remainder 2}

¿ {2 , 7 , 12 ,17 , 22 , … }

A3 ={ Set of numbers, which leaves remainder 3}

¿ {3 , 8 , 13 , 18 ,23 , … }

A 4={ Set of numbers, which leaves remainder 4}

¿ {4 , 9 , 14 , 19 ,24 , … }

It is evident that, the above five sets are pairwise disjoint

and A0 ∪ A1 ∪ A 2 ∪ A 3 ∪ A 4=∪ 4i=0 A i=N

26.Hint ∵ ( √ 3 , √3)∉ R
∴ R is not reflexive.

( √ 3 , √ 2)∈ R and ( √ 2 ,3 √ 3)∈ R does not implies that ( √ 3 , 3 √3)∈ R

∴ R is not transitive.

Ans Symmetric but neither reflexive nor transitive.

Functions and Their Types

For any two non-empty sets A and B, a function f from A to B is a rule
which associates each element of set A to a unique element of set B.

A function f from A to B is represented by

f
f : A → B or A → B or f (x )

e.g. f : N → N define as f (x)=x2 is a function, where N is the set of natural

numbers.

Function (Mapping) as a Sef of Ordered Pairs

For any two non-empty sets A and B, a function from set A to set B is a
relation from A to B (denoted by f ) satisfying the following conditions

(i) For each a ∈ A , there exists b ∈ B such that (a ,b)∈ f .

(ii) (a ,b)∈ f and (a ,c )∈ f ⇒b=c .

Here, b is called f -image or image of a under f and a is called pre-image of b

under f .

e.g. If A={1 , 2, 3 } and B={4 ,5 }, then

f ={(1 , 4),(2 , 5),(3 , 4)} is a function but

f ={(1 , 4),(1 , 5),(2 , 4 ),(3 ,5)} is not a function as

(1 , 4)∈ f ,(1 ,5)∈ f ⇏ 4=5.

One important point is that every function is a relation but converse is not
always true. e.g. If A={1 , 2, 3 } and B={1, 4 }, then R={(1, 1),(1, 4 ), (2 , 4)} is a
relation but not a function.

Domain, Codomain and Range of a Function

Suppose a function f is defined from set A to set B. i.e. f : A → B . Then,
elements of set A are called domain of f and the set of all f images
obtained in set B corresponding to each element belongs to set A is called
range of f .

Dom (f )=A , Range (f )=f ( A )=(f (x ): x ∈ A)

Elements of set B are called codomain of f .

Codomain (f )=B

e.g. Let f : A → B be a function, where A={a , b , c } and B={2 , 4 , 8 , 16 }, defined

as
Then, domain ¿ {a , b , c }, codomain ¿ {2 , 4 , 8 ,16 }

and range ¿ {2 , 4 , 8} .

EXAMPLE 1. Let A={1 , 2, 3 } and B={2 , 4 , 6 , 8 }. Consider the rule f : A → B ,

defined as f (x)=2 x , ∀ x ∈ A . Find the domain, codomain and range of f .

Sol. Given, f (x)=2 x , ∀ x ∈ A

Value of function at x=1 , f (1)=2 (1)=2

Value of function at x=2 , f (2)=2(2)=4

Value of function at x=3 , f (3)=2(3)=6

We can write it as f ={(1 , 2),(2 , 4),(3 , 6)}

∴ Domain of f ={1 , 2 ,3 }, Codomain of f ={2, 4 , 6 , 8} and range of f ={2, 4 , 6 }

EXAMPLE 2. Find the domain and range of the following real functions.
( i ) f (x )=¿ x−3∨¿ (ii) g (x)=log ⁡(x +2)

(iii) h( x)=35 −x

Sol. (i) We have, f (x)=¿ x −3∨¿

It is a modulus function, which is define for all real values of x and the
values of f (x) is always non-negative.
∴ Domain ¿ R and Range ¿ ¿

(ii) We have, g(x )=log ⁡(x+ 2)

It is a logarithm function, which is defined for positive value.

∴ x+2> 0⇒ x>−2

And the values of logarithm function is always lies between (−∞, ∞).
∴ Domain ¿(−2 ,∞) and Range ¿(−∞ , ∞)

(iii) We have, h( x)=35 −x

It is an exponential function, so it is define for every values of x and it

always gives positive values.
∴ Domain ¿(−∞ , ∞) and Range ¿(0 , ∞)

Types of Functions
As we know that in a function, all elements of set A are associated to a
unique element of set B. But there are some more possibilities, which may
occur in a function, such as

(i) more than one elements of A may have same image in B.

(ii) each elements of B is image of some elements of A .

(iii) there may be some elements in B, which are not the images of any
element of A .
Corresponding to these possibilities, we define the following types of
functions.

One-One (Injective) Function

A function f : A → B is called a one-one or injective function, if distinct
elements of A have distinct images in B. Mathematically, for every a 1 , a2 ∈ A ,
if a 1 ≠ a2, then f ( a1 ) ≠ f ( a2 ) and if f ( a1 )=f ( a2 ) , then a 1=a2. e.g. Let f : A → B be a
function represented by the following diagram.

Here, f is a one-one function, because each element of set A has distinct

image in set B.

EXAMPLE 3. Let A={1 , 2, 3 }, B={4 ,5 , 6 , 7 } and f be a function from set A to

set B is f ={(1 , 4),(2 , 5),(3 , 6)}. Then, check whether f (x) is one-to-one or
not.

Sol. We have, f ={(1 , 4),(2 , 5),(3 , 6)}

Here, we see that every element of set A has unique image.

Hence, f is one-one.

EXAMPLE 4. Determine whether the following functions are one-one.

(i) f : R → R defined by f (x)=4 x +7.

(ii) g :Z → Z defined by f ( x)=x2 +5.

Sol. (i) Given, f : R → R defined by f (x)=4 x +7

Let x 1 , x 2 ∈ R, such that f ( x 1 ) =f ( x 2 )

⇒ 4 x 1+7=4 x 2+7 ⇒ 4 x 1=4 x 2 ⇒ x 1=x 2

So, f is one-one function.

(ii) Let x 1 , x 2 ∈ Z , such that f ( x 1 ) =f ( x 2 )

2 2 2 2
⇒ x 1 +5=x 2 +5 ⇒ x 1=x 2 ⇒ x 1=± x 2

∴ f is not a one-one function, as if we take

x 1=1 and x 2=−1, then f (1)=6=f (−1), but 1 ≠−1.

Many-One Function
A function f : A → B is called a many-one function, if there exist atleast two
distinct elements in A , whose images are same in B.
Mathematically, if there exist a 1 , a2 ∈ A , such that a 1 ≠ a2 and f ( a1 )=f ( a2 ), then
f is many-one.

In other words, a function f : A → B is called a many-one function, if it is not

one-one.

e.g. Let f : A → B be a function represented by the following diagram.

Here, f is many-one function, because a 1 and a 3 have same image b 2.

EXAMPLE 5. Let A={−3 ,−2 , 1 ,2 } and B={1, 4 , 9 }, then function f is defined

from set A to set B such that f (x)=x2 . Show that f is many-one function.

Sol. We have, A={−3 ,−2 , 1 ,2 }, B={1 , 4 , 9 } and f ( x)=x2

Now, f (−2)=¿ and f (2)=¿

Here, we see that for different values of x , we get the same value of f .
Hence, f is many-one function.

EXAMPLE 6. Show that the signum function

{
1, if x >0
f : R → R, given by f (x)= 0 , if x=0 is many-one.
−1 , if x <0

{
1 , if x> 0
Sol. Given, f : R → R defined by f (x)= 0 , if x=0
−1 , if x <0

Clearly, f (1)=f (2)=f (3)=1, where 1 , 2, 3 ∈ R

f (0)=0 , where 0∈ R

and f (−1)=f (−2)=f (−3)=−1, where −1 ,−2 ,−3∈ R

We can observe that all positive real numbers have same image 1 and all
negative real numbers have same image -1 .

Hence, it is a many-one function.

Onto (Surjective) and Into Function

A function f : A → B is said to be onto (or surjective), if every element of B is
the image of some elements of A under f .

Mathematically, for every b ∈ B , there exists an element a in A such that

f (a)=b.

In other words, f : A → B is onto if and only if

Range of f =B

i.e. Range ¿ Codomain

A function g : X →Y is an into function, if there exists one element in Y ,

which have no pre-image in X . In other words, if a function is not onto,
then it is an into function.
e.g. Let f : A → B and g : X →Y be two functions represented by the following
diagrams.

Here, f is an onto function and g is an into function because y 1 and y 4 are

elements of Y , which do not have pre-image in X .

EXAMPLE 7. Check which of the following function is onto or into.

(i) A={2 , 3 , 4 }, B={4 ,5 , 7 } and f ={(2 , 5),(3 , 4 ), (4 ,7)}

(ii) f : A → B , given by f (x)=3 x , where A={0 , 1 ,2 } and B={0 ,3 ,6 }.

(iii) f : Z → Z , given by f (x)=3 x +2, where Z=¿ set of integers

Sol. (i) We have, f (x)={(2, 5),(3 , 4),(4 , 7)}

Range of (f )={4 , 5 ,7 }=B

Hence, f is onto.

(ii) We have a function f : A → B , given by f (x)=3 x ,

where A={0 , 1 ,2 } and B={0 ,3 ,6 }.

Let y ∈ B be any arbitrary element.

y
Then, y=f (x )⇒ y=3 x ⇒ x= 3

0
Now, at y=0 , x= 3 =0∈ A
 3
At y=3 , x = =1 ∈ A
3

6
At y=6 , x= =2 ∈ A
3

Thus, for each element y of B, there is a pre-image in A .

So, f : A → B is an onto function.

(iii) We have a function f : Z → Z , given by f (x)=3 x +2. Let y ∈ Z , (codomain of

f ) be any arbitrary element.

Then, y=f (x )⇒ y=3 x+ 2

y−2
⇒ x=
3

0−2 −2
Now, when y=0, then x= 3 = 3 ∉ Z

Thus, y=0∈ Z (codomain of f ) does not have pre-image in Z (domain).

Hence, f is not an onto function, i.e. it is an into function.

One-One and Onto Function (Bijective)

A function f : A → B is said to be one-one and onto (or bijective), if f is both
one-one and onto.

In other words, all elements of A have distinct images in B and every

element of B is the image of some elements of A .

e.g. Let f : A → B be a function represented by the following diagram.

Here, f is bijective function because each element have distinct image and
every element of B have pre-image.

EXAMPLE 8.Let R be the set of all non-zero real numbers.

1
Then, show that f : R → R, given by f (x)= x is one-one and onto.

1
Sol. Given, f (x)= x

For one-one Let x 1 , x 2 ∈ R, such that f ( x 1 ) =f ( x 2 )

⇒
1 1
= [
x 1 x 2 put 1 and 2 in
x x f (x)=
1
x ]
⇒ x 1=x 2

So, f is one-one.

For onto Let y ∈ R be any arbitrary element.

Then, y=f (x )
1 1
⇒ y = ⇒ x = [expressing x in terms of y ]
x y

It is clear that for every y ∈ R (codomain), x ∈ R (domain). Thus, for each

1
y ∈ R (codomain), there exist x= ∈ R (domain), such that
y
f (x)=f ( 1y )= 11 = y [i.e. every element of codomain has So, f is onto. pre-
( y)
image in domain]

EXAMPLE 9. Show that the function f : R → R defined as f (x)=x3 is a one-one

onto function.

Sol. We have, f : R → R and f (x)=x3

Let x 1 , x 2 ∈ R
3 3
Then, f ( x 1 ) =f ( x 2 ) ⇒ x 1=x 2

⇒ x 31−x 32=0⇒ ( x 1−x 2) ( x 21 + x 1 x 2 + x 22 )=0

⇒ ( x 1−x 2 ) ( x 21 + x 22+ x 1 x2 ) =0

[( ) ]
2
x2 3 2
⇒ ( x 1−x 2 ) x1 + + x2 = 0
2 4

( )
2
x
⇒ x 1−x 2=0 , but x 1 + 2 + 3 x 22 ≠ 0
2 4

∴ x1= x2

∴ f is one-one function.

Let y ∈ R and consider as y=x 3

Then, x= y 1 /3 ∈ R

Thus, for each y in the codomain R there exist y 1 /3 in R such that

1 /3 3
f ( y ) =( y ) =y
1/ 3

∴ f is onto function.

Hence, f is one-one and onto function.

EXAMPLE 10. Show that the function f : N → N , given by f (x)=2 x is one-one

but not onto.
Sol. Given a function f : N → N , defined by f (x)=2 x

For one-one Let x 1 , x 2 ∈ N , such that f ( x 1 ) =f ( x 2 )

⇒ 2 x 1=2 x2 ⇒ x 1=x 2

So, f is one-one.

For onto Let y ∈ N (codomain) be any arbitrary element.

y
Then, y=f (x )⇒ y=2 x ⇒ x= 2

1
Now, for y=1 , x= 2 ∉ N .

Thus, y=1 ∈ N (codomain) does not have a pre-image in domain (N ). So, f is

not onto.

EXAMPLE 11. Show that the function f : N → N , given by f (1)=f (2)=1 and
f (x)=x−1 for every x >2, is onto but not one-one.
Sol. We have a function f : N → N , defined as
f (1)=f (2)=1 and f ( x)=x−1 , for every x >2

For one-one Since, f (1)=f (2)=1, therefore 1 and 2 have same image,
namely 1 . So, f is not one-one. For onto Note that y=1 has two pre-images,
namely 1 and 2 . Now, let y ∈ N , y ≠ 1 be any arbitrary element. Then,
y=f (x )⇒ y=x−1

⇒ x= y+1> 2 for every y ∈ N , y ≠ 1.

Thus, for every y ∈ N , y ≠ 1, there exists x= y +1 such that

f (x)=f ( y+1)= y+1−1= y

Hence, f is onto.

EXAMPLE 12. Show that the function f : R → R, given by f (x)=cos ⁡x , ∀ x ∈ R is

neither one-one nor onto.

Sol. We have, a function f : R → R defined by

 f ( x ) ¿ cos ⁡x ⇒ f (0)=cos ⁡0=1
f (2 π ) ¿ cos ⁡2 π=1

So, f is not one-one.

Also, range f =[−1 , 1]≠ R

Hence, f is not onto.

EXAMPLE 13. For any real number x , we define the greatest integer as [ x]=¿
greatest integer less than or equal to x . Prove that the greatest integer
function f : R → R such that f (x)=[ x ] is neither one-one nor onto.

Sol. We have, f (x)=[ x ]

Here, f (1.2)=[1.2]=1 , f (1.6)=[1.6 ]=1

∴ f (1.2)=f (1.6)=1

Thus, two different real numbers have the same image.

Hence, f is not one-one.

Here, range of f (x) is Z .

∴ f (x ) is not onto.

EXAMPLE 14. Suppose A=B={x ∈ R :−1≤ x ≤ 1 }. Show that f : A → B given by

f (x)=x∨x∨¿ is a bijection.

Sol. We have, A=B={x ∈ R :−1≤ x ≤ 1 }

Let x and y be any two distinct elements in set A .

Then, x ≠ y ⇒ x∨x∨≠ y∨ y∨⇒ f (x)≠ f ( y)

So, f is one-one function.

We have, f (x)=x∨x∨¿ {x2 ,

−x2 ,
if x ≥ 0
if x< 0

If 0 ≤ x ≤ 1, then f (x)=x2 take all values of x from 0 to 1 .

Also, if −1 ≤ x <0, then f ( x)=−x2 take all values

between -1 and 0 with including -1 .

So, range of f is same as its codomain.

Thus, f : A → B is an onto function.

Hence, f is both one-one and onto, so it is a bijection.

{−4 }
EXAMPLE 15. Let f : R− 3 → R be a function defined as f (x)= 3 x +4 . Show
4x

that f is one-one function. Also, check whether f is an onto function or not.

[CBSE 2023]
4x
Sol. Given, f (x)= 3 x +4

For one-one

{−4 }
Let x 1 x 2 ∈ R− 3 , such that

f ( x1 ) ¿ f ( x2 ) 4 x2
= ¿⇒ ¿ 12 x 1 x 2 +16 x 1 ¿ ¿=12 x 1 x2 +16 x 2 ¿ ⇒ ¿ 16 x 1 ¿ ¿=16 x 2 ¿⇒ ¿ x1 ¿ ¿= x2 ¿
⇒ ¿ 3 x2 + 4

So, f is one-one.

For onto

Let y ∈ R be any arbitrary element.

4x
Then, y=f (x )⇒ y= 3 x + 4 ⇒ 3 xy + 4 y=4 x

4y
⇒ x ( 4−3 y)=4 y ⇒ x=
4−3 y

It is clear that for every y ∈ R (codomain), x ∈ R− 3 . {−4 }

Thus, for each y ∈ R (codomain), there exist
 x=
4y
4−3 y
∈ R−
−4
3 { }
(domain), such that
¿

[i.e. every element of codomain has pre-image in domain]

So, f is onto.

Topic Practice 2
1 Suppose f : R → R be defined by

Find the following values

(i) f (−2)
(ii) f (−5)
(iii) f (5)

2 Find the domain and range of the following functions.

(i) f ={(1 ,3),(2 , 5),(4 ,−7)}

(ii) g={(0 ,−3),(−1 , 4),(3 ,−1),(2 ,−5)}

(iii) h={(u , v ),(v , w),(x , u),( y , z )}

3 Suppose two sets A and B are defined as A={2 , 3 , 4 }, B={6 , 9 ,12 , 15 }. The
rule between two sets is defined as f : A → B such that f (x)=3 x , ∀ x ∈ A . Find
the domain, codomain, and range of f .

4 Is g={(1 , 1),(2, 3) ,(3 ,5),(4 , 7)} a function? If g is described by g(x )=αx+ β.

Then, what value should be assigned to α and β ? [NCERT Exemplar]

5 Find the domain and range of the following functions.

(i) f (x)=¿ x −2∨¿
(ii) g(x )=¿ x +5∨¿
(iii) f (x)=log ⁡(x−2)
(v) h( x)=e x−3
(iv) g(x )=log ⁡(x+ 5)

6 Let f : R → R be defined by f ( x)=x2 +1

Then, find pre-images of 17 and -3 .

7 State whether functions are one-one or not.

(i) A={1 , 2, 3 }, B={4 ,5 , 6 , 7 } and f ={(1 , 4),(2 , 5),(3 , 6)}.

[All India 2011]

(ii) A={a , b , c }, B={ x , y , z } and g={(a , x ),(b , y ),(c , x) }.

8 Find whether the following functions are one-one or many-one.

(i) g(x )=5 x+ 9 ; g : R → R

(ii) h( x)=7 x−9; h: R → R

(iii) f ( x)=x2 −2; f : Z → Z

(iv) g( x )=x 2+ 8 ; g : Z → Z

(v) g(x )=¿ x−2∨; g : R → R

3x
(vi) h( x)= 2 ; h : R→ R

9 Consider a function f :[0 , π /2]→ R, given by

f (x)=sin ⁡x and g :[0 , π /2]→ R , given by

g(x )=cos ⁡x. Show that f and g are one-one, but f +g is not one-one.

[NCERT]

10 Identify, which of the following function is many-one?

(i) A={−5 ,−3 , 3 , 1, 5 }, B={1 ,9 , 25 }, f ( x)=x 2

(ii) A={−2 ,−1 , 1, 2 , 3}, B={1 , 2 ,3 }, g( x)=¿ x∨¿

11 With the help of following graph, find the equation of function. Also,
check whether the function is many-one or not.

12 Which of the following functions from A to B are into and onto?

(i) A={1 , 2, 3 }, B={3 ,5 , 7 } and g={(3 ,7),(2 , 5) ,(1 , 3)}

(ii) A={a , b , c , d }, B={x , y , z } and

g2={(c , z),(d , z),(a , x ),(b , x)}

(iii) A={3 , 4 ,5 }, B={x , y , z } and

g3={(3 , x) ,(4 , y ),( 5 , z )}

(iv) f : Z → Z and f (x)=3−4 x

13 Let f : N → N be defined by

{
n+1
, if n is odd
2
f (n)=
n
, if n is even
2
Show that f is many-one and onto function.

[NCERT]
14 Identify the following functions as injection, surjection or bijection.

(i) f : N → N such as f ( x)=4 x 3

(ii) f : R → R such as f (x)=¿ x ∨¿

(iii) f : Z → Z such as f (x)=x−7

(iv) f : R → R such as f ( x)=x3 −1

(v) f : R → R such as f ( x)=1+ x2

(vi) f : R → R such as f (x)=sin ⁡x

15 Show that the greatest integer function f : R → R such that f (x)=[ x−3] is
neither one-one nor onto.

16 If A=B={x ∈ R :−3 ≤ x ≤3 }, show that f : A → B given by f (x)=¿ x ∨x is a

bijection.

17 Show that f : N → N , given by

f (x)= {x−1
x+1 , if x is odd
, if x is even
is bijective (both one-one and onto).

[All India 2012]

18 Let A and B be sets. Show that f : A × B → B × A , such that f (a , b)=(b , a) is

bijective function.

[NCERT]

19 Show that the function f : R → R, defined by

x
f (x)= 2
, ∀ x ∈ R is neither one-one nor onto.
x +1
[Delhi 2020; NCERT Exemplar]

20 Given a function defined by f (x)=√ 4−x 2;

0 ≤ x ≤ 2 ,0 ≤ f (x)≤2 . Show that f is bijective function.

21 Show that the function f : R → {x ∈ R :−1< x<1 } defined by

x
f (x)= is one-one and onto function.
1+¿ x∨¿ , x ∈ R ¿

[NCERT]

Hints & Solutions

1. (i) When x=−2, which lies in the interval −2 ≤ x ≤3 .
∴ f (x )=3 x 2−5, when x=−2

⇒ f (−2)=3 ¿

(ii) When x=−5, which lies in the interval x ←2.

∴ f (−5)=3(−5)+2

¿−15+2=−13

(iii) When x=5, which lies in the interval x >3.

∴ f (5)=4 (5)+7

¿ 20+7=27

2. Similar as Example 1.
Ans. (i) Domain ¿ {1 , 2 , 4 }, Range ¿ {3 , 5 ,−7 }

(ii) Domain ¿ {0 ,−1 ,2 , 3 }, Range ¿ {−5 ,−3 ,−1 , 4 }

(iii) Domain ¿ {u , v , x , y }, Range ¿ {u , v , w , z }

3. Similar as Example 1 .

Ans. Domain (f )={2 , 3 , 4 },

Codomain (f )={6 , 9 , 12 ,15 }

and Range (f )={6 , 9 , 12 }

4. Hint According to the given information, we can have 1=α + β and

3=2 α + β .
Ans. Yes; α =2 and β=−1

5. Similar as Example 2.
Ans. (i) Domain ¿ R, Range ¿ ¿

(ii) Domain ¿ R, Range ¿ ¿

(iii) Domain ¿(2, ∞ ), Range ¿(−∞ , ∞)

(iv) Domain ¿(−5 , ∞), Range ¿(−∞ , ∞)

(v) Domain ¿(−∞ , ∞), Range ¿(0 , ∞)

6. To find the pre-images, consider x 2+ 1=17

and x 2+ 1=−3

⇒ x =16 and x =−4, which is not possible.

2 2

⇒ x=± 4

Hence, pre-images of 17 are \pm 4 and pre-image(s) of -3 does not exist.

7. (i) Given, f ={(1 , 4),(2 , 5),(3 , 6)}. Here, we see that, each element of A
have distinct image. So, it is one-one.
(ii) Given, g={(a , x ),(b , y ),(c , x)}.

Here, we see that elements a and c have same image x , so it is not one-one.

8. Similar as Example 4.
Ans. (i) One-on
(ii) One-one
(iii) Many-one
(iv) Many-one (v) Many-one

(vi) One-one

[ ] π
9. Let x 1 , x 2 ∈ 0 , 2 , such that x 1 ≠ x 2.

Then, sin ⁡x 1 ≠ sin ⁡x 2 and cos ⁡x1 ≠ cos ⁡x 2

 [ ∵ for any two distinct values x in 0 , [ ]
π
2
,

sine function cannot give same value. This is also true for cosine function]

Hence, f and g must be one-one.

But (f + g)(0)=sin ⁡0+ cos ⁡0=1

[ ∵ a1 ≠ a2 ⇒ f ( a 1 ) ≠ f ( a2 ) ]

()
π π π
and (f + g) 2 =sin ⁡ 2 +cos ⁡ 2 =1

∴ f + g is not one-one

10.(i) Similar as Example 5. Ans. Many-one

(ii) g(−2)=¿−2∨¿ 2 and g(2)=¿ 2∨¿ 2

Hence, g(x ) is many-one.

11.It is clear from the graph that it is a parabolic curve. So, let the
equation of the function is
2
y=a x +bx +c

Points on the curve are A(1 , 2), B(2 , 3) and C (−1 ,6) .

On putting the points A(1 , 2), B(2 , 3) and C (−1 ,6) in the

Eq. (i) one-by-one, we get

At A(1 , 2), 2=a ¿

At B(2 , 3), 3=a ¿

and at C (−1 ,6), 6=a ¿

⇒ 6=a−b+ c

On solving Eqs. (ii), (iii) and (iv), we get

a=1 , b=−2 and c=3
On putting the values of a , b and c in Eq. (i), we get
2
y=x −2 x +3

∴ Required equation of function is

2
f (x)= y=x −2 x+3

Now, y=¿
⇒¿

⇒ (x−1)=± √ y −2

⇒ x=1 ± √ y−2

Let y=3 , then x=1 ± √3−2

⇒ x=1 ± 1⇒ x =2 ,0

Here, we see that for two different values of domain

(i.e. x=0 , 2 ). We get same image (i.e. y=3 ).

Hence, f (x) is many-one function.

12.Similar as Example 7
Ans. (i) Onto (ii) Into (iii) Onto (iv) Into

13.Given, f : N → N , defined by

{
n+1
, if n is odd
2
f (n)=
n
, if n is even
2

1+1 2
Here, f (1)= 2 =1 and f (2)= 2 =1

So, f is not one-one, i.e. f is many-one.

Now, consider a natural number m in codomain N .

n+1
Case I Let m=f (n)= 2 ⇒ 2 m=n+1
⇒ n=2 m−1, which is odd for each m ∈ N .

Thus, for each m ∈ N (codomain), there exists

2 m−1+1
n=2 m−1∈ N , such that f (2 m−1)= =m
2

Case II Let m=f (n)=n/2

⇒ n=2 m, which is even for each m ∈ N .

Thus, for each m ∈ N (codomain), there exists

2m
n=2 m∈ N , such that f (2 m)= =m.
2

Since, from both cases, we have pre-images. So, we can choose either of
the case to get the pre-image.

Therefore, f is onto.

Hence, f is many-one and onto function.

14.Similar as Example 9.
Ans. (i) Injection (ii) None of them (iii) Bijection

(iv) Bijection (v) None of them (vi) None of them

15.Similar as Example 13.

16.Similar as Example 14.

17.Similar as Question 13.

18.We have a mapping f : A × B → B × A , defined as

f (a , b)=(b , a)

For one-one Let ( a 1 , b 1) and ( a 2 , b 2) ∈ A × B,

such that f ( a1 ,b 1 )=f ( a2 , b2 )

 ⇒ ( b1 , a1 )=( b2 , a2 )
⇒ b 1=b2 and a1=a 2
⇒ ( a1 , b1 )=( a2 , b2 )

So, f is one-one.

For onto Let ( b ' , a' ) ∈ B × A be any arbitrary element, then there exists
( a ' , b' ) ∈ A × B , such that

f ( a' ,b ' ) =( b ' , a' )

Since, ( b ' , a' ) was arbitrary, so f is onto.

Hence, f is bijective function.

ẋ
19.Given, f : R → R, defined by f (x)= 2
, ∀ x ∈ R Let x 1 , x 2 ∈ R such that
x +1
f ( x 1 ) =f ( x 2 )
x1 x2
⇒ ¿ 2 2
x +1 ¿ x 1 x 2−x 2 x 1+ x 1−x 2=0 ¿⇒ ¿ ¿ x1 x 2 ( x 2−x 1 )−1 ( x 2−x 1 )=0 ¿ ⇒¿ ¿ ( x 2−x 1 ) ( x 1 x 2−1 ) =0 ¿ ⇒¿
2 2
x +1
1 2
⇒ ¿ ¿

∴ f is not one-one, as if we take

1
x 1=3 and x2 = , then
3
3
f (3)= =f
10
1
3 ()
but 3 ≠
1
3

Now, let k ∈ R be any arbitrary element and let f (x)=k

x
⇒ =k
2
x +1
2 2
⇒ k x +k =x ⇒ k x −x +k =0

[
⇒ ∵ f (x )= 2
x
x +1 ]
or (1−2 k)(1+ 2k )<0 , i.e. k >1/2 or k ←1/2
So, f is not onto.
Hence, f is neither one-one nor onto.

20.We have, y=f (x )=√ 4−x 2 ,0 ≤ x ≤ 2 , 0≤ y ≤ 2

For one-one Let x 1 , x 2 be any two elements of the interval 0 ≤ x ≤ 2, such that
f ( x 1 ) =f ( x 2 )

⇒ √ 4−x 2
1 ¿=√ 4−x 22 ⇒ 4−x 21=4−x 22
⇒ x 21 ¿=x 22 ⇒ x 1=± x 2 ⇒ x 1=x 2

[ x 1 ≠−x 2, since x 1 and x 2 are non-negative]

So, f (x) is one-one.

For onto Let k ∈[0 , 2] be any arbitrary element

and let f (x)=k ⇒ √ 4−x 2=k

On squaring both sides, we get 4−x 2=k 2

⇒ x 2=4−k 2 ⇒ x=± √ 4−k 2 ⇒ x=√ 4−k 2

¿ is non-negative, so we take positive]

Also, for 0 ≤ k ≤2, we have

0 ≤ √ 4−k 2 ≤2 ⇒ 0 ≤ x ≤ 2, which is true.

Thus, for each k ∈[0 , 2], there exists x=√ 4−k 2 ∈[0 , 2] such that f (x)=k . So,
f (x) is onto.

Hence, f is bijective function.

21. We have a function f : R → {x ∈ R :−1< x<1 }, defined as
x
f (x)=

{
x
, if x ≥ 0
1+¿ x∨¿= 1+ x ¿
x
, if x< 0
1−x

For one-one Let x 1 , x 2 ∈ R. Then, the following cases arise

Case I When both are less than 0

Let x 1 , x 2 ∈ R such that x 1< 0 , x 2 <0 and f ( x 1 ) =f ( x 2 )
 x1 x2
⇒ = ⇒ x 1−x1 x 2=x 2−x 1 x 2
1−x 1 1−x2

⇒ x 1=x 2

Case II When both are greater than or equal to 0

Let x 1 , x 2 ∈ R such that x 1 ≥ 0 , x 2 ≥ 0 and f ( x 1 ) =f ( x 2 )
x1 x2
⇒ = ⇒ x 1+ x 1 x 2=x 2 + x 1 x 2
1+ x1 1+ x 2
⇒ x1 =x2

Case III When one is non-negative and other is negative Let x 1 ≥ 0 and x 2< 0.
x1 x2
Now, if f ( x 1 ) =f ( x 2 ), then 1+ x = 1−x
1 2

⇒ x 1−x 1 x 2=x 2 + x 1 x 2

⇒ x 1−x 2=2 x 1 x 2, which is not possible as LHS ¿ 0

and RHS ≤ 0. Thus, x 1 ≠ x 2 ⇒ f ( x 1 ) ≠ f ( x 2 )

From cases I, II and III, we get f is one-one.

For onto Let y ∈(−1 ,1) be any arbitrary element. Then, the following cases
arise

Case I When y ≥ 0, i.e. 0 ≤ y <1

x
[ x
Consider, y=f (x )= 1+ x ∵ f (x )= 1+ x ≥ 0 ]
⇒ y + yx =x ⇒ y =x− yx

y
⇒ x= ≥0 , for 0 ≤ y <1
1− y

y
Thus, for each y ∈¿, there exists x= 1− y ∈ R such that f (x)= y .

Case II When y <0, i.e. −1< y <0

 x
Consider, y=f (x )= 1−x

[∵ f (x )=
x
1−x
<0
]
⇒ y − yx=x ⇒ y= yx + x=x ( y +1)

y
⇒ x= < 0, for −1< y <0
y +1

y
Thus, for each y ∈(−1 ,0), there exist x= y +1 ∈ R such that f (x)= y .

From cases I and II, we get f is onto.

Exam Pattern Exercise

Part A - Objective Type Questions

Multiple Choice Type Questions

1 Let R be the relation in the set N given by R={(a , b): a=b−2 , b>6 }. Then,
the correct option is

[NCERT]
(a) (2 , 4)∈ R
(b) (3 , 8)∈ R
(c) (6 , 8)∈ R
(d) (8 , 7)∈ R

2 Let R be a relation from R to R the set of real numbers defined by

R={(x , y): x , y ∈ R and x− y + √ 3

is an irrational number }. Then, R is

(a) reflexive

(b) transitive

(c) symmetric
(d) an equivalence relation

3 The maximum number of equivalence relations on the set A={1 , 2, 3 } are

[NCERT Exemplar]
(a) 1
(b) 2
(c) 3
(d) 5

4 Let f : R → R be defined as f ( x)=x 4. Then, the correct option is

[NCERT]

(a) f is one-one onto

(b) f is many-one onto

(c) f is one-one but not onto

(d) f is neither one-one nor onto

5 Set A has 3 elements and the set B has 4 elements. Then the number of
injective mappings that can be defined from A to B is

[NCERT Exemplar]
(a) 144
(b) 12
(c) 24
(d) 64

6 Let A={3 , 5 }. Then, number of reflexive relations on A is

[CBSE 2023]
(a) 2
(b) 4
(c) 0
(d) 8

Fill in the Blanks

7 If atleast one of the relation R (i.e. reflexive, symmetric and transitive)
does not satisfy, then R is not

8 The range of [ x−3] is ........, where [ x] is greatest integer, which is less

than equal to x .

9 A function f : A → B is a bijection, if it is and

True and False

10 Every identity relation is an equivalence relation.

11 Relation R={(x , y): y−x is an integer }, where x , y ∈ Z , is not symmetric.

[
−π π
12 Function f (x)=sin ⁡x is many-one in the interval 2 , 2 ]
13 A function f : R → R be defined by f ( x)=x3 + 4 is a bijection.

Assertion-Reason Based Questions

Directions (Q. Nos. 14-15) In the questions given below are two statements
labelled as Assertion (A) and Reason (R). In the context of the two
statements, which one of the following is correct?

(a) Both A and R are correct; R is the correct explanation of A

(b) Both A and R are correct; R is not the correct explanation of A

(c) A is correct; R is incorrect

(d) R is correct; A is incorrect

14 Assertion (A) The relation R in the set A={1 , 2, 3 , 4 ,5 , 6 } defined as R={¿

is divisible by x ) is not an equivalence relation.

Reason (R) The relation R will be an equivalence relation, if it is reflexive,

symmetric and transitive.

15 Assertion (A) The function f : R → R given by f ( x)=x3 is injective

Reason (R) The function f : X → Y is injective, if f (x)=f ( y)⇒ x= y for all
x , y ∈ X.

Part-B Descriptive Questions

Very Short Answer Type Questions

16 If the relation R is defined on the set A={1 , 2, 3 , 4 ,5 } by
R={(a , b):|a −b |<8 } . Then, find the relation R .
2 2

[NCERT Exemplar]

17 Let A={1 , 2, 3 }, B={4 ,5 , 6 , 7 } and let f ={(1 , 4),(2 , 5),(3 , 6)} be a function
from A to B. State whether f is one-one or not. [All India 2011]

18 A function f : A → B defined as f (x)=2 x is both one-one and onto. If

A={1 , 2, 3 , 4 } , then find the set B.

[CBSE 2023]

Short Answer Type Questions

19 Let P={3 , 4 , 5 } and R={(3 , 4),(4 ,5),(3 , 5)} be a relation on A . Then, show
that R is reflexive.

20 If A={1 , 2, 3 , 4 } , define relations on A which have properties of being

(i) reflexive, transitive but not symmetric.

(ii) symmetric but neither reflexive nor transitive.

[NCERT Exemplar]

21 Show that relation R in the set of real numbers, defined as

R={(a , b): a≤ b 2 } is neither reflexive nor symmetric nor transitive.

[NCERT]

22 If f : R → R is the function, defined by f (x)=4 x 3 +7, then show that f is a

bijection.
[Delhi 2011C]

23 A function f :[−4 , 4]→[0 , 4 ] is given by f (x)=√16−x 2. Show that f is an

onto function but not a one-one function. Further, find all possible values of
a for which f (a)= √ 7 .

[CBSE 2023]

24 Prove that function f :¿ →[−5 , ∞ ] defined as f ( x)=4 x 2 +4 x −5 is both one-

one and onto.

[CBSE 2023]

Long Answer Type Questions

25 Show that the relation R , defined in the set of A all triangles as
R={( T 1 , T 2 ) :T 1 is similar to T 2 } , is equivalence relation. Consider three right
angle triangles T 1 with sides 3 , 4 ,5 ; T 2 with sides 5 , 12, 13 and T 3 with sides
6 , 8 , 10, which triangle among T 1 , T 2 and T 3 are related?

[NCERT]
−1 1
[ ]
26 Check whether a function f : R → 2 , 2 defined as f (x)=
1+ x
x
2 is one-one

and onto or not.

[CBSE 2023]
27 Show that the function f : N → N , given by f (n)=n−¿ is a bijection.

28 Let A=[−1 ,1], then discuss whether the following functions defined on A
are one-one and onto or bijective.

(i) f (x)=x /2

(ii) g(x )=¿ x∨¿

(iii) k ( x)=x 2

[NCERT Exemplar]

Case Study Bused Questions

29 In a school, madam Sunita take lecture in Class XII. In this class, students
divided into two groups A and B. Group A has 20 students and group B has
25 students.

The relation between students of these groups are defined as R : group

A → group ⁡B or R : A → B R=¿ and y ∈ B ¿.

(i) Find the number of elements in codomain of R : A → B .

(ii) Find the set of all identity elements.

(iii) Find the total number of relations that can be formed from set A to B.

Or

Suppose the relation defined from set A to set B is R1= {( a1 , b1 ) , ( a2 , b3 ) , ( a 3 , b 4 ) },

then find the inverse relation.

Hints & Solutions

1. (c)
2. (a)
3. (d)
4. (d)
5. (c)
 6. (b)
7. equivalence
8. integer
9. one-one, onto
10.True
11.False;
Hint y−x is an integer ⇒ x− y is an integer.
It is symmetric.
12.True 13. True
13.(a) For reflexive, we know that x is divisible by x , which is true for all
x∈ A.
∴ (x , x )∈ R for all x ∈ A . So, R is reflexive.
For symmetry, we observe that 6 is divisible by 2 . This means that
(2 , 6)∈ R but (6 , 2)∉ R. So, R is not symmetric.
For transitivity, let (x , y )∈ R and ( y , z)∈ R
⇒ y is divisible by x and z is divisible by y .
⇒ z is divisible by x .
⇒ (x , z )∈ R For example, 2 is divisible by 1 and 4 is divisible by 2 . So, 4
is divisible by 1 . So, R is transitive.
14.(a) Here, f : R → R is given as f ( x)=x3 .
Suppose f (x)=f ( y)
where x , y ∈ R ⇒ x 3= y 3
Now, we try to show that x= y .
Suppose x ≠ y , their cubes will also be not equal.
3 3
x ≠y

However, this will be a contradiction to Eq. (i).

Therefore, x= y . Hence, f is injective.
16. R={(1, 1),(1, 2), (2 ,1) ,(2 ,2),(2 ,3),(3 , 2), (3 ,3),(3 , 4) ,
17. One-one
(4 , 3)(4 , 4),(5 ,5)}

18. B={2 , 4 , 6 , 8 }
19.(i) {(1 ,1),(1 , 2),(2 , 3),(2 , 2), (1, 3),(3 , 3),(4 , 4 )}
(ii) {(2 , 2),(1 , 2),(2 , 1)}
20.a=± 3
21.T 1 and T 3
22. f (x) is onto but not one-one.
23.(i) f is one-one but not onto
(ii) g is neither one-one nor onto
(iii) k is neither one-one nor onto
24.(i) 25
(ii) equivalence
(iii) 2 ∨⁡{ ( b1 , a1 ) , ( b3 , a2 ) , ( b 4 ,a 3 ) }
500