CHAPTER-1 - RELATIONS AND FUNCTIONS

Gist / Summary of the lesson:

❖ Types Of Relations:
Empty relation, Universal relation, Reflexive, Symmetric, Transitive and Equivalence
relations.
❖ Types Of Functions: One – one (or injective) functions, onto (or surjective) functions, One-
one and onto (or bijective)
Definitions:
➢ 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., R = ø ⊂ A × A
➢ 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., R = A × A
➢ A relation R in a set A is called
(i) reflexive, if (a, a) ∈ R, for every a ∈ A,
(ii) symmetric, if (𝑎1 , 𝑎2 ) ∈ R ⇒ (𝑎2, 𝑎1 )∈ R, for all 𝑎1 ,𝑎2 ∈ A.
(iii) transitive, if (𝑎1 , 𝑎2 ) ∈ R and (𝑎2 , 𝑎3 ) ∈ R ⇒ (𝑎1 , 𝑎3 ) ∊ R, for all 𝑎1 , 𝑎2 , 𝑎3 ∈ A.
➢ A relation R in a set A is said to be an equivalence relation iff R is reflexive, symmetric and
transitive
➢ A function f : X → Y is defined to be one-one (or injective), if the images of distinct
elements of X under f are distinct, i.e., for every 𝑥1 , 𝑥2 ∈ X, 𝑥1 ≠ 𝑥2 . implies 𝑓(𝑥1 ) ≠
𝑓(𝑥2 ) . Otherwise, f is called many-one.
➢ A function f : X → Y is said to be onto (or surjective), if every element of Y is the image of
some element of X under f, i.e., for every y ∈ Y, there exists an element x in X such that
f(x) = y. In other words f:X→ 𝑌 is onto if and only if Range of f = Y.
➢ A function f : X → Y is said to be one-one and onto (or bijective), if f is both one-one and
onto.
Formulae:
• If 𝑛(𝐴) = 𝑝 𝑎𝑛𝑑 𝑛(𝐵) = 𝑞, then 𝑛(𝐴 × 𝐵) = 𝑝𝑞 and number of relations from set A to set
B=2𝑝𝑞 .
• If A is a non-empty finite set containing 𝑛 elements, then number of reflexive relations on
set A=2𝑛(𝑛−1) .
• If A is a non-empty finite set containing 𝑛 elements, then number of symmetric relations on
𝑛(𝑛+1)
set A =2 2
• If A and B are non-empty finite sets containing m and 𝑛 elements respectively, then
(i) Number of functions from A to B = 𝑛𝑚
𝑛𝑃 𝑖𝑓 𝑚 ≤ 𝑛
(ii) Number of one-one functions from A to B ={ 𝑚,
0, 𝑖𝑓 𝑚 > 𝑛
(iii)Number of onto functions from A to B
𝑛𝐶0, 𝑛𝑚 − 𝑛𝐶1, (𝑛 − 1)𝑚 + 𝑛𝐶2, (𝑛 − 2)𝑚 −. . . . . . . . . , 𝑖𝑓 𝑛 ≤ 𝑚
={
0, 𝑖𝑓 𝑛 > 𝑚

(iv) Number of one-one and onto functions

𝑚! , 𝑖𝑓 𝑚 = 𝑛
i.e., bijective functions from A to B= {
0 , 𝑖𝑓 𝑚 ≠ 𝑛
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 1|Page
 MULTIPLE CHOICE QUESTIONS
1) Let A={3,5}. Then number of reflexive relations on A is
(A) 2 (B) 4 (C) 0 (D) 8
Solution: If A is a non-empty finite set containing n elements, then number of reflexive
relations on set A=2𝑛(𝑛−1) .
Here n=2
No. of reflexive relations on A= 22(2−1) =22 =4 Answer: B
2) The number of possible symmetric relations on a set consisting of 4 elements is
(A) 512 (B)1024 (C)256 (D)32
Solution: If A is a non-empty finite set containing n elements, then number of symmetric
𝑛(𝑛+1)
relations on set A =2 2

Here 𝑛 = 4
4(4+1) 4𝑥5
No. of symmetric relations on A=2 2 =2 2 =210 =1024 Answer: B
3) A relation R on set G = {𝐴𝑙𝑙 𝑡ℎ𝑒 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝑖𝑛 𝑎 𝑐𝑒𝑟𝑡𝑎𝑖𝑛 𝑚𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑠 𝑐𝑙𝑎𝑠𝑠} is
defined as, 𝑅 = {(𝑥, 𝑦): 𝑥 𝑎𝑛𝑑 𝑦 ℎ𝑎𝑣𝑒 𝑡ℎ𝑒 𝑠𝑎𝑚𝑒 𝑚𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑠 𝑡𝑒𝑎𝑐ℎ𝑒𝑟}.Which of the
following is true about R ?
(A) R is reflexive and transitive but not symmetric.
(B)R is transitive and symmetric but not reflexive.
(C) R is reflexive and symmetric but not transitive.
(D) R is an equivalence relation.
Answer: D
4) Let the relation R in the set 𝐴 = {𝑥 ∊ Z: 0 ≤ x ≤ 12 }, given by
𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4}. Then the equivalence class [1] is
(A){1,5,9} (B){0,1,2,5} (C){1} (D)A
Solution: Given 𝐴 = {0,1,2,3,4, … ,12}
Now [1] = {𝑥 ∊ 𝐴: |𝑥 − 1| 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4} = {1,5,9} Answer: A
5) A and B are two sets with m elements and n elements respectively(m < n). How many
onto functions can be defined from set A to set B?
(A) 0 (B)m! (C) n! (D)𝑛𝑚
Solution: Given 𝑛(𝐴) = 𝑚, 𝑛(𝐵) = 𝑛
We know that onto function requires every element of set B to be mapped by at least
one element from set A. Since it is given that m < n, there is no such onto function.
Therefore number of onto functions from set A to set B where m < n is zero. Answer: A
6) For real x, let 𝑓(𝑥) = 𝑥 3 . 𝑇ℎ𝑒𝑛
(A) f is one-one but not onto on R (B) f is onto on R but not one-one.
(c) f is one-one and onto on R (D) f is neither one-one nor onto on R
Solution: Let 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ∀ 𝑥1 , 𝑥2 ∈ 𝑅
⇒𝑥13 = 𝑥23
⇒𝑥1 = 𝑥2
𝑆𝑜 𝑓(𝑥) 𝑖𝑠 𝑜𝑛𝑒 − 𝑜𝑛𝑒.
𝐿𝑒𝑡𝑓(𝑥) = 𝑥 3 = 𝑦
1
𝑥 = 𝑦 3 , ∀𝑦 ∈ 𝑅
Every image 𝑦 ∈ 𝑅 has a unique pre image in R.
f is onto.
f is one-one and onto.
Answer: C

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 2|Page

 7) The function 𝑓 ∶ 𝑅 → [−1,1] 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑐𝑜𝑠 𝑥 is :
