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

Check the injectivity and surjectivity of the following functions: \(f : N → N\) 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 gives back its square. If two different numbers go in and give the same answer out, the machine is not one-one. Here, different natural numbers always give different squares, so the machine is one-one. But some numbers, like 2 or 3, can never come out as a square of any natural number. So not every number in the output box gets used. That makes the function not onto.

Answer: The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.

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

Detailed Explanation

A function \( f : A \to B \) is said to be injective (one-one) if different inputs always give different outputs. Formally, \( f(x_1) = f(x_2) \) must imply \( x_1 = x_2 \). A function is said to be surjective (onto) if every element of the codomain \( B \) is the image of at least some element of the domain \( A \); that is, the range of \( f \) equals \( B \). Here the domain and codomain are both \( N \), the set of natural numbers \( \{1, 2, 3, \dots\} \), and the rule is \( f(x) = x^2 \). To decide the nature of \( f \), we test both properties separately.

Formula Used

Injective: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Surjective: for every \( y \in N \), there exists \( x \in N \) such that \( f(x) = y \). Given: \( f(x) = x^2 \).

Solution

  1. Step 1: Write down the function and its domain and codomain. We are given \( f : N \to N \) with \( f(x) = x^2 \), where \( N = \{1, 2, 3, \dots\} \).
  2. Step 2: Check injectivity. Suppose \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in N \). Then \( x_1^2 = x_2^2 \), which gives \( x_1^2 - x_2^2 = 0 \), so \( (x_1 - x_2)(x_1 + x_2) = 0 \).
  3. Step 3: Since \( x_1, x_2 \in N \), both are positive, so \( x_1 + x_2 \ne 0 \). Hence we must have \( x_1 - x_2 = 0 \), that is \( x_1 = x_2 \). Because \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), the function is injective (one-one).
  4. Step 4: Check surjectivity. We ask whether every natural number is the square of some natural number. Take an element of the codomain, say \( y = 2 \). We would need \( x \in N \) with \( x^2 = 2 \), which gives \( x = \sqrt{2} \).
  5. Step 5: But \( \sqrt{2} \) is not a natural number, so no \( x \in N \) satisfies \( f(x) = 2 \). Thus \( 2 \) in the codomain has no pre-image. The range of \( f \) is only \( \{1, 4, 9, 16, \dots\} \), which is a proper subset of \( N \). Therefore \( f \) is not surjective (not onto).

Final Answer

The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.

Common Mistake

A common mistake is to think \( x^2 \) is not one-one because \( (-2)^2 = 2^2 \). But the domain here is \( N \), which contains no negative numbers, so this reasoning does not apply. On \( N \) the function is indeed injective; it fails only surjectivity.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function and its domain and codomain. We have \( f : N \to N \) defined by \( f(x) = x^2 \), where \( N = \{1, 2, 3, \dots\} \) is the set of all natural numbers. — Reason: Clearly stating the domain and codomain tells us which values of \( x \) are allowed (only positive integers) and what the output must belong to, which is essential for checking both injectivity and surjectivity.
  2. Step 2: Set up the injectivity test. Assume \( f(x_1) = f(x_2) \) for arbitrary \( x_1, x_2 \in N \). Then \[ x_1^2 = x_2^2 \] which can be rewritten as \[ x_1^2 - x_2^2 = 0 \] and factored as \[ (x_1 - x_2)(x_1 + x_2) = 0. \] — Reason: The standard method to check injectivity is to start with the assumption that two inputs produce the same output and then deduce whether those inputs must be identical.
  3. Step 3: Conclude injectivity. Since \( x_1, x_2 \in N \), both are positive integers, so \( x_1 + x_2 \ge 2 \ne 0 \). Therefore the factor \( (x_1 - x_2) \) must equal zero, giving \( x_1 = x_2 \). — Reason: Because \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \) for all choices in \( N \), the function satisfies the definition of an injective (one-one) function.
  4. Step 4: Set up the surjectivity test. For \( f \) to be surjective (onto), every element \( y \in N \) must have a pre-image \( x \in N \) satisfying \( f(x) = y \), i.e., \( x^2 = y \), which means \( x = \sqrt{y} \) must itself be a natural number. — Reason: Checking whether each output value can be 'reached' from some input is exactly what surjectivity demands.
  5. Step 5: Find a counterexample to surjectivity. Take \( y = 2 \in N \). For a pre-image to exist we would need \( x = \sqrt{2} \), but \( \sqrt{2} \) is irrational and definitely not in \( N \). Hence there is no \( x \in N \) with \( f(x) = 2 \). — Reason: A single element of the codomain that has no pre-image is enough to prove the function is not surjective (onto).
  6. Step 6: Combine both conclusions. The function is injective because \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but it is not surjective because the element \( 2 \in N \) (and, more generally, any non-perfect-square natural number) has no pre-image under \( f \). Since surjectivity fails, \( f \) cannot be a bijection. — Reason: Bijection requires both properties to hold simultaneously; the failure of even one is sufficient to rule it out.

Final Answer

The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence it is not a bijection.

