Advertisements
Advertisements
प्रश्न
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
पर्याय
injective but not surjective
surjective but not injective
bijective
none of these
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 x 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).
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : Z → Z given by f(x) = x3
Give an example of a function which is one-one but not onto ?
Which of the following functions from A to B are one-one and onto ?
f3 = {(a, x), (b, x), (c, z), (d, z)} ; A = {a, b, c, d,}, B = {x, y, z}.
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x2
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 : Z → Z, defined by f(x) = x2 + x
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
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) = x and g(x) = |x| .
Let A = {a, b, c}, B = {u v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Find fog and gof if : f (x) = x2 g(x) = cos x .
If f(x) = |x|, prove that fof = f.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
If f : C → C is defined by f(x) = x4, write f−1 (1).
If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).
The function
\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
Let
\[f : R \to R\] be a function defined by
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)\]
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)
If f(x) = `(x+3)/(4x−5) , "g"(x) = (3+5x)/(4x−1)` then verify that `("fog") (x)` = x.
Which function is used to check whether a character is alphanumeric or not?
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.
Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1
If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))
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 = R – {3}, B = R – {1}. Let f: A → B be defined by f(x) = `(x - 2)/(x - 3)` ∀ x ∈ A . Then show that f is bijective.
Let f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers is ____________.
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
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 ______.
`x^(log_5x) > 5` implies ______.
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)
Find the domain of sin–1 (x2 – 4).
