Operations for functions: Inverse functions
Injective functions
Injectivity
A real function is called injective if, for all and in the domain of with , we have .
In terms of graphs: the function is injective if there is no horizontal line intersecting in two (or more) points.
An important kind of injective function can be pointed out by means of the following definitions.
Monotonic functions
A real function is called increasing if, for all and in the domain of with , we have , and decreasing if, for all and in the domain of with , we have .
A function that is either increasing or decreasing is called monotonic.
In the literature, what is called increasing, decreasing, and monotonic here, is also called strictly increasing, strictly decreasing, and strictly monotonic, respectively.
If the strict inequalities and are replaced by the weak inequalities and in the definition, then we are talking about weakly increasing, weakly decreasing, or weakly monotonic.
The relevance of monotony for injectivity becomes clear from the following statement.
Injectivity for monotonic functions
If is a monotonic function, then is injective.
We will only prove the case where is increasing. The proof for decreasing functions is similar.
Assume that and are points of the domain of with . In order to establish that is injective, we need to derive from this.
If , then or . But is increasing, so, in the first case, we have and in the second case , both contradicting . We conclude that , as required to prove that is injective.
This can be seen in the following graph of the function :

Or visit omptest.org if jou are taking an OMPT exam.