Youtube has been helping me get used to working with sets and functions lately, and I've been following the lectures of Mathoma who has created an astounding set-theory playlist that goes through the elementary basics every student must be accustomed to. Now while discussing functions I found this practice problem:
Show that if $F$ is an injective function, that $F^{-1}$ is a function.
The first one requires us to prove the existence of the inverse function of $f$ using the premise stating that it is injective. I found this impossible for I have been taught that it must be true that a function must be both injective and surjective in order to have an inverse function. Perhaps, I said, instead of $f^{-1}$ what was meant to be written was 'left-inverse'?
Thank you in advance.
Suppose that $F:A \to B$ where $F$ is an injective function. Let $C$ denote the subset of $B$ represented by $F(A)$. That is, $C$ denotes the set that contains every element $c$ in $B$ such that there exists an element $a \in A$, where $F(a) = c.$
Then $F:A \to C$ is injective and surjective, and so there exists an inverse function $F^{-1}:C \to A$.
I suspect that that is the intended idea.