Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.5.5 — Kolmogorov's maximal inequality

Proved
DurrettProbability.kolmogorov_maximal_inequality

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisprobability

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent, square-integrable, with EXi=0\mathbb{E}X_i=0EXi​=0, and write Sk=X1+⋯+XkS_k=X_1+\cdots+X_kSk​=X1​+⋯+Xk​. Then for every x>0x>0x>0,

P(max⁡1≤k≤n∣Sk∣≥x)  ≤  var⁡(Sn)x2.\mathbb{P}\Bigl(\max_{1\le k\le n}|S_k|\ge x\Bigr)\;\le\;\frac{\operatorname{var}(S_n)}{x^{2}}.P(1≤k≤nmax​∣Sk​∣≥x)≤x2var(Sn​)​.

Compare Chebyshev's inequality, which under the same hypotheses bounds only P(∣Sn∣≥x)\mathbb{P}(|S_n|\ge x)P(∣Sn​∣≥x) by the same quantity. The maximal inequality controls the entire path up to time nnn at no extra cost, and that is what makes it useful: to show a random series converges one needs the partial sums to be uniformly close to each other over a whole tail, not merely close at one time.

The mechanism is a first-passage decomposition. Let AkA_kAk​ be the event that ∣Sk∣≥x|S_k|\ge x∣Sk​∣≥x while ∣Sj∣<x|S_j|<x∣Sj​∣<x for every j<kj<kj<k; the AkA_kAk​ are disjoint, Sk1AkS_k\mathbb{1}_{A_k}Sk​1Ak​​ depends only on X1,…,XkX_1,\dots,X_kX1​,…,Xk​, and Sn−SkS_n-S_kSn​−Sk​ depends only on Xk+1,…,XnX_{k+1},\dots,X_nXk+1​,…,Xn​, so independence kills the cross terms in E[Sn2;Ak]\mathbb{E}[S_n^2;A_k]E[Sn2​;Ak​] and leaves E[Sk2;Ak]≥x2P(Ak)\mathbb{E}[S_k^2;A_k]\ge x^2\mathbb{P}(A_k)E[Sk2​;Ak​]≥x2P(Ak​).

Formalization Note The maximum over 1≤k≤n1\le k\le n1≤k≤n is expressed as the existence of such a kkk with ∣Sk∣≥x|S_k|\ge x∣Sk​∣≥x, which is the same event and avoids introducing a maximum over an index range that is empty when n=0n=0n=0; in that case both sides are the trivial bound 0≤var⁡(S0)/x20\le\operatorname{var}(S_0)/x^20≤var(S0​)/x2. Square-integrability is membership in L2L^2L2, which is what makes the variances finite.

Preamble
import Mathlib
import Definitions.Def_DurrettProbability_Series

open MeasureTheory ProbabilityTheory Filter
Formal statement
namespace DurrettProbability

theorem kolmogorov_maximal_inequality {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω}
    [IsProbabilityMeasure μ] (X : ℕ → Ω → ℝ) (hmeas : ∀ i, Measurable (X i))
    (hindep : iIndepFun X μ) (hL2 : ∀ i, MemLp (X i) 2 μ) (hmean : ∀ i, μ[X i] = 0)
    (n : ℕ) (x : ℝ) (hx : 0 < x) :
    (μ {ω | ∃ k ∈ Finset.Icc 1 n, x ≤ |partialSum X k ω|}).toReal
      ≤ Var[partialSum X n; μ] / x ^ 2 := by sorry

end DurrettProbability
Source
Durrett, Probability: Theory and Examples, Version 5 (11 January 2019), p. 84 (PDF p. 92), Theorem 2.5.5: 'Kolmogorov's maximal inequality. Suppose X_1, ..., X_n are independent with EX_i = 0 and var(X_i) < infinity. If S_n = X_1 + ... + X_n then P( max_{1 <= k <= n} |S_k| >= x ) <= x^{-2} var(S_n).' Remark: 'Under the same hypotheses, Chebyshev's inequality (Theorem 1.6.4) gives only P(|S_n| >= x) <= x^{-2} var(S_n).' sha256 aeac36cbf5e44c53d69fa60a2d29a393e2d0e8c955ee103bd845d925fd910886
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me