Check the injectivity and surjectivity of the following functions: \( f : N → N\) given by \(f(x) = x^3\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes a number and cubes it. Two different numbers can never give the same cube, so no two inputs share an output. That makes the machine one-one. Now think about whether every natural number can come out of the machine. The number 2 can never come out, because no whole number cubed equals 2. Many natural numbers are simply not perfect cubes. So the machine misses some outputs, meaning it is not onto.
Answer: The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.
A function \( f : A \to B \) is called injective (one-one) if different inputs always give different outputs. Formally, \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). A function is called surjective (onto) 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 \( 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\} \), and the rule is \( f(x) = x^3 \). We must check both properties separately.
Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for all \( y \in \mathbb{N} \), there exists \( x \in \mathbb{N} \) such that \( f(x) = y \). Here \( f(x) = x^3 \).
The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.
A common mistake is to assume that because the cube function is one-one, it must also be onto. Students often forget that the codomain here is all of \( \mathbb{N} \), not just the set of perfect cubes, so values like \( 2 \) and \( 3 \) are left out and the function fails to be surjective.
The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.
One common mistake: students often check only injectivity and, finding it satisfied, incorrectly conclude the function is a bijection — always verify surjectivity separately, because a function can be one-one without being onto.
Answer: The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) given by \( f(x) = 2x + 1 \).
Solution: Step 1: Check Injectivity (One-One). Let \( f(a) = f(b) \) for some \( a, b \in \mathbb{Z} \). Then: \[ 2a + 1 = 2b + 1 \] Subtracting 1 from both sides: \[ 2a = 2b \] Dividing by 2: \[ a = b \] Since \( f(a) = f(b) \) implies \( a = b \), the function is injective (one-one). Step 2: Check Surjectivity (Onto). For \( f \) to be surjective, every \( y \in \mathbb{Z} \) must have a pre-image \( x \in \mathbb{Z} \) such that \( f(x) = y \). Solving for \( x \): \[ 2x + 1 = y \implies x = \frac{y - 1}{2} \] Consider \( y = 2 \in \mathbb{Z} \). Then \( x = \frac{2 - 1}{2} = \frac{1}{2} \), which is not an integer. Since \( x = \frac{y-1}{2} \notin \mathbb{Z} \) for every even integer \( y \), not every element of \( \mathbb{Z} \) has a pre-image in \( \mathbb{Z} \). Therefore, the function is NOT surjective (not onto).
Answer: The function f(x) = 2x + 1 from Z to Z is injective (one-one) but NOT surjective (not onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) given by \( f(x) = x^2 - 4 \).
Solution: Step 1: Check Injectivity (One-One). Let \( a = 2 \) and \( b = -2 \). Both are distinct elements of \( \mathbb{R} \). Computing \( f(2) \): \[ f(2) = (2)^2 - 4 = 4 - 4 = 0 \] Computing \( f(-2) \): \[ f(-2) = (-2)^2 - 4 = 4 - 4 = 0 \] Since \( f(2) = f(-2) = 0 \) but \( 2 \ne -2 \), the function maps two distinct inputs to the same output. Therefore, the function is NOT injective (not one-one). Step 2: Check Surjectivity (Onto). For \( f \) to be surjective, every \( y \in \mathbb{R} \) must have a pre-image \( x \in \mathbb{R} \) such that \( f(x) = y \). Solving for \( x \): \[ x^2 - 4 = y \implies x^2 = y + 4 \implies x = \pm\sqrt{y + 4} \] For \( x \) to be real, we need \( y + 4 \ge 0 \), i.e., \( y \ge -4 \). Now consider \( y = -5 \in \mathbb{R} \). Then \( x^2 = -5 + 4 = -1 \), which has no real solution. Since elements of \( \mathbb{R} \) with \( y < -4 \) have no pre-image, the function is NOT surjective (not onto).
Answer: The function f(x) = x^2 - 4 from R to R is neither injective (not one-one) nor surjective (not onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \). Is \( f \) a bijection?
Answer: The function \( f(x) = x^3 \) on \( \mathbb{Z} \) is injective (one-one) but NOT surjective (not onto). Therefore it is not a bijection.