Show that the modulus function $f : R \rightarrow R$ given by $f(x) = |x|$ is neither one-one nor onto,where $|x| = x$ if $x \ge 0$ and $|x| = -x$ if $x < 0$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) The function $f: R \rightarrow R$ is defined as $f(x) = |x| = \begin{cases} x & \text{if } x \ge 0 \\ -x & \text{if } x < 0 \end{cases}$.
To check if $f$ is one-one:
Consider $f(-1) = |-1| = 1$ and $f(1) = |1| = 1$.
Since $f(-1) = f(1)$ but $-1 \neq 1$,the function $f$ is not one-one.
To check if $f$ is onto:
Consider the codomain $R$. For any negative value,such as $-1 \in R$,there exists no $x \in R$ such that $f(x) = |x| = -1$,because the absolute value of any real number is always non-negative $(|x| \ge 0)$.
Therefore,$f$ is not onto.
Hence,the modulus function is neither one-one nor onto.

Explore More

Similar Questions

Let a function $f: N \rightarrow N$ be defined by
$f(n) = \begin{cases} 2n, & n = 2, 4, 6, 8, \dots \\ n-1, & n = 3, 7, 11, 15, \dots \\ \frac{n+1}{2}, & n = 1, 5, 9, 13, \dots \end{cases}$
Then,$f$ is

Show that a one-one function $f: \{1, 2, 3\} \rightarrow \{1, 2, 3\}$ must be onto.

Let $x$ denote the total number of one-one functions from a set $A$ with $3$ elements to a set $B$ with $5$ elements,and $y$ denote the total number of one-one functions from the set $A$ to the set $A \times B$. Then ...... .

The mapping $f: R \to R$ defined as $f(x) = \cos x, x \in R$ is:

$A$ function from $A = \{x : -1 \leq x \leq 1\}$ to itself which is not a bijection is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo