SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q8

Show that the function \(f:N\)-> \(N,\) given by \(f(x)=2x,\) is one-one but not onto.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that doubles every number you put in. You put in 1, it gives 2. You put in 3, it gives 6. No two different inputs ever give the same output, so the machine is one-one. But this machine only ever produces even numbers like 2, 4, 6. Odd numbers like 3 can never come out. Since 3 has nowhere to come from, the machine does not cover every natural number. That is why it is not onto.

Answer: The function \( f: N \to N \) given by \( f(x) = 2x \) is one-one because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not onto because odd natural numbers such as \( 3 \) have no pre-image in \( N \).

📖 Proving f(x) = 2x is One-One but Not Onto

Detailed Explanation

A function \( f: A \to B \) is called one-one (injective) if different inputs always give different outputs. Formally, if \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \), then \( f \) is one-one. 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 \); that is, for every \( y \in B \) there exists some \( x \in A \) with \( f(x) = y \). Here the function is \( f: N \to N \) given by \( f(x) = 2x \), where \( N \) is the set of natural numbers. We must check both properties separately.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \in N \), there exists \( x \in N \) such that \( f(x) = y \).

Solution

  1. Step 1: To test one-one, assume two elements of the domain have the same image. Let \( x_1, x_2 \in N \) be such that \( f(x_1) = f(x_2) \).
  2. Step 2: Substitute the rule \( f(x) = 2x \) into the assumption. This gives \( 2x_1 = 2x_2 \).
  3. Step 3: Divide both sides by 2 to get \( x_1 = x_2 \). Since equal images force equal inputs, \( f \) is one-one (injective).
  4. Step 4: To test onto, we check whether every natural number in the codomain is an image. Notice that \( f(x) = 2x \) is always an even number for any \( x \in N \), because it is a multiple of 2.
  5. Step 5: Take an odd natural number in the codomain, for example \( y = 3 \). For \( f \) to be onto we would need some \( x \in N \) with \( 2x = 3 \), which gives \( x = \frac{3}{2} \).
  6. Step 6: But \( \frac{3}{2} \notin N \), so there is no natural number \( x \) whose image is 3. Hence odd numbers have no pre-image, meaning \( f \) is not onto (not surjective).

Final Answer

The function \( f: N \to N \) given by \( f(x) = 2x \) is one-one because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not onto because odd natural numbers such as \( 3 \) have no pre-image in \( N \).

Common Mistake

A common mistake is to assume that any odd number like 3 has a pre-image because \( 2x = 3 \) has a solution. But \( x = \frac{3}{2} \) is not a natural number, so this does not count. The pre-image must belong to the domain \( N \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function and what needs to be verified: We are given \( f : N \to N \) defined by \( f(x) = 2x \), where \( N \) is the set of natural numbers. We need to check two properties independently: whether \( f \) is one-one, and whether \( f \) is onto. — Reason: Both properties must be examined separately because a function can satisfy one without the other.
  2. Step 2: Set up the one-one test: Assume that two elements \( x_1, x_2 \in N \) satisfy \( f(x_1) = f(x_2) \). — Reason: The standard method to check injectivity is to start with the assumption that two inputs give the same output and then see whether this forces the inputs to be equal.
  3. Step 3: Apply the rule of f and simplify: Substituting \( f(x) = 2x \) into the assumption gives \( 2x_1 = 2x_2 \). Dividing both sides by 2 yields \( x_1 = x_2 \). — Reason: Replacing the function with its explicit formula turns an abstract equality into an algebraic equation that can be solved directly.
  4. Step 4: Conclude one-one: Since \( f(x_1) = f(x_2) \) necessarily leads to \( x_1 = x_2 \), the function \( f \) is one-one (injective). — Reason: This is precisely the definition of a one-one function — equal outputs must come from equal inputs.
  5. Step 5: Set up the onto test: For \( f \) to be onto, every element \( y \in N \) must have a pre-image \( x \in N \) satisfying \( f(x) = y \), i.e., \( 2x = y \), which means \( x = \dfrac{y}{2} \). — Reason: We need to check whether solving for \( x \) always gives a valid natural number.
  6. Step 6: Test with an odd element of the codomain: Choose \( y = 3 \) (an odd natural number). Then we would need \( x = \dfrac{3}{2} = 1.5 \). Since \( 1.5 \notin N \), there is no natural number \( x \) with \( f(x) = 3 \). — Reason: A single counter-example is sufficient to disprove the onto property.
  7. Step 7: Generalise and conclude not onto: Because \( f(x) = 2x \) always produces an even number for any \( x \in N \), every odd natural number in the codomain lacks a pre-image. Therefore \( f \) is not onto (not surjective). — Reason: The range of \( f \) contains only even natural numbers, which is a proper subset of \( N \), so the codomain is not fully covered.

Final Answer

The function \( f: N \to N \) given by \( f(x) = 2x \) is one-one because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not onto because odd natural numbers such as \( 3 \) have no pre-image in \( N \).

Common Mistake

One common mistake: students sometimes confuse the codomain with the range. The range of \( f(x) = 2x \) over \( N \) is only the even natural numbers, but the codomain is all of \( N \); since these are not equal, the function is not onto — yet students incorrectly conclude it is onto because every input does produce some output.

✍️ Exam-ready Answer

Exam-ready Answer

  1. One-one check: Let \( f(x_1) = f(x_2) \). Then \( 2x_1 = 2x_2 \), so \( x_1 = x_2 \). Hence \( f \) is one-one.
  2. Onto check: For \( y = 3 \in N \), solving \( 2x = 3 \) gives \( x = \frac{3}{2} \notin N \). So \( 3 \) has no pre-image in \( N \).
  3. Conclusion: \( f \) is one-one but not onto.

Answer: The function \( f: N \to N \) given by \( f(x) = 2x \) is one-one because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not onto because odd natural numbers such as \( 3 \) have no pre-image in \( N \).

➕ More Examples

More Examples

Example 1

Question: Show that the function \( f: \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = 3x \) is one-one but not onto.

Solution: We need to check two properties of \( f(x) = 3x \) where both domain and codomain are \( \mathbb{N} \) (the set of natural numbers). Step 1 — Checking one-one (injective): Let \( x_1, x_2 \in \mathbb{N} \) such that \( f(x_1) = f(x_2) \). Then \( 3x_1 = 3x_2 \), which gives \( x_1 = x_2 \). Since \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \), the function \( f \) is one-one. Step 2 — Checking onto (surjective): For \( f \) to be onto, every element \( y \in \mathbb{N} \) must have a pre-image \( x \in \mathbb{N} \) such that \( f(x) = y \), i.e., \( 3x = y \), giving \( x = \frac{y}{3} \). Consider \( y = 1 \in \mathbb{N} \). Then \( x = \frac{1}{3} \notin \mathbb{N} \). So the element \( 1 \in \mathbb{N} \) (the codomain) has no pre-image in \( \mathbb{N} \). In fact, any \( y \in \mathbb{N} \) that is not a multiple of 3 (such as 1, 2, 4, 5, ...) has no pre-image. Therefore, \( f \) is NOT onto.

