Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.8 — singleton case: ∣dℓ(w)∣≤CℓT1+αℓ/N|d_\ell(\mathbf w)|\le C^\ell T^{1+\alpha_\ell}/N∣dℓ​(w)∣≤CℓT1+αℓ​/N for w∈{0,1}m−1\mathbf w\in\{0,1\}^{m-1}w∈{0,1}m−1

Open
QMomentMatch.FirstBound.Supplement.lemma_4_8

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

moment-matchingp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-methodquantum-query-complexity

Setting (§4.1, p. 24). Fix integers A≥1A\ge1A≥1, N≥1N\ge1N≥1 and T≥0T\ge0T≥0 and a quantum algorithm A\mathcal AA making TTT standard queries to f:[N]→[N]f:[N]\to[N]f:[N]→[N], with acceptance probability p(f)=Pr⁡[Af=1]p(f)=\Pr[\mathcal A^f=1]p(f)=Pr[Af=1]. Let S={0}∪[A]S=\{0\}\cup[A]S={0}∪[A], m=⌊N/2⌋m=\lfloor N/2\rfloorm=⌊N/2⌋, and for z∈Sm\mathbf z\in S^mz∈Sm let h(z)=Ef∼Dc(z)[p(f)]h(\mathbf z)=\mathbb E_{f\sim\mathcal D_{\mathbf c(\mathbf z)}}[p(f)]h(z)=Ef∼Dc(z)​​[p(f)], where c(z)\mathbf c(\mathbf z)c(z) is the frequency vector of step 2 of Definition 2.1. For w∈Sm−1\mathbf w\in S^{m-1}w∈Sm−1 put qw(s)=h(w,s)q_{\mathbf w}(s)=h(\mathbf w,s)qw​(s)=h(w,s) and let dℓ(w)=∑s=0ℓ(−1)ℓ−s(ℓs)qw(s)d_\ell(\mathbf w)=\sum_{s=0}^{\ell}(-1)^{\ell-s}\binom\ell s q_{\mathbf w}(s)dℓ​(w)=∑s=0ℓ​(−1)ℓ−s(sℓ​)qw​(s) be its Newton coefficients (20). Let αℓ=1−21−ℓ\alpha_\ell=1-2^{1-\ell}αℓ​=1−21−ℓ.

There is an absolute constant C>0C>0C>0 with the following property. Suppose N≥8AN\ge8AN≥8A, T≥1T\ge1T≥1 and T2≤N/8T^2\le N/8T2≤N/8, and let 2≤ℓ≤A2\le\ell\le A2≤ℓ≤A satisfy T≤Nαℓ/(1+αℓ)T\le N^{\alpha_\ell/(1+\alpha_\ell)}T≤Nαℓ​/(1+αℓ​). Then for every TTT-query algorithm and every w∈{0,1}m−1\mathbf w\in\{0,1\}^{m-1}w∈{0,1}m−1,

∣dℓ(w)∣≤Cℓ T1+αℓN.|d_\ell(\mathbf w)|\le C^\ell\,\frac{T^{1+\alpha_\ell}}{N}.∣dℓ​(w)∣≤CℓNT1+αℓ​​.

This handles the singleton branch in the proof of Lemma 4.9, where every sampled multiplicity is 000 or 111.

Formalization Note "CCC is an absolute constant" is the existential ∃C>0\exists C>0∃C>0 placed before N,A,T,ℓN,A,T,\ellN,A,T,ℓ, the algorithm and w\mathbf ww.

Differences from the source:

  • encoding: a T-query quantum algorithm on f : [N] → [N] → QueryAlg (Fin N) (ZMod N) W T with any finite workspace W, any unitaries and start state, any output map out, standard oracle xorOracle f; reason: the base mission's algorithm model (theorem_2_5); [N] is Fin N for positions and ZMod N for labels
  • encoding: S = {0} ∪ [A], w ∈ S^{m−1}, (w, s), m = ⌊N/2⌋ → Fin (A + 1), w : Fin (N / 2 - 1) → Fin (A + 1), appendLast w s, N / 2; reason: same conventions as the base definitions; s is placed in the last coordinate as on p. 18
  • encoding: C is an absolute constant → ∃ C : ℝ, 0 < C placed before N, A, T, ℓ, the algorithm and w; reason: absolute means independent of every other quantity; requiring C > 0 loses nothing since enlarging to 1 + |C| preserves the bound
  • encoding: an integer ℓ with 2 ≤ ℓ ≤ A → ℓ : Fin (A + 1) with 2 ≤ (ℓ : ℕ); reason: Fin (A + 1) carries ℓ ≤ A; ℓ is also a value of S as needed for the completion (w, ℓ)
Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Query
import Definitions.Def_QMomentMatch_FirstBound_Basic
import Definitions.Def_QMomentMatch_FirstBound_InducedDist
import Definitions.Def_QMomentMatch_FirstBound_Supplement_NewtonCoeff
Formal statement
namespace QMomentMatch.FirstBound.Supplement

open QAlgorithms QMomentMatch.FirstBound

/-- Lemma 4.8, pp. 31–32 (singleton case), in the setting of §4.1 (p. 24): a `T`-query algorithm
on `f : [N] → [N]`, `m = ⌊N/2⌋`, `S = {0} ∪ [A]`, `d_ℓ(w)` of eq. (20). `C` is absolute: it is
chosen before every other quantity. -/
theorem lemma_4_8 :
    ∃ C : ℝ, 0 < C ∧
      ∀ (N A T : ℕ) [NeZero N] (ℓ : Fin (A + 1)),
        8 * A ≤ N → 1 ≤ T → (T : ℝ) ^ 2 ≤ (N : ℝ) / 8 → 2 ≤ (ℓ : ℕ) →
        (T : ℝ) ≤ (N : ℝ) ^ (alpha ℓ / (1 + alpha ℓ)) →
        ∀ (W : Type) [Fintype W] [DecidableEq W] (alg : QueryAlg (Fin N) (ZMod N) W T)
          (out : (Fin N × ZMod N) × W → Bool) (w : Fin (N / 2 - 1) → Fin (A + 1)),
          (∀ i, (w i : ℕ) ≤ 1) →
          |newtonW alg out w ℓ| ≤ C ^ (ℓ : ℕ) * (T : ℝ) ^ (1 + alpha ℓ) / N := 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.8, pp. 31–32 (setting §4.1, p. 24)

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