Home
Class 12
MATHS
If f: A-> B and g: B-> C be the bijectiv...

If `f: A-> B` and `g: B-> C` be the bijective function, then `(gof)^(-1)` is:

A

`f^(-1)og^(-1)`

B

`fog`

C

`g^(-1)of^(-1)`

D

`gof`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to find the inverse of the composition of two bijective functions \( g \) and \( f \), denoted as \( (g \circ f)^{-1} \). ### Step-by-Step Solution: 1. **Understand the Composition of Functions**: The composition \( g \circ f \) means that we first apply the function \( f \) and then apply the function \( g \). So, if \( x \) is in set \( A \), then: \[ (g \circ f)(x) = g(f(x)) \] This means \( g \circ f \) is a function from set \( A \) to set \( C \). 2. **Properties of Bijective Functions**: Since both \( f \) and \( g \) are bijective, they have inverses \( f^{-1} \) and \( g^{-1} \) respectively. A bijective function is both one-to-one (injective) and onto (surjective). 3. **Finding the Inverse of the Composition**: The inverse of a composition of functions can be expressed as: \[ (g \circ f)^{-1} = f^{-1} \circ g^{-1} \] This means that to find the inverse of \( g \circ f \), we first apply \( g^{-1} \) and then \( f^{-1} \). 4. **Determine the Domain and Codomain**: - The function \( g \circ f \) maps from \( A \) to \( C \). - Therefore, the inverse \( (g \circ f)^{-1} \) will map from \( C \) to \( A \). 5. **Conclusion**: Thus, the correct expression for \( (g \circ f)^{-1} \) is: \[ (g \circ f)^{-1} = f^{-1} \circ g^{-1} \] ### Final Answer: The correct option is: \[ (g \circ f)^{-1} = f^{-1} \circ g^{-1} \]
Promotional Banner

Similar Questions

Explore conceptually related problems

If f : A rarr B is a bijective function, then f^(-1) of is equal to

Statement I: f : A->B is one - one and g : B->C is a one - one function, then gof :A->C is one - one Statement II : If f:A->B, g:B->A are two functions such that gof=IA and fog=IB, then f=g-1. Statement III : f(x)=sec 2x-tan2x,g(x)=cosec2x-cot2x, then f=g

Let f:A to B and g:B to C be bijection, then (fog)^(-1) =

If f:A rarr B,g:B rarr C are bijective functions show that gof:A rarr C is also a bijective function.

If f:A rarrB is bijective function such that n(A)=10, then n(B)=?

Consider function f : A to B and g : B to C (A, B, sube R) such that (gof) ""^(-1) exists then

If f:A rarr B and g:B rarr C are one-one functions,show that gof is one-one function.

If f and g are two bijections; then gof is a bijection and (gof)^(-1)=f^(-1)og^(-1)