SOLVER7 Study. Nothing Else.
Exercise 1.2 Q5

Show that the Signum Function \( f : R → R, \) given by \(f(x)=\)\begin{cases}\text{1, if x>0}\\[2ex] \text{ 0, if x=0} \\[2ex] \text{1, if x<0 }\end {cases} is neither one-one nor onto.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that looks at any number and gives only three labels: 'positive', 'zero', or 'negative'. The Signum function works exactly like that machine. Two completely different numbers, like 1 and 2, both get the same label 'positive', so the machine is not one-one. Also, the machine can never output a label like '2' or '5', so many real numbers are left out, making it not onto. The range is stuck at just three values: \( -1 \), \( 0 \), and \( 1 \).

Answer: The Signum function is neither one-one (since \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \)) nor onto (since a value like \( 2 \) in the codomain \( \mathbb{R} \) has no pre-image, as the range is only \( \{-1, 0, 1\} \)).

📖 Signum Function: Neither One-One Nor Onto

Detailed Explanation

The Signum function \( f : \mathbb{R} \to \mathbb{R} \) is defined as \[f(x) = \begin{cases} 1 & x > 0 \\ 0 & x = 0 \\ -1 & x < 0 \end{cases}\] A function is called one-one (injective) if different inputs always give different outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). A function is called onto (surjective) if every element of the codomain has at least one pre-image in the domain. Here the codomain is all of \( \mathbb{R} \), but the Signum function can only output the three values \( -1, 0, 1 \). To disprove one-one or onto, we only need a single counterexample.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \) in the codomain, there exists \( x \) in the domain with \( f(x) = y \).

Solution

  1. Step 1: Recall the definition of the Signum function. For any positive number the output is \( 1 \), for zero the output is \( 0 \), and for any negative number the output is \( -1 \). So the range (set of actual outputs) is only \( \{-1, 0, 1\} \).
  2. Step 2: Check whether the function is one-one. Take two different positive numbers, for example \( x_1 = 1 \) and \( x_2 = 2 \). Then \( f(1) = 1 \) and \( f(2) = 1 \).
  3. Step 3: Here \( f(1) = f(2) = 1 \) but \( 1 \ne 2 \). Two different inputs produced the same output, which violates the one-one condition. Therefore \( f \) is not one-one.
  4. Step 4: Check whether the function is onto. The codomain is \( \mathbb{R} \), so onto would require every real number to be an output of \( f \). But the only possible outputs are \( -1, 0, 1 \).
  5. Step 5: Pick any real number that is not in the range, for example \( y = 2 \). There is no real \( x \) for which \( f(x) = 2 \), because the function never outputs \( 2 \). So \( 2 \) has no pre-image, which violates the onto condition. Therefore \( f \) is not onto.
  6. Step 6: Since \( f \) fails both the one-one test (Step 3) and the onto test (Step 5), the Signum function is neither one-one nor onto.

Final Answer

The Signum function is neither one-one (since \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \)) nor onto (since a value like \( 2 \) in the codomain \( \mathbb{R} \) has no pre-image, as the range is only \( \{-1, 0, 1\} \)).

Common Mistake

