English

Show that the signum function f : R → R, given by , f(x) = {(1, if x > 0), (0, if x  = 0), (–1, if x < 0):} is neither one-one nor onto.

Advertisements
Advertisements

Question

Show that the signum function f : R → R, given by

`f(x) = {(1", if"  x > 0), (0", if"  x  = 0), (-1", if"  x < 0):}`

is neither one-one nor onto.

Sum
Advertisements

Solution

f : R → R, given by `f(x) = {(1", if"  x > 0), (0", if"  x  = 0), (-1", if"  x < 0):}`

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.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations and Functions - EXERCISE 1.2 [Page 11]

APPEARS IN

NCERT Mathematics Part 1 and 2 [English] Class 12
Chapter 1 Relations and Functions
EXERCISE 1.2 | Q 5. | Page 11

RELATED QUESTIONS

Let f : N → N be defined by f(n) = `{((n+1)/2", if n is odd"),(n/2", if n is even"):}` for all n ∈ N.

State whether the function f is bijective. Justify your answer.


Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.


Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f, g : A → B be functions defined by f(x) = x2 – x, x ∈ A and g(x) = `2|x - 1/2| – 1`, x ∈ A. Are f and g equal?

Justify your answer. (Hint: One may note that two functions f : A → B and g : A → B such that f(a) = g(a) ∀ a ∈ A are called equal functions.)


Give an example of a function which is not one-one but onto ?


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = |x|


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = sin2x + cos2x


Classify the following function as injection, surjection or bijection :

f : Q → Q, defined by f(x) = x3 + 1


Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.


Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.


Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.


Give examples of two functions f : N → N and g : N → N, such that gof is onto but f is not onto.


If f : A → B and g : B → C are onto functions, show that gof is a onto function.


 Find fog and gof  if  : f (x) = ex g(x) = loge x .


Find fog and gof  if : f (x) = x+1, g (x) = sin x .


State with reason whether the following functions have inverse :

g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 2)}


Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.


Which of the following graphs represents a one-one function?


If f : R → R be defined by f(x) = (3 − x3)1/3, then find fof (x).


Let f : R → R be the function defined by f(x) = 4x − 3 for all x ∈ R Then write f .   [NCERT EXEMPLAR]


Let f be an injective map with domain {xyz} and range {1, 2, 3}, such that exactly one of the following statements is correct and the remaining are false.

\[f\left( x \right) = 1, f\left( y \right) \neq 1, f\left( z \right) \neq 2 .\]

The value of

\[f^{- 1} \left( 1 \right)\] is 

 


If the function\[f : R \to \text{A given by} f\left( x \right) = \frac{x^2}{x^2 + 1}\] is a surjection, then A =

 

 


If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =


Let \[f\left(x\right) = x^3\] be a function with domain {0, 1, 2, 3}. Then domain of \[f^{-1}\] is ______.


Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1 


If A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A onto A. Find f–1


The domain of the function f: R → R defined by f(x) = `sqrt(x^2 - 3x + 2)` is ______


For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.


If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is ______.


Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.


Let f : R → R be a function defined by f(x) `= ("e"^abs"x" - "e"^-"x")/("e"^"x" + "e"^-"x")` then f(x) is


Let A = R – {3}, B = R – {1}. Let f : A → B be defined by `"f"("x") = ("x" - 2)/("x" - 3)` Then, ____________.


Let f : R `->` R be a function defined by f(x) = x3 + 4, then f is ______.


A function f: x → y is said to be one – one (or injective) if:


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is


If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n"  "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.


Let S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f: S `rightarrow` S such that f(m.n) = f(m).f(n) for every m, n ∈ S and m.n ∈ S is equal to ______.


If f : R `rightarrow` R is defined by `f(x) = (2x - 7)/4`, show that f(x) is one-one and onto.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×