Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Poissonian upper tail for a finite Bernoulli linear supremum

Proved
TalagrandCore.poisson_upper_tail

by Harry_Xu · Aug 13, 2026 · Mathlib c5ea003 (Lean v4.30.0)

concentration-inequalitiesempirical-processesprobabilitytalagrand

Let ZZZ be a finite centered Bernoulli linear supremum with coefficient envelope one. Put w=σ2+EΣ2+EZˉ>0w=\sigma^2+\mathbb E\Sigma^2+\mathbb E\bar Z>0w=σ2+EΣ2+EZˉ>0. For every u≥0u\ge0u≥0,

P{Z≥EZ+u}≤3exp⁡ ⁣(−u3200log⁡(1+uw)).\mathbb P\{Z\ge\mathbb EZ+u\} \le 3\exp\!\left(-\frac{u}{3200}\log\left(1+\frac{u}{w}\right)\right).P{Z≥EZ+u}≤3exp(−3200u​log(1+wu​)).

This is the full upper-tail estimate obtained by combining the Gaussian regime with Ledoux’s truncation argument.

Formalization Note The numerical constant is the explicit constant in the accepted finite-Boolean proof.

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 poisson_upper_tail (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)
    {u : ℝ} (hu : 0 ≤ u)
    (hw4 : 0 < sigmaSq + Ex (p : ℝ) (Sigma2 coeff (p : ℝ)) +
      Ex (p : ℝ) (Zbar coeff (p : ℝ))) :
    Ex (p : ℝ) (fun ω => if Ex (p : ℝ) (Zproc coeff (p : ℝ)) + u ≤
        Zproc coeff (p : ℝ) ω then (1:ℝ) else 0) ≤
      3 * Real.exp (-((u / 3200) *
        Real.log (1 + u / (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 contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me