Opening your dashboard
Class 12 Maths Chapter 1: Relation and Functions Solutions
28 textbook questions with step-by-step answers, free to read, for CBSE 2026-27.
2 exercises in Ch 1
The numbered NCERT exercises, so you can open the one you were set rather than scrolling for it.
Get talked through Ch 1, not just shown the answer
Reading a finished solution is not the same as being able to do it. The AI tutor takes one question at a time and works it with you, in your own words, until you can.
- Ask it out loud, in your own words
- It gives you the next step, not the answer
- Stuck on part (ii)? Start there
More ways to study this chapter
The same chapter asked three other ways. Practise it, revise it, and see what the board has set on Ch 1 before.
- Competency-Based Questions (CBQ)The applied, case-study format that carries half the marks in a CBSE paper.80questionsOpen
- Previous Year QuestionsQuestions that have actually appeared in board papers, each tagged with its year.37questionsOpen
- Practice QuestionsExtra questions per chapter, for when one attempt at a method is not enough.30questionsOpen
28 questions with solutions
1–9 marks · Easy difficulty
The first 3 solutions are on this page. This chapter is a long one, so the rest open on their own page to keep this one quick to load.
Exercise 1.1
Open Exercise 1.1- 19 marks
Question 1
Determine whether each of the following relations are reflexive, symmetric and transitive:
(i) Relation in the set defined as
(ii) Relation in the set of natural numbers defined as
(iii) Relation in the set as
(iv) Relation in the set of all integers defined as
(v) Relation in the set of human beings in a town at a particular time given by
(a)
(b)
(c)
(d)
(e)
Solve with AIWritten solution
(i) ,
First write the condition as a rule. means .
So a pair belongs to exactly when is three times — and both and must lie in , because is a relation in .
Take each in turn:
- , and , so
- , and , so
- , and , so
- , and , so
- , but , so nothing is contributed; the same happens for every
Hence
Reflexive? We need for every . For the condition reads , i.e. , i.e. — and . So not a single pair is in . For instance , because .
Therefore is not reflexive.
Symmetric? We need: whenever , also . Test the pair . Is ? That needs , but , so .
One counterexample is enough. Therefore is not symmetric.
Transitive? We need: whenever and , also . Here and , so transitivity would force . But , so .
Therefore is not transitive.
Conclusion. is neither reflexive, nor symmetric, nor transitive.
The picture below shows the four pairs as arrows, together with the three arrows that are missing.

(ii) ,
The condition restricts the first entry to (natural numbers only), and then :
So
Reflexive? would need , which is false for every . Also . So is not reflexive.
Symmetric? , but : it would need (false) and (also false). So is not symmetric.
Transitive? Transitivity only says something when two pairs link up, i.e. when and for the same middle element . The second entries in are ; the first entries are . No number is both, because a first entry must satisfy . So there is no linked pair at all, and the condition "if ... then ..." has nothing to check.
A statement of the form "if then " is true whenever never happens — this is called vacuous truth. Therefore is transitive.
Conclusion. is transitive, but neither reflexive nor symmetric.
(iii) ,
List, for each , the multiples of that lie in :
That is pairs.
Reflexive? Every number divides itself, since . So for all six elements: .
Therefore is reflexive.
Symmetric? because . But , because is not a multiple of .
Therefore is not symmetric.
Transitive? Suppose and . Then and for some positive integers and . Substituting,
and is a positive integer, so is divisible by , i.e. . For example and , and indeed .
Therefore is transitive.
Conclusion. is reflexive and transitive, but not symmetric.

