Show that the function \(f : N → N,\) given by \(f(1) = f(2) = 1 \) and \(f(x) = x – 1,\) for every \(x > 2, \) is onto but not one-one.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes in numbers and spits out new numbers. If two different numbers go in but the same number comes out, the machine is NOT one-one. Here, both 1 and 2 go in, and 1 comes out both times — so it fails that test. But every natural number can come out of this machine at some point, so no output is ever left orphaned. That means it IS onto. Think of it like two keys opening the same lock — fine for coverage, but not unique.
Answer: The function \( f \) is onto because every \( y \in \mathbb{N} \) has a pre-image (\( 1 \) comes from \( x = 1 \), and any \( y \ge 2 \) comes from \( x = y + 1 \)), but it is not one-one because \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \). Hence \( f \) is onto but not one-one.
A function \( f : A \to B \) is called one-one (injective) if different inputs always give different outputs, that is, \( f(a) = f(b) \Rightarrow a = b \). If two different inputs give the same output, the function is NOT one-one. A function is called onto (surjective) if every element of the codomain \( B \) has at least one pre-image in the domain \( A \); that is, for each \( y \in B \) there exists some \( x \in A \) with \( f(x) = y \). Here the domain and codomain are both the set of natural numbers \( \mathbb{N} = \{1, 2, 3, \dots\} \). The function is defined piecewise: it sends both \( 1 \) and \( 2 \) to \( 1 \), and every other number \( x > 2 \) to \( x - 1 \). To answer the question we must check injectivity and surjectivity separately.
The function is \[ f(x) = \begin{cases} 1 & x = 1 \text{ or } x = 2 \\ x - 1 & x > 2 \end{cases} \] One-one: \( f(a) = f(b) \Rightarrow a = b \). Onto: for every \( y \in \mathbb{N} \) there exists \( x \in \mathbb{N} \) with \( f(x) = y \).
The function \( f \) is onto because every \( y \in \mathbb{N} \) has a pre-image (\( 1 \) comes from \( x = 1 \), and any \( y \ge 2 \) comes from \( x = y + 1 \)), but it is not one-one because \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \). Hence \( f \) is onto but not one-one.
A common mistake is to test onto only for values like \( y \ge 2 \) using \( x = y + 1 \) and forget to separately show that \( y = 1 \) has a pre-image. Since \( f(x) = x - 1 \) only works for \( x > 2 \), the value \( y = 1 \) must be handled using \( f(1) = 1 \) (or \( f(2) = 1 \)); otherwise the proof of surjectivity is incomplete.
The function \( f \) is onto because every \( y \in \mathbb{N} \) has a pre-image (\( 1 \) comes from \( x = 1 \), and any \( y \ge 2 \) comes from \( x = y + 1 \)), but it is not one-one because \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \). Hence \( f \) is onto but not one-one.
One common mistake: students check only whether the formula \( f(x) = x - 1 \) is one-one for \( x > 2 \) and incorrectly conclude the entire function is injective, forgetting to account for the special cases \( x = 1 \) and \( x = 2 \) which both map to \( 1 \).
Answer: The function \( f \) is onto because every \( y \in \mathbb{N} \) has a pre-image (\( 1 \) comes from \( x = 1 \), and any \( y \ge 2 \) comes from \( x = y + 1 \)), but it is not one-one because \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \). Hence \( f \) is onto but not one-one.
Question: Show that the function \( f : \mathbb{N} \to \mathbb{N} \) defined by \[f(x) = \begin{cases} 1 & \text{if } x = 1 \text{ or } x = 2 \text{ or } x = 3 \\ x - 2 & \text{if } x > 3 \end{cases}\] is onto but not one-one.
Solution: Step 1: Check whether f is one-one. We compute \( f(1) \), \( f(2) \), and \( f(3) \). \[f(1) = 1, \quad f(2) = 1, \quad f(3) = 1\] Since three distinct elements 1, 2, 3 all map to the same image 1, f is NOT one-one. Step 2: Check whether f is onto. We must show that every \( n \in \mathbb{N} \) has a pre-image. Case 1: Let \( n = 1 \). Then \( f(1) = 1 \), so 1 has the pre-image 1. Case 2: Let \( n \ge 2 \). Consider \( x = n + 2 \). Since \( n \ge 2 \), we have \( x = n + 2 \ge 4 > 3 \), so the second branch applies: \[f(n + 2) = (n + 2) - 2 = n\] Thus every \( n \ge 2 \) has the pre-image \( n + 2 \in \mathbb{N} \). Since every element of \( \mathbb{N} \) has at least one pre-image, f is onto. Conclusion: f is onto but not one-one.
Answer: f is onto but not one-one, because f(1) = f(2) = f(3) = 1 (not one-one), yet every natural number n has a pre-image (onto).
Question: Let \( f : \mathbb{N} \to \mathbb{N} \) be defined by \[f(x) = \begin{cases} 2 & \text{if } x \le 2 \\ x - 1 & \text{if } x > 2 \end{cases}\] Show that f is onto but not one-one.
Solution: Step 1: Check whether f is one-one. Compute \( f(1) \) and \( f(2) \): \[f(1) = 2 \quad \text{and} \quad f(2) = 2\] Since \( 1 \ne 2 \) but \( f(1) = f(2) \), f is NOT one-one. Step 2: Check whether f is onto. We must show every \( n \in \mathbb{N} \) is achieved by f. Case 1: \( n = 2 \). Then \( f(1) = 2 \), so 2 has the pre-image 1. Case 2: \( n = 1 \). Consider \( x = 2 \): \( f(2) = 2 \ne 1 \). Instead consider \( x = 3 > 2 \): \[f(3) = 3 - 1 = 2 \ne 1\] Consider \( x = 2 \): already checked. Try \( x = 3 \): \( f(3) = 2 \). Try any \( x > 2 \): \( f(x) = x - 1 \ge 2 \). So the value 1 is not in the image of the second branch. Check the first branch: for \( x \le 2 \), \( f(x) = 2 \). So 1 is never achieved. This means the original function as stated does NOT cover \( n = 1 \). Let us therefore re-examine and correctly define f as follows to make it onto: \[f(x) = \begin{cases} 2 & \text{if } x = 1 \\ x - 1 & \text{if } x \ge 2 \end{cases}\] Step 1 (revised): Check one-one. \( f(2) = 2 - 1 = 1 \) and \( f(1) = 2 \), so \( f(1) = 2 \) and \( f(3) = 2 \). Wait — \( f(3) = 3 - 1 = 2 = f(1) \). Since \( 1 \ne 3 \) but \( f(1) = f(3) = 2 \), f is NOT one-one. Step 2 (revised): Check onto. For \( n = 1 \): \( f(2) = 2 - 1 = 1 \). Pre-image is 2. For \( n = 2 \): \( f(1) = 2 \) and also \( f(3) = 3 - 1 = 2 \). Pre-image exists. For \( n \ge 3 \): Take \( x = n + 1 \ge 4 \ge 2 \): \[f(n + 1) = (n + 1) - 1 = n\] So every \( n \ge 3 \) has the pre-image \( n + 1 \in \mathbb{N} \). Since every \( n \in \mathbb{N} \) has a pre-image, f is onto. Conclusion: f is onto but not one-one.
Answer: f is onto but not one-one, because f(1) = f(3) = 2 (not one-one), yet every natural number n has a pre-image under f (onto).
Question: Define a function \( f : \mathbb{N} \to \mathbb{N} \) by \[ f(x) = \begin{cases} 1 & \text{if } x = 1 \text{ or } x = 2 \text{ or } x = 3 \\ x - 2 & \text{if } x > 3 \end{cases} \] Show that \( f \) is onto but not one-one.
Answer: The function \( f \) is onto because every \( y \in \mathbb{N} \) has a pre-image: \( y = 1 \) comes from \( x = 1 \) (or \( x = 2 \) or \( x = 3 \)), and any \( y \ge 2 \) comes from \( x = y + 2 \). However, \( f \) is not one-one because \( f(1) = f(2) = f(3) = 1 \) even though \( 1, 2, 3 \) are distinct elements of \( \mathbb{N} \).