Skip to main content
Chapter 1 of 15
NCERT Solutions

Relations and Functions — NCERT Solutions

Madhya Pradesh Board · Class 12 · Mathematics

NCERT Solutions for Relations and Functions, Madhya Pradesh Board Class 12 Mathematics: 49 textbook questions solved step by step.

119 questions52 flashcards15 formulas & key relations5 concepts

Interactive on Super Tutor

Studying Relations and Functions? Get the full interactive chapter.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for NCERT solutions and more.

Free trial, no card needed.

A visual representation of the Cartesian product A × B using a grid or mapping diagram, showing how ordered pairs are formed.
Super Tutor

Learn better with visuals Super Tutor pairs illustrations like this with notes and quizzes for Relations and Functions.

49 Questions Solved · 3 Sections

The first 25 solutions are open to read. The other 24 are free with a Super Tutor account.

Exercise 1.1

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

Given: A={1,2,3,…,14}A = \{1, 2, 3, \dots, 14\}, R={(x,y):3x−y=0}R = \{(x, y): 3x - y = 0\}, i.e., y=3xy = 3x.

Listing R: R={(1,3),(2,6),(3,9),(4,12)}R = \{(1,3),(2,6),(3,9),(4,12)\}

Reflexive: For reflexivity, (a,a)∈R(a,a) \in R for all a∈Aa \in A, i.e., 3a=a⇒a=03a = a \Rightarrow a = 0, which is not in AA. For example, (1,1)∉R(1,1) \notin R. Hence R is not reflexive.

Symmetric: (1,3)∈R(1,3) \in R but 3(3)=9≠13(3) = 9 \neq 1, so (3,1)∉R(3,1) \notin R. Hence R is not symmetric.

Transitive: We need: if (x,y)∈R(x,y) \in R and (y,z)∈R(y,z) \in R, then (x,z)∈R(x,z) \in R. Check: (1,3)∈R(1,3) \in R and (3,9)∈R(3,9) \in R. Is (1,9)∈R(1,9) \in R? 3(1)=3≠93(1) = 3 \neq 9. So (1,9)∉R(1,9) \notin R. Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

1(ii)Determine whether the relation R in the set N\mathbf{N} of natural numbers defined as R={(x,y):y=x+5 and x<4}R = \{(x, y): y = x + 5 \text{ and } x < 4\} is reflexive, symmetric and transitive.Show solution

Given: R={(x,y):y=x+5, x<4}R = \{(x,y): y = x+5,\ x < 4\}

Listing R: R={(1,6),(2,7),(3,8)}R = \{(1,6),(2,7),(3,8)\}

Reflexive: (1,1)∉R(1,1) \notin R since 1≠1+51 \neq 1+5. Hence R is not reflexive.

Symmetric: (1,6)∈R(1,6) \in R but (6,1)∉R(6,1) \notin R since 6≮46 \not< 4. Hence R is not symmetric.

Transitive: We need (x,y)∈R(x,y) \in R and (y,z)∈R⇒(x,z)∈R(y,z) \in R \Rightarrow (x,z) \in R. The pairs in R have second elements 6,7,86,7,8, none of which is less than 4, so no pair (y,z)(y,z) exists in R for any (x,y)∈R(x,y) \in R. The condition is vacuously satisfied. Hence R is transitive.

Conclusion: R is neither reflexive nor symmetric, but it is transitive.

1(iii)Determine whether the relation R in the set A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} defined as R={(x,y):y is divisible by x}R = \{(x, y): y \text{ is divisible by } x\} is reflexive, symmetric and transitive.Show solution

Given: R={(x,y):x∣y}R = \{(x,y): x \mid y\} on A={1,2,3,4,5,6}A = \{1,2,3,4,5,6\}.

Reflexive: Every element divides itself, so (a,a)∈R(a,a) \in R for all a∈Aa \in A. Hence R is reflexive.

Symmetric: (1,2)∈R(1,2) \in R (since 2 is divisible by 1) but (2,1)∉R(2,1) \notin R (since 1 is not divisible by 2). Hence R is not symmetric.

Transitive: Suppose (x,y)∈R(x,y) \in R and (y,z)∈R(y,z) \in R, i.e., x∣yx \mid y and y∣zy \mid z. Then x∣zx \mid z, so (x,z)∈R(x,z) \in R. Hence R is transitive.

Conclusion: R is reflexive and transitive but not symmetric.

1(iv)Determine whether the relation R in the set Z\mathbf{Z} of all integers defined as R={(x,y):x−y is an integer}R = \{(x, y): x - y \text{ is an integer}\} is reflexive, symmetric and transitive.Show solution

Given: R={(x,y):x−y∈Z}R = \{(x,y): x - y \in \mathbf{Z}\} on Z\mathbf{Z}.

Reflexive: For any a∈Za \in \mathbf{Z}, a−a=0∈Za - a = 0 \in \mathbf{Z}, so (a,a)∈R(a,a) \in R. Hence R is reflexive.

