Trigonometry/For Enthusiasts/Chebyshev Polynomials
This page was imported from Wikipedia. It needs extensive modification to make it suitable for a textbook. We wish to highlight how to calculate Chebyshev Polynomials and how to use them for function approximations on [0,1] 
The Chebyshev polynomials, named after Pafnuty Chebyshev,^{[1]} are a sequence of polynomials related to the trigonometric multiangle formulae.
We usually distinguish between
 Chebyshev polynomials of the first kind, denoted T_{n} and are closely related to and
 Chebyshev polynomials of the second kind, denoted U_{n} which are closely related to
The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebycheff (French) or Tschebyschow (German).
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'.
Contents
Examples[edit]
The first few Chebyshev polynomials of the first kind are
The first few Chebyshev polynomials of the second kind are
Definition of T_{n}(x)[edit]
There are many alternative ways to define T_{n}(x) which lead to the same polynomials. The definition we'll use for T_{n}(x) is:
In other words, T_{n}(x) is the polynomial that expresses in terms of .
For example:
comes directly from:
Using this definition the recurrence relationship for Chebyshev polynomials follows immediately:
The recurrence comes from the relation:
Which is a rearrangement of a relation derived from the addition formula for cosines:
a special case where of
That we saw with beat frequencies when adding two waves together.
Uses[edit]
If approximating some function on the interval one can use a polynomial approximation like:
to approximate its values. Because is between 0 and 1 the terms get smaller from left to right. With a sufficiently large number of terms, usually more than we have here, we can typically get very good approximations to well behaved functions. In the example we've truncated the series at the fourth term and are ignoring terms of and higher.
In the example polynomial above the actual numbers are just made up numbers, as an example, and have no special significance  in case you are wondering why those particular numbers were used.
It turns out that truncating a series is in a certain sense not the best possible way to approximate the original function's actual values with a polynomial of degree three. A more complex but better way uses Chebyshev polynomials.
If instead we can express the function as:
where are constants then if we truncate this series at the fourth term, i.e T_{3}, we again have a polynomial with no terms or higher. After we've expanded it out and collected the coefficients together, the coefficients will not generally be the same as when just truncating the series. It may sound crazy, so a worked example can show this more clearly.
Worked Example: Expansion of (2x)^{1}
A quick check... does this formula look reasonable? Put and we get . Put and we get
The formula looks reasonable. If we go to just four terms the error at is .

Chebyshev polynomials are important in approximation theory because the roots of the Chebyshev polynomials T_{n}, 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.
below this box needs paring back a lot 
Explicit formulas[edit]
Different approaches to defining Chebyshev polynomials lead to different explicit formulas such as:
where is a hypergeometric function.
Uses[edit]
Chebyshev polynomials are important in approximation theory because the roots of the Chebyshev polynomials T_{n}, 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.
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.
Definition[edit]
The Chebyshev polynomials of the first kind are defined by the recurrence relation
The conventional generating function for T_{n} is
The exponential generating function is
The Chebyshev polynomials of the second kind are defined by the recurrence relation
One example of a generating function for U_{n} is
Trigonometric definition[edit]
The Chebyshev polynomials of the first kind can be defined by the trigonometric identity:
whence:
for n = 0, 1, 2, 3, ..., while the polynomials of the second kind satisfy:
which is structurally quite similar to the Dirichlet kernel :
That cos(nx) is an nthdegree 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^{2}(x) + sin^{2}(x) = 1.
This identity is extremely 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. To trivially check whether the results seem reasonable, sum the coefficients on both sides of the equals sign (that is, setting equal to zero, for which the cosine is unity), and one sees that 1 = 2 − 1 in the former expression and 1 = 4 − 3 in the latter.
Two immediate corollaries are the composition identity (or the "nesting property")
and the expression of complex exponentiation in terms of Chebyshev polynomials: given z = a + bi,
Pell equation definition[edit]
The Chebyshev polynomials can also be defined as the solutions to the Pell equation
in a ring R[x].^{[2]} Thus, they can be generated by the standard technique for Pell equations of taking powers of a fundamental solution:
Relation between Chebyshev polynomials of the first and second kinds[edit]
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.
Properties[edit]
Roots and extrema[edit]
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 definition and the fact that
one can easily prove that the roots of T_{n} are
Similarly, the roots of U_{n} are
One unique property of the Chebyshev polynomials of the first kind is that on the interval −1 ≤ x ≤ 1 all of the extrema have values that are either −1 or 1. Thus these polynomials have only two finite critical values, the defining property of Shabat polynomials. Both the first and second kinds of Chebyshev polynomial have extrema at the endpoints, given by:
Differentiation and integration[edit]
The derivatives of the polynomials can be less than straightforward. By differentiating the polynomials in their trigonometric forms, it's easy to show that:
The last two formulas can be numerically troublesome due to the division by zero (0/0 indeterminate form, specifically) at x = 1 and x = −1. It can be shown that:
The second derivative of the Chebyshev polynomial of the first kind is
which, if evaluated as shown above, poses a problem because it is indeterminate at x = ±1. Since the function is a polynomial, (all of) the derivatives must exist for all real numbers, so the taking to limit on the expression above should yield the desired value:
where only is considered for now. Factoring the denominator:
Since the limit as a whole must exist, the limit of the numerator and denominator must independently exist, and
The denominator (still) limits to zero, which implies that the numerator must be limiting to zero, i.e. which will be useful later on. Since the numerator and denominator are both limiting to zero, L'Hôpital's rule applies:
The proof for is similar, with the fact that being important.
Indeed, the following, more general formula holds:
This latter result is of great use in the numerical solution of eigenvalue problems.
Concerning integration, the first derivative of the T_{n} implies that
and the recurrence relation for the first kind polynomials involving derivatives establishes that
Orthogonality[edit]
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 and using the identity .
Similarly, the polynomials of the second kind are orthogonal with respect to the weight
on the interval [−1,1], i.e. we have:
(Note that the weight is, to within a normalizing constant, the density of the Wigner semicircle distribution).
The T_{n} also satisfy a discrete orthogonality condition:
where the are the N Gauss–Lobatto zeros of
Minimal ∞norm[edit]
For any given n ≥ 1, among the polynomials of degree n with leading coefficient 1,
is the one of which the maximal absolute value on the interval [−1, 1] is minimal.
This maximal absolute value is
andƒ(x) reaches this maximum exactly n + 1 times: at
Proof[edit]
Let's assume that is a polynomial of degree n with leading coefficient 1 with maximal absolute value on the interval [−1, 1] less than .
We define
Because at extreme points of we have
is a polynomial of degree n  1, so from the intermediate value theorem it has at least n roots which is impossible for polynomial of degree n  1.
Other properties[edit]
The Chebyshev polynomials are a special case of the ultraspherical or Gegenbauer polynomials, which themselves are a special case of the Jacobi polynomials:
For every nonnegative integer n, T_{n}(x) and U_{n}(x) are both polynomials of degree n. They are even or odd functions of x as n is even or odd, so when written as polynomials of x, it only has even or odd degree terms respectively. In fact,
and
The leading coefficient of T_{n} is 2^{n − 1} if 1 ≤ n, but 1 if 0 = n.
T_{n} are a special case of Lissajous curves with frequency ratio equal to n.
Several polynomial sequences like Lucas polynomials (L_{n}), Dickson polynomials(D_{n}), Fibonacci polynomials(F_{n}) are related to Chebyshev polynomials T_{n} and U_{n}.
The Chebyshev polynomials of the first kind satisfy the relation
which is easily proved from the producttosum formula for the cosine. The polynomials of the second kind satisfy the similar relation
 .
