Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.8), p. 749 — P(S_n ≥ x) ≤ P(S̃_n ≥ x) + Σ P(X_i > y_i)

Proved
NagaevLD.FukNagaev.eq_1_8

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

large-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1truncation

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent random variables, x>0x>0x>0, and y1,…,yn>0y_1,\dots,y_n>0y1​,…,yn​>0. Let X~i=Xi\tilde X_i=X_iX~i​=Xi​ if Xi≤yiX_i\le y_iXi​≤yi​ and X~i=0\tilde X_i=0X~i​=0 otherwise, and S~n=∑iX~i\tilde S_n=\sum_i\tilde X_iS~n​=∑i​X~i​. Then

P(Sn≥x)≤P(S~n≥x)+∑i=1nP(Xi>yi).P(S_n\ge x)\le P(\tilde S_n\ge x)+\sum_{i=1}^nP(X_i>y_i).P(Sn​≥x)≤P(S~n​≥x)+i=1∑n​P(Xi​>yi​).

This is the truncation step of the proof of the Fuk–Nagaev inequality: it reduces the tail of SnS_nSn​ to the tail of a sum of summands bounded above by yiy_iyi​, at the cost of the probabilities that some summand exceeds its level.

Formalization Note Indices run over Fin n. The standing assumptions of the paper (independence, measurability, x>0x>0x>0, yi>0y_i>0yi​>0) are kept as hypotheses although the inequality does not need them.

Preamble
import Mathlib
import Definitions.Def_NagaevLD_FukNagaev_Setting
Formal statement
namespace NagaevLD.FukNagaev

open MeasureTheory ProbabilityTheory

theorem eq_1_8 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {n : ℕ} (X : Fin n → Ω → ℝ) (hmeas : ∀ i, Measurable (X i)) (hindep : iIndepFun X P)
    (x : ℝ) (hx : 0 < x) (yv : Fin n → ℝ) (hyv : ∀ i, 0 < yv i) :
    P.real {ω | x ≤ S n X ω} ≤
      P.real {ω | x ≤ St X yv ω} + ∑ i, P.real {ω | yv i < X i ω} := by sorry

end NagaevLD.FukNagaev
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 749, proof of Theorem 1.3, (1.8)
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