Probability theory and stochastic processes Proof
Proof of Chebyshev's inequality
Proof
We apply Markov's inequality to the squared deviation.
- Let be a real random variable with finite mean and finite variance . Let .
- Let . Then takes values in , and by the definition of the variance.
- For and , holds if and only if , since squaring is increasing on .
- Apply step 3 to . This gives the equality of events .
- By Markov's inequality for and the level , .
- By steps 4 and 5, .
- Now let be the standard deviation and let . Then .
- Step 6 with this gives .
Idea
A large deviation is the same event as a large squared deviation . Markov's inequality bounds the second event by the mean of the squared deviation, which is the variance.
Reading path
To understand this page from the ground up, read these 74 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 existence of square roots of nonnegative reals, 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
- Random variable definition
- Proof of the approximation property of the supremum proof
- Proof of the existence of square roots of nonnegative reals proof
- Discrete random variable definition
- Random variable with a density definition
- Existence of square roots of nonnegative reals statement
- Approximation property of the supremum statement
- Expected value definition
- Square root definition
- Proof that the reals are Archimedean from the completeness axiom proof
- Linearity of expectation statement
- Variance definition
- The reals are Archimedean statement
- Proof of Markov's inequality proof
- Standard deviation definition
- 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 Chebyshev's inequality proof
Where this leads
19 pages build on this one.
- Chebyshev's inequality
- Weak law of large numbers
- Strong law of large numbers
- Sample average approximation
- Ergodic decomposition
- Koksma–Hlawka inequality
- Consistency of the maximum likelihood estimator
- Asymptotic equipartition property
- Source–channel separation theorem
- Kingman's subadditive ergodic theorem
- Asymptotic normality of the maximum likelihood estimator
- Typical set
- Monte Carlo integration
- Shannon–Hartley theorem
- Birkhoff's ergodic theorem
- Oseledets theorem
- Noisy-channel coding theorem
- Kelly criterion
- Pesin theory
Further reading
About this page
| Tag | D5T6KJSR02 |
|---|---|
| URI | m2://D5T6KJSR02 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 60E15 |
| Proves | Chebyshev's inequality |
| Uses | Markov's inequality, Variance, Standard deviation |
| 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.