Common Mistake

One common mistake: students cancel \( x_1^2 = x_2^2 \) directly to \( x_1 = x_2 \) without justifying why the negative root \( x_1 = -x_2 \) is ruled out; they must explicitly use the fact that all elements of \( N \) are positive, making \( x_1 + x_2 > 0 \) and therefore \( x_1 - x_2 = 0 \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check Injectivity: Let \( f(x_1) = f(x_2) \), i.e., \( x_1^2 = x_2^2 \), so \( (x_1 - x_2)(x_1 + x_2) = 0 \). Since \( x_1, x_2 \in N \), we have \( x_1 + x_2 \ne 0 \), hence \( x_1 = x_2 \). So \( f \) is injective.
  2. Step 2: Check Surjectivity: Take \( y = 2 \in N \). Solving \( x^2 = 2 \) gives \( x = \sqrt{2} \notin N \). So \( y = 2 \) has no pre-image in \( N \), hence \( f \) is not surjective.

Answer: The function \( f : N \to N \), \( f(x) = x^2 \), is injective (one-one) but not surjective (not onto). Hence 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} \) defined by \( f(x) = x^3 \).

Solution: We need to check whether \( f \) is injective (one-one) and surjective (onto). Checking Injectivity: Let \( f(a) = f(b) \) for some \( a, b \in \mathbb{Z} \). Then \( a^3 = b^3 \), which gives \( a^3 - b^3 = 0 \). Factoring: \( (a - b)(a^2 + ab + b^2) = 0 \). For real (and integer) values, \( a^2 + ab + b^2 > 0 \) unless \( a = b = 0 \), so the only solution is \( a = b \). Hence \( f \) is injective. Checking Surjectivity: We need to check: for every \( y \in \mathbb{Z} \), does there exist \( x \in \mathbb{Z} \) such that \( x^3 = y \)? Consider \( y = 2 \in \mathbb{Z} \). We need \( x^3 = 2 \), so \( x = 2^{1/3} \), which is not an integer. Since there exist elements in \( \mathbb{Z} \) (the codomain) that have no pre-image in \( \mathbb{Z} \) (the domain), \( f \) is not surjective.

Answer: f is injective but NOT surjective.

Example 2

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

Solution: We need to check whether \( f \) is injective (one-one) and surjective (onto). Checking Injectivity: Let \( f(a) = f(b) \) for some \( a, b \in \mathbb{R} \). Then \( 2a - 5 = 2b - 5 \). Subtracting \(-5\) from both sides and simplifying: \( 2a = 2b \), so \( a = b \). Since \( f(a) = f(b) \) implies \( a = b \), the function \( f \) is injective. Checking Surjectivity: Let \( y \in \mathbb{R} \) be any element in the codomain. We need to find \( x \in \mathbb{R} \) such that \( f(x) = y \). Setting \( 2x - 5 = y \) and solving: \[ x = \frac{y + 5}{2} \] Since \( y \in \mathbb{R} \), we get \( x = \frac{y+5}{2} \in \mathbb{R} \). So for every \( y \) in the codomain, a pre-image exists in the domain. We can verify: \[ f\left(\frac{y+5}{2}\right) = 2 \cdot \frac{y+5}{2} - 5 = (y + 5) - 5 = y \] Hence every element in \( \mathbb{R} \) has a pre-image, so \( f \) is surjective.

Answer: f is both injective AND surjective (i.e., f is a bijection).

🎯 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^2 \). Is \( f \) a bijection? Justify your answer.

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} \). The function is defined as \( f(x) = x^2 \).
  2. Step 2: Check Injectivity (One-One): A function is injective if \( f(a) = f(b) \Rightarrow a = b \) for all \( a, b \) in the domain. Suppose \( f(a) = f(b) \), i.e., \( a^2 = b^2 \). This gives \( a^2 - b^2 = 0 \), so \( (a-b)(a+b) = 0 \). Therefore either \( a = b \) or \( a = -b \). Since \( a = -b \) is also possible (for example, \( a = 2 \) and \( b = -2 \)), we see that \( f(2) = 4 = f(-2) \) but \( 2 \ne -2 \). Hence \( f \) is NOT injective.
  3. Step 3: Check Surjectivity (Onto): A function is surjective if for every \( y \in \mathbb{Z} \), there exists some \( x \in \mathbb{Z} \) such that \( f(x) = y \). Consider \( y = -1 \). We need \( x^2 = -1 \) for some \( x \in \mathbb{Z} \). But the square of any integer is non-negative, so \( x^2 \ge 0 \) for all \( x \in \mathbb{Z} \). There is no integer \( x \) with \( x^2 = -1 \). Hence \( f \) is NOT surjective.
  4. Step 4: Conclusion: Since \( f \) is neither injective nor surjective, it is NOT a bijection.

Answer: The function \( f : \mathbb{Z} \to \mathbb{Z} \) defined by \( f(x) = x^2 \) is neither injective (not one-one) nor surjective (not onto). Hence it is not a bijection.

Everything you get with Solver7

More questions in Relations and Functions