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

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Injectivity and Surjectivity of f(x) = x² on Integers

Detailed Explanation

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.

Formula Used

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

Solution

  1. Step 1: Write down the function and its domain and codomain. We have \( f : \mathbb{Z} \to \mathbb{Z} \) given by \( f(x) = x^2 \). The domain is all integers and the codomain is all integers.
  2. Step 2: Check injectivity by testing two different inputs. Consider \( x_1 = 1 \) and \( x_2 = -1 \). Then \( f(1) = 1^2 = 1 \) and \( f(-1) = (-1)^2 = 1 \). So \( f(1) = f(-1) \) but \( 1 \ne -1 \).
  3. Step 3: Conclude about injectivity. Since two different inputs \( 1 \) and \( -1 \) give the same output \( 1 \), the condition \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \) fails. Therefore \( f \) is NOT injective (not one-one).
  4. Step 4: Check surjectivity by picking an element of the codomain and asking if it has a pre-image. Take \( y = -1 \), which is an integer, so it lies in the codomain \( \mathbb{Z} \). We need an integer \( x \) with \( x^2 = -1 \).
  5. Step 5: See why no such integer exists. For every integer \( x \), the square \( x^2 \ge 0 \). So \( x^2 = -1 \) has no solution in \( \mathbb{Z} \). Hence \( -1 \) has no pre-image.
  6. Step 6: Conclude about surjectivity. Since at least one element of the codomain (for example \( -1 \), and in fact every negative integer) is not the image of any integer, \( f \) is NOT surjective (not onto).

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

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function, domain, and codomain. We are given \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^2 \), meaning both the input set and the target set are the integers \( \mathbb{Z} \). — Reason: Clearly noting the domain and codomain is essential before testing any property, since both injectivity and surjectivity depend on exactly which sets are involved.
  2. Step 2: Pick two candidate inputs to test injectivity. Choose \( x_1 = 1 \) and \( x_2 = -1 \). These are two distinct integers, so \( x_1 \ne x_2 \). — Reason: To disprove injectivity we only need one counterexample — a pair of different inputs that produce the same output. Positive and negative integers of equal magnitude are natural candidates for \( f(x) = x^2 \) because squaring removes the sign.
  3. Step 3: Compute the outputs for both chosen inputs. \( f(1) = 1^2 = 1 \) and \( f(-1) = (-1)^2 = 1 \), so \( f(1) = f(-1) = 1 \). — Reason: Computing the actual output values confirms that two different inputs map to the same image, which is precisely what we need to show the one-one condition fails.
  4. Step 4: Conclude about injectivity. We found \( f(1) = f(-1) \) yet \( 1 \ne -1 \), so the implication \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \) does NOT hold. Therefore \( f \) is not injective (not one-one). — Reason: A single counterexample is sufficient to disprove a universal statement; one failure of the injectivity condition means the function is definitively not one-one.
  5. Step 5: Select a target element to test surjectivity. Pick \( y = -1 \), which is an integer and therefore belongs to the codomain \( \mathbb{Z} \). — Reason: To disprove surjectivity we must find at least one element in the codomain that has no pre-image in the domain. Negative integers are immediate suspects since squares of real (or integer) numbers are never negative.
  6. Step 6: Check whether any integer maps to \( y = -1 \). We would need some \( x \in \mathbb{Z} \) satisfying \( x^2 = -1 \). However, for every integer \( x \), we have \( x^2 \ge 0 \), so \( x^2 = -1 \) has no solution in \( \mathbb{Z} \). — Reason: The square of any real number (and hence any integer) is non-negative, making it impossible to reach a negative value in the codomain.
  7. Step 7: Conclude about surjectivity. Since \( -1 \in \mathbb{Z} \) has no pre-image under \( f \), the condition 'every element of the codomain has a pre-image' fails. Therefore \( f \) is not surjective (not onto). — Reason: Again, one missing pre-image is enough to disprove surjectivity for the entire function.

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

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Check Injectivity: \( f(1) = 1^2 = 1 \) and \( f(-1) = (-1)^2 = 1 \), so \( f(1) = f(-1) \) but \( 1 \ne -1 \). Hence \( f \) is NOT injective.
  2. Check Surjectivity: For \( y = -1 \in \mathbb{Z} \), we need \( x^2 = -1 \), which has no solution in \( \mathbb{Z} \) since \( x^2 \ge 0 \) for all \( x \in \mathbb{Z} \). Hence \( f \) is NOT surjective.

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

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

Example 2

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

🎯 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 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 \( a^3 = b^3 \). Since the cube function is strictly monotonically increasing over all integers, \( a^3 = b^3 \) implies \( a = b \). Therefore, \( f \) is injective (one-one).
  2. Step 2: Verify with a Specific Example: For example, if \( f(2) = f(-2) \) were true, we would have \( 8 = -8 \), which is false. Indeed \( 2 \ne -2 \) and \( f(2) = 8 \ne -8 = f(-2) \). This further confirms that no two distinct integers map to the same cube, so \( f \) is one-one.
  3. Step 3: Check Surjectivity (Onto): For \( f \) to be surjective, every integer \( y \in \mathbb{Z} \) must have a pre-image \( x \in \mathbb{Z} \) such that \( x^3 = y \). Consider \( y = 2 \). We need \( x^3 = 2 \), which gives \( x = 2^{1/3} \). Since \( 2^{1/3} \) is not an integer, the element \( 2 \in \mathbb{Z} \) has no pre-image in \( \mathbb{Z} \). Therefore, \( f \) is NOT surjective (not onto).
  4. Step 4: Conclusion on Bijectivity: Since \( f \) is injective but not surjective, it is not bijective. The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^3 \) is one-one but not onto.

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.

Everything you get with Solver7

More questions in Relations and Functions