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.
Cosine-Sine Block Decomposition
Statement
Let and let be partitioned into blocks There are block-diagonal unitaries and and nonnegative real diagonal matrices such that The singular values at and are allowed, with no nondegeneracy assumption.
Facts & Assumptions
Given: An integer and a unitary matrix partitioned as in the Statement.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: a linear map between finite-dimensional real or complex inner-product spaces has orthonormal bases in which it is diagonal with nonnegative singular values, including zero values.
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique adjoint.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional real or complex inner-product space has an orthonormal basis.
Proof
Apply [F1] to to obtain unitary and with and . Since is the compression of the unitary to the first block, for every , so each singular value satisfies . Put with .
The first block row of gives , hence . For every with , the row has norm one, and these rows are mutually orthogonal by the displayed Gram identity. Extend them to an orthonormal basis using [F3], and choose the signs of the completed rows so that a unitary satisfies .
The first block column of gives , hence . For every with , the column has norm one, and these columns are mutually orthogonal. Extend them to an orthonormal basis using [F3]; the resulting unitary satisfies . Therefore for some .
The upper-right block of gives . Thus, for each with , column of is . The lower-right blocks of and give . For such , the prescribed entry already contributes to row 's squared norm, so forces every other entry in that row to vanish. Thus both the rows and columns indexed by have no cross-block entries. On one has ; the block of has orthonormal rows and columns and is therefore unitary. This also covers , where the corresponding row and column are zero, and , where the index belongs to .
Let be that unitary block and replace by . Since acts only where and , this leaves unchanged and changes the lower-right block to . Hence Both outside factors are unitary, and by definition. The argument includes , , repeated values, and empty positive or zero supports.
Depends on
Used by
Dependency tree · two levels
12 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
- Vivek V. Shende, Stephen S. Bullock, and Igor L. Markov, Synthesis of Quantum Logic Circuits, arXiv:quant-ph/0406176v5 (standard reference, not scraped)