Monotonic function

In calculus, a function ${\displaystyle f}$  defined on a subset of the real numbers with real values is called monotonic if it is either entirely non-decreasing, or entirely non-increasing.^[2] That is, as per Fig. 1, a function that increases monotonically does not exclusively have to increase, it simply must not decrease.

A function is termed monotonically increasing (also increasing or non-decreasing)^[3] if for all ${\displaystyle x}$  and ${\displaystyle y}$  such that ${\displaystyle x\leq y}$  one has ${\displaystyle f\!\left(x\right)\leq f\!\left(y\right)}$ , so ${\displaystyle f}$  preserves the order (see Figure 1). Likewise, a function is called monotonically decreasing (also decreasing or non-increasing)^[3] if, whenever ${\displaystyle x\leq y}$ , then ${\displaystyle f\!\left(x\right)\geq f\!\left(y\right)}$ , so it reverses the order (see Figure 2).

If the order ${\displaystyle \leq }$  in the definition of monotonicity is replaced by the strict order ${\displaystyle <}$ , one obtains a stronger requirement. A function with this property is called strictly increasing (also increasing).^[3][4] Again, by inverting the order symbol, one finds a corresponding concept called strictly decreasing (also decreasing).^[3][4] A function with either property is called strictly monotone. Functions that are strictly monotone are one-to-one (because for ${\displaystyle x}$  not equal to ${\displaystyle y}$ , either ${\displaystyle x<y}$  or ${\displaystyle x>y}$  and so, by monotonicity, either ${\displaystyle f\!\left(x\right)<f\!\left(y\right)}$  or ${\displaystyle f\!\left(x\right)>f\!\left(y\right)}$ , thus ${\displaystyle f\!\left(x\right)\neq f\!\left(y\right)}$ .)

To avoid ambiguity, the terms weakly monotone, weakly increasing and weakly decreasing are often used to refer to non-strict monotonicity.

The terms "non-decreasing" and "non-increasing" should not be confused with the (much weaker) negative qualifications "not decreasing" and "not increasing". For example, the non-monotonic function shown in figure 3 first falls, then rises, then falls again. It is therefore not decreasing and not increasing, but it is neither non-decreasing nor non-increasing.

A function ${\displaystyle f}$  is said to be absolutely monotonic over an interval ${\displaystyle \left(a,b\right)}$  if the derivatives of all orders of ${\displaystyle f}$  are nonnegative or all nonpositive at all points on the interval.

All strictly monotonic functions are invertible because they are guaranteed to have a one-to-one mapping from their range to their domain.

However, functions that are only weakly monotone are not invertible because they are constant on some interval (and therefore are not one-to-one).

A function may be strictly monotonic over a limited a range of values and thus have an inverse on that range even though it is not strictly monotonic everywhere. For example, if ${\displaystyle y=g(x)}$  is strictly increasing on the range ${\displaystyle [a,b]}$ , then it has an inverse ${\displaystyle x=h(y)}$  on the range ${\displaystyle [g(a),g(b)]}$ .

The term monotonic is sometimes used in place of strictly monotonic, so a source may state that all monotonic functions are invertible when they really mean that all strictly monotonic functions are invertible.^{[citation needed]}

The term monotonic transformation (or monotone transformation) may also cause confusion because it refers to a transformation by a strictly increasing function. This is the case in economics with respect to the ordinal properties of a utility function being preserved across a monotonic transform (see also monotone preferences).^[5] In this context, the term "monotonic transformation" refers to a positive monotonic transformation and is intended to distinguish it from a "negative monotonic transformation," which reverses the order of the numbers.^[6]

 

 

The following properties are true for a monotonic function ${\displaystyle f\colon \mathbb {R} \to \mathbb {R} }$ :

