SOLVER7 Study. Nothing Else.
Exercise 1.2 Q4

Show that the Modulus Function \( f : R → R,\) given by \( f(x) = |x|,\) is neither one- one nor onto, where \(|x|\) is \(x,\) If \(x\) is positive or 0 and \(|x|\) is \(-x,\) if \(x\) is negative.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Think of the modulus function like a machine that always spits out the distance from zero — so it turns both 3 and -3 into 3. That means two different numbers can give the same result, which breaks the one-one rule. Also, this machine can never output a negative number, so something like -2 has no input that produces it. A function is onto only when every possible output has at least one matching input. Since negative outputs are impossible here, the machine fails both tests.

Answer: The modulus function \( f(x) = |x| \) is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative values such as \( -2 \) in the codomain \( \mathbb{R} \) have no pre-image. Hence \( f \) is neither one-one nor onto.

📖 Modulus Function is Neither One-One Nor Onto

Detailed Explanation

The modulus function \( f : \mathbb{R} \to \mathbb{R} \) is defined as \[ f(x) = |x| = \begin{cases} x & x \ge 0 \\ -x & x < 0 \end{cases} \] To decide whether a function is one-one (injective), we check whether different inputs always give different outputs. If \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), the function is one-one; otherwise it is not. To decide whether a function is onto (surjective), we check whether every element of the codomain \( \mathbb{R} \) is the image of at least some element of the domain. Since \( |x| \) is always non-negative, its outputs can never be negative, which is the key to showing it is not onto.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \) in codomain, there exists \( x \) with \( f(x) = y \). Here \( f(x) = |x| \ge 0 \) for all \( x \).

Solution

  1. Step 1: Recall the definitions. A function is one-one if distinct inputs give distinct outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). A function is onto if every element of the codomain is achieved as an output.
  2. Step 2: Check whether \( f \) is one-one. Take two different inputs, for example \( x_1 = 1 \) and \( x_2 = -1 \). Then \[ f(1) = |1| = 1 \] and \[ f(-1) = |-1| = 1 \]
  3. Step 3: Here \( f(1) = f(-1) = 1 \) but \( 1 \ne -1 \). Two different inputs produce the same output, so the condition \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \) fails. Therefore \( f \) is not one-one.
  4. Step 4: Check whether \( f \) is onto. By definition of modulus, \( |x| \ge 0 \) for every real number \( x \). So every output of \( f \) is non-negative, meaning the range of \( f \) is \( [0, \infty) \).
  5. Step 5: The codomain is all of \( \mathbb{R} \), which includes negative numbers. Take a negative number in the codomain, say \( y = -2 \). There is no real \( x \) for which \( |x| = -2 \), because a modulus can never be negative. So \( -2 \) has no pre-image.
  6. Step 6: Since a negative element of the codomain is never reached, \( f \) is not onto. Combining both results, \( f(x) = |x| \) is neither one-one nor onto.

Final Answer

The modulus function \( f(x) = |x| \) is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative values such as \( -2 \) in the codomain \( \mathbb{R} \) have no pre-image. Hence \( f \) is neither one-one nor onto.

Common Mistake