Symmetric: If (x,y)∈R(x,y) \in R, then x−y∈Zx - y \in \mathbf{Z}, so y−x=−(x−y)∈Zy - x = -(x-y) \in \mathbf{Z}, giving (y,x)∈R(y,x) \in R. Hence R is symmetric.

Transitive: If (x,y)∈R(x,y) \in R and (y,z)∈R(y,z) \in R, then x−y∈Zx-y \in \mathbf{Z} and y−z∈Zy-z \in \mathbf{Z}. So x−z=(x−y)+(y−z)∈Zx - z = (x-y)+(y-z) \in \mathbf{Z}, giving (x,z)∈R(x,z) \in R. Hence R is transitive.

Conclusion: R is reflexive, symmetric and transitive, hence an equivalence relation.

1(v)(a)Determine whether the relation R={(x,y):x and y work at the same place}R = \{(x,y): x \text{ and } y \text{ work at the same place}\} in the set A of human beings in a town is reflexive, symmetric and transitive.Show solution

Reflexive: Any person xx works at the same place as themselves, so (x,x)∈R(x,x) \in R. Hence R is reflexive.

Symmetric: If xx and yy work at the same place, then yy and xx work at the same place. So (x,y)∈R⇒(y,x)∈R(x,y) \in R \Rightarrow (y,x) \in R. Hence R is symmetric.

Transitive: If xx and yy work at the same place, and yy and zz work at the same place, then xx and zz work at the same place. Hence R is transitive.

Conclusion: R is an equivalence relation.

1(v)(b)Determine whether the relation R={(x,y):x and y live in the same locality}R = \{(x,y): x \text{ and } y \text{ live in the same locality}\} in the set A of human beings in a town is reflexive, symmetric and transitive.Show solution

Reflexive: xx lives in the same locality as xx, so (x,x)∈R(x,x) \in R. Hence R is reflexive.

Symmetric: If xx and yy live in the same locality, then yy and xx live in the same locality. Hence R is symmetric.

Transitive: If x,yx,y live in the same locality and y,zy,z live in the same locality, then x,zx,z live in the same locality. Hence R is transitive.

Conclusion: R is an equivalence relation.

1(v)(c)Determine whether the relation R={(x,y):x is exactly 7 cm taller than y}R = \{(x,y): x \text{ is exactly 7 cm taller than } y\} in the set A of human beings in a town is reflexive, symmetric and transitive.Show solution

Reflexive: xx cannot be 7 cm taller than itself, so (x,x)∉R(x,x) \notin R. Hence R is not reflexive.

Symmetric: If xx is exactly 7 cm taller than yy, then yy is 7 cm shorter than xx, not taller. So (x,y)∈R⇏(y,x)∈R(x,y) \in R \not\Rightarrow (y,x) \in R. Hence R is not symmetric.

Transitive: If xx is 7 cm taller than yy, and yy is 7 cm taller than zz, then xx is 14 cm taller than zz, not 7 cm. So (x,y)∈R(x,y) \in R and (y,z)∈R⇏(x,z)∈R(y,z) \in R \not\Rightarrow (x,z) \in R. Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

1(v)(d)Determine whether the relation R={(x,y):x is wife of y}R = \{(x,y): x \text{ is wife of } y\} in the set A of human beings in a town is reflexive, symmetric and transitive.Show solution

Reflexive: xx cannot be the wife of herself/himself, so (x,x)∉R(x,x) \notin R. Hence R is not reflexive.

Symmetric: If xx is the wife of yy, then yy is the husband of xx, not the wife. So (x,y)∈R⇏(y,x)∈R(x,y) \in R \not\Rightarrow (y,x) \in R. Hence R is not symmetric.

Transitive: If xx is the wife of yy, then yy is male, so yy cannot be the wife of anyone. The condition (x,y)∈R(x,y) \in R and (y,z)∈R(y,z) \in R never holds. Hence the condition is vacuously true, so R is transitive.

Conclusion: R is transitive but neither reflexive nor symmetric.

1(v)(e)Determine whether the relation R={(x,y):x is father of y}R = \{(x,y): x \text{ is father of } y\} in the set A of human beings in a town is reflexive, symmetric and transitive.Show solution

Reflexive: xx cannot be the father of himself, so (x,x)∉R(x,x) \notin R. Hence R is not reflexive.

Symmetric: If xx is the father of yy, then yy is the child of xx, not the father. So (x,y)∈R⇏(y,x)∈R(x,y) \in R \not\Rightarrow (y,x) \in R. Hence R is not symmetric.

Transitive: If xx is the father of yy, and yy is the father of zz, then xx is the grandfather of zz, not the father. So (x,y)∈R(x,y) \in R and (y,z)∈R⇏(x,z)∈R(y,z) \in R \not\Rightarrow (x,z) \in R. Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

2Show that the relation R in the set R\mathbf{R} of real numbers, defined as R={(a,b):a≤b2}R = \{(a, b): a \leq b^2\} is neither reflexive nor symmetric nor transitive.Show solution

