Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.12), p. 11 — |Λ′(t) − Λ′(s)| ≤ κ²|t − s|

Proved
SAARate.SharpLD.display_3_12

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

large-deviationsmoment-generating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let XXX be a real random variable on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) with ∣X∣≤κ|X|\le\kappa∣X∣≤κ almost surely, and let Λ(t)=log⁡E[etX]\Lambda(t)=\log\mathbb E[e^{tX}]Λ(t)=logE[etX]. Then for all t,s∈Rt,s\in\mathbb Rt,s∈R

∣Λ′(t)−Λ′(s)∣≤κ2∣t−s∣.|\Lambda'(t)-\Lambda'(s)|\le\kappa^2|t-s| .∣Λ′(t)−Λ′(s)∣≤κ2∣t−s∣.

The derivative of the cumulant generating function of a variable bounded by κ\kappaκ is Lipschitz with constant κ2\kappa^2κ2. By convex duality this is equivalent to strong convexity of the conjugate Λ∗\Lambda^*Λ∗ with modulus 1/κ21/\kappa^21/κ2, used for (3.13).

Formalization Note Λ\LambdaΛ is Mathlib's cgf, Λ′\Lambda'Λ′ is deriv; the statement is made for an arbitrary bounded measurable XXX.

Preamble
import Mathlib

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SAARate.SharpLD

theorem display_3_12 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (X : Ω → ℝ) (hX : Measurable X) (κ : ℝ)
    (hXκ : ∀ᵐ ω ∂P, |X ω| ≤ κ) :
    ∀ t s : ℝ, |deriv (cgf X P) t - deriv (cgf X P) s| ≤ κ ^ 2 * |t - s| := by sorry

end SAARate.SharpLD
Source
Shapiro & Homem-de-Mello, On Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs, preprint (SPEPS copy, edoc.hu-berlin.de), p. 11, proof of Theorem 3.1, (3.12)
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