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 , which is never negative.
- Let and be real random variables on one probability space with and .
- For real and , , since . So .
- The integral of nonnegative functions is monotone. So , and is integrable.
- Let , and . These are real numbers with and .
- Fix . Pointwise, , and all three terms are integrable.
- By linearity of expectation, .
- The expected value of the nonnegative variable is nonnegative. So for all real .
- Case . Then . If , then gives , which contradicts step 7.
- So in the case we have , and .
- Case . Let . Then .
- By step 7, . Multiplying by gives .
- Steps 9 and 11 prove .
Now the equality case.
- First a lemma. Let be a random variable with . For each integer , Markov's inequality gives .
- The event is the union of the events over . A probability measure is countably subadditive, so .
- So almost surely.
- Suppose and . Then . By step 15 for , almost surely. So almost surely.
- Suppose and . By step 10, . So .
- By step 15 for , almost surely. So and work, and .
- Conversely, let almost surely, with reals and not both . Variables that agree almost surely have the same expectation, since the integral ignores null sets.
- If , let . Then almost surely. So and almost surely.
- By steps 19 and 20, and . So .
- If , then and almost surely. So and almost surely, and . Thus .
- So equality holds if and only if almost surely for some reals and , not both .
Idea
The mean of is a quadratic polynomial in that is never negative. So it cannot have two distinct real roots, which is exactly the inequality. Equality means the polynomial reaches , so some combination 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.
- Construction of the reals from Cauchy sequences concept
- Element definition
- Integers object
- Ordered field definition
- Proposition concept
- Random experiment concept
- Rational numbers object
- Real numbers object
- Set bounded above definition
- Set definition
- Ring of integers statement
- Archimedean ordered field definition
- Disjunction definition
- Implication definition
- Predicate definition
- The reals form a field statement
- Supremum definition
- Ordered pair definition
- Union definition
- Sample space definition
- The rationals form a field statement
- Existential quantifier definition
- Universal quantifier definition
- Completeness axiom statement
- Cartesian product definition
- Subset definition
- The rationals form an ordered field statement
- Uniqueness quantifier definition
- Binary relation definition
- Universal set definition
- Order on the reals definition
- Power set definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Complement definition
- Function definition
- Interval definition
- Preorder definition
- Sigma-algebra definition
- Indicator function definition
- Preimage of a set definition
- Injective function definition
- Partial order definition
- Event definition
- Countable set definition
- Borel sigma-algebra definition
- Total order definition
- Probability axioms concept
- Proof that the reals form an ordered field, with the Cauchy sequence construction proof
- Probability measure definition
- Probability space definition
- The reals form an ordered field statement
- Almost surely definition
- Random variable definition
- Proof of the approximation property of the supremum proof
- Discrete random variable definition
- Random variable with a density definition
- Approximation property of the supremum statement
- Expected value definition
- Proof that the reals are Archimedean from the completeness axiom proof
- Linearity of expectation statement
- The reals are Archimedean statement
- Proof of Markov's inequality proof
- Proof of the probability of the complement proof
- Probability of the complement statement
- Proof of the monotonicity of probability proof
- Monotonicity of probability statement
- Markov's inequality statement
- Proof of the Cauchy–Schwarz inequality for expectations proof
Where this leads
6 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Cauchy–Schwarz_inequality, Proof by analyzing a quadratic
About this page
| Tag | ZX91JA56FM |
|---|---|
| URI | m2://ZX91JA56FM |
| Kind | proof |
| Writing | W0 stub |
| MSC | 60E15 |
| Proves | Cauchy–Schwarz inequality for expectations |
| Uses | Expected value, Linearity of expectation, Markov's inequality, Probability measure, Almost surely |
| Changed | 4 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.