Check the injectivity and surjectivity of the following functions: \( f : R → R\) 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 squares it. Put in 3, get 9. Put in -3, also get 9! Two different inputs gave the same output — that makes the machine unfair for one-one functions. Also, ask the machine for -4 as an output. No number squared ever gives a negative answer. So the machine simply cannot produce every real number. Because of these two problems, the squaring function \( f(x) = x^2 \) fails both the one-one test and the onto test.
Answer: The function \( f : \mathbb{R} \to \mathbb{R} \), \( f(x) = x^2 \) is neither injective (since \( f(1) = f(-1) \) but \( 1 \ne -1 \)) nor surjective (since negative numbers such as \( -1 \) have no pre-image).
A function \( f : A \to B \) is called injective (one-one) if different inputs always give different outputs. Formally, if \( f(a) = f(b) \) forces \( a = b \), 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, the range equals the codomain. Here we study \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^2 \). Since squaring always gives a non-negative result, the output values are limited, and different inputs can share the same square. These two ideas are exactly what decide injectivity and surjectivity.
Injective: \( f(a) = f(b) \Rightarrow a = b \). Surjective: for every \( y \in \mathbb{R} \), there exists \( x \in \mathbb{R} \) such that \( f(x) = y \).
The function \( f : \mathbb{R} \to \mathbb{R} \), \( f(x) = x^2 \) is neither injective (since \( f(1) = f(-1) \) but \( 1 \ne -1 \)) nor surjective (since negative numbers such as \( -1 \) have no pre-image).
A common mistake is to conclude that \( f \) is onto because \( x^2 \) covers many values. Students forget that the codomain is all of \( \mathbb{R} \), including negative numbers, which \( x^2 \) can never reach, so the range is only \( [0, \infty) \).
The function \( f : \mathbb{R} \to \mathbb{R} \), \( f(x) = x^2 \) is neither injective (since \( f(1) = f(-1) \) but \( 1 \ne -1 \)) nor surjective (since negative numbers such as \( -1 \) have no pre-image).
One common mistake: students check only positive values of \( x \) and mistakenly conclude that \( f(x) = x^2 \) is injective, forgetting that negative inputs like \( -1 \) produce the same square as their positive counterparts.
Answer: The function \( f : \mathbb{R} \to \mathbb{R} \), \( f(x) = x^2 \) is neither injective (since \( f(1) = f(-1) \) but \( 1 \ne -1 \)) nor surjective (since negative numbers such as \( -1 \) have no pre-image).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^3 - x \).
Solution: Step 1: Check Injectivity (one-one). We check whether \( f(a) = f(b) \) necessarily implies \( a = b \). Consider \( a = 1 \) and \( b = -1 \). \[ f(1) = 1^3 - 1 = 0 \] \[ f(-1) = (-1)^3 - (-1) = -1 + 1 = 0 \] So \( f(1) = f(-1) = 0 \), but \( 1 \ne -1 \). Since two distinct elements in the domain map to the same value, \( f \) is NOT injective (not one-one). Step 2: Check Surjectivity (onto). We need to determine whether for every \( y \in \mathbb{R} \), there exists some \( x \in \mathbb{R} \) such that \( f(x) = y \), i.e., \( x^3 - x = y \). Since \( g(x) = x^3 - x \) is a continuous function on \( \mathbb{R} \), and as \( x \to +\infty \), \( g(x) \to +\infty \), and as \( x \to -\infty \), \( g(x) \to -\infty \), by the Intermediate Value Theorem every real value \( y \) is attained by \( g \). Therefore, for every \( y \in \mathbb{R} \), there exists \( x \in \mathbb{R} \) with \( f(x) = y \). Hence \( f \) IS surjective (onto).
Answer: f is NOT injective (not one-one) but IS surjective (onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = |x| + 3 \).
Solution: Step 1: Check Injectivity (one-one). We check whether \( f(a) = f(b) \) implies \( a = b \). Let \( a = 2 \) and \( b = -2 \). \[ f(2) = |2| + 3 = 2 + 3 = 5 \] \[ f(-2) = |-2| + 3 = 2 + 3 = 5 \] So \( f(2) = f(-2) = 5 \), yet \( 2 \ne -2 \). Since two distinct inputs give the same output, \( f \) is NOT injective (not one-one). Step 2: Check Surjectivity (onto). We find the range of \( f \). Since \( |x| \ge 0 \) for all \( x \in \mathbb{R} \), we have: \[ f(x) = |x| + 3 \ge 3 \] So the range of \( f \) is \( [3, +\infty) \), which is a proper subset of \( \mathbb{R} \). For example, take \( y = 1 \in \mathbb{R} \). We need \( x \) such that \( |x| + 3 = 1 \), i.e., \( |x| = -2 \), which has no solution in \( \mathbb{R} \). Therefore, not every element of the codomain \( \mathbb{R} \) has a pre-image, so \( f \) is NOT surjective (not onto).
Answer: f is NOT injective (not one-one) and NOT surjective (not onto).
Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^3 - x \).
Answer: The function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^3 - x \) is NOT injective (since \( f(1) = f(-1) = 0 \) but \( 1 \ne -1 \)) but IS surjective (since every real number is the image of at least one real number, as \( x^3 - x \) is an odd-degree polynomial that takes all real values).