Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 4 — if M(t) < ∞ near t = 0 and a > µ = E X, then I(a) > 0

Proved
KleywegtSAA.ExpRate.rateFn_pos

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

large-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rate-function

Let XXX be an integrable real random variable on a probability space with mean μ=EX\mu = \mathbb E Xμ=EX, and suppose its moment generating function M(t)=E etXM(t) = \mathbb E\, e^{tX}M(t)=EetX is finite for all ttt in a neighbourhood of t=0t = 0t=0. Then for every a>μa > \mua>μ,

I(a)=sup⁡t≥0{ta−log⁡M(t)}>0.I(a) = \sup_{t \ge 0}\{ta - \log M(t)\} > 0.I(a)=t≥0sup​{ta−logM(t)}>0.

Combined with (2.4), this gives an exponentially small probability P(ZN≥a)P(Z_N \ge a)P(ZN​≥a) for every level aaa above the mean.

Formalization Note "Finite in a neighbourhood of 000" is that 000 is an interior point of the set of ttt for which etXe^{tX}etX is integrable. Integrability of XXX follows from it and is kept as a separate hypothesis for readability. I(a)I(a)I(a) is an extended real and may be +∞+\infty+∞.

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ExpRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace KleywegtSAA.ExpRate

/-- §2.2, p. 4: if the moment generating function of `Y` is finite in a neighbourhood of `0` and
`a > μ = E Y`, then `I(a) > 0`. -/
theorem rateFn_pos {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (Y : Ω → ℝ) (hY : Integrable Y P) (hA : (0 : ℝ) ∈ interior (integrableExpSet Y P))
    (a : ℝ) (ha : ∫ ω, Y ω ∂P < a) :
    0 < rateFn P Y a := by sorry

end KleywegtSAA.ExpRate
Source
Kleywegt & Shapiro, The sample average approximation method for stochastic discrete optimization, preprint (two-author version, sha256 56657748…), p. 4, first paragraph ("Moreover, suppose ... It follows that in that case I(a) > 0")
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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