Math 2.0

Probability theory and stochastic processes Proof

Proof of the Cauchy–Schwarz inequality for expectations

Builds on Expected valueLinearity of expectationMarkov's inequalityProbability measureAlmost surely

Proof

We study the quadratic polynomial s↦E[(X+sY)2]s \mapsto E[(X + sY)^2], which is never negative.

  1. Let XX and YY be real random variables on one probability space (Ω,ℱ,P)(\Omega, \mathcal{F}, P) with E[X2]<∞E[X^2] < \infty and E[Y2]<∞E[Y^2] < \infty.
  2. For real uu and vv, ∣uv∣≤(u2+v2)/2\abs{uv} \le (u^2 + v^2)/2, since (∣u∣−∣v∣)2≥0(\abs{u} - \abs{v})^2 \ge 0. So ∣XY∣≤(X2+Y2)/2\abs{XY} \le (X^2 + Y^2)/2.
  3. The integral of nonnegative functions is monotone. So E[∣XY∣]<∞E[\abs{XY}] < \infty, and XYXY is integrable.
  4. Let A=E[X2]A = E[X^2], B=E[XY]B = E[XY] and C=E[Y2]C = E[Y^2]. These are real numbers with A≥0A \ge 0 and C≥0C \ge 0.
  5. Fix s∈ℝs \in \R. Pointwise, (X+sY)2=X2+2sXY+s2Y2(X + sY)^2 = X^2 + 2s XY + s^2 Y^2, and all three terms are integrable.
  6. By linearity of expectation, q(s):=E[(X+sY)2]=A+2sB+s2Cq(s) := E[(X + sY)^2] = A + 2sB + s^2 C.
  7. The expected value of the nonnegative variable (X+sY)2(X + sY)^2 is nonnegative. So q(s)≥0q(s) \ge 0 for all real ss.
  8. Case C=0C = 0. Then q(s)=A+2sBq(s) = A + 2sB. If B≠0B \ne 0, then s=−(A+1)/(2B)s = -(A + 1)/(2B) gives q(s)=−1<0q(s) = -1 < 0, which contradicts step 7.
  9. So in the case C=0C = 0 we have B=0B = 0, and B2=0=ACB^2 = 0 = AC.
  10. Case C>0C > 0. Let s0=−B/Cs_0 = -B/C. Then q(s0)=A−2B2/C+B2/C=A−B2/Cq(s_0) = A - 2B^2/C + B^2/C = A - B^2/C.
  11. By step 7, A−B2/C≥0A - B^2/C \ge 0. Multiplying by C>0C > 0 gives B2≤ACB^2 \le AC.
  12. Steps 9 and 11 prove (E[XY])2≤E[X2] E[Y2](E[XY])^2 \le E[X^2] \, E[Y^2].

Now the equality case.

  1. First a lemma. Let W≥0W \ge 0 be a random variable with E[W]=0E[W] = 0. For each integer k≥1k \ge 1, Markov's inequality gives P(W≥1/k)≤kE[W]=0P(W \ge 1/k) \le k E[W] = 0.
  2. The event {W>0}\set{W > 0} is the union of the events {W≥1/k}\set{W \ge 1/k} over k≥1k \ge 1. A probability measure is countably subadditive, so P(W>0)=0P(W > 0) = 0.
  3. So W=0W = 0 almost surely.
  4. Suppose B2=ACB^2 = AC and C=0C = 0. Then E[Y2]=0E[Y^2] = 0. By step 15 for W=Y2W = Y^2, Y=0Y = 0 almost surely. So 0⋅X+1⋅Y=00 \cdot X + 1 \cdot Y = 0 almost surely.
  5. Suppose B2=ACB^2 = AC and C>0C > 0. By step 10, q(s0)=A−B2/C=0q(s_0) = A - B^2/C = 0. So E[(X+s0Y)2]=0E[(X + s_0 Y)^2] = 0.
  6. By step 15 for W=(X+s0Y)2W = (X + s_0 Y)^2, X+s0Y=0X + s_0 Y = 0 almost surely. So a=1a = 1 and b=s0b = s_0 work, and a≠0a \ne 0.
  7. Conversely, let aX+bY=0aX + bY = 0 almost surely, with reals aa and bb not both 00. Variables that agree almost surely have the same expectation, since the integral ignores null sets.
  8. If b≠0b \ne 0, let c=−a/bc = -a/b. Then Y=cXY = cX almost surely. So XY=cX2XY = cX^2 and Y2=c2X2Y^2 = c^2 X^2 almost surely.
  9. By steps 19 and 20, B=cAB = cA and C=c2AC = c^2 A. So B2=c2A2=ACB^2 = c^2 A^2 = AC.
  10. If b=0b = 0, then a≠0a \ne 0 and X=0X = 0 almost surely. So X2=0X^2 = 0 and XY=0XY = 0 almost surely, and A=B=0A = B = 0. Thus B2=0=ACB^2 = 0 = AC.
  11. So equality holds if and only if aX+bY=0aX + bY = 0 almost surely for some reals aa and bb, not both 00.

Idea

The mean of (X+sY)2(X + sY)^2 is a quadratic polynomial in ss that is never negative. So it cannot have two distinct real roots, which is exactly the inequality. Equality means the polynomial reaches 00, so some combination X+sYX + sY vanishes almost surely.

Reading path

To understand this page from the ground up, read these 70 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the probability of the complement, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the monotonicity of probability, Proof that the reals are Archimedean from the completeness axiom, Proof of Markov's inequality.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Ordered field definition
  5. Proposition concept
  6. Random experiment concept
  7. Rational numbers object
  8. Real numbers object
  9. Set bounded above definition
  10. Set definition
  11. Ring of integers statement
  12. Archimedean ordered field definition
  13. Disjunction definition
  14. Implication definition
  15. Predicate definition
  16. The reals form a field statement
  17. Supremum definition
  18. Ordered pair definition
  19. Union definition
  20. Sample space definition
  21. The rationals form a field statement
  22. Existential quantifier definition
  23. Universal quantifier definition
  24. Completeness axiom statement
  25. Cartesian product definition
  26. Subset definition
  27. The rationals form an ordered field statement
  28. Uniqueness quantifier definition
  29. Binary relation definition
  30. Universal set definition
  31. Order on the reals definition
  32. Power set definition
  33. Antisymmetric relation definition
  34. Reflexive relation definition
  35. Transitive relation definition
  36. Complement definition
  37. Function definition
  38. Interval definition
  39. Preorder definition
  40. Sigma-algebra definition
  41. Indicator function definition
  42. Preimage of a set definition
  43. Injective function definition
  44. Partial order definition
  45. Event definition
  46. Countable set definition
  47. Borel sigma-algebra definition
  48. Total order definition
  49. Probability axioms concept
  50. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  51. Probability measure definition
  52. Probability space definition
  53. The reals form an ordered field statement
  54. Almost surely definition
  55. Random variable definition
  56. Proof of the approximation property of the supremum proof
  57. Discrete random variable definition
  58. Random variable with a density definition
  59. Approximation property of the supremum statement
  60. Expected value definition
  61. Proof that the reals are Archimedean from the completeness axiom proof
  62. Linearity of expectation statement
  63. The reals are Archimedean statement
  64. Proof of Markov's inequality proof
  65. Proof of the probability of the complement proof
  66. Probability of the complement statement
  67. Proof of the monotonicity of probability proof
  68. Monotonicity of probability statement
  69. Markov's inequality statement
  70. Proof of the Cauchy–Schwarz inequality for expectations proof

Where this leads

6 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cauchy–Schwarz_inequality, Proof by analyzing a quadratic
About this page
TagZX91JA56FM
URIm2://ZX91JA56FM
Kindproof
WritingW0 stub
MSC60E15
ProvesCauchy–Schwarz inequality for expectations
UsesExpected value, Linearity of expectation, Markov's inequality, Probability measure, Almost surely
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.