Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, p. 759 — P(max_{i≠j}X_i ≥ x) ≤ B_n²/x² for centred summands

Proved
NagaevLD.LowerBound.chebyshev_max

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

chebyshev-inequalitylarge-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent real random variables on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) with EXi=0EX_i=0EXi​=0 and EXi2<∞EX_i^2<\inftyEXi2​<∞ for every iii, and put Bn2=∑i=1nVar⁡XiB_n^2=\sum_{i=1}^n\operatorname{Var}X_iBn2​=∑i=1n​VarXi​. Then for every x>0x>0x>0 and every index jjj

P(max⁡i≠jXi≥x) ≤ Bn2x2.P\Big(\max_{i\ne j}X_i\ge x\Big)\ \le\ \frac{B_n^2}{x^2}.P(i=jmax​Xi​≥x) ≤ x2Bn2​​.

Each centred summand reaches xxx with probability at most σi2/x2\sigma_i^2/x^2σi2​/x2, and the union over i≠ji\ne ji=j costs at most the sum. Together with the previous bound this shows that, for x≥2Bnx\ge 2B_nx≥2Bn​, the probability P(Snj≥−x,max⁡i≠jXi<x)P(S_n^j\ge-x,\max_{i\ne j}X_i<x)P(Snj​≥−x,maxi=j​Xi​<x) is at least 1/21/21/2.

Formalization Note The page states P(max⁡i≠jXi>x)≤Bn2/x2P(\max_{i\ne j}X_i>x)\le B_n^2/x^2P(maxi=j​Xi​>x)≤Bn2​/x2; the statement here, with ≥x\ge x≥x, is stronger, follows from the same Chebyshev step, and is the form that the preceding inequality ("It is clear that") requires once max⁡i≠jXi<x\max_{i\ne j}X_i<xmaxi=j​Xi​<x is used as in (1.57). The event is written "there is i≠ji\ne ji=j with Xi≥xX_i\ge xXi​≥x". Square integrability of each XiX_iXi​ stands for the page's Bn2<∞B_n^2<\inftyBn2​<∞. Independence is the paper's standing assumption and is not needed for this bound.

Preamble
import Mathlib
import Definitions.Def_NagaevLD_LowerBound_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound

/-- §1, p. 759: `P(max_{i≠j} X_i ≥ x) ≤ B_n²/x²` (the page prints `> x`; `≥ x` is stronger and is
what the chain needs). -/
theorem chebyshev_max {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
    (hindep : iIndepFun (fun i => X i) P)
    (hL2 : ∀ i, MemLp (X i) 2 P) (hmean : ∀ i, ∫ ω, X i ω ∂P = 0)
    (x : ℝ) (hx : 0 < x) (j : Fin n) :
    P.real {ω | ∃ i, i ≠ j ∧ x ≤ X i ω} ≤ NagaevLD.FukNagaev.Bn2 P X / x ^ 2 := by sorry

end NagaevLD.LowerBound
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 759, §1, "P(max_{i≠j}X_i > x) ≤ B_n²/x²"
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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