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 : R → R given by f(x) = x2
Prove that the greatest integer function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
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.
Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Show that the function f: ℝ → ℝ defined by f(x) = `x/(x^2 + 1), ∀x in R`is neither one-one nor onto. Also, if g: ℝ → ℝ is defined as g(x) = 2x - 1. Find fog(x)
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sinx
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and g(x) = x2 + 5 .
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
Find fog and gof if : f (x) = x+1, g(x) = `e^x`
.
Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.
` if f : (-π/2 , π/2)` → R and g : [−1, 1]→ R be defined as f(x) = tan x and g(x) = `sqrt(1 - x^2)` respectively, describe fog and gof.
Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
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.
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Let A = R - {3} and B = R - {1}. Consider the function f : A → B defined by f(x) = `(x-2)/(x-3).`Show that f is one-one and onto and hence find f-1.
[CBSE 2012, 2014]
Let f : [−1, ∞) → [−1, ∞) be given by f(x) = (x + 1)2 − 1, x ≥ −1. Show that f is invertible. Also, find the set S = {x : f(x) = f−1 (x)}.
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
If f : C → C is defined by f(x) = x4, write f−1 (1).
If f : {5, 6} → {2, 3} and g : {2, 3} → {5, 6} are given by f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, then find fog. [NCERT EXEMPLAR]
Which of the following functions from
to itself are bijections?
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^2 and g\left( x \right) = 2^x\] Then, the solution set of the equation
If \[g \left( f \left( x \right) \right) = \left| \sin x \right| \text{and} f \left( g \left( x \right) \right) = \left( \sin \sqrt{x} \right)^2 , \text{then}\]
Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is
Write about strcmp() function.
Let R be the set of real numbers and f: R → R be the function defined by f(x) = 4x + 5. Show that f is invertible and find f–1.
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.
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.
Let D be the domain of the real valued function f defined by f(x) = `sqrt(25 - x^2)`. Then, write D
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 A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f 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?
If f: R → R given by f(x) =(3 − x3)1/3, find f0f(x)
If `f : R -> R^+ U {0}` be defined by `f(x) = x^2, x ∈ R`. The mapping is
A function is onto when every element of the codomain has:
