Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 10: real quantum signal processing

Proved
QSVT19.Main.corollary_10

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 d≥1d\ge1d≥1 and let Pℜ∈R[x]P_\Re\in\mathbb R[x]Pℜ​∈R[x] have degree ddd and parity d mod 2d\bmod 2dmod2, with

∣Pℜ(x)∣≤1for all x∈[−1,1].|P_\Re(x)|\le1\quad\text{for all }x\in[-1,1].∣Pℜ​(x)∣≤1for all x∈[−1,1].

Then there is P∈C[x]P\in\mathbb C[x]P∈C[x] with ℜ[P]=Pℜ\Re[P]=P_\Reℜ[P]=Pℜ​ that satisfies the requirements of Corollary 8 (degree ddd, parity d mod 2d\bmod2dmod2, ∣P∣≤1|P|\le1∣P∣≤1 on [−1,1][-1,1][−1,1], ∣P∣≥1|P|\ge1∣P∣≥1 for ∣x∣≥1|x|\ge1∣x∣≥1, and P(ix)P∗(ix)≥1P(ix)P^*(ix)\ge1P(ix)P∗(ix)≥1 when ddd is even).

Combined with Corollary 8, every such real polynomial is the real part of a polynomial realized by reflection-based quantum signal processing.

Formalization Note The printed sentence omits ℜ[P]=Pℜ\Re[P]=P_\Reℜ[P]=Pℜ​, without which the statement is trivial (the Chebyshev polynomial TdT_dTd​ meets Corollary 8's requirements). The proof of Corollary 18 uses exactly this reading. The running-time ("Moreover") claim 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, Corollary 10, p. 14: "Let P_ℜ(x) ∈ R[x] be a degree-d polynomial for some d ≥ 1, such
that • P_ℜ has parity-(d mod 2), and • for all x ∈ [−1, 1]: |P_ℜ(x)| ≤ 1.
Then there exists P ∈ C[x] that satisfies the requirements of Corollary 8."

**Formalization Note.** The printed sentence omits `ℜ[P] = P_ℜ`, without which the claim is
trivial (the Chebyshev polynomial `T_d` satisfies the requirements of Corollary 8, by Lemma 9).
The intended claim, used in the proof of Corollary 18 (p. 19: "By Corollary 10 we can find a
Φ ∈ R^n such that ℜ[P] = P_ℜ") and implicit in Corollary 10's own "Moreover" clause, is stated:
`∃ P, ℜ[P] = P_ℜ` and `P` meets Corollary 8's requirements. "degree-d" is `natDegree = d`; the
parity of the real polynomial is that of its image in `ℂ[X]`. The "Moreover" clause (classical
running time) is not part of this statement. -/
theorem corollary_10 (d : ℕ) (hd : 1 ≤ d) (PR : ℝ[X]) (hdeg : PR.natDegree = d) (hpar : QAlgorithms.HasParity (PR.map Complex.ofRealHom) d) (hbd : ∀ x ∈ Set.Icc (-1 : ℝ) 1, |PR.eval x| ≤ 1) :
    ∃ P : ℂ[X], RePartEq P PR ∧ Cor8Requirements d P := by sorry

end QSVT19.Main
Source
Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, p. 14, Corollary 10 (existence claim)
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