Show that the Modulus Function f: R\(\to\)R given by f(x) = IxI, is neither one-one nor onto, where IxI is x, if x is positive or 0 and IxI is −x, if x is negative.
f: R\(\to\)R is given by,
\[f(x) = |x|= \begin{cases} x, & \quad \text{if } x {\geq0}\\ -x, & \quad \text{if } n {<0} \end{cases}\]It is seen that f(-1)=I-1I=1, f(1)=I1I=1.
∴f(−1) = f(1), but −1 ≠ 1.
∴ f is not one-one.
Now, consider −1 ∈ R.
It is known that f(x) = is always non-negative. Thus, there does not exist any element x in domain R such that f(x) = = −1.
∴ f is not onto.
Hence, the modulus function is neither one-one nor onto.
LIST I | LIST II | ||
A. | Range of y=cosec-1x | I. | R-(-1, 1) |
B. | Domain of sec-1x | II. | (0, π) |
C. | Domain of sin-1x | III. | [-1, 1] |
D. | Range of y=cot-1x | IV. | \([\frac{-π}{2},\frac{π}{2}]\)-{0} |
What is the Planning Process?
A function is said to be one to one function when f: A → B is One to One if for each element of A there is a distinct element of B.
A function which maps two or more elements of A to the same element of set B is said to be many to one function. Two or more elements of A have the same image in B.
If there exists a function for which every element of set B there is (are) pre-image(s) in set A, it is Onto Function.
A function, f is One – One and Onto or Bijective if the function f is both One to One and Onto function.
Read More: Types of Functions