Chebyshev's Inequality
Statement of Chebyshev’s Inequality
Theorem
A theorem is a proposition that has been rigorously proved, and it is the foundation of mathematical reasoning. A theorem usually states its conditions and its conclusion, and is an important part of any mathematical system.
Let the expectation of a random variable be and its variance be . Then for any positive number :
Proof
Proof for a discrete random variable:
Proof for a continuous random variable:
Equivalent Forms
Form 1:
Form 2: , where
Intuitive Understanding of Chebyshev’s Inequality
Understanding: Chebyshev’s inequality gives an upper bound on the probability that a random variable deviates from its expected value. It tells us that the farther the values of a random variable deviate from the expectation, the smaller the probability of such a deviation.
Key Idea Behind the Proof
Key idea:
- In the region , we have
- Therefore
- This inequality is used to bound the probability
Generality
Property 1: Chebyshev’s inequality applies to random variables with any distribution, as long as their expectation and variance exist.
Conservativeness
Property 2: the upper bound given by Chebyshev’s inequality is usually conservative, that is, the actual probability may be far smaller than this upper bound.
Distribution-Free Character
Property 3: Chebyshev’s inequality places no special requirement on the distribution of the random variable and depends only on the expectation and the variance.
Applications in Probability Estimation
Application 1: estimating the probability that a random variable deviates from its expectation
Example 1: let the expectation of a random variable be and its variance be . Estimate an upper bound for .
Solution:
Applications in Statistical Inference
Application 2: proving the law of large numbers
Application 3: estimating the precision of the sample mean
Applications in Quality Control
Application 4: estimating the range of fluctuation of product quality
Application 5: setting quality control standards
Conservativeness
Limitation 1: the upper bound given by Chebyshev’s inequality is usually conservative; for specific distributions there may be more precise estimates.
Incomplete Use of Information
Limitation 2: Chebyshev’s inequality uses only the information of the expectation and the variance, and does not use other features of the distribution.
Restricted Applicability
Limitation 3: for certain special distributions, there may be better inequalities.
Relation to Markov’s Inequality
Markov’s inequality: let be a non-negative random variable. Then for any :
Relation: Chebyshev’s inequality is a special case of Markov’s inequality, obtained by replacing with .
Relation to Hoeffding’s Inequality
Hoeffding’s inequality: for bounded random variables, Hoeffding’s inequality gives a more precise estimate.
Multidimensional Chebyshev’s Inequality
Generalization 1: for multidimensional random variables, there is a corresponding Chebyshev’s inequality.
Conditional Chebyshev’s Inequality
Generalization 2: under given conditions, there is a corresponding Chebyshev’s inequality.
Exercise 1
Use Chebyshev’s inequality to estimate an upper bound for when .
Approach: Use Chebyshev’s inequality.
Steps:
- Chebyshev’s inequality:
- Here , , and
Answer:
Exercise 2
Let the expectation of a random variable be and its variance be . Use Chebyshev’s inequality to estimate a lower bound for .
Approach: First find an upper bound for , then use the relation of complementary events.
Steps:
- Since is equivalent to , we get
Answer:
Exercise 3
Let the expectation of a random variable be and its variance be . Use Chebyshev’s inequality to estimate an upper bound for .
Approach: Apply Chebyshev’s inequality directly.
Steps:
- Substituting into the general form of Chebyshev’s inequality , with and , the upper bound is .
Answer: , that is, the probability of this event occurring is at most one quarter.
Exercise 4
Prove that for any random variable , if and , then for any :
Approach: Use Chebyshev’s inequality with .
Steps:
- Chebyshev’s inequality:
- Setting gives:
Answer: the proof is complete
Exercise 5
Let a random variable follow the normal distribution . Compare the upper bound given by Chebyshev’s inequality with the actual probability.
Approach: Compute the actual probability of the normal distribution and compare it with the upper bound given by Chebyshev’s inequality.
Steps:
- For the normal distribution,
- Chebyshev’s inequality gives:
- The actual probability is far smaller than the upper bound , showing that Chebyshev’s inequality is fairly conservative
Answer: the upper bound given by Chebyshev’s inequality is much larger than the actual probability, showing that it is fairly conservative
Symbols Used in This Article
| Greek Letter | Pronunciation | Description |
|---|---|---|
| Epsilon (epsilon) | denotes an arbitrary positive number; in Chebyshev’s inequality it represents the degree of deviation | |
| Mu (mu) | denotes the population mean or the expectation | |
| Sigma (sigma) | denotes the population standard deviation | |
| Phi (phi) | denotes the distribution function of the standard normal distribution |
