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.
Bulge chase preserves bidiagonal singular values
Statement
Consider one exact-arithmetic sweep of Finite budget implicit shifted QR for bidiagonal singular values on an unreduced upper bidiagonal block, with no nonzero deflation. If its right rotations have product and its left rotations have product , the restored bidiagonal block is . Consequently and have the same singular values. If a set of superdiagonal entries is deflated, then the transformed output instead equals the corresponding unitary transform of , where has those entries negated and all other entries zero.
Facts & Assumptions
Given: An upper bidiagonal block, the Givens bulge-chase instructions, and exact unitary rotations.
Finite budget implicit shifted QR for bidiagonal singular values starts with a right rotation and alternates right rotations that remove generated second-superdiagonal bulges with left rotations that remove subdiagonal bulges; deflation occurs before the sweep rotations.
Householder reflectors and Givens transformations are unitary and can annihilate prescribed entries: each exact Givens rotation is unitary.
Proof
The first right rotation acts on the leading adjacent column pair of the active block and creates at most the first subdiagonal bulge. Each left rotation annihilates the current subdiagonal entry; because it mixes only two adjacent rows, it can create at most the next second-superdiagonal bulge. The following right rotation mixes only the adjacent columns supporting that bulge, annihilates it, and creates at most the next subdiagonal bulge. Induction along the block therefore keeps one bulge at a time and removes it at the next alternating rotation. The zero coupling at a deflated block endpoint prevents a bulge from leaving the block, so the final matrix is upper bidiagonal.
Every right operation multiplies on the right by a unitary Givens factor and every left operation multiplies on the left by the adjoint of a unitary Givens factor. Their products therefore give unitary and the final matrix is exactly .
Left and right unitary factors preserve singular values, since is unitarily similar to . Deflation occurs before the sweep rotations, and setting each listed superdiagonal entry to zero adds exactly its negative there; hence the matrix entering the unitary sweep is . With no deflation , so step 1.2 gives equal singular values for and .
Depends on
Used by
- Rank-thresholded least squares by the singular value decomposition Algorithm
- Local stable reflectors and rotations give an aggregate SVD backward error Theorem
Cited to discharge well-definedness by Finite budget implicit shifted QR for bidiagonal singular values.
Dependency tree · two levels
11 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
- Wen-Wei Lin, Lecture Notes of Matrix Computations, §6.3 (standard reference, not scraped)
- James Demmel and W. Kahan, Accurate Singular Values of Bidiagonal Matrices, §3 (standard reference, not scraped)