Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.4 (1.11), p. 749 — log Ee^{hX} ≤ hμ + e^tβh²/2 + α_t(e^{hb} − 1 − hb)/b^t for h > t/b

Proved
NagaevLD.FukNagaev.lemma_1_4_b

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

cumulant-generating-functionlarge-deviationsmoment-generating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a random variable with P(X>b)=0P(X>b)=0P(X>b)=0 for some b>0b>0b>0, finite second moment, μ=EX\mu=\mathbb EXμ=EX, β=EX2\beta=\mathbb EX^2β=EX2, and αt=∫u≥0ut dF(u)=E[Xt;X≥0]\alpha_t=\int_{u\ge0}u^t\,dF(u)=\mathbb E[X^t;X\ge0]αt​=∫u≥0​utdF(u)=E[Xt;X≥0], where F(u)=P(X<u)F(u)=P(X<u)F(u)=P(X<u) and t≥2t\ge2t≥2. Then for h>t/bh>t/bh>t/b,

log⁡EehX≤hμ+etβh22+αt (ehb−1−hb)bt.\log\mathbb Ee^{hX}\le h\mu+\frac{e^t\beta h^2}{2}+\frac{\alpha_t\,(e^{hb}-1-hb)}{b^t}.logEehX≤hμ+2etβh2​+btαt​(ehb−1−hb)​.

This is the second half of Lemma 1.4; the extra term controls the contribution of large positive values of XXX, which is where the polynomial part of the Fuk–Nagaev bound comes from.

Formalization Note β\betaβ is EX2\mathbb EX^2EX2, not 1−α1-\alpha1−α. X∈L2X\in L^2X∈L2 is assumed, as for (1.10). utu^tut is a real power.

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

open MeasureTheory ProbabilityTheory

theorem lemma_1_4_b {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (X : Ω → ℝ) (hX : Measurable X) (b : ℝ) (hb : 0 < b) (hXb : P {ω | b < X ω} = 0)
    (t : ℝ) (ht : 2 ≤ t)
    (hL2 : MemLp X 2 P) (h : ℝ) (hht : t / b < h) :
    Real.log (∫ ω, Real.exp (h * X ω) ∂P) ≤
      h * (∫ ω, X ω ∂P) + Real.exp t * (∫ ω, X ω ^ 2 ∂P) * h ^ 2 / 2 +
        (∫ ω in {ω | 0 ≤ X ω}, X ω ^ t ∂P) * (Real.exp (h * b) - 1 - h * b) / b ^ t := by sorry

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