Check the injectivity and surjectivity of the following functions: \(f : Z → Z \) given by \(f(x) =x^3\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a magical machine: you put in a number, it cubes it and spits out the result. If two different numbers ever gave the same output, the machine would be broken — but cubing never does that, so every input gives a unique output. That means the machine is one-one. Now, can every integer come out of the machine? Only perfect cubes like 1, 8, 27 can. The number 2 can never pop out, because no integer cubed equals 2. So the machine misses many integers, meaning it is not onto.
Answer: The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).
A function \( f: A \to B \) is called injective (one-one) if different inputs always give different outputs. Formally, if \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), then \( f \) is one-one. 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 some \( x \in A \) with \( f(x) = y \). Here both the domain and codomain are the set of integers \( Z \), and the rule is \( f(x) = x^3 \). We must check both properties carefully using integers only.
Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for every \( y \in Z \), there exists \( x \in Z \) with \( f(x) = y \). Given rule: \( f(x) = x^3 \).
The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).
A common mistake is to confuse this with the real function \( f: R \to R,\ f(x) = x^3 \), which IS onto. Over the integers, values like \( 2 \) have no integer cube root, so onto fails. Always check surjectivity against the given codomain, here \( Z \), not \( R \).
The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).
One common mistake: students sometimes assume that because every real number has a real cube root, every integer must have an integer cube root — but the domain and codomain here are restricted to integers \( Z \), so only perfect cubes (like 0, 1, 8, 27, …) are actually attained as outputs.
Answer: The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined 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 both sides 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} \notin \mathbb{Z} \] Since there exists an element \( y = 2 \) in the codomain \( \mathbb{Z} \) with no pre-image in \( \mathbb{Z} \), the function is not surjective (not onto). Note: The range of \( f \) consists only of odd integers, which is a proper subset of \( \mathbb{Z} \).
Answer: The function \( f(x) = 2x + 1 \) from \( \mathbb{Z} \) to \( \mathbb{Z} \) is injective (one-one) but NOT surjective (not onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^2 - 1 \).
Solution: Step 1 — Check Injectivity (One-One): Consider \( a = 2 \) and \( b = -2 \). Both belong to \( \mathbb{Z} \) and \( a \ne b \). Now compute: \[ f(2) = (2)^2 - 1 = 4 - 1 = 3 \] \[ f(-2) = (-2)^2 - 1 = 4 - 1 = 3 \] Since \( f(2) = f(-2) = 3 \) but \( 2 \ne -2 \), distinct inputs give the same output. Therefore, \( f \) is NOT injective (not one-one). Step 2 — Check Surjectivity (Onto): For \( f \) to be surjective, every \( y \in \mathbb{Z} \) must satisfy \( f(x) = y \) for some \( x \in \mathbb{Z} \). Solving for \( x \): \[ x^2 - 1 = y \implies x^2 = y + 1 \implies x = \pm\sqrt{y + 1} \] For \( x \in \mathbb{Z} \), we need \( y + 1 \) to be a perfect square. Consider \( y = 0 \in \mathbb{Z} \). Then: \[ x^2 = 1 \implies x = \pm 1 \in \mathbb{Z} \quad \text{(this works)} \] Now consider \( y = 1 \in \mathbb{Z} \). Then: \[ x^2 = 2 \implies x = \pm\sqrt{2} \notin \mathbb{Z} \] Since \( y = 1 \in \mathbb{Z} \) has no pre-image in \( \mathbb{Z} \), the function is NOT surjective (not onto). Note: The range of \( f \) is \( \{-1, 0, 3, 8, 15, \ldots\} \), which is a proper subset of \( \mathbb{Z} \), confirming non-surjectivity.
Answer: The function \( f(x) = x^2 - 1 \) from \( \mathbb{Z} \) to \( \mathbb{Z} \) 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) = 2x + 1 \). Is the function bijective? Justify your answer.
Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = 2x + 1 \) is injective (one-one) but NOT surjective (not onto), and therefore it is NOT bijective.