Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.5, p. 768 — Ee^{hX_j} ≤ (b_j(x/n) + b_gj)exp{hx/n − g(x/n)}, h = g′(x/n)

Proved
NagaevLD.GenMoment.per_factor_bound

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

exponential-momentsgeneralized-momentslarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XjX_jXj​ be a real random variable, let g:R→Rg:\mathbb R\to\mathbb Rg:R→R have, on [0,∞)[0,\infty)[0,∞), a positive nondecreasing derivative g′g'g′, and suppose

bgj=E[eg(Xj);Xj≥0]<∞.b_{gj}=E\big[e^{g(X_j)};X_j\ge 0\big]<\infty .bgj​=E[eg(Xj​);Xj​≥0]<∞.

Let n≥1n\ge 1n≥1 be an integer, x>0x>0x>0, h=g′(x/n)h=g'(x/n)h=g′(x/n), and bj(x/n)=eg(0)E[ehXj;Xj<0]b_j(x/n)=e^{g(0)}E\big[e^{hX_j};X_j<0\big]bj​(x/n)=eg(0)E[ehXj​;Xj​<0]. Then

EehXj ≤ (bj(x/n)+bgj)exp⁡{hx/n−g(x/n)}.Ee^{hX_j}\ \le\ \big(b_j(x/n)+b_{gj}\big)\exp\{hx/n-g(x/n)\}.EehXj​ ≤ (bj​(x/n)+bgj​)exp{hx/n−g(x/n)}.

This is the bound on each factor of the product in (2.45); multiplying these bounds over jjj and inserting them in (2.45) with h=g′(x/n)h=g'(x/n)h=g′(x/n) gives Theorem 2.5.

Formalization Note The finiteness of bgjb_{gj}bgj​ is an explicit integrability hypothesis (Lean's integral of a non-integrable function is 000). Under it EehXjEe^{hX_j}EehXj​ is finite. The hypotheses on ggg are imposed on [0,∞)[0,\infty)[0,∞) only, and bgjb_{gj}bgj​ is the integral over u≥0u\ge 0u≥0 (see the definition file). The implicit n≥1n\ge1n≥1 of the paper is explicit in Lean.

Preamble
import Mathlib
import Definitions.Def_NagaevLD_GenMoment_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.GenMoment

/-- Proof of Theorem 2.5, p. 768, after (2.48): for `h = g′(x/n)`,
`E e^{hX_j} ≤ (b_j(x/n) + b_gj) exp{hx/n − g(x/n)}`. -/
theorem per_factor_bound {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (hn : 0 < n) (X : Fin n → Ω → ℝ) (hXm : ∀ j, Measurable (X j))
    (g g' : ℝ → ℝ) (hg : ∀ u : ℝ, 0 ≤ u → HasDerivAt g (g' u) u)
    (hg'pos : ∀ u : ℝ, 0 ≤ u → 0 < g' u) (hg'mono : MonotoneOn g' (Set.Ici 0)) (j : Fin n)
    (hbg : IntegrableOn (fun ω => Real.exp (g (X j ω))) {ω | 0 ≤ X j ω} P)
    (x : ℝ) (hx : 0 < x) (h : ℝ) (hh : h = g' (x / n)) :
    ∫ ω, Real.exp (h * X j ω) ∂P
      ≤ (bj P X g g' j (x / n) + bg P X g j) * Real.exp (h * (x / n) - g (x / n)) := by sorry

end NagaevLD.GenMoment
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 768, proof of Theorem 2.5, after (2.48)
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