Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 17: singular value transformation by alternating phase modulation

Proved
QSVT19.Main.theorem_17

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 UUU be a unitary and Π,Π~\Pi,\widetilde\PiΠ,Π orthogonal projectors on a finite-dimensional Hilbert space. Let n∈Nn\in\mathbb Nn∈N, Φ∈Rn\Phi\in\mathbb R^nΦ∈Rn and P∈C[x]P\in\mathbb C[x]P∈C[x] be such that, for every x∈[−1,1]x\in[-1,1]x∈[−1,1], P(x)P(x)P(x) is the top-left entry of ∏j=1n(eiφjσzR(x))\prod_{j=1}^n\bigl(e^{i\varphi_j\sigma_z}R(x)\bigr)∏j=1n​(eiφj​σz​R(x)) (equation (14)). Then, for every singular value decomposition of Π~UΠ\widetilde\Pi U\PiΠUΠ, P(SV)(Π~UΠ)={Π~ UΦ Πif n is odd,Π UΦ Πif n is even,P^{(SV)}(\widetilde\Pi U\Pi)=\begin{cases}\widetilde\Pi\,U_\Phi\,\Pi&\text{if $n$ is odd},\\ \Pi\,U_\Phi\,\Pi&\text{if $n$ is even},\end{cases}P(SV)(ΠUΠ)={ΠUΦ​ΠΠUΦ​Π​if n is odd,if n is even,​ where P(SV)P^{(SV)}P(SV) is the odd, respectively even, singular value transformation of Definition 16 and UΦU_\PhiUΦ​ is the alternating phase modulation sequence (31).

This is the paper's central identity: a sequence of nnn uses of UUU and U†U^\daggerU† interleaved with phase rotations applies the polynomial PPP to every singular value of the block Π~UΠ\widetilde\Pi U\PiΠUΠ.

Formalization Note "PPP and Φ\PhiΦ as in Corollary 8" is read as (14), the only property the proof uses; Corollary 8's conditions on PPP are not assumed. No bound on nnn is needed.

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 17, p. 18: "Let H_U be a finite-dimensional Hilbert space and let U, Π, Π̃ ∈
End(H_U) be linear operators on H_U such that U is a unitary, and Π, Π̃ are orthogonal projectors.
Let P ∈ C[x] and Φ ∈ R^n is as in Corollary 8, then
P^{(SV)}(Π̃UΠ) = Π̃U_ΦΠ if n is odd, and ΠU_ΦΠ if n is even. (32)"

**Formalization Note.** `H_U` is `ι → ℂ` for a finite type `ι`, with inner product
`star v ⬝ᵥ w`; `Π, Π̃` are `Proj, Projt`; "unitary" is `U ∈ Matrix.unitaryGroup ι ℂ` and
"orthogonal projector" is `IsStarProjection` (self-adjoint idempotent). "P and Φ as in Corollary 8" is read as (14): the top-left entry of
`∏_{j=1}^n e^{iφ_jσ_z}R(x)` is `P(x)` for every `x ∈ [−1, 1]`. That is the only property of `P`
and `Φ` the proof uses; Corollary 8's bullets on `P` are not assumed. `P^{(SV)}` is Definition
16 over an arbitrary singular value decomposition `S` of `Π̃UΠ` (`svtOdd` for odd `n`,
`svtEven` for even `n`, as in (32)); `U_Φ` is `altPhaseSeq` (Definition 15). No bound on `n` is
needed: at `n = 0`, (14) forces `P = 1` and both sides are `Π`. -/
theorem theorem_17 {ι : Type*} [Fintype ι] [DecidableEq ι] (U Proj Projt : Matrix ι ι ℂ) (hU : U ∈ Matrix.unitaryGroup ι ℂ) (hProj : IsStarProjection Proj) (hProjt : IsStarProjection Projt) (n : ℕ) (Φ : Fin n → ℝ) (P : ℂ[X]) (hΦ : ∀ x ∈ Set.Icc (-1 : ℝ) 1, qspRefl Φ x 0 0 = P.eval (x : ℂ)) (S : ProjUnitarySVD U Proj Projt) :
    (Odd n → svtOdd (fun x => P.eval (x : ℂ)) S = Projt * altPhaseSeq U Proj Projt Φ * Proj) ∧ (Even n → svtEven (fun x => P.eval (x : ℂ)) S = Proj * altPhaseSeq U Proj Projt Φ * Proj) := by sorry

end QSVT19.Main
Source
Gilyén, Su, Low, Wiebe, arXiv:1806.01838v1, p. 18, Theorem 17, (32)
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