Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity step, p. 767 — g′(x/n)x/n ≥ g(x/n) − g(0), hence e^{hx/n−g(x/n)} ≥ e^{−g(0)} for h = g′(x/n)

Proved
NagaevLD.GenMoment.convexity_step

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

convexitylarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let g:R→Rg:\mathbb R\to\mathbb Rg:R→R have, on [0,∞)[0,\infty)[0,∞), a positive nondecreasing derivative g′g'g′. Let n≥1n\ge 1n≥1 be an integer, x>0x>0x>0, and h=g′(x/n)h=g'(x/n)h=g′(x/n). Then

g′(x/n) xn ≥ g(x/n)−g(0),g'(x/n)\,\frac{x}{n}\ \ge\ g(x/n)-g(0),g′(x/n)nx​ ≥ g(x/n)−g(0),

and consequently

ehx/n−g(x/n) ≥ e−g(0).e^{hx/n-g(x/n)}\ \ge\ e^{-g(0)} .ehx/n−g(x/n) ≥ e−g(0).

The first inequality expresses the convexity of ggg (its graph lies above the tangent line at x/nx/nx/n, evaluated at 000). The second is the form used to prove (2.48), which in turn lets the negative part of EehXjEe^{hX_j}EehXj​ be absorbed into the factor ehx/n−g(x/n)e^{hx/n-g(x/n)}ehx/n−g(x/n).

Formalization Note The paper prints the first inequality with a strict ">>>". It fails when g′g'g′ is constant on [0,x/n][0,x/n][0,x/n] — for example g(u)=Tug(u)=Tug(u)=Tu, a case the paper itself discusses on p. 768 — so the non-strict inequality is stated; the proof of Theorem 2.5 only uses the second inequality, which the paper prints with "≥\ge≥". The hypotheses on ggg are imposed on [0,∞)[0,\infty)[0,∞) only. 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

/-- Convexity step of the proof of Theorem 2.5, p. 767: `g′(x/n)·x/n ≥ g(x/n) − g(0)` and,
for `h = g′(x/n)`, `e^{hx/n − g(x/n)} ≥ e^{−g(0)}`. (The page prints a strict `>` in the first
inequality; it fails when `g′` is constant on `[0, x/n]`, so the non-strict form is stated.) -/
theorem convexity_step (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))
    (n : ℕ) (hn : 0 < n) (x : ℝ) (hx : 0 < x) (h : ℝ) (hh : h = g' (x / n)) :
    g (x / n) - g 0 ≤ g' (x / n) * (x / n) ∧
      Real.exp (-g 0) ≤ 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. 767, proof of Theorem 2.5, between (2.47) and (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