Not Reflexive: Take a=12a = \dfrac{1}{2}. Then a≤a2a \leq a^2 requires 12≤14\dfrac{1}{2} \leq \dfrac{1}{4}, which is false. So (12,12)∉R\left(\dfrac{1}{2}, \dfrac{1}{2}\right) \notin R. Hence R is not reflexive.

Not Symmetric: Take a=1,b=2a = 1, b = 2. Then 1≤41 \leq 4 is true, so (1,2)∈R(1,2) \in R. But 2≤12=12 \leq 1^2 = 1 is false, so (2,1)∉R(2,1) \notin R. Hence R is not symmetric.

Not Transitive: Take a=2,b=−2,c=−12a = 2, b = -2, c = -\dfrac{1}{2}.

  • (2,−2)∈R(2,-2) \in R? 2≤(−2)2=42 \leq (-2)^2 = 4. Yes.
  • (−2,−12)∈R(-2, -\frac{1}{2}) \in R? −2≤(−12)2=14-2 \leq \left(-\frac{1}{2}\right)^2 = \frac{1}{4}. Yes.
  • (2,−12)∈R(2, -\frac{1}{2}) \in R? 2≤142 \leq \frac{1}{4}. No.

So (2,−2)∈R(2,-2) \in R and (−2,−12)∈R(-2,-\frac{1}{2}) \in R but (2,−12)∉R(2,-\frac{1}{2}) \notin R. Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

3Check whether the relation R defined in the set {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\} as R={(a,b):b=a+1}R = \{(a, b): b = a + 1\} is reflexive, symmetric or transitive.Show solution

Given: A={1,2,3,4,5,6}A = \{1,2,3,4,5,6\}, R={(a,b):b=a+1}R = \{(a,b): b = a+1\}.

Listing R: R={(1,2),(2,3),(3,4),(4,5),(5,6)}R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\}

Reflexive: (1,1)∉R(1,1) \notin R since 1≠1+11 \neq 1+1. Hence R is not reflexive.

Symmetric: (1,2)∈R(1,2) \in R but (2,1)∉R(2,1) \notin R since 1≠2+11 \neq 2+1. Hence R is not symmetric.

Transitive: (1,2)∈R(1,2) \in R and (2,3)∈R(2,3) \in R, but (1,3)∉R(1,3) \notin R since 3≠1+13 \neq 1+1. Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

4Show that the relation R in R\mathbf{R} defined as R={(a,b):a≤b}R = \{(a, b): a \leq b\}, is reflexive and transitive but not symmetric.Show solution

Reflexive: For any a∈Ra \in \mathbf{R}, a≤aa \leq a is always true. So (a,a)∈R(a,a) \in R for all aa. Hence R is reflexive.

Not Symmetric: Take a=1,b=2a = 1, b = 2. Then 1≤21 \leq 2, so (1,2)∈R(1,2) \in R. But 2≤12 \leq 1 is false, so (2,1)∉R(2,1) \notin R. Hence R is not symmetric.

Transitive: Let (a,b)∈R(a,b) \in R and (b,c)∈R(b,c) \in R, i.e., a≤ba \leq b and b≤cb \leq c. Then a≤ca \leq c, so (a,c)∈R(a,c) \in R. Hence R is transitive.

Conclusion: R is reflexive and transitive but not symmetric.

5Check whether the relation R in R\mathbf{R} defined by R={(a,b):a≤b3}R = \{(a, b): a \leq b^3\} is reflexive, symmetric or transitive.Show solution

Not Reflexive: Take a=12a = \dfrac{1}{2}. Then a≤a3a \leq a^3 requires 12≤18\dfrac{1}{2} \leq \dfrac{1}{8}, which is false. So (12,12)∉R\left(\dfrac{1}{2},\dfrac{1}{2}\right) \notin R. Hence R is not reflexive.

Not Symmetric: Take a=1,b=2a = 1, b = 2. Then 1≤81 \leq 8, so (1,2)∈R(1,2) \in R. But 2≤13=12 \leq 1^3 = 1 is false, so (2,1)∉R(2,1) \notin R. Hence R is not symmetric.

Not Transitive: Take a=3,b=32,c=65a = 3, b = \dfrac{3}{2}, c = \dfrac{6}{5}.

  • (3,32)∈R(3, \frac{3}{2}) \in R? 3≤(32)3=278=3.3753 \leq \left(\frac{3}{2}\right)^3 = \frac{27}{8} = 3.375. Yes.
  • (32,65)∈R(\frac{3}{2}, \frac{6}{5}) \in R? 32≤(65)3=216125=1.728\frac{3}{2} \leq \left(\frac{6}{5}\right)^3 = \frac{216}{125} = 1.728. Yes.
  • (3,65)∈R(3, \frac{6}{5}) \in R? 3≤(65)3=1.7283 \leq \left(\frac{6}{5}\right)^3 = 1.728. No.

Hence R is not transitive.

Conclusion: R is neither reflexive, nor symmetric, nor transitive.

6Show that the relation R in the set {1,2,3}\{1, 2, 3\} given by R={(1,2),(2,1)}R = \{(1, 2), (2, 1)\} is symmetric but neither reflexive nor transitive.Show solution

