An inverse function f^-1 maps elements from the codomain B back to the domain A for a function f: A → B. Only bijective functions, which are both one-to-one and onto, have inverse functions. A bijective function ensures that every element in set B is related to exactly one element in set A.

1. What is an inverse function? Then 𝑓−1:𝐵A will be Let 𝑓:𝐴𝐵 be a function such that a∈𝐴 & 𝑏∈𝐵. Then −1 𝑓 𝑎 = 𝑏 fnhjhjhj

2. Which functions are invertible? As we have studied in the chapter Relations & Functions, ONLY BIJECTIVE FUNCTIONS are invertible

3. What is a bijective function? 4 cannot remain in set B as every element in set B should be related to some element in set A to make it an onto function Here c cannot be related to 2 as only one element in set A can be related to an element in set B to make it a one to one function A bijective function is necessarily both injective (one to one) & surjective(onto) Now consider this function 𝑓 :𝐴->𝐵 Set A Set B 1 a 2 b 4 3 c