A common mistake is to think that since each \( x \) gives only one \( |x| \), the function must be one-one. Being a valid function only means each input has one output; one-one requires that different inputs give different outputs, which fails here since \( x \) and \( -x \) share the same image.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the definition of the modulus function. The function \( f : \mathbb{R} \to \mathbb{R} \) is defined as \[f(x) = |x| = \begin{cases} x & x \ge 0 \\ -x & x < 0 \end{cases}\] — Reason: Stating the function explicitly makes it easy to evaluate outputs and identify patterns such as symmetry about zero.
  2. Step 2: Recall the criteria we need to test. A function fails to be one-one if we can find two inputs \( x_1 \ne x_2 \) such that \( f(x_1) = f(x_2) \). A function fails to be onto if we can find a value \( y \) in the codomain \( \mathbb{R} \) for which no \( x \) satisfies \( f(x) = y \). — Reason: Knowing exactly what we are looking for guides us to choose the right counter-examples efficiently.
  3. Step 3: Test for one-one by picking two specific inputs with opposite signs. Choose \( x_1 = 1 \) and \( x_2 = -1 \). Evaluate: \[f(1) = |1| = 1\] and \[f(-1) = |-1| = 1\] — Reason: Opposite non-zero numbers are a natural choice because the modulus removes the sign, making both outputs equal.
  4. Step 4: Conclude about injectivity. We have \( f(1) = f(-1) = 1 \) while \( 1 \ne -1 \). Because two distinct inputs share the same output, the one-one condition \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \) is violated. — Reason: A single counter-example is enough to disprove injectivity.
  5. Step 5: Observe the range of \( f \). Since \( |x| \ge 0 \) for every real number \( x \), the output of \( f \) is always non-negative, meaning \( f(x) \in [0, \infty) \) for all \( x \in \mathbb{R} \). — Reason: Understanding the range is the key to checking whether the function covers the entire codomain \( \mathbb{R} \).
  6. Step 6: Test for onto by checking whether every real number can be achieved as an output. Consider the element \( -2 \) in the codomain \( \mathbb{R} \). We need some \( x \) with \( |x| = -2 \). But \( |x| \ge 0 \) for all \( x \), so no such \( x \) exists. — Reason: Negative numbers lie outside the range of \( f \), exposing the failure of surjectivity.
  7. Step 7: Conclude about surjectivity. Because the element \( -2 \in \mathbb{R} \) has no pre-image under \( f \), the function does not map onto the entire codomain \( \mathbb{R} \). Therefore \( f \) is not onto. — Reason: One element of the codomain without a pre-image is sufficient to prove the function is not surjective.

Final Answer

The modulus function \( f(x) = |x| \) is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative values such as \( -2 \) in the codomain \( \mathbb{R} \) have no pre-image. Hence \( f \) is neither one-one nor onto.

Common Mistake

One common mistake: Students sometimes confuse the range with the codomain. The range of \( f(x) = |x| \) is \( [0, \infty) \), but the codomain is all of \( \mathbb{R} \); since these are not equal, the function is not onto, even though every non-negative real number is achieved as an output.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check one-one: \ f(1) = |1| = 1 and f(-1) = |-1| = 1, so f(1) = f(-1) but 1 \ne -1. Hence f is not one-one.
  2. Step 2: Check onto: For all x \in \mathbb{R}, \( f(x) = |x| \ge 0 \). No x exists with \( f(x) = -2 \), so \( -2 \in \mathbb{R} \) has no pre-image. Hence f is not onto.

Answer: The modulus function \( f(x) = |x| \) is not one-one because \( f(1) = f(-1) = 1 \) with \( 1 \ne -1 \), and it is not onto because negative values such as \( -2 \) in the codomain \( \mathbb{R} \) have no pre-image. Hence \( f \) is neither one-one nor onto.

➕ More Examples

More Examples

Example 1

Question: Show that the function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = x^2 + 1 \) is neither one-one nor onto.

Solution: We test for one-one and onto separately. Step 1: Check whether f is one-one. Consider two values \( x_1 = 2 \) and \( x_2 = -2 \). These are distinct elements in \( \mathbb{R} \). Compute \( f(2) \): \[ f(2) = 2^2 + 1 = 5 \] Compute \( f(-2) \): \[ f(-2) = (-2)^2 + 1 = 5 \] Since \( f(2) = f(-2) = 5 \) but \( 2 \ne -2 \), the function is NOT one-one. Step 2: Check whether f is onto. For f to be onto, every \( y \in \mathbb{R} \) must have some \( x \in \mathbb{R} \) such that \( f(x) = y \), i.e., \( x^2 + 1 = y \), giving \( x^2 = y - 1 \). Since \( x^2 \ge 0 \) for all real \( x \), we need \( y - 1 \ge 0 \), i.e., \( y \ge 1 \). Take \( y = 0 \in \mathbb{R} \). Then \( x^2 = 0 - 1 = -1 \), which has no real solution. So \( y = 0 \) has no pre-image in \( \mathbb{R} \). The range of f is \( [1, \infty) \ne \mathbb{R} \), so the function is NOT onto. Conclusion: \( f(x) = x^2 + 1 \) is neither one-one nor onto.

Answer: f(x) = x^2 + 1 is neither one-one nor onto.

Example 2

