Lemma 3.3 — Newton bound: at integers
OpenQMomentMatch.FirstBound.Supplement.lemma_3_3approximation-theorymoment-matchingp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials
Let and be integers, and let be a real polynomial of degree at most with for every . Its Newton coefficients are
and for an integer put .
- At every ,
empty sums being zero. 2. If moreover , then for every integer and every ,
This is the Newton-basis counterpart of the Taylor bound (Lemma 3.2). In the proof of Theorem 2.6 it controls the part of beyond its first Newton terms, and applied at with remainder order it bounds the single coefficient in the singleton case (Lemma 4.8).
Formalization Note is the natural-number binomial coefficient at integer ; both parts are stated only at integer points, as in the source.
Differences from the source:
- encoding: Q_r(z) = Σ_{ℓ=0}^{r−1} d_ℓ (z choose ℓ) as a polynomial → the sum evaluated at natural numbers z ≤ H with Nat.choose; reason: the lemma only asserts statements at z ∈ {0} ∪ [H]
- encoding: q(z) for a polynomial q of degree at most d → q : ℝ[X] with q.natDegree ≤ d, evaluated with Polynomial.eval; reason: natDegree ≤ d is degree ≤ d (the zero polynomial included)
Preamble
import Mathlib import Definitions.Def_QMomentMatch_FirstBound_Supplement_NewtonCoeff
Formal statement
namespace QMomentMatch.FirstBound.Supplement
open Polynomial
/-- Lemma 3.3 (Newton bound), p. 16 (proof: Appendix A, p. 43). `d_ℓ` are the Newton
coefficients of `q` and `Q_r(z) = ∑_{ℓ=0}^{r−1} d_ℓ (z choose ℓ)`; both parts are stated at the
integers `z ∈ {0} ∪ [H]`. -/
theorem lemma_3_3 (H d : ℕ) (hH : 1 ≤ H) (q : ℝ[X]) (hq : q.natDegree ≤ d)
(hbound : ∀ z : ℕ, z ≤ H → |q.eval (z : ℝ)| ≤ 1) :
(∀ r : ℕ, 1 ≤ r → r ≤ H + 1 → ∀ z : ℕ, z ≤ H →
q.eval (z : ℝ) - ∑ ℓ ∈ Finset.range r,
newtonCoeff (fun s => q.eval (s : ℝ)) ℓ * ((z.choose ℓ : ℕ) : ℝ) =
∑ ℓ ∈ Finset.Ico r (H + 1),
newtonCoeff (fun s => q.eval (s : ℝ)) ℓ * ((z.choose ℓ : ℕ) : ℝ) ∧
∑ ℓ ∈ Finset.Ico r (H + 1),
newtonCoeff (fun s => q.eval (s : ℝ)) ℓ * ((z.choose ℓ : ℕ) : ℝ) =
∑ ℓ ∈ Finset.Ico r (z + 1),
newtonCoeff (fun s => q.eval (s : ℝ)) ℓ * ((z.choose ℓ : ℕ) : ℝ)) ∧
((d : ℝ) ^ 2 ≤ (H : ℝ) / 2 → ∀ r : ℕ, 1 ≤ r → r ≤ H + 1 → ∀ z : ℕ, z ≤ H →
|q.eval (z : ℝ) - ∑ ℓ ∈ Finset.range r,
newtonCoeff (fun s => q.eval (s : ℝ)) ℓ * ((z.choose ℓ : ℕ) : ℝ)| ≤
2 / ((2 * r).factorial : ℝ) * (4 * (d : ℝ) ^ 2 / H) ^ r * (z : ℝ) ^ r) := 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.3, p. 16 (proof: Appendix A, p. 43)