Often you know a mean, or a mean and a variance, but not the whole distribution. An inequality turns those numbers into a bound: a probability that cannot be exceeded, whatever the distribution. It is a guarantee, not an estimate.
Waits in a queue are never negative and average 2 minutes. Could half of all customers wait 10 minutes or more? No: those customers alone would push the mean to at least 0.5×10=5 minutes.
At most a fifth can wait that long, since 0.2×10=2 already uses up the whole mean. This argument is Markov's inequality.
Markov's inequality
Rule: Markov's inequality
X≥0,a>0:P(X≥a)≤aE[X]
A variable that is never negative lands at a or above with probability at most its mean divided by a. The values at a or above contribute at least a⋅P(X≥a) to the mean, and no value pulls the mean down, because none is negative.
A fair die.X is the number shown, with mean 3.5 (lesson 5.3.1). The bound a3.5 against the truth:
a
1
2
3
4
5
6
P(X≥a)
1
65
32
21
31
61
bound a3.5
3.5
1.75
1.1667
0.875
0.7
0.5833
The bound always holds, but loosely: at a=6 it allows 0.5833 where the truth is 61. Up to a=3 it is above 1 and says nothing at all.
An exponential wait. With mean 1 (lesson 5.4.2), P(X≥a)=e−a. At a=3 that is 0.0498, against the bound 31≈0.3333; at a=5 it is 0.0067 against 0.2.
Three cases complete the picture.
The bound can be reached. Let X be 0 with probability 0.8 and 10 with probability 0.2. Its mean is 2, and P(X≥10)=0.2=102 exactly. So no better bound can come from the mean alone.
For a≤E[X] it says nothing. The bound is then 1 or more, and every probability is at most 1 anyway.
Negative values break it. Let X be −10 or 10 with equal chances. Its mean is 0, so the "bound" would say P(X≥10)≤0, yet that probability is 21. The negative values cancel the large ones in the mean.
Try it
The loop prints the die's table: the exact probability as a fraction, then the bound. The second loop compares e−a with a1.
Then 100,000 seeded exponential draws. In this run their mean is 0.9951, and the shares at or above 2, 3 and 5 are close to e−a, far below the bound.
⌘/Ctrl + Enter runs the cell
Chebyshev's inequality
Markov's inequality uses only the mean. Add the variance and you can bound how far X strays on either side.
The squared distance (X−μ)2 is never negative, and its mean is the variance σ2 (lesson 5.3.2). Markov's inequality applied to it, with a=ε2, gives the rule below. Here μ is the mean, σ the standard deviation and ε (epsilon) any positive distance.
Rule: Chebyshev's inequality
P(∣X−μ∣≥ε)≤ε2σ2P(∣X−μ∣≥kσ)≤k21
For any distribution with a finite variance. The second form counts the distance in standard deviations. At most k21 of the probability lies k or more of them from the mean, both sides together.
So at least 1−41=75% of any distribution lies within 2 standard deviations of its mean, and at least 98≈88.89% within 3. For the normal the shares are 95.45% and 99.73% (lesson 5.4.3): the guarantee is weaker because it must hold for every distribution.
The die again.μ=3.5 and σ=35/12≈1.7078. The faces 1 and 6 lie 2.5 from the mean, which is k≈1.4639 standard deviations.
So P(∣X−3.5∣≥2.5)=62=31, and Chebyshev allows 2.5235/12≈0.4667.
Three distributions at once. The two-sided tail P(∣X−μ∣≥kσ) for a normal, a uniform and an exponential with mean 1, against the bound:
k
1.5
2
3
normal
0.1336
0.0455
0.0027
uniform
0.1340
0
0
exponential
0.0821
0.0498
0.0183
bound k21
0.4444
0.25
0.1111
A uniform never strays more than 3≈1.73 standard deviations from its mean, so its tail is 0 from k=2 on. The exponential's long right tail keeps it above the normal far out.
The cases to know:
k≤1 says nothing. The bound is then at least 1.
The bound can be reached. Let X be −1, 0 or 1 with probabilities 81, 43, 81. Then μ=0 and σ=21, and P(∣X∣≥1)=41: exactly k21 with k=2.
It needs a finite variance. A Student t with ν≤2 degrees of freedom has none (lesson 5.4.4), and Chebyshev's inequality says nothing about it.
Both bounds hold for every distribution with the given mean or variance, so for most they are loose. Each can be reached, but only by a distribution built for it.
Try it
The first line is the die: σ, the bound for a distance of 2.5, and that distance in standard deviations. The loop prints the table above.
Then the three-point example, which reaches the bound. Last, 100,000 seeded standard normal draws: their shares beyond 1.5, 2 and 3 are close to the normal row.
⌘/Ctrl + Enter runs the cell
Chebyshev's inequality is loose, but it holds without knowing the shape of the distribution. Lesson 5.7.2 uses it to show that averages settle on the mean.
Jensen's inequality
Lesson 5.3.1 found that for a die the mean of the squares, E[X2]≈15.17, is above the square of the mean, 3.52=12.25. It also found E[X1]≈0.4083, above E[X]1≈0.2857. Both curves, x2 and x1 for x>0, bend up.
Rule: Jensen's inequality
g convex: E[g(X)]≥g(E[X])g concave: E[g(X)]≤g(E[X])
The curve must be convex (concave up, g′′≥0) or concave (g′′≤0) over all the values X can take (lesson 2.4.2). For a straight line, g(x)=ax+b, the two sides are equal (lesson 5.3.2).
Each face puts a point (x,g(x)) on the curve with weight 61; their balance point is (E[X],E[g(X)]). For a curve that bends up it sits above the curve, and for one that bends down, below.
Four examples, two of each kind:
x2, convex.15.1667≥12.25. The gap is exactly the variance, 1235≈2.9167: for g(x)=x2, Jensen's inequality says a variance is never negative.
x1, convex for x>0.0.4083≥0.2857.
lnx, concave.E[lnX]≈1.0965, below ln3.5≈1.2528. The same holds for x: 1.8053 against 1.8708.
ex, convex. Case study 5.6.5 took Y=vZ with Z standard normal and v≈0.141421. Then E[eY]=ev2/2≈1.01005, above eE[Y]=e0=1. That excess is why its model subtracts 2σ2 in the exponent.
Where the rule says less, or nothing:
Equality holds when X is a constant or g is a straight line over the values of X.
Convex over every value. If X is −1 or 1 with equal chances, x1 is not convex across 0. Then E[X1]=0, while E[X]1=01 does not exist.
A curve that bends both ways, such as x3, can give either order. With X equal to 0 or 2, E[X3]=4≥13; with X equal to −2 or 0, E[X3]=−4≤(−1)3.
Try it
For the die, each line prints E[g(X)] then g(3.5): two convex curves, then two concave ones.
The last line is case study 5.6.5's evZ: the exact mean ev2/2, then the average of a million seeded draws, 1.0101 in this run.
⌘/Ctrl + Enter runs the cell
How big the gap is
For a small spread the gap is about half the curvature times the variance:
E[g(X)]−g(μ)≈21g′′(μ)Var(X)
This is the quadratic term of the Taylor polynomial about μ (lesson 2.7.1), averaged. For x2 it is exact: 21⋅2⋅σ2=σ2. For evZ it gives 2v2=0.01, against the exact 0.01005.
For the die the spread is too wide for the estimate to be close. The sign of g′′ still tells you the direction.
Risk aversion
Case study 2.4.5 valued wealth w with the concave utility u(w)=lnw. A fair flip of $20,000 on $100,000 gave an expected utility of 11.4925, below ln100,000≈11.5129.
Jensen's inequality says this happens for every gamble, not only that flip. For any concave u and any random wealth W, E[u(W)]≤u(E[W]).
So the certainty equivalent, the sure wealth with the same utility, is never above the expected wealth, and the risk premium is never negative. A convex utility reverses this: that person is risk seeking, as in case study 2.4.5's u(w)=w2.
Take wealth of $50,000, $100,000 or $200,000 with probabilities 0.25, 0.5 and 0.25. The expected wealth is $112,500, but with log utility the certainty equivalent is exactly $100,000. This person would give up $12,500 to avoid the risk.
Try it
The first two lines check the gap estimate: for evZ, then for case study 2.4.5's flip, where g′′=−w21 and the variance is s2. The estimate −0.02 is close to the exact −0.0204.
The last line is the three-outcome gamble: expected wealth, certainty equivalent and risk premium.
⌘/Ctrl + Enter runs the cell
Common mistakes
Markov's inequality needs X≥0. For −10 or 10 with equal chances it would claim P(X≥10)≤0.
A bound is not an estimate. For a die, Markov allows P(X≥6)≤0.5833; the truth is 61.
Chebyshev's bound covers both sides together, and needs k>1 to say anything.
Keep the two forms apart.ε2σ2 uses the variance and a distance in the units of X; k21 counts standard deviations. With σ=2 and ε=4, both give 41.
Jensen's direction. Convex means the mean of g is the larger side. Check with x2: E[X2]≥(E[X])2.
The curve must bend one way over every value of X.x1 is convex only for x>0.
Markov, Chebyshev and Jensen
0 of 13 correct
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
How to type answers
Powers with ^: x^7, 2^(1/3), a^-2.
Multiply with * or by writing side by side: 3x^2, 2(x+1).
ln(x) is the natural log, log(x, 2) is log base 2, e is Euler's number, sqrt(x) is a square root.
sin(x), cos(x) and tan(x) take radians; write pi for π and sin(x)^2 for sin²x.
Your first answer to each question is saved: it counts towards your score and brings the question back for review.
Exact answers like ln(20)/ln(3) are best. Decimals need about 4 significant figures.
Summary card
Markov: for X≥0 and a>0, P(X≥a)≤aE[X]. It fails for variables that can be negative.
Chebyshev: P(∣X−μ∣≥kσ)≤k21, or ε2σ2 for a distance ε. At least 75% lies within 2σ and 98 within 3σ, for any distribution with a finite variance.
Both are guarantees, loose for most distributions and reached by a few built for them.
Jensen: E[g(X)]≥g(E[X]) for convex g, ≤ for concave g, = for a straight line. The gap is about 21g′′(μ)Var(X) for small spreads.
A concave utility gives E[u(W)]≤u(E[W]) for every gamble: the certainty equivalent is at most the expected wealth.