Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Step 1: If (g∘f)⁻¹ exists, then g∘f is bijective.
Step 2: Injectivity of g∘f forces f to be one-one: f(a)=f(b) implies g(f(a))=g(f(b)) and hence a=b.
Step 3: Surjectivity of g∘f forces g to be onto C: every c∈C equals g(f(a)) for some a∈A. Therefore option C is necessary.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.