Jacobi matrix Created 2026-09-24 Updated 2026-11-05
A Jacobi matrix is a real symmetric tridiagonal matrix with positive off-diagonal entries. Its diagonal entries and off-diagonal entries encode the three-term recurrence of orthonormal polynomials:where and the term is omitted. In the orthonormal polynomial basis this is the matrix of multiplication by , truncated to finitely many basis vectors. Positivity of excludes a reducible split into independent blocks.[ref]
The determinant of the leading -by- block satisfies , with . Thus its eigenvalues are the zeros of orthogonal polynomials of degree . For unit weight on , the first two normalized polynomials give , whose eigenvalues are the two-node Gaussian quadrature nodes.
Use the standard convention that the orthogonal polynomials are nonzero. Their exact degrees then follow from the stated assumptions by induction: is a nonzero constant, and if span , a nonzero orthogonal to all of them cannot lie in .
Let be the distinct sign-changing roots of in , and put . Then has constant sign between and across all its roots, and is not identically zero. Because in the interior, is nonzero. If , orthogonality to would make this integral zero. Thus .
A degree- polynomial cannot have more than roots counted with multiplicity, so all roots are real, simple, and strictly inside . This is the standard zeros of orthogonal polynomials argument, with the positive weight ensuring strict noncancellation.
Let be the distinct roots in at which changes sign, and put . Both and change sign at each such point, while roots of even multiplicity do not change sign. Consequently has one constant sign on except at its zeros, and is not identically zero. Its integral cannot vanish.
If , however, orthogonality of the monic orthogonal polynomial to every polynomial of lower degree gives , a contradiction. Hence . Since , there must be exactly such roots, each of multiplicity one. They exhaust the degree, leaving no complex, exterior, or endpoint roots. Thus all roots are simple and lie strictly in , which proves the requested weaker inclusion in . This is the sign-change proof of the zeros of orthogonal polynomials theorem.
Roots of a Gegenbauer polynomial Created 2026-09-29 Updated 2026-11-05
For , all polynomial roots of are simple and lie in . To prove this, form using each interior sign-changing root exactly once. Then has one constant sign away from its finitely many zeros. If , orthogonality to every lower-degree polynomial would give , a contradiction. Thus there are distinct sign-changing roots, exhausting the degree of a polynomial and proving simplicity. Counting all roots with multiplicity at the outset would not prove this last step. This is the same mechanism as the general zeros of orthogonal polynomials theorem.