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

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

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a magical machine: you put in a number, it cubes it and spits out the result. If two different numbers ever gave the same output, the machine would be broken — but cubing never does that, so every input gives a unique output. That means the machine is one-one. Now, can every integer come out of the machine? Only perfect cubes like 1, 8, 27 can. The number 2 can never pop out, because no integer cubed equals 2. So the machine misses many integers, meaning it is not onto.

Answer: The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).

📖 Injectivity and Surjectivity of f(x) = x³ on Z

Detailed Explanation

A function \( f: A \to B \) is called injective (one-one) if different inputs always give different outputs. Formally, 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 both the domain and codomain are the set of integers \( Z \), and the rule is \( f(x) = x^3 \). We must check both properties carefully using integers only.

Formula Used

Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for every \( y \in Z \), there exists \( x \in Z \) with \( f(x) = y \). Given rule: \( f(x) = x^3 \).

Solution

  1. Step 1: Test injectivity. Suppose \( f(x_1) = f(x_2) \) for two integers \( x_1, x_2 \). Then \( x_1^3 = x_2^3 \). Taking cube roots on both sides gives \( x_1 = x_2 \), because the cube function is strictly increasing and every integer has a unique real cube root.
  2. Step 2: Since \( f(x_1) = f(x_2) \) leads to \( x_1 = x_2 \), no two different integers can give the same output. Therefore \( f \) is injective (one-one).
  3. Step 3: Test surjectivity. We need to check whether every integer \( y \) in the codomain \( Z \) equals \( x^3 \) for some integer \( x \). This requires the cube root of \( y \) to be an integer for every \( y \).
  4. Step 4: Take a specific counterexample, say \( y = 2 \), which is an integer in the codomain. For it to have a pre-image we would need \( x^3 = 2 \), giving \( x = \sqrt[3]{2} \). But \( \sqrt[3]{2} \) is not an integer, so there is no integer \( x \) with \( f(x) = 2 \).
  5. Step 5: Since the element \( 2 \in Z \) has no pre-image in \( Z \), the function does not cover the whole codomain. Therefore \( f \) is not surjective (not onto).

Final Answer

The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).

Common Mistake

A common mistake is to confuse this with the real function \( f: R \to R,\ f(x) = x^3 \), which IS onto. Over the integers, values like \( 2 \) have no integer cube root, so onto fails. Always check surjectivity against the given codomain, here \( Z \), not \( R \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Set up the injectivity test by assuming two integers \( x_1, x_2 \in Z \) satisfy \( f(x_1) = f(x_2) \). — Reason: The standard method to verify injectivity is to start by assuming the outputs are equal and then check whether the inputs must also be equal.
  2. Step 2: Since \( f(x) = x^3 \), the assumption \( f(x_1) = f(x_2) \) becomes \( x_1^3 = x_2^3 \). Taking cube roots on both sides gives \( x_1 = x_2 \). — Reason: The cube function is strictly increasing over all real numbers, so two integers can have the same cube only if they are identical; therefore the implication \( x_1^3 = x_2^3 \Rightarrow x_1 = x_2 \) holds.
  3. Step 3: Because \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), no two distinct integers map to the same output. Hence \( f \) is injective (one-one). — Reason: This is exactly the definition of injectivity, so the condition is confirmed.
  4. Step 4: Now set up the surjectivity test: for \( f \) to be surjective, every integer \( y \in Z \) must have at least one integer \( x \in Z \) with \( x^3 = y \), meaning \( \sqrt[3]{y} \) must itself be an integer for every \( y \in Z \). — Reason: This is a direct restatement of the surjectivity requirement applied to \( f(x) = x^3 \).
  5. Step 5: Choose the specific counterexample \( y = 2 \). If \( f \) were surjective, there would exist an integer \( x \) satisfying \( x^3 = 2 \). However, \( 1^3 = 1 \) and \( 2^3 = 8 \), and there is no integer strictly between 1 and 2, so no integer \( x \) satisfies \( x^3 = 2 \). — Reason: A single counterexample is enough to disprove surjectivity.
  6. Step 6: Since \( y = 2 \) lies in the codomain \( Z \) but is not the cube of any integer, the element 2 has no pre-image under \( f \). Therefore \( f \) is not surjective (not onto). — Reason: Surjectivity fails the moment even one codomain element cannot be reached from the domain.

Final Answer

The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).

Common Mistake