A common mistake is thinking the function is onto because it 'uses' its outputs. Onto is decided against the given codomain \( \mathbb{R} \), not the range. Since the range \( \{-1, 0, 1\} \) is much smaller than \( \mathbb{R} \), the function cannot be onto.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the definition of the Signum function \( f : \mathbb{R} \to \mathbb{R} \). Every positive input maps to \( 1 \), zero maps to \( 0 \), and every negative input maps to \( -1 \). — Reason: Knowing exactly which output each input produces tells us the complete range, which is \( \\{-1, 0, 1\\} \), a set containing only three values even though the domain is all of \( \mathbb{R} \).
  2. Step 2: To test whether \( f \) is one-one, pick two distinct positive numbers, say \( x_1 = 1 \) and \( x_2 = 2 \). Compute their images: \( f(1) = 1 \) and \( f(2) = 1 \). — Reason: For a function to be one-one, distinct inputs must always produce distinct outputs. Choosing two positive numbers is a quick way to check this, since every positive number gives the same output \( 1 \).
  3. Step 3: Observe that \( f(1) = f(2) = 1 \) yet \( 1 \ne 2 \). This is a direct counterexample to the one-one condition. — Reason: The definition of one-one requires \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), but here equal outputs do not force equal inputs, so \( f \) is not one-one.
  4. Step 4: Now test whether \( f \) is onto. The codomain is \( \mathbb{R} \), so every real number must be an output of \( f \) for the function to be onto. Ask: does the value \( 2 \in \mathbb{R} \) have any pre-image? — Reason: Identifying a single element of the codomain with no pre-image is enough to prove the function is not onto.
  5. Step 5: Check whether any \( x \in \mathbb{R} \) satisfies \( f(x) = 2 \). Since the only possible outputs of \( f \) are \( -1 \), \( 0 \), and \( 1 \), the equation \( f(x) = 2 \) has no solution. — Reason: The range of \( f \) is \( \\{-1, 0, 1\\} \), which does not contain \( 2 \), confirming that \( 2 \) has no pre-image in the domain.
  6. Step 6: Conclude: because \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \), the function is not one-one; and because \( 2 \in \mathbb{R} \) has no pre-image (the range is only \( \\{-1, 0, 1\\} \)), the function is not onto. — Reason: Both conditions fail with explicit counterexamples, so neither property holds for the Signum function.

Final Answer

The Signum function is neither one-one (since \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \)) nor onto (since a value like \( 2 \) in the codomain \( \mathbb{R} \) has no pre-image, as the range is only \( \{-1, 0, 1\} \)).

Common Mistake

One common mistake: students sometimes confuse the range with the codomain and wrongly conclude the function is onto — remember, the codomain here is all of \( \mathbb{R} \), not just \( \\{-1, 0, 1\\} \), so onto requires every real number (including values like \( 2 \) or \( -5 \)) to be achieved, which the Signum function cannot do.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Signum function: \[f(x) = \begin{cases} 1 & x > 0 \\ 0 & x = 0 \\ -1 & x < 0 \end{cases}\] Range \( = \{-1, 0, 1\} \subset \mathbb{R} \)
  2. Step 2: Not one-one: \( f(1) = f(2) = 1 \) but \( 1 \ne 2 \)
  3. Step 3: Not onto: \( 2 \in \mathbb{R} \) (codomain) has no pre-image since Range \( = \{-1, 0, 1\} \ne \mathbb{R} \)

Answer: The Signum function is neither one-one (since \( f(1) = f(2) = 1 \) with \( 1 \ne 2 \)) nor onto (since a value like \( 2 \) in the codomain \( \mathbb{R} \) has no pre-image, as the range is only \( \{-1, 0, 1\} \)).

➕ More Examples

More Examples

Example 1

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

Solution: Step 1 — Check one-one (injective). We need to check whether distinct inputs always produce distinct outputs. Consider \( x_1 = 1 \) and \( x_2 = 3 \). Both satisfy \( x > 0 \), so \( f(1) = 2 \) and \( f(3) = 2 \). Thus \( f(x_1) = f(x_2) \) but \( x_1 \ne x_2 \). Hence \( f \) is NOT one-one. Step 2 — Check onto (surjective). The range of \( f \) consists only of the values taken by the three cases: \[\text{Range}(f) = \{-2,\, 0,\, 2\}\] The codomain is \( \mathbb{R} \). Since \( 1 \in \mathbb{R} \) but \( 1 \notin \{-2, 0, 2\} \), the element \( 1 \) has no pre-image in \( \mathbb{R} \). Hence Range\( (f) \ne \mathbb{R} \), so \( f \) is NOT onto. Conclusion: \( f \) is neither one-one nor onto.

Answer: f is neither one-one (e.g. f(1) = f(3) = 2) nor onto (e.g. 1 has no pre-image), since the range is only {-2, 0, 2} which is a proper subset of R.

