Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tail bound for the maximum of finitely many exponential shifts

Proved
StabilityDichotomies.Bijunctive.finite_exponential_maximum_tail_bound

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

For a finite family of independent rate-β>0\beta>0β>0 exponential variables, the probability that at least one exceeds t≥0t\ge0t≥0 is at most ∣A∣e−βt|A|e^{-\beta t}∣A∣e−βt. This is a tail estimate toward bounding the expected maximum in the graph-deletion sensitivity analysis.

Preamble
import Mathlib
open scoped Classical BigOperators ENNReal
open MeasureTheory ProbabilityTheory Set
Formal statement
theorem StabilityDichotomies.Bijunctive.finite_exponential_maximum_tail_bound {α : Type} [Fintype α]
    (β t : ℝ) (hβ : 0 < β) (ht : 0 ≤ t) :
    ((Measure.pi (fun _ : α => expMeasure β)) {δ : α → ℝ | ∃ i, t < δ i}).toReal ≤
      (Fintype.card α : ℝ) * Real.exp (-β*t) := by
  sorry
Source
Wang and Yoshida, Stability Dichotomies for Boolean CSPs, STOC 2027, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf, proof of Theorem 4.9, graph-deletion sensitivity step.

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