Blog
Onto & Into Functions
- June 1, 2020
- Category: Uncategorized
No Comments
☼ Onto & Into Functions : Let f : A B. We say that f is onto, if every element in B has at least one pre-image in A.
Clearly, f is onto = f (A) = { f (x) : x A } = B.
On the other hand, if there exists even a single element in B having no pre-image in A, we say that f is into.
The function f has inverse if and only if ( or iff or ) f is one – one and onto.