Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2 — interpolating distribution ω\omegaω with the same r−1r-1r−1 moments, ω≥32−Aδ\omega\ge32^{-A}\deltaω≥32−Aδ and ∥ω−πb∥1≤δ\|\omega-\pi_b\|_1\le\delta∥ω−πb​∥1​≤δ

Open
QMomentMatch.FirstBound.Supplement.lemma_4_2

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

moment-matchingp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let 2≤r≤A2\le r\le A2≤r≤A be integers and let π0≠π1\pi_0\ne\pi_1π0​=π1​ be probability distributions on {0}∪[A]={0,1,…,A}\{0\}\cup[A]=\{0,1,\dots,A\}{0}∪[A]={0,1,…,A} with matching moments through order r−1r-1r−1:

∑s=0Aπ0(s)sk=∑s=0Aπ1(s)sk(k=1,…,r−1).\sum_{s=0}^A\pi_0(s)s^k=\sum_{s=0}^A\pi_1(s)s^k\qquad(k=1,\dots,r-1).s=0∑A​π0​(s)sk=s=0∑A​π1​(s)sk(k=1,…,r−1).

Let δ=∥π1−π0∥1=∑s∣π1(s)−π0(s)∣\delta=\|\pi_1-\pi_0\|_1=\sum_s|\pi_1(s)-\pi_0(s)|δ=∥π1​−π0​∥1​=∑s​∣π1​(s)−π0​(s)∣. Then there is a probability distribution ω\omegaω on {0}∪[A]\{0\}\cup[A]{0}∪[A] with the same moments of orders 1,…,r−11,\dots,r-11,…,r−1 such that

ω(s)≥32−Aδ(s∈{0}∪[A]),∥ω−πb∥1≤δ(b=0,1).\omega(s)\ge32^{-A}\delta\quad(s\in\{0\}\cup[A]),\qquad\|\omega-\pi_b\|_1\le\delta\quad(b=0,1).ω(s)≥32−Aδ(s∈{0}∪[A]),∥ω−πb​∥1​≤δ(b=0,1).

In the proof of Theorem 2.6, ω\omegaω is the common endpoint of two linear paths from π0\pi_0π0​ and π1\pi_1π1​ along which every distribution has all its masses bounded below, as Lemma 4.1 requires.

Differences from the source:

  • encoding: distributions on {0} ∪ [A] → probability vectors Fin (A + 1) → ℝ (base IsProbVec, moment); reason: base conventions
Preamble
import Mathlib
import Definitions.Def_QMomentMatch_FirstBound_Basic
Formal statement
namespace QMomentMatch.FirstBound.Supplement

open QMomentMatch.FirstBound

/-- Lemma 4.2, p. 24 (proof p. 33), with `δ = ‖π_1 − π_0‖₁ = ∑_s |π_1(s) − π_0(s)|`. -/
theorem lemma_4_2 (A r : ℕ) (hr : 2 ≤ r) (hrA : r ≤ A) (π₀ π₁ : Fin (A + 1) → ℝ)
    (h₀ : IsProbVec π₀) (h₁ : IsProbVec π₁) (hne : π₀ ≠ π₁)
    (hmom : ∀ k : ℕ, 1 ≤ k → k ≤ r - 1 → moment π₀ k = moment π₁ k) :
    ∃ ω : Fin (A + 1) → ℝ, IsProbVec ω ∧
      (∀ k : ℕ, 1 ≤ k → k ≤ r - 1 → moment ω k = moment π₀ k) ∧
      (∀ s, (∑ t, |π₁ t - π₀ t|) / (32 : ℝ) ^ A ≤ ω s) ∧
      ∑ t, |ω t - π₀ t| ≤ ∑ t, |π₁ t - π₀ t| ∧
      ∑ t, |ω t - π₁ t| ≤ ∑ t, |π₁ t - π₀ t| := 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 4.2, p. 24 (proof p. 33)

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