Answer: f(x) = 3x from ℕ to ℕ is one-one but not onto.

Example 2

Question: A function \( g: \mathbb{N} \to \mathbb{N} \) is defined by \( g(n) = 2n + 1 \). Show that \( g \) is one-one but not onto.

Solution: We examine the function \( g(n) = 2n + 1 \) with domain and codomain both equal to \( \mathbb{N} \). Step 1 — Checking one-one (injective): Let \( n_1, n_2 \in \mathbb{N} \) such that \( g(n_1) = g(n_2) \). Then \( 2n_1 + 1 = 2n_2 + 1 \). Subtracting 1 from both sides: \( 2n_1 = 2n_2 \), which gives \( n_1 = n_2 \). Since \( g(n_1) = g(n_2) \) implies \( n_1 = n_2 \), the function \( g \) is one-one. Step 2 — Checking onto (surjective): For \( g \) to be onto, for every \( y \in \mathbb{N} \) there must exist \( n \in \mathbb{N} \) with \( g(n) = y \), i.e., \( 2n + 1 = y \), giving \( n = \frac{y - 1}{2} \). Note that \( g(n) = 2n + 1 \) is always an odd natural number for any \( n \in \mathbb{N} \). So the range of \( g \) consists only of odd natural numbers: \( \{3, 5, 7, 9, \ldots\} \). Consider \( y = 2 \in \mathbb{N} \). Then \( n = \frac{2 - 1}{2} = \frac{1}{2} \notin \mathbb{N} \). So \( 2 \in \mathbb{N} \) (the codomain) has no pre-image in \( \mathbb{N} \). In general, every even natural number and also the odd number 1 (since \( 2n+1 \ge 3 \) for \( n \in \mathbb{N} \)) lie outside the range of \( g \). Therefore, \( g \) is NOT onto.

Answer: g(n) = 2n + 1 from ℕ to ℕ is one-one but not onto.

🎯 Try a Similar Question

Try a Similar Question

Question: Show that the function \( f : \mathbb{N} \to \mathbb{N} \) given by \( f(x) = 3x \) is one-one but not onto.

Solution

  1. Step 1: State what needs to be proved: We need to show that \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = 3x \) is one-one (injective) but not onto (surjective).
  2. Step 2: Prove f is one-one: Let \( x_1, x_2 \in \mathbb{N} \) such that \( f(x_1) = f(x_2) \). Then \[ 3x_1 = 3x_2 \] Dividing both sides by 3, we get \[ x_1 = x_2 \] Since \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), the function \( f \) is one-one.
  3. Step 3: Prove f is not onto: For \( f \) to be onto, every element \( y \in \mathbb{N} \) must have a pre-image \( x \in \mathbb{N} \) such that \( f(x) = y \), i.e., \( 3x = y \), which gives \( x = \dfrac{y}{3} \). Consider \( y = 1 \in \mathbb{N} \). Then \( x = \dfrac{1}{3} \notin \mathbb{N} \). So \( y = 1 \) has no pre-image in \( \mathbb{N} \).
  4. Step 4: Conclusion: Since there exist elements in the codomain \( \mathbb{N} \) (such as 1 and 2) that are not multiples of 3 and hence have no pre-image in \( \mathbb{N} \), the function \( f \) is not onto. Therefore, \( f(x) = 3x \) is one-one but not onto.

Answer: The function \( f : \mathbb{N} \to \mathbb{N} \) given by \( f(x) = 3x \) is one-one because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not onto because natural numbers that are not multiples of 3, such as \( 1 \) and \( 2 \), have no pre-image in \( \mathbb{N} \).

Everything you get with Solver7

More questions in Relations and Functions