Absolutely and completely monotonic functions and sequences

In mathematics, the notions of an absolutely monotonic function and a completely monotonic function are two very closely related concepts. Both imply very strong monotonicity properties. Both types of functions have derivatives of all orders. In the case of an absolutely monotonic function, the function as well as its derivatives of all orders must be non-negative in its domain of definition which would imply that the function as well as its derivatives of all orders are monotonically increasing functions in the domain of definition. In the case of a completely monotonic function, the function and its derivatives must be alternately non-negative and non-positive in its domain of definition which would imply that function and its derivatives are alternately monotonically increasing and monotonically decreasing functions. Such functions were first studied by S. Bernshtein in 1914 and the terminology is also due to him.^[1]^[2]^[3] There are several other related notions like the concepts of almost completely monotonic function, logarithmically completely monotonic function, strongly logarithmically completely monotonic function, strongly completely monotonic function and almost strongly completely monotonic function.^[4]^[5] Another related concept is that of a completely/absolutely monotonic sequence. This notion was introduced by Hausdorff in 1921.

The notions of completely and absolutely monotone function/sequence play an important role in several areas of mathematics. For example, in classical analysis they occur in the proof of the positivity of integrals involving Bessel functions or the positivity of Cesàro means of certain Jacobi series.^[6] Such functions occur in other areas of mathematics such as probability theory, numerical analysis, and elasticity.^[7]

Definitions

Functions

A real valued function $f(x)$ defined over an interval $I$ in the real line is called an absolutely monotonic function if it has derivatives $f^{(n)}(x)$ of all orders $n=0,1,2,\ldots$ and $f^{(n)}(x)\geq 0$ for all $x$ in $I$ .^[1] The function $f(x)$ is called a completely monotonic function if $(-1)^{n}f^{(n)}(x)\geq 0$ for all $x$ in $I$ .^[1]

The two notions are mutually related. The function $f(x)$ is completely monotonic if and only if $f(-x)$ is absolutely monotonic on $-I$ where $-I$ the interval obtained by reflecting $I$ with respect to the origin. (Thus, if $I$ is the interval $(a,b)$ then $-I$ is the interval $(-b,-a)$ .)

In applications, the interval on the real line that is usually considered is the closed-open right half of the real line, that is, the interval $[0,\infty )$ .

Examples

The following functions are absolutely monotonic in the specified regions.^[8]

$f(x)=c$ , where $c$ a non-negative constant, in the region $-\infty <x<\infty$
$f(x)=\sum _{k=0}^{\infty }a_{k}x^{k}$ , where $a_{k}\geq 0$ for all $k$ , in the region $0\leq x<\infty$
$f(x)=-\log(-x)$ in the region $-1\leq x<0$
$f(x)=\sin ^{-1}x$ in the region $0\leq x\leq 1$

Sequences

A sequence $\{\mu _{n}\}_{n=0}^{\infty }$ is called an absolutely monotonic sequence if its elements are non-negative and its successive differences are all non-negative, that is, if

\Delta ^{k}\mu _{n}\geq 0,\quad n,k=0,1,2,\ldots

where $\Delta ^{k}\mu _{n}=\sum _{m=0}^{k}(-1)^{m}{k \choose m}\mu _{n+k-m}$ .

A sequence $\{\mu _{n}\}_{n=0}^{\infty }$ is called a completely monotonic sequence if its elements are non-negative and its successive differences are alternately non-positive and non-negative,^[9] that is, if

(-1)^{k}\Delta ^{k}\mu _{n}\geq 0,\quad n,k=0,1,2,\ldots

Examples

The sequences $\left\{{\frac {1}{n+1}}\right\}_{0}^{\infty }$ and $\{c^{n}\}_{0}^{\infty }$ for $0\leq c\leq 1$ are completely monotonic sequences.

Some important properties

Both the extensions and applications of the theory of absolutely monotonic functions derive from theorems.