(A) Both one-one and onto (B) not one-one but onto
(C) One-one but not onto (D) neither one-one nor onto
Answer: B
8) A function f: R→ 𝐴 defined as f(x)=𝑥 2 + 1 is onto, if A is
(A) (−∞, ∞) (B) (1, ∞) (C) [1,∞) (D)[-1,∞)
Solution: x∈ 𝑅 ⇒ 𝑥 ≥ 0 ⇒ 𝑥 2 + 1 ≥ 0 + 1 ⇒ 𝑓(𝑥) ≥ 1
2

Range of f = [1,∞)
Thus for f to be onto , A=[1,∞) Answer: C
9) Let L denotes the set of all straight lines in a plane. Let a relation R be defined by lRm if and
only if l is perpendicular to m ⩝ l, m ∊ L. Then R is:
(A) reflexive (B) symmetric (C) transitive (D) Equivalence relation
Answer: B
10) A relation R on set A={𝑥: 𝑥 ∈ 𝑍 𝑎𝑛𝑑 0 ≤ 𝑥 ≤ 10} as R={(x,y):x=y} is given to be an
equivalence relation. The number of equivalence classes is
(A)1 (B)2 (C)10 (D)11
Solution: A={0,1,2,3,4,5,6,7,8,9,10}
R={(0,0),(1,1), (2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8),(9,9),(10,10)}
We observe that each element in set A is only related to itself in relation R.
[0] ={0}, [1] ={1}, [2] ={2}, [3] ={3}, [4] ={4}, [5] ={5}, [6]
={6}, [7] ={7}, [8] ={8}, [9] ={9}, [10] ={10}
Number of equivalence classes is 11 Answer: D
ASSERTION AND REASON BASED QUESTIONS
Questions numbers 1 to 10 are Assertion and Reason based questions. Two statements are given, one
labelled Assertion (A) and the other labelled Reason (R).
Select the correct answer from the codes (A), (B), (C) and (D) as given below.
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the
Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the
Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.
1) X = {0, 2, 4, 6, 8}. P is a relation on X defined by P = {(0, 2), (4, 2), (4, 6), (8, 6), (2, 4), (0, 4)}.
Assertion (A): The relation P on set X is a transitive relation.
Reason (R): The relation P has a subset of the form {(a, b), (b, c), (a, c)}, where a, b, c ∈ X
is transitive.
Solution: P is not transitive as (4,2) (2,4)∊P but (4,4) ∉ 𝑷. Answer: D
9−𝑥 2
Shown below is the graph of the function 𝑓(𝑥) = 9𝑥−𝑥 3

Assertion (A): The function f is not onto.

Reason (R): 3 ∈ R (co-domain of f) has no pre-image in the
domain of f.
Solution: A is true but R is false. 0∈ 𝑅 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 have a pre-image. Answer: C
𝑥 𝑥
2) Assertion (A): Let 𝑓(𝑥) = 𝑒 and 𝑔(𝑥) = 𝑙𝑜𝑔𝑥. Then (𝑓 + 𝑔)𝑥 = 𝑒 + 𝑙𝑜𝑔 𝑥
where domain of (𝑓 + 𝑔) 𝑖𝑠 𝑅.
Reason (R) : 𝐷𝑜𝑚(𝑓 + 𝑔) = 𝐷𝑜𝑚(𝑓) ∩ 𝐷𝑜𝑚(𝑔)
Solution: Domain of 𝑓 = 𝑅.

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 3|Page

 Domain of 𝑔 = (0, ∞)
