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.
Real and complex Schur forms
Definition
Let be or , let and , and let denote transpose over and conjugate transpose over . A complex Schur pair for is a pair with and , where is upper triangular.
For real , a real Schur pair is a pair with and , where is block upper triangular and every diagonal block is either a real block or a real block with negative characteristic-polynomial discriminant. Such a block has one nonreal conjugate eigenvalue pair. The definition does not assert that a finite shift strategy reaches such a pair.
For , its characteristic-polynomial discriminant means the exact real number . “Negative discriminant” means the exact comparison .
Depends on
Used by
- Finite Schur–Parlett recurrence with block merging and inconclusive statuses Algorithm
- Finite-budget Bartels-Stewart solve for a Sylvester equation Algorithm
- Finite-budget computed Francis Schur reduction with explicit statuses Algorithm
- Finite-budget stable block reordering for Schur and QZ forms Algorithm
- Principal matrix logarithm and square root by branch-aware Schur–Parlett Algorithm
- A real Schur block represents a conjugate eigenvalue pair Example
- The real Francis double-shift polynomial is real and annihilates its trailing block Lemma
- Under unreduced hypotheses, the Francis double-shift chase matches explicit shifted QR Lemma
- Finite Francis procedure terminates with explicit statuses and verifies its Schur pattern on success Theorem
Dependency tree · two levels
7 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 (standard reference, not scraped)
- David Bindel, CS 6210 Matrix Computations, Hessenberg QR iteration (standard reference, not scraped)