The little Bernshtein theorem: A function that is absolutely monotonic on a closed interval $[a,b]$ can be extended to an analytic function on the interval defined by $|x-a|<b-a$ .
A function that is absolutely monotonic on $[0,\infty )$ can be extended to a function that is not only analytic on the real line but is even the restriction of an entire function to the real line.
The big Bernshtein theorem: A function $f(x)$ that is absolutely monotonic on $(-\infty ,0]$ can be represented there as a Laplace integral in the form

f(x)=\int _{0}^{\infty }e^{xt}\,d\mu (t)

where

\mu (t)

is non-decreasing and bounded on

[0,\infty )

.

A sequence $\{\mu _{n}\}_{0}^{\infty }$ is completely monotonic if and only if there exists an increasing function $\alpha (t)$ on $[0,1]$ such that

\mu _{n}=\int _{0}^{1}t^{n}\,d\alpha (t),\quad n=0,1,2,\ldots

References

1 2 3 "Absolutely monotonic function". encyclopediaofmath.org. Encyclopedia of Mathematics. Retrieved 28 December 2023.
↑ S. Bernstein (1914). "Sur la définition et les propriétés des fonctions analytique d'une variable réelle". Mathematische Annalen. 75: 449–468.
↑ S. Bernstein (1928). "Sur les fonctions absolument monotones". Acta Mathematica. 52: 1–66.
↑ Senlin Guo (2017). "Some Properties of Functions Related to Completely Monotonic Functions" (PDF). Filomat. 31 (2): 247–254. Retrieved 29 December 2023.
↑ Senlin Guo, Andrea Laforgia, Necdet Batir and Qiu-Ming Luo (2014). "Completely Monotonic and Related Functions: Their Applications" (PDF). Journal of Applied Mathematics. 2014: 1–3. Retrieved 28 December 2023.{{cite journal}}: CS1 maint: multiple names: authors list (link)
↑ R. Askey (1973). "Summability of Jacobi series". Transactions of American Mathematical Society. 179: 71–84.
↑ William Feller (1971). An Introduction to Probability Theory and Its Applications, Vol. 2 (3 ed.). New York: Wiley.
↑ David Vernon Widder (1946). The Laplace Transform. Princeton University Press. pp. 142–143.
↑ David Vernon Widder (1946). The Laplace Transform. Princeton University Press. p. 101.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[Enc-1] 1 2 3 "Absolutely monotonic function". encyclopediaofmath.org. Encyclopedia of Mathematics. Retrieved 28 December 2023.

[2] S. Bernstein (1914). "Sur la définition et les propriétés des fonctions analytique d'une variable réelle". Mathematische Annalen. 75: 449–468.

[3] S. Bernstein (1928). "Sur les fonctions absolument monotones". Acta Mathematica. 52: 1–66.

[4] Senlin Guo (2017). "Some Properties of Functions Related to Completely Monotonic Functions" (PDF). Filomat. 31 (2): 247–254. Retrieved 29 December 2023.

[5] Senlin Guo, Andrea Laforgia, Necdet Batir and Qiu-Ming Luo (2014). "Completely Monotonic and Related Functions: Their Applications" (PDF). Journal of Applied Mathematics. 2014: 1–3. Retrieved 28 December 2023.{{cite journal}}: CS1 maint: multiple names: authors list (link)

[6] R. Askey (1973). "Summability of Jacobi series". Transactions of American Mathematical Society. 179: 71–84.

[7] William Feller (1971). An Introduction to Probability Theory and Its Applications, Vol. 2 (3 ed.). New York: Wiley.

[8] David Vernon Widder (1946). The Laplace Transform. Princeton University Press. pp. 142–143.

[9] David Vernon Widder (1946). The Laplace Transform. Princeton University Press. p. 101.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Ordered vector space Partially ordered Positive cone Riesz space Upper set Young's lattice

Definitions

Functions

Examples

Sequences

Examples

Some important properties

Further reading

See also

References