Jump to content

Logarithmically convex function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Reverend T. R. Malthus (talk | contribs) at 02:01, 18 October 2011 (Link to spanish wikipedia). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, a function defined on a convex subset of a real vector space and taking positive values is said to be logarithmically convex if is a convex function of .

A logarithmically convex function is a convex function since it is the composition of two convex functions, and . But 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. A less trivial example of a logarithmically convex function is the gamma function, if restricted to the positive reals (see also the Bohr–Mollerup theorem).

The term "superconvex" is sometimes used instead of "logarithmically convex"[1].

References

  1. ^ Kingman, J.F.C. 1961. A convexity property of positive matrices. Quart. J. Math. Oxford (2) 12,283-284.
  • John B. Conway. Functions of One Complex Variable I, second edition. Springer-Verlag, 1995. ISBN 0-387-90328-3.