In mathematics, a function f is logarithmically convex or superconvex[1] if , the composition of the logarithm with f, is itself a convex function.

Definition

edit

Let X be a convex subset of a real vector space, and let f : XR be a function taking non-negative values. Then f is:

  • Logarithmically convex if is convex, and
  • Strictly logarithmically convex if is strictly convex.

Here we interpret as .

Explicitly, f is logarithmically convex if and only if, for all x1, x2X and all t ∈ [0, 1], the two following equivalent conditions hold:

Similarly, f is strictly logarithmically convex if and only if, in the above two expressions, strict inequality holds for all t ∈ (0, 1).

The above definition permits f to be zero, but if f is logarithmically convex and vanishes anywhere in X, then it vanishes everywhere in the interior of X.

Equivalent conditions

edit

If f is a differentiable function defined on an interval IR, then f is logarithmically convex if and only if the following condition holds for all x and y in I:

This is equivalent to the condition that, whenever x and y are in I and x > y,

Moreover, f is strictly logarithmically convex if and only if these inequalities are always strict.

If f is twice differentiable, then it is logarithmically convex if and only if, for all x in I,

If the inequality is always strict, then f is strictly logarithmically convex. However, the converse is false: It is possible that f is strictly logarithmically convex and that, for some x, we have . For example, if , then f is strictly logarithmically convex, but .

Furthermore, is logarithmically convex if and only if is convex for all .[2][3]

Sufficient conditions

edit

If are logarithmically convex, and if are non-negative real numbers, then is logarithmically convex.

If is any family of logarithmically convex functions, then is logarithmically convex.

If is convex and is logarithmically convex and non-decreasing, then is logarithmically convex.

Properties

edit

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. However, being logarithmically convex is a strictly stronger property than being convex. For example, the squaring function is convex, but its logarithm is not. Therefore the squaring function is not logarithmically convex.

Examples

edit
  • is logarithmically convex when and strictly logarithmically convex when .
  • is strictly logarithmically convex on for all
  • Euler's gamma function is strictly logarithmically convex when restricted to the positive real numbers. In fact, by the Bohr–Mollerup theorem, this property can be used to characterize Euler's gamma function among the possible extensions of the factorial function to real arguments.

See also

edit

Notes

edit
  1. ^ Kingman, J.F.C. 1961. A convexity property of positive matrices. Quart. J. Math. Oxford (2) 12,283-284.
  2. ^ Montel 1928.
  3. ^ NiculescuPersson 2006, p. 70.

References

edit
  • John B. Conway. Functions of One Complex Variable I, second edition. Springer-Verlag, 1995. ISBN 0-387-90328-3.
  • "Convexity, logarithmic", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
  • Niculescu, Constantin; Persson, Lars-Erik (2006), Convex Functions and their Applications - A Contemporary Approach (1st ed.), Springer, doi:10.1007/0-387-31077-0, ISBN 978-0-387-24300-9, ISSN 1613-5237.
  • Montel, Paul (1928), "Sur les fonctions convexes et les fonctions sousharmoniques", Journal de Mathématiques Pures et Appliquées (in French), 7: 29–60.

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

📚 Artikel Terkait di Wikipedia

Convex function

Karamata's inequality Logarithmically convex function Pseudoconvex function Quasiconvex function Subderivative of a convex function "Lecture Notes 2" (PDF)

Logarithmically concave function

In convex analysis, a non-negative function f : Rn → R+ is logarithmically concave (or log-concave for short) if its domain is a convex set, and if it

Concave function

concave function is one for which the function value at any convex combination of elements in the domain is greater than or equal to that convex combination

Gamma function

is the unique interpolating function for the factorial, defined over the positive reals, which is logarithmically convex, meaning that y = log ⁡ f ( x

Khabibullin's conjecture on integral inequalities

one in terms of logarithmically convex functions, one in terms of increasing functions, and one in terms of non-negative functions. The conjecture has

Function of several complex variables

condition is required, which is called logarithmically convex. A Reinhardt domain D is called logarithmically convex if the image λ ( D ∗ ) {\displaystyle

Convex analysis

Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis,

Quasiconvex function

In mathematics, a quasiconvex function is a real-valued function defined on a convex subset of a real vector space, such that for any real number y, the