Prove that the function \(f : N \rightarrow N,\ f(n)=(n^2+n+1)\) is one-one but not onto.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes a natural number and gives back a bigger number. Two different numbers put into this machine always come out as two different results — that makes it one-one, like two keys that never open the same lock. But the machine can never produce small outputs like 1 or 2, because even the smallest input, which is 1, gives back 3. So some numbers in the codomain are never reached. A function that misses even one output value is not onto.
Answer: The function \( f(n)=n^2+n+1 \) is one-one because \( f(x_1)=f(x_2) \) forces \( x_1=x_2 \). It is not onto because natural numbers such as \( 1 \) and \( 2 \) are never obtained as outputs (the minimum value is \( f(1)=3 \)). Hence \( f \) is one-one but not onto.
A function \( f:A \to B \) is called one-one (injective) if different inputs always give different outputs, that is, whenever \( f(x_1)=f(x_2) \) we must have \( x_1=x_2 \). A function is called onto (surjective) if every element of the codomain \( B \) is the image of at least one element of the domain \( A \); in other words the range equals the codomain. Here the domain and codomain are both the set of natural numbers \( N=\{1,2,3,\dots\} \). To prove one-one we assume two outputs are equal and show the inputs must be equal. To show a function is NOT onto, it is enough to find just one element of the codomain that is never obtained as an output.
\( f(n)=n^2+n+1 \); One-one: \( f(x_1)=f(x_2) \Rightarrow x_1=x_2 \); Onto: range \( = \) codomain.
The function \( f(n)=n^2+n+1 \) is one-one because \( f(x_1)=f(x_2) \) forces \( x_1=x_2 \). It is not onto because natural numbers such as \( 1 \) and \( 2 \) are never obtained as outputs (the minimum value is \( f(1)=3 \)). Hence \( f \) is one-one but not onto.
A common mistake is to conclude \( x_1=x_2 \) directly from \( (x_1-x_2)(x_1+x_2+1)=0 \) without justifying why \( x_1+x_2+1 \ne 0 \). You must state that since inputs are natural numbers, \( x_1+x_2+1 \ge 3 \), which rules out that factor being zero.
The function \( f(n)=n^2+n+1 \) is one-one because \( f(x_1)=f(x_2) \) forces \( x_1=x_2 \). It is not onto because natural numbers such as \( 1 \) and \( 2 \) are never obtained as outputs (the minimum value is \( f(1)=3 \)). Hence \( f \) is one-one but not onto.
One common mistake: Students often stop after proving one-one and assume the function must also be onto, forgetting to verify that every element of the codomain \( \mathbb{N} \) is actually achieved as an output; here the outputs start at \( 3 \), so \( 1 \) and \( 2 \) are never reached.
Answer: The function \( f(n)=n^2+n+1 \) is one-one because \( f(x_1)=f(x_2) \) forces \( x_1=x_2 \). It is not onto because natural numbers such as \( 1 \) and \( 2 \) are never obtained as outputs (the minimum value is \( f(1)=3 \)). Hence \( f \) is one-one but not onto.
Question: Prove that the function \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(n) = 2n^2 + 1 \) is one-one but not onto.
Solution: We need to show two things: (i) \( f \) is one-one, and (ii) \( f \) is not onto. Step 1 — Proving f is one-one: Let \( n_1, n_2 \in \mathbb{N} \) such that \( f(n_1) = f(n_2) \). Then \[ 2n_1^2 + 1 = 2n_2^2 + 1 \] which gives \[ 2n_1^2 = 2n_2^2 \] and so \[ n_1^2 = n_2^2. \] Since \( n_1, n_2 \in \mathbb{N} \), both are positive, so \( n_1 = n_2 \). Hence \( f \) is one-one. Step 2 — Proving f is NOT onto: Consider the element \( 2 \in \mathbb{N} \). For \( f \) to be onto, there must exist some \( n \in \mathbb{N} \) such that \( f(n) = 2 \), i.e., \[ 2n^2 + 1 = 2. \] This gives \[ 2n^2 = 1 \] and so \[ n^2 = \frac{1}{2}, \] which means \( n = \frac{1}{\sqrt{2}} \notin \mathbb{N} \). Since no natural number \( n \) satisfies \( f(n) = 2 \), the element \( 2 \in \mathbb{N} \) has no pre-image in \( \mathbb{N} \) under \( f \). Hence \( f \) is not onto. Conclusion: The function \( f(n) = 2n^2 + 1 \) is one-one but not onto.
Answer: f is one-one (injective) but not onto (surjective). The element 2 ∈ ℕ has no pre-image in ℕ.
Question: Prove that the function \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(n) = n^2 + 3 \) is one-one but not onto.
Solution: We need to show two things: (i) \( f \) is one-one, and (ii) \( f \) is not onto. Step 1 — Proving f is one-one: Let \( n_1, n_2 \in \mathbb{N} \) such that \( f(n_1) = f(n_2) \). Then \[ n_1^2 + 3 = n_2^2 + 3 \] which gives \[ n_1^2 = n_2^2. \] Since \( n_1, n_2 \in \mathbb{N} \), both are positive integers, so we conclude \( n_1 = n_2 \). Hence \( f \) is one-one. Step 2 — Proving f is NOT onto: Note that for any \( n \in \mathbb{N} \), we have \( n \ge 1 \), so \[ f(n) = n^2 + 3 \ge 1 + 3 = 4. \] This means the range of \( f \) is \( \{4, 7, 12, 19, \ldots\} \), which is a proper subset of \( \mathbb{N} \). In particular, consider \( 1 \in \mathbb{N} \). For \( f \) to be onto, there must exist \( n \in \mathbb{N} \) such that \( f(n) = 1 \), i.e., \[ n^2 + 3 = 1 \] giving \[ n^2 = -2, \] which has no real solution, let alone a natural number solution. Also, consider \( 2 \in \mathbb{N} \). We need \[ n^2 + 3 = 2 \] giving \[ n^2 = -1, \] again impossible. Since the elements \( 1, 2, 3 \in \mathbb{N} \) have no pre-image in \( \mathbb{N} \) under \( f \), the function \( f \) is not onto. Conclusion: The function \( f(n) = n^2 + 3 \) is one-one but not onto.
Answer: f is one-one (injective) but not onto (surjective). Elements such as 1, 2, 3 ∈ ℕ have no pre-image in ℕ under f.
Question: Let \( f : \mathbb{N} \to \mathbb{N} \) be defined by \( f(n) = 2n^2 + 1 \), where \( \mathbb{N} \) is the set of natural numbers (i.e., \( \mathbb{N} = \{1, 2, 3, \ldots\} \)). Prove that \( f \) is one-one but not onto.
Answer: The function \( f(n) = 2n^2 + 1 \) is one-one because \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \). It is not onto because the minimum value is \( f(1) = 3 \), and many natural numbers (such as \( 1 \), \( 2 \), and \( 4 \)) are never obtained as outputs. Hence \( f \) is one-one but not onto.