Question: Let \( f : \mathbb{R} \to \mathbb{R} \) be defined by \[ f(x) = \begin{cases} 2x & \text{if } x \ge 0 \\ -2x & \text{if } x < 0 \end{cases} \] Show that f is neither one-one nor onto.

Solution: We observe that \( f(x) = 2|x| \) for all \( x \in \mathbb{R} \). Step 1: Check whether f is one-one. Take \( x_1 = 3 \) and \( x_2 = -3 \). These are distinct real numbers. Compute \( f(3) \): \[ f(3) = 2(3) = 6 \] Compute \( f(-3) \): \[ f(-3) = -2(-3) = 6 \] Since \( f(3) = f(-3) = 6 \) but \( 3 \ne -3 \), the function is NOT one-one. Step 2: Check whether f is onto. For any \( x \in \mathbb{R} \), we have \( |x| \ge 0 \), so \( f(x) = 2|x| \ge 0 \). This means no negative real number can ever be in the range of f. Take \( y = -4 \in \mathbb{R} \). Suppose there exists \( x \in \mathbb{R} \) such that \( f(x) = -4 \). Then \( 2|x| = -4 \), giving \( |x| = -2 \), which is impossible since \( |x| \ge 0 \). Thus \( y = -4 \) has no pre-image in \( \mathbb{R} \), and the range of f is \( [0, \infty) \ne \mathbb{R} \). So the function is NOT onto. Conclusion: \( f(x) = 2|x| \) is neither one-one nor onto.

Answer: f(x) = 2|x| is neither one-one nor onto.

🎯 Try a Similar Question

Try a Similar Question

Question: Consider the Greatest Integer Function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = \lfloor x \rfloor \), where \( \lfloor x \rfloor \) denotes the greatest integer less than or equal to \( x \). Show that \( f \) is neither one-one nor onto.

Solution

  1. Step 1: Recall the definitions: A function \( f \) is one-one (injective) if \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \) for all \( x_1, x_2 \) in the domain. A function \( f \) is onto (surjective) if for every \( y \) in the codomain, there exists at least one \( x \) in the domain such that \( f(x) = y \).
  2. Step 2: Understand the greatest integer function: The greatest integer function assigns to every real number \( x \) the largest integer not exceeding \( x \). For example: \( f(1.2) = 1 \), \( f(1.7) = 1 \), \( f(2.0) = 2 \), and \( f(-0.5) = -1 \).
  3. Step 3: Show f is NOT one-one: Choose \( x_1 = 1.2 \) and \( x_2 = 1.9 \). Then \( f(1.2) = \lfloor 1.2 \rfloor = 1 \) and \( f(1.9) = \lfloor 1.9 \rfloor = 1 \). So \( f(1.2) = f(1.9) = 1 \), yet \( 1.2 \ne 1.9 \). Since two distinct inputs give the same output, \( f \) is NOT one-one.
  4. Step 4: Show f is NOT onto: The range of \( f \) consists only of integers, because \( \lfloor x \rfloor \in \mathbb{Z} \) for every \( x \in \mathbb{R} \). The codomain is \( \mathbb{R} \), which contains non-integer values. Consider \( y = 0.5 \in \mathbb{R} \). There is no \( x \in \mathbb{R} \) such that \( \lfloor x \rfloor = 0.5 \), since the floor function always returns an integer. Hence \( 0.5 \) has no pre-image, and \( f \) is NOT onto.
  5. Step 5: Conclusion: Since \( f \) fails to be one-one (as \( f(1.2) = f(1.9) = 1 \) with \( 1.2 \ne 1.9 \)) and fails to be onto (as \( 0.5 \in \mathbb{R} \) has no pre-image under \( f \)), we conclude that the greatest integer function \( f(x) = \lfloor x \rfloor \) is neither one-one nor onto.

Answer: The greatest integer function \( f(x) = \lfloor x \rfloor \) is not one-one because \( f(1.2) = f(1.9) = 1 \) with \( 1.2 \ne 1.9 \), and it is not onto because non-integer values such as \( 0.5 \) in the codomain \( \mathbb{R} \) have no pre-image (the range of \( f \) is only \( \mathbb{Z} \), not all of \( \mathbb{R} \)). Hence \( f \) is neither one-one nor onto.

Everything you get with Solver7

More questions in Relations and Functions