RELATIONS AND FUNCTIONS

LEGENDS

Class Work Homework Challenge Yourself Strongly recommended to practice Evaluation

1.
Assertion Reasoning q 1-5

Short answer q 1

Long answer q 2,3

2. Case study 3

3. MCQ 1-23

4. Case study 1,2

1
 SYNOPSIS

The main features of the chapter are as follows:

• Empty relation is the relation in X given by R =   X  X .
• Universal relation is the relation R in X given by R = X  X .
• Reflexive relation R in X is a relation with (a, a)  Ra  X .
• Symmetric relation R in X is a relation satisfying (a, b)  R  (b, a )  R.
• Transitive relation R in X is a relation satisfying (a, b )  Rand (b, c )  R  (a, c )  R.
• Equivalence relation R in X is a relation which is reflexive symmetric and transitive.
• Equivalence class [a] containing a  X , for an equivalence relation R in x is the subset of X containing all
elements b related to a.
• A function f : X → Y is one-one or injective if f (x1 ) = f (x 2 )  x1 = x 2 , x1 , x 2  X .
• A function f : X → Y is onto or surjective if given any y  Y , x  X such that f (x) = y.
• A function f : X → Y is one-one and onto or bijective, if f is both injective and surjective.

• A function f : X →Y is invertible if and only if f is one-one and onto.

• If A and B are finite sets containing m and n elements, then

• Total number of relations from the set A to set B is 2mn
• Total number of functions from the set A to set B is nm .
• Number of one-one functions from A to A are m !
• Number of onto functions from A to A are m !

• Total number of one-one functions from the set A to set B is nPm if n  m , otherwise 0

• Total number of bijective functions from the set A to A is m! ,

2
 OBJECTIVE TYPE QUESTIONS:-
1. Let R be a relation on the set N of natural numbers defined by n R m if n divides m. Then
R is
(a) Reflexive and symmetric (b) Transitive and symmetric
(c) Equivalence (d) Reflexive, transitive but not symmetric
2. Let L denote the set of all straight lines in a plane. Let a relation R be defined by l R m if
and only if l is perpendicular to m ∀ l, m ∈ L. Then R is

(a) Reflexive (b) Symmetric (c) Transitive (d) None of these

3. Let N be the set of natural numbers and the function f : N → N be defined by f(n) = 2n + 3
∀ n ∈ N. Then f is

(a) Surjective (b) Injective (c) Bijective (d) None of these

4. 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
(a) 144 (b) 12 (c) 24 (d) 64

5. Let f : R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are

(a) ϕ, {4, – 4} (b) {3, – 3}, ϕ (c) {4, –4}, ϕ (d) {4, – 4}, {2, – 2}

6. For real numbers x and y, define xRy if and only if x – y + √2 is an irrational number. Then
the relation R is
(a) Reflexive (b) Symmetric (c) Transitive (d) None of these
7. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined
as aRb if a is congruent to b, a, b ∈ T. Then R is

(a) Reflexive but not transitive (b) Transitive but not symmetric
(c) Equivalence (d) None of these
8. Consider the non-empty set consisting of children in a family and a relation R defined as
aRb if a is brother of b. Then R is
(a) Symmetric but not transitive (b) Transitive but not symmetric
(c) Neither symmetric nor transitive (d) Both symmetric and transitive

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

(a) 1 (b) 2 (c) 3 (d) 5

3
10. If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is
(a) Reflexive (b) Transitive (c) Symmetric (d) None of these

11 Let us define a relation R in R as aRb if a ≥ b. Then R is

(a) An equivalence relation (b) Reflexive, transitive but not symmetric
(c) Symmetric, transitive but not reflexive (d) neither transitive nor reflexive but
symmetric
12 Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
Then R is
(a) Reflexive but not symmetric (b) Reflexive but not transitive
(c) Symmetric and transitive (d) neither symmetric, nor transitive

13 If the set A contains 5 elements and the set B contains 6 elements, then the number of one-
one and onto mappings from A to B is
(a) 720 (b) 120 (c) 0 (d) none of these

14 Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is
(a) nP2 (b) 2n – 2 (c) 2n – 1 (d) None of these

15 1
Let f : R → R be defined by f(x) = 𝑋 , x ∈ R. Then f is

(a) one-one (b) onto (c) bijective (d) f is not defined

16 Which of the following functions from Z into Z are bijections?
(a)f(x) = x3 (b) f(x) = x + 2 (c) f(x) = 2x + 1 (d) f(x) = x2+1

17 Let f : [2, ∞) → R be the function defined by f(x) = x2 – 4x + 5, then the range of f is

(a) R (b) [1, ∞) (c) [4, ∞) (d) [5, ∞)
18 The function given by

