Question
Question: Consider functions \[f\] and \[g\] such that composite \[g \circ f\] is defined and is one are \[g\]...
Consider functions f and g such that composite g∘f is defined and is one are g both necessarily one-one?
Solution
Here in this question, we need to check whether both g∘f and g is necessarily one-one or not. For this, first we need to consider a set of functions f and g and further define a composition function g∘f then check the one-one condition to get the required solution.
Complete step by step answer:
Let’s consider a two functions f(x) and g(x), then function f ranges from f:A→B and g ranges from g:B→C.
Now, the composite function g and f g∘f:A∵C, then defined as g∘f:A→C is one-one.
Now, we are to prove that f is one -one if possible. Suppose, that f is not one-one.
Let there exists a x1, x2 ∈A such that x1=x2 But f(x1)=f(x2), then
⇒g(f(x1))=g(f(x2))
Then,
⇒g∘f(x1)=g∘f(x2)
Therefore, x1, x2 ∈A such that x1=x2 but g∘f(x1)=g∘f(x2).
Therefore, g∘f is not one which is against the given hypothesis that g of is one -one superposition is wrong.
Now, let f:\left\\{ {1,2,3,4} \right\\} \to \left\\{ {1,2,3,4,5,6} \right\\}
f is one-one and g:\left\\{ {1,2,3,4,5,6} \right\\} \to \left\\{ {1,2,3,4,5,6} \right\\}
g is not one-one. The composite function g∘f
Hence, which shows that g∘f is one-one. f and g are not necessarily one-one.
Note: One to one function basically denotes the mapping between the two sets. A function g is one-to-one if every element of the range of g corresponds to exactly one element of the domain of g. A function f:A→B is said to be an onto function if f(A), the image of A equal to B. that is f is onto if every element of B the co-domain is the image of at least one element of A the domain.