Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 (first claim): which PPP extend to a quantum signal processing pair

Proved
QSVT19.Main.theorem_4_first_claim

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 P∈C[x]P\in\mathbb C[x]P∈C[x]. There is Q∈C[x]Q\in\mathbb C[x]Q∈C[x] such that P,QP,QP,Q form a QSP pair of degree kkk (properties (i)–(iii) of Theorem 3) if and only if deg⁡P≤k\deg P\le kdegP≤k, PPP has parity k mod 2k\bmod 2kmod2, and

  1. (iv.a) ∣P(x)∣≤1|P(x)|\le1∣P(x)∣≤1 for all x∈[−1,1]x\in[-1,1]x∈[−1,1];
  2. (iv.b) ∣P(x)∣≥1|P(x)|\ge 1∣P(x)∣≥1 for all x∈(−∞,−1]∪[1,∞)x\in(-\infty,-1]\cup[1,\infty)x∈(−∞,−1]∪[1,∞);
  3. (iv.c) if kkk is even, then for all x∈Rx\in\mathbb Rx∈R,
P(ix) P∗(ix)≥1.P(ix)\,P^*(ix)\ge 1.P(ix)P∗(ix)≥1.

These are exactly the requirements that Corollary 8 places on the target polynomial.

Formalization Note In (iv.c), "≥1\ge1≥1" for a complex number means real and at least 111 (Mathlib's ComplexOrder). P∗P^*P∗ has the conjugated coefficients. The theorem's second claim, about QQQ, is not included.

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, Theorem 4 (first claim), p. 10: "Let k ∈ N be fixed. Let P ∈ C[x], there exists some
Q ∈ C[x] such that P, Q satisfy properties (i)-(iii) of Theorem 3 if and only if P satisfies
properties (i)-(ii) of Theorem 3 and
(iv.a) ∀x ∈ [−1, 1]: |P(x)| ≤ 1
(iv.b) ∀x ∈ (−∞, −1] ∪ [1, ∞): |P(x)| ≥ 1
(iv.c) if k is even, then ∀x ∈ R: P(ix)P^∗(ix) ≥ 1."

**Formalization Note.** Properties (i)–(iii) of Theorem 3 are `IsQSPPair k P Q`; (i)–(ii) for
`P` alone are `deg P ≤ k` and parity `k mod 2`. `P^*` is `P.map (starRingEnd ℂ)`. In (iv.c) the
comparison `1 ≤ z` of complex numbers is Mathlib's `ComplexOrder`: `z` is real and at least
`1`. The second claim of Theorem 4 ((v.a)–(v.b), about `Q`) is not part of this statement. -/
theorem theorem_4_first_claim (k : ℕ) (P : ℂ[X]) :
    (∃ Q : ℂ[X], IsQSPPair k P Q) ↔ ((P.degree ≤ k ∧ QAlgorithms.HasParity P k) ∧ (∀ x ∈ Set.Icc (-1 : ℝ) 1, ‖P.eval (x : ℂ)‖ ≤ 1) ∧ (∀ x : ℝ, 1 ≤ |x| → 1 ≤ ‖P.eval (x : ℂ)‖) ∧ (Even k → ∀ x : ℝ, (1 : ℂ) ≤ P.eval (Complex.I * x) * (P.map (starRingEnd ℂ)).eval (Complex.I * x))) := by sorry

end QSVT19.Main
Source
Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, p. 10, Theorem 4 (first claim, (iv.a)–(iv.c))
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