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
CBSE Class 12 Maths · Relations and Functions
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\} \)).
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.
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 \).
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\} \)).
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.
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\} \)).
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.
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\} \)).
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.
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.
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.
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\} \)).