Jump to content

Logarithmically convex function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hamishblair (talk | contribs) at 12:55, 6 July 2018 (More rigorous definition.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, a function f defined on a convex subset of a real vector space and taking positive values is said to be logarithmically convex or superconvex[1] if , the composition of the logarithmic function with f, is itself a convex function. A logarithmically convex function will grow faster than any exponential in the long run, meaning that any function satisfying

independently of the constant k will be logarithmically convex.

A logarithmically convex function f is a convex function since it is the composite of the increasing convex function and the function , which is by definition convex. The converse is not always true: for example is a convex function, but is not a convex function and thus is not logarithmically convex. On the other hand, is logarithmically convex since is convex. An important example of a logarithmically convex function is the gamma function on the positive reals (see also the Bohr–Mollerup theorem).

Notes

  1. ^ Kingman, J.F.C. 1961. A convexity property of positive matrices. Quart. J. Math. Oxford (2) 12,283-284.

References

  • John B. Conway. Functions of One Complex Variable I, second edition. Springer-Verlag, 1995. ISBN 0-387-90328-3.

See also

This article incorporates material from logarithmically convex function on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.