Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem B.1 — Poisson comparison for all convex and concave tests

Open
SampleCRS.AlmostGreedy.Supplement.theorem_b_1

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

contention-resolutionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let p1,…,pn∈[0,1]p_1,\ldots,p_n\in[0,1]p1​,…,pn​∈[0,1], λ=∑ipi\lambda=\sum_i p_iλ=∑i​pi​, X∼Poi⁡(λ)X\sim\operatorname{Poi}(\lambda)X∼Poi(λ) and Y∼PB⁡(p1,…,pn)Y\sim\operatorname{PB}(p_1,\ldots,p_n)Y∼PB(p1​,…,pn​). For every discrete convex function f:N→Rf:\mathbb N\to\mathbb Rf:N→R,

E[f(X)]≥E[f(Y)],E[f(X)]\ge E[f(Y)],E[f(X)]≥E[f(Y)],

and for every discrete concave fff the inequality is reversed. No integer-mean or positive-mean assumption is made. The finite Poisson-binomial expectation is real; the Poisson expectation may be +∞+\infty+∞ for a convex test or −∞-\infty−∞ for a concave test. Both clauses allow arbitrary growth of fff.

The paper proves this comparison on pp.39–40 despite its attribution to Hoeffding.

Differences from the source:

  • encoding: elements 1,…,n and independent Bernoulli trials → Fin n and finite product-weight expectations; reason: the label shift is a bijection and the weights are exactly the independent Bernoulli law
  • encoding: expectations of arbitrary discrete convex or concave tests → signed extended expectations in EReal and a finite real Poisson-binomial expectation; reason: finite-mean convex tests have an affine lower bound and concave tests an affine upper bound; this preserves infinite expectations without a default-zero integral
Preamble
import Mathlib
import Definitions.Def_SampleCRS_AlmostGreedy_Supplement_onlineKernel
import Definitions.Def_SampleCRS_AlmostGreedy_Supplement_discreteOrder
import Definitions.Def_StaticProphetSec_pbE
Formal statement
namespace SampleCRS.AlmostGreedy.Supplement

/-- Theorem B.1, p.37. Poisson comparison for all convex and concave tests. -/
theorem theorem_b_1 {n : ℕ} (p : Fin n → ℝ) (hp : ValidProb p) (f : ℕ → ℝ) :
    (DiscreteConvex f →
      (StaticProphetSec.pbE f p : EReal) ≤
        extendedE (ProbabilityTheory.poissonMeasure (Real.toNNReal (∑ i, p i))) f) ∧
    (DiscreteConcave f →
      extendedE (ProbabilityTheory.poissonMeasure (Real.toNNReal (∑ i, p i))) f ≤
        (StaticProphetSec.pbE f p : EReal)) := by sorry

end SampleCRS.AlmostGreedy.Supplement
Source
Shaddin Dughmi, Vasilis Livanos, Pranav Nuti, STOC 2027 submission #686 (October 2026), Theorem B.1, p. 37

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