Logarithmically convex function

From testwiki
Jump to navigation Jump to search

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

Definition

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

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

Here we interpret log0 as .

Explicitly, Template:Math is logarithmically convex if and only if, for all Template:Math and all Template:Math, the two following equivalent conditions hold:

logf(tx1+(1t)x2)tlogf(x1)+(1t)logf(x2),f(tx1+(1t)x2)f(x1)tf(x2)1t.

Similarly, Template:Math is strictly logarithmically convex if and only if, in the above two expressions, strict inequality holds for all Template:Math.

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

Equivalent conditions

If Template:Math is a differentiable function defined on an interval Template:Math, then Template:Math is logarithmically convex if and only if the following condition holds for all Template:Math and Template:Math in Template:Math:

logf(x)logf(y)+f(y)f(y)(xy).

This is equivalent to the condition that, whenever Template:Math and Template:Math are in Template:Math and Template:Math,

(f(x)f(y))1xyexp(f(y)f(y)).

Moreover, Template:Math is strictly logarithmically convex if and only if these inequalities are always strict.

If Template:Math is twice differentiable, then it is logarithmically convex if and only if, for all Template:Math in Template:Math,

f(x)f(x)f(x)2.

If the inequality is always strict, then Template:Math is strictly logarithmically convex. However, the converse is false: It is possible that Template:Math is strictly logarithmically convex and that, for some Template:Math, we have f(x)f(x)=f(x)2. For example, if f(x)=exp(x4), then Template:Math is strictly logarithmically convex, but f(0)f(0)=0=f(0)2.

Furthermore, f:I(0,) is logarithmically convex if and only if eαxf(x) is convex for all α.[2][3]

Sufficient conditions

If f1,,fn are logarithmically convex, and if w1,,wn are non-negative real numbers, then f1w1fnwn is logarithmically convex.

If {fi}iI is any family of logarithmically convex functions, then g=supiIfi is logarithmically convex.

If f:XI𝐑 is convex and g:I𝐑0 is logarithmically convex and non-decreasing, then gf is logarithmically convex.

Properties

A logarithmically convex function f is a convex function since it is the composite of the increasing convex function exp and the function logf, which is by definition convex. However, being logarithmically convex is a strictly stronger property than being convex. For example, the squaring function f(x)=x2 is convex, but its logarithm logf(x)=2log|x| is not. Therefore the squaring function is not logarithmically convex.

Examples

  • f(x)=exp(|x|p) is logarithmically convex when p1 and strictly logarithmically convex when p>1.
  • f(x)=1xp is strictly logarithmically convex on (0,) for all p>0.
  • 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

Notes

Template:Reflist

References

Template:Convex analysis and variational analysis

Template:PlanetMath attribution

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