Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Toeplitz circulant and displacement structured solvers — Examples

1 · Prerequisites

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

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The periodic Poisson circulant has one compatible zero mode

Statement

For each N≥3, let CN=C(c) be the periodic cycle Laplacian circulant generated by c0=2, c1=−1, cN−1=−1, and cj=0 otherwise. With ω=e−2πi/N, its Fourier eigenvalues are λk=2−ωk−ω−k. Exactly λ0 vanishes, so CNx=f is solvable exactly when ∑j=0N−1fj=0; on the zero-mean subspace the solution is unique. For N=4 and f=(1,−1,1,−1)T, the solution is x=f/4.

Facts & Assumptions

Given: The circulant convention, canonical DFT, and complex exponential used in the Statement.

[F1]

The circulant generated by c has entries c(i−j) mod N, and the canonical DFT has negative-sign entries N−1/2e−2πikj/N. Toeplitz, circulant, and finite-index conventions for structured solvers The unitary discrete Fourier transform on Z/NZ

[F2]

Circulants are diagonalized by the canonical DFT with eigenvalues ∑jcje−2πikj/N; compatibility is equivalent to vanishing of the transformed right-hand side at each zero eigenvalue. The canonical finite DFT diagonalizes every circulant

[F4]

The complex numbers form a field, so a square of a complex number vanishes only when the number vanishes. C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)

Proof

1.1givenF1F2F3algebra

By [F1]–[F2], the kth eigenvalue of this generator is λk=2−ωk−ωk(N−1). Since ωN=exp⁡(−2πi)=1 by [F3], ωk(N−1)=ω−k, giving the stated symbol.

2.1givenF3F4step 1.1algebra

Put z=ωk. It is nonzero by [F3], and λk=0  ⟺  z+z−1=2  ⟺  (z−1)2=0  ⟺  z=1, where the middle equivalence follows after multiplying by z, and the last uses [F4]. By the exponential kernel characterization in [F3], ωk=1 exactly when −2πik/N∈2πiZ, equivalently k/N is an integer. For 0≤k<N this means k=0. Thus only the constant Fourier mode is a zero mode.

3.1F1F2step 2.1algebra

At k=0, (FNf)0=N−1/2∑jfj. Hence [F2] gives solvability precisely when ∑jfj=0. All nonzero modes then determine FNx uniquely, while the zero-mode coordinate is free; imposing ∑jxj=0 fixes that coordinate to zero, proving uniqueness on the zero-mean subspace.

3.2givenF1F3step 1.1step 2.1algebra

When N=4, ω=exp⁡(−πi/2), so the addition law gives ω2=exp⁡(−πi) and exp⁡(−πi)exp⁡(πi)=1. Euler's identity gives exp⁡(πi)=−1, hence ω2=−1. Since ω≠0, this implies ω−1=−ω, and the symbol from step 1.1 gives (λ0,λ1,λ2,λ3)=(0,2,4,2). The vector f=(1,−1,1,−1)T has sum zero. Directly, each cyclic neighbor of fj is −fj, so (C4f)j=2fj−(−fj)−(−fj)=4fj. Therefore x=f/4 solves C4x=f, and its zero mean gives the unique zero-mean solution.

4.1step 3.1step 3.2algebra∎

The compatibility condition is exactly orthogonality to the constant null mode, and division is only performed on the nonzero Fourier modes. The concrete N=4 vector verifies the normalization directly.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An invertible indefinite Toeplitz matrix triggers the pivot-failure branch

Statement

For the Hermitian Toeplitz matrix T=(1221), the general-RHS solver reports a nonpositive second pivot, even though T 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 T above and the exact-arithmetic failure rules of General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul.

[F1]

A square Toeplitz matrix has entries constant on each diagonal, and Hermitian positive definiteness requires x∗Tx>0 for every nonzero x. Toeplitz, circulant, and finite-index conventions for structured solvers

[F2]

The algorithm initializes ν0=t0 and returns nonpositive-pivot(k) when a computed pivot is nonpositive. General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul

Proof

1.1givenF1algebra

