Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.9 — ∣dℓ(w)∣≤CℓT1+αℓ/(ρ n1n∗αℓ−1/2)|d_\ell(\mathbf w)|\le C^\ell T^{1+\alpha_\ell}/(\sqrt\rho\,n_1 n_*^{\alpha_\ell-1/2})∣dℓ​(w)∣≤CℓT1+αℓ​/(ρ​n1​n∗αℓ​−1/2​) for ∑iwi≤3N/4\sum_i w_i\le3N/4∑i​wi​≤3N/4

Open
QMomentMatch.FirstBound.Supplement.lemma_4_9

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

moment-matchingp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-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. Assume (as stated before the lemma, p. 32) N≥8AN\ge8AN≥8A, T≥1T\ge1T≥1, T2≤N/8T^2\le N/8T2≤N/8, and fix 2≤ℓ≤A2\le\ell\le A2≤ℓ≤A with T≤Nαℓ/(1+αℓ)T\le N^{\alpha_\ell/(1+\alpha_\ell)}T≤Nαℓ​/(1+αℓ​). Let w∈Sm−1\mathbf w\in S^{m-1}w∈Sm−1 satisfy ∑iwi≤3N/4\sum_iw_i\le3N/4∑i​wi​≤3N/4. Complete (w,ℓ)(\mathbf w,\ell)(w,ℓ) with singletons (the frequency vector c(w,ℓ)\mathbf c(\mathbf w,\ell)c(w,ℓ) of Definition 2.1, step 2), let ρ\rhoρ be its number of ℓ\ellℓ-blocks (entries equal to ℓ\ellℓ) and bjb_jbj​ its number of jjj-blocks for 1≤j<ℓ1\le j<\ell1≤j<ℓ; put nj=1+bjn_j=1+b_jnj​=1+bj​ and n∗=min⁡1≤j<ℓnjn_*=\min_{1\le j<\ell}n_jn∗​=min1≤j<ℓ​nj​. Then for every TTT-query algorithm,

∣dℓ(w)∣≤Cℓ T1+αℓρ  n1  n∗αℓ−1/2.(29)|d_\ell(\mathbf w)|\le\frac{C^\ell\,T^{1+\alpha_\ell}}{\sqrt\rho\;n_1\;n_*^{\alpha_\ell-1/2}}.\qquad(29)∣dℓ​(w)∣≤ρ​n1​n∗αℓ​−1/2​CℓT1+αℓ​​.(29)

Averaging (29) over random w\mathbf ww gives Lemma 4.1.

Formalization Note ρ\sqrt\rhoρ​ and n∗αℓ−1/2n_*^{\alpha_\ell-1/2}n∗αℓ​−1/2​ are real powers of natural numbers; under the hypotheses ρ≥1\rho\ge1ρ≥1 and n1,n∗≥1n_1,n_*\ge1n1​,n∗​≥1, so the denominator is positive. "CCC is an absolute constant" is the existential ∃C>0\exists C>0∃C>0 placed before every other quantity.

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, ℓ)
  • encoding: ρ, b_j counts of blocks of the completion of (w, ℓ) → Multiset.count of ℓ and j in drawsFreq N (appendLast w ℓ); reason: the completion is the base drawsFreq; a j-block is an entry equal to j
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.9, p. 32, under the standing assumptions stated just before it (p. 32):
`N ≥ 8A`, `T ≥ 1`, `T² ≤ N/8`, `2 ≤ ℓ ≤ A`, `T ≤ N^{α_ℓ/(1+α_ℓ)}`. In the completion
`c(w, ℓ)`: `ρ` = number of `ℓ`-blocks, `n_1 = 1 + b_1`, `n_* = min_{1≤j<ℓ} (1 + b_j)`.
`C` is absolute. -/
theorem lemma_4_9 :
    ∃ 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 : ℕ) : ℝ)) ≤ 3 * (N : ℝ) / 4 →
          |newtonW alg out w ℓ| ≤
            C ^ (ℓ : ℕ) * (T : ℝ) ^ (1 + alpha ℓ) /
              (Real.sqrt (blockCount N w ℓ ℓ : ℝ) * ((1 + blockCount N w ℓ 1 : ℕ) : ℝ) *
                ((nStar N w ℓ : ℕ) : ℝ) ^ (alpha ℓ - 1 / 2)) := 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.9 and the standing assumptions before it, p. 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