Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
5.8k views
in Sets, Relations and Functions by (50.2k points)
closed by

Using the definition, prove that the function f : A→ B is invertible if and only if f is both one-one and onto.

1 Answer

+1 vote
by (48.7k points)
selected by
 
Best answer

Let f: A → B be many-one function.

Let f(a) = p and f(b) = p

So, for inverse function we will have f-1(p) = a and f-1(p) = b

Thus, in this case inverse function is not defined as we have two images ‘a and b’ for one pre-image ‘p’.

But for f to be invertible it must be one-one.

Now, let f: A → B is not onto function.

Let B = {p, q, r} and range of f be {p, q}.

Here image ‘r’ has not any pre-image, which will have no image in set A.

And for f to be invertible it must be onto.

Thus, ‘f’ is invertible if and only if ‘f’ is both one-one and onto.

A function f = X → Y is invertible iff f is a bijective function.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...