Given: A={1,2,3}A = \{1,2,3\}, R={(1,2),(2,1)}R = \{(1,2),(2,1)\}.

Not Reflexive: (1,1)∉R(1,1) \notin R. Hence R is not reflexive.

Symmetric: (1,2)∈R⇒(2,1)∈R(1,2) \in R \Rightarrow (2,1) \in R, and (2,1)∈R⇒(1,2)∈R(2,1) \in R \Rightarrow (1,2) \in R. Hence R is symmetric.

Not Transitive: (1,2)∈R(1,2) \in R and (2,1)∈R(2,1) \in R, but (1,1)∉R(1,1) \notin R. Hence R is not transitive.

Conclusion: R is symmetric but neither reflexive nor transitive.

7Show 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}R = \{(x, y) : x \text{ and } y \text{ have same number of pages}\} is an equivalence relation.Show solution

Reflexive: Any book xx has the same number of pages as itself. So (x,x)∈R(x,x) \in R for all x∈Ax \in A. Hence R is reflexive.

Symmetric: If xx and yy have the same number of pages, then yy and xx have the same number of pages. So (x,y)∈R⇒(y,x)∈R(x,y) \in R \Rightarrow (y,x) \in R. Hence R is symmetric.

Transitive: If xx and yy have the same number of pages, and yy and zz have the same number of pages, then xx and zz have the same number of pages. So (x,y)∈R(x,y) \in R and (y,z)∈R⇒(x,z)∈R(y,z) \in R \Rightarrow (x,z) \in R. Hence R is transitive.

Conclusion: Since R is reflexive, symmetric and transitive, R is an equivalence relation.

8Show that the relation R in the set A={1,2,3,4,5}A = \{1, 2, 3, 4, 5\} given by R={(a,b):∣a−b∣ is even}R = \{(a, b) : |a - b| \text{ is even}\}, is an equivalence relation. Show that all the elements of {1,3,5}\{1, 3, 5\} are related to each other and all the elements of {2,4}\{2, 4\} are related to each other. But no element of {1,3,5}\{1, 3, 5\} is related to any element of {2,4}\{2, 4\}.Show solution

Reflexive: For any a∈Aa \in A, ∣a−a∣=0|a - a| = 0, which is even. So (a,a)∈R(a,a) \in R. Hence R is reflexive.

Symmetric: If (a,b)∈R(a,b) \in R, then ∣a−b∣|a-b| is even. Since ∣a−b∣=∣b−a∣|a-b| = |b-a|, ∣b−a∣|b-a| is also even, so (b,a)∈R(b,a) \in R. Hence R is symmetric.

Transitive: If (a,b)∈R(a,b) \in R and (b,c)∈R(b,c) \in R, then ∣a−b∣|a-b| and ∣b−c∣|b-c| are both even, meaning a−ba-b and b−cb-c are both even. Then a−c=(a−b)+(b−c)a - c = (a-b)+(b-c) is even, so ∣a−c∣|a-c| is even, giving (a,c)∈R(a,c) \in R. Hence R is transitive.

Therefore, R is an equivalence relation.

Elements of {1,3,5}\{1,3,5\}: ∣1−3∣=2|1-3|=2 (even), ∣1−5∣=4|1-5|=4 (even), ∣3−5∣=2|3-5|=2 (even). So all elements of {1,3,5}\{1,3,5\} are related to each other.

Elements of {2,4}\{2,4\}: ∣2−4∣=2|2-4|=2 (even). So 2 and 4 are related to each other.

Cross-check: For a∈{1,3,5}a \in \{1,3,5\} and b∈{2,4}b \in \{2,4\}: ∣1−2∣=1,∣1−4∣=3,∣3−2∣=1,∣3−4∣=1,∣5−2∣=3,∣5−4∣=1|1-2|=1, |1-4|=3, |3-2|=1, |3-4|=1, |5-2|=3, |5-4|=1 — all odd. So no element of {1,3,5}\{1,3,5\} is related to any element of {2,4}\{2,4\}.

9(i)Show that the relation R={(a,b):∣a−b∣ is a multiple of 4}R = \{(a, b) : |a - b| \text{ is a multiple of } 4\} in the set A={x∈Z:0≤x≤12}A = \{x \in \mathbf{Z} : 0 \leq x \leq 12\} is an equivalence relation. Find the set of all elements related to 1.Show solution

Given: A={0,1,2,3,4,5,6,7,8,9,10,11,12}A = \{0,1,2,3,4,5,6,7,8,9,10,11,12\}, R={(a,b):4∣∣a−b∣}R = \{(a,b): 4 \mid |a-b|\}.

Reflexive: For any a∈Aa \in A, ∣a−a∣=0=4×0|a-a| = 0 = 4 \times 0, a multiple of 4. So (a,a)∈R(a,a) \in R. Hence R is reflexive.

Symmetric: If (a,b)∈R(a,b) \in R, then 4∣∣a−b∣4 \mid |a-b|. Since ∣a−b∣=∣b−a∣|a-b| = |b-a|, we have 4∣∣b−a∣4 \mid |b-a|, so (b,a)∈R(b,a) \in R. Hence R is symmetric.

