FunctionHard
Question
If ′f′ and ′g′ are bijective functions and gof is defined, then, gof must be:
Options
A.injective
B.surjective
C.bijective
D.into only
Solution
f(g(x1)) = f(g(x2))
⇒ g(x1) = g(x2)
as f is one - one function
⇒ x1 = x2
as g is one - one function
hence f(g(x1)) = f(g(x2))
⇒ x1 = x2
⇒ f(g(x)) is one - one function
⇒ g(x1) = g(x2)
as f is one - one function
⇒ x1 = x2
as g is one - one function
hence f(g(x1)) = f(g(x2))
⇒ x1 = x2
⇒ f(g(x)) is one - one function
Create a free account to view solution
View Solution FreeMore Function Questions
If S be the set of all triangles and f : S → R+, f (ᐃ) = Area of ᐃ, then f is -...If f(x) = ax + b and g(x) = cx + d, then f(g(x)) = g(f(x)) is equivalent to-...Function f(x) = is monotonic decreasing in-...If f(x) = {4 − (x − 7)3}1/5, then its inverse is-...Let y be an implicit function of x defined by x2x - 2xx cot y - 1 = 0. Then y′(1) equals...