Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, (2.4), p. 3 — (1/N) log P(Z_N ≥ a) ≤ −I(a)

Proved
KleywegtSAA.ExpRate.ld_upper_bound

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

cramer-chernofflarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,X2,…X_1, X_2, \dotsX1​,X2​,… be independent, identically distributed real random variables on a probability space (Ω,P)(\Omega, P)(Ω,P), distributed as XXX, and let ZN=N−1∑i=1NXiZ_N = N^{-1}\sum_{i=1}^N X_iZN​=N−1∑i=1N​Xi​. Let Λ(t)=log⁡E etX∈(−∞,+∞]\Lambda(t) = \log \mathbb E\, e^{tX} \in (-\infty, +\infty]Λ(t)=logEetX∈(−∞,+∞] and I(z)=sup⁡t≥0{tz−Λ(t)}I(z) = \sup_{t \ge 0}\{tz - \Lambda(t)\}I(z)=supt≥0​{tz−Λ(t)}. Then for every N≥1N \ge 1N≥1 and every real aaa,

1Nlog⁡P(ZN≥a)≤−I(a),\frac1N \log P(Z_N \ge a) \le -I(a),N1​logP(ZN​≥a)≤−I(a),

with the convention log⁡0=−∞\log 0 = -\inftylog0=−∞.

This is the upper bound of Cramér's large-deviations theorem in non-asymptotic form; it holds without any moment assumption on XXX.

Formalization Note The inequality is in the extended reals: log⁡\loglog of a probability is ENNReal.log, with log⁡0=−∞\log 0 = -\inftylog0=−∞, and I(a)I(a)I(a) may be +∞+\infty+∞ (then −I(a)=−∞-I(a) = -\infty−I(a)=−∞ and the claim is P(ZN≥a)=0P(Z_N \ge a) = 0P(ZN​≥a)=0). The sequence is 000-indexed: XiX_iXi​ is the (i−1)(i-1)(i−1)-st term and XXX is the first term.

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ExpRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace KleywegtSAA.ExpRate

/-- The large-deviations upper bound (2.4), p. 3: for an i.i.d. real sequence with sample average
`Z_N`, every `N ≥ 1` and every real `a`, `(1/N) log P(Z_N ≥ a) ≤ −I(a)`, with `log 0 = −∞`. -/
theorem ld_upper_bound {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (Y : ℕ → Ω → ℝ) (hYm : ∀ i, Measurable (Y i)) (hind : iIndepFun Y P)
    (hid : ∀ i, IdentDistrib (Y i) (Y 0) P P) :
    ∀ N : ℕ, 1 ≤ N → ∀ a : ℝ,
      ((1 / (N : ℝ) : ℝ) : EReal) * ENNReal.log (P {ω | a ≤ sampleMean Y N ω}) ≤
        - rateFn P (Y 0) 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. 3, (2.4) and the definition of I(z) below it
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