Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.17), p. 750 — P(S̃_n ≥ x) ≤ exp{h(μ(−∞, Y) − x) + ½e^tB²(−∞, Y)h²} for 0 < h ≤ t/y

Proved
NagaevLD.FukNagaev.eq_1_17

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

fuk-nagaev-inequalitylarge-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, y1,…,yn>0y_1,\dots,y_n>0y1​,…,yn​>0, y≥max⁡iyiy\ge\max_iy_iy≥maxi​yi​, t≥2t\ge2t≥2, and suppose B2(−∞,Y)=∑i∫u≤yiu2 dFi(u)<∞B^2(-\infty,Y)=\sum_i\int_{u\le y_i}u^2\,dF_i(u)<\inftyB2(−∞,Y)=∑i​∫u≤yi​​u2dFi​(u)<∞. With S~n\tilde S_nS~n​ the sum of the truncated summands and μ(−∞,Y)=∑i∫u≤yiu dFi(u)\mu(-\infty,Y)=\sum_i\int_{u\le y_i}u\,dF_i(u)μ(−∞,Y)=∑i​∫u≤yi​​udFi​(u), for 0<h≤t/y0<h\le t/y0<h≤t/y,

P(S~n≥x)≤exp⁡{h(μ(−∞,Y)−x)+12etB2(−∞,Y)h2}.P(\tilde S_n\ge x)\le\exp\Big\{h\big(\mu(-\infty,Y)-x\big)+\tfrac12e^tB^2(-\infty,Y)h^2\Big\}.P(S~n​≥x)≤exp{h(μ(−∞,Y)−x)+21​etB2(−∞,Y)h2}.

It is (1.9) combined with Lemma 1.4 (1.10) applied to every factor EehX~i\mathbb Ee^{h\tilde X_i}EehX~i​. Choosing hhh in it gives the Gaussian-type bounds P6P_6P6​ and P5P_5P5​.

Formalization Note The finiteness of B2(−∞,Y)B^2(-\infty,Y)B2(−∞,Y) is assumed as integrability of Xi2X_i^2Xi2​ on {Xi≤yi}\{X_i\le y_i\}{Xi​≤yi​} for every iii; on the page an infinite B2(−∞,Y)B^2(-\infty,Y)B2(−∞,Y) makes the bound trivial, while Lean would replace it by 000. The bound y>0y>0y>0 is stated explicitly; it follows from y≥yi>0y\ge y_i>0y≥yi​>0 whenever n≥1n\ge1n≥1.

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

open MeasureTheory ProbabilityTheory

theorem eq_1_17 {Ω : 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)
    (y : ℝ) (hy0 : 0 < y) (hyy : ∀ i, yv i ≤ y)
    (t : ℝ) (ht : 2 ≤ t)
    (hL2 : ∀ i, IntegrableOn (fun ω => X i ω ^ 2) {ω | X i ω ≤ yv i} P)
    (h : ℝ) (hh : 0 < h) (hht : h ≤ t / y) :
    P.real {ω | x ≤ St X yv ω} ≤
      Real.exp (h * (muY P X yv - x) + 1 / 2 * Real.exp t * B2Y P X yv * h ^ 2) := by sorry

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