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.
Toeplitz, circulant, and finite-index conventions for structured solvers
Definition
All vector and matrix indices below start at . A rectangular Toeplitz matrix , where , is specified by lags for and has entries For a square matrix , Hermitian Toeplitz means for . It is positive definite when for every nonzero , where and the product is the matrix product of Rectangular matrix multiplication and the identity matrix , including zero-sized shapes.
For , a vector generates the circulant matrix For and , let be the coordinate vector with when and otherwise. For , is the reversed vector, ; is the unique map on the empty vector. The lower-triangular Toeplitz matrix of is with when , and otherwise. The canonical unitary DFT is the map of The unitary discrete Fourier transform on ; the unnormalised DFT used for operation counts is .
These conventions specify matrix orientation, conjugation, normalization, and boundary indexing; in particular, circulant eigenvalues below use the negative-sign canonical DFT.
Depends on
Used by
- General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul Algorithm
- Lower-shift displacement rank and generator pairs Definition
- An invertible indefinite Toeplitz matrix triggers the pivot-failure branch Example
- The periodic Poisson circulant has one compatible zero mode Example
- A Toeplitz matrix has lower-shift displacement rank at most two Lemma
- Complex Hermitian Toeplitz bordering yields reflection coefficients and positive pivots Lemma
- The canonical finite DFT diagonalizes every circulant Proposition
- A zero-padded circulant embedding computes a Toeplitz product in O(N log N) Theorem
- The Hermitian positive-definite Gohberg–Semencul formula is exact and quadratic Theorem
Dependency tree · two levels
21 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
- Ralf Hiptmair, Numerical Methods for Computational Science and Engineering, Lecture Document, §§4.2.1 and 4.5.1 (standard reference, not scraped)
- Daniel Kressner and Robert Luce, Fast computation of the matrix exponential for a Toeplitz matrix, §2 (standard reference, not scraped)