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.
The real Francis double-shift polynomial is real and annihilates its trailing block
Statement
Let , set , , and define . Then and . If , the roots are a nonreal conjugate pair , and for every real square matrix of positive dimension,
is real. This supplies the exact polynomial used by a real double-shift step; it asserts no convergence of the iteration.
Facts & Assumptions
Given: A real matrix and the scalars above.
Real and complex Schur forms: a real Schur block for a conjugate pair has negative characteristic-polynomial discriminant.
Proof
Direct expansion gives .
Direct multiplication gives , so subtracting and adding makes all four entries zero. Hence .
If , the quadratic formula gives roots and . Their product and sum are and , so . In the application where is a real Schur block for a conjugate pair, [F1] supplies exactly this negative-discriminant hypothesis; the statement's general algebraic case already assumes it. Since are real, is real.
Depends on
Used by
- Exact finite Francis single- or double-shift Hessenberg QR step Algorithm
- Finite-budget computed Francis Schur reduction with explicit statuses Algorithm
- A real Schur block represents a conjugate eigenvalue pair Example
- An exact Francis step terminates with unitary similarity and its stated status Lemma
- Under unreduced hypotheses, the Francis double-shift chase matches explicit shifted QR Lemma
Dependency tree · two levels
3 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 W. Demmel, Applied Numerical Linear Algebra, §4.4.8 (standard reference, not scraped)
- David Bindel, CS 6210 Matrix Computations, Hessenberg QR iteration (standard reference, not scraped)