Opening your dashboard
Class 12 Maths Ch 1 Ex 1.2: Relation and Functions Solutions
12 questions from Exercise 1.2 of Class 12 Maths Chapter 1, Relation and Functions, each solved step by step. Free to read, CBSE 2026-27.
12 questions with solutions
1–5 marks · Easy difficulty
The first 9 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.
- 13 marks
Exercise 1.2 Question 1
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 ?
Solve with AIWritten solution
Part 1: given by
is one-one. Let with . Then
Cross-multiplying gives . So equal images force equal inputs, and is one-one.
is onto. Let be any element of the co-domain . Since , the number is a real number, and it is non-zero, so . For this ,
So every element of the co-domain is an image of some element of the domain, and is onto.
Hence is one-one and onto, that is, a bijection.
Part 2: the domain replaced by , the co-domain still
Call the original function and the new function , .
is still one-one. If , then , which gives .
is not onto. To show a function is not onto we must point to one element of the co-domain that is the image of nothing in the domain. Take . If had a pre-image, there would be a natural number with
and is not a natural number. So no element of is sent to , and has no pre-image under .
Indeed the whole range of is , a small part of ; every other non-zero real number, such as , or , is missed.
Conclusion. The result is not true when the domain is replaced by . With domain and co-domain the function is one-one but not onto, so it is not a bijection.

- 25 marks
Exercise 1.2 Question 2
Check the injectivity and surjectivity of the following functions:
(i) given by
(ii) given by
(iii) given by
(iv) given by
(v) given by
Solve with AIWritten solution
Throughout, injective means one-one and surjective means onto. The squaring rule and the cubing rule behave differently, and the same rule behaves differently on and on , so each part must be checked separately.
(i) ,
Injective. Let with . Then . Since and are natural numbers, , so the other factor must vanish: . Hence is injective.
Not surjective. Take in the co-domain . There is no natural number with , because and , and increases as increases. So has no pre-image.
is injective but not surjective.
(ii) ,
Not injective. Now the domain contains negative integers, and while . Two different inputs share an image.
Not surjective. Take . No integer squares to . (A negative target such as fails too, since a square is never negative.)
is neither injective nor surjective.
(iii) ,
Not injective. but .
Not surjective. Take . For every real we have , so has no real solution and has no pre-image.
is neither injective nor surjective.

The dashed line in the picture is the horizontal line test: on the line meets the curve twice, at and , which is exactly the failure of injectivity in (ii) and (iii); the whole lower half-plane is untouched by the curve, which is the failure of surjectivity.
(iv) ,
Injective. If , then taking cube roots (cubing is strictly increasing, so it is reversible) gives . Hence is injective.
Not surjective. Take in the co-domain . Since and , no natural number cubes to .
is injective but not surjective.
(v) ,
Injective. Again gives . Unlike squaring, cubing keeps the sign, so and are no longer a problem: and are different.
Not surjective. Take . No integer cubes to : the cubes near it are and .
is injective but not surjective.

A horizontal line meets the cubic exactly once, which is why cubing is one-one on every one of these domains.
The five verdicts together:
Part Function Injective? Surjective? (i) on Yes No ( is missed) (ii) on No () No ( is missed) (iii) on No () No ( is missed) (iv) on Yes No ( is missed) (v) on Yes No ( is missed) None of the five is a bijection.
- 33 marks
Exercise 1.2 Question 3
Prove that the Greatest Integer Function , given by , is neither one-one nor onto, where denotes the greatest integer less than or equal to .
Solve with AIWritten solution
is not one-one.
Take and . The greatest integer less than or equal to each of them is , so
Thus although . Two different elements of the domain have the same image, so is not one-one.
(The same thing happens on every unit step: every with is sent to the single value .)
is not onto.
By its definition is always an integer. So the range of is contained in , while the co-domain is the whole of .
Take in the co-domain. If had a pre-image, there would be a real number with ; but is an integer and is not. So has no pre-image, and is not onto.
Conclusion. The Greatest Integer Function is neither one-one nor onto.

The picture shows both failures at once: each horizontal step is flat, so a whole interval of inputs shares one output (not one-one), and the graph only ever sits at integer heights, so no non-integer height is reached (not onto).
- 43 marks
Exercise 1.2 Question 4
Show that the Modulus Function , given by , is neither one-one nor onto, where is , if is positive or and is , if is negative.
Solve with AIWritten solution
By definition,
is not one-one.
Take and . Since we use the second line, ; since we use the first, . So
Two different inputs have the same image, so is not one-one. (Any non-zero gives the same clash, because .)
is not onto.
For every real number we have , so the range of is , while the co-domain is the whole of .
Take in the co-domain. If it had a pre-image there would be a real with , which is impossible since a modulus is never negative. So has no pre-image, and is not onto.
Conclusion. The Modulus Function is neither one-one nor onto.

The dashed horizontal line at meets the V-shape at the two points and , which is the failure of one-one; no part of the graph lies below the -axis, which is the failure of onto.
- 53 marks
Exercise 1.2 Question 5
Show that the Signum Function , given by
is neither one-one nor onto.
Solve with AIWritten solution
is not one-one.
Take and . Both are positive, so both fall in the first line of the definition:
So although , and is not one-one. In fact every positive number is sent to and every negative number is sent to , so infinitely many inputs share each of these two images.
is not onto.
Whatever is, is one of the three numbers , , . So the range of is the three-element set , while the co-domain is the whole of .
Take in the co-domain. Since is not one of , , , there is no real with , so has no pre-image. Hence is not onto.
Conclusion. The Signum Function is neither one-one nor onto.

