Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.9), p. 749 — P(S̃_n ≥ x) ≤ e^{−hx}Ee^{hS̃_n} = e^{−hx}Π Ee^{hX̃_i} for h > 0

Proved
NagaevLD.FukNagaev.eq_1_9

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

chernoff-boundlarge-deviationsmoment-generating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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, and let X~i\tilde X_iX~i​ (equal to XiX_iXi​ if Xi≤yiX_i\le y_iXi​≤yi​, to 000 otherwise) and S~n=∑iX~i\tilde S_n=\sum_i\tilde X_iS~n​=∑i​X~i​ be the truncated summands and their sum. Then for every h>0h>0h>0,

P(S~n≥x)≤e−hx EehS~n=e−hx∏i=1nEehX~i.P(\tilde S_n\ge x)\le e^{-hx}\,\mathbb E e^{h\tilde S_n}=e^{-hx}\prod_{i=1}^n\mathbb E e^{h\tilde X_i}.P(S~n​≥x)≤e−hxEehS~n​=e−hxi=1∏n​EehX~i​.

The first inequality is the exponential Chebyshev (Chernoff) bound; the equality uses the independence of the truncated summands. All exponential moments are finite because X~i≤yi\tilde X_i\le y_iX~i​≤yi​.

Formalization Note The two parts are stated as a conjunction. No integrability hypothesis is needed: ehX~i≤ehyie^{h\tilde X_i}\le e^{hy_i}ehX~i​≤ehyi​.

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

open MeasureTheory ProbabilityTheory

theorem eq_1_9 {Ω : 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)
    (h : ℝ) (hh : 0 < h) :
    P.real {ω | x ≤ St X yv ω} ≤ Real.exp (-h * x) * ∫ ω, Real.exp (h * St X yv ω) ∂P ∧
      Real.exp (-h * x) * ∫ ω, Real.exp (h * St X yv ω) ∂P =
        Real.exp (-h * x) * ∏ i, ∫ ω, Real.exp (h * Xt X yv i ω) ∂P := 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.9)
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