How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Singular-value transform is independent of SVD choices
Statement
For a finite-dimensional PUE map , the odd singular-value transform and both even singular-value transforms of Odd and even singular-value transforms are independent of the chosen singular-vector bases. On a positive singular-value subspace, canonically pairs the right and left eigenspaces; on repeated singular values the transform is scalar on the whole corresponding subspace. The even transforms use the canonical orthogonal projection onto or with coefficient ; the odd transform has no zero-singular cross term.
Facts & Assumptions
Given: A finite-dimensional PUE map and an even or odd function .
Odd and even singular-value transforms: the odd transform sums over positive singular values; the even right and left transforms sum on their singular-vector bases and use on the respective kernels.
Projected-unitary encoding and singular vectors: the positive singular pairs satisfy and , and the complete right and left bases identify and .
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional map has complete orthonormal singular bases and a positive-term SVD formula.
Adjoints satisfy , , , and : adjoints reverse compositions and preserve sums.
The orthogonal projection is the -component in : each finite-dimensional subspace has a unique orthogonal projection.
Proof
For each distinct positive singular value , define in and in . The adjoint rule [F4] and adjoint algebra [F5] make and self-adjoint, and [F2]–[F3] identify these eigenspaces with the right and left singular subspaces. If , then because . Also [F4] gives . Thus is an isometry from into . For , [F5] gives , and ; hence maps onto .
Group the positive singular terms in the odd transform by their common value . In any orthonormal basis of , the paired left vectors are , so , where is the unique projection from [F6]. The grouped term is therefore , independent of the basis.
For the even right transform, grouping by positive singular value gives , and the zero-singular part is ; both are canonical projections. For the even left transform the corresponding terms are and . The zero right and left singular vectors may be chosen independently, but the even definitions use only these unique subspace projections, while the odd definition omits zero singular pairs. Thus all three transforms are independent of the SVD choices.
Depends on
- Odd and even singular-value transforms
- Projected-unitary encoding and singular vectors
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
Used by
- Operator perturbation bound for QSVT Lemma
- QSVT action on singular subspaces Theorem
- QSVT robustness, approximation error, and resources Theorem
Cited to discharge well-definedness by Odd and even singular-value transforms.
Dependency tree · two levels
22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definitions 12 and 16, Theorem 17 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §§29.2–29.3 (standard reference, not scraped)