Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, p. 759, after (1.58) — for EX_i = 0, B_n² < ∞ and x ≥ 2B_n, P(S_n ≥ x) ≥ ½ΣP(X_j ≥ 2x)

Proved
NagaevLD.LowerBound.lower_bound

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

large-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sums-of-independent-random-variables

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=0(i=1,…,n),Bn2=∑i=1nVar⁡Xi<∞,EX_i=0\quad(i=1,\dots,n),\qquad B_n^2=\sum_{i=1}^n\operatorname{Var}X_i<\infty ,EXi​=0(i=1,…,n),Bn2​=i=1∑n​VarXi​<∞,

and let Sn=X1+⋯+XnS_n=X_1+\dots+X_nSn​=X1​+⋯+Xn​ and Bn=(Bn2)1/2B_n=(B_n^2)^{1/2}Bn​=(Bn2​)1/2. Then for every x≥2Bnx\ge 2B_nx≥2Bn​ with x>0x>0x>0,

P(Sn≥x) ≥ 12∑j=1nP(Xj≥2x).P(S_n\ge x)\ \ge\ \frac12\sum_{j=1}^n P(X_j\ge 2x).P(Sn​≥x) ≥ 21​j=1∑n​P(Xj​≥2x).

This is the lower bound that closes §1 of Nagaev's survey. It holds without assuming that the summands are identically distributed or that their tails are regularly varying, and it complements the paper's upper bounds of Fuk–Nagaev type, which have the form P(Sn≥x)≤∑jP(Xj>yj)+…P(S_n\ge x)\le\sum_jP(X_j>y_j)+\dotsP(Sn​≥x)≤∑j​P(Xj​>yj​)+…: in the range x≥2Bnx\ge 2B_nx≥2Bn​ the probability of a large deviation of the sum is, up to the factor 12\tfrac1221​ and the change from xxx to 2x2x2x, at least the probability that one summand alone is large.

Formalization Note The page's hypothesis Bn2<∞B_n^2<\inftyBn2​<∞ is stated as "each XiX_iXi​ is square integrable" (Lean's MemLp (X i) 2 P), since Mathlib's variance of a non-square-integrable variable is 000. The level xxx is positive, as everywhere in the paper (p. 747). The summands are indexed by Fin n.

Preamble
import Mathlib
import Definitions.Def_NagaevLD_LowerBound_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound

/-- §1, p. 759, after (1.58): for `EX_i = 0`, `B_n² < ∞` and `x ≥ 2B_n`,
`P(S_n ≥ x) ≥ ½ Σ_j P(X_j ≥ 2x)`. -/
theorem lower_bound {Ω : 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) (hxB : 2 * Real.sqrt (NagaevLD.FukNagaev.Bn2 P X) ≤ x) :
    (1 / 2) * ∑ j, P.real {ω | 2 * x ≤ X j ω} ≤ P.real {ω | x ≤ NagaevLD.FukNagaev.S n X ω} := by sorry

end NagaevLD.LowerBound
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), pp. 758–759, §1, the lower bound after (1.58)
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