Check the injectivity and surjectivity of the following functions: \(f : N → N\) given by \(f(x) =x^ 2\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes a number and gives back its square. If two different numbers go in and give the same answer out, the machine is not one-one. Here, different natural numbers always give different squares, so the machine is one-one. But some numbers, like 2 or 3, can never come out as a square of any natural number. So not every number in the output box gets used. That makes the function not onto.
Answer: The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.
A function \( f : A \to B \) is said to be injective (one-one) if different inputs always give different outputs. Formally, \( f(x_1) = f(x_2) \) must imply \( x_1 = x_2 \). A function is said to be surjective (onto) if every element of the codomain \( B \) is the image of at least some element of the domain \( A \); that is, the range of \( f \) equals \( B \). Here the domain and codomain are both \( N \), the set of natural numbers \( \{1, 2, 3, \dots\} \), and the rule is \( f(x) = x^2 \). To decide the nature of \( f \), we test both properties separately.
Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for every \( y \in N \), there exists \( x \in N \) such that \( f(x) = y \). Given: \( f(x) = x^2 \).
The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.
A common mistake is to think \( x^2 \) is not one-one because \( (-2)^2 = 2^2 \). But the domain here is \( N \), which contains no negative numbers, so this reasoning does not apply. On \( N \) the function is indeed injective; it fails only surjectivity.
The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.
One common mistake: students cancel \( x_1^2 = x_2^2 \) directly to \( x_1 = x_2 \) without justifying why the negative root \( x_1 = -x_2 \) is ruled out; they must explicitly use the fact that all elements of \( N \) are positive, making \( x_1 + x_2 > 0 \) and therefore \( x_1 - x_2 = 0 \).
Answer: The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \).
Solution: We need to check whether \( f \) is injective (one-one) and surjective (onto). Checking Injectivity: Let \( f(a) = f(b) \) for some \( a, b \in \mathbb{Z} \). Then \( a^3 = b^3 \), which gives \( a^3 - b^3 = 0 \). Factoring: \( (a - b)(a^2 + ab + b^2) = 0 \). For real (and integer) values, \( a^2 + ab + b^2 > 0 \) unless \( a = b = 0 \), so the only solution is \( a = b \). Hence \( f \) is injective. Checking Surjectivity: We need to check: for every \( y \in \mathbb{Z} \), does there exist \( x \in \mathbb{Z} \) such that \( x^3 = y \)? Consider \( y = 2 \in \mathbb{Z} \). We need \( x^3 = 2 \), so \( x = 2^{1/3} \), which is not an integer. Since there exist elements in \( \mathbb{Z} \) (the codomain) that have no pre-image in \( \mathbb{Z} \) (the domain), \( f \) is not surjective.
Answer: f is injective but NOT surjective.
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = 2x - 5 \).
Solution: We need to check whether \( f \) is injective (one-one) and surjective (onto). Checking Injectivity: Let \( f(a) = f(b) \) for some \( a, b \in \mathbb{R} \). Then \( 2a - 5 = 2b - 5 \). Subtracting \(-5\) from both sides and simplifying: \( 2a = 2b \), so \( a = b \). Since \( f(a) = f(b) \) implies \( a = b \), the function \( f \) is injective. Checking Surjectivity: Let \( y \in \mathbb{R} \) be any element in the codomain. We need to find \( x \in \mathbb{R} \) such that \( f(x) = y \). Setting \( 2x - 5 = y \) and solving: \[ x = \frac{y + 5}{2} \] Since \( y \in \mathbb{R} \), we get \( x = \frac{y+5}{2} \in \mathbb{R} \). So for every \( y \) in the codomain, a pre-image exists in the domain. We can verify: \[ f\left(\frac{y+5}{2}\right) = 2 \cdot \frac{y+5}{2} - 5 = (y + 5) - 5 = y \] Hence every element in \( \mathbb{R} \) has a pre-image, so \( f \) is surjective.
Answer: f is both injective AND surjective (i.e., f is a bijection).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^2 \). Is \( f \) a bijection? Justify your answer.
Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^2 \) is neither injective (not one-one) nor surjective (not onto). Hence it is not a bijection.