(iv) ,
If and are integers then is automatically an integer. So the condition is satisfied by every pair, and .
Reflexive? , which is an integer, so for every . Reflexive.
Symmetric? If is an integer, then is also an integer, so . Symmetric.
Transitive? If and are integers, then their sum
is an integer too, so . Transitive.
Conclusion. is reflexive, symmetric and transitive, so it is an equivalence relation (it is the whole of ).
(v) is the set of human beings in a town at a particular time
(a)
Reflexive: works at the same place as , so . Reflexive.
Symmetric: if and work at the same place, then and work at the same place — the phrase is unchanged when the two names are swapped. Symmetric.
Transitive: if works where works, and works where works, then and work at that same place. Transitive.
So is an equivalence relation; its classes are the workplaces.
(b)
This is the same pattern as (a) with "locality" in place of "workplace".
Reflexive: lives in the same locality as . Reflexive.
Symmetric: the condition reads the same both ways round. Symmetric.
Transitive: same locality as , and same locality as , gives the same locality for and . Transitive.
So is an equivalence relation; its classes are the localities.
(c)
Write for the height of in centimetres. Then means .
Reflexive: would need , i.e. , which is false. Not reflexive.
Symmetric: if , then , so is cm shorter than , not taller. So . Not symmetric.
Transitive: if and , then
so is cm taller than , not cm, and . Not transitive.
Conclusion. Neither reflexive, nor symmetric, nor transitive.
(d)
Reflexive: nobody is her own wife, so . Not reflexive.
Symmetric: if is the wife of , then is the husband of , so is not the wife of and . Not symmetric.
Transitive: here we must be careful, and argue exactly what the definition demands. Transitivity says:
For the "if" part to happen we would need to be the wife of and to be the wife of at the same time. But if is the wife of , then is a husband, so is nobody's wife; there is no with .
So the hypothesis of the transitivity statement is never satisfied: there is not one linked pair in . An implication "if then " counts as true whenever is never true, because there is no case in which it could fail. This is vacuous truth, the same idea used in part (ii).
Therefore is transitive — vacuously, not because any pair had to be checked.
Conclusion. is transitive, but neither reflexive nor symmetric.
(e)
Reflexive: nobody is his own father, so . Not reflexive.
Symmetric: if is the father of , then is a child of and cannot be the father of . Not symmetric.
Transitive: if is the father of and is the father of , then is the grandfather of , not the father, so . Unlike (d), here the hypothesis really can happen (three generations), and the conclusion fails. Not transitive.
Conclusion. Neither reflexive, nor symmetric, nor transitive.
The nine verdicts collected together:
Part Relation Reflexive Symmetric Transitive (i) on No No No (ii) , on No No Yes (vacuously) (iii) divisible by on Yes No Yes (iv) an integer on Yes Yes Yes (v)(a) same workplace Yes Yes Yes (v)(b) same locality Yes Yes Yes (v)(c) exactly 7 cm taller No No No (v)(d) is wife of No No Yes (vacuously) (v)(e) is father of No No No - 23 marks
Question 2
Show that the relation in the set of real numbers, defined as is neither reflexive nor symmetric nor transitive.
Solve with AIWritten solution
The relation is on the set of real numbers.
To show a property fails, one counterexample is enough. So for each property we hunt for a single bad case.
Not reflexive
Reflexivity would mean for every real , that is
Take . Then , and
So , and is not reflexive.
It is worth seeing where it goes wrong. rearranges to , i.e. , which holds for and for . So reflexivity fails exactly on the open interval .

Not symmetric
Symmetry would mean: whenever , also .
Take and :
- , because is true.
- , because is false.
So is not symmetric.
Not transitive
Transitivity would mean: whenever and , also .
Take , , :
- , because is true.
- , because is true.
- , because is false.
Squaring can shrink a number as well as grow it, so the two steps do not chain. Hence is not transitive.
Conclusion. is neither reflexive, nor symmetric, nor transitive.
- 33 marks
Question 3
Check whether the relation defined in the set as is reflexive, symmetric or transitive.
Solve with AIWritten solution
Let and , a relation in .
Write out first. For each take and keep the pair only if is also in :
- , so
- , so
- , so
- , so
- , so
- , so nothing is added
Hence
Reflexive? We would need for every , i.e. , i.e. , which is false. Concretely .
Therefore is not reflexive.
Symmetric? , because . Is ? That needs , which is false, so .
Therefore is not symmetric.
Transitive? and , so transitivity would force . But needs , which is false, so .
In general, and give , which is never .
Therefore is not transitive.
Conclusion. is neither reflexive, nor symmetric, nor transitive.
Drawn as arrows, is one plain chain: no loops at the nodes, no arrow pointing back, and no shortcut arrow that skips a step.

