Lemma 4.3 — bounded alternating-root polynomials
ProvedQuantumLTF.Majority.lemma_4_3krawtchouk-polynomialspolynomialssection-4
For odd , the alternating-root polynomials obey the uniform pointwise estimate
Preamble
import Mathlib
Formal statement
namespace QuantumLTF.Majority theorem lemma_4_3 : ∃ C : ℝ, 0<C ∧ ∀ k : ℕ, 3≤k → Odd k → ∃ P Q : Fin (k+1) → ℝ, (∀ t : Fin (k+1), 1≤t.1 → t.1<k → (P t=0 ↔ Q t≠0)) ∧ ∀ t : Fin (k+1), (k.choose t : ℝ)*(P t^2+Q t^2) ≤ C*(k:ℝ)/((t.1+1)*(k-t.1+1)) := by sorry end QuantumLTF.Majority
Source
Krivcenko, Nguyen, de Wolf, STOC 2027 submission #347, Lemma 4.3, p.43 (PDF p.44).