Domain of (𝑓 + 𝑔) = 𝑅 ∩ (0, ∞) = (0, ∞) 𝑛𝑜𝑡 𝑅
Here Assertion is false, Reason is true. Answer: D
3) Assertion (A): Let A={𝑥 ∈ 𝑅 ∶ −1 ≤ 𝑥 ≤ 1}. 𝐼𝑓 𝑓: 𝐴 → 𝐴 𝑏𝑒 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠
𝑓(𝑥) = 𝑥 2 , 𝑡ℎ𝑒𝑛 𝑓 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑜𝑛𝑡𝑜 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.
Reason (R): If y=-1∈ 𝐴, 𝑡ℎ𝑒𝑛 𝑥 = ±√−1 𝑛𝑜𝑡 𝑎𝑛 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝐴.
Solution: Here assertion and reason are true and R is the correct explanation of A.
Answer: A
4) Assertion (A): Let Z be the set of integers. A function f: Z→ 𝑍 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠
𝑓(𝑥) = 3𝑥 − 5, ∀𝑥 ∈ 𝑍 𝑖𝑠 𝑎 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑣𝑒.
Reason (R): A function is bijective if it is both surjective and injective.
Solution: Here 𝑓(𝑥) = 3𝑥 − 5 is not a bijective function. Answer :D
5) 𝑓: 𝑋 → 𝑋 is a function on the finite set X.
Assertion (A): If f is onto, then f is one-one and if f is one-one, then f is onto..
Reason (R): Every one-one function is always onto and every onto function is always
one-one.
Solution: For function on finite sets, a one-one function implies onto and vice-versa. This is
not necessarily true for infinite sets.
So reason is not true in this context. Answer: C
6) Assertion (A): If n(A)=m, then the number of reflexive relation on A is m.
Reason(R ):A relation R on set A is said to be reflexive if (𝑎, 𝑎) ∊ 𝑅 ⩝ 𝑎 ∊ 𝐴.
Solution: In a reflexive relation, every element of a set is connected to itself only. So
2
number of reflexive relation is 2m −m . Answer: D
7) Let A and B be two finite sets such that n(A)=5 and n(B)=2.Then
Assertion (A):Number of one-one functions from A to B is 5𝑃2
Reason (R): Number of onto functions from A to B is 30.
Solution: Since n(A)> 𝑛(𝐵), 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛𝑠 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑧𝑒𝑟𝑜.
Assertion(A) is false. Reason (R) is true. Answer: D
9) Assertion (A) : If A and B are two sets having 3 and 5 elements respectively, then the total
number of functions that can be defined from A to B is 53 .
Reason ( R): A function from set A to set B relates elements of set A to elements of set B.
Solution : A function from set A to set B relates every element of set A to a unique element
in set B.
Consequently R is not true.
Since each element of set A can be associated to any one of five elements in B and there
are 3 elements in set A
Total number of functions from A to B = 5 × 5 × 5 = 53 . Answer : C
10) Assertion (A):The relation 𝑓: {1,2,3,4}→{𝑥, 𝑦, 𝑧, 𝑝} defined by 𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧)} is
a bijective function
Reason (R): The relation 𝑓: {1,2,3,4}→{𝑥, 𝑦, 𝑧, 𝑝} defined by
𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧), (4, 𝑝)} is one-one.
Solution: Assertion is false since f is not a function .4 has no image under f. Answer: D
VERY SHORT ANSWER TYPE QUESTIONS
1) Let 𝐴 = {𝑎, 𝑏, 𝑐} and the relation R be defined on A as follows: 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.
Solution : We have relation 𝑅 = {(𝑎, 𝑎), (𝑏, 𝑐), (𝑎, 𝑏)}

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 4|Page

 To make R reflexive, we must add (𝑏, 𝑏) 𝑎𝑛𝑑 (𝑐, 𝑐).
To make R transitive, we must add (𝑎, 𝑐) 𝑡𝑜 𝑅.
Minimum number of ordered pairs to be added in R are (𝑏, 𝑏) , (𝑐, 𝑐) 𝑎𝑛𝑑 (𝑎, 𝑐).
2) Let C be the set of complex numbers. Prove that the mapping f : C→R given by
𝑓 (𝑧) = |𝑧|, ∀ 𝑧 ∈ 𝐶, is neither one-one nor onto.
Solution: We have f : C→ R given by f (z) = |z|, ∀ z ∈ C
f(3 + 4i)=|3 + 4𝑖| = √32 + 42 = 5
f(3 - 4i) = |3 − 4𝑖| = √32 + 42 = 5
Thus f(z) is many-one.
Also |𝑧| ≥ 0 , ∀ 𝑧 ∈ 𝐶
But co-domain given is R.
Hence 𝑓(𝑧) is not onto.
3) 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. Justify your answer.
Solution: Given f = {(1,4), (2,5), (3,6)}
Since every element of A has one and only one image in B under f, f is a one-one function.
4) A function f : A→ 𝐵 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠 𝑓(𝑥) = 2𝑥 is both one-one and onto. If A={1,2,3,4}then
find the set B.
Solution: 𝑊ℎ𝑒𝑛 𝑥 = 1, 𝑓(1) = 2.1 = 2
𝑊ℎ𝑒𝑛 𝑥 = 2, 𝑓(2) = 2.2 = 4
𝑊ℎ𝑒𝑛 𝑥 = 3, 𝑓(3) = 2.3 = 6
𝑊ℎ𝑒𝑛 𝑥 = 4, 𝑓(4) = 2.4 = 8
Since f is both one-one and onto Range of f = Codomain of f
B={2,4,6,8}
5) State whether the following statement is true or false. Justify your answer.
“The sine function is bijective in nature when the domain is [0, 4𝜋] ".
Solution : Given function f(x)=sin x, x∈ [0, 4𝜋]
Let 𝑥1 , 𝑥2 ∈ [0, 4𝜋] 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑓(𝑥1 ) = 𝑓(𝑥2 )
⇨ 𝑠𝑖𝑛 𝑥1 = 𝑠𝑖𝑛 𝑥2
⇨ 𝑥1 = 𝑛𝜋 + (−1)𝑛 𝑥2 , 𝑛 𝜖 {0,1,2,3}
⇨ 𝑥1 = 𝑥2 𝑜𝑟 𝑥1 = 𝜋 − 𝑥2 𝑜𝑟 𝑥1 = 2𝜋 + 𝑥2 𝑜𝑟 𝑥1 = 3𝜋 − 𝑥2
⇨ sin x is not one-one in [0, 4𝜋].
⇨ sine function is not bijective in [0, 4𝜋].
⇨ The given statement is false.
6) Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b) : b = a + 1} is reflexive, symmetric or transitive.
Solution: Let A ={1, 2, 3, 4, 5, 6}
Relation on R is defined as R = {(a, b) : b = a + 1}
In roster form
R={(1,2), (2,3), (3,4), (4,5), (5,6), (6,7)}
R is not reflexive since (1,1),(2,2),(3,3),(4,4),(5,5),(6,6) ∉R.
(1,2)∈ 𝑅 𝑏𝑢𝑡(2,1) ∉ 𝑅.
R is not symmetric.
(1,2) , (2,3) ∈ 𝑅 𝑏𝑢𝑡(1,3) ∉ 𝑅.
R is not transitive.
Hence R is neither reflexive, symmetric nor transitive.
7) Let A= {1,2,3,4} . Let R be the equivalence relation on A x A defined by
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 5|Page
 (𝑎, 𝑏)𝑅(𝑐, 𝑑) 𝑖𝑓𝑓 𝑎 + 𝑑 = 𝑏 + 𝑐. Find the equivalence class [(1,3)] .
Solution: Given on set A = {1,2,3,4} an equivalence relation R on A x A is defined by
(𝑎, 𝑏)𝑅(𝑐, 𝑑) 𝑖𝑓𝑓 𝑎 + 𝑑 = 𝑏 + 𝑐
Let (1,3) R (x, y) for all (x, y) ∊ A x A
⇒ 1+𝑦 = 3+𝑥
⇒ 𝑦 −𝑥 = 2
Therefore (x, y) will be (1,3) and (2,4)
Hence [(1,3)] = {(1,3) , (2,4)}
8) A={1,3,5,7,….} and B={2,4,6,8,…}.Define a function from A to B that is neither
one-one nor onto.
Solution: Given sets A={1,3,5,7,….} and B={2,4,6,8,…}.
Let f :A→ 𝐵 𝑏𝑒 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 2, ∀ 𝑥 ∈ 𝐴.
Since all the elements of A have the same image 2 in B, f is not one-one.
Only the element 2 in B have a pre-image in A. Hence f is not onto.
f is neither one-one nor onto.
9) Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a,b ∈ Z, a R b if and
only if a – b is divisible by n . Show that R is an equivalence relation.
Solution: Given that ∀ a,b ∈ Z, a R b if and only if a – b is divisible by n .
aRa => (a-a) is divisible by n, which is true for any integer a, as zero is divisible by n.
Hence R is reflexive.
aRb => (a-b) is divisible by n
⇨ - (b-a) is divisible by n
⇨ (b-a) is divisible by n
⇨ bRa
⇨ R is symmetric.
Let aRb and bRc.
=> (a-b) is divisible by n and (b-c) is divisible by n
=> (a-b) + (b-c) is divisible by n
=>a-c is divisible by n.
=> aRc
Hence R is transitive.
Since R is reflexive, symmetric and transitive, R is an equivalence relation.
2 𝑡𝑎𝑛𝑥
10) 𝑓(𝑥) = 1−𝑡𝑎𝑛2 𝑥. Find the range of f(x) for x ∊ R.
2 𝑡𝑎𝑛𝑥
Solution: Given 𝑓(𝑥) = 1−𝑡𝑎𝑛2𝑥
⇨ 𝑓(𝑥) = 𝑡𝑎𝑛2𝑥
We know that 𝑡𝑎𝑛 𝑥 ∈ (−∞, ∞)
𝑡𝑎𝑛2𝑥 ∈ (−∞, ∞)
Range of f(x) is (−∞, ∞). i.e., R.
SHORT ANSWER TYPE QUESTIONS
𝑥−2
1) Let f: A→ B be defined by 𝑓(𝑥) = 𝑥−3, where A=R- {3} and 𝐵 = 𝑅 − {1}.
Discuss the bijectivity of the function.
Solution: To check f is one-one: 𝑓(𝑥1 ) = 𝑓(𝑥2 )
𝑥1 − 2 𝑥2 − 2
=
𝑥1 − 3 𝑥2 − 3
=> (𝑥1 − 2)(𝑥2 − 3) = (𝑥2 − 2)(𝑥1 − 3)
=> 𝑥1 𝑥2 −3𝑥1 − 2𝑥2 + 6 = 𝑥1 𝑥2 −3𝑥2 − 2𝑥1 + 6
=> −3𝑥1 + 2𝑥1 = −3𝑥2 + 2𝑥2
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 6|Page
 => −𝑥1 = −𝑥2
