Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gaussian-regime cumulant bound for a finite linear supremum

Proved
TalagrandCore.gaussian_upper_cgf

by Harry_Xu · Aug 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let ZZZ be a centered finite Bernoulli linear supremum with coefficient envelope one, variance proxy σ2\sigma^2σ2, random variance process Σ2\Sigma^2Σ2, and absolute supremum Zˉ\bar ZZˉ. For 0≤λ≤1/80\le\lambda\le1/80≤λ≤1/8,

log⁡Eeλ(Z−EZ)≤200λ2(σ2+EΣ2+EZˉ).\log\mathbb E e^{\lambda(Z-\mathbb EZ)} \le 200\lambda^2\left(\sigma^2+\mathbb E\Sigma^2+\mathbb E\bar Z\right).logEeλ(Z−EZ)≤200λ2(σ2+EΣ2+EZˉ).

This is the small-deviation Gaussian part of the upper-tail proof.

Formalization Note All expectations are finite Bernoulli weighted sums.

Preamble
import Definitions.Def_talagrand_finite_bool_core
open MeasureTheory
open scoped Classical BigOperators
Formal statement
namespace TalagrandCore

variable {κ ι : Type} [DecidableEq κ] [Fintype κ]
variable [Fintype ι] [Nonempty ι]

theorem gaussian_upper_cgf (p : NNReal) (hp : p ≤ 1)
    (coeff : ι → κ → ℝ) (hB : ∀ a x, |coeff a x| ≤ 1)
    (sigmaSq : ℝ) (hs : 0 ≤ sigmaSq)
    (hVar : ∀ a : ι, ∑ x : κ, (p : ℝ) * (1 - (p : ℝ)) * coeff a x ^ 2 ≤ sigmaSq)
    (lam : ℝ) (h0 : 0 ≤ lam) (h8 : lam ≤ 1/8) :
    Real.log (Ex (p : ℝ) (fun ω => Real.exp (lam *
        (Zproc coeff (p : ℝ) ω - Ex (p : ℝ) (Zproc coeff (p : ℝ)))))) ≤
      200 * lam ^ 2 *
        (sigmaSq + Ex (p : ℝ) (Sigma2 coeff (p : ℝ)) +
          Ex (p : ℝ) (Zbar coeff (p : ℝ))) := by sorry

end TalagrandCore
Source
Michel Ledoux, On Talagrand’s deviation inequalities for product measures, ESAIM Probability and Statistics 1 (1996), Theorems 2.4–2.5, pp. 63–87. Formal Lean proof extracted from Prove2Me accepted submission bf106d23-ff42-48f5-a837-a8528101c849 by tianyipeng.

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