Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.6 Poisson bound from fixed-count fiber estimates

Proved
KSATSingleFlip.Connect.lemma_2_6_poisson_from_fibers

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

Suppose the count is Poisson with positive mean νn, g(j) is an integrable sequence of fixed-count means with adjacent differences bounded by L, the zero-count outcome equals g(0), and on each positive-count fiber the stated fixed-count lower-tail bound holds. If √(νn) ≤ an/(4L), then the lower tail below the Poisson mixture mean by an is at most 3 exp(−a²n/(128(ν+1)L²)). The fixed-count fiber hypothesis and identification of the mixture mean with the observable expectation remain to be established for the marked-clause model.

Preamble
import Mathlib
open MeasureTheory ProbabilityTheory Set
open scoped NNReal ENNReal
set_option autoImplicit false
Formal statement
theorem KSATSingleFlip.Connect.lemma_2_6_poisson_from_fibers {Ω : Type} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (N : Ω → ℕ) (hN : Measurable N) (F : Ω → ℝ) (hF : Measurable F)
    (r : ℝ≥0) (hr : 0 < r) (hNlaw : Measure.map N μ = poissonMeasure r)
    (ν a L n : ℝ) (hν : 0 ≤ ν) (ha : 0 < a) (ha1 : a ≤ 1)
    (hL : 1 ≤ L) (hn : 0 < n) (hrν : (r:ℝ) = ν*n)
    (hsqrt : Real.sqrt (ν*n) ≤ a*n/(4*L))
    (g : ℕ → ℝ) (hg : Integrable g (poissonMeasure r))
    (hstep : ∀ j, |g (j+1)-g j| ≤ L)
    (hzero : ∀ ω, N ω = 0 → F ω = g 0)
    (hfiber : ∀ j : ℕ, 1 ≤ j →
      μ ({ω | N ω = j} ∩ {ω | F ω ≤ g j - a*n/2}) ≤
        μ {ω | N ω = j} * ENNReal.ofReal (Real.exp (-(a*n)^2/(8*(j:ℝ)*L^2)))) :
    μ.real {ω | F ω ≤ (∫ k, g k ∂(poissonMeasure r)) - a*n} ≤
      3 * Real.exp (-(a^2*n)/(128*(ν+1)*L^2)) := 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