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.
Parity violation makes singular-value action basis dependent
Statement
A false extension of the odd singular-value formula that assigns a nonzero coefficient to zero-singular-vector pairs depends on arbitrary basis choices. Take and the scalar function . Pair the right zero vector with either left zero vector or . The resulting rank-one sums are respectively and , despite the same zero map .
Facts & Assumptions
Given: The zero linear map , the scalar value , and the rank-one map convention of Dirac Notation Conversion.
Odd and even singular-value transforms: an odd singular-value transform sums only over positive singular pairs, while an even right transform uses times the canonical projection onto .
Dirac Notation Conversion: maps to .
Proof
For , the entire domain and codomain are zero-singular spaces; both and are unit left-kernel vectors, and is a unit right-kernel vector. With the first pairing, sends to , so the false zero-pair sum with coefficient is .
With the second equally valid left singular basis, sends to , so the same false rule gives . Since on , this rule is not basis independent. The valid odd definition avoids the defect because odd polynomials have and the sum contains only positive singular values; the valid even definition adds , which is canonical and unchanged by the choice of kernel basis.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 (standard reference, not scraped)