Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.1 — actual competing candidate-count comparison

Open
SampleCRS.AlmostGreedy.Supplement.lemma_b_1

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

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

Let k≥1k\ge1k≥1 and p∈[0,1]np\in[0,1]^np∈[0,1]n have total mass kkk. With Appendix B's parameters βk=1−γk/δk\beta_k=1-\gamma_k/\delta_kβk​=1−γk​/δk​, let the independent candidate bits have biases ρj=pj(1−βkpj)\rho_j=p_j(1-\beta_kp_j)ρj​=pj​(1−βk​pj​) and let Gi=∑j≠iZjG_i=\sum_{j\ne i}Z_jGi​=∑j=i​Zj​. Then for every element, including those with pi=0p_i=0pi​=0,

E[AR⁡k(Gi)]≥E[AR⁡k(Poi⁡(k−pi))].E[\operatorname{AR}_k(G_i)]\ge E[\operatorname{AR}_k(\operatorname{Poi}(k-p_i))].E[ARk​(Gi​)]≥E[ARk​(Poi(k−pi​))].

The competitor distribution uses the candidate biases rather than the original activation probabilities. Its mean need not be k−pik-p_ik−pi​. This is the comparison used for Algorithm 6.

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: G_i is a sum of independent candidate bits with biases ρ_j, j≠i → the published activation law at candidateBias followed by otherCount; reason: the omitted coordinate is counted nowhere; the unused independent coordinate averages out, giving exactly the same count law
Preamble
import Mathlib
import Definitions.Def_SampleCRS_AlmostGreedy_Supplement_scaling
Formal statement
namespace SampleCRS.AlmostGreedy.Supplement

/-- Lemma B.1, p.41. actual competing candidate-count comparison. -/
theorem lemma_b_1 {n : ℕ} (k : ℕ) (hk : 1 ≤ k) (p : Fin n → ℝ)
    (hp : ValidProb p) (hmass : (∑ i, p i) = (k : ℝ)) :
    ∀ i : Fin n, StaticProphetSec.poisE (StaticProphetSec.AR k)
      (Real.toNNReal ((k : ℝ) - p i)) ≤ competingAR k p i := by sorry

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

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