Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Maximal tail bound P{Sn∗>λ}≤8exp⁡(−λ2/(2∑bk2))P\{S_n^*>\lambda\}\le 8\exp(-\lambda^2/(2\sum b_k^2))P{Sn∗​>λ}≤8exp(−λ2/(2∑bk2​)) (proof of Theorem 2)

Proved
AzumaWeightedSums.IteratedLog.max_tail_le

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationmartingalemaximal-inequalityp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let (xn)n≥1(x_n)_{n\ge1}(xn​)n≥1​ belong to class [G] with τ(xn)≤1\tau(x_n)\le1τ(xn​)≤1 for all nnn, let (bk)(b_k)(bk​) be a real sequence, n≥1n\ge1n≥1, and suppose Vn=∑k=1nbk2>0V_n=\sum_{k=1}^n b_k^2>0Vn​=∑k=1n​bk2​>0. With Sn∗=max⁡1≤m≤n∣∑k=1mbkxk∣S_n^*=\max_{1\le m\le n}|\sum_{k=1}^m b_kx_k|Sn∗​=max1≤m≤n​∣∑k=1m​bk​xk​∣, for every λ≥0\lambda\ge0λ≥0,

P{Sn∗>λ}≤8exp⁡(−λ22Vn).P\{S_n^*>\lambda\}\le 8\exp\Big(-\frac{\lambda^2}{2V_n}\Big).P{Sn∗​>λ}≤8exp(−2Vn​λ2​).

This is the bound that, in the proof of Theorem 2, "the Tchebycheff inequality and (2.3)" yield: a maximal Azuma–Hoeffding inequality for weighted sums of conditionally sub-Gaussian martingale differences. It is the probabilistic input to the Borel–Cantelli argument for Theorem 2.

Formalization Note The probability is the measure (in [0,∞][0,\infty][0,∞]) of the set where Sn∗>λS_n^*>\lambdaSn∗​>λ. The paper's printed proof of Theorem 2 writes the increment Dnk+12−Dnk2D_{n_{k+1}}^2-D_{n_k}^2Dnk+1​2​−Dnk​2​ in the denominator of the corresponding exponent; Chebyshev's exponential inequality and (2.3) give the full sum of squared weights, which is what is stated here.

Preamble
import Mathlib
import Definitions.Def_AzumaWeightedSums_IteratedLog_ClassG
import Definitions.Def_AzumaWeightedSums_IteratedLog_WeightedSums

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace AzumaWeightedSums.IteratedLog

/-- The maximal tail bound that "the Tchebycheff inequality and (2.3)" give in the proof of
Theorem 2 of Azuma 1967 (pp. 362–363): under [G] with `τ(x_n) ≤ 1`, for every `n`, every
real sequence `(b_k)` with `Σ_{k=1}^n b_k² > 0` and every `λ ≥ 0`,
`P{S_n^* > λ} ≤ 8 exp(−λ² / (2 Σ_{k=1}^n b_k²))`. -/
theorem max_tail_le {Ω : Type*} {mΩ : MeasurableSpace Ω} {μ : Measure Ω}
    [IsProbabilityMeasure μ] {ℱ : Filtration ℕ mΩ} {x : ℕ → Ω → ℝ}
    (hx : IsCondSubgaussianOne μ ℱ x) (b : ℕ → ℝ) (n : ℕ) (hb : 0 < sqWeightSum b n)
    (lam : ℝ) (hlam : 0 ≤ lam) :
    μ {ω | lam < maxAbsWeightedSum b x n ω}
      ≤ ENNReal.ofReal (8 * Real.exp (-(lam ^ 2) / (2 * sqWeightSum b n))) := by sorry

end AzumaWeightedSums.IteratedLog
Source
Azuma, Weighted sums of certain dependent random variables, Tôhoku Math. J. 19 (1967), https://doi.org/10.2748/tmj/1178243286, pp. 362–363, proof of Theorem 2 ("using the Tchebycheff inequality and (2.3)")
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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