- 43 marks
Question 4
Show that the relation in defined as , is reflexive and transitive but not symmetric.
- 53 marks
Question 5
Check whether the relation in defined by is reflexive, symmetric or transitive.
- 63 marks
Question 6
Show that the relation in the set given by is symmetric but neither reflexive nor transitive.
- 73 marks
Question 7
Show that the relation in the set of all the books in a library of a college, given by is an equivalence relation.
- 84 marks
Question 8
Show that the relation in the set given by , is an equivalence relation. Show that all the elements of are related to each other and all the elements of are related to each other. But no element of is related to any element of .
- 95 marks
Question 9
Show that each of the relations in the set , given by
(i)
(ii)
is an equivalence relation. Find the set of all elements related to in each case.
- 105 marks
Question 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.
- 115 marks
Question 11
Show that the relation in the set of points in a plane given by
is an equivalence relation. Further, show that the set of all points related to a point is the circle passing through with origin as centre.
- 125 marks
Question 12
Show that the relation defined in the set of all triangles as
is an equivalence relation. Consider three right angle triangles with sides , with sides and with sides . Which triangles among , and are related?
- 135 marks
Question 13
Show that the relation defined in the set of all polygons as
is an equivalence relation. What is the set of all elements in related to the right angle triangle with sides and ?
- 144 marks
Question 14
Let be the set of all lines in plane and be the relation in defined as
.
Show that is an equivalence relation. Find the set of all lines related to the line .
- 151 mark
Question 15
Let be the relation in the set given by
.
Choose the correct answer.
- 161 mark
Question 16
Let be the relation in the set given by
.
Choose the correct answer.
Exercise 1.2
Open Exercise 1.2- 173 marks
Question 17
Show that the function defined by is one-one and onto, where is the set of all non-zero real numbers. Is the result true, if the domain is replaced by with co-domain being same as ?
- 185 marks
Question 18
Check the injectivity and surjectivity of the following functions:
(i) given by
(ii) given by
(iii) given by
(iv) given by
(v) given by
- 193 marks
Question 19
Prove that the Greatest Integer Function , given by , is neither one-one nor onto, where denotes the greatest integer less than or equal to .
- 203 marks
Question 20
Show that the Modulus Function , given by , is neither one-one nor onto, where is , if is positive or and is , if is negative.
- 213 marks
Question 21
Show that the Signum Function , given by
is neither one-one nor onto.
- 222 marks
Question 22
Let , and let be a function from to . Show that is one-one.
- 234 marks
Question 23
In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.
(i) defined by
(ii) defined by
- 243 marks
Question 24
Let and be sets. Show that such that is bijective function.
- 253 marks
Question 25
Let be defined by
State whether the function is bijective. Justify your answer.
- 263 marks
Question 26
Let and . Consider the function defined by . Is one-one and onto? Justify your answer.
- 271 mark
Question 27
Let be defined as . Choose the correct answer.
- 281 mark
Question 28
Let be defined as . Choose the correct answer.
What Class 12 Maths Ch 1 covers
The sections of the chapter, in the order the book takes them. Every question above comes from one of these.
- 01Types of Relations
- 02Types of Functions
- 03Composition Of Functions And Invertible Function
Ch 1 in past CBSE papers
The same chapter as the board has actually asked it. These are worded differently from the textbook exercise, which is the point of reading them.
- 11 mark
Board paper question 1
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
Solve with AIAnswer
(A) 720
(B) 120
(C) 30
- Correct
(D) 0
Option (D) is correct.
Explanation: We know that, if A and B are two non-empty finite sets containing m and n elements, respectively, then the number of one-one and onto mapping from A to B is
- n! if m = n
- 0 if m ≠ n
Given that, m = 5 and n = 6
∴ m ≠ n
Number of one-one and onto mapping = 0
Why the other options are wrong:
- (A) 720 is the number of one-one maps from to . None of them is onto, because the 5 elements of can reach only 5 of the 6 elements of .
- (B) 120 is the number of one-one onto maps between two sets that both have 5 elements. Here has 6 elements, so this count does not apply.
- (C) 30 is the number of ordered pairs in , not a number of functions.
- 21 mark
Board paper question 2
Let A = {3, 5}. Then number of reflexive relations of A is:
Solve with AIAnswer
(A) 2
- Correct
(B) 4
(C) 0
(D) 8
Option (B) is correct.
Explanation: A reflexive relation on must contain and . The only free choices are the other two pairs of , namely and . Each can be in or out, so there are reflexive relations:
, , and .
In general, a set with elements has such free pairs, so the number of reflexive relations is . Here :
Why the other options are wrong:
- (A) 2 treats only one of the two pairs , as free.
- (C) 0 is false: is already a reflexive relation on .
- (D) 8 treats three pairs as free, but only two are.
- 31 mark
Board paper question 3
Let be a relation in the set given by
Choose the correct answer.
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: The set-builder form puts two conditions on a pair. For to belong to we need the equation to hold and the inequality to hold. Test each option against both.
Option Is ? Is ? In ? (A) , and — fails — holds No (B) — holds — holds Yes (C) , and — fails — holds No (D) — holds — fails No Only passes both tests, so (B) is the answer.
Option (D) is the trap worth naming. It satisfies the equation exactly, and a student who checks only the equation will choose it. The second condition is what kills it: with we do not have , so the pair is outside however well the equation fits.
Options (A) and (C) fail the other way round. Both have , so the inequality is fine, but the arithmetic does not come out right — would need and would need .
- 41 mark
Board paper question 4
Let set and a relation is defined in as:
, then minimum ordered pairs which should be added in relation to make it reflexive and symmetric are:
Solve with AIAnswer
(A)
(B)
(C)
- Correct
(D)
Option (D) is correct.
Explanation: on . For to be reflexive, it must contain — is already present, so and must be added.
For to be symmetric, every pair needs its reverse: requires ; requires ; is already self-paired.
So the minimum pairs to add are , , , and .
Why the other options are wrong:
- (A) leaves out , so is still not reflexive. It also leaves out , the reverse of , and adds without its reverse , so is not symmetric.
- (B) makes reflexive, but is still without its reverse , so is not symmetric.
- (C) also leaves out , and adds without , so is not symmetric.
- 51 mark
Board paper question 5
If is a relation in set Z, then domain of is:
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: Given,
An integer is in the domain of exactly when some integer gives .
Since , any such must satisfy , so . Conversely, if , then works, because .
So the domain is , and the integers with are .
Thus, domain of = .
Why the other options are wrong:
- (A) drops and . They satisfy just as and do; for example .
- (C) drops and for the same reason; for example .
- (D) is the set of integers with , which comes from wrongly putting . But , so is in the domain.
- 61 mark
Board paper question 6
A relation in set is defined as . Which of the following ordered pair in shall be removed to make it an equivalence relation in ?
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation:
We are given on . Test the three properties on as it stands.
Reflexive? Yes. The loops , and are all present, so every element of is related to itself.
Symmetric? No. but . This is the only ordered pair that breaks the property.
Transitive? Yes. Apart from the loops, the only chain we can form through a common middle element is followed by , and it requires — which is already there. Nothing is missing, so is transitive as given.
So fails exactly one property, symmetry, and the single pair responsible is . Deleting it leaves , the identity relation on , which is reflexive, symmetric and transitive — an equivalence relation.
Here is what each choice would leave behind:
Pair removed What is left Verdict (A) is gone, so not reflexive (B) reflexive, symmetric and transitive (C) not reflexive, and still not symmetric (D) not reflexive, and still not symmetric Options (A), (C) and (D) each delete a loop, which destroys reflexivity, and none of them repairs the missing . Only (B) works.
All 37 board paper questions for this chapter, solved the same way.
Class 12 Maths Ch 1 questions students ask
How many questions are there in Class 12 Maths Ch 1?
28 questions, across 2 exercises (Exercise 1.1, Exercise 1.2). Every one is solved step by step on this page.
Are these Class 12 Maths solutions free?
Yes. Every question and its full working is free to read, with no account needed.
Can I download the Class 12 Maths Ch 1 solutions as a PDF?
There is no PDF to download. Every solution is on this page instead, which means it is searchable, always the current syllabus, and readable on a phone. Use your browser's print option if you want it on paper.
