Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5: real parts of quantum signal processing polynomials

Proved
QSVT19.Main.theorem_5

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~,Q~∈R[x]\tilde P,\tilde Q\in\mathbb R[x]P~,Q~​∈R[x]. There exist P,Q∈C[x]P,Q\in\mathbb C[x]P,Q∈C[x] forming a QSP pair of degree kkk (properties (i)–(iii) of Theorem 3: deg⁡P≤k\deg P\le kdegP≤k, deg⁡Q≤k−1\deg Q\le k-1degQ≤k−1, parities kkk and k−1 mod 2k-1\bmod 2k−1mod2, and ∣P(x)∣2+(1−x2)∣Q(x)∣2=1|P(x)|^2+(1-x^2)|Q(x)|^2=1∣P(x)∣2+(1−x2)∣Q(x)∣2=1 on [−1,1][-1,1][−1,1]) with ℜ[P]=P~\Re[P]=\tilde Pℜ[P]=P~ and ℜ[Q]=Q~\Re[Q]=\tilde Qℜ[Q]=Q~​ if and only if

  1. deg⁡P~≤k\deg\tilde P\le kdegP~≤k and deg⁡Q~≤k−1\deg\tilde Q\le k-1degQ~​≤k−1;
  2. P~\tilde PP~ has parity k mod 2k\bmod2kmod2 and Q~\tilde QQ~​ has parity k−1 mod 2k-1\bmod 2k−1mod2;
  3. for all x∈[−1,1]x\in[-1,1]x∈[−1,1],
P~(x)2+(1−x2)Q~(x)2≤1.\tilde P(x)^2+(1-x^2)\tilde Q(x)^2\le 1.P~(x)2+(1−x2)Q~​(x)2≤1.

This tells which real polynomials can be realized as real parts of QSP polynomials; it underlies Corollary 10 and hence Corollary 18.

Formalization Note ℜ[P]\Re[P]ℜ[P] is the polynomial of the real parts of the coefficients. The theorem's parenthetical remark on imaginary parts 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 5, p. 11: "Let k ∈ N be fixed. Let P̃, Q̃ ∈ R[x], there exists some
P, Q ∈ C[x] satisfying properties (i)-(iii) of Theorem 3 such that P̃ = ℜ[P], Q̃ = ℜ[Q], if and
only if P̃, Q̃ satisfy properties (i)-(ii) of Theorem 3 and
(vi) ∀x ∈ [−1, 1]: P̃(x)^2 + (1 − x^2)Q̃^2 ≤ 1."

**Formalization Note.** Properties (i)–(iii) of Theorem 3 (p. 8) are `IsQSPPair k P Q`;
`ℜ[P] = P̃` is `RePartEq P Pt` (real parts of the coefficients, §2). Properties (i)–(ii) for the
real pair are written out: `deg P̃ ≤ k`, `deg Q̃ ≤ k − 1` (as `Q̃.degree < k`), `P̃` of parity
`k mod 2`, `Q̃` of parity `k − 1 mod 2` (as `HasParity _ (k + 1)` of the complexification). The
printed "`Q̃^2`" in (vi) is `Q̃(x)^2`. The parenthetical remark after the theorem (ℑ variants,
`Q̃ ≡ 0`) is not part of this statement. -/
theorem theorem_5 (k : ℕ) (Pt Qt : ℝ[X]) :
    (∃ P Q : ℂ[X], IsQSPPair k P Q ∧ RePartEq P Pt ∧ RePartEq Q Qt) ↔ ((Pt.degree ≤ k ∧ Qt.degree < k) ∧ (QAlgorithms.HasParity (Pt.map Complex.ofRealHom) k ∧ QAlgorithms.HasParity (Qt.map Complex.ofRealHom) (k + 1)) ∧ ∀ x ∈ Set.Icc (-1 : ℝ) 1, Pt.eval x ^ 2 + (1 - x ^ 2) * Qt.eval x ^ 2 ≤ 1) := by sorry

end QSVT19.Main
Source
Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, p. 11, Theorem 5
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