SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q10

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Onto but Not One-One Function on Natural Numbers

Detailed Explanation

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.

Formula Used

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 \).

Solution

  1. Step 1: Write down the given function clearly. \[ f(1) = 1, \quad f(2) = 1, \quad f(x) = x - 1 \text{ for } x > 2. \] So for example \( f(3) = 2 \), \( f(4) = 3 \), \( f(5) = 4 \), and so on.
  2. Step 2: Check whether the function is one-one. A function is one-one only if distinct inputs give distinct outputs. Notice that \[ f(1) = 1 \quad \text{and} \quad f(2) = 1. \] Here \( 1 \ne 2 \) but \( f(1) = f(2) \). So two different elements of the domain map to the same element of the codomain.
  3. Step 3: Conclude about one-one. Since we found \( 1 \ne 2 \) with \( f(1) = f(2) = 1 \), the condition for injectivity fails. Therefore \( f \) is NOT one-one.
  4. Step 4: Check whether the function is onto. Take any natural number \( y \in \mathbb{N} \) (the codomain) and try to find some \( x \in \mathbb{N} \) with \( f(x) = y \). We consider two cases based on the value of \( y \).
  5. Step 5: Case 1: \( y = 1 \). Here we can choose \( x = 1 \) (or \( x = 2 \)) because \( f(1) = 1 \). So \( 1 \) has a pre-image.
  6. Step 6: Case 2: \( y \ge 2 \). Choose \( x = y + 1 \). Since \( y \ge 2 \), we have \( x = y + 1 \ge 3 > 2 \), so the rule \( f(x) = x - 1 \) applies. Then \[ f(y + 1) = (y + 1) - 1 = y. \] So every \( y \ge 2 \) also has a pre-image, namely \( y + 1 \).
  7. Step 7: Conclude about onto. In both cases every element \( y \in \mathbb{N} \) has at least one pre-image \( x \in \mathbb{N} \). Therefore \( f \) is onto (surjective).

Final 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.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List a few concrete output values to get familiar with the function. We have \( f(1) = 1 \), \( f(2) = 1 \), \( f(3) = 2 \), \( f(4) = 3 \), \( f(5) = 4 \), and in general \( f(x) = x - 1 \) for every \( x > 2 \). — Reason: Building a small table of values helps spot patterns (like repeated outputs) before doing any formal argument.
  2. Step 2: Test the one-one (injective) property by looking for two different inputs that share the same output. Observe that \( f(1) = 1 \) and \( f(2) = 1 \), yet \( 1 \ne 2 \). — Reason: The definition of one-one requires every output to come from exactly one input; finding even a single pair of distinct inputs with the same output is enough to conclude the function is NOT one-one.
  3. Step 3: State the conclusion for injectivity clearly. Because \( f(1) = f(2) = 1 \) while \( 1 \ne 2 \), the function fails the one-one condition. Hence \( f \) is not one-one. — Reason: One counter-example is sufficient to disprove a universal property.
  4. Step 4: Now check the onto (surjective) property by asking: can every natural number \( y \in \mathbb{N} \) be reached? Consider two separate cases. Case 1 — \( y = 1 \): choose \( x = 1 \); then \( f(1) = 1 \). Case 2 — \( y \ge 2 \): choose \( x = y + 1 \) (which satisfies \( x > 2 \) since \( y \ge 2 \) implies \( y + 1 \ge 3 \)); then \( f(y + 1) = (y + 1) - 1 = y \). — Reason: To prove onto we must exhibit an explicit pre-image for every possible output, covering all cases in the codomain.
  5. Step 5: Verify that the pre-image chosen in each case actually lies in the domain \( \mathbb{N} \). For Case 1, \( x = 1 \in \mathbb{N} \). For Case 2, \( x = y + 1 \in \mathbb{N} \) whenever \( y \in \mathbb{N} \). — Reason: A pre-image is only valid if it belongs to the domain; we must confirm this to complete the surjectivity proof.
  6. Step 6: State the conclusion for surjectivity. Since every \( y \in \mathbb{N} \) has a pre-image in \( \mathbb{N} \) (either \( x = 1 \) when \( y = 1 \), or \( x = y + 1 \) when \( y \ge 2 \)), the function \( f \) is onto. — Reason: Demonstrating a valid pre-image for every element of the codomain satisfies the definition of surjectivity.
  7. Step 7: Combine both conclusions. The function \( f \) is onto (surjective) but not one-one (injective). — Reason: Each property is independent; a function can be onto without being one-one, which is exactly the situation here.

Final 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.

Common Mistake

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 \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check one-one: \( f(1) = 1 \) and \( f(2) = 1 \), but \( 1 \ne 2 \), so \( f \) is not one-one.
  2. Step 2: Check onto: For \( y = 1 \): \( f(1) = 1 \). For \( y \ge 2 \): take \( x = y + 1 > 2 \), then \( f(y+1) = (y+1) - 1 = y \). Every \( y \in \mathbb{N} \) has a pre-image, so \( f \) is onto.

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.

➕ More Examples

More Examples

Example 1

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).

Example 2

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).

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Check whether f is one-one: To test the one-one property, look for two distinct natural numbers that map to the same value. Note that \( f(1) = 1 \), \( f(2) = 1 \), and \( f(3) = 1 \). Since \( 1, 2, 3 \) are distinct elements of \( \mathbb{N} \) but all three give the output \( 1 \), we have \( f(1) = f(2) = f(3) = 1 \) with \( 1 \ne 2 \ne 3 \). Therefore \( f \) is NOT one-one.
  2. Step 2: Check whether f is onto — case y = 1: We must show that every \( y \in \mathbb{N} \) has at least one pre-image under \( f \). For \( y = 1 \): we need \( x \in \mathbb{N} \) such that \( f(x) = 1 \). Taking \( x = 1 \) (or \( x = 2 \) or \( x = 3 \)) gives \( f(1) = 1 \). So \( y = 1 \) is covered.
  3. Step 3: Check whether f is onto — case y ≥ 2: For any \( y \ge 2 \), take \( x = y + 2 \). Since \( y \ge 2 \), we have \( x = y + 2 \ge 4 > 3 \), so \( x \) falls in the second branch. Then \[ f(x) = f(y + 2) = (y + 2) - 2 = y. \] So every natural number \( y \ge 2 \) also has a pre-image \( x = y + 2 \in \mathbb{N} \).
  4. Step 4: Conclusion: Since every \( y \in \mathbb{N} \) has at least one pre-image in \( \mathbb{N} \), the function \( f \) is onto. However, since \( f(1) = f(2) = f(3) = 1 \) with \( 1, 2, 3 \) being distinct, \( f \) is not one-one. Hence \( 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} \).

Everything you get with Solver7

More questions in Relations and Functions