मराठी

Let a = { X : − 1 ≤ X ≤ 1 } and F : a → a Such that F ( X ) = X | X | (A) a Bijection (B) Injective but Not Surjective (C) Surjective but Not Injective (D) Neither Injective Nor Surjective

Advertisements
Advertisements

प्रश्न

Let

\[A = \left\{ x : - 1 \leq x \leq 1 \right\} \text{and} f : A \to \text{A such that f}\left( x \right) = x|x|\]

 

पर्याय

  • a bijection

  • injective but not surjective

  • surjective but not injective

  • neither injective nor surjective

MCQ
Advertisements

उत्तर

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)\]
So, f is one-one.
Surjectivity:
Let y be an element in the co-domain, such that y = f (x)
\[Case-1: \text{Let } y>0. \text{Then}, 0<y\leq1\] 
\[y = f\left( x \right) = x\left| x \right| > 0\] 
\[ \Rightarrow x > 0\] 
\[ \Rightarrow \left| x \right| = x\] 
\[ \Rightarrow 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, \text{as } x > 0 \right)\] \[\] \[Case-2: Lety<0.\text{Then},-1\leq y<0\] 
\[y = f\left( x \right) = x\left| x \right| < 0\] 
\[ \Rightarrow x < 0\] 
\[ \Rightarrow \left| x \right| = - x\] 
\[ \Rightarrow 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}\pm, \text{ as } x>0 \right)\]
\[\Rightarrow\]is onto
\[\Rightarrow\] is a bijection.
So, the answer is (a).
shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 2: Functions - Exercise 2.6 [पृष्ठ ७६]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 2 Functions
Exercise 2.6 | Q 16 | पृष्ठ ७६

व्हिडिओ ट्यूटोरियलVIEW ALL [5]

संबंधित प्रश्‍न

Let f : R → R be defined as f(x) = x4. Choose the correct answer.


Let f : R → R be defined as f(x) = 3x. Choose the correct answer.


Which of the following functions from A to B are one-one and onto?
 f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}


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


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = 3 − 4x


If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.


If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.


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.


Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.


Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = x2 + 8 and g(x) = 3x3 + 1 .


Find gof and fog when f : R → R and g : R → R is  defined by  f(x) = 8x3 and  g(x) = x1/3.


Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.


Consider f : {1, 2, 3} → {abc} and g : {abc} → {apple, ball, cat} defined as f (1) = af (2) = bf (3) = cg (a) = apple, g (b) = ball and g (c) =  cat. Show that fg and gof are invertible. Find f−1g−1 and gof−1and show that (gof)−1 = f 1o g−1


If f : Q → Qg : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −1.


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


Let f : R → Rg : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).


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


 \[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 ) :}`

 

 


 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


Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is


Let A be a finite set. Then, each injective function from A into itself is not surjective.


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


Let D be the domain of the real valued function f defined by f(x) = `sqrt(25 - x^2)`. Then, write D


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


Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(a, b): a is a person, b is an ancestor of a}


Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:

f(x) = `x/2`


Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto


Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.


Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, is ____________.


An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wants to know among those relations, how many functions can be formed from B to G?

Let f: R→R be defined as f(x) = 2x – 1 and g: R – {1}→R be defined as g(x) = `(x - 1/2)/(x - 1)`. Then the composition function f (g(x)) is ______.


Let a and b are two positive integers such that b ≠ 1. Let g(a, b) = Number of lattice points inside the quadrilateral formed by lines x = 0, y = 0, x = b and y = a. f(a, b) = `[a/b] + [(2a)/b] + ... + [((b - 1)a)/b]`, then the value of `[(g(101, 37))/(f(101, 37))]` is ______.

(Note P(x, y) is lattice point if x, y ∈ I)

(where [.] denotes greatest integer function)


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)`.


In the function from \(X\) to \(Y\), if \(6\in Y\) is not the image of any element of \(X\), the function is:


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×