Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two-sided Poisson tail for the clause-count concentration proof

Proved
KSATSingleFlip.Connect.poisson_two_sided_tail

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

For N with Poisson mean r > 0 and x > 0, the probability that |N−r| is at least x is at most 2 exp(−x²/(8(r+x))). This deliberately relaxed bound covers deviations smaller or larger than the mean and is sufficient for the Poisson-count part of Lemma 2.6.

Preamble
import Mathlib
open MeasureTheory ProbabilityTheory
open scoped NNReal
set_option autoImplicit false
Formal statement
theorem KSATSingleFlip.Connect.poisson_two_sided_tail (r : ℝ≥0) (hr : 0 < r) (x : ℝ) (hx : 0 < x) :
    (poissonMeasure r).real {k : ℕ | x ≤ |(k:ℝ)-(r:ℝ)|} ≤
      2*Real.exp (-(x^2)/(8*((r:ℝ)+x))) := by sorry
Source
Wang–Yin–Yu–Zhang, Single-Variable Connectivity in Random k-SAT, Lemma 2.6, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/737.pdf

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