Check the injectivity and surjectivity of the following functions: \( f : Z → Z\) 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 any whole number and squares it. Feed in 3, out comes 9. Feed in -3, out also comes 9. Two different numbers gave the same result — that breaks the one-one rule. Now think about negative whole numbers like -1. No whole number, when squared, ever gives -1, because squares are always zero or positive. So some numbers in the output list have no matching input at all. The machine is both unfair (two inputs share one output) and incomplete (some outputs are unreachable).
Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \), \( f(x) = x^2 \) is neither injective nor surjective. It is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative integers like \( -1 \) have no pre-image (squares are never negative).
A function \( f : A \to B \) is called injective (one-one) if different inputs always give different outputs. In symbols, 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 the domain and codomain are both \( \mathbb{Z} \), the set of all integers, and the rule is \( f(x) = x^2 \). We must test both properties carefully.
Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for every \( y \in B \), there exists \( x \in A \) such that \( f(x) = y \). Here \( f(x) = x^2 \).
The function \( f : \mathbb{Z} \to \mathbb{Z} \), \( f(x) = x^2 \) is neither injective nor surjective. It is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative integers like \( -1 \) have no pre-image (squares are never negative).
A common mistake is thinking \( f \) is onto because the outputs are integers. Being onto requires EVERY element of the codomain \( \mathbb{Z} \) to be hit, but negative integers and most positive integers (like \( 2, 3, 5 \), which are not perfect squares) are never obtained, so surjectivity fails.
The function \( f : \mathbb{Z} \to \mathbb{Z} \), \( f(x) = x^2 \) is neither injective nor surjective. It is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative integers like \( -1 \) have no pre-image (squares are never negative).
One common mistake: students sometimes test injectivity only for positive integers and mistakenly conclude that \( f \) is one-one, forgetting that \( \mathbb{Z} \) includes negative integers — and that \( (-x)^2 = x^2 \) for every integer \( x \), immediately giving repeated outputs.
Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \), \( f(x) = x^2 \) is neither injective nor surjective. It is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative integers like \( -1 \) have no pre-image (squares are never negative).
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). Step 1 — Check Injectivity: Assume \( f(a) = f(b) \) for some \( a, b \in \mathbb{Z} \). Then: \[ a^3 = b^3 \] This implies \( a^3 - b^3 = 0 \), i.e., \( (a - b)(a^2 + ab + b^2) = 0 \). For integers, \( a^2 + ab + b^2 = 0 \) only when \( a = b = 0 \). For all other cases, \( a^2 + ab + b^2 > 0 \), so we must have \( a - b = 0 \), giving \( a = b \). Therefore, \( f(a) = f(b) \Rightarrow a = b \), so \( f \) is injective. Step 2 — Check Surjectivity: For \( f \) to be surjective, every \( y \in \mathbb{Z} \) must have some \( x \in \mathbb{Z} \) with \( f(x) = y \), i.e., \( x^3 = y \). Consider \( y = 2 \in \mathbb{Z} \). We need \( x^3 = 2 \), which gives \( x = 2^{1/3} \). But \( 2^{1/3} \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.
Answer: f is injective (one-one) but NOT surjective (onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^2 - 3 \).
Solution: We need to check whether \( f \) is injective (one-one) and surjective (onto). Step 1 — Check Injectivity: Assume \( f(a) = f(b) \) for some \( a, b \in \mathbb{R} \). Then: \[ a^2 - 3 = b^2 - 3 \] This simplifies to \( a^2 = b^2 \), which gives \( a = b \) or \( a = -b \). For example, take \( a = 2 \) and \( b = -2 \). Then: \[ f(2) = 4 - 3 = 1 \quad \text{and} \quad f(-2) = 4 - 3 = 1 \] So \( f(2) = f(-2) \) but \( 2 \ne -2 \). Therefore, \( f \) is NOT injective. Step 2 — Check Surjectivity: For \( f \) to be surjective, every \( y \in \mathbb{R} \) must have some \( x \in \mathbb{R} \) with \( f(x) = y \), i.e., \( x^2 - 3 = y \), so \( x^2 = y + 3 \), giving \( x = \pm\sqrt{y + 3} \). This is a real number only when \( y + 3 \ge 0 \), i.e., \( y \ge -3 \). Consider \( y = -5 \in \mathbb{R} \). Then \( x^2 = -5 + 3 = -2 \), which has no real solution. Since there exists \( y = -5 \) in the codomain \( \mathbb{R} \) with no pre-image in \( \mathbb{R} \), the function is NOT surjective.
Answer: f is neither injective (one-one) nor surjective (onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \). Is the function bijective? Justify your answer.
Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \) is injective (one-one) because \( a^3 = b^3 \Rightarrow a = b \) for all \( a, b \in \mathbb{Z} \). However, it is not surjective (not onto) because integers such as \( 2 \) have no integer pre-image (\( 2^{1/3} \notin \mathbb{Z} \)). Hence, the function is not bijective.