Advertisements
Advertisements
प्रश्न
If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.
Advertisements
उत्तर
Given, f : A → B and g : B → C are one - one.
Then, gof : A → B
Let us take two elements x and y from A, such that
(gof) (x) = (gof) (y)
⇒ g (f (x)) = g (f (y))
⇒ f (x) = f (y) (As, g is one-one)
⇒ x = y (As, f is one-one)
Hence, gof is one-one.
APPEARS IN
संबंधित प्रश्न
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.
Show that the modulus function f : R → R, given by f(x) = |x|, is neither one-one nor onto, where |x| is x, if x is positive or 0 and |x| is –x, if x is negative.
Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.
F = {(a, 2), (b, 1), (c, 1)}
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x2 + x
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 5x3 + 4
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : g(x) = |x|
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.
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.
Consider f : N → N, g : N → N and h : N → R defined as f(x) = 2x, g(y) = 3y + 4 and h(z) = sin z for all x, y, z ∈ N. Show that ho (gof) = (hog) of.
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
Let f, g, h be real functions given by f(x) = sin x, g (x) = 2x and h (x) = cos x. Prove that fog = go (fh).
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
if `f (x) = sqrt(1-x)` and g(x) = `log_e` x are two real functions, then describe functions 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 : C → C is defined by f(x) = x2, write f−1 (−4). Here, C denotes the set of all complex numbers.
If f : C → C is defined by f(x) = (x − 2)3, write f−1 (−1).
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
If f : R → R, g : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).
Let f : R → R, g : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).
If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).
Which of the following functions from
to itself are bijections?
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|\]
If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =
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
Which of the following functions from
\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\}\]
Let \[f\left( x \right) = x^2 and g\left( x \right) = 2^x\] Then, the solution set of the equation
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 A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.
Let R be a relation on the set L of lines defined by l1 R l2 if l1 is perpendicular to l2, then relation R 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' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.
`x^(log_5x) > 5` implies ______.
Let f(1, 3) `rightarrow` R be a function defined by f(x) = `(x[x])/(1 + x^2)`, where [x] denotes the greatest integer ≤ x, Then the range of f is ______.
ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.
REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.
Let f: R→Rbe defined as f (x) = `(x^2 + 1)/2`, then ______.
Many students choosing the same favourite subject resembles which type of function?
