Fixed-count and Poisson-count mean comparison
ProvedKSATSingleFlip.Connect.poisson_fixed_count_meanIf g is integrable under Poisson(r) and its value changes by at most L between consecutive counts, then |g(j)−E g(N)| ≤ L(|j−r|+√r) for every j. This is the exact comparison used for g(j)=E[F] at fixed clause count in the proof of Lemma 2.6.
Preamble
import Mathlib open MeasureTheory ProbabilityTheory open scoped NNReal set_option autoImplicit false
Formal statement
theorem KSATSingleFlip.Connect.poisson_fixed_count_mean (r : ℝ≥0) (g : ℕ → ℝ) (hg : Integrable g (poissonMeasure r))
(L : ℝ) (hL : 0 ≤ L) (hstep : ∀ j, |g (j+1)-g j| ≤ L) (j : ℕ) :
|g j - ∫ k, g k ∂(poissonMeasure r)| ≤ L*(|(j:ℝ)-(r:ℝ)|+Real.sqrt (r:ℝ)) := by sorrySource
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