(a) one-one only b) onto only c) bijective d) Many one

19 If R is the relation defined in the set { 1,2,3,4,5,6} as R = { (a,b): b= a+1} then R is
a) reflexive b) symmetric c) transitive d) none of these
20 A relation R in set A = {1 2, ,3} is defined as R = { (1,1),(1,2) (2,2) (3,3)} .Which of the
following ordered pair in R shall be removed to make it an equivalence relation in A?

4
 a)(1,1) b),(1,2) c) (2,2) d) (3,3)
−1 −1
21 The value of the expression {cot (cos(tan 1))} is
1 2
a) 0 b) 1 c) d) √3
√3

22 Which of the following statements is not true about equivalence classes Ai ( i=1,2,…n)
formed by an equivalence relation R defined on a set A
a) ⋃𝑛𝑖=1 𝐴𝑖 b)𝐴𝑖 ∩ 𝐴𝑗 ≠ ∅, 𝑖 ≠ 𝑗
b) c) x𝜖𝐴𝑗 𝑎𝑛𝑑 𝑥 ∈ 𝐴𝑗 => 𝐴𝑖 = 𝐴𝑗 d) All elements of 𝐴𝑖 related to each other,
for all i
23 Let R is the equivalence relation in the set A = {0,1,2,3,4,5 }given by
R= {(a,b) : 2 divides a-b}. Then the equivalence class [0]
a) { 1,2,3} b) { 0,2,3} c) { 1,2,4} d) { 0,2,4}
ASSERTION AND REASONING
1 Assertion (A) : The function f : R→ R : given by f(x) = 𝑥 3 is injective
Reason ( R ) : The function f: X→ Y is injective if f(x) = f(y) => x=y for all
x, 𝑦 ∈ 𝑋
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
(A) is false but (R) is true
2 Assertion(A): The relation R in a set A = {1,2,3,4} defined by
R = { (x,y) : 3x-y = 0 } have the domain = {1,2,3,4} and range = {3,6,9,12 }
Reason(R) : Domain and range of the relation R is respectively the set of all
first & second entries of the distinct ordered pair of the relation
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

3 Assertion (A) : The relation R = { (x,y) : ( x+ y) is a prime number and x,y ∈ 𝑁} is not a
reflexive relation
Reason (R): The number ‘2n ‘ is composite for all natural numbers n

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

4 Assertion (A) : Let L be a set of lines in a plane. R is a relation on L defined as

R={(L1,L2): L1 is parallel to L2 . Then R is an equivalence relation.
Reason (R) : R is not transitive relation.
a) Both (A) and (R) are true and (R) is the correct explanation of (A)

5
 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

5 Assertion (A):Let f: R →R such that f(x) = x 2.The function is an onto function.

Reason (R):A function g : A→ B is said to be onto function g(A)=B ,
ie;range of g = B
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

SHORT ANSWER QUESTIONS (SA)- ( 2 marks /3 marks )

1 Determine whether the relation R defined on the set R of all real numbers as
R = { (a,b) : a,b ∈ 𝑅 and a-b + √3 𝜖𝑆 where S is the set of all irrational numbers } is
reflexive , symmetric and transitive
2 Let I be the set of all integers , m be a positive integer and R be the relation on I defined
by R { (x,y) :x,y ∈ 𝐼, 𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑚}, prove that R is an equivalence relation

3 Show that the relation R in the set N X N defined by ( a,b) R (c,d) iff a2 + d2 = b2 + c2 for
every a,b,c,d ∈ 𝑁 is an equivalence relation
LONG ANSWER QUESTIONS ( 5 MARKS)

1 Let A = { 1,2,3,…9}and R be the relation defined on A X A by (a,b) R ( c,d) iff

a +d= b + c. Prove that R is an equivalence relation .Also find the equivalence
class [ (2,5)]

2 Prove that the function f:[0, ∞) → R given by f(x) = 9x2 + 6x – 5 is one -one but not
onto. Modify the codomain of the function f to make it onto.
3 Let N denote the set of all natural numbers and R be the relation on N x N defined
by(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Show that R is an equivalence relation on
N x N.
4 2𝑥
Show that the function f : R →R defined by f( x) = 1+𝑥 2 is neither one -one nor onto Further
find the set A so that the given function f: R → A becomes an onto function .
5 A relation R is defined on N X N ( where N is the set of natural numbers ) as ( a,b) R ( c,d)
iff and only iff a-c= b-d .Show that R is an equivalence relation .
6 Prove that the function f: R → Rdefined by f( x) = x2+x+1 is neither one -one nor onto .Also
find all values of x for which f(x) =3

6
 CASE STUDY QUESTIONS ( 4 = 1+1+2 MARKS)

1 A group of Grade 11 students, inspired by modern smart city planning in the UAE,
designed designated parking spots for cars along straight lines, parallel to each other, on
one side of the school playground. They ensured enough space was left for activities, like
the efficient use of space seen in cities like Masdar City, which prioritizes sustainability
and smart infrastructure. They marked the first row of parking spots along the line y=x−4
on a coordinate grid, where the grid represents the layout of the parking lot. Let L be the
set of all lines that represent parking rows parallel to the line y=x−4. A relation R is
defined on the set L
Based on the above information, answer the following question
i) Let relation R be defined by R={(L1,L2):L1is parallel to L2,where L1,L2𝜖 L}What
is the type of relation R?
ii) Let relation R be defined by R={(L1,L2):L1is perpendicular to L2,where L1,L2𝜖
L}What is the type of relation R?
iii) Check whether the function f: R →R defined by f(x)= x-4 is injective or not.
OR

