Question:

Show that the Signum Function f: R\(\to\)R, given by 

\[f(x) =   \begin{cases}     1,       & \quad \text{if } x \text{ >0}\\     0,  & \quad \text{if } n \text{ =0}\\ -1,  & \quad \text{if } x \text{ <0}  \end{cases}\]

is neither one-one nor onto.

Updated On: Aug 28, 2023
Hide Solution
collegedunia
Verified By Collegedunia

Solution and Explanation

f: R \(\to\) R is given by,
\(f(x) =   \begin{cases}     1,       & \quad \text{if } x \text{ >0}\\     0,  & \quad \text{if } n \text{ =0}\\ -1,  & \quad \text{if } x \text{ <0}  \end{cases}\)
It is seen that f(1) = f(2) = 1, but 1 ≠ 2. 
∴f is not one-one. 
Now, as f(x) takes only 3 values (1, 0, or −1) for the element −2 in co-domain R, there does not exist any x in domain R such that f(x) = −2. 
∴ f is not onto. 

Hence, the signum function is neither one-one nor onto. 

Was this answer helpful?
0
0

Concepts Used:

Types of Functions

Types of Functions

One to One Function

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. 

Many to One Function

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.

Onto Function

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. 

One – One and 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