=> 𝑥1 = 𝑥2
Hence if 𝑓(𝑥1 ) = 𝑓(𝑥2 ) 𝑡ℎ𝑒𝑛 𝑥1 = 𝑥2
f is one-one
To check f is onto.
𝑥−2
𝑓(𝑥) =
𝑥−3
Let f(x)=y such that y ∈ 𝐵 = 𝑅 − {1}
𝑥−2
𝑦=
𝑥−3
=> 𝑦(𝑥 − 3) = 𝑥 − 2
=> 𝑥𝑦 − 3𝑦 = 𝑥 − 2
=> 𝑥𝑦 − 𝑥 = 3𝑦 − 2
=> 𝑥(𝑦 − 1) = 3𝑦 − 2
3𝑦 − 2
=> 𝑥=
𝑦−1
𝐹𝑜𝑟 𝑦 = 1, 𝑥 𝑖𝑠 𝑛𝑜𝑡 𝑑𝑒𝑓𝑖𝑛𝑒𝑑.
𝐵𝑢𝑡 𝑖𝑡 𝑖𝑠 𝑔𝑖𝑣𝑒𝑛 𝑡ℎ𝑎𝑡 𝑦 ∊ 𝑅 − {1}
3𝑦−2
Hence x = ∈ 𝑅 − {1}
𝑦−1
Checking value for y= f(x)
Putting value of x in f(x)
3𝑦 − 2
𝑓(𝑥) = 𝑓 ( )
𝑦−1
3𝑦−2
−2
𝑦−1
=> f(x) = 3𝑦−2
−3
𝑦−1
3𝑦−2−2(𝑦−1)
=>𝑓(𝑥) = 3𝑦−2−3(𝑦−1)
=> f(x) = y
Thus for every 𝑦 ∈ 𝐵, 𝑡ℎ𝑒𝑟𝑒 𝑒𝑥𝑖𝑠𝑡𝑠 𝑥 ∈ 𝐴 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑓(𝑥) = 𝑦.
Hence f is onto.
Since f is one-one and onto f is a bijective function.
2) Let N be the set of natural numbers and R be the relation on
N𝑋𝑁 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 (𝑎, 𝑏) 𝑅 (𝑐, 𝑑) 𝑖𝑓𝑓 𝑎𝑑 = 𝑏𝑐 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎, 𝑏, 𝑐, 𝑑 ∈
𝑁. 𝑆ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛.
Solution: Given a relation R on N× 𝑁 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 (𝑎, 𝑏) 𝑅 (𝑐, 𝑑)
𝑖𝑓𝑓 𝑎𝑑 = 𝑏𝑐 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑁.
Reflexive: Let (a,b) ∈ 𝑁 × 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 (𝑎, 𝑏) 𝑅 (𝑎, 𝑏)
⇨ ab=ba (Product of two natural numbers is commutative)
⇨ R is reflexive
Symmetric: Let (a,b), (c,d) ∈ 𝑁 × 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 (𝑎, 𝑏) 𝑅 (𝑐, 𝑑 )
⇨ ad=bc => bc = ad => cb = da =>(c,d) R (a,b)
⇨ R is symmetric
Transitive: Let (a,b), (c,d),(e,f) ∈ 𝑁 × 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡
(𝑎, 𝑏) 𝑅 (𝑐, 𝑑)=> ad=bc -----(i) and
(c,d) R (e,f) => cf = de ------(ii)
Multiplying (i) and (ii) we get
acdf = bcde => af = be => (a,b) R (e,f)
R is transitive.
Since R is reflexive, symmetric and transitive, the given relation R on N x N, is an
equivalence relation.

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 7|Page

 3) Check whether the relation S in the set of real numbers R defined by S ={(𝑎, 𝑏); 𝑎 − 𝑏 +
√2 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟} is reflexive, symmetric or transitive.
Solution: Reflexive : For a ∈ 𝑆, 𝑎 − 𝑎 + √2 = √2 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
⇨ (a,a)∈ 𝑆
Thus S is a reflexive relation.
Symmetric : Let (a,b)∈ 𝑆
⇨ a – b + √2 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟
But b – a + √2 𝑚𝑎𝑦 𝑛𝑜𝑡 𝑏𝑒 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
For example: (√2 ,1) ∈ 𝑆 ⇒ √2 − 1 + √2 = 2√2 −
1 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
(1,√2 ) ∉ 𝑆 𝑎𝑠 1 − √2 + √2 = 1 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
Here (a, b)∈ 𝑆 but (b,a) ∉ 𝑺. So S is not a symmetric relation.
Transitive : Let (a, b) ∈ 𝑆 => a – b + √2 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 and
(b, c) ∈ 𝑆 => b – c + √2 is an irrational number.
But a – c + √2 may not be an irrational number.
For Example :
(1,√3 ) ∈ 𝑆 𝑎𝑠 1 − √3 + √2 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
(√3,√2 ) ∈ 𝑆 𝑎𝑠 √3 − √2 + √2 = √3 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟
But (1,√2 ) ∉ 𝑆 𝑎𝑠 1 − √2 + √2 = 1 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟.
=> (a, c) ∉ 𝑆. 𝑆𝑜 𝑆 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛.
Thus S is reflexive but neither symmetric nor transitive relation.
4) A student wants to pair up natural numbers in such a way that they satisfy the equation
2𝑥 + 𝑦 = 41, 𝑥, 𝑦 ∈ 𝑁.Find the domain and range of the relation. Check if the relation
thus formed is reflexive, symmetric and transitive. Hence, state whether it is an equivalence
relation or not.
Solution: We have R={(x, y):x∈ 𝑁, 𝑦 ∈ 𝑁, 2𝑥 + 𝑦 = 41}
Since y ∊ N, Domain ={1,2,3, . . . . ,20}
𝑅 = {(1,39), (2,37), (3,35). . . . . . . , (19,3), (20,1)}
Range = {1,3,5, . . . . . ,39}
R is not reflexive as (2,2) ∉ R as 2 × 2 + 2 ≠ 41.
Also R is not symmetric as (1,39)∈ 𝑅 𝑏𝑢𝑡 (39,1) ∉ 𝑅.
Further R is not transitive as (11,19)∈ 𝑅, (19,3) ∈ 𝑅𝑏𝑢𝑡(11,3) ∉ 𝑅.
Hence R is neither reflexive, symmetric nor transitive.
Therefore R is not an equivalence relation.
5) A function f : R → R is defined by 𝑓(𝑥) = 𝑎𝑥 + 𝑏,such that f(1)=1 and f(2)=3. Find
function f(x). Hence check whether function f(x) is one-one and onto or not.
Solution: Given f(1)=1
⇨ 𝑎 + 𝑏 = 1------(1)
𝑓(2) = 3
⇨ 2𝑎 + 𝑏 = 3-----(2)
Solving equations (1) and (2) we get a=2 and b = -1.
𝑓(𝑥) = 2𝑥 − 1 is the required function.
One-one : Let 𝑥1 , 𝑥2 ∈ 𝑅 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑥1 ≠ 𝑥2
=> 2 𝑥1 ≠ 2𝑥2
=> 2𝑥1 − 1 ≠ 2𝑥2 − 1
=> 𝑓( 𝑥1 ) ≠ 𝑓(𝑥2 )
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 8|Page
 Hence f(x) is a one-one function.
