Main Page | See live article | Alphabetical index

Monotonic function

The terms monotonic or monotone refer to functions between partially ordered sets. They first arose in calculus and were later generalized to the more abstract setting or order theory.

In calculus, a function f : X -> R (where X is a subset of the real numbers R) is monotonically increasing or simply increasing if, whenever xy, then f(x) ≤ f(y). An increasing function is also called order-preserving for obvious reasons.

Likewise, a function is decreasing if, whenever xy, then f(x) ≥ f(y). A decreasing function is also called order-reversing.

If the definitions hold with the inequalities (≤, ≥) replaced by strict inequalities (<, >) then the functions are called strictly increasing or strictly decreasing.

A function f(x) is unimodal if for some value m (the mode), it is monotonically increasing for xm and monotonically decreasing for xm. In that case, the maximum value of f(x) is f(m).

As was mentioned at the beginning, there is also a more general notion of monotonicity in case one is not concerned with the set of the real numbers (as in calculus) but with a function f between arbitrary partially ordered sets A and B. In this setting, a function f : A -> B is said to be order-preserving whenever a1a2 implies f(a1) ≤ f(a2), and order-reversing if a1a2 implies f(a1) ≥ f(a2). A function is monotonic if it is either order-preserving or order-reversing, and if the definitions hold when (≤, ≥) are replaced by (<, >) one adds the adverb strictly to the terms.

In calculus, each of the following properties of a function f : R -> R implies the next:

These properties are the reason why monotonic functions are useful in technical work in analysis. Two facts about these functions are: An important application of monotonic functions is in probability theory. If X is a random variable, its cumulative distribution function
FX(x) = Prob(Xx)
is a monotonically increasing function.