Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.4 (1.10), p. 749 — log Ee^{hX} ≤ hμ + e^tβh²/2 for X ≤ b a.s. and 0 < h ≤ t/b

Proved
NagaevLD.FukNagaev.lemma_1_4_a

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 and β=EX2\beta=\mathbb EX^2β=EX2, and let t≥2t\ge2t≥2. Then for 0<h≤t/b0<h\le t/b0<h≤t/b,

log⁡EehX≤hμ+etβh22.\log\mathbb Ee^{hX}\le h\mu+\frac{e^t\beta h^2}{2}.logEehX≤hμ+2etβh2​.

This is the first half of Lemma 1.4, the cumulant bound applied to each truncated summand in the proof of the Fuk–Nagaev inequality.

Formalization Note Here β\betaβ is the second moment EX2\mathbb EX^2EX2 of the lemma, not the β=1−α\beta=1-\alphaβ=1−α of Theorem 1.3. The page writes β=EX2\beta=\mathbb EX^2β=EX2 as a number, so X∈L2X\in L^2X∈L2 is assumed (without it Lean's integral would return 000). The exponent ttt is that of the section, "the case t≥2t\ge2t≥2" (p. 748); the lemma uses only t≥0t\ge0t≥0.

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

open MeasureTheory ProbabilityTheory

theorem lemma_1_4_a {Ω : 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 : ℝ) (hh : 0 < h) (hht : h ≤ t / b) :
    Real.log (∫ ω, Real.exp (h * X ω) ∂P) ≤
      h * (∫ ω, X ω ∂P) + Real.exp t * (∫ ω, X ω ^ 2 ∂P) * h ^ 2 / 2 := 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.10)
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