Paley–Zygmund inequality

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, the Paley–Zygmund inequality bounds the probability that a positive random variable is small, in terms of its first two moments. The inequality was proved by Raymond Paley and Antoni Zygmund.

Theorem: If Z ≥ 0 is a random variable with finite variance, and if 0≤θ≤1, then

P⁡(Z>θE⁡[Z])≥(1−θ)2E⁡[Z]2E⁡[Z2].

Proof: First,

E⁡[Z]=E⁡[Z𝟏{Z≤θE⁡[Z]}]+E⁡[Z𝟏{Z>θE⁡[Z]}].

The first addend is at most θE⁡[Z], while the second is at most E⁡[Z2]1/2P⁡(Z>θE⁡[Z])1/2 by the Cauchy–Schwarz inequality. The desired inequality then follows. ∎

The Paley–Zygmund inequality can be written as

P⁡(Z>θE⁡[Z])≥(1−θ)2E⁡[Z]2Var⁡Z+E⁡[Z]2.

This can be improved since, by the Cauchy–Schwarz inequality,

E⁡[Z−θE⁡[Z]]≤E⁡[(Z−θE⁡[Z])𝟏{Z>θE⁡[Z]}]≤E⁡[(Z−θE⁡[Z])2]1/2P⁡(Z>θE⁡[Z])1/2

which, after rearranging, implies that

P⁡(Z>θE⁡[Z])≥(1−θ)2E⁡[Z]2E⁡[(Z−θE⁡[Z])2]=(1−θ)2E⁡[Z]2Var⁡Z+(1−θ)2E⁡[Z]2.


This inequality is sharp; equality is achieved if Z almost surely equals a positive constant.

In turn, this implies another convenient form (known as Cantelli's inequality) which is

P⁡(Z>μ−θσ)≥θ21+θ2,

where μ=E⁡[Z] and σ2=Var⁡[Z]. This follows from the substitution θ=1−θ′σ/μ valid when 0≤μ−θσ≤μ.

A strengthened form of the Paley-Zygmund inequality states that if Z is a non-negative random variable then

P⁡(Z>θE⁡[Z∣Z>0])≥(1−θ)2E⁡[Z]2E⁡[Z2]

for every 0≤θ≤1. This inequality follows by applying the usual Paley-Zygmund inequality to the conditional distribution of Z given that it is positive and noting that the various factors of P⁡(Z>0) cancel.

Both this inequality and the usual Paley-Zygmund inequality also admit Lp versions:[1] If Z is a non-negative random variable and p>1 then

P⁡(Z>θE⁡[Z∣Z>0])≥(1−θ)p/(p−1)E⁡[Z]p/(p−1)E⁡[Zp]1/(p−1).

for every 0≤θ≤1. This follows by the same proof as above but using Hölder's inequality in place of the Cauchy-Schwarz inequality.

See also

References

Template:Reflist

Further reading

Template:Morefootnotes