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.
Rank-one PUE singular-plane calculation
Example
Let , , , and . The PUE block is the scalar matrix . Use the degree-one phase list , whose scalar polynomial is .
Facts & Assumptions
Given: , the standard orthonormal basis of , the PUE definition, and the ordered QSVT sequence.
PUE singular-space invariant decomposition: for , the matrix of the PUE unitary on its singular plane is ; at the right kernel maps into the left projector complement, and at the singular block is a line.
QSVT action on singular subspaces: degree-one QSVT compresses to the odd singular-value transform with coefficient , including the zero-kernel case.
Proof
Put . Direct multiplication gives , so is unitary. The projection onto gives , hence the PUE block is . Its complementary matrix entry is , so the ordered basis realizes on the full ambient space: for this is the singular plane, at it is the zero-kernel/complement block, and at it splits into the singular line and residual complement .
The zero phases make both endpoint phase matrices the identity, so the degree-one sequence is itself. Its compressed block is . The scalar polynomial is the upper-left entry of , namely ; therefore for the odd transform is , and for the positive singular sum is empty and both blocks are zero. The same formulas give at .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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)