Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 0. A rectangular Toeplitz matrix T∈Cm×n, where m,n≥1, is specified by lags tr∈C for −(n−1)≤r≤m−1 and has entries Tij:=ti−j(0≤i<m, 0≤j<n). For a square matrix T∈Cn×n, Hermitian Toeplitz means t−r=tr‾ for 0≤r<n. It is positive definite when x∗Tx>0 for every nonzero x∈Cn, where x∗:=x‾ T and the product is the matrix product of Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes.

For N≥1, a vector c=(c0,…,cN−1)T∈CN generates the circulant matrix C(c)ij:=c(i−j) mod N(0≤i,j<N). For n≥1 and 0≤j<n, let ej∈Cn be the coordinate vector with (ej)i=1 when i=j and 0 otherwise. For a∈Cn, Jna is the reversed vector, (Jna)i=an−1−i; J0 is the unique map on the empty vector. The lower-triangular Toeplitz matrix of a is L(a)∈Cn×n with L(a)ij=ai−j when i≥j, and 0 otherwise. The canonical unitary DFT is the map FN of The unitary discrete Fourier transform on Z/NZ; the unnormalised DFT used for operation counts is DN:=N FN.

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

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