In the previous exercise, we learned the basic concepts of relations. And with this exercise of Relations and Functions 1.2, we move towards one of the most important topics related to functions i.e. different types of functions.
You already studied special functions like identity function, constant function, polynomial function, rational function, modulus function and signum function along with their graphs in class 11. Now, the focus shifts towards understanding how elements of one set are mapped to another set through a function.
The main concepts discussed in this exercise are one-one (injective), onto (surjective) and bijective functions. These concepts are extremely important because they are later used in inverse functions, matrices, calculus and many other higher mathematical topics.
In this exercise, you will solve questions based on identifying types of functions, checking whether a function is one-one, onto or both.
Key Concepts
1. One-One (Injective) Function
A function f:A\to B is called a one-one (injective) function if different elements of the domain have different images.
Mathematically,
f(x_1)=f(x_2)\Rightarrow x_1=x_2
for all x_1,x_2\in A .
Example:
The function f:\mathbb{R}\to\mathbb{R} defined by
f(x)=2x+1
is one-one because different values of x give different outputs.
If a function is not one-one, then it is called a many-one function.
2. Onto (Surjective) Function
A function f:A\to B is called an onto (surjective) function if every element of the codomain B has at least one pre-image in A .
In other words, every element of B is mapped by some element of A .
Important Remark:
A function is onto if and only if
\text{Range of }f=\text{Codomain of }f
Example:
The function f:\mathbb{R}\to\mathbb{R} defined by
f(x)=x^3
is onto because every real number has a pre-image under f .
3. Bijective Function
A function f:A\to B is called bijective if it is both one-one and onto.
Thus, a bijective function satisfies:
f(x_1)=f(x_2)\Rightarrow x_1=x_2
and
\text{Range of }f=\text{Codomain of }f
Example:
The function f:\mathbb{R}\to\mathbb{R} defined by
f(x)=x+5
is bijective.
4. Relation Between Number of Elements of Sets
Let f:A\to B be a function between two finite sets.
If f is one-one, then
n(A)\leq n(B)
If f is onto, then
n(A)\geq n(B)
If f is bijective, then
n(A)=n(B)
5. Inverse of a Function
A function has an inverse if and only if it is bijective.
That is, if f:A\to B is bijective, then there exists a function
f^{-1}:B\to A
such that
f^{-1}(f(x))=x
for all x\in A .
Let us now solve all the NCERT questions step by step in this exercise of Relations and Functions 1.2.
In the first question, carefully observe how the domain and codomain affect the nature of the function.
Question 1: Relations and Functions 1.2
1. Show that the function f:\mathbb{R}_*\to\mathbb{R}_* defined by f(x)=\frac{1}{x} is one-one and onto, where \mathbb{R}_* is the set of all non-zero real numbers. Is the result true if the domain \mathbb{R}_* is replaced by \mathbb{N} with co-domain being same as \mathbb{R}_* ?
Solution
We are given the function
f:\mathbb{R}_*\to\mathbb{R}_*
defined by
f(x)=\frac{1}{x}
where \mathbb{R}_* denotes the set of all non-zero real numbers.
We will check whether the function is one-one and onto.
One-One:
Let
f(x_1)=f(x_2)
Then
\frac{1}{x_1}=\frac{1}{x_2}
Cross multiplying, we get
x_1=x_2
Therefore, the function is one-one (injective).
Onto:
Let y\in\mathbb{R}_* .
We need to show that there exists x\in\mathbb{R}_* such that
f(x)=y
Now,
y=\frac{1}{x}
gives
x=\frac{1}{y}
Since y\neq0 , we have \frac{1}{y}\in\mathbb{R}_* .
Thus, for every y\in\mathbb{R}_* , there exists x=\frac{1}{y} such that
f(x)=y
Therefore, the function is onto (surjective).
Hence, the function is both one-one and onto, i.e., it is bijective.
Now, consider the function
f:\mathbb{N}\to\mathbb{R}_*
defined by
f(x)=\frac{1}{x}
One-One:
Suppose
f(x_1)=f(x_2)
Then
\frac{1}{x_1}=\frac{1}{x_2}
which gives
x_1=x_2
Therefore, the function is still one-one.
Onto:
The range of the function is
\left\{1,\frac12,\frac13,\frac14,\dots\right\}
which is not equal to \mathbb{R}_* .
For example, there is no natural number x such that
\frac{1}{x}=2
Therefore, the function is not onto.
Hence, when the domain is changed to \mathbb{N} , the function remains one-one but is not onto.
The following question is important because it demonstrates the standard method of proving a function is one-one or onto.
Question 2: Types of Function
2. Check the injectivity and surjectivity of the following functions:
(i) f:\mathbb{N}\to\mathbb{N} given by f(x)=x^2
Solution
We are given
f(x)=x^2
where
f:\mathbb{N}\to\mathbb{N}
Injective (One-One):
Suppose
f(x_1)=f(x_2)
Then
x_1^2=x_2^2
Taking square roots, we get
x_1=x_2
since x_1,x_2\in\mathbb{N} .
Therefore, the function is one-one.
Surjective (Onto):
The range of the function is
\{1,4,9,16,\dots\}
which does not contain all natural numbers.
For example, 2\in\mathbb{N} , but there is no x\in\mathbb{N} such that
x^2=2
Therefore, the function is not onto.
Hence, the function is one-one but not onto.
(ii) f:\mathbb{Z}\to\mathbb{Z} given by f(x)=x^2
Solution
We are given
f(x)=x^2
where
f:\mathbb{Z}\to\mathbb{Z}
Injective (One-One):
Consider
f(2)=2^2=4
and
f(-2)=(-2)^2=4
Since
f(2)=f(-2)
but
2\neq-2
therefore, the function is not one-one.
Surjective (Onto):
The range of the function contains only non-negative perfect squares.
Negative integers like -1,-2,-3 are not images of any integer.
Also, integers like 2 or 3 are not perfect squares.
Therefore, the function is not onto.
Hence, the function is neither one-one nor onto.
(iii) f:\mathbb{R}\to\mathbb{R} given by f(x)=x^2
Solution
We are given
f(x)=x^2
where
f:\mathbb{R}\to\mathbb{R}
Injective (One-One):
Consider
f(2)=4
and
f(-2)=4
Since different inputs have the same image, the function is not one-one.
Surjective (Onto):
For every real number x , we have
x^2\geq0
Thus, negative real numbers are not images of any real number.
For example, there is no x\in\mathbb{R} such that
x^2=-1
Therefore, the function is not onto.
Hence, the function is neither one-one nor onto.
(iv) f:\mathbb{N}\to\mathbb{N} given by f(x)=x^3
Solution
We are given
f(x)=x^3
where
f:\mathbb{N}\to\mathbb{N}
Injective (One-One):
Suppose
f(x_1)=f(x_2)
Then
x_1^3=x_2^3
Taking cube roots, we get
x_1=x_2
Therefore, the function is one-one.
Surjective (Onto):
The range of the function is
\{1,8,27,64,\dots\}
which does not contain all natural numbers.
For example, 2 is not the cube of any natural number.
Therefore, the function is not onto.
Hence, the function is one-one but not onto.
(v) f:\mathbb{Z}\to\mathbb{Z} given by f(x)=x^3
Solution
We are given
f(x)=x^3
where
f:\mathbb{Z}\to\mathbb{Z}
Injective (One-One):
Suppose
f(x_1)=f(x_2)
Then
x_1^3=x_2^3
Taking cube roots, we get
x_1=x_2
Therefore, the function is one-one.
Surjective (Onto):
The range of the function contains only perfect cubes.
Integers like 2 , 3 and 5 are not perfect cubes.
Therefore, the function is not onto.
Hence, the function is one-one but not onto.
You may already be following Maths Better for NCERT Solutions on the topics like Matrices and Determinants. Similarly, this exercise on Relations and Functions for Class 12 Maths is designed to strengthen your concepts and improve step-by-step problem-solving skills.
Now, let’s move on to the next question of Relations and Functions 1.2.
Question 3: Relations and Functions 1.2
3. Prove that the Greatest Integer Function f:\mathbb{R}\to\mathbb{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
We are given the greatest integer function
f:\mathbb{R}\to\mathbb{R}
defined by
f(x)=[x]
where [x] denotes the greatest integer less than or equal to x .
We will check whether the function is one-one and onto.
One-One (Injective):
A function is one-one if different elements of the domain have different images.
Consider the real numbers
1.2 \text{ and } 1.8
Now,
f(1.2)=[1.2]=1
and
f(1.8)=[1.8]=1
Thus,
f(1.2)=f(1.8)
but
1.2\neq1.8
Therefore, the function is not one-one.
Onto (Surjective):
The codomain of the function is \mathbb{R} .
But the greatest integer function gives only integer values.
Thus, the range of the function is
\mathbb{Z}
which is not equal to the codomain \mathbb{R} .
For example, there is no real number x such that
[x]=\frac12
Therefore, the function is not onto.
Hence, the greatest integer function is neither one-one nor onto.
Question 4: Exercise 1.2
4. Show that the Modulus Function f:\mathbb{R}\to\mathbb{R} , given by f(x)=|x| , is neither one-one nor onto, where
|x|=\begin{cases} x, & x\geq0 \\ \\ -x, & x<0 \end{cases}
Solution
We are given the modulus function
f:\mathbb{R}\to\mathbb{R}
defined by
f(x)=|x|
where
|x|=\begin{cases} x, & x\geq0 \\ \\ -x, & x<0 \end{cases}
We will check whether the function is one-one and onto.
One-One (Injective):
A function is one-one if different elements of the domain have different images.
Consider the real numbers
2 \text{ and } -2
Now,
f(2)=|2|=2
and
f(-2)=|-2|=2
Thus,
f(2)=f(-2)
but
2\neq-2
Therefore, the function is not one-one.
Onto (Surjective):
For every real number x , we have
|x|\geq0
Thus, the range of the function contains only non-negative real numbers.
Negative real numbers are not images of any real number.
For example, there is no x\in\mathbb{R} such that
|x|=-3
Therefore, the function is not onto.
Hence, the modulus function is neither one-one nor onto.
Question 5: Relations and Functions 1.2
5. Show that the Signum Function f:\mathbb{R}\to\mathbb{R} , given by
f(x)=\begin{cases} 1, & x>0 \\ \\ 0, & x=0 \\ \\ -1, & x<0 \end{cases}
is neither one-one nor onto.
Solution
We are given the signum function
f:\mathbb{R}\to\mathbb{R}
defined by
f(x)=\begin{cases} 1, & x>0 \\ \\ 0, & x=0 \\ \\ -1, & x<0 \end{cases}
We will check whether the function is one-one and onto.
One-One (Injective):
A function is one-one if different elements of the domain have different images.
Consider the real numbers
2 \text{ and } 5
Now,
f(2)=1
and
f(5)=1
Thus,
f(2)=f(5)
but
2\neq5
Therefore, the function is not one-one.
Onto (Surjective):
The range of the signum function is
\{-1,0,1\}
which is not equal to the codomain \mathbb{R} .
For example, there is no real number x such that
f(x)=2
Therefore, the function is not onto.
Hence, the signum function is neither one-one nor onto.
Special functions like modulus and signum functions are frequently asked in board exams and competitive exams.
Question 6: Relations and Functions 1.2
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
We are given the function
f:A\to B
where
A=\{1,2,3\} \text{ and } B=\{4,5,6,7\}
The function is defined as
f=\{(1,4),(2,5),(3,6)\}
This means:
- f(1)=4
- f(2)=5
- f(3)=6
We observe that different elements of the domain have different images.
That is,
f(1)\neq f(2),\quad f(2)\neq f(3),\quad f(1)\neq f(3)
since
4\neq5,\quad 5\neq6,\quad 4\neq6
Thus, no two distinct elements of A have the same image in B .
Therefore, the function f is one-one (injective).
Question 7: Ex 1.2 Relations and Functions
7. In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.
(i) f:\mathbb{R}\to\mathbb{R} defined by f(x)=3-4x
Solution
We are given
f(x)=3-4x
where
f:\mathbb{R}\to\mathbb{R}
We will check whether the function is one-one and onto.
One-One (Injective):
Suppose
f(x_1)=f(x_2)
Then
3-4x_1=3-4x_2
Subtracting 3 from both sides, we get
-4x_1=-4x_2
Dividing by -4 , we get
x_1=x_2
Therefore, the function is one-one.
Onto (Surjective):
Let y\in\mathbb{R} .
We need to find x\in\mathbb{R} such that
f(x)=y
Now,
y=3-4x
gives
4x=3-y
Therefore,
x=\frac{3-y}{4}
Since \frac{3-y}{4}\in\mathbb{R} for every real number y, therefore. the function is onto.
Hence, the function is both one-one and onto.
Therefore, the function is bijective.
(ii) f:\mathbb{R}\to\mathbb{R} defined by f(x)=1+x^2
Solution
We are given
f(x)=1+x^2
where
f:\mathbb{R}\to\mathbb{R}
We will check whether the function is one-one and onto.
One-One (Injective):
Consider
f(2)=1+2^2=5
and
f(-2)=1+(-2)^2=5
Thus,
f(2)=f(-2)
but
2\neq-2
Therefore, the function is not one-one.
Onto (Surjective):
Since
x^2\geq0
for every x\in\mathbb{R} , we have
1+x^2\geq1
Thus, the range of the function is
[1,\infty)
which is not equal to the codomain \mathbb{R} .
For example, there is no real number x such that
1+x^2=0
Therefore, the function is not onto.
Hence, the function is neither one-one nor onto.
Important Note:
To prove that a function is not one-one, students often use a counterexample such as finding two different inputs having the same output.
However, the standard algebraic method is to start with
f(x_1)=f(x_2)
and simplify it.
If the result gives a unique solution
x_1=x_2
then the function is one-one.
But if we get more than one possibility, such as
x_1=x_2 \text{ or } x_1=-x_2
then the function is many-one because equal outputs are possible for different inputs.
Example: For f(x)=1+x^2 ,
f(x_1)=f(x_2)
gives
1+x_1^2=1+x_2^2
x_1^2=x_2^2
x_1=\pm x_2
Since this does not give only x_1=x_2 , the function is many-one.
NCERT Class 12 Maths includes several important exercises across both Part 1 and Part 2, and I’ll cover them one by one with clear explanations and step-by-step solutions. Many of these questions are also available in video format on my YouTube channel, @Mathsbetter, to help you understand the concepts more visually.
Now, let’s move to the next question.
Question 8: Relations and Functions 1.2
8. Let A and B be sets. Show that f:A\times B\to B\times A such that f(a,b)=(b,a) is a bijective function.
Solution
We are given the function
f:A\times B\to B\times A
defined by
f(a,b)=(b,a)
We will show that the function is both one-one and onto.
One-One (Injective):
Suppose
f(a_1,b_1)=f(a_2,b_2)
Then
(b_1,a_1)=(b_2,a_2)
Equality of ordered pairs gives
b_1=b_2 \text{ and } a_1=a_2
Therefore,
(a_1,b_1)=(a_2,b_2)
Hence, the function is one-one.
Onto (Surjective):
Let (b,a)\in B\times A .
Consider the element (a,b)\in A\times B .
Then
f(a,b)=(b,a)
Thus, every element of B\times A has a pre-image in A\times B .
Therefore, the function is onto.
Since the function is both one-one and onto, it is bijective.
Always remember that a bijective function must satisfy both conditions simultaneously.
Question 9: Relations and Functions 1.2
9. Let f:\mathbb{N}\to\mathbb{N} be defined by
f(n)=\begin{cases} \dfrac{n+1}{2}, & \text{if } n \text{ is odd} \\ \\ \dfrac{n}{2}, & \text{if } n \text{ is even} \end{cases}
for all n\in\mathbb{N} . State whether the function f is bijective. Justify your answer.
Solution
We are given the function
f:\mathbb{N}\to\mathbb{N}
defined by
f(n)=\begin{cases} \dfrac{n+1}{2}, & \text{if } n \text{ is odd} \\ \\ \dfrac{n}{2}, & \text{if } n \text{ is even} \end{cases}
We will check whether the function is one-one and onto.
One-One (Injective):
Consider
n=1
Since 1 is odd,
f(1)=\frac{1+1}{2}=1
Now consider
n=2
Since 2 is even,
f(2)=\frac{2}{2}=1
Thus,
f(1)=f(2)
but
1\neq2
Therefore, the function is not one-one.
Onto (Surjective):
Let y\in\mathbb{N} .
We show that there exists n\in\mathbb{N} such that
f(n)=y
Choose n=2y .
Since 2y is even,
f(2y)=\frac{2y}{2}=y
Thus, every natural number has a pre-image in \mathbb{N} .
Therefore, the function is onto.
Hence, the function is onto but not one-one.
Therefore, the function is not bijective.
Question 10: Relations and Functions 1.2 Exercise
10. Let A=\mathbb{R}-\{3\} and B=\mathbb{R}-\{1\} . Consider the function f:A\to B defined by
f(x)=\frac{x-2}{x-3}
Is f one-one and onto? Justify your answer.
Solution
We are given
f(x)=\frac{x-2}{x-3}
where
A=\mathbb{R}-\{3\}, \quad B=\mathbb{R}-\{1\}
We will check whether the function is one-one and onto.
One-One (Injective):
Suppose
f(x_1)=f(x_2)
Then
\frac{x_1-2}{x_1-3}=\frac{x_2-2}{x_2-3}
Cross-multiplying, we get
(x_1-2)(x_2-3)=(x_2-2)(x_1-3)
Expanding both sides,
x_1x_2-3x_1-2x_2+6=x_1x_2-3x_2-2x_1+6
Cancelling common terms, we get
-3x_1-2x_2=-3x_2-2x_1
Therefore,
x_2-x_1=0
or
x_1=x_2
Hence, the function is one-one.
Onto (Surjective):
Let y\in B . Then
y\neq1
We need to find x\in A such that
y=\frac{x-2}{x-3}
Cross-multiplying, we get
y(x-3)=x-2
yx-3y=x-2
or yx-x=3y-2
i.e. x(y-1)=3y-2
Since y\neq1 , we can divide by y-1 .
Thus,
x=\frac{3y-2}{y-1}
Now,
\frac{3y-2}{y-1}\neq3
because
\frac{3y-2}{y-1}=3
would give
3y-2=3y-3
which is impossible.
Therefore, x\in A .
Hence, for every y\in B , there exists x\in A such that
f(x)=y
Therefore, the function is onto.
Moreover,
for every y\neq1 , we obtained
x=\dfrac{3y-2}{y-1}
Now, substituting this value of x in the given function,
f\left(\dfrac{3y-2}{y-1}\right)=\dfrac{\left(\dfrac{3y-2}{y-1}\right)-2}{\left(\dfrac{3y-2}{y-1}\right)-3}
On simplifying, we get
f\left(\dfrac{3y-2}{y-1}\right)=y
Hence, for every y\in\mathbb{R}-\{1\} , there exists an x\in\mathbb{R}-\{3\} such that f(x)=y .
Therefore, the function is onto.
Since the function is both one-one and onto, it is bijective.
The next question of Relations and Functions 1.2 shows how a single counterexample is enough to prove that a function is not one-one.
Also notice how the codomain plays an important role while checking whether a function is onto.
Question 11: Relations and Functions – MCQ
11. Let f:\mathbb{R}\to\mathbb{R} be defined as f(x)=x^4 . 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
We are given
f(x)=x^4
where
f:\mathbb{R}\to\mathbb{R}
We will check whether the function is one-one and onto.
One-One (Injective):
Consider
f(2)=2^4=16
and
f(-2)=(-2)^4=16
Thus,
f(2)=f(-2)
but
2\neq-2
Therefore, the function is not one-one.
Onto (Surjective):
For every real number x , we have
x^4\geq0
Thus, the range of the function contains only non-negative real numbers.
Negative real numbers are not images of any real number.
For example, there is no real number x such that
x^4=-1
Therefore, the function is not onto.
Hence, the function is neither one-one nor onto.
✅️ Therefore, the correct answer is (D).
Question 12: Relations and Functions 1.2 – MCQ
12. Let f:\mathbb{R}\to\mathbb{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
We are given
f(x)=3x
where
f:\mathbb{R}\to\mathbb{R}
We will check whether the function is one-one and onto.
One-One (Injective):
Suppose
f(x_1)=f(x_2)
Then
3x_1=3x_2
Dividing both sides by 3 , we get
x_1=x_2
Therefore, the function is one-one.
Onto (Surjective):
Let y\in\mathbb{R} .
We need to find x\in\mathbb{R} such that
f(x)=y
Now,
y=3x
gives
x=\frac{y}{3}
Since \frac{y}{3}\in\mathbb{R} for every real number y , the function is onto.
Hence, the function is both one-one and onto.
✅️ Therefore, the correct answer is (A).
Common Mistakes to Avoid
- Confusing one-one and onto: A function can be one-one without being onto, and onto without being one-one. Both properties must be checked separately.
- Checking only one value: To prove a function is not one-one, one counterexample is enough. But to prove it is one-one, the condition must hold for all inputs.
- Ignoring the codomain: Onto depends on the codomain, not just the range. Always compare the range with the given codomain.
- Domain restriction mistakes: Pay attention to excluded values such as x\neq0 or x\neq3 . These restrictions are important while checking functions.
- Sign errors in modulus and signum functions: Students often forget that modulus changes negative values to positive values.
- Incorrect conclusion about onto: If even one element of the codomain has no pre-image, the function is not onto.
- Not checking equality carefully: For proving one-one, start with f(x_1)=f(x_2) and then simplify correctly to check whether x_1=x_2 .
- Assuming all polynomial functions are one-one: Functions like f(x)=x^2 or f(x)=x^4 are many-one on \mathbb{R} .
- Forgetting that bijective means both: A function is bijective only when it is both one-one and onto.
Continue Learning
After completing Exercise 2.2 of Relations and Functions, you should now be comfortable with the concept of functions and different types of functions such as one-one, many-one, onto and bijective functions.
To strengthen your understanding further, make sure that you revise:
- Difference between relation and function
- Domain, codomain and range of a function
- Conditions for one-one and onto functions
- How to check whether a function is bijective
- Special functions such as modulus function and signum function
- Functions defined on sets like \mathbb{N} and \mathbb{R}
- Algebraic methods for proving injective and surjective functions
- Importance of codomain while checking onto functions
Explore More
Try creating your own examples of functions and check whether they are one-one, onto or bijective. You can also experiment with polynomial, modulus and rational functions to understand how domain and codomain affect the nature of a function.
All the best and keep learning 👍
Discover more from Maths Better
Subscribe to get the latest posts sent to your email.