Example 2

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

Solution: Step 1 — Check one-one (injective). Consider \( x_1 = 2 \) and \( x_2 = 5 \). Both satisfy \( x > 1 \), so \( g(2) = 3 \) and \( g(5) = 3 \). Since \( g(x_1) = g(x_2) \) but \( x_1 \ne x_2 \), \( g \) is NOT one-one. (Similarly, \( g(0) = g(0.5) = 0 \) for the middle piece confirms the failure of injectivity.) Step 2 — Check onto (surjective). For each piece of the definition, the output is a single constant. So the range of \( g \) is: \[\text{Range}(g) = \{-3,\, 0,\, 3\}\] The codomain is \( \mathbb{R} \). Consider \( y = 7 \). We need \( g(x) = 7 \) for some \( x \in \mathbb{R} \). For \( x > 1 \): \( g(x) = 3 \ne 7 \). For \( -1 \le x \le 1 \): \( g(x) = 0 \ne 7 \). For \( x < -1 \): \( g(x) = -3 \ne 7 \). No \( x \in \mathbb{R} \) satisfies \( g(x) = 7 \), so \( g \) is NOT onto. Conclusion: \( g \) is neither one-one nor onto.

Answer: g is neither one-one (e.g. g(2) = g(5) = 3) nor onto (e.g. 7 has no pre-image), since the range is only {-3, 0, 3}, a proper subset of R.

🎯 Try a Similar Question

Try a Similar Question

Question: Consider the function \( g : \mathbb{R} \to \mathbb{R} \) defined by \[g(x) = \begin{cases} 2, & x > 0 \\ 0, & x = 0 \\ -2, & x < 0 \end{cases}\] Show that \( g \) is neither one-one nor onto.

Solution

  1. Step 1: Understanding the Function: The function \( g : \mathbb{R} \to \mathbb{R} \) assigns the value \( 2 \) to every positive real number, \( 0 \) to the input \( 0 \), and \( -2 \) to every negative real number. The domain and codomain are both \( \mathbb{R} \).
  2. Step 2: Checking One-One (Injectivity): A function is one-one if \( g(x_1) = g(x_2) \) implies \( x_1 = x_2 \). Consider two distinct positive real numbers, say \( x_1 = 3 \) and \( x_2 = 5 \). Since both are positive, \( g(3) = 2 \) and \( g(5) = 2 \). So \( g(3) = g(5) \) but \( 3 \ne 5 \). This violates the one-one condition, so \( g \) is NOT one-one.
  3. Step 3: Checking Onto (Surjectivity): A function is onto if every element of the codomain has a pre-image in the domain. The range of \( g \) consists only of the values that \( g \) can actually produce. Since \( g(x) \) equals either \( 2 \), \( 0 \), or \( -2 \) for any \( x \in \mathbb{R} \), the range of \( g \) is \( \{-2,\, 0,\, 2\} \).
  4. Step 4: Identifying a Missing Pre-image: Consider the element \( 1 \) in the codomain \( \mathbb{R} \). We need some \( x \in \mathbb{R} \) such that \( g(x) = 1 \). But \( g(x) \) can only take the values \( -2 \), \( 0 \), or \( 2 \), never \( 1 \). Therefore, \( 1 \in \mathbb{R} \) has no pre-image, and \( g \) is NOT onto.
  5. Step 5: Conclusion: Since \( g(3) = g(5) = 2 \) with \( 3 \ne 5 \), the function \( g \) is not one-one. Since the range of \( g \) is \( \{-2, 0, 2\} \ne \mathbb{R} \) (the codomain), the function \( g \) is not onto. Hence, \( g \) is neither one-one nor onto.

Answer: The function \( g \) is neither one-one (since \( g(3) = g(5) = 2 \) with \( 3 \ne 5 \)) nor onto (since the element \( 1 \) in the codomain \( \mathbb{R} \) has no pre-image, as the range of \( g \) is only \( \{-2, 0, 2\} \)).

Everything you get with Solver7

More questions in Relations and Functions