The matrix is Hermitian Toeplitz with t0=1 and t1=t−1=2. Direct multiplication gives T(−13(1−2−21))=I2, so T is invertible. For z=(1,−1)T, z∗Tz=−2<0, hence it is not positive definite by [F1].

2.1givenF2step 1.1algebra∎

The solver starts with ν0=1, computes α1=t1/ν0=2 and then ν1=ν0(1−∣α1∣2)=−3. Since this pivot is nonpositive, [F2] returns nonpositive-pivot(1) before constructing an inverse-column denominator.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An AR(1) covariance forecast and general-RHS Toeplitz solve

Statement

Assume a real, mean-zero, weakly stationary process Xt satisfies the causal AR(1) model Xt=12Xt−1+εt in L2, where εt is centered with variance 3/4, is uncorrelated with Xs for every s<t, 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 γ(h)=2−∣h∣. The order-two Durbin–Levinson output is ϕ2=(1/2,0)T and ν2=3/4. Separately, for T=(11/21/21) and b=(1,1)T, the general-RHS Hermitian Toeplitz solver returns T−1b=(2/3,2/3)T 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.

[F1]

Weak stationarity supplies a constant mean and an ACVF γ(h)=Cov⁡(Xt+h,Xt) depending only on lag. Strict and weak stationarity for integer-indexed time series Autocovariance and sample autocovariance

[F2]

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

[F3]

The real Durbin–Levinson recursion computes ϕk,νk from γ(0),…,γ(k) when the leading covariance blocks are positive definite. Durbin–Levinson forecast recursion

[F4]

Under those leading-block hypotheses, ϕk solves the prediction equations and νk=γ(0)−rkTϕk. Durbin–Levinson solves the successive prediction equations

[F5]

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

1.1givenF1F2algebra

Centering and weak stationarity give E[Xt]=0 and γ(0)=Var⁡(Xt) for every t. From the autoregression and innovation orthogonality, γ(0)=Var⁡(12Xt−1+εt)=14γ(0)+34, so γ(0)=1.

1.2givenF5algebra

For the separate general-RHS solve, set T=(11/21/21) as in the Statement. For each nonzero z∈C2, z∗Tz=∣z1+z2/2∣2+3∣z2∣2/4>0, so T is Hermitian positive definite. Its first lag data are t0=1,t1=1/2, hence α1=t1/t0=1/2, ϕ1=α1=1/2, and ν1=t0(1−∣α1∣2)=3/4. The endpoint columns from [F5] are v=(−2/3,4/3)T,u=J2v=(4/3,−2/3)T,u0=4/3>0. The lower triangular Toeplitz products are L(u)L(u)∗=(16/9−8/9−8/920/9),L(Z2v)L(Z2v)∗=(0004/9). Therefore the formula in [F5] gives T−1=(4/3−2/3−2/34/3),T−1b=(2/3,2/3)T. Direct multiplication also verifies T(2/3,2/3)T=(1,1)T.

2.1givenF1F2step 1.1induction

For each integer h≥1, covariance bilinearity and Cov⁡(εt,Xt−h)=0 give γ(h)=Cov⁡(Xt,Xt−h)=12γ(h−1). Induction yields γ(h)=2−h for h≥0; covariance symmetry gives γ(−h)=γ(h).

3.1givenF3F4step 1.1step 1.2step 2.1algebra

The order-one recursion gives κ1=γ(1)/γ(0)=1/2, ϕ1=(1/2) and ν1=1(1−1/4)=3/4. At order two, κ2=γ(2)−ϕ1,1γ(1)ν1=1/4−(1/2)(1/2)3/4=0, so ϕ2=(ϕ1,1−κ2ϕ1,1,κ2)T=(1/2,0)T and ν2=ν1(1−κ22)=3/4. By steps 1.1 and 2.1, Γ1=[1] and Γ2=T. Step 1.2 proves T Hermitian positive definite, so the real leading covariance blocks are positive definite; [F3] applies and [F4] identifies this vector as the unique prediction solution.

4.1step 3.1step 1.2algebra∎

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