A function $latex f:A \rightarrow B$ is called injective function (or one one function) if for any $latex x,y\in A$ it follows that $latex f(x)=f(y)$ implies $latex x=y$.
Other than the above definition, there are several equivalent definitions. Here they are.
The first one is of course the contraposition of the previous one.
A function $latex f:A \rightarrow B$ is called injective function (or one one function) if for any $latex x,y\in A$ it follows that $latex x\neq y$ implies $latex f(x)\neq f(y)$.
The second one is: Continue reading