Advertisements
Advertisements
Question
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.
Options
True
False
Advertisements
Solution
This statement is False.
APPEARS IN
RELATED QUESTIONS
Show that the function f in `A=R-{2/3} ` defined as `f(x)=(4x+3)/(6x-4)` is one-one and onto hence find f-1
Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f(x) = `((x - 2)/(x - 3))`. Is f one-one and onto? Justify your answer.
Show that the function f : R → R given by f(x) = x3 is injective.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto
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) = sinx
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sin2x + cos2x
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : g(x) = |x|
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and g(x) = x2 + 5 .
If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(1) fog
(2) gof
(3) fof
(4) f2
Also, show that fof ≠ f2
` 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.
Let f be a function from R to R, such that f(x) = cos (x + 2). Is f invertible? Justify your answer.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Which one of the following graphs represents a function?
Let \[f : \left[ - \frac{\pi}{2}, \frac{\pi}{2} \right] \to\] A be defined by f(x) = sin x. If f is a bijection, write set A.
Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. State whether f is one-one or not.
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]
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
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 ) :}`
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f is
Let \[f\left( x \right) = x^2 and g\left( x \right) = 2^x\] Then, the solution set of the equation
Let \[f\left( x \right) = \frac{\alpha x}{x + 1}, x \neq - 1\] Then, for what value of α is \[f \left( f\left( x \right) \right) = x?\]
Let the function f: R → R be defined by f(x) = cosx, ∀ x ∈ R. Show that f is neither one-one nor onto
If f(x) = (4 – (x – 7)3}, then f–1(x) = ______.
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f: N → A defined by f(2n – 1) = 0, f(2n) = 1, ∀ n ∈ N, is onto.
The number of bijective functions from set A to itself when A contains 106 elements is ____________.
Let g(x) = x2 – 4x – 5, 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.
- Ravi wants to find the number of injective functions from B to G. How many numbers of injective functions are possible?
A function f: x → y is/are called onto (or surjective) if x under f.
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is
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 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.
Let a function `f: N rightarrow N` be defined by
f(n) = `{:[(2n",", n = 2"," 4"," 6"," 8","......),(n - 1",", n = 3"," 7"," 11"," 15","......),((n + 1)/2",", n = 1"," 5"," 9"," 13","......):}`
then f is ______.
Which one of the following graphs is a function of x?
 |
 |
| Graph A | Graph B |
If f : R `rightarrow` R is defined by `f(x) = (2x - 7)/4`, show that f(x) is one-one and onto.
A function is onto when every element of the codomain has:
