Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: a nonnegative even polynomial on [−1,1][-1,1][−1,1] is B2+(1−x2)C2B^2+(1-x^2)C^2B2+(1−x2)C2 with degree and parity control

Proved
QSVT19.Main.lemma_6

by mikedeng1 · Oct 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-computingquantum-signal-processingsingular-value-transformation

Let k∈Nk\in\mathbb Nk∈N and let A∈R[x]A\in\mathbb R[x]A∈R[x] be an even polynomial with deg⁡A≤2k\deg A\le 2kdegA≤2k and A(x)≥0A(x)\ge0A(x)≥0 for all x∈[−1,1]x\in[-1,1]x∈[−1,1]. Then there are B,C∈R[x]B,C\in\mathbb R[x]B,C∈R[x] with

A(x)=B(x)2+(1−x2) C(x)2,A(x)=B(x)^2+(1-x^2)\,C(x)^2,A(x)=B(x)2+(1−x2)C(x)2,

where deg⁡B≤k\deg B\le kdegB≤k, deg⁡C≤k−1\deg C\le k-1degC≤k−1, BBB has parity k mod 2k\bmod 2kmod2 and CCC has parity k−1 mod 2k-1\bmod 2k−1mod2.

This sum-of-squares factorization is the polynomial core of the characterizations of quantum signal processing (Theorems 4 and 5).

Formalization Note The identity is between polynomials. deg⁡C≤k−1\deg C\le k-1degC≤k−1 is written deg⁡C<k\deg C<kdegC<k, so C=0C=0C=0 when k=0k=0k=0; parities of real polynomials are stated for their complexifications.

Preamble
import Definitions.Def_QSVT19_Main_Setting

set_option autoImplicit false

open scoped ComplexOrder
open Polynomial Matrix
Formal statement
namespace QSVT19.Main

/-- Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, Lemma 6, p. 11: "Suppose that A ∈ R[x] is an even polynomial such that deg(A) ≤ 2k and
for all x ∈ [−1, 1] we have A(x) ≥ 0. Then there exist polynomials B, C ∈ R[x] such that
A(x) = B^2(x) + (1 − x^2)C^2(x), moreover deg(B) ≤ k, deg(C) ≤ k − 1, B has parity-(k mod 2) and
C has parity-(k − 1 mod 2)."

**Formalization Note.** "A is even" is `A.comp (−X) = A`. The identity `A = B² + (1 − X²)C²` is
an identity of polynomials (equivalently, for all real `x`). "deg(C) ≤ k − 1" is `C.degree < k`
(so `k = 0` forces `C = 0`), and "parity-(k − 1 mod 2)" is `HasParity _ (k + 1)`; parities of
real polynomials are stated for their images in `ℂ[X]`. -/
theorem lemma_6 (k : ℕ) (A : ℝ[X]) (hA_even : A.comp (-X) = A) (hA_deg : A.degree ≤ (2 * k : ℕ))
    (hA_nonneg : ∀ x ∈ Set.Icc (-1 : ℝ) 1, 0 ≤ A.eval x) :
    ∃ B C : ℝ[X], A = B ^ 2 + (1 - X ^ 2) * C ^ 2 ∧ B.degree ≤ k ∧ C.degree < k ∧ QAlgorithms.HasParity (B.map Complex.ofRealHom) k ∧ QAlgorithms.HasParity (C.map Complex.ofRealHom) (k + 1) := by sorry

end QSVT19.Main
Source
Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, p. 11, Lemma 6
Human review
  • Endorsed by Shuze Chen · Oct 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 18, 2026

    Confirmed by the mission captain (proposal self-audit).

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