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.
An unreduced Hessenberg similarity is determined up to column phases by its first unitary column
Statement
Let , let be upper Hessenberg with every first-subdiagonal entry nonzero. Suppose are unitary, , and both and are unreduced upper Hessenberg. Then is diagonal unitary with first diagonal entry . Thus the two unitary transformations differ only by column phases. Over the phases are signs.
Facts & Assumptions
Given: as in the statement.
Upper Hessenberg matrices and real symmetric tridiagonal matrices: upper Hessenberg means entries below the first subdiagonal vanish. The nonzero subdiagonal entries are the explicit unreduced hypothesis in the statement.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: and are unitary, so is unitary.
Proof
Put , , and . Then and by direct multiplication and .
Write for column of . We prove by induction that is supported in its first coordinates. This holds for by step 1.1. If it holds through , the th column of gives . The vector is supported in rows because is upper Hessenberg, and are supported in their first coordinates. Since by unreducedness of , solving this equality for shows it is supported in rows .
Step 2.1 makes upper triangular. An upper-triangular unitary matrix is diagonal: its first column has only one nonzero entry of modulus one, orthogonality makes the rest of its first row zero, and induction applies to the trailing principal block. Since , the first diagonal entry is .
Depends on
Used by
Dependency tree · two levels
6 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
- James Demmel, Math 221 Lecture 16: The implicit Q theorem (standard reference, not scraped)
- David Bindel, CS 6210 Matrix Computations, Hessenberg QR iteration (standard reference, not scraped)