Solveeit Logo

Question

Question: Consider functions \[f\] and \[g\] such that composite \[g \circ f\] is defined and is one are \[g\]...

Consider functions ff and gg such that composite gfg \circ f is defined and is one are gg both necessarily one-one?

Explanation

Solution

Here in this question, we need to check whether both gfg \circ f and gg is necessarily one-one or not. For this, first we need to consider a set of functions ff and gg and further define a composition function gfg \circ 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)f\left( x \right) and g(x)g\left( x \right), then function ff ranges from f:ABf:A \to B and gg ranges from g:BCg:B \to C.
Now, the composite function gg and ff gf:ACg \circ f:A\because C, then defined as gf:ACg \circ f:A \to C is one-one.
Now, we are to prove that ff is one -one if possible. Suppose, that ff is not one-one.
Let there exists a x1{x_1}, x2{x_2} A \in A such that x1x2{x_1} \ne {x_2} But f(x1)=f(x2)f\left( {{x_1}} \right) = f\left( {{x_2}} \right), then
g(f(x1))=g(f(x2))\Rightarrow \,\,\,\,g\left( {f\left( {{x_1}} \right)} \right) = g\left( {f\left( {{x_2}} \right)} \right)
Then,
gf(x1)=gf(x2)\Rightarrow \,\,\,\,g \circ f\left( {{x_1}} \right) = g \circ f\left( {{x_2}} \right)
Therefore, x1{x_1}, x2{x_2} A \in A such that x1x2{x_1} \ne {x_2} but gf(x1)=gf(x2)g \circ f\left( {{x_1}} \right) = g \circ f\left( {{x_2}} \right).
Therefore, gfg \circ f is not one which is against the given hypothesis that gg 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\\}

ff is one-one and g:\left\\{ {1,2,3,4,5,6} \right\\} \to \left\\{ {1,2,3,4,5,6} \right\\}

gg is not one-one. The composite function gfg \circ f

Hence, which shows that gfg \circ f is one-one. ff and gg are not necessarily one-one.

Note: One to one function basically denotes the mapping between the two sets. A function gg is one-to-one if every element of the range of g corresponds to exactly one element of the domain of gg. A function f:ABf:A \to B is said to be an onto function if f(A)f\left( A \right), the image of A equal to B. that is ff is onto if every element of B the co-domain is the image of at least one element of A the domain.