Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Consecutive Gaussian orthogonal polynomials and Jacobi truncations strictly interlace

Statement

Let (a,b,m,r,μ) be Gaussian moment data with r≥2m−1 and monic orthogonal polynomials p0,…,pm. For every 1≤j<m, write the roots of pj as x1<⋯<xj and those of pj+1 as y1<⋯<yj+1. Then a<y1<x1<y2<x2<⋯<yj<xj<yj+1<b. Equivalently, the spectra of consecutive leading principal Jacobi truncations Jj,Jj+1 strictly interlace. If m=1, there is no pair of positive consecutive degrees and the assertion is vacuous.

Facts & Assumptions

Given: The moment data and its monic orthogonal family.

[F1]

Positive-measure Gaussian quadrature moment data and Monic orthogonal polynomials exist uniquely through the quadrature order permit the same measure at each smaller quadrature order k≤m, retaining moments through 2k−1; uniqueness identifies each shorter orthogonal family with the prefix p0,…,pk.

[F2]

The Gauss orthogonal polynomial has simple roots inside the interval gives k simple roots in (a,b) and the monic factorization of pk for each 1≤k≤m.

[F3]

Monic orthogonal polynomials satisfy a three-term recurrence gives pj+1(X)=(X−αj)pj(X)−βjpj−1(X) with βj>0 for 1≤j<m, and p0=1.

[F5]

The reals form a totally ordered field gives the sign rules for the finite products in the monic factorization.

[F6]

The Jacobi matrix spectrum is the set of Gauss nodes identifies the spectrum of Jk with the roots of pk; its coefficients are the same prefix recurrence coefficients.

Proof

1.1givenF1F2F3F4F5algebra

The reduced-order uses in [F1] are valid: the original support has at least m+1≥k+1 points and the absolute moments through 2k−1 are among those assumed. By [F2], every pk has the stated simple roots and monic factorization. If m=1, there is no pair to prove. For the remaining case m≥2, take j=1; if x1 is the root of p1, [F3] gives p2(x1)=−β1<0. At both a and b, the degree-two monic factorization [F2] gives p2(a)>0 and p2(b)>0. By [F4] there is one root on each side of x1 inside (a,b), proving the first pair when m≥2.

1.2F2F3F4F5givenalgebra

For 2≤j<m, assume the roots of pj−1 strictly interlace those x1<⋯<xj of pj. At xi, exactly j−i roots of the monic polynomial pj−1 lie to its right and none equals it. Its factorization [F2] therefore makes its sign (−1)j−i. By [F3], the sign of pj+1(xi)=−βjpj−1(xi) is (−1)j−i+1. These signs alternate, so [F4] supplies a root in each (xi,xi+1). Also [F2] gives sign (−1)j+1 for pj+1(a) and positive sign for pj+1(b); these are opposite to the signs (−1)j at x1 and −1 at xj. Thus [F4] supplies an additional root in each of (a,x1) and (xj,b).

2.1F1F2F6step 1.1step 1.2inductionalgebra∎

These j+1 disjoint intervals contain j+1 distinct roots, and [F2] says there are exactly that many. They therefore exhaust the roots of pj+1 in the required order. Starting with step 1.1, finite induction through step 1.2 proves every pair through pm. By [F6], the same ordered roots are the eigenvalues of the leading principal truncations, since their recurrence coefficients are identical prefixes. This proves the spectral assertion as well; when m=1 the quantified pair set is empty.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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