Let f: A → B and g : B → C be the bijective functions. Then (g o f)-1 is,
Correct Answer :
f⁻¹ o g⁻¹
Solution :
The correct option is f⁻¹ o g⁻¹.
To understand why this is correct, let us analyze the properties of bijective functions and their compositions step-by-step.
Step 1: Understand the Functions and Their Inverses
We are given two bijective (one-to-one and onto) functions:
and
Because both and are bijective, their inverse functions exist and are also bijective:
and
Step 2: Map the Composition and its Inverse
The composition function maps elements from set to set :
The inverse of this composition, , must reverse this direction and map elements from set back to set :
Step 3: Track the Elements through the Mapping
Let us select an arbitrary element . Under the function , this maps to an element :
Next, under the function , the element maps to an element :
Step 4: Express the Inverse Composition
Using the mappings above, the composite function evaluated at yields:
By the definition of an inverse function, applying to must return us to :
Step 5: Apply the Inverses Separately
Now let us trace the path backwards from using the individual inverse functions. Since we want to map , we must first apply to map , and then apply to map :
Substituting into the equation gives:
Substituting gives:
Conclusion
Since both operations yield the same result for any arbitrary element in the domain:
We conclude that:
Access expert-curated educational resources and study materials—completely free.
Create, conduct, and manage professional online assessments with Crey. Perfect for teachers and institutes.
Copyright © 2026 Crey. All Rights Reserved.