Onto: Let y=f(x) ∈ 𝑅
=> y=2x-1
𝑦+1
=> x= 2
𝑦+1 𝑦+1 𝑦+1
Thus for all y ∈ 𝑅, ∃ 𝑥 = ∈ 𝑅 such that 𝑓(𝑥) = 𝑓 ( ) =2 ( )−1 = 𝑦
2 2 2
f(x) is an onto function.
Hence f is one-one and onto.
𝑥
6) Show that the function f: R → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 2+1 , ∀𝑥 ∈ 𝑅 𝑖𝑠 𝑛𝑒𝑖𝑡ℎ𝑒𝑟 𝑜𝑛𝑒 −
𝑜𝑛𝑒 𝑛𝑜𝑟 𝑜𝑛𝑡𝑜.
Solution :
Let 𝑥1 , 𝑥2 ∈ 𝑅 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑓( 𝑥1 ) = 𝑓(𝑥2 )
𝑥1 𝑥2
=> 2 = 2
𝑥1 +1 𝑥2 +1
=> 𝑥1 (𝑥22 + 1)=𝑥2 (𝑥12 + 1)
=>𝑥1 𝑥22 + 𝑥1 = 𝑥2 𝑥12 + 𝑥2
=>𝑥1 𝑥22 − 𝑥2 𝑥12 = 𝑥2 − 𝑥1
=>𝑥1 𝑥2 (𝑥2 − 𝑥1 ) = 𝑥2 − 𝑥1
=>𝑥1 𝑥2 (𝑥2 − 𝑥1 ) − (𝑥2 − 𝑥1 ) = 0
=> (𝑥2 − 𝑥1 )(𝑥1 𝑥2 − 1) = 0
=> 𝑥2 − 𝑥1 = 0 𝑜𝑟 (𝑥1 𝑥2 − 1) = 0
=> 𝑥2 = 𝑥1 or 𝑥1 𝑥2 = 1
Here 𝑓(𝑥1 ) = 𝑓(𝑥2 )
1
=>𝑥1 = 𝑥2 𝑜𝑟 𝑥1 = 𝑥
2
f is not one-one.
Let k ∊ R be any arbitrary element and let f(x)=k
𝑥
=𝑘
𝑥 2 +1
=> 𝑥 = 𝑘(𝑥 2 + 1)
=> 𝑘𝑥 2 + 𝑘 = 𝑥
𝑘𝑥 2 − 𝑥 + 𝑘 = 0
1±√1−4𝑘 2
⇨ 𝑥= ∉ 𝑅, 𝑖𝑓 1 − 4𝑘 2 < 0
2𝑘
⇨ 𝑜𝑟 𝑖𝑓 (1 − 2𝑘)(1 + 2𝑘) < 0
1 −1
⇨ i.e., k> 2 𝑜𝑟 𝑘 < 2
⇨ f is not onto.
Hence f is neither one-one nor onto.
1
7) Let f : R → R be the function defined by 𝑓(𝑥) = 2−𝑐𝑜𝑠𝑥 ∀x ∈ R. Then, find the range of f.
Solution:
1
f : R → R, 𝑓(𝑥) = 2−𝑐𝑜𝑠𝑥 ∀x ∈ R
1
Let 𝑦 = 2−𝑐𝑜𝑠𝑥
2𝑦 − 𝑦𝑐𝑜𝑠𝑥 = 1
2𝑦−1
Cos x = 𝑦
1
Cos x =2 - 𝑦
We know that -1≤ 𝑐𝑜𝑠 𝑥 ≤ 1

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 9|Page

 1
−1 ≤ 2 − ≤1
𝑦
1
−1 − 2 ≤ 2 − −2 ≤ 1−2
𝑦
1
−3 ≤ − 𝑦 ≤ −1
1
1≤ ≤3
𝑦
1
≤𝑦 ≤1
3
1
Range is [3 , 1]
𝑥
8) Show that the function f : (-∞, 0) → (−1,0) 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 1+|𝑥| ,
𝑥 ∊ (−∞, 0) 𝑖𝑠 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑎𝑛𝑑 𝑜𝑛𝑡𝑜.
𝑥
Solution: Given 𝑓(𝑥) = , 𝑥 ∊ (−∞, 0)
1+|𝑥|
Since 𝑥 ∊ (−∞, 0), |𝑥| = −𝑥
𝑥
Therefore 𝑓(𝑥) = 1−𝑥
One-one: Let 𝑥1 , 𝑥2 ∊ (−∞, 0)
𝑁𝑜𝑤 𝑓(𝑥1 ) = 𝑓( 𝑥2 )
𝑥1 𝑥2
=> 1 − 𝑥 = 1 − 𝑥
1 2
=> 𝑥1 (1 − 𝑥2 ) = 𝑥2 (1 − 𝑥1 )
=> 𝑥1 − 𝑥1 𝑥2 = 𝑥2 − 𝑥2 𝑥1
=> 𝑥1 = 𝑥2
=>Hence f is one-one.
Onto :
𝑥
Let y = 1+|𝑥|
𝑥
𝑦 = 1 − 𝑥 𝑆𝑖𝑛𝑐𝑒𝑥 ∊ (−∞, 0)
=> 𝑦(1 − 𝑥) = 𝑥
⇨ 𝑦 − 𝑦𝑥 = 𝑥
⇨ 𝑦 = 𝑥 + 𝑦𝑥
⇨ 𝑌 = 𝑥(1 + 𝑦)
𝑦
⇨ 𝑥 = 1+𝑦
𝐹𝑜𝑟 𝑒𝑎𝑐ℎ 𝑦 ∈ (−1, 0) 𝑡ℎ𝑒𝑟𝑒 𝑒𝑥𝑖𝑠𝑡𝑠 𝑥 ∈ (−∞, 0) 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡
𝑦
𝑦 1 + 𝑦
𝑓(𝑥) = 𝑓 ( ) = 𝑦 = 𝑦
1 + 𝑦 1 − 1 + 𝑦
Hence f is onto.
Thus f is both one-one and onto.
LONG ANSWER TYPE QUESTIONS
1) Prove that the relation R in the set of integers Z defined as R={(𝑎, 𝑏): 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 (𝑎 +
𝑏)} 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛. 𝐴𝑙𝑠𝑜 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑒 [3]
Solution: 𝑎 + 𝑎 = 2𝑎, which is divisible by 2, ⩝ a ∊ Z
⇒ (𝑎, 𝑎)𝜖𝑅, ∀𝑎 ∈ 𝑍
⇒R is reflexive.
Symmetric: Let (a, b) ∊ R ⇒ 2 divides (a+b)
⇒ 2 divides (b+a)
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 10 | P a g e
 ⇒ (b, a) ∊ R
