Skip to content
Exercise 1.2 · Q4

Q.Show that the Modulus Function f:R→Rf: \mathbf{R} \rightarrow \mathbf{R}, given by f(x)=∣x∣f(x) = |x|, is neither one-one nor onto, where ∣x∣|x| is xx, if xx is positive or 0 and ∣x∣|x| is −x-x, if xx is negative.

Sikkim CbseNCERTSubjective· 3mImportance★★★★★
25% · 26/104 Questions
🔒 Locked · start free trial →

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 f(x)=∣x∣f(x)=|x| fails to be one‑one because distinct inputs (like 22 and −2-2) map to the same output, and it fails to be onto because its range is only [0,∞)[0,\infty), not all of R\mathbb{R}.

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.


  1. Checking one‑one (injectivity) For ff to be one‑one, f(a)=f(b)f(a) = f(b) must imply a=ba = b. Take a=2a = 2 and b=−2b = -2. Then

f(2)=∣2∣=2,f(−2)=∣−2∣=2.f(2) = |2| = 2, \quad f(-2) = |-2| = 2.

So f(2)=f(−2)f(2) = f(-2) but 2≠−22 \neq -2.

This is a direct counterexample: two different numbers give the same output.

Hence ff is not one‑one.

Watch out

A common mistake is to think that because ∣x∣|x| is “symmetric”, it might still be one‑one on a restricted domain. But on all of R\mathbb{R}, the symmetry guarantees that every positive number has a negative partner with the same image.

  1. 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.