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.
Lower-shift displacement rank and generator pairs
Definition
For , , let be the lower shift with for and all other entries zero. Its lower-shift (Stein) displacement is The displacement rank of with respect to this fixed shift is . A pair of matrices is a generator of width when Such a factorization is a representation of the displacement, not a factorization of itself. The term Toeplitz-like refers to matrices whose displacement rank is small relative to ; the rank bound must be specified rather than unrestricted. For a family of growing dimensions, a uniform bound means that is independent of . This definition makes no conditioning, pivot-growth, or numerical-stability assertion.
Depends on
Used by
- General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul Algorithm
- A Toeplitz matrix has lower-shift displacement rank at most two Lemma
- One exact scalar elimination step updates a displacement generator Lemma
- The Hermitian positive-definite Gohberg–Semencul formula is exact and quadratic Theorem
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
- Daniel Kressner and Robert Luce, Fast computation of the matrix exponential for a Toeplitz matrix, §2.1 (standard reference, not scraped)