NCERT Solutions · Class 12 Maths · NCERT Mathematics Part I and II Part I · Chapter 1
Chapter 1: Relations and Functions (Relations and Functions)
Step-by-step solutions to all exercises of Chapter 1, Relations and Functions (NCERT Class 12 Maths Part I, 2026-27): Exercise 1.1 (reflexive, symmetric, transitive and equivalence relations, equivalence classes), Exercise 1.2 (one-one, onto and bijective functions) and the Miscellaneous Exercise, with every step shown. All 39 questions are answered, with the key answer highlighted.
Exam revision? Chapter 1 notes with key points, diagrams and practice questions: see the free sample · ₹199 for all 13 chapters
Free NCERT solutions by Notes Bazar · www.notesbazar.in/ncert-solutions/class-12-maths/chapter-1-relations-and-functions
A relation R on A is reflexive if (a,a)∈R for every a; symmetric if (a,b)∈R⇒(b,a)∈R; transitive if (a,b),(b,c)∈R⇒(a,c)∈R; an equivalence relation if all three hold. A function f is one-one if f(x1)=f(x2)⇒x1=x2; onto if every element of the co-domain has a pre-image; bijective if both.
Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
Solution
R={(1,6),(2,7),(3,8)}.
Not reflexive:(1,1)∈/R.
Not symmetric:(1,6)∈R but (6,1)∈/R.
Transitive: for (x,y),(y,z) both in R we would need y<4, but every second entry is at least 6. There is no such pair, so the condition is never violated: R is transitive.
Relation R in the set A of human beings in a town at a particular time given by (a) R = {(x, y) : x and y work at the same place} (b) R = {(x, y) : x and y live in the same locality} (c) R = {(x, y) : x is exactly 7 cm taller than y} (d) R = {(x, y) : x is wife of y} (e) R = {(x, y) : x is father of y}.
Solution
(a) x works at the same place as x (reflexive); if x and y work at the same place, so do y and x (symmetric); if x, y and y, z work at the same place, so do x and z (transitive). Reflexive, symmetric and transitive.
(b) By the same reasoning with "live in the same locality": reflexive, symmetric and transitive.
(c) x is not 7 cm taller than himself (not reflexive). If x is 7 cm taller than y, y is not 7 cm taller than x (not symmetric). If x is 7 cm taller than y and y is 7 cm taller than z, then x is 14 cm taller than z, so (x,z)∈/R (not transitive). Neither reflexive, nor symmetric, nor transitive.
(d) x is not the wife of x (not reflexive). If x is the wife of y, y is the husband of x, not the wife (not symmetric). For (x,y),(y,z)∈R, y would have to be both a husband (of x) and a wife (of z), which is impossible; so the condition is never violated: transitive. Not reflexive, not symmetric, but transitive.
(e) x is not the father of x (not reflexive). If x is the father of y, y is not the father of x (not symmetric). If x is the father of y and y the father of z, x is the grandfather of z, not the father (not transitive). Neither reflexive, nor symmetric, nor transitive.
(a), (b): equivalence relations. (c), (e): none of the three. (d): only transitive.
Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have same number of pages} is an equivalence relation.
Solution
Reflexive: a book has the same number of pages as itself.
Symmetric: if x and y have the same number of pages, so do y and x.
Transitive: if x, y have the same number of pages and y, z do too, then x and z have the same number.
R is reflexive, symmetric and transitive, hence an equivalence relation.
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. Show that all the 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}.
Solution
Reflexive:∣a−a∣=0 is even.
Symmetric:∣b−a∣=∣a−b∣.
Transitive: if a−b and b−c are even, then a−c=(a−b)+(b−c) is even.
So R is an equivalence relation.
In {1, 3, 5}, all elements are odd; the difference of two odd numbers is even, so they are all related.
In {2, 4}, both are even; their difference is even, so they are related.
An odd number minus an even number is odd, so no element of {1, 3, 5} is related to any element of {2, 4}.
R is an equivalence relation; {1, 3, 5} and {2, 4} are its two equivalence classes.
Show that each of the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by (i) R = {(a, b) : |a − b| is a multiple of 4} (ii) R = {(a, b) : a = b} is an equivalence relation. Find the set of all elements related to 1 in each case.
Solution
A={0,1,2,…,12}.
(i) Reflexive: ∣a−a∣=0=4×0. Symmetric: ∣b−a∣=∣a−b∣. Transitive: if a−b=4k and b−c=4m, then a−c=4(k+m). Equivalence relation.
Elements related to 1: ∣1−b∣ is a multiple of 4, so b=1,5,9: {1, 5, 9}.
(ii) Reflexive: a=a. Symmetric: a=b⇒b=a. Transitive: a=b, b=c⇒a=c. Equivalence relation.
Elements related to 1: {1}.
Both are equivalence relations; elements related to 1: (i) {1, 5, 9}, (ii) {1}.
Give an example of a relation which is (i) Symmetric but neither reflexive nor transitive. (ii) Transitive but neither reflexive nor symmetric. (iii) Reflexive and symmetric but not transitive. (iv) Reflexive and transitive but not symmetric. (v) Symmetric and transitive but not reflexive.
Solution
Take A={1,2,3} (for (ii) and (iv) use real numbers).
(i)R={(1,2),(2,1)}: symmetric; not reflexive; not transitive since (1,1)∈/R.
(ii)R={(a,b):a<b} on R: transitive; not reflexive (a<a is false); not symmetric.
(iii)R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}: reflexive and symmetric; not transitive since (1,2),(2,3)∈R but (1,3)∈/R.
(iv)R={(a,b):a≤b} on R: reflexive and transitive; not symmetric.
(v)R={(1,1),(1,2),(2,1),(2,2)} on {1, 2, 3}: symmetric and transitive; not reflexive since (3,3)∈/R.
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.
Solution
Let O be the origin.
Reflexive:OP=OP.
Symmetric:OP=OQ⇒OQ=OP.
Transitive:OP=OQ and OQ=OS⇒OP=OS.
So R is an equivalence relation.
Points related to P are all Q with OQ=OP=r (a fixed positive number). These are exactly the points at distance r from O, i.e. the circle with centre O passing through P.
R is an equivalence relation; the points related to P form the circle with centre at the origin through P.
Show that the relation R defined in the set A of all triangles as R = {(T₁, T₂) : T₁ is similar to T₂}, is equivalence relation. Consider three right angle triangles T₁ with sides 3, 4, 5, T₂ with sides 5, 12, 13 and T₃ with sides 6, 8, 10. Which triangles among T₁, T₂ and T₃ are related?
Solution
Reflexive: every triangle is similar to itself.
Symmetric: if T1∼T2, then T2∼T1.
Transitive: if T1∼T2 and T2∼T3, then T1∼T3.
So R is an equivalence relation.
For T₁ and T₃: 63=84=105=21, so the sides are proportional and T1∼T3. T₂ has 35=412, so it is not similar to either.
Show that the relation R defined in the set A of all polygons as R = {(P₁, P₂) : P₁ and P₂ have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
Solution
Reflexive: a polygon has the same number of sides as itself.
Symmetric: if P₁ and P₂ have the same number of sides, so do P₂ and P₁.
Transitive: if P₁, P₂ and P₂, P₃ have the same number of sides, so do P₁ and P₃.
So R is an equivalence relation. The polygons related to the triangle T are those with 3 sides: the set of all triangles.
R is an equivalence relation; T is related to all triangles.
Let L be the set of all lines in XY plane and R be the relation in L defined as R = {(L₁, L₂) : L₁ is parallel to L₂}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.
Solution
Reflexive: every line is parallel to itself (taken as a convention).
Symmetric: if L1∥L2, then L2∥L1.
Transitive: if L1∥L2 and L2∥L3, then L1∥L3.
So R is an equivalence relation.
Lines parallel to y=2x+4 have the same slope 2: the set of all lines y=2x+c, where c∈ R.
R is an equivalence relation; related lines: y = 2x + c, c ∈ R.
Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer. (A) R is reflexive and symmetric but not transitive. (B) R is reflexive and transitive but not symmetric. (C) R is symmetric and transitive but not reflexive. (D) R is an equivalence relation.
Solution
Reflexive: (1, 1), (2, 2), (3, 3), (4, 4) are all in R.
Not symmetric:(1,2)∈R but (2,1)∈/R.
Transitive: the only chains are (1,3),(3,2)→(1,2)∈R; (1,2),(2,2)→(1,2)∈R; (1,3),(3,3)→(1,3)∈R; (3,2),(2,2)→(3,2)∈R and those with (a,a). All hold.
Let R be the relation in the set N given by R = {(a, b) : a = b − 2, b > 6}. Choose the correct answer. (A) (2, 4) ∈ R (B) (3, 8) ∈ R (C) (6, 8) ∈ R (D) (8, 7) ∈ R
Show that the function f : R∗ → R∗ defined by f(x)=x1 is one-one and onto, where R∗ is the set of all non-zero real numbers. Is the result true, if the domain R∗ is replaced by N with co-domain being same as R∗?
Solution
One-one:f(x1)=f(x2)⇒x11=x21⇒x1=x2.
Onto: for any y∈ R∗, take x=y1∈ R∗; then f(x)=y.
So f is one-one and onto.
With domain N:g:N→R∗, g(x)=x1 is still one-one (same argument), but not onto: e.g. y=2 would need x=21∈/ N. So the result is not fully true.
One-one and onto on R∗; with domain N it is one-one but not onto.
Check the injectivity and surjectivity of the following functions: (i) f : N → N given by f(x) = x² (ii) f : Z → Z given by f(x) = x² (iii) f : R → R given by f(x) = x² (iv) f : N → N given by f(x) = x³ (v) f : Z → Z given by f(x) = x³.
Solution
(i) One-one: for natural numbers x12=x22⇒x1=x2. Not onto: 2 is not a square of any natural number. Injective, not surjective.
(ii) Not one-one: f(−1)=f(1)=1. Not onto: −1 (or 2) has no pre-image. Neither.
(iii) Not one-one: f(−1)=f(1). Not onto: −1 has no real pre-image. Neither.
(iv) One-one: x13=x23⇒x1=x2. Not onto: 2 is not a cube of a natural number. Injective, not surjective.
(v) One-one: x13=x23⇒x1=x2. Not onto: 2 is not a cube of an integer. Injective, not surjective.
(i), (iv), (v): one-one but not onto. (ii), (iii): neither one-one nor onto.
Prove that the Greatest Integer Function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
Solution
Not one-one:f(1.2)=1 and f(1.9)=1, but 1.2=1.9.
Not onto:f(x) is always an integer, so a non-integer like 0.7 in the co-domain R has no pre-image.
[1.2] = [1.9] = 1 (not one-one) and the range is Z ≠ R (not onto).
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.
Solution
Not one-one:f(−1)=f(1)=1.
Not onto:∣x∣≥0, so a negative number such as −1 has no pre-image.
f(−1) = f(1) and negative numbers have no pre-image.
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 + x².
Solution
(i) One-one: 3−4x1=3−4x2⇒x1=x2. Onto: for any y, take x=43−y; then f(x)=3−(3−y)=y. Bijective.
(ii) Not one-one: f(1)=f(−1)=2. Not onto: 1+x2≥1, so e.g. 0 has no pre-image. Neither one-one nor onto.
Let f : N → N be defined by f(n)=2n+1 if n is odd and f(n)=2n if n is even, for all n ∈ N. State whether the function f is bijective. Justify your answer.
Solution
Not one-one:f(1)=21+1=1 and f(2)=22=1.
Onto: for any n∈N, f(2n)=22n=n.
So f is onto but not one-one, hence not bijective.
Onto: let y∈B (y=1). Solve y=x−3x−2: xy−3y=x−2, so x=y−13y−2, which is a real number since y=1. Also x=3 (if y−13y−2=3 then −2=−3, impossible), so x∈A, and f(x)=y.
So f is one-one and onto (bijective).
Yes, f is one-one and onto; the pre-image of y is x=y−13y−2.
Let f : R → R be defined as f(x) = x⁴. Choose the correct answer. (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.
Solution
f(1)=f(−1)=1, so not one-one; x4≥0, so negative numbers have no pre-image: not onto.
Let f : R → R be defined as f(x) = 3x. Choose the correct answer. (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.
Solution
One-one: 3x1=3x2⇒x1=x2. Onto: for any y, f(3y)=y.
Given a non empty set X, consider P(X) which is the set of all subsets of X. Define the relation R in P(X) as follows: For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
Solution
Reflexive:A⊂A for every subset A.
Transitive:A⊂B and B⊂C⇒A⊂C.
Not symmetric:ϕ⊂X, but X⊂ϕ (X is non-empty).
So R is not an equivalence relation.
No: it is reflexive and transitive but not symmetric (φ ⊂ X but X ⊄ φ).
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Solution
For a finite set mapped to itself, onto is the same as one-one, so the onto functions are exactly the arrangements (permutations) of the n elements: 1 can go to any of n elements, 2 to any of the remaining n−1, and so on.
Let A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2} and f, g : A → B be functions defined by f(x) = x² − x, x ∈ A and g(x)=2x−21−1, x ∈ A. Are f and g equal? Justify your answer.
Solution
x
f(x) = x² − x
g(x) = 2|x − ½| − 1
−1
1 + 1 = 2
2(3/2) − 1 = 2
0
0
2(1/2) − 1 = 0
1
0
2(1/2) − 1 = 0
2
4 − 2 = 2
2(3/2) − 1 = 2
f(a)=g(a) for every a∈A, and both have the same domain and co-domain, so f and g are equal.
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is (A) 1 (B) 2 (C) 3 (D) 4
Solution
Reflexive and symmetric with (1, 2), (1, 3) forces R={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)}.
This is not transitive: (2,1),(1,3)∈R but (2,3)∈/R. The only possible addition is (2,3),(3,2) together (for symmetry), which makes R the universal relation, which is transitive. So there is exactly one such relation.