# Chebyshev polynomials

Template:Distinguish
In mathematics the **Chebyshev polynomials**, named after Pafnuty Chebyshev,^{[1]} are a sequence of orthogonal polynomials which are related to de Moivre's formula and which can be defined recursively. 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 *Tchebycheff*, *Tchebyshev* (French) or *Tschebyschow* (German).

The Chebyshev polynomials *T*_{n} or *U*_{n} are polynomials of degree Template:Mvar and the sequence of Chebyshev polynomials of either kind composes a polynomial sequence.

Chebyshev polynomials are polynomials with the largest possible leading coefficient, but subject to the condition that their absolute value on the interval Template:Closed-closed is bounded by 1. They are also the extremal polynomials for many other properties.^{[2]}

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 an approximation that is close to the polynomial of best approximation to a continuous function under the maximum norm. This approximation leads directly to the method of Clenshaw–Curtis quadrature.

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

and

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

## Contents

## Definition

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

The ordinary generating function for *T*_{n} is

the exponential generating function is

The generating function relevant for 2-dimensional potential theory and multipole expansion is

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

The ordinary generating function for *U*_{n} is

the exponential generating function is

### Trigonometric definition

The Chebyshev polynomials of the first kind can be defined as the unique polynomials satisfying

or, in other words, as the unique polynomials satisfying

for *n* = 0, 1, 2, 3, ... which is a variant (equivalent transpose) of Schröder's equation,
viz. *T _{n}*(

*x*) is functionally conjugate to

*nx*, codified in the nesting property below. Further compare to the spread polynomials, in the section below.

The polynomials of the second kind satisfy:

which is structurally quite similar to the Dirichlet kernel :

That cos(*nx*) is an *n*th-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 through the identity cos^{2}(*x*) + sin^{2}(*x*) = 1.

This identity is quite useful in conjunction with the recursive generating formula, inasmuch as it enables one to calculate the cosine of any integral multiple of an angle solely in terms of the cosine of the base angle.

Evaluating the first two Chebyshev polynomials,

and

one can straightforwardly determine that

and so forth.

Two immediate corollaries are the *composition identity* (or **nesting property** specifying a semigroup)

and the expression of complex exponentiation in terms of Chebyshev polynomials: given *z* = *a* + *bi*,

### Pell equation definition

The Chebyshev polynomials can also be defined as the solutions to the Pell equation

in a ring R[*x*].^{[3]} Thus, they can be generated by the standard technique for Pell equations of taking powers of a fundamental solution:

### Products of Chebyshev polynomials

When working with Chebyshev polynomials quite often products of two of them occur. These products can be reduced to combinations of Chebyshev polynomials with lower or higher degree and concluding statements about the product are easier to make. It shall be assumed that in the following the index m is greater than or equal to the index n and n is not negative. For Chebyshev polynomials of the first kind the product expands to

which is an analogy to the addition theorem with the identities For n=1 this results in the already known recurrence formula, just arranged differently, and with n=2 it forms the recurrence relation for all even or all odd Chebyshev polynomials (depending on the parity of the lowest m) which allows to design functions with prescribed symmetry properties. Three more useful formulas for evaluating Chebyshev polynomials can be concluded from this product expansion:

For Chebyshev polynomials of the second kind products may be written as:

By this, like above, with n=2 the recurrence formula of Chebyshev polynomials of the second kind forms for both types of symmetry to

## Relation between Chebyshev polynomials of the first and second kinds

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

The recurrence relationship of the derivative of Chebyshev polynomials can be derived from these relations

This relationship is used in the Chebyshev spectral method of solving differential equations.

Equivalently, the two sequences can also be defined from a pair of **mutual recurrence** equations:

These can be derived from the trigonometric formulae; for example, if , then

Note that both these equations and the trigonometric equations take a simpler form if we, like some works, follow the alternate convention of denoting our *U*_{n} (the polynomial of degree *n*) with *U*_{n+1} instead.

Turán's inequalities for the Chebyshev polynomials are

The integral relations are

where integrals are considered as principal value.

## Explicit expressions

Different approaches to defining Chebyshev polynomials lead to different explicit expressions such as: