Home
Class 11
MATHS
Let f: A to B; g: B to A be two function...

Let `f: A to B; g: B to A` be two functions such that `fog = I_B`. Then; f is a surjection and g is an injection.

A

f and g both are injections

B

f and both are surjections

C

f is and injection and g is a surjection

D

f is a injections and g is a surjection

Text Solution

AI Generated Solution

The correct Answer is:
To prove that if \( f: A \to B \) and \( g: B \to A \) are two functions such that \( f \circ g = I_B \) (where \( I_B \) is the identity function on set \( B \)), then \( f \) is a surjection and \( g \) is an injection, we can follow these steps: ### Step 1: Prove that \( f \) is a surjection 1. **Consider an arbitrary element in \( B \)**: Let \( y \in B \) be any arbitrary element. 2. **Use the function \( g \)**: Since \( g: B \to A \), we can apply \( g \) to \( y \). Let \( x = g(y) \). Thus, \( x \in A \). 3. **Apply the function \( f \)**: Now, we apply \( f \) to \( x \): \[ f(x) = f(g(y)) \] 4. **Use the composition property**: From the given information, we know that \( f \circ g = I_B \). Therefore: \[ f(g(y)) = I_B(y) \] Since \( I_B \) is the identity function on \( B \), we have: \[ I_B(y) = y \] Thus: \[ f(g(y)) = y \] 5. **Conclusion for surjection**: We have shown that for every \( y \in B \), there exists an \( x \in A \) (specifically \( x = g(y) \)) such that \( f(x) = y \). This means that \( f \) is a surjection. ### Step 2: Prove that \( g \) is an injection 1. **Assume \( g(x_1) = g(x_2) \)**: Let \( x_1, x_2 \in B \) be such that \( g(x_1) = g(x_2) \). 2. **Apply the function \( f \)**: We apply \( f \) to both sides: \[ f(g(x_1)) = f(g(x_2)) \] 3. **Use the composition property**: Again, using \( f \circ g = I_B \), we have: \[ f(g(x_1)) = I_B(x_1) \quad \text{and} \quad f(g(x_2)) = I_B(x_2) \] Therefore: \[ I_B(x_1) = I_B(x_2) \] 4. **Identity function property**: Since \( I_B(x_1) = x_1 \) and \( I_B(x_2) = x_2 \), we can conclude: \[ x_1 = x_2 \] 5. **Conclusion for injection**: Since \( g(x_1) = g(x_2) \) implies \( x_1 = x_2 \), we conclude that \( g \) is an injection. ### Final Conclusion We have shown that \( f \) is a surjection and \( g \) is an injection. ---
Promotional Banner

Topper's Solved these Questions

  • FUNCTIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Chapter Test|29 Videos
  • FUNCTIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Section II - Assertion Reason Type|10 Videos
  • DISCRETE PROBABILITY DISTRIBUTIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Exercise|40 Videos
  • HYPERBOLA

    OBJECTIVE RD SHARMA ENGLISH|Exercise Chapter Test|29 Videos

Similar Questions

Explore conceptually related problems

Let f: A to B; g: B to A be two functions such that gof = I_A . Then; f is an injection and g is a surjection.

Let f: A to B and g: B to C be two functions. Then; if gof is onto then g is onto; if gof is one one then f is one-one and if gof is onto and g is one one then f is onto and if gof is one one and f is onto then g is one one.

Let f : A to B and g : B to C be the bijective functions. Then (g of )^(-1) is

If f: AvecA ,g: Avec are two bijections, then prove that fog is an injection (ii) fog is a surjection.

If f and g are two increasing function such that fog is defined then

Let f:A to A and g:A to A be two functions such that fog(x)=gof (x)=x for all x in A Statement-1: {x in A: f(x)=g(x)}={x in A: f(x)=x}={x in A: g(x)=x} Statement-2: f:A to A is bijection.

Let f: R->R and g: R->R be two given functions such that f is injective and g is surjective. Then which of the following is injective? (a) gof (b) fog (c) gog (d) none of these

If f: A->A ,g: A->A are two bijections, then prove that (i) fog is an injection (ii) fog is a surjection.

If f: A->A ,\ \ g: A->A are two bijections, then prove that fog is an surjection.

Let f:R to R, g: R to R be two functions given by f(x)=2x-3,g(x)=x^(3)+5 . Then (fog)^(-1) is equal to

OBJECTIVE RD SHARMA ENGLISH-FUNCTIONS-Exercise
  1. If f:R->R be defined by f(x)=x^2+1, then find f^(-1)(17) and f^(-1)(-3...

    Text Solution

    |

  2. The function f: NvecN(N is the set of natural numbers) defined by f(n)...

    Text Solution

    |

  3. The composite mapping fog of the maps f:R to R , f(x)=sin x and g:R to...

    Text Solution

    |

  4. If function f:RtoR is defined by f(x)=3x-4 then f^(-1)(x) is given by

    Text Solution

    |

  5. f : R rarr R is a function defined by f (x) = 10 x - 7. If g = f^(-1),...

    Text Solution

    |

  6. Let A={x in R : xlt=1} and f: A->A be defined as f(x)=x(2-x) . Then, ...

    Text Solution

    |

  7. If f(x)=x^n , n in Nandgof(x)=ng(x) then g(x) can be

    Text Solution

    |

  8. If the function f: R->R be such that f(x)=x-[x] , where [x] denotes th...

    Text Solution

    |

  9. f:R to R given by f(x)=5-3 sin x, is

    Text Solution

    |

  10. Let f:A->B be a function defined by f(x) =sqrt3sin x +cos x+4. If f is...

    Text Solution

    |

  11. Let f: A to B; g: B to A be two functions such that gof = IA. Then; f ...

    Text Solution

    |

  12. Let f: A to B; g: B to A be two functions such that fog = IB. Then; f ...

    Text Solution

    |

  13. If f: A->B and g: B->C are one-one functions, show that gof is one-o...

    Text Solution

    |

  14. If functions f:A to B and g : B to A satisfy gof= I(A), then show that...

    Text Solution

    |

  15. Suppose f:A to B " and " B to C. (i) Prove that if f is onto and g i...

    Text Solution

    |

  16. If f: A->B and g: B->C are one-one functions, show that gof is one-o...

    Text Solution

    |

  17. Let [x] denote the greatest integer less than or equal to x . If f(x...

    Text Solution

    |

  18. If f(x)=sin^(2)x, g(x)=sqrtx and h(x)=cos^(-1)x, 0 le xle 1, then

    Text Solution

    |

  19. If f(x)=(25-x^(4))^(1//4)"for "0 lt x lt sqrt5, "then"f(f((1)/(2)))=

    Text Solution

    |

  20. If X={1,2,3,4}, then one-one onto mappings f:X to X such that f(1)=1, ...

    Text Solution

    |