Consider the identity function $I_{N}: N \rightarrow N$ defined as $I_{N}(x) = x$ for all $x \in N$. Show that although $I_{N}$ is onto,the function $I_{N} + I_{N}: N \rightarrow N$ defined as $(I_{N} + I_{N})(x) = I_{N}(x) + I_{N}(x) = x + x = 2x$ is not onto.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) The identity function $I_{N}: N \rightarrow N$ is defined by $I_{N}(x) = x$. For any $y \in N$,there exists $x = y \in N$ such that $I_{N}(x) = y$,so $I_{N}$ is onto.
Now,consider the function $f(x) = (I_{N} + I_{N})(x) = 2x$. The range of this function is the set of all even natural numbers,i.e.,$\{2, 4, 6, \dots\}$.
Since the co-domain is $N = \{1, 2, 3, \dots\}$,we can observe that an element like $3 \in N$ does not have a pre-image in the domain $N$ because $2x = 3$ implies $x = 1.5$,which is not a natural number.
Therefore,$I_{N} + I_{N}$ is not onto.

Explore More

Similar Questions

The number of onto functions from the set $\{1, 2, \ldots, 11\}$ to the set $\{1, 2, \ldots, 10\}$ is

Let $f: R \rightarrow R$ be defined by $f(x)=5x^4+2$. Then

For the greatest integer function $f(x) = [x]$,where $x \in R$,which of the following is true?

The number of strictly increasing functions $f$ from the set $A = \{1, 2, 3, 4, 5, 6\}$ to the set $B = \{1, 2, 3, \dots, 9\}$ such that $f(i) \neq i$ for all $1 \le i \le 6$ is equal to:

If a function $f: R-\{l\} \to R-\{m\}$ defined by $f(x) = \frac{x+3}{x-2}$ is a bijection,then $3l - 2m =$

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo