Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.57), p. 758 — P(S_n ≥ x) ≥ Σ_j P(S_n ≥ x, X_j ≥ x, max_{i≠j}X_i < x) = Σ_j P_j

Proved
NagaevLD.LowerBound.eq_1_57

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

large-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be real random variables on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), let Sn=X1+⋯+XnS_n=X_1+\dots+X_nSn​=X1​+⋯+Xn​, and for a real number xxx and an index jjj put

Pj=P(Sn≥x, Xj≥x, max⁡i≠jXi<x).P_j=P\Big(S_n\ge x,\ X_j\ge x,\ \max_{i\ne j}X_i<x\Big).Pj​=P(Sn​≥x, Xj​≥x, i=jmax​Xi​<x).

Then

P(Sn≥x) ≥ ∑j=1nPj.P(S_n\ge x)\ \ge\ \sum_{j=1}^n P_j .P(Sn​≥x) ≥ j=1∑n​Pj​.

This is the first step of Nagaev's lower bound for large deviations: the event {Sn≥x}\{S_n\ge x\}{Sn​≥x} contains the disjoint events on which exactly one summand reaches the level xxx, so its probability dominates the sum of their probabilities. No independence, moment condition or sign condition on xxx is needed.

Formalization Note The variables are only assumed measurable (the standing independence of the paper is not used here). The condition max⁡i≠jXi<x\max_{i\ne j}X_i<xmaxi=j​Xi​<x is written "Xi<xX_i<xXi​<x for every i≠ji\ne ji=j".

Preamble
import Mathlib
import Definitions.Def_NagaevLD_LowerBound_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound

/-- (1.57), p. 758: `P(S_n ≥ x) ≥ Σ_j P(S_n ≥ x, X_j ≥ x, max_{i≠j} X_i < x) = Σ_j P_j`. -/
theorem eq_1_57 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (x : ℝ) :
    ∑ j, Pj P 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), p. 758, (1.57)
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