Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6 — inverse binomial moments: E[(1+Y)−1]=1−(1−a)mma\mathbb E[(1+Y)^{-1}]=\frac{1-(1-a)^m}{ma}E[(1+Y)−1]=ma1−(1−a)m​ and E[(1+Y)−β(1+Z)−γ]≤(ma)−β(mb)−γ\mathbb E[(1+Y)^{-\beta}(1+Z)^{-\gamma}]\le(ma)^{-\beta}(mb)^{-\gamma}E[(1+Y)−β(1+Z)−γ]≤(ma)−β(mb)−γ for any coupling

Open
QMomentMatch.FirstBound.Supplement.lemma_3_6

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

binomial-distributionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let m≥1m\ge1m≥1 be an integer, let a,b∈(0,1]a,b\in(0,1]a,b∈(0,1], and let Y,ZY,ZY,Z be random variables (on a common probability space, not necessarily independent) with marginal laws Y∼Bin(m−1,a)Y\sim\mathrm{Bin}(m-1,a)Y∼Bin(m−1,a) and Z∼Bin(m−1,b)Z\sim\mathrm{Bin}(m-1,b)Z∼Bin(m−1,b). Then

E[(1+Y)−1]=1−(1−a)mma≤1ma,\mathbb E\big[(1+Y)^{-1}\big]=\frac{1-(1-a)^m}{ma}\le\frac1{ma},E[(1+Y)−1]=ma1−(1−a)m​≤ma1​,

and for all real β,γ≥0\beta,\gamma\ge0β,γ≥0 with β+γ≤1\beta+\gamma\le1β+γ≤1,

E[(1+Y)−β(1+Z)−γ]≤(ma)−β(mb)−γ.\mathbb E\big[(1+Y)^{-\beta}(1+Z)^{-\gamma}\big]\le(ma)^{-\beta}(mb)^{-\gamma}.E[(1+Y)−β(1+Z)−γ]≤(ma)−β(mb)−γ.

In the proof of Lemma 4.1 this averages the inverse block-count factors of Lemma 4.9 over the random multiplicities, where the counts of different values are dependent.

Formalization Note The pair (Y,Z)(Y,Z)(Y,Z) is given by its joint law μ\muμ on {0,…,m−1}2\{0,\dots,m-1\}^2{0,…,m−1}2, an arbitrary probability vector whose two marginals are the binomial laws; every coupling of YYY and ZZZ has such a joint law, and the expectations depend only on it.

Differences from the source:

  • encoding: random variables Y, Z with marginals Bin(m−1, a), Bin(m−1, b), not necessarily independent → an arbitrary probability vector μ on Fin m × Fin m whose marginals are binomPmf (m−1) a and binomPmf (m−1) b; reason: both expectations depend only on the joint law, which is supported on {0,…,m−1}²
Preamble
import Mathlib
import Definitions.Def_QMomentMatch_FirstBound_Basic
import Definitions.Def_QMomentMatch_FirstBound_Supplement_NewtonCoeff
Formal statement
namespace QMomentMatch.FirstBound.Supplement

open QMomentMatch.FirstBound

/-- Lemma 3.6 (Inverse binomial moments), pp. 17–18. The pair `(Y, Z)` is given by its joint
law `μ` on `{0, …, m−1}²` (any coupling), whose marginals are `Bin(m − 1, a)` and
`Bin(m − 1, b)`. -/
theorem lemma_3_6 (m : ℕ) (hm : 1 ≤ m) (a b : ℝ) (ha : 0 < a) (ha1 : a ≤ 1)
    (hb : 0 < b) (hb1 : b ≤ 1) (μ : Fin m × Fin m → ℝ) (hμ : IsProbVec μ)
    (hY : ∀ y : Fin m, ∑ z : Fin m, μ (y, z) = binomPmf (m - 1) a y)
    (hZ : ∀ z : Fin m, ∑ y : Fin m, μ (y, z) = binomPmf (m - 1) b z) :
    ∑ p : Fin m × Fin m, μ p * (1 + ((p.1 : ℕ) : ℝ))⁻¹ = (1 - (1 - a) ^ m) / ((m : ℝ) * a) ∧
    (1 - (1 - a) ^ m) / ((m : ℝ) * a) ≤ 1 / ((m : ℝ) * a) ∧
    ∀ β γ : ℝ, 0 ≤ β → 0 ≤ γ → β + γ ≤ 1 →
      ∑ p : Fin m × Fin m, μ p * ((1 + ((p.1 : ℕ) : ℝ)) ^ (-β) * (1 + ((p.2 : ℕ) : ℝ)) ^ (-γ)) ≤
        ((m : ℝ) * a) ^ (-β) * ((m : ℝ) * b) ^ (-γ) := by sorry

end QMomentMatch.FirstBound.Supplement
Source
Chandrima Kayal, Frédéric Magniez, Sayantan Sen, Dániel Szabó, STOC 2027 submission #564 (October 2026), Lemma 3.6, pp. 17–18

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