Q.Show that the Modulus Function , given by , is neither one-one nor onto, where is , if is positive or 0 and is , if is negative.
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 modulus function fails to be one‑one because distinct inputs (like and ) map to the same output, and it fails to be onto because its range is only , not all of .
We need to check two properties: injectivity (one‑one) and surjectivity (onto).
A function is one‑one if different inputs always give different outputs.
A function is onto if every possible output in the codomain is actually reached by some input.
The modulus function takes any real number and returns its non‑negative distance from zero. That single fact is the key to both failures.
- Checking one‑one (injectivity) For to be one‑one, must imply . Take and . Then
So but .
This is a direct counterexample: two different numbers give the same output.
Hence is not one‑one.
A common mistake is to think that because is “symmetric”, it might still be one‑one on a restricted domain. But on all of , the symmetry guarantees that every positive number has a negative partner with the same image.
- Checking onto (surjectivity) …
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.