Similar to the formula
we have the analogous formula
 .
As a basis set[edit]
In the appropriate Sobolev space, the set of Chebyshev polynomials form a complete basis set, so that a function in the same space can, on −1 ≤ x ≤ 1 be expressed via the expansion:^{[3]}
Furthermore, as mentioned previously, the Chebyshev polynomials form an orthogonal basis which (among other things) implies that the coefficients a_{n} can be determined easily through the application of an inner product. This sum is called a Chebyshev series or a Chebyshev expansion.
Since a Chebyshev series is related to a Fourier cosine series through a change of variables, all of the theorems, identities, etc. that apply to Fourier series have a Chebyshev counterpart.^{[3]} These attributes include:
 The Chebyshev polynomials form a complete orthogonal system.
 The Chebyshev series converges to ƒ(x) if the function is piecewise smooth and continuous. The smoothness requirement can be relaxed in most cases — as long as there are a finite number of discontinuities in ƒ(x) and its derivatives.
 At a discontinuity, the series will converge to the average of the right and left limits.
The abundance of the theorems and identities inherited from Fourier series make the Chebyshev polynomials important tools in numeric analysis; for example they are the most popular general purpose basis functions used in the spectral method,^{[3]} often in favor of trigonometric series due to generally faster convergence for continuous functions (Gibbs' phenomenon is still a problem).
Example 1[edit]
Consider the Chebyshev expansion of . One can express
One can find the coefficients either through the application of an inner product or by the discrete orthogonality condition. For the inner product,
which gives
Alternatively, when you cannot evaluate the inner product of the function you are trying to approximate, the discrete orthogonality condition gives
where is the Kronecker delta function and the are the N Gauss–Lobatto zeros of
This allows us to compute the coefficients very efficiently through the discrete cosine transform
Example 2[edit]
To provide another example:
Partial sums[edit]
The partial sums of
are very useful in the approximation of various functions and in the solution of differential equations (see spectral method). Two common methods for determining the coefficients a_{n} are through the use of the inner product as in Galerkin's method and through the use of collocation which is related to interpolation.
As an interpolant, the N coefficients of the (N − 1)^{th} partial sum are usually obtained on the Chebyshev–Gauss–Lobatto^{[4]} points (or Lobatto grid), which results in minimum error and avoids Runge's phenomenon associated with a uniform grid. This collection of points corresponds to the extrema of the highest order polynomial in the sum, plus the endpoints and is given by:
Polynomial in Chebyshev form[edit]
An arbitrary polynomial of degree N can be written in terms of the Chebyshev polynomials of the first kind. Such a polynomial p(x) is of the form
Polynomials in Chebyshev form can be evaluated using the Clenshaw algorithm.
Spread polynomials[edit]
The spread polynomials are in a sense equivalent to the Chebyshev polynomials of the first kind, but enable one to avoid square roots and conventional trigonometric functions in certain contexts, notably in rational trigonometry.
Notes[edit]
 ↑ Chebyshev polynomials were first presented in: P. L. Chebyshev (1854) "Théorie des mécanismes connus sous le nom de parallélogrammes," Mémoires des Savants étrangers présentés à l’Académie de SaintPétersbourg, vol. 7, pages 539586.
 ↑ Jeroen Demeyer Diophantine Sets over Polynomial Rings and Hilbert's Tenth Problem for Function Fields, Ph.D. theses (2007), p.70.
 ↑ ^{a} ^{b} ^{c} Boyd, John P. (2001). Chebyshev and Fourier Spectral Methods (second ed.). Dover. ISBN 0486411834. http://wwwpersonal.umich.edu/~jpboyd/aaabook_9500may00.pdf.
 ↑ Chebyshev Interpolation: An Interactive Tour
Credits[edit]
 This page was originally created from Chebyshev polynomials at wikipedia