R is symmetric
Transitive: Let (a, b), (b, c)∊R
⇒ 2 divides (a+b) and (b+c) both
⇒ (a + b) =2m and ( b +c) = 2n
⇒a+2b+c=2m+2n
⇒a+c=2(m+n-b)
⇒2 divides (a+c) ⇒ R is transitive.
Since R is reflexive, symmetric and transitive,
R is an equivalence relation.
[3] = {𝑥: 𝑥 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑖𝑛𝑡𝑒𝑔𝑒𝑟}
Or [3] = {. . . . . −1,1,3,5,7, . . . . . }
2) 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 𝑎𝑑(𝑏 + 𝑐) = 𝑏 𝑐(𝑎 + 𝑑). Show that R is an equivalence relation.
Solution:
Reflexive: By commutative law under addition and multiplication of natural numbers b+
𝑎 = 𝑎 + 𝑏 𝑎𝑛𝑑 𝑎𝑏 = 𝑏𝑎 ∀𝑎, 𝑏 ∊ 𝑁.
𝑎𝑏(𝑏 + 𝑎) = 𝑏𝑎(𝑎 + 𝑏) ∀𝑎, 𝑏 ∊ 𝑁
=> (𝑎, 𝑏)𝑅(𝑎, 𝑏)
Hence, R is reflexive.
Symmetric: Let (𝑎, 𝑏), (𝑐, 𝑑) ∊ 𝑁 × 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 (𝑎, 𝑏)𝑅 (𝑐, 𝑑)
=> 𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑).
=> 𝑏𝑐(𝑎 + 𝑑) = 𝑎𝑑(𝑏 + 𝑐)
=> 𝑐𝑏(𝑑 + 𝑎) = 𝑑𝑎(𝑐 + 𝑏)
=> (𝑐, 𝑑) 𝑅 (𝑎, 𝑏)
Hence, R is symmetric.
Transitive: Let (a, b), (c, d), (e, f) ∈ N X N such that
(a, b) R (c, d) and (c, d) R (e, f)
⇒ ad(b+c) = bc(a + d) and cf(d+e) = de(c +f)
𝑏+𝑐 𝑎+𝑑 𝑑+𝑒 𝑐+𝑓
=> 𝑏𝑐 = and 𝑑𝑒 =
𝑎𝑑 𝑐𝑓
1 1 1 1
=>𝑐 + 𝑏 = 𝑑 + 𝑎 . . . . . . . (1) and
1 1 1 1
+ 𝑑 = 𝑓 + 𝑐 ……………..(2)
𝑒
𝐴𝑑𝑑𝑖𝑛𝑔 (1) 𝑎𝑛𝑑 (2)
1 1 1 1 1 1 11
=>𝑐 + 𝑏 + +𝑑 = +𝑎+𝑓+𝑐
𝑒 𝑑

1 1 1 1
=>𝑏 + = +𝑓
𝑒 𝑎

𝑒+𝑏 𝑓+𝑎
=> 𝑏𝑒 = 𝑎𝑓
=>af(b+e)=be(a+f)
=>(a,b) R (e, f)
Hence, R is transitive.
Thus, R is reflexive, symmetric and transitive.
Therefore, R is an equivalence relation.
3) In the set of natural numbers N, define a relation R as follows:

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 11 | P a g e

 ∀n, m ∈ N, n R m if on division by 5 each of the integers n and m leaves the remainder less
than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is an equivalence relation. Also,
obtain the pairwise disjoint subsets determined by R.
Solution:
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 equivalent classes are as mentioned below:
𝐴0 = {5, 10, 15, 20 ...}
𝐴1 = {1, 6, 11, 16, 21 ...}
𝐴2 = {2, 7, 12, 17, 22, ...}
𝐴3 = {3, 8, 13, 18, 23, ...}
𝐴4 = {4, 9, 14, 19, 24, ...}
It is evident that the above five sets are pairwise disjoint and
4

𝐴0 ∪ 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ 𝐴4 = ⋃ 𝐴𝑖 = 𝑁
𝑖=0
4) Show that the function f: R→ 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠 𝑓(𝑥) = 𝑥 2 + 𝑥 + 1 𝑖𝑠 𝑛𝑒𝑖𝑡ℎ𝑒𝑟 𝑜𝑛𝑒 −
𝑜𝑛𝑒 𝑛𝑜𝑟 𝑜𝑛𝑡𝑜. 𝐴𝑙𝑠𝑜 𝑓𝑖𝑛𝑑 𝑎𝑙𝑙 𝑡ℎ𝑒 𝑣𝑎𝑙𝑢𝑒𝑠 𝑜𝑓 𝑥 𝑓𝑜𝑟 𝑤ℎ𝑖𝑐ℎ 𝑓(𝑥) = 3.
Solution:
Given a function f: R→ 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠 𝑓(𝑥) = 𝑥 2 + 𝑥 + 1
Let 𝑥1 , 𝑥2 ∈ 𝑅 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑓( 𝑥1 ) = 𝑓(𝑥2 )
=> 𝑥12 + 𝑥1 + 1 = 𝑥22 + 𝑥2 + 1
⇨ ( 𝑥12 − 𝑥22 ) + (𝑥1 − 𝑥2 ) = 0
⇨ (𝑥1 − 𝑥2 ) (𝑥1 + 𝑥2 ) + (𝑥1 − 𝑥2 ) = 0
⇨ (𝑥1 − 𝑥2 )(𝑥1 + 𝑥2 + 1) = 0
⇨ (𝑥1 − 𝑥2 ) = 0 𝑜𝑟 (𝑥1 + 𝑥2 + 1) = 0
⇨ 𝑥1 = 𝑥2 𝑜𝑟 𝑥1 = −(𝑥2 + 1)
⇨ f is not one-one.
Onto:
Let y=f(x)
⇨ Y = 𝑥2 + 𝑥 + 1
⇨ 𝑥2 + 𝑥 + 1 − 𝑦 = 0
For x∈ 𝑅, 𝑑𝑖𝑠𝑐𝑟𝑖𝑚𝑖𝑛𝑎𝑛𝑡 𝐷 ≥ 0
⇨ 12 − 4 × 1 × (1 − 𝑦) ≥ 0
⇨ 1-4+4y≥ 0
⇨ 4y-3≥ 0
⇨ 4y≥ 3
3
⇨ y≥ 4
3
⇨ y∈ [4 , ∞)
3
⇨ Range of f(x) is [4 , ∞) ≠ 𝐶𝑜 − 𝑑𝑜𝑚𝑎𝑖𝑛 𝑜𝑓 𝑓 𝑖. 𝑒. , 𝑅
⇨ f is not onto.
Hence f is neither one-one nor onto.
Also we have f(x)=3

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 12 | P a g e

 ⇒ 𝑥2 + 𝑥 + 1 = 3
