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
संबंधित प्रश्न
Classify the following function as injection, surjection or bijection : f : Z → Z given by f(x) = x2
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sinx
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : g(x) = |x|
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
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) = x+1, g(x) = `e^x`
.
Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → B, g : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
Write the domain of the real function f defined by f(x) = `sqrt (25 -x^2)` [NCERT EXEMPLAR]
The function
f : A → B defined by
f (x) = - x2 + 6x - 8 is a bijection if
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
Let f be an injective map with domain {x, y, z} 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
Let
\[f : R \to R\] be a function defined by
Let
\[f : R - \left\{ n \right\} \to R\]
\[f : R \to R\] is defined by
\[f\left( x \right) = \frac{e^{x^2} - e^{- x^2}}{e^{x^2 + e^{- x^2}}} is\]
The inverse of the function
\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by
\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is
Let
\[A = \left\{ x \in R : x \leq 1 \right\} and f : A \to A\] be defined as
\[f\left( x \right) = x \left( 2 - x \right)\] Then,
\[f^{- 1} \left( x \right)\] is
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
Mark the correct alternative in the following question:
Let f : R → R be given by f(x) = tanx. Then, f-1(1) is
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
Write about strcmp() function.
Show that the function f: R → R defined by f(x) = `x/(x^2 + 1)`, ∀ ∈ + R , is neither one-one nor onto
Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.
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 C be the set of complex numbers. Prove that the mapping f: C → R given by f(z) = |z|, ∀ z ∈ C, is neither one-one nor onto.
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
f = {(1, 4), (1, 5), (2, 4), (3, 5)}
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
f(x) = `x/2`
Let g(x) = x2 – 4x – 5, then ____________.
Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f is ____________.
If N be the set of all-natural numbers, consider f: N → N such that f(x) = 2x, ∀ x ∈ N, then f is ____________.
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
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.
- Let R: B → G be defined by R = { (b1,g1), (b2,g2),(b3,g1)}, then R is ____________.
A function f: x → y is/are called onto (or surjective) if x under f.
Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if "n is even"):}` Is the function injective? Justify your answer.
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 ______.
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)
The function defined by \[\mathrm{f}(x)=\frac{2x+3}{3x+4},x\neq-\frac{4}{3}\] is
