In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev (Пафнутий Чебышёв), are a sequence of orthogonal polynomials which are related to de Moivre's formula and which are easily defined recursively, like Fibonacci or Lucas numbers. One usually distinguishes between Chebyshev polynomials of the first kind which are denoted T_n and Chebyshev polynomials of the second kind which are denoted U_n. The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebyshef or Tschebyscheff.

The Chebyshev polynomials T_n or U_n are polynomials of degree n and the sequence of Chebyshev polynomials of either kind composes a polynomial sequence.

Chebyshev polynomials are important in approximation theory because the roots of the Chebyshev polynomials of the first kind, which are also called Chebyshev nodes, are used as nodes in polynomial interpolation. The resulting interpolation polynomial minimizes the problem of Runge's phenomenon and provides the best approximation to a continuous function under the maximum norm.

In the study of differential equations they arise as the solution to the Chebyshev differential equation

for the polynomials of the first and second kind, respectively. These equations are special cases of the Sturm-Liouville differential equation.

Definition

The Chebyshev polynomials of the first kind are defined by the recurrence relation

One example of a generating function for this recurrence relation is

The Chebyshev polynomials of the second kind are defined by the recurrence relation

One example of a generating function for this recurrence relation is

Trigonometric definition

The Chebyshev polynomials of the first kind can be defined by the trigonometric identity

for n = 0, 1, 2, 3, .... . That cos(nx) is an nth-degree polynomial in cos(x) can be seen by observing that cos(nx) is the real part of one side of De Moivre's formula, and the real part of the other side is a polynomial in cos(x) and sin(x), in which all powers of sin(x) are even and thus replaceable via the identity cos²(x) + sin&sup2(x) = 1.

Written explicitly

Similarly, the polynomials of the second kind satisfy

Orthogonality

Both the T_n and the U_n form a sequence of orthogonal polynomials. The polynomials of the first kind are orthogonal with respect to the weight

on the interval [−1,1], i.e. we have:

This can be proven by letting x= cos(θ) and using the identity T_n (cos(θ))=cos(nθ). Similarly, the polynomials of the second kind are orthogonal with respect to the weight

on the interval [−1,1], i.e. we have:

(which, when normalized to form a probability measure, is the Wigner semicircle distribution).

Other properties

The Chebyshev polynomials of the first and second kind are closely related by the following equations

The Chebyshev polynomials are a special case of the ultraspherical or Gegenbauer polynomials , which themselves are a special case of the Jacobi polynomials .

Examples

The first few Chebyshev polynomials of the first kind are

The first few Chebyshev polynomials of the second kind are

Polynomial in Chebyshev form

A polynomial of degree N in Chebyshev form is a polynomial p(x) of the form

where T_n is the nth Chebyshev polynomial.

Polynomials in Chebyshev form can be evaluated using the Clenshaw algorithm.

Chebyshev roots

A Chebyshev polynomial of either kind with degree n has n different simple roots, called Chebyshev roots, in the interval [-1,1]. The roots are sometimes called Chebyshev nodes because they are used as nodes in polynomial interpolation. Using the trigonometric form one can easily prove that the roots of T_n are

Similarly, the roots of U_n are

See also

• Chebyshev nodes
• Chebyshev filter
• Legendre polynomials
• Hermite polynomials

References

• M. Abramowitz and I. A. Stegun, eds. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Chapter 22. New York: Dover, 1972.