Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 751–752 — under (1.6), P(S̃_n ≥ x) < P₄

Proved
NagaevLD.FukNagaev.p4_case

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

fuk-nagaev-inequalitylarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the setting of (1.19), suppose instead that condition (1.6) holds:

max⁡[t, log⁡(βxyt−1A(t;0,Y)+1)]<αxyetB2(−∞,Y).\max\Big[t,\ \log\Big(\frac{\beta xy^{t-1}}{A(t;0,Y)}+1\Big)\Big]<\frac{\alpha xy}{e^tB^2(-\infty,Y)}.max[t, log(A(t;0,Y)βxyt−1​+1)]<etB2(−∞,Y)αxy​.

Then

P(S~n≥x)<P4=exp⁡{βxy−((1−α2)xy−μ(−∞,Y)y)log⁡(βxyt−1A(t;0,Y)+1)}.P(\tilde S_n\ge x)<P_4=\exp\Big\{\beta\frac xy-\Big(\big(1-\tfrac\alpha2\big)\frac xy-\frac{\mu(-\infty,Y)}y\Big)\log\Big(\frac{\beta xy^{t-1}}{A(t;0,Y)}+1\Big)\Big\}.P(S~n​≥x)<P4​=exp{βyx​−((1−2α​)yx​−yμ(−∞,Y)​)log(A(t;0,Y)βxyt−1​+1)}.

This is the polynomial-type bound for the truncated sum; with (1.8) it gives (1.7). The page proves it in the two sub-cases h1>h2>t/yh_1>h_2>t/yh1​>h2​>t/y (taking h=h2h=h_2h=h2​ in (1.18)) and h2≤t/y<h1h_2\le t/y<h_1h2​≤t/y<h1​ (taking h=h2h=h_2h=h2​ in (1.17)).

Formalization Note Condition (1.6) is cond_1_6, which requires A(t;0,Y)>0A(t;0,Y)>0A(t;0,Y)>0, as the page's (1.6) does implicitly (for A=0A=0A=0 its left side is +∞+\infty+∞). Finiteness of B2(−∞,Y)B^2(-\infty,Y)B2(−∞,Y) is assumed summand by summand.

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

open MeasureTheory ProbabilityTheory

theorem p4_case {Ω : 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)
    (α β : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hβ : β = 1 - α)
    (hL2 : ∀ i, IntegrableOn (fun ω => X i ω ^ 2) {ω | X i ω ≤ yv i} P)
    (h16 : cond_1_6 t α β x y (B2Y P X yv) (AY P X yv t)) :
    P.real {ω | x ≤ St X yv ω} < P4 t α β x y (muY P X yv) (AY P X yv t) := by sorry

end NagaevLD.FukNagaev
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), pp. 751–752, proof of Theorem 1.3, case h₁ > max[t/y, h₂]
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