Jump to content

Paley–Zygmund inequality

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 147.27.120.169 (talk) at 15:12, 27 January 2017 (→‎Related inequalities). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the Paley–Zygmund inequality bounds the probability that a positive random variable is small, in terms of its mean and variance (i.e., 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 , then

Proof: First,

The first addend is at most , while the second is at most by the Cauchy–Schwarz inequality. The desired inequality then follows. ∎

The Paley–Zygmund inequality can be written as

This can be improved. By the Cauchy–Schwarz inequality,

which, after rearranging, implies that

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

References

  • R. E. A. C. Paley and A. Zygmund, "On some series of functions, (3)," Proc. Camb. Phil. Soc. 28 (1932), 190-205, (cf. Lemma 19 page 192).
  • R. E. A. C. Paley and A. Zygmund, A note on analytic functions in the unit circle, Proc. Camb. Phil. Soc. 28 (1932), 266–272