Injections, Surjections and Bijections

Injections

Definition: Injection

A function $f:X\to Y$ is called injective if for each $y\in Y$ there is only one $x\in X$ such that $y=f(x)$.

Definition: Inverse Function

The inverse function of an injection $f:X\to Y$ is the function $f^{-1}:f(X)\to X$ which to each $y\in Y$ assigns the $x\in X$ for which $y=f(x)$, i.e.

$$f^{-1}(f(x))=x$$

Definition: Involution

An involution is a function $f:X\to Y$ which is its own inverse function.

$$f(f(x))=x\forall x\in X$$

Surjections

Definition: Surjection

A function $f:X\to Y$ is called surjective if its image and codomain are equal, i.e. for each $y\in Y$ there is at least one $x\in X$ such that $y=f(x)$.

Bijections

Definition: Bijection

A function $f:X\to Y$ is called bijective if it is both injective and surjective.