The graph is made of just three pieces sitting at heights , and : each flat piece is a whole half-line of inputs with a single image (not one-one), and every other height is empty (not onto).
- 62 marks
Exercise 1.2 Question 6
Let , and let be a function from to . Show that is one-one.
Solve with AIWritten solution
Reading the ordered pairs of gives the three values
To prove is one-one we check that no two distinct elements of share an image. Since has only three elements, there are just three pairs to compare:
The images , , are all different, so distinct elements of have distinct images in .
Hence is one-one (injective).

Notice the shape in the diagram: no two arrows land on the same dot, which is what one-one means. Here is also into rather than onto, because receives no arrow — but the question only asks for one-one, and that is settled by the three distinct images.
- 74 marks
Exercise 1.2 Question 7
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
Solve with AIWritten solution
(i) ,
One-one. Let with . Then
So is one-one.
Onto. Let be any element of the co-domain. Solving for gives
which is a real number for every real , so it lies in the domain. Checking it,
So every real number is an image, and is onto.
Being both one-one and onto, is bijective.

The graph is a straight line of slope : any horizontal line crosses it exactly once, which is one-one and onto together.
(ii) ,
Not one-one. Take and . Then
so although . (In general gives , that is , which does not force .)
Not onto. For every real we have , so
The range is therefore . Take in the co-domain: would need , which no real number satisfies, so has no pre-image.
Being neither one-one nor onto, is not bijective.

The dashed line at meets the parabola twice (not one-one), and nothing on the graph lies below (not onto).
- 83 marks
Exercise 1.2 Question 8
Let and be sets. Show that such that is bijective function.
Solve with AIWritten solution
The rule takes an ordered pair and swaps its two entries. A typical element of the domain is with and , and its image has first entry in and second entry in , so it really does lie in . The function is therefore well defined.
is one-one.
Let and be elements of with
that is, . Two ordered pairs are equal exactly when their corresponding entries are equal, so
Hence , and is one-one.
is onto.
Let be any element of the co-domain , so and . Then is an element of , and
So every element of has a pre-image in , and is onto.
Conclusion. is one-one and onto, hence is a bijective function.

The dashed arrow in the picture is the swap performed a second time: the map undoes , which is another way of seeing that is a bijection.
- 93 marks
Exercise 1.2 Question 9
Let be defined by
State whether the function is bijective. Justify your answer.
Solve with AIWritten solution
It helps to compute the first few values before arguing. The table below lists them.
1 2 3 4 5 6 7 8 1 1 2 2 3 3 4 4 The pattern is already visible: the values come in equal pairs.
is not one-one.
Take (odd) and (even). Then
So although , and is not one-one. (The same clash happens at every pair: .)
is onto.
Let be any natural number in the co-domain. Consider . Since , the number is a natural number, and it is even, so the second line of the definition applies:
So has the pre-image . As was arbitrary, every element of the co-domain is an image, and is onto.
This one line settles surjectivity for every at once — odd or even, and including , which takes the pre-image — so no case split is needed.
Conclusion.
is onto but not one-one. A bijective function must be both, so is not bijective.

The right-hand panel of the picture is exactly this function drawn for to : each of the targets to has two arrows coming into it, so the map is onto but not one-one. The left-hand panel shows a different parity rule that is a bijection, which is worth comparing so that "the definition splits into odd and even" is not mistaken for a reason either way.
- 103 marks
Exercise 1.2 Question 10
Let and . Consider the function defined by . Is one-one and onto? Justify your answer.
- 111 mark
Exercise 1.2 Question 11
Let be defined as . Choose the correct answer.
- 121 mark
Exercise 1.2 Question 12
Let be defined as . Choose the correct answer.
Stuck on one of these? Work it through out loud
A finished solution tells you the answer. The AI tutor takes one question of Ex 1.2 at a time and works it with you until you can do the next one on your own.
- Ask it out loud, in your own words
- It gives you the next step, not the answer
- Stuck on part (ii)? Start there
The other exercise in Relation and Functions
Every exercise in Class 12 Maths Ch 1, solved the same way. Or open the whole chapter on one page.
What students ask about Ex 1.2
How many questions are in Ex 1.2 of Class 12 Maths?
Ex 1.2 has 12 questions, 2 of them multiple choice. Every one is solved step by step on this page, free to read.
Where does Ex 1.2 come in Chapter 1?
It is the second of the 2 exercises in Class 12 Maths Chapter 1, Relation and Functions. It is the last one in the chapter.
How many marks is Ex 1.2 worth?
The 12 questions here carry 34 marks between them, at easy difficulty overall. Marks are shown on each question so you can see what a full answer needs.
Are these Ex 1.2 solutions free?
Yes. Every question and its full working is free to read, with no account needed.
Can I download Ex 1.2 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 2026-27 syllabus, and readable on a phone. Use your browser's print option if you want it on paper.
