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 displacement structured solvers — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite Probability Spaces and Random Variables
- Finite-history linear prediction
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Stationary means and sample autocovariance
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Toeplitz circulant and displacement structured solvers
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples keep the real covariance prediction calculation distinct from the complex-capable general-right-hand-side Toeplitz solve, demonstrate the constant null mode and compatibility condition for a periodic Poisson circulant, and show why an invertible indefinite Toeplitz matrix can trigger the solver's nonpositive-pivot status.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The periodic Poisson circulant has one compatible zero mode
Statement
For each , let be the periodic cycle Laplacian circulant generated by , , , and otherwise. With , its Fourier eigenvalues are . Exactly vanishes, so is solvable exactly when ; on the zero-mean subspace the solution is unique. For and , the solution is .
Facts & Assumptions
Given: The circulant convention, canonical DFT, and complex exponential used in the Statement.
The circulant generated by has entries , and the canonical DFT has negative-sign entries . Toeplitz, circulant, and finite-index conventions for structured solvers The unitary discrete Fourier transform on
Circulants are diagonalized by the canonical DFT with eigenvalues ; compatibility is equivalent to vanishing of the transformed right-hand side at each zero eigenvalue. The canonical finite DFT diagonalizes every circulant
The complex exponential satisfies , for real , and exactly when . , , and , and the complex exponential extends the real exponential , and exactly when
The complex numbers form a field, so a square of a complex number vanishes only when the number vanishes. is a field, every element is uniquely , and every nonzero element has inverse
Proof
By [F1]–[F2], the th eigenvalue of this generator is Since by [F3], , giving the stated symbol.
Put . It is nonzero by [F3], and where the middle equivalence follows after multiplying by , and the last uses [F4]. By the exponential kernel characterization in [F3], exactly when , equivalently is an integer. For this means . Thus only the constant Fourier mode is a zero mode.
At , . Hence [F2] gives solvability precisely when . All nonzero modes then determine uniquely, while the zero-mode coordinate is free; imposing fixes that coordinate to zero, proving uniqueness on the zero-mean subspace.
When , , so the addition law gives and . Euler's identity gives , hence . Since , this implies , and the symbol from step 1.1 gives . The vector has sum zero. Directly, each cyclic neighbor of is , so . Therefore solves , and its zero mean gives the unique zero-mean solution.
The compatibility condition is exactly orthogonality to the constant null mode, and division is only performed on the nonzero Fourier modes. The concrete vector verifies the normalization directly.
An invertible indefinite Toeplitz matrix triggers the pivot-failure branch
Statement
For the Hermitian Toeplitz matrix the general-RHS solver reports a nonpositive second pivot, even though is invertible. The status records that the solver's HPD domain condition failed; it does not claim that the indefinite system has no solution.
Facts & Assumptions
Given: The matrix above and the exact-arithmetic failure rules of General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul.
A square Toeplitz matrix has entries constant on each diagonal, and Hermitian positive definiteness requires for every nonzero . Toeplitz, circulant, and finite-index conventions for structured solvers
The algorithm initializes and returns nonpositive-pivot when a computed pivot is nonpositive. General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul
Proof
The matrix is Hermitian Toeplitz with and . Direct multiplication gives so is invertible. For , , hence it is not positive definite by [F1].
The solver starts with , computes and then . Since this pivot is nonpositive, [F2] returns nonpositive-pivot before constructing an inverse-column denominator.
An AR(1) covariance forecast and general-RHS Toeplitz solve
Statement
Assume a real, mean-zero, weakly stationary process satisfies the causal AR(1) model in , where is centered with variance , is uncorrelated with for every , and the process is weakly stationary. Here “AR(1)” means precisely this first-order autoregression; the stated uncorrelatedness is the innovation orthogonality used below. Then its autocovariance function (ACVF) is . The order-two Durbin–Levinson output is and . Separately, for and , the general-RHS Hermitian Toeplitz solver returns by the Gohberg–Semencul formula.
Facts & Assumptions
Given: The process and innovation hypotheses in the Statement, the Durbin–Levinson covariance-input procedure, and the exact Hermitian Toeplitz solver.
Weak stationarity supplies a constant mean and an ACVF depending only on lag. Strict and weak stationarity for integer-indexed time series Autocovariance and sample autocovariance
Covariance is symmetric and bilinear for finite linear combinations of square-integrable variables. Moments, variance, and covariance on a probability space Variance and covariance identities for random variables
The real Durbin–Levinson recursion computes from when the leading covariance blocks are positive definite. Durbin–Levinson forecast recursion
Under those leading-block hypotheses, solves the prediction equations and . Durbin–Levinson solves the successive prediction equations
The Hermitian Toeplitz solver constructs the endpoint inverse columns and applies the exact Gohberg–Semencul formula. General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul The Hermitian positive-definite Gohberg–Semencul formula is exact and quadratic
Proof
Centering and weak stationarity give and for every . From the autoregression and innovation orthogonality, so .
For the separate general-RHS solve, set as in the Statement. For each nonzero , , so is Hermitian positive definite. Its first lag data are , hence , , and . The endpoint columns from [F5] are The lower triangular Toeplitz products are Therefore the formula in [F5] gives Direct multiplication also verifies .
For each integer , covariance bilinearity and give Induction yields for ; covariance symmetry gives .
The order-one recursion gives , and . At order two, so and . By steps 1.1 and 2.1, and . Step 1.2 proves Hermitian positive definite, so the real leading covariance blocks are positive definite; [F3] applies and [F4] identifies this vector as the unique prediction solution.
The first calculation reuses the published real covariance prediction recursion, while the second is a distinct arbitrary-right-hand-side Hermitian Toeplitz solve; the computed vector satisfies its stated system.
Sources
- Ralf Hiptmair, Numerical Methods for Computational Science and Engineering, Lecture Document, §§4.2.1 and 4.5.1
- Ralf Hiptmair, Numerical Methods for Computational Science and Engineering, Lecture Document, §4.5.3
- MIT OpenCourseWare 6.341, Discrete-Time Signal Processing, Lecture 13: The Levinson-Durbin Recursion