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.
Hermitian dilation for a rectangular linear system
Statement
For , define using the adjoint of The adjoint is characterised by by . Then is Hermitian; its nonzero eigenvalues are for the positive singular values of , its kernel is , and . When has positive rank, its nonzero condition number is preserved; the output is tagged in the domain summand.
Facts & Assumptions
Given: A finite-dimensional map and its singular system.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: has orthonormal singular pairs with positive values ; in these bases its matrix is diagonal with entries and zero on the remaining coordinates.
The adjoint is characterised by : , so the adjoint of a block matrix swaps the blocks and takes their adjoints.
The Moore--Penrose pseudoinverse as the solution of the four Penrose equations: a pseudoinverse satisfies , , and are self-adjoint; Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: each finite matrix has exactly one such pseudoinverse.
Proof
The block matrix of is . Its adjoint, by [F2], is the same block matrix, so .
Multiplying the SVD in [F1] gives and . Therefore and . After division by these are unit eigenvectors. Orthonormality of the singular pairs makes all such vectors mutually orthogonal.
In the SVD bases, write with positive diagonal entries . The diagonal matrix that replaces each positive entry by and leaves zero entries zero satisfies , , and both products and are diagonal projections. Unitary transport shows satisfies the four equations in [F3], so uniqueness gives and .
The equation is equivalent to and , so . Together with step 1.2, the nonzero eigenvalue magnitudes are exactly the positive singular values, each appearing with both signs. Thus when there is positive rank their maximum-to-minimum ratio is unchanged.
The vectors from step 1.2 together with orthonormal bases of and form an orthonormal eigenbasis of the direct sum. Define on this basis by , , and on the kernel. Then and are self-adjoint projections, while diagonal multiplication gives and . Thus satisfies [F3], and uniqueness gives . Since , this definition gives . Complete the positive left singular vectors to the left singular basis from [F1]. The remaining basis vectors have zero singular coordinates, so the diagonal SVD gives for each; hence they span the complementary part . Thus every has a decomposition with . Since , its positive left-singular coordinates vanish, so and the formula in step 1.3 gives . By step 2.1 , so . Applying the positive-pair calculation to the other summands gives for arbitrary , including .
Depends on
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- The Moore--Penrose pseudoinverse $A^+$ as the solution of the four Penrose equations
- Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse
- Dirac Notation Conversion
Used by
Dependency tree · two levels
18 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
- Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, Quantum algorithm for linear systems of equations (standard reference, not scraped)
- Andrew M. Childs, Robin Kothari, and Rolando D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)