Relations and Functions Class 12 Solutions | NCERT Maths Chapter 1 Skip to content
🪔 शुभ नवरात्रि! Navratri Mega Sale Up to 34% off every pack + extra 15% off on 2 or more Shop the sale
Smart Notes for Every Exam · instant PDF download after payment +91 88240 98091
Home › NCERT Solutions › Class 12 Maths › Chapter 1
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.

NCERT textbook Chapter 1 (PDF)

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 for every ; symmetric if ; transitive if ; an equivalence relation if all three hold. A function is one-one if ; onto if every element of the co-domain has a pre-image; bijective if both.

Exercise 1.1

1 (i)
Determine whether the relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x − y = 0} is reflexive, symmetric and transitive.
Solution

.

  • Not reflexive: .
  • Not symmetric: but .
  • Not transitive: and , but .

Neither reflexive, nor symmetric, nor transitive.

1 (ii)
Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
Solution

.

  • Not reflexive: .
  • Not symmetric: but .
  • Transitive: for both in R we would need , but every second entry is at least 6. There is no such pair, so the condition is never violated: R is transitive.

Not reflexive, not symmetric, but transitive.

1 (iii)
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
Solution
  • Reflexive: every divides itself, so .
  • Not symmetric: (2 is divisible by 1) but .
  • Transitive: if and , then , , so .

Reflexive and transitive, but not symmetric.

1 (iv)
Relation R in the set Z of all integers defined as R = {(x, y) : x − y is an integer}.
Solution

For integers :

  • Reflexive: is an integer.
  • Symmetric: if is an integer, so is .
  • Transitive: if and are integers, then is an integer.

Reflexive, symmetric and transitive (an equivalence relation).

1 (v)
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 (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 , 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.

2
Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b²} is neither reflexive nor symmetric nor transitive.
Solution
  • Not reflexive: take : is false, so .
  • Not symmetric: since , but since is false.
  • Not transitive: since , and since , but since is false.

Counter-examples , and show it is none of the three.

3
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

.

  • Not reflexive: .
  • Not symmetric: but .
  • Not transitive: but .

Neither reflexive, nor symmetric, nor transitive.

4
Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not symmetric.
Solution
  • Reflexive: for every real .
  • Transitive: and give .
  • Not symmetric: since , but .

Reflexive and transitive, not symmetric (e.g. (1, 2) ∈ R, (2, 1) ∉ R).

5
Check whether the relation R in R defined by R = {(a, b) : a ≤ b³} is reflexive, symmetric or transitive.
Solution
  • Not reflexive: is false, so .
  • Not symmetric: (), but ( is false).
  • Not transitive: since ; since ; but since is false.

Neither reflexive, nor symmetric, nor transitive.

6
Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
Solution
  • Symmetric: and .
  • Not reflexive: .
  • Not transitive: but .

Symmetric only.

7
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.

8
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: is even.
  • Symmetric: .
  • Transitive: if and are even, then 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.

9
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

.

(i) Reflexive: . Symmetric: . Transitive: if and , then . Equivalence relation.

Elements related to 1: is a multiple of 4, so : {1, 5, 9}.

(ii) Reflexive: . Symmetric: . Transitive: , . Equivalence relation.

Elements related to 1: {1}.

Both are equivalence relations; elements related to 1: (i) {1, 5, 9}, (ii) {1}.

10
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 (for (ii) and (iv) use real numbers).

  • (i) : symmetric; not reflexive; not transitive since .
  • (ii) on R: transitive; not reflexive ( is false); not symmetric.
  • (iii) : reflexive and symmetric; not transitive since but .
  • (iv) on R: reflexive and transitive; not symmetric.
  • (v) on {1, 2, 3}: symmetric and transitive; not reflexive since .

See the five examples above.

11
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: .
  • Symmetric: .
  • Transitive: and .

So R is an equivalence relation.

Points related to P are all Q with (a fixed positive number). These are exactly the points at distance 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.

12
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 , then .
  • Transitive: if and , then .

So R is an equivalence relation.

For T₁ and T₃: , so the sides are proportional and . T₂ has , so it is not similar to either.

T₁ and T₃ are related.

13
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.

14
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 , then .
  • Transitive: if and , then .

So R is an equivalence relation.

Lines parallel to have the same slope 2: the set of all lines , where R.

R is an equivalence relation; related lines: y = 2x + c, c ∈ R.

15
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: but .
  • Transitive: the only chains are ; ; ; and those with . All hold.

(B)

16
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
Solution
  • (2, 4): is not greater than 6.
  • (3, 8): .
  • (6, 8): and . ✔
  • (8, 7): .

(C)

Exercise 1.2

1
Show that the function f : R∗ → R∗ defined by 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: .

Onto: for any R∗, take R∗; then .

So is one-one and onto.

With domain N: , is still one-one (same argument), but not onto: e.g. would need N. So the result is not fully true.