iii)Check whether the function f: R →R defined by f(x)= x-4 is surjective or not.

2 Sona and Tanish are playing Ludo at home during Summer Holidays. While rolling the dice
Sona’s sister Kavita observed and noted the possible outcomes of the throw every time
belongs to the set {1,2,3,4,5,6}. Let A be the set of players while B is the set of all the
possible outcomes.
A ={ S, T} B= {1,2,3,4,5,6}

Based on the above information, answer the following question:

i) Kavitha wants to know total number of functions from set A to set B. So, help her
to find total number of functions from set A to set B.
ii) Find total number of one- one functions from set A to set B
iii) Define a function f: A→B that represents the outcome of a dice roll for
each player. If Sona (S) rolls a 4 and Tanish (T) rolls a 5, represent
the function as a set of ordered pairs. Is this function one-to-one?
Justify your answer.
(OR)
(iii) If Kavita defines a constant function k: A→B where each player always
rolls a 3, write the function in set notation. Is this function onto?

3 An organization conducted bike race under 2 different categories -boys and girls. Totally
there were 250 participants .Among all of them three from category 1 and two from category
2 were selected for final race .Ravi forms two sets B and G with these participants from his
college project .Let B= {b1,b2,b3}, G={g1,g2} where B represents the set of boys selected
and G the set of girls who were selected for the final race

7
 Revi decided to explore these sets for various types of relations and functions.
1) Ravi wishes to form all relations possible from B to G .How many such relations are
possible
2) Ravi wants to know among those relations , how many functions can be formed from
B to G
3) Let f: B → 𝐺 be defined by f = { (b1,g1),(b2,g2),(b3,g3)}, then what type of function
is f( check for one-one onto)
OR

3)Find the number of injective functions from B to G

ANSWERS

OBJECTIVE TYPE QUESTIONS (1MARK)

1. d
2. b
3. b
4. c
5. c
6. a
7. c
8. b
9. d
10. b
11 b
12 a
13 c
14 b
15 d
16 b
17 b
18 c
19 d
20 b
21 d
22 b
23 d
ASSERTION AND REASONING QUESTIONS
1 a
2 a
3 c
4 c
5 c

8
 SHORT ANSWER QUESTIONS ( 2 /3 marks )
1 R is reflexive , R is not symmetric ,R is not transitive
3 A= [1,1]
LONG ANSWER QUESTIONS ( 5 MARKS)
1 Equivalence class [(2,5)]= { (1,4), (2,5),( 3,6), (4,7),(5,8), (6,9)}

2 f:[0, ∞) → [ -5, ∞)
6 X= -2,1
CASE STUDY QUESTIONS ( 4 MARKS)
1 (i) The relation R is reflexive, symmetric, and transitive, it is an equivalence
relation
(ii) The relation is only symmetric; it is a symmetric relation but not an
equivalence relation
(iii) Injectivity: To check if f is injective, assume f(x1)=f(x2)

Then:x1−4 = x 2− 4

x1 = x2, This shows that f is injective.

OR

(iii) Surjectivity: For any y∈R , we need to find an x∈R such that f(x) =y

X = y+4

Then: f(x)=(y+4)−4 = y

So, for every y ∈R, there exists an x= y + 4 such that f(x)= y. This shows

that f is surjective.
2 i) 62 =36
ii) Total number of one-one set 6 x 5 = 30
iii) K = { (S, 3) , (D,3)} It is not onto function because set B
{1,2,3,4,5,6}
OR
Let f: A→B be the function representing the outcome
of the dice roll for each player. Given that Sona (S)
rolls a 4 and Tanish (T) rolls a 5, we can represent f
as: f={(S,4),(T,5)}

3 (i) 2 6 = 64
(ii) 23=8
(iii) F is onto , since every element of G is the image of some
element of B under R

9
OR
0

10