Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Complex Hermitian Toeplitz bordering yields reflection coefficients and positive pivots

Statement

Let n≥1 and let Tn=(ti−j)0≤i,j<n be Hermitian positive definite, so t−r=tr‾. For 0≤k≤n, set Tk=(ti−j)0≤i,j<k, with T0 empty, and for 0≤k<n set gk=(t1,…,tk)T, with g0 empty. Define ϕ0 empty and ν0=t0. For each 0≤k≤n−2, let Jk reverse k coordinates, put ck=Jkgk‾, and set αk+1:=tk+1−ck∗ϕkνk,ϕk+1:=(ϕk−Jkϕk‾ αk+1αk+1),νk+1:=νk(1−∣αk+1∣2). Every denominator used is strictly positive; Tkϕk=gk and νk=t0−gk∗ϕk>0 for 0≤k<n. Computing through order n−1 takes O(n2) complex arithmetic operations and O(n) working storage. This is the complex matrix-bordering extension; the real ACVF forecast procedure remains Durbin–Levinson forecast recursion.

Facts & Assumptions

Given: A finite Hermitian positive-definite Toeplitz matrix Tn, its lags, and the displayed recursively defined vectors and scalars.

[F1]

The zero-based Toeplitz convention is (Tk)ij=ti−j, and Hermitian symmetry is t−r=tr‾. Toeplitz, circulant, and finite-index conventions for structured solvers

[F2]

A Hermitian positive-definite square matrix admits a Cholesky factorization with positive diagonal, and hence is invertible. A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique

Proof

1.1givenF1F2algebraconstruct

Each leading block Tk is positive definite: if y≠0 in Ck, append zeros to obtain y~≠0 in Cn; then y∗Tky=y~∗Tny~>0 by [F1]. Thus every nonempty Tk is invertible by [F2], and t0>0 by testing the first coordinate vector. The empty case has the stated empty solution.

2.1F1step 1.1algebra

Reversal is an involutive real permutation, so JkTJk=Ik. Reversal and Hermitian symmetry give JkTk‾Jk=Tk: its (i,j) entry is t(k−1−i)−(k−1−j)‾=tj−i‾=ti−j. Taking inverses also gives JkTk−1‾Jk=Tk−1, and the same identity implies TkJky‾=JkTky‾ for every y∈Ck.

2.2givenstep 1.1base

At order k=0, both T0ϕ0=g0 and ν0=t0−g0∗ϕ0 are the empty identity and t0>0 by step 1.1. This is the induction base.

2.3givenF1step 1.1algebra

For k=0, the formula gives α1=t1/t0 and ϕ1=(α1), so T1ϕ1=g1 directly.

3.1givenF1step 1.1step 2.1ihalgebra

Fix 1≤k≤n−2 and assume Tkϕk=gk, νk=t0−gk∗ϕk>0. By step 2.1 and Tkϕk=gk, Tk−1ck=Jkϕk‾. Since Tk is Hermitian and invertible, (Tk−1)∗=(Tk∗)−1=Tk−1, so gk∗ϕk=gk∗Tk−1gk=gk∗Tk−1gk‾ is real. Therefore ck∗Tk−1ck=(Jkgk‾)∗(Jkϕk‾)=gkTϕk‾=gk∗ϕk‾=gk∗ϕk. Thus the Schur pivot of Tk+1 after Tk is νk. It is positive by evaluating the positive quadratic form of Tk+1 at (−Tk−1ck,1)T.

4.1givenF1F3step 2.1step 3.1algebra

Fix 1≤k≤n−2. The first k rows of Tk+1ϕk+1=gk+1 follow from Tkϕk=gk and TkJkϕk‾=ck (step 2.1). The last row is ck∗ϕk+(t0−ck∗Tk−1ck)αk+1=tk+1 by the definition of αk+1 and the pivot identity in step 3.1. Thus Tk+1ϕk+1=gk+1.

5.1givenF1F3step 1.1step 2.1step 2.3step 4.1algebra

For every update 0≤k≤n−2, expansion gives gk+1∗ϕk+1=gk∗ϕk+αk+1(tk+1−ck∗ϕk)‾=gk∗ϕk+νk∣αk+1∣2, since νk is real; hence νk+1=t0−gk+1∗ϕk+1. By step 2.3 when k=0 and step 4.1 when k≥1, Tk+1ϕk+1=gk+1. Set ck+1=Jk+1gk+1‾; step 2.1 gives Tk+1−1ck+1=Jk+1ϕk+1‾, and Hermitian symmetry gives ck+1∗Tk+1−1ck+1=gk+1∗ϕk+1. Thus νk+1 is the Schur complement of Tk+1 in Tk+2. This leading block is HPD by step 1.1; evaluating its quadratic form at (−Tk+1−1ck+1,1)T proves νk+1>0, including the terminal case k+2=n.

6.1givenstep 2.3step 4.1step 5.1algebradischarge-induction∎

At stage k, one inner product and one vector update use O(k+1) operations; summing these costs over 0≤k≤n−2 gives O(n2). The input lags and current and next coefficient vectors require O(n) storage, and no earlier coefficient vector is needed after its update.

Depends on

Used by

Dependency tree · two levels

14 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