One common mistake: students sometimes assume that because every real number has a real cube root, every integer must have an integer cube root — but the domain and codomain here are restricted to integers \( Z \), so only perfect cubes (like 0, 1, 8, 27, …) are actually attained as outputs.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check Injectivity: Let \( f(x_1) = f(x_2) \), i.e., \( x_1^3 = x_2^3 \). Taking cube roots: \( x_1 = x_2 \). Hence \( f \) is injective (one-one).
  2. Step 2: Check Surjectivity: For \( y = 2 \in Z \), we need \( x^3 = 2 \), giving \( x = 2^{1/3} \notin Z \). So \( y = 2 \) has no pre-image in \( Z \). Hence \( f \) is not surjective (not onto).

Answer: The function \( f: Z \to Z \) given by \( f(x) = x^3 \) is injective (one-one) but not surjective (not onto).

➕ More Examples

More Examples

Example 1

Question: Check the injectivity and surjectivity of the function \( f : \mathbb{Z} \to \mathbb{Z} \) defined 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 both sides 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} \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 (not onto). Note: The range of \( f \) consists only of odd integers, which is a proper subset of \( \mathbb{Z} \).

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

Example 2

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

Solution: Step 1 — Check Injectivity (One-One): Consider \( a = 2 \) and \( b = -2 \). Both belong to \( \mathbb{Z} \) and \( a \ne b \). Now compute: \[ f(2) = (2)^2 - 1 = 4 - 1 = 3 \] \[ f(-2) = (-2)^2 - 1 = 4 - 1 = 3 \] Since \( f(2) = f(-2) = 3 \) but \( 2 \ne -2 \), distinct inputs give the same output. Therefore, \( f \) is NOT injective (not one-one). Step 2 — Check Surjectivity (Onto): For \( f \) to be surjective, every \( y \in \mathbb{Z} \) must satisfy \( f(x) = y \) for some \( x \in \mathbb{Z} \). Solving for \( x \): \[ x^2 - 1 = y \implies x^2 = y + 1 \implies x = \pm\sqrt{y + 1} \] For \( x \in \mathbb{Z} \), we need \( y + 1 \) to be a perfect square. Consider \( y = 0 \in \mathbb{Z} \). Then: \[ x^2 = 1 \implies x = \pm 1 \in \mathbb{Z} \quad \text{(this works)} \] Now consider \( y = 1 \in \mathbb{Z} \). Then: \[ x^2 = 2 \implies x = \pm\sqrt{2} \notin \mathbb{Z} \] Since \( y = 1 \in \mathbb{Z} \) has no pre-image in \( \mathbb{Z} \), the function is NOT surjective (not onto). Note: The range of \( f \) is \( \{-1, 0, 3, 8, 15, \ldots\} \), which is a proper subset of \( \mathbb{Z} \), confirming non-surjectivity.

Answer: The function \( f(x) = x^2 - 1 \) from \( \mathbb{Z} \) to \( \mathbb{Z} \) 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) = 2x + 1 \). Is the function bijective? Justify your answer.

Solution

  1. Step 1: Check Injectivity (One-One): Assume \( f(a) = f(b) \) for some \( a, b \in \mathbb{Z} \). Then \( 2a + 1 = 2b + 1 \), which gives \( 2a = 2b \), and hence \( a = b \). Since \( f(a) = f(b) \) always implies \( a = b \), the function is injective (one-one).
  2. Step 2: Check Surjectivity (Onto): For surjectivity, every element \( y \in \mathbb{Z} \) must have a pre-image \( x \in \mathbb{Z} \) such that \( f(x) = y \). Setting \( 2x + 1 = y \), we get \( x = \frac{y - 1}{2} \). Now consider \( y = 2 \in \mathbb{Z} \). Then \( x = \frac{2 - 1}{2} = \frac{1}{2} \), which is not an integer. So there exists an element in \( \mathbb{Z} \) (namely \( y = 2 \)) that has no pre-image in \( \mathbb{Z} \). Therefore, the function is NOT surjective (not onto).
  3. Step 3: Conclusion on Bijectivity: A function is bijective if and only if it is both injective and surjective. Since \( f \) is injective but not surjective, the function \( f \) is NOT bijective.
  4. Step 4: Understand Why Surjectivity Fails: The range of \( f \) consists only of odd integers: \( \{ \ldots, -3, -1, 1, 3, 5, \ldots \} \), since \( 2x + 1 \) is always odd for any integer \( x \). The codomain is all of \( \mathbb{Z} \), which includes even integers as well. Since the range \( \ne \) codomain, the function is not onto. Hence Range \( = \{ 2k + 1 : k \in \mathbb{Z} \} \subsetneq \mathbb{Z} \).

Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = 2x + 1 \) is injective (one-one) but NOT surjective (not onto), and therefore it is NOT bijective.

Everything you get with Solver7

More questions in Relations and Functions