Skip to content
Part IA Easter Term

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 XX is a non-negative random variable (i.e., X0X \geq 0 with probability 1) with finite expectation E[X]E[X], then for any a>0a > 0:

P(Xa)E[X]aP(X \geq a) \leq \frac{E[X]}{a}

Proof

Since X0X \geq 0:

Xa1XaX \geq a \cdot \mathbb{1}_{X \geq a}

where 1Xa\mathbb{1}_{X \geq a} is the indicator of the event {Xa}\{X \geq a\}.

Taking expectations:

E[X]aE[1Xa]=aP(Xa)E[X] \geq a \cdot E[\mathbb{1}_{X \geq a}] = a \cdot P(X \geq a)

Therefore:

P(Xa)E[X]aP(X \geq a) \leq \frac{E[X]}{a}

Visual Intuition

The area under the tail beyond aa cannot exceed E[X]/aE[X]/a, since otherwise the total area would exceed the mean.

Markov's inequality visualisation

Alternative Form

For non-negative XX:

P(XkE[X])1kP(X \geq k E[X]) \leq \frac{1}{k}

Interpretation: At most 1/k1/k of the distribution lies at kk or more times the mean.

Example

If E[X]=10E[X] = 10, then:

P(X30)=P(X3E[X])13P(X \geq 30) = P(X \geq 3 \cdot E[X]) \leq \frac{1}{3}

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 P(X10)P(X \geq 10)?

P(X10)E[X]10=510=0.5P(X \geq 10) \leq \frac{E[X]}{10} = \frac{5}{10} = 0.5

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?

P(X90)70900.78P(X \geq 90) \leq \frac{70}{90} \approx 0.78

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 XExp(λ)X \sim \text{Exp}(\lambda), then E[X]=1/λE[X] = 1/\lambda.

Markov: P(X1)=P(XλE[X])1/λP(X \geq 1) = P(X \geq \lambda E[X]) \leq 1/\lambda.

Actual: P(X1)=eλλP(X \geq 1) = e^{-\lambda} \leq \lambda.

For λ=1\lambda = 1: Markov gives P(X1)1P(X \geq 1) \leq 1. True but useless!

Markov’s bound can be very loose.

Corollary: Bounded Variables

If XX is bounded in [0,M][0, M], then:

P(XMa)ME[X]aP(X \leq M - a) \leq \frac{M - E[X]}{a}

Or equivalently:

P(XMa)E[X]+aMaP(X \geq M - a) \geq \frac{E[X] + a - M}{a}

Limitations

  1. Only uses the mean: Much stronger bounds are possible with more information (like variance)
  2. Often loose: The bound can be far from the actual probability
  3. Non-negative only: Only applies to X0X \geq 0

Why Useful?

Despite being loose, Markov’s inequality is:

  • Simple to apply
  • Requires only the mean
  • Foundation for stronger bounds (Chebyshev)

Summary

PropertyStatement
ConditionX0X \geq 0 with finite mean
InequalityP(Xa)E[X]aP(X \geq a) \leq \frac{E[X]}{a}
Scaled formP(XkE[X])1kP(X \geq k E[X]) \leq \frac{1}{k}
LimitationCan be very loose