Math 2.0

Probability theory and stochastic processes Limit theorems Theorem

Kolmogorov's inequality

Builds on Independence of random variablesExpected valueVarianceRandom variable

Statement

Let X1,…,XnX_1, \dots, X_n be independent real random variables with E[Xk]=0E[X_k] = 0 and E[Xk2]<∞E[X_k^2] < \infty for each kk. Let Sk=X1+⋯+XkS_k = X_1 + \cdots + X_k for 1≤k≤n1 \le k \le n. Then for every λ>0\lambda > 0, P(max⁡1≤k≤n∣Sk∣≥λ)≤Var⁡(Sn)λ2=1λ2∑k=1nE[Xk2].P\left(\max_{1 \le k \le n} \abs{S_k} \ge \lambda\right) \le \frac{\operatorname{Var}(S_n)}{\lambda^2} = \frac{1}{\lambda^2} \sum_{k=1}^{n} E[X_k^2].

Remarks

Let τ\tau be the first kk with ∣Sk∣≥λ\abs{S_k} \ge \lambda. The event {τ=k}\set{\tau = k} depends only on X1,…,XkX_1, \dots, X_k. By independence the cross term E[Sk(Sn−Sk)𝟏τ=k]E[S_k (S_n - S_k) \mathbf{1}_{\tau = k}] vanishes, so E[Sn2𝟏τ=k]≥E[Sk2𝟏τ=k]≥λ2P(τ=k)E[S_n^2 \mathbf{1}_{\tau = k}] \ge E[S_k^2 \mathbf{1}_{\tau = k}] \ge \lambda^2 P(\tau = k). Summing over kk gives λ2P(τ≤n)≤E[Sn2]\lambda^2 P(\tau \le n) \le E[S_n^2].

The bound has the same right side as Chebyshev's inequality for the single variable SnS_n, but it controls the whole path S1,…,SnS_1, \dots, S_n. It is a special case of Doob's martingale inequality, since (Sk)(S_k) is a martingale.

Example: let the XkX_k be independent signs, equal to 11 or −1-1 with probability 1/21/2 each. Then the probability that ∣Sk∣≥λ\abs{S_k} \ge \lambda for some k≤nk \le n is at most n/λ2n / \lambda^2. With λ=10n\lambda = 10 \sqrt{n} this is at most 1/1001/100.

Going deeper

For a student

The inequality is the key step in the proof that a series ∑Xk\sum X_k of independent centred variables with ∑Var⁡(Xk)<∞\sum \operatorname{Var}(X_k) < \infty converges almost surely. That result leads to Kolmogorov's three-series theorem and to the strong law of large numbers for independent variables with suitable finite variances.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Expected value concept
  2. Independence of random variables concept
  3. Random variable concept
  4. Variance concept
  5. Kolmogorov's inequality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Kolmogorov%27s_inequality
About this page
TagD9B4HE4B4Q
URIm2://D9B4HE4B4Q
Kindstatement, theorem
WritingW0 stub
MSC60E15, 60F15
StatusThis copy of the site has no build data. Run m2 status D9B4HE4B4Q.
AboutVariance
UsesIndependence of random variables, Expected value, Variance, Random variable
Same as
Changed2 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)
  • a source with a locator (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.