One-one and onto on R∗; with domain N it is one-one but not onto.

2
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 . Not onto: 2 is not a square of any natural number. Injective, not surjective.
  • (ii) Not one-one: . Not onto: (or 2) has no pre-image. Neither.
  • (iii) Not one-one: . Not onto: has no real pre-image. Neither.
  • (iv) One-one: . Not onto: 2 is not a cube of a natural number. Injective, not surjective.
  • (v) One-one: . 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.

3
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: and , but .
  • Not onto: is always an integer, so a non-integer like 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).

4
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: .
  • Not onto: , so a negative number such as has no pre-image.

f(−1) = f(1) and negative numbers have no pre-image.

5
Show that the Signum Function f : R → R, given by f(x) = 1 if x > 0, 0 if x = 0, −1 if x < 0 is neither one-one nor onto.
Solution
  • Not one-one: .
  • Not onto: the range is , so e.g. has no pre-image.

f(1) = f(2) and the range is only {−1, 0, 1}.

6
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. Show that f is one-one.
Solution

, , : different elements of A have different images. So is one-one. (It is not onto, as 7 has no pre-image.)

The images 4, 5, 6 are distinct, so f is one-one.

7
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: . Onto: for any , take ; then . Bijective.

(ii) Not one-one: . Not onto: , so e.g. has no pre-image. Neither one-one nor onto.

(i) Bijective. (ii) Neither one-one nor onto.

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

One-one: .

Onto: for any , the element satisfies .

So is bijective.

f swaps the coordinates; it is one-one and every (b, a) has the pre-image (a, b), so it is bijective.

9
Let f : N → N be defined by if n is odd and if n is even, for all n ∈ N. State whether the function f is bijective. Justify your answer.
Solution
  • Not one-one: and .
  • Onto: for any , .

So is onto but not one-one, hence not bijective.

Not bijective: onto, but f(1) = f(2) = 1.

10
Let A = R − {3} and B = R − {1}. Consider the function f : A → B defined by . Is f one-one and onto? Justify your answer.
Solution

One-one:

Onto: let (). Solve : , so , which is a real number since . Also (if then , impossible), so , and .

So is one-one and onto (bijective).

Yes, f is one-one and onto; the pre-image of y is .

11
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

, so not one-one; , so negative numbers have no pre-image: not onto.

(D)

12
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: . Onto: for any , .

(A)

Miscellaneous Exercise on Chapter 1

1
Show that the function f : R → {x ∈ R : −1 < x < 1} defined by , x ∈ R is one one and onto function.
Solution

One-one. If , ; if , . So equal values can only come from of the same sign.

  • Both : .
  • Both : .

Onto. Let .

  • If : take . Then .
  • If : take . Then .

So is one-one and onto.

Same-sign values give (one-one); pre-images for and for (onto).

2
Show that the function f : R → R given by f(x) = x³ is injective.
Solution

The second factor is positive unless . So in every case, i.e. : is injective.

forces , so f is one-one.

3
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: for every subset A.
  • Transitive: and .
  • Not symmetric: , but (X is non-empty).

So R is not an equivalence relation.

No: it is reflexive and transitive but not symmetric (φ ⊂ X but X ⊄ φ).

4
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: can go to any of elements, to any of the remaining , and so on.

Number .

n!

5
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 , x ∈ A. Are f and g equal? Justify your answer.
Solution
xf(x) = x² − xg(x) = 2|x − ½| − 1
−11 + 1 = 22(3/2) − 1 = 2
002(1/2) − 1 = 0
102(1/2) − 1 = 0
24 − 2 = 22(3/2) − 1 = 2

for every , and both have the same domain and co-domain, so f and g are equal.

Yes, f(a) = g(a) for all a ∈ A, so f = g.

6
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 .

This is not transitive: but . The only possible addition is together (for symmetry), which makes R the universal relation, which is transitive. So there is exactly one such relation.

(A) 1

7
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is (A) 1 (B) 2 (C) 3 (D) 4
Solution
  • the universal relation

Adding any other pair, e.g. (2, 3), forces (by symmetry and transitivity) all pairs. So there are two.

(B) 2

Cover of Complete Maths Notes for Class 12 (NCERT 2026-27, CBSE Board 2027)
Done with the answers?Now revise the whole chapter: Class 12 Mathematics notes
  • For NCERT Mathematics Class 12 Part I and Part II (2026-27 edition) - all 13 chapters, CBSE board 2027
  • Typed concept notes with every formula, theorem and method, with worked examples
  • NCERT exercise questions solved step by step
₹199₹24920% off · all 13 chapters · instant PDF
Read free sample

What is inside the Chapter 1 notes →

Board exam? Add the Class 12 Mathematics PYQ book (603 solved board questions) · ₹99

Found a mistake or need help with a question? Message us on WhatsApp. Free study tips and new solutions: join our WhatsApp Channel.