Q.Show that the Signum Function , given by is neither one-one nor onto.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The signum function is neither one-one (because multiple inputs map to the same output, e.g., all positive numbers map to 1) nor onto (because the codomain is all real numbers, but the function only outputs −1, 0, 1 — so most real numbers are never reached).
The signum function is a classic example of a function that fails both injectivity and surjectivity. Let’s see why, step by step.
1. What does “one-one” (injective) mean?
A function is one-one if different inputs always give different outputs. Equivalently: if , then we must have .
Now look at the signum function. Take any two positive numbers, say and .
and . So but .
That’s a direct violation of the one-one condition.
A common mistake is to think that because the function has three distinct outputs (−1, 0, 1), it might be one-one. But one-one is about each output coming from exactly one input — here, the output 1 comes from infinitely many inputs (all positive reals), and so does −1 (all negative reals). So it’s far from injective.
Thus, is not one-one.
2. What does “onto” (surjective) mean?
A function is onto if every element of the codomain is actually an output of the function — i.e., for every , there exists some such that .
Here, the codomain is , the set of all real numbers. But the signum function only ever outputs three values: , , and .
Pick any number not in , say or or . There is no real for which equals that number. So the function misses almost all real numbers. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.