⇒ 𝑥2 + 𝑥 − 2 = 0
⇒ 𝑥 2 + 2𝑥 − 𝑥 − 2 = 0
⇒ 𝑥(𝑥 + 2) − (𝑥 + 2) = 0
⇒ (𝑥 + 2)(𝑥 − 1) = 0
⇒ 𝑥 = 1, −2

CASE BASED QUESTIONS

1) Students of a school are taken to a railway museum to learn about railways heritage and its
history.

An exhibit in the museum depicted many rail lines on the track near the railway station.
Let L be the set of all rail lines on the railway track and R be the relation on L defined by
R = {(𝑙1 , 𝑙2 ): 𝑙1 𝑖𝑠 𝑝𝑎𝑟𝑎𝑙𝑙𝑒𝑙 𝑡𝑜 𝑙2 }.
On the basis of the above information answer the following questions:
(i) Find whether the relation R is symmetric or not.
(ii) Find whether the relation R is transitive or not.
(iii) (a) If one of the rail lines on the railway track is represented by the equation
y=3x+2, then find the set of rail lines in R related to it. OR
(b)Let S be the relation defined by S = {(𝑙1 , 𝑙2 ): 𝑙1 𝑖𝑠 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 𝑙2 }.
Check whether the relation S is symmetric and transitive.
Solution:
(i)Let (𝑙1 , 𝑙2 ) ∈ 𝑅 ⇒ 𝑙1 ‖ 𝑙2⇒ 𝑙2 ‖ 𝑙1 ⇒(𝑙2 , 𝑙1 ) ∈ 𝑅 ⇒ R is a symmetric relation.
(ii) Let (𝑙1 , 𝑙2 ) ∈ 𝑅 ⇒ 𝑙1 ‖ 𝑙2 and Let (𝑙2 , 𝑙3 ) ∈ 𝑅 ⇒ 𝑙2 ‖ 𝑙3
Since 𝑙1 ‖ 𝑙2 𝑎𝑛𝑑 𝑙2 ‖ 𝑙3 , 𝑙1 ‖ 𝑙3 ⇒ (𝑙1 , 𝑙3 ) ∈ 𝑅
Hence R is a transitive relation.
(iii)(a) The set is {𝑙 ∶ 𝑙 𝑖𝑠 𝑎 𝑙𝑖𝑛𝑒 𝑜𝑓 𝑡𝑦𝑝𝑒 𝑦 = 3𝑥 + 𝑐, 𝑐 ∈ 𝑅}
(b) Let (𝑙1 , 𝑙2 ) ∈ 𝑆 ⇒𝑙1 ⊥ 𝑙2 ⇒ 𝑙2 ⊥ 𝑙1 ⇒ (𝑙2 , 𝑙1 ) ∈ 𝑆
⇒ S is symmetric.
Let (𝑙1 , 𝑙2 ) ∈ 𝑆 ⇒𝑙1 ⊥ 𝑙2 and
Let (𝑙2 , 𝑙3 ) ∈ 𝑆 ⇒𝑙2 ⊥ 𝑙3
𝑙1 ⊥ 𝑙2 𝑎𝑛𝑑 𝑙2 ⊥ 𝑙3 ⇒ 𝑙1 ‖ 𝑙3
⇒(𝑙1 , 𝑙3 ) 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝑆.
S is not a transitive relation.
2) A class room teacher is keen to assess the learning of her students the concept of “relations”
taught to them. She writes the following five relations each defined on the set A={1,2,3}.
𝑅1 = {(2,3), (3,2)}
𝑅2 = {(1,2), (1,3), (3,2)}
𝑅3 = {(1,2), (2,1), (1,1)}
𝑅4 = {(1,1), (1,2), (3,3), (2,2)}
𝑅5 = {(1,1), (1,2), (3,3), (2,2), (2,1), (2,3), (3,2)}
The students are asked to answer the following questions about the above relations:
(i) Identify the relation which is reflexive, transitive but not symmetric.
KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 13 | P a g e
 (ii) Identify the relation which is reflexive and symmetric but not transitive.
(iii) Identify the relations which are symmetric but neither reflexive nor transitive.
OR
(iv) What pairs should be added to the relation 𝑅2 to make it an equivalence relation ?
Solution:
(i) 𝑅4 (ii) 𝑅5 (iii) 𝑅1 (iv){(1,1), (2,2), (3,3), (2,1), (3,1), (2,3)}

3) Let A be the set of 50 students of class XII in a school. Let f : A→ 𝑁, N is the set of natural
numbers such that the function f(x) = Roll Number of student x. On the basis of the given
information, answer the following:
(i) Is f a bijective function ?
(ii) Give reasons to support your answer to (i)
(iii) Let R be a relation defined by the teacher to plan the seating arrangement of
students in pairs, where
𝑅 = {(𝑥, 𝑦): 𝑥, 𝑦 𝑎𝑟𝑒 𝑟𝑜𝑙𝑙 𝑛𝑢𝑚𝑏𝑒𝑟𝑠 𝑜𝑓 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑦 =
3𝑥}. 𝐿𝑖𝑠𝑡 𝑡ℎ𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑅. Is the relation R reflexive, symmetric and
transitive? Justify your answer.
Solution :
(i) 𝑁𝑜
(ii) No two different students of the class can have same roll number. Therefore, f
must be one-one.
We can assume without any loss of generality that roll numbers of students are
from 1 to 50. This implies that 51 in N is not roll number of any student of the
class, so that 51 cannot be image of any element of X under f.
Hence, f is not onto.
(𝑖𝑖𝑖) 𝑅 = {(1,3), (2,6), (3,9), (4,12), (5,15), (6,18), (7,21), (8,24), (9,27), (10,30),
(11,33), (12,36), (13,39), (14,42),(15,45),(16,48)}
𝑅 is not reflexive since (1,1), (2,2)…. ∉R
R is not symmetric
Example: (1,3)∊R but (3,1) ∉R
R is not transitive.
Example: (1,3)∊R,(3,9)∊R but (1,9) ∉R
Since R is not reflexive, symmetric and transitive, R is not an equivalence
relation.

KVS ZIET MYSURU: CLASS 12 MATHEMATICS(2025-26) 14 | P a g e