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
CBSE Class 12 Maths · Relations and Functions
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 \).
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.
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 \).
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 \).
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 \).
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 \).
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.
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 \).
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.
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.
Question: Show that the function \( f : \mathbb{N} \to \mathbb{N} \) given by \( 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} \).