Advertisements
Advertisements
Question
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).
Advertisements
Solution
We know that f : R→[−1, 1] and g : R→R
Clearly, the range of g is a subset of the domain of f.
fog : R → R
Now, (fh) (x)=f (x)h (x) = (sin x) (cos x) =`1/2`sin (2x)
Domain of fh is R.
Since range of sin x is [-1,1],
−1 ≤ sin 2x ≤ 1
⇒ ` (-1)/2 ≤ sin x/2 ≤ 1/2`
Range of fh = `[(-1)/2 ","1/2]`
So, (fh) : R →`[(-1)/2 ","1/2]`
Clearly, range of fh is a subset of g.
⇒ go (fh) : R → R
⇒ domains of fog and go (fh) are the same .
So, (fog) (x)=f (g (x)) = f (2x) = sin (2x)
and ( go (fh)) (x) = g ((fh) (x)) = g (sinx cos x) = 2sin x cos x = sin (2x)
⇒ (fog) (x) = ( go(fh)) (x), ∀x ∈ R
Hence, fog = go (fh)
APPEARS IN
RELATED QUESTIONS
Show that the signum function f : R → R, given by
`f(x) = {(1", if" x > 0), (0", if" x = 0), (-1", if" x < 0):}`
is neither one-one nor onto.
Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is bijective function.
Show that the function f : R → {x ∈ R : –1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Give an example of a function which is one-one but not onto ?
Give an example of a function which is neither one-one nor onto ?
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 − x
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = `x/(x^2 +1)`
Find fog and gof if : f (x) = ex g(x) = loge x .
Find fog and gof if : f (x) = |x|, g (x) = sin x .
Consider f : R+ → [−5, ∞) given by f(x) = 9x2 + 6x − 5. Show that f is invertible with `f^-1 (x) = (sqrt (x +6)-1)/3 .`
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 a surjection ?
If f : R → R is defined by f(x) = x2, write f−1 (25)
If f : C → C is defined by f(x) = x4, write f−1 (1).
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
Write the domain of the real function
`f (x) = sqrt([x] - x) .`
Let A = {a, b, c, d} and f : A → A be given by f = {( a,b ),( b , d ),( c , a ) , ( d , c )} write `f^-1`. [NCERT EXEMPLAR]
If f(x) = 4 −( x - 7)3 then write f-1 (x).
\[f : R \to R \text{given by} f\left( x \right) = x + \sqrt{x^2} \text{ is }\]
The function \[f : [0, \infty ) \to \text {R given by } f\left( x \right) = \frac{x}{x + 1} 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 : R \to R\] is defined by
\[f\left( x \right) = \frac{e^{x^2} - e^{- x^2}}{e^{x^2 + e^{- x^2}}} is\]
If \[F : [1, \infty ) \to [2, \infty )\] is given by
\[f\left( x \right) = x + \frac{1}{x}, then f^{- 1} \left( x \right)\]
Mark the correct alternative in the following question:
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
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) = 4x – 3 ∀ x ∈ R. Then write f–1
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 defined by f(x) = `1/x` ∀ x ∈ R. Then f is ______.
The smallest integer function f(x) = [x] is ____________.
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers is ____________.
The function f: R → R defined as f(x) = x3 is:
Let f: R → R defined by f(x) = 3x. Choose the correct answer
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.
Which one of the following graphs is a function of x?
![]() |
![]() |
| Graph A | Graph B |
Which real-life situation resembles a one-one idea when no roll number is repeated?
Many students choosing the same favourite subject resembles which type of function?
A perfect one-to-one matching between users and unique IDs is similar to:


