Chebyshev Polynomials

Manuel Eberl 📧

November 13, 2023

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

The multiple-angle formulas for cos and sin state that for any natural number n, the values of cosnx and sinnx can be expressed in terms of cosx and sinx. To be more precise, there are polynomials Tn and Un such that cosnx=Tn(cosx) and sinnx=Un(cosx)sinx. These are called the Chebyshev polynomials of the first and second kind, respectively.

This entry contains a definition of these two familes of polynomials in Isabelle/HOL along with some of their most important properties. In particular, it is shown that Tn and Un are orthogonal families of polynomials.

Moreover, we show the well-known result that for any monic polynomial p of degree n>0, it holds that supx[1,1]|p(x)|2n1, and that this inequality is sharp since equality holds with p=21nTn. This has important consequences in the theory of function interpolation, since it implies that the roots of Tn (also colled the Chebyshev nodes) are exceptionally well-suited as interpolation nodes.

License

BSD License

Topics

Session Chebyshev_Polynomials