Definition. Monotone function [0029]

A monotone function (or monotone map) between two preorders \((A, \leq _A)\) and \((B, \leq _B)\) is a function \(f: A \to B\) that preserves the order relation. This means that for all elements \(x, y \in A\), if \(x \leq _A y\), then it must also hold that \(f(x) \leq _B f(y)\). In other words, the function \(f\) does not reverse the order of elements when mapping them from set \(A\) to set \(B\). Formally:(1)

\[ \forall x, y \in A.\ x \leq _A y \implies f(x) \leq _B f(y) \]