English

Let (A) Injective but Not Surjective (B) Surjective but Not Injective (C) Bijective (D) None of These

Advertisements
Advertisements

Question

Let 

\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is 

 

Options

  • injective but not surjective

  • surjective but not injective

  • bijective

  • none of these

MCQ
Advertisements

Solution

Injectivity:
Let x and y be any two elements in the domain A.

Case-1: Let x and y be two positive numbers, such that

\[f\left( x \right) = f\left( y \right)\]
\[ \Rightarrow x\left| x \right| = y\left| y \right|\]
\[ \Rightarrow x\left( x \right) = y\left( y \right)\]
\[ \Rightarrow x^2 = y^2 \]
\[ \Rightarrow x = y\]

Case-2: Let x and y be two negative numbers, such that

\[f\left( x \right) = f\left( y \right)\]
\[ \Rightarrow x\left| x \right| = y\left| y \right|\]
\[ \Rightarrow x\left( - x \right) = y\left( - y \right)\]
\[ \Rightarrow - x^2 = - y^2 \]
\[ \Rightarrow x^2 = y^2 \]
\[ \Rightarrow x = y\]

Case-3: Let be positive and y be negative.

\[\text{Then},x \neq y\]
\[ \Rightarrow f\left( x \right) = x\left| x \right| \text{is positive and}\]
\[f\left( y \right) = y\left| y \right| \text{is negative}\]
\[ \Rightarrow f\left( x \right) \neq f\left( y \right)\]
\[So, x \neq y\]
\[ \Rightarrow f\left( x \right) \neq f\left( y \right)\]

From the 3 cases, we can conclude that  f is one-one.
Surjectivity:
Let y be an element in the co-domain, such that y = f (x)

\[\text{Case}-1: \text{Lety}>0. \text{Then}, 0<y\leq1\]
\[ \Rightarrow y = f\left( x \right) = x\left| x \right| > 0\]
\[ \Rightarrow x > 0\]
\[ \Rightarrow \left| x \right| = x\]
\[f\left( x \right) = y\]
\[ \Rightarrow x\left| x \right| = y\]
\[ \Rightarrow x\left( x \right) = y\]
\[ \Rightarrow x^2 = y\]
\[ \Rightarrow x = \sqrt{y} \in A \left( \text{ We do not get \pm because }x>0 \right)\]
\[\text{Case}-2: \text{Lety}<0. Then, -1\leq y<0\]
\[ \Rightarrow y = f\left( x \right) = x\left| x \right| < 0\]
\[ \Rightarrow x < 0\]
\[ \Rightarrow \left| x \right| = - x\]
\[f\left( x \right) = y\]
\[ \Rightarrow x\left| x \right| = y\]
\[ \Rightarrow x\left( - x \right) = y\]
\[ \Rightarrow - x^2 = y\]
\[ \Rightarrow x^2 = - y\]
\[ \Rightarrow x = \sqrt{-y} \in A \left( \text{ We do not get ± because }x>0 \right)\]

⇒ f is onto.

⇒ f is a bijection.

So, the answer is (c).

shaalaa.com
  Is there an error in this question or solution?
Chapter 2: Functions - Exercise 2.6 [Page 75]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 2 Functions
Exercise 2.6 | Q 7 | Page 75

RELATED QUESTIONS

Check the injectivity and surjectivity of the following function:

f : R → R given by f(x) = x2


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.


Give examples of two functions fN → Z and gZ → Z such that g o f is injective but gis not injective.

(Hint: Consider f(x) = x and g(x) =|x|)


Classify the following function as injection, surjection or bijection :  f : Z → Z given by f(x) = x3


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) = x3 + 1


Set of ordered pair of  a function? If so, examine whether the mapping is injective or surjective :{(xy) : x is a person, y is the mother of x}


Show that the logarithmic function  f : R0+ → R   given  by f (x)  loga x ,a> 0   is   a  bijection.


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 : N → N be defined by

`f(n) = { (n+ 1, if n  is  odd),( n-1 , if n  is  even):}`

Show that f is a bijection. 

                      [CBSE 2012, NCERT]


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


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


If f(x) = |x|, prove that fof = f.


Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.


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.


If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).


 \[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, then

 

 

 

 


A function f  from the set of natural numbers to integers defined by

`{([n-1]/2," when  n is  odd"   is ),(-n/2,when  n  is  even ) :}`

 

 


The  function f : [-1/2, 1/2, 1/2] → [-π /2,π/2], defined by f (x) = `sin^-1` (3x - `4x^3`), is

 


Let

\[f : R \to R\]
\[f\left( x \right) = \frac{x^2 - 8}{x^2 + 2}\]
Then,  f is


If the function

\[f : R \to R\]  be such that

\[f\left( x \right) = x - \left[ x \right]\] where [x] denotes the greatest integer less than or equal to x, then \[f^{- 1} \left( x \right)\]

 


 Let
\[g\left( x \right) = 1 + x - \left[ x \right] \text{and} f\left( x \right) = \begin{cases}- 1, & x < 0 \\ 0, & x = 0, \\ 1, & x > 0\end{cases}\] where [x] denotes the greatest integer less than or equal to x. Then for all \[x, f \left( g \left( x \right) \right)\] is equal to


The distinct linear functions that map [−1, 1] onto [0, 2] are


If \[f : R \to R\] is given by \[f\left( x \right) = x^3 + 3, \text{then} f^{- 1} \left( x \right)\] is equal to

 


Mark the correct alternative in the following question:
Let f : R→ R be defined as, f(x) =  \[\begin{cases}2x, if x > 3 \\ x^2 , if 1 < x \leq 3 \\ 3x, if x \leq 1\end{cases}\] 

Then, find f( \[-\]1) + f(2) + f(4)

 


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


If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))


Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not

g = {(1, 4), (2, 4), (3, 4)}


The number of bijective functions from set A to itself when A contains 106 elements is ____________.


Let g(x) = x2 – 4x – 5, then ____________.


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


The function f: R → R defined as f(x) = x3 is:


If f: R → R given by f(x) =(3 − x3)1/3, find f0f(x)


A function f: x → y is/are called onto (or surjective) if x under f.


Consider a set containing function A= {cos–1cosx, sin(sin–1x), sinx((sinx)2 – 1), etan{x}, `e^(|cosx| + |sinx|)`, sin(tan(cosx)), sin(tanx)}. B, C, D, are subsets of A, such that B contains periodic functions, C contains even functions, D contains odd functions then the value of n(B ∩ C) + n(B ∩ D) is ______ where {.} denotes the fractional part of functions)


Let x is a real number such that are functions involved are well defined then the value of `lim_(t→0)[max{(sin^-1  x/3 + cos^-1  x/3)^2, min(x^2 + 4x + 7)}]((sin^-1t)/t)` where [.] is greatest integer function and all other brackets are usual brackets.


A function f : [– 4, 4] `rightarrow` [0, 4] is given by f(x) = `sqrt(16 - x^2)`. Show that f is an onto function but not a one-one function. Further, find all possible values of 'a' for which f(a) = `sqrt(7)`.


ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.

REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×