Markov's Inequality
Motivation
Can we bound how often a non-negative random variable takes large values? Markov’s inequality gives a simple but powerful bound using only the mean.
Statement
If is a non-negative random variable (i.e., with probability 1) with finite expectation , then for any :
Proof
Since :
where is the indicator of the event .
Taking expectations:
Therefore:
Visual Intuition
The area under the tail beyond cannot exceed , since otherwise the total area would exceed the mean.
Alternative Form
For non-negative :
Interpretation: At most of the distribution lies at or more times the mean.
Example
If , then:
At most one-third of values are at least 30.
Examples
Example 1: Mean 5
A non-negative random variable has mean 5. What can we say about ?
At most 50% of probability lies at or above 10.
Example 2: Exam Scores
Scores are non-negative with mean 70. What proportion score at least 90?
At most 78% can score 90 or higher. (The true proportion is likely much smaller, but this is the bound.)
Example 3: Something True for Exponential
If , then .
Markov: .
Actual: .
For : Markov gives . True but useless!
Markov’s bound can be very loose.
Corollary: Bounded Variables
If is bounded in , then:
Or equivalently:
Limitations
- Only uses the mean: Much stronger bounds are possible with more information (like variance)
- Often loose: The bound can be far from the actual probability
- Non-negative only: Only applies to
Why Useful?
Despite being loose, Markov’s inequality is:
- Simple to apply
- Requires only the mean
- Foundation for stronger bounds (Chebyshev)
Summary
| Property | Statement |
|---|---|
| Condition | with finite mean |
| Inequality | |
| Scaled form | |
| Limitation | Can be very loose |