• ${\displaystyle f}$  has limits from the right and from the left at every point of its domain;
• ${\displaystyle f}$  has a limit at positive or negative infinity (${\displaystyle \pm \infty }$ ) of either a real number, ${\displaystyle \infty }$ , or ${\displaystyle -\infty }$ .
• ${\displaystyle f}$  can only have jump discontinuities;
• ${\displaystyle f}$  can only have countably many discontinuities in its domain. The discontinuities, however, do not necessarily consist of isolated points and may even be dense in an interval (a, b). For example, for any summable sequence $(a_{i})$  of positive numbers and any enumeration ${\displaystyle (q_{i})}$  of the rational numbers, the monotonically increasing function $${\displaystyle f(x)=\sum _{q_{i}\leq x}a_{i}}$$  is continuous exactly at every irrational number (cf. picture). It is the cumulative distribution function of the discrete measure on the rational numbers, where ${\displaystyle a_{i}}$  is the weight of ${\displaystyle q_{i}}$ .
• If ${\displaystyle f}$  is differentiable at ${\displaystyle x^{*}\in {\mathbb {R}}}$  and ${\displaystyle f'(x^{*})>0}$ , then there is a non-degenerate interval I such that ${\displaystyle x^{*}\in I}$  and ${\displaystyle f}$  is increasing on I. As a partial converse, if f is differentiable and increasing on an interval, I, then its derivative is positive at every point in I.

These properties are the reason why monotonic functions are useful in technical work in analysis. Other important properties of these functions include:

• if ${\displaystyle f}$  is a monotonic function defined on an interval ${\displaystyle I}$ , then ${\displaystyle f}$  is differentiable almost everywhere on ${\displaystyle I}$ ; i.e. the set of numbers ${\displaystyle x}$  in ${\displaystyle I}$  such that ${\displaystyle f}$  is not differentiable in ${\displaystyle x}$  has Lebesgue measure zero. In addition, this result cannot be improved to countable: see Cantor function.
• if this set is countable, then ${\displaystyle f}$  is absolutely continuous
• if ${\displaystyle f}$  is a monotonic function defined on an interval ${\displaystyle \left[a,b\right]}$ , then ${\displaystyle f}$  is Riemann integrable.

An important application of monotonic functions is in probability theory. If ${\displaystyle X}$  is a random variable, its cumulative distribution function ${\displaystyle F_{X}\!\left(x\right)={\text{Prob}}\!\left(X\leq x\right)}$  is a monotonically increasing function.

A function is unimodal if it is monotonically increasing up to some point (the mode) and then monotonically decreasing.

When ${\displaystyle f}$  is a strictly monotonic function, then ${\displaystyle f}$  is injective on its domain, and if ${\displaystyle T}$  is the range of ${\displaystyle f}$ , then there is an inverse function on ${\displaystyle T}$  for ${\displaystyle f}$ . In contrast, each constant function is monotonic, but not injective,^[7] and hence cannot have an inverse.

The graphic shows six monotonic functions. Their simplest forms are shown in the plot area and the expressions used to create them are shown on the y-axis.

A map ${\displaystyle f:X\to Y}$  is said to be monotone if each of its fibers is connected; that is, for each element ${\displaystyle y\in Y,}$  the (possibly empty) set ${\displaystyle f^{-1}(y)}$  is a connected subspace of ${\displaystyle X.}$ 

In functional analysis on a topological vector space ${\displaystyle X}$ , a (possibly non-linear) operator ${\displaystyle T:X\rightarrow X^{*}}$  is said to be a monotone operator if

$${\displaystyle (Tu-Tv,u-v)\geq 0\quad \forall u,v\in X.}$$  Kachurovskii's theorem shows that convex functions on Banach spaces have monotonic operators as their derivatives.

A subset ${\displaystyle G}$  of ${\displaystyle X\times X^{*}}$  is said to be a monotone set if for every pair ${\displaystyle [u_{1},w_{1}]}$  and ${\displaystyle [u_{2},w_{2}]}$  in ${\displaystyle G}$ ,

$${\displaystyle (w_{1}-w_{2},u_{1}-u_{2})\geq 0.}$$  ${\displaystyle G}$  is said to be maximal monotone if it is maximal among all monotone sets in the sense of set inclusion. The graph of a monotone operator ${\displaystyle G(T)}$  is a monotone set. A monotone operator is said to be maximal monotone if its graph is a maximal monotone set.

Order theory deals with arbitrary partially ordered sets and preordered sets as a generalization of real numbers. The above definition of monotonicity is relevant in these cases as well. However, the terms "increasing" and "decreasing" are avoided, since their conventional pictorial representation does not apply to orders that are not total. Furthermore, the strict relations ${\displaystyle <}$  and ${\displaystyle >}$  are of little use in many non-total orders and hence no additional terminology is introduced for them.

Letting ${\displaystyle \leq }$  denote the partial order relation of any partially ordered set, a monotone function, also called isotone, or order-preserving, satisfies the property

$${\displaystyle x\leq y\implies f(x)\leq f(y)}$$ 

for all x and y in its domain. The composite of two monotone mappings is also monotone.

The dual notion is often called antitone, anti-monotone, or order-reversing. Hence, an antitone function f satisfies the property

$${\displaystyle x\leq y\implies f(y)\leq f(x),}$$ 

for all x and y in its domain.

A constant function is both monotone and antitone; conversely, if f is both monotone and antitone, and if the domain of f is a lattice, then f must be constant.

Monotone functions are central in order theory. They appear in most articles on the subject and examples from special applications are found in these places. Some notable special monotone functions are order embeddings (functions for which ${\displaystyle x\leq y}$  if and only if ${\displaystyle f(x)\leq f(y))}$  and order isomorphisms (surjective order embeddings).

In the context of search algorithms monotonicity (also called consistency) is a condition applied to heuristic functions. A heuristic ${\displaystyle h(n)}$  is monotonic if, for every node n and every successor n' of n generated by any action a, the estimated cost of reaching the goal from n is no greater than the step cost of getting to n' plus the estimated cost of reaching the goal from n',

$${\displaystyle h(n)\leq c\left(n,a,n'\right)+h\left(n'\right).}$$ 

This is a form of triangle inequality, with n, n', and the goal G_n closest to n. Because every monotonic heuristic is also admissible, monotonicity is a stricter requirement than admissibility. Some heuristic algorithms such as A* can be proven optimal provided that the heuristic they use is monotonic.^[8]

In Boolean algebra, a monotonic function is one such that for all a_i and b_i in {0,1}, if a₁ ≤ b₁, a₂ ≤ b₂, ..., a_n ≤ b_n (i.e. the Cartesian product {0, 1}ⁿ is ordered coordinatewise), then f(a₁, ..., a_n) ≤ f(b₁, ..., b_n). In other words, a Boolean function is monotonic if, for every combination of inputs, switching one of the inputs from false to true can only cause the output to switch from false to true and not from true to false. Graphically, this means that an n-ary Boolean function is monotonic when its representation as an n-cube labelled with truth values has no upward edge from true to false. (This labelled Hasse diagram is the dual of the function's labelled Venn diagram, which is the more common representation for n ≤ 3.)

The monotonic Boolean functions are precisely those that can be defined by an expression combining the inputs (which may appear more than once) using only the operators and and or (in particular not is forbidden). For instance "at least two of a, b, c hold" is a monotonic function of a, b, c, since it can be written for instance as ((a and b) or (a and c) or (b and c)).

The number of such functions on n variables is known as the Dedekind number of n.

SAT solving, generally an NP-hard task, can be achieved efficiently when all involved functions and predicates are monotonic and Boolean.^[9]

• Monotone cubic interpolation
• Pseudo-monotone operator
• Spearman's rank correlation coefficient - measure of monotonicity in a set of data
• Total monotonicity
• Cyclical monotonicity
• Operator monotone function
• Monotone set function
• Absolutely and completely monotonic functions and sequences

• Bartle, Robert G. (1976). The elements of real analysis (second ed.).
• Grätzer, George (1971). Lattice theory: first concepts and distributive lattices. W. H. Freeman. ISBN 0-7167-0442-0.
• Pemberton, Malcolm; Rau, Nicholas (2001). Mathematics for economists: an introductory textbook. Manchester University Press. ISBN 0-7190-3341-1.
• Renardy, Michael & Rogers, Robert C. (2004). An introduction to partial differential equations. Texts in Applied Mathematics 13 (Second ed.). New York: Springer-Verlag. p. 356. ISBN 0-387-00444-0.
• Riesz, Frigyes & Béla Szőkefalvi-Nagy (1990). Functional Analysis. Courier Dover Publications. ISBN 978-0-486-66289-3.
• Russell, Stuart J.; Norvig, Peter (2010). Artificial Intelligence: A Modern Approach (3rd ed.). Upper Saddle River, New Jersey: Prentice Hall. ISBN 978-0-13-604259-4.
• Simon, Carl P.; Blume, Lawrence (April 1994). Mathematics for Economists (first ed.). Norton. ISBN 978-0-393-95733-4. (Definition 9.31)

• "Monotone function", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Convergence of a Monotonic Sequence by Anik Debnath and Thomas Roxlo (The Harker School), Wolfram Demonstrations Project.
• Weisstein, Eric W. "Monotonic Function". MathWorld.