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

Check the injectivity and surjectivity of the following functions: \( f : N → N\) given by \(f(x) = x^3\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that takes a number and cubes it. Two different numbers can never give the same cube, so no two inputs share an output. That makes the machine one-one. Now think about whether every natural number can come out of the machine. The number 2 can never come out, because no whole number cubed equals 2. Many natural numbers are simply not perfect cubes. So the machine misses some outputs, meaning it is not onto.

Answer: The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.

📖 Injectivity and Surjectivity of f(x) = x^3 on N

Detailed Explanation

A function \( f : A \to B \) is called injective (one-one) if different inputs always give different outputs. Formally, \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). 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 \( x \in A \) with \( f(x) = y \). Here the domain and codomain are both the set of natural numbers \( \mathbb{N} = \{1, 2, 3, \dots\} \), and the rule is \( f(x) = x^3 \). We must check both properties separately.

Formula Used

Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for all \( y \in \mathbb{N} \), there exists \( x \in \mathbb{N} \) such that \( f(x) = y \). Here \( f(x) = x^3 \).

Solution

  1. Step 1: Write the function clearly. We have \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = x^3 \). The domain and codomain are both the natural numbers.
  2. Step 2: Check injectivity. Take any two elements \( x_1, x_2 \in \mathbb{N} \) and assume their images are equal: \[ f(x_1) = f(x_2) \] This means \[ x_1^3 = x_2^3 \] Taking cube roots on both sides gives \[ x_1 = x_2 \] Since equal outputs force equal inputs, \( f \) is injective (one-one).
  3. Step 3: Check surjectivity. For \( f \) to be onto, every natural number \( y \) in the codomain must be a cube of some natural number \( x \). Test a simple value: is \( y = 2 \) an image? We would need \[ x^3 = 2 \] which gives \[ x = 2^{1/3} \] But \( 2^{1/3} \) is not a natural number, so no \( x \in \mathbb{N} \) maps to \( 2 \).
  4. Step 4: Interpret the surjectivity result. The range of \( f \) is only the set of perfect cubes \( \{1, 8, 27, 64, \dots\} \), which is a proper subset of \( \mathbb{N} \). Numbers like \( 2, 3, 4, 5 \) are never obtained. Hence \( f \) is not surjective (not onto).

Final Answer

The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.

Common Mistake

A common mistake is to assume that because the cube function is one-one, it must also be onto. Students often forget that the codomain here is all of \( \mathbb{N} \), not just the set of perfect cubes, so values like \( 2 \) and \( 3 \) are left out and the function fails to be surjective.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function and its domain and codomain. We are given \( f : \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = x^3 \), where \( \mathbb{N} = \\{1, 2, 3, \dots\\} \). — Reason: Clearly stating the domain and codomain tells us what inputs are allowed and what outputs must be covered.
  2. Step 2: Set up the injectivity check. Suppose two natural numbers \( x_1 \) and \( x_2 \) satisfy \( f(x_1) = f(x_2) \), that is, \[ x_1^3 = x_2^3. \] — Reason: The definition of injective requires us to start by assuming equal outputs and then deduce what that forces on the inputs.
  3. Step 3: Conclude injectivity. Taking cube roots of both sides of \( x_1^3 = x_2^3 \) gives \[ x_1 = x_2. \] Since equal outputs always force equal inputs, the function \( f \) is injective (one-one). — Reason: Cube root is a strictly increasing function on \( \mathbb{N} \), so it cancels the cube uniquely, leaving no possibility for two distinct inputs to share the same output.
  4. Step 4: Set up the surjectivity check. For \( f \) to be surjective (onto), every element \( y \in \mathbb{N} \) must be expressible as \( x^3 \) for some \( x \in \mathbb{N} \). Test the specific value \( y = 2 \): we would need \[ x^3 = 2. \] — Reason: Finding even one element of the codomain that has no pre-image in the domain is enough to prove the function is NOT surjective.
  5. Step 5: Show that \( y = 2 \) has no natural-number pre-image. Solving \( x^3 = 2 \) gives \[ x = 2^{1/3} \approx 1.26, \] which is not a natural number. Hence \( y = 2 \) is an element of the codomain \( \mathbb{N} \) that is not the image of any \( x \in \mathbb{N} \). — Reason: Since \( x \) must belong to \( \mathbb{N} \) and \( 2^{1/3} \notin \mathbb{N} \), the surjectivity condition fails for this particular \( y \).
  6. Step 6: Conclude non-surjectivity and the overall verdict. Because \( f \) is injective but not surjective, it cannot be a bijection. — Reason: Bijection requires BOTH properties simultaneously; the failure of surjectivity alone is sufficient to rule out bijection.

Final Answer

The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.

Common Mistake

One common mistake: students often check only injectivity and, finding it satisfied, incorrectly conclude the function is a bijection — always verify surjectivity separately, because a function can be one-one without being onto.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Injectivity: Let \( f(x_1) = f(x_2) \), i.e., \( x_1^3 = x_2^3 \), which gives \( x_1 = x_2 \). Hence \( f \) is one-one.
  2. Step 2: Surjectivity: For \( y = 2 \in \mathbb{N} \), we need \( x^3 = 2 \), so \( x = 2^{1/3} \notin \mathbb{N} \). Hence \( f \) is not onto.

Answer: The function \( f(x) = x^3 \) on \( \mathbb{N} \) is injective (one-one) but not surjective (not onto). Therefore it is not a bijection.

➕ More Examples

More Examples

Example 1

Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) given 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 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} \), which is not an integer. Since \( x = \frac{y-1}{2} \notin \mathbb{Z} \) for every even integer \( y \), not every element of \( \mathbb{Z} \) has a pre-image in \( \mathbb{Z} \). Therefore, the function is NOT surjective (not onto).

Answer: The function f(x) = 2x + 1 from Z to Z is injective (one-one) but NOT surjective (not onto).

Example 2

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

Solution: Step 1: Check Injectivity (One-One). Let \( a = 2 \) and \( b = -2 \). Both are distinct elements of \( \mathbb{R} \). Computing \( f(2) \): \[ f(2) = (2)^2 - 4 = 4 - 4 = 0 \] Computing \( f(-2) \): \[ f(-2) = (-2)^2 - 4 = 4 - 4 = 0 \] Since \( f(2) = f(-2) = 0 \) but \( 2 \ne -2 \), the function maps two distinct inputs to the same output. Therefore, the function is NOT injective (not one-one). Step 2: Check Surjectivity (Onto). For \( f \) to be surjective, every \( y \in \mathbb{R} \) must have a pre-image \( x \in \mathbb{R} \) such that \( f(x) = y \). Solving for \( x \): \[ x^2 - 4 = y \implies x^2 = y + 4 \implies x = \pm\sqrt{y + 4} \] For \( x \) to be real, we need \( y + 4 \ge 0 \), i.e., \( y \ge -4 \). Now consider \( y = -5 \in \mathbb{R} \). Then \( x^2 = -5 + 4 = -1 \), which has no real solution. Since elements of \( \mathbb{R} \) with \( y < -4 \) have no pre-image, the function is NOT surjective (not onto).

Answer: The function f(x) = x^2 - 4 from R to R is neither injective (not one-one) nor surjective (not onto).

🎯 Try a Similar Question

Try a Similar Question

Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \). Is \( f \) a bijection?

Solution

  1. Step 1: Understand the domain and codomain: Here the domain is \( \mathbb{Z} \) (the set of all integers) and the codomain is also \( \mathbb{Z} \). We need to check both injectivity and surjectivity.
  2. Step 2: Check Injectivity (One-One): Assume \( f(x_1) = f(x_2) \) for some \( x_1, x_2 \in \mathbb{Z} \). Then \( x_1^3 = x_2^3 \). Since the cube function is strictly increasing on \( \mathbb{Z} \), this implies \( x_1 = x_2 \). Therefore \( f \) is injective (one-one).
  3. Step 3: Check Surjectivity (Onto): For \( f \) to be surjective, every element \( y \in \mathbb{Z} \) must have a pre-image \( x \in \mathbb{Z} \) such that \( f(x) = y \), i.e., \( x^3 = y \). Consider \( y = 2 \). We need \( x^3 = 2 \), which gives \( x = 2^{1/3} \). Since \( 2^{1/3} \notin \mathbb{Z} \), the element \( 2 \in \mathbb{Z} \) has no pre-image in \( \mathbb{Z} \). Therefore \( f \) is NOT surjective (not onto).
  4. Step 4: Conclusion: Since \( f \) is injective but not surjective, it is NOT a bijection.

Answer: The function \( f(x) = x^3 \) on \( \mathbb{Z} \) is injective (one-one) but NOT surjective (not onto). Therefore it is not a bijection.

Everything you get with Solver7

More questions in Relations and Functions