SOLVER7 Study. Nothing Else.
Exercise 1.2 Q2(iii)

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

Solution

👶 Simple Explanation

Simple Explanation

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).

📖 Injectivity and Surjectivity of f(x) = x^2 on R

Detailed Explanation

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.

Formula Used

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 \).

Solution

  1. Step 1: Write down the function and its domain and codomain. We have \( f : \mathbb{R} \to \mathbb{R} \) with \( f(x) = x^2 \). Both the domain and the codomain are the set of all real numbers \( \mathbb{R} \).
  2. Step 2: Check injectivity. To be one-one, distinct inputs must give distinct outputs. Test two different values, for example \( x = 1 \) and \( x = -1 \). Then \( f(1) = 1^2 = 1 \) and \( f(-1) = (-1)^2 = 1 \).
  3. Step 3: Interpret the result of Step 2. Here \( f(1) = f(-1) = 1 \) but \( 1 \ne -1 \). So two different inputs give the same output. This violates the one-one condition. Therefore \( f \) is not injective.
  4. Step 4: Check surjectivity. We must see whether every real number in the codomain is achieved as an output. Notice that for every real \( x \), \( x^2 \ge 0 \). So the output can never be negative.
  5. Step 5: Test a negative value in the codomain, say \( y = -1 \). We would need \( x^2 = -1 \), but no real number \( x \) satisfies this. So \( -1 \in \mathbb{R} \) has no pre-image. Hence the range \( [0, \infty) \) is not equal to the codomain \( \mathbb{R} \). Therefore \( f \) is not surjective.

Final 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).

Common Mistake

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) \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function, domain, and codomain. We are given \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^2 \). Both domain and codomain are the entire real line \( \mathbb{R} \). — Reason: Clearly stating these sets is essential before testing any property, since injectivity and surjectivity both depend on what the domain and codomain are.
  2. Step 2: Choose two specific inputs to probe injectivity. Take \( x = 1 \) and \( x = -1 \). Compute: \( f(1) = 1^2 = 1 \) and \( f(-1) = (-1)^2 = 1 \). — Reason: Picking a positive-negative pair is a natural strategy for \( x^2 \) because squaring removes sign information, making a counterexample easy to spot.
  3. Step 3: Interpret the counterexample for injectivity. We found \( f(1) = f(-1) = 1 \), yet \( 1 \ne -1 \). Since two different inputs share the same output, the condition \( f(a) = f(b) \Rightarrow a = b \) is violated. Therefore \( f \) is NOT injective. — Reason: A single counterexample is enough to disprove injectivity; we do not need to check every pair.
  4. Step 4: Set up the surjectivity check. For \( f \) to be surjective, every real number \( y \in \mathbb{R} \) must equal \( x^2 \) for some real \( x \). That would require \( x = \sqrt{y} \) to be real, which demands \( y \ge 0 \). — Reason: Solving \( x^2 = y \) for \( x \) reveals which values of \( y \) can actually be reached.
  5. Step 5: Identify an element of the codomain with no pre-image. Consider \( y = -1 \). We would need \( x^2 = -1 \), but \( x^2 \ge 0 \) for every real \( x \), so no such \( x \) exists in \( \mathbb{R} \). — Reason: Negative numbers can never be outputs of squaring a real number, so they serve as concrete counterexamples to surjectivity.
  6. Step 6: Conclude surjectivity fails. Because \( -1 \in \mathbb{R} \) (the codomain) has no pre-image under \( f \), the range of \( f \) is only \( [0, \infty) \), which is strictly smaller than the codomain \( \mathbb{R} \). Therefore \( f \) is NOT surjective. — Reason: Surjectivity requires the range to equal the entire codomain; here it does not.
  7. Step 7: Combine both conclusions. \( f \) fails injectivity (because \( f(1) = f(-1) \) with \( 1 \ne -1 \)) and fails surjectivity (because \( -1 \) has no pre-image). Hence \( f \) is neither injective nor surjective. — Reason: Both properties must hold independently; failing either one is a separate, decisive result.

Final 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).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check injectivity: \ f(1) = 1^2 = 1 \ and \ f(-1) = (-1)^2 = 1, \ so \ f(1) = f(-1) \ but \ 1 \ne -1. \ Hence not injective.
  2. Step 2: Check surjectivity: For \ y = -1 \in \mathbb{R}, \ we need \ x^2 = -1, \ which has no real solution. Hence not surjective.

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).

➕ More Examples

More Examples

Example 1

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).

Example 2

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).

🎯 Try a Similar Question

Try a Similar Question

Question: Check the injectivity and surjectivity of the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^3 - x \).

Solution

  1. Step 1: Test for Injectivity (One-One): A function is injective if f(a) = f(b) always implies a = b. Suppose f(a) = f(b), i.e., \( a^3 - a = b^3 - b \). We check whether this forces a = b by testing specific values. Let a = 1 and b = -1. Then \( f(1) = 1^3 - 1 = 0 \) and \( f(-1) = (-1)^3 - (-1) = -1 + 1 = 0 \). So \( f(1) = f(-1) = 0 \) but \( 1 \ne -1 \). Since two distinct inputs give the same output, the function is NOT injective.
  2. Step 2: Test for Surjectivity (Onto): A function \( f : \mathbb{R} \to \mathbb{R} \) is surjective if for every \( y \in \mathbb{R} \), there exists some \( x \in \mathbb{R} \) such that \( f(x) = y \), i.e., \( x^3 - x = y \). The function \( g(x) = x^3 - x \) is a real polynomial of odd degree (degree 3). By the Intermediate Value Theorem, every odd-degree polynomial with real coefficients takes all real values. More concretely, \( g(x) \to +\infty \) as \( x \to +\infty \) and \( g(x) \to -\infty \) as \( x \to -\infty \), and g is continuous on \( \mathbb{R} \). Therefore, every real number y is achieved by at least one real x. Hence the function IS surjective.
  3. Step 3: Conclusion: Since \( f(1) = f(-1) = 0 \) but \( 1 \ne -1 \), the function is not injective. Since every \( y \in \mathbb{R} \) has a pre-image in \( \mathbb{R} \) (because \( x^3 - x \) is an odd-degree polynomial covering all of \( \mathbb{R} \)), the function is surjective. Therefore, \( f(x) = x^3 - x \) is surjective but not injective.

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).

Everything you get with Solver7

More questions in Relations and Functions