Consider function and such that exists, then:
We begin with the information that and are two real-valued functions such that the composite function possesses an inverse, written .
A function admits an inverse if and only if it is bijective; that is, it must be simultaneously one-one (injective) and onto (surjective). Hence we may immediately state
We now translate the bijectivity of into separate conditions on and .
Injectivity part: To prove that is one-one, let us take any two elements and assume that their images under coincide, i.e.
Applying on both sides we obtain
Since is injective, equality of the outputs forces equality of the inputs, so
This derivation shows that no two distinct elements of can share the same image under ; therefore is one-one (injective).
Surjectivity part: To show that is onto, start with an arbitrary element . Because is surjective, there exists some satisfying
Writing the composition explicitly, this reads
Denote ; then the equation becomes . We have thus produced an element whose image under is the pre-selected , verifying that every element of is attained by . Consequently, is onto (surjective).
Putting the two deductions together, we have established that
None of the other combinations is compelled by the mere bijectivity of . Hence, the correct answer is Option C.
Tagged Composite functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.