= Roots of a Gegenbauer polynomial
{c}
For $\alpha>0$, all $n$ <polynomial roots> of $C_n^\alpha$ are simple and lie in $(-1,1)$. To prove this, form $q$ using each interior sign-changing root exactly once. Then $C_n^\alpha q$ has one constant sign away from its finitely many zeros. If $\deg q<n$, <orthogonality> to every lower-degree <polynomial> would give $\int_{-1}^1 C_n^\alpha q\,(1-x^2)^{\alpha-1/2}\,dx=0$, a contradiction. Thus there are $n$ 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.
Back to article page