Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Poisson tail for a nonnegative self-bounding supremum

Proved
TalagrandCore.poisson_tail

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

Let YYY be a finite supremum process with summands in [0,1][0,1][0,1]. If EY≤m≤s\mathbb EY\le m\le sEY≤m≤s and m>0m>0m>0, then

P{Y≥s}≤exp⁡ ⁣(−slog⁡sm+s−m).\mathbb P\{Y\ge s\}\le \exp\!\left(-s\log\frac{s}{m}+s-m\right).P{Y≥s}≤exp(−slogms​+s−m).

This is the Chernoff consequence of the self-bounding exponential-moment estimate.

Formalization Note Probabilities are represented as expectations of indicator functions.

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_tail (p : NNReal) (hp : p ≤ 1)
    (g : ι → κ → Bool → ℝ) (hg0 : ∀ a x b, 0 ≤ g a x b)
    (hg1 : ∀ a x b, g a x b ≤ 1) {m s : ℝ}
    (hm : Ex (p : ℝ) (fun ω => supProc g ω) ≤ m) (hm0 : 0 < m) (hms : m ≤ s) :
    Ex (p : ℝ) (fun ω => if s ≤ supProc g ω then (1:ℝ) else 0) ≤
      Real.exp (-(s * Real.log (s / m) - s + m)) := 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