Transitive: If (a,b)∈R(a,b) \in R and (b,c)∈R(b,c) \in R, then 4∣(a−b)4 \mid (a-b) and 4∣(b−c)4 \mid (b-c). So 4∣[(a−b)+(b−c)]=(a−c)4 \mid [(a-b)+(b-c)] = (a-c), giving 4∣∣a−c∣4 \mid |a-c|, so (a,c)∈R(a,c) \in R. Hence R is transitive.

Therefore, R is an equivalence relation.

Set of elements related to 1: We need ∣a−1∣|a - 1| to be a multiple of 4, i.e., a−1∈{0,±4,±8,±12,…}a - 1 \in \{0, \pm4, \pm8, \pm12,\ldots\}, so a∈{1,5,9}a \in \{1, 5, 9\} (within AA).

Required set={1,5,9}\text{Required set} = \{1, 5, 9\}

9(ii)Show that the relation R={(a,b):a=b}R = \{(a, b) : a = b\} in the set A={x∈Z:0≤x≤12}A = \{x \in \mathbf{Z} : 0 \leq x \leq 12\} is an equivalence relation. Find the set of all elements related to 1.Show solution

Given: R={(a,b):a=b}R = \{(a,b): a = b\} on A={0,1,2,…,12}A = \{0,1,2,\ldots,12\}.

Reflexive: For any a∈Aa \in A, a=aa = a, so (a,a)∈R(a,a) \in R. Hence R is reflexive.

Symmetric: If (a,b)∈R(a,b) \in R, then a=ba = b, so b=ab = a, giving (b,a)∈R(b,a) \in R. Hence R is symmetric.

Transitive: If (a,b)∈R(a,b) \in R and (b,c)∈R(b,c) \in R, then a=ba = b and b=cb = c, so a=ca = c, giving (a,c)∈R(a,c) \in R. Hence R is transitive.

Therefore, R is an equivalence relation.

Set of elements related to 1: We need a=1a = 1. So the only element related to 1 is 1 itself.

Required set={1}\text{Required set} = \{1\}

10Give 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.Show solution

(i) Symmetric but neither reflexive nor transitive:

Let A={1,2,3}A = \{1,2,3\} and R={(1,2),(2,1)}R = \{(1,2),(2,1)\}.

  • Not reflexive: (1,1)∉R(1,1) \notin R.
  • Symmetric: (1,2)∈R⇒(2,1)∈R(1,2) \in R \Rightarrow (2,1) \in R. ✓
  • Not transitive: (1,2)∈R(1,2) \in R and (2,1)∈R(2,1) \in R but (1,1)∉R(1,1) \notin R.

(ii) Transitive but neither reflexive nor symmetric:

Let A={1,2,3}A = \{1,2,3\} and R={(1,2),(2,3),(1,3)}R = \{(1,2),(2,3),(1,3)\}.

  • Not reflexive: (1,1)∉R(1,1) \notin R.
  • Not symmetric: (1,2)∈R(1,2) \in R but (2,1)∉R(2,1) \notin R.
  • Transitive: (1,2)∈R,(2,3)∈R⇒(1,3)∈R(1,2) \in R, (2,3) \in R \Rightarrow (1,3) \in R. ✓

(iii) Reflexive and symmetric but not transitive:

Let A={1,2,3}A = \{1,2,3\} and R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)\}.

  • Reflexive: (1,1),(2,2),(3,3)∈R(1,1),(2,2),(3,3) \in R. ✓
  • Symmetric: For every (a,b)∈R(a,b) \in R, (b,a)∈R(b,a) \in R. ✓
  • Not transitive: (1,2)∈R(1,2) \in R and (2,3)∈R(2,3) \in R but (1,3)∉R(1,3) \notin R.

(iv) Reflexive and transitive but not symmetric:

Let R={(a,b):a≤b}R = \{(a,b): a \leq b\} on R\mathbf{R}.

  • Reflexive: a≤aa \leq a. ✓
  • Transitive: a≤ba \leq b and b≤c⇒a≤cb \leq c \Rightarrow a \leq c. ✓
  • Not symmetric: 1≤21 \leq 2 but 2≰12 \not\leq 1.

(v) Symmetric and transitive but not reflexive:

Let A={1,2,3}A = \{1,2,3\} and R={(1,2),(2,1),(1,1),(2,2)}R = \{(1,2),(2,1),(1,1),(2,2)\}.

  • Not reflexive: (3,3)∉R(3,3) \notin R.
  • Symmetric: (1,2)∈R⇒(2,1)∈R(1,2) \in R \Rightarrow (2,1) \in R. ✓
  • Transitive: (1,2)∈R,(2,1)∈R⇒(1,1)∈R(1,2) \in R,(2,1) \in R \Rightarrow (1,1) \in R ✓; (2,1)∈R,(1,2)∈R⇒(2,2)∈R(2,1) \in R,(1,2) \in R \Rightarrow (2,2) \in R ✓.
11Show that the relation R={(P,Q):distance of point P from origin=distance of point Q from origin}R = \{(P, Q) : \text{distance of point } P \text{ from origin} = \text{distance of point } Q \text{ from origin}\} in the set A of points in a plane is an equivalence relation. Further, show that the set of all points related to a point P≠(0,0)P \neq (0,0) is the circle passing through P with origin as centre.Show solution

Let OO denote the origin. For any point PP in the plane, let d(P)d(P) denote the distance of PP from OO.

Reflexive: d(P)=d(P)d(P) = d(P) for any point PP, so (P,P)∈R(P,P) \in R. Hence R is reflexive.

Symmetric: If (P,Q)∈R(P,Q) \in R, then d(P)=d(Q)d(P) = d(Q), so d(Q)=d(P)d(Q) = d(P), giving (Q,P)∈R(Q,P) \in R. Hence R is symmetric.

Transitive: If (P,Q)∈R(P,Q) \in R and (Q,S)∈R(Q,S) \in R, then d(P)=d(Q)d(P) = d(Q) and d(Q)=d(S)d(Q) = d(S), so d(P)=d(S)d(P) = d(S), giving (P,S)∈R(P,S) \in R. Hence R is transitive.

Therefore, R is an equivalence relation.

Set of all points related to P≠(0,0)P \neq (0,0): The set of all points QQ such that (P,Q)∈R(P,Q) \in R is {Q:d(Q)=d(P)}\{Q : d(Q) = d(P)\}, i.e., all points at distance d(P)d(P) from the origin. This is precisely the circle with centre at the origin and radius d(P)d(P), which passes through PP.

12Show that the relation R={(T1,T2):T1 is similar to T2}R = \{(T_1, T_2) : T_1 \text{ is similar to } T_2\} defined in the set A of all triangles is an equivalence relation. Consider right angle triangles T1T_1 (sides 3,4,5), T2T_2 (sides 5,12,13) and T3T_3 (sides 6,8,10). Which triangles among T1T_1, T2T_2 and T3T_3 are related?Show solution

Reflexive: Every triangle is similar to itself. So (T,T)∈R(T,T) \in R for all T∈AT \in A. Hence R is reflexive.

Symmetric: If T1T_1 is similar to T2T_2, then T2T_2 is similar to T1T_1. So (T1,T2)∈R⇒(T2,T1)∈R(T_1,T_2) \in R \Rightarrow (T_2,T_1) \in R. Hence R is symmetric.

Transitive: If T1T_1 is similar to T2T_2 and T2T_2 is similar to T3T_3, then T1T_1 is similar to T3T_3. Hence R is transitive.

Therefore, R is an equivalence relation.

Which triangles are related?

Check if T1T_1 (sides 3,4,5) and T3T_3 (sides 6,8,10) are similar:
36=48=510=12\frac{3}{6} = \frac{4}{8} = \frac{5}{10} = \frac{1}{2}
The ratios of corresponding sides are equal, so T1∼T3T_1 \sim T_3. Hence (T1,T3)∈R(T_1, T_3) \in R.

Check T1T_1 and T2T_2 (sides 5,12,13): 35≠412\dfrac{3}{5} \neq \dfrac{4}{12}, so T1T_1 and T2T_2 are not similar.

Check T2T_2 and T3T_3: 56≠128\dfrac{5}{6} \neq \dfrac{12}{8}, so T2T_2 and T3T_3 are not similar.

Conclusion: T1T_1 and T3T_3 are related to each other.

13Show that the relation R={(P1,P2):P1 and P2 have same number of sides}R = \{(P_1, P_2) : P_1 \text{ and } P_2 \text{ have same number of sides}\} defined in the set A of all polygons 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?Show solution

Reflexive: Any polygon PP has the same number of sides as itself. So (P,P)∈R(P,P) \in R. Hence R is reflexive.

Symmetric: If P1P_1 and P2P_2 have the same number of sides, then P2P_2 and P1P_1 have the same number of sides. So (P1,P2)∈R⇒(P2,P1)∈R(P_1,P_2) \in R \Rightarrow (P_2,P_1) \in R. Hence R is symmetric.

Transitive: If P1P_1 and P2P_2 have the same number of sides, and P2P_2 and P3P_3 have the same number of sides, then P1P_1 and P3P_3 have the same number of sides. Hence R is transitive.

Therefore, R is an equivalence relation.

Set of elements related to triangle T: The triangle T has 3 sides. The set of all elements related to T is the set of all polygons having 3 sides, i.e., the set of all triangles in A.

14Let L be the set of all lines in XY plane and R be the relation in L defined as R={(L1,L2):L1 is parallel to L2}R = \{(L_1, L_2) : L_1 \text{ is parallel to } L_2\}. Show that R is an equivalence relation. Find the set of all lines related to the line y=2x+4y = 2x + 4.Show solution

Reflexive: Every line is parallel to itself (a line is considered parallel to itself). So (L,L)∈R(L,L) \in R for all L∈L \in L. Hence R is reflexive.

Symmetric: If L1∥L2L_1 \parallel L_2, then L2∥L1L_2 \parallel L_1. So (L1,L2)∈R⇒(L2,L1)∈R(L_1,L_2) \in R \Rightarrow (L_2,L_1) \in R. Hence R is symmetric.

Transitive: If L1∥L2L_1 \parallel L_2 and L2∥L3L_2 \parallel L_3, then L1∥L3L_1 \parallel L_3. Hence R is transitive.

Therefore, R is an equivalence relation.

Set of lines related to y=2x+4y = 2x + 4: The given line has slope 2. All lines parallel to it also have slope 2 and are of the form y=2x+cy = 2x + c, where c∈Rc \in \mathbf{R}.

Required set={y=2x+c:c∈R}\text{Required set} = \{y = 2x + c : c \in \mathbf{R}\}

15Let RR be the relation in the set {1,2,3,4}\{1, 2, 3, 4\} given by R={(1,2),(2,2),(1,1),(4,4),(1,3),(3,3),(3,2)}R = \{(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)\}. Choose the correct answer.Show solution

Correct Answer: (B) R is reflexive and transitive but not symmetric.

Reflexive: (1,1),(2,2),(3,3),(4,4)∈R(1,1),(2,2),(3,3),(4,4) \in R. ✓ R is reflexive.

Not Symmetric: (1,2)∈R(1,2) \in R but (2,1)∉R(2,1) \notin R. So R is not symmetric.

Transitive: Check all pairs:

  • (1,2)∈R,(2,2)∈R⇒(1,2)∈R(1,2) \in R, (2,2) \in R \Rightarrow (1,2) \in R ✓
  • (1,3)∈R,(3,2)∈R⇒(1,2)∈R(1,3) \in R, (3,2) \in R \Rightarrow (1,2) \in R ✓
  • (1,3)∈R,(3,3)∈R⇒(1,3)∈R(1,3) \in R, (3,3) \in R \Rightarrow (1,3) \in R ✓
  • (3,2)∈R,(2,2)∈R⇒(3,2)∈R(3,2) \in R, (2,2) \in R \Rightarrow (3,2) \in R ✓

All required pairs are present. R is transitive.

Hence option (B) is correct.

16Let RR be the relation in the set NN given by R={(a,b):a=b−2,b>6}R = \{(a, b) : a = b - 2, b > 6\}. Choose the correct answer.Show solution

Correct Answer: (C) (6,8)∈R(6,8) \in R.

Verification of each option:

For (a,b)∈R(a,b) \in R: we need a=b−2a = b-2 and b>6b > 6.

(A) (2,4)(2,4): b=4b = 4, but 4≯64 \not> 6. ✗

(B) (3,8)(3,8): a=3a = 3, b−2=6≠3b-2 = 6 \neq 3. ✗

(C) (6,8)(6,8): a=6a = 6, b−2=8−2=6b-2 = 8-2 = 6 ✓, and b=8>6b = 8 > 6 ✓. So (6,8)∈R(6,8) \in R. ✓

(D) (8,7)(8,7): b=7>6b = 7 > 6 ✓, but b−2=5≠8b-2 = 5 \neq 8. ✗

Hence option (C) is correct.

Exercise 1.2

1Show that the function f:R∗→R∗f : \mathbf{R}_* \to \mathbf{R}_* defined by f(x)=1xf(x) = \frac{1}{x} is one-one and onto, where R∗\mathbf{R}_* is the set of all non-zero real numbers. Is the result true, if the domain R∗\mathbf{R}_* is replaced by N\mathbf{N} with co-domain being same as R∗\mathbf{R}_*?

Free with a Super Tutor account

2(i)Check the injectivity and surjectivity of f:N→Nf: \mathbf{N} \to \mathbf{N} given by f(x)=x2f(x) = x^2.

Free with a Super Tutor account

2(ii)Check the injectivity and surjectivity of f:Z→Zf: \mathbf{Z} \to \mathbf{Z} given by f(x)=x2f(x) = x^2.

Free with a Super Tutor account

2(iii)Check the injectivity and surjectivity of f:R→Rf: \mathbf{R} \to \mathbf{R} given by f(x)=x2f(x) = x^2.

Free with a Super Tutor account

2(iv)Check the injectivity and surjectivity of f:N→Nf: \mathbf{N} \to \mathbf{N} given by f(x)=x3f(x) = x^3.

Free with a Super Tutor account

2(v)Check the injectivity and surjectivity of f:Z→Zf: \mathbf{Z} \to \mathbf{Z} given by f(x)=x3f(x) = x^3.

Free with a Super Tutor account

3Prove that the Greatest Integer Function f:R→Rf: \mathbf{R} \to \mathbf{R}, given by f(x)=[x]f(x) = [x], is neither one-one nor onto.

Free with a Super Tutor account

4Show that the Modulus Function f:R→Rf: \mathbf{R} \to \mathbf{R}, given by f(x)=∣x∣f(x) = |x|, is neither one-one nor onto.

Free with a Super Tutor account

5Show that the Signum Function f:R→Rf: \mathbf{R} \to \mathbf{R}, given by f(x)={1,x>00,x=0−1,x<0f(x) = \begin{cases} 1, & x > 0 \\ 0, & x = 0 \\ -1, & x < 0 \end{cases} is neither one-one nor onto.

Free with a Super Tutor account

6Let A={1,2,3}A = \{1, 2, 3\}, B={4,5,6,7}B = \{4, 5, 6, 7\} and let f={(1,4),(2,5),(3,6)}f = \{(1, 4), (2, 5), (3, 6)\} be a function from AA to BB. Show that ff is one-one.

Free with a Super Tutor account

7(i)State whether the function f:R→Rf: \mathbf{R} \to \mathbf{R} defined by f(x)=3−4xf(x) = 3 - 4x is one-one, onto or bijective.

Free with a Super Tutor account

7(ii)State whether the function f:R→Rf: \mathbf{R} \to \mathbf{R} defined by f(x)=1+x2f(x) = 1 + x^2 is one-one, onto or bijective.

Free with a Super Tutor account

8Let AA and BB be sets. Show that f:A×B→B×Af: A \times B \to B \times A such that f(a,b)=(b,a)f(a, b) = (b, a) is bijective.

Free with a Super Tutor account

9Let f:N→Nf: \mathbf{N} \to \mathbf{N} be defined by f(n)={n+12,if n is oddn2,if n is evenf(n) = \begin{cases} \frac{n+1}{2}, & \text{if } n \text{ is odd} \\ \frac{n}{2}, & \text{if } n \text{ is even} \end{cases}. State whether ff is bijective. Justify your answer.

Free with a Super Tutor account

10Let A=R−{3}A = \mathbf{R} - \{3\} and B=R−{1}B = \mathbf{R} - \{1\}. Consider the function f:A→Bf: A \to B defined by f(x)=x−2x−3f(x) = \dfrac{x-2}{x-3}. Is ff one-one and onto?

Free with a Super Tutor account

11Let f:R→Rf: \mathbf{R} \to \mathbf{R} be defined as f(x)=x4f(x) = x^4. Choose the correct answer.

Free with a Super Tutor account

12Let f:R→Rf: \mathbf{R} \to \mathbf{R} be defined as f(x)=3xf(x) = 3x. Choose the correct answer.

Free with a Super Tutor account

Miscellaneous Exercise on Chapter 1

1Show that the function f:R→{x∈R:−1<x<1}f: \mathbf{R} \to \{x \in \mathbf{R}: -1 < x < 1\} defined by f(x)=x1+∣x∣f(x) = \dfrac{x}{1+|x|}, x∈Rx \in \mathbf{R} is one-one and onto.

Free with a Super Tutor account

2Show that the function f:R→Rf: \mathbf{R} \to \mathbf{R} given by f(x)=x3f(x) = x^3 is injective.

Free with a Super Tutor account

3Given 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: for subsets A, B in P(X), ARB if and only if A⊂BA \subset B. Is R an equivalence relation on P(X)? Justify your answer.

Free with a Super Tutor account

4Find the number of all onto functions from the set {1,2,3,…,n}\{1, 2, 3, \dots, n\} to itself.

Free with a Super Tutor account

5Let A={−1,0,1,2}A = \{-1, 0, 1, 2\}, B={−4,−2,0,2}B = \{-4, -2, 0, 2\} and f,g:A→Bf, g: A \to B be defined by f(x)=x2−xf(x) = x^2 - x and g(x)=2∣x−12∣−1g(x) = 2\left|x - \frac{1}{2}\right| - 1. Are ff and gg equal?

Free with a Super Tutor account

6Let A={1,2,3}A = \{1, 2, 3\}. Then number of relations containing (1,2)(1, 2) and (1,3)(1, 3) which are reflexive and symmetric but not transitive is (A) 1 (B) 2 (C) 3 (D) 4

Free with a Super Tutor account

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

Free with a Super Tutor account

24 more solved questions in Relations and Functions

They are free with a Super Tutor account, along with practice quizzes and flashcards for this chapter. Free to start, no card needed.

Frequently Asked Questions

What are the important topics in Relations and Functions for Madhya Pradesh Board Class 12 Mathematics?
Key topics in Relations and Functions include Relations and Their Types, Functions: One-One, Onto, and Bijective, Composition of Functions and Inverse, Historical Development of Function. Study these first, then practise questions on each for the Madhya Pradesh Board Class 12 board exam.
Are these NCERT Solutions for Relations and Functions free?
The first 25 of the 49 solutions on this page are open to read. The other 24 are free with a Super Tutor account — signing up is free and needs no card.
How should I revise Relations and Functions for the Madhya Pradesh Board Class 12 board exam?
Learn the core ideas first, then work through the 119 practice questions on Relations and Functions. Revise definitions regularly and use flashcards for quick recall before the exam.

Sources & Official References

Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.

For serious students

Get the full Relations and Functions chapter — start free.

Quizzes, flashcards, an AI doubt solver and a study plan for Madhya Pradesh Board Class 12 Mathematics. Free to start, no card needed.