Chebyshev polynomials are families of polynomials defined by simple trigonometric identities and distinguished by their orthogonality, explicitly known zeros, and extremal approximation properties. The two principal families are the polynomials of the first kind, , and the second kind, , characterized by
The second identity is initially interpreted where , with endpoint values supplied by continuity. Although these definitions use trigonometric functions, both expressions determine ordinary algebraic polynomials in .
Named after the Russian mathematician Pafnuty Chebyshev, these polynomials connect approximation theory with Fourier series, numerical analysis, and the theory of orthogonal polynomials. Their oscillation on yields optimal bounds for several approximation problems, while their cosine structure permits fast algorithms. They provide practical representations of functions, interpolation grids, integration rules, and numerical methods for differential equations.
Definitions, normalization, and historical origins
For every nonnegative integer , the first-kind Chebyshev polynomial is specified on by
The cosine addition formula shows that these functions satisfy the recurrence relation
Consequently, each is a polynomial, and the same recurrence defines it for real or complex arguments outside the original interval. The first few are
For , has degree and leading coefficient .
The second-kind family has initial conditions
and the same recurrence,
Thus
and the leading coefficient of is . Both families have parity matching their degree:
Their endpoint normalizations differ: , whereas . At the other endpoint, and .
The families arose in Chebyshev’s nineteenth-century investigations of mechanisms and the approximation of functions with the smallest possible maximum error. His work in the 1850s helped establish uniform approximation as a distinct mathematical subject. The crucial feature was not merely that a polynomial could approximate a function, but that its largest error could be distributed among several alternating extrema. This perspective linked practical questions about mechanical linkages to precise extremal problems.
Two further families, commonly called the third and fourth kinds, are
They also satisfy the same three-term recurrence, but with and . They are useful when endpoint behavior is asymmetric. Unless otherwise qualified, however, “Chebyshev polynomials” usually refers primarily to , with as the closely associated second family. Stating the family and normalization is essential because leading coefficients, quadrature weights, and expansion coefficients depend on that choice.
Algebraic identities, zeros, and behavior outside the interval
The trigonometric definitions give Chebyshev polynomials an unusually rich algebraic structure. For nonnegative integers ,
This composition identity follows by taking , applying the cosine definitions, and then observing that two polynomials agreeing on an interval agree everywhere. Another important identity is
It translates multiplication in a Chebyshev basis into a sum-and-difference operation on indices, paralleling the multiplication of cosine waves. Such identities simplify nonlinear polynomial calculations without conversion to powers of .
For , all zeros of are simple and lie strictly inside :
Its extrema occur at
where . The zeros of are
Uniform spacing in the angle therefore becomes nonuniform spacing in , with increasingly dense points near the endpoints. This geometry is fundamental to Chebyshev interpolation.
Useful relations between the two families include
for , and
The last formula is a polynomial version of the identity . It explains simultaneously why on and why the first-kind extrema are tied to zeros of a second-kind polynomial.
Outside the interval, oscillation changes into rapid growth. For ,
More generally, if with , then
Equivalently,
The expression is independent of the choice between the two square roots. These formulas connect the polynomials to complex analysis and explain both their strong approximation properties inside an interval and the possible instability of extrapolation beyond it.
Their generating functions are rational:
for sufficiently close to zero. Multiplying by the denominator and matching powers of recovers the recurrence relations directly.
Orthogonality and differential equations
Chebyshev polynomials are classical orthogonal polynomials, but their orthogonality requires a specified weight. For the first kind,
The substitution transforms this integral into
Thus first-kind orthogonality is exactly cosine orthogonality expressed in a different coordinate. The endpoint singularities of the weight are integrable and form an essential part of the structure.
For the second kind,
where equals one when and zero otherwise. Here the same substitution produces the ordinary sine orthogonality relation. The relevant weights therefore distinguish the two families even though their recurrence relations are identical. Neither family is generally orthogonal for the unweighted integral on ; that role belongs to a different classical family, the Legendre polynomials.
These integrals define weighted inner products. With the corresponding weighted square-integrable function spaces, the Chebyshev polynomials form complete orthogonal systems. Completeness means that finite linear combinations are dense in the relevant Hilbert space, so square-integrable functions admit expansions converging in the weighted mean-square norm. It does not imply convergence at every point or uniform convergence. In particular, a continuous function automatically belongs to the first-kind weighted space, but pointwise properties of its expansion require additional analysis.
The first-kind polynomial satisfies the differential equation
whereas the second-kind polynomial satisfies
The first equation has the self-adjoint form
Similarly, the second can be written
These are examples of Sturm–Liouville problems, with singular endpoints.
For polynomial solutions, the boundary terms arising in integration by parts vanish. Subtracting the equations for two different degrees then proves orthogonality whenever their eigenvalues differ. This places the elementary cosine identities within a broader spectral framework: the polynomials are eigenfunctions of weighted differential operators, and the corresponding eigenvalues are or . Their derivative identities and weighted orthogonality are therefore related consequences of one underlying differential structure.
Extremal properties and minimax approximation
The first-kind family solves a fundamental extremal problem. A monic polynomial has leading coefficient one. Among all real monic polynomials of degree , the unique polynomial minimizing
is
This is not an assertion that is universally the best polynomial approximation to a given function. Rather, it identifies the smallest possible maximum magnitude when the highest-degree coefficient is fixed.
The proof is based on alternating signs. Suppose a different monic polynomial had strictly smaller norm. At the extrema of , the difference would have alternating signs opposite to those of . It would therefore have a zero between each consecutive pair, giving at least distinct zeros. Yet the leading terms cancel, so has degree at most , which is impossible. The same alternation structure, with a refinement of the sign argument, establishes uniqueness.
The broader minimax approximation problem seeks a polynomial of degree at most minimizing for a given continuous real function on a compact interval. The equioscillation theorem characterizes the unique optimum: there must be at least ordered points at which the error attains its maximum absolute value with alternating signs. Chebyshev polynomials are the model example of this equal-ripple behavior. For instance, the best linear approximation to on is the constant , because
alternates between errors .
The same family is extremal in derivative bounds. Markov’s inequality for polynomials states that every real polynomial of degree at most satisfies
on . Equality is attained by , since . The related Bernstein inequality is
Together these results quantify how rapidly a bounded polynomial can vary, including the stronger endpoint variation.
For general functions, minimax coefficients are usually not available in closed form. The Remez algorithm, introduced by Evgeny Remez in 1934, iteratively adjusts alternating extremal points to construct a minimax approximant. Truncated Chebyshev series often supply useful initial approximations, but truncation and true minimax approximation are distinct procedures: the latter explicitly optimizes the maximum error.
Chebyshev series and convergence rates
A first-kind Chebyshev expansion is conventionally written
where
The factor on the constant term compensates for the different norm of . Other conventions absorb that factor into the constant coefficient; mixing conventions produces a common normalization error. The coefficients are those of the cosine series of , extended as an even, -periodic function.
For a function in the weighted square-integrable space, orthogonal projection onto the first polynomials gives the best approximation in that weighted mean-square norm. The associated Parseval identity is
This least-squares optimality concerns an integrated error, not the maximum error. The distinction explains why a truncated Chebyshev series can be computationally excellent without being exactly minimax.
Convergence depends on regularity. Since on the interval, absolute summability of the coefficients implies uniform convergence. For the degree- truncation ,
whenever the series represents and this tail is summable. Smoothness of the periodic function leads to algebraic coefficient decay through repeated integration by parts. Conversely, interior corners or jumps prevent geometric decay. A jump also produces the persistent local overshoot associated with the Gibbs phenomenon in Fourier analysis.
For an analytic function, convergence can be geometric. A Bernstein ellipse , with parameter , is parametrized by
Its foci are and , and its semiaxes are and . If is analytic on and inside this ellipse and bounded there by , then
The nearest complex singularities restrict the admissible ellipse and hence determine the asymptotic geometric rate. For example, has poles at . The ellipse through those poles has parameter
Bounds can use any , but not an ellipse containing a pole. This explains why apparently smooth functions on a real interval may nevertheless require many coefficients: convergence is governed partly by their behavior away from the real axis.
Interpolation at Chebyshev points
Chebyshev points are widely used for polynomial interpolation because they combine explicit formulas with controlled error amplification. Two grids are standard. The roots of are
The extrema of , often called Chebyshev–Lobatto points, are
for . The latter include both endpoints and are therefore convenient for boundary conditions.
Their endpoint clustering addresses a major weakness of equally spaced interpolation. The classical Runge example, , exhibits divergence near the endpoints for increasingly high-degree interpolation on equally spaced grids. Chebyshev grids do not make interpolation converge uniformly for every continuous function, but they avoid that example’s instability and provide strong convergence results for sufficiently smooth functions. Their interpolation Lebesgue constants, which measure worst-case amplification of sample errors in the uniform norm, satisfy
The corresponding constants for equally spaced points grow exponentially.
For the root grid, the extremal monic-polynomial property yields
If has continuous derivatives, the interpolation remainder gives
The root grid minimizes the maximum magnitude of the nodal product among all choices of real interpolation nodes in the interval. However, this derivative-based bound can be pessimistic or uninformative for some functions; complex-analytic estimates often describe actual convergence more effectively.
The interpolating polynomial is efficiently evaluated using the barycentric formula
At a node, the prescribed sample value is returned directly. For Chebyshev–Lobatto points, a common normalization is
Only relative weights matter. For the root grid, weights are proportional to , where .
Discrete cosine transforms convert sampled values into coefficients of the interpolating polynomial. These coefficients are not generally identical to continuous-series coefficients: unresolved high-degree modes alias into lower modes on a finite grid. This distinction matters in adaptive approximation and nonlinear calculations, where insufficient sampling can make a computed tail appear smaller than the unresolved error actually is.
Gaussian and Clenshaw–Curtis quadrature
Chebyshev orthogonality leads directly to Gaussian quadrature. With roots of , the first-kind Gauss–Chebyshev rule is
It is exact whenever is a polynomial of degree at most . All weights are equal, an unusually simple feature among Gaussian rules. Under , the formula becomes a midpoint rule for the integral of on .
For the second kind,
This rule also has polynomial exactness through degree . The differing weights reflect the different orthogonality measures. Applying the first rule directly to an unweighted integral would therefore solve the wrong integration problem. An unweighted integral can be rewritten to fit a weighted rule, but the transformed integrand may have less favorable endpoint regularity.
For ordinary integration,
a widely used alternative is Clenshaw–Curtis quadrature, developed by Charles Clenshaw and Alan Curtis in 1960. It samples at Chebyshev–Lobatto points, constructs the degree- interpolant, and integrates that polynomial exactly. The basic moments are
These identities permit the integral to be assembled directly from the interpolant’s Chebyshev coefficients.
An -point Clenshaw–Curtis rule is automatically exact through degree , with an additional degree of exactness when symmetry makes the next degree odd. This is lower than the exactness of -point Gauss–Legendre quadrature. Nevertheless, degree of polynomial exactness alone does not determine performance for general functions. For smooth or analytic integrands, Clenshaw–Curtis often converges at rates comparable in practical significance to Gaussian quadrature because high-order Chebyshev coefficients are already small.
A further advantage is nestedness. Replacing by retains every previous Lobatto point, so refinement reuses existing function evaluations. Fast transforms also make weight or coefficient construction inexpensive. These properties are valuable when integrand evaluations are costly or when adaptive refinement is required. Both Gaussian and Clenshaw–Curtis methods remain sensitive to singularities, discontinuities, and extreme localization; their convergence follows the regularity of the integrand rather than a universal fixed rate.
Stable evaluation, transforms, and polynomial arithmetic
The three-term recurrence permits evaluation of all up to degree using arithmetic operations and a small amount of working memory. It also avoids explicit expansion into monomials, whose coefficients can become large even when the polynomial is bounded by one on . The identity is useful mathematically, but direct trigonometric evaluation is not always the best computational method, particularly near endpoints or for large degree.
For an entire expansion, the standard method is Clenshaw’s algorithm, published by Charles Clenshaw in 1955. Using the convention
set , and compute backward:
Then
This is the counterpart of Horner’s method for the Chebyshev basis. It evaluates the expansion in linear time without separately storing every basis polynomial.
The method generally has favorable numerical stability on the approximation interval, but stability must be distinguished from conditioning. If terms cancel so that is very small, relative error in the final value may still be large. Likewise, extrapolation outside can magnify coefficient errors because the basis polynomials grow rapidly there. Near endpoints, specialized rearrangements can improve accuracy in cases where cancellation affects the standard final expression.
Coefficient transforms are particularly efficient. Samples on a Lobatto grid correspond to a type-I discrete cosine transform, while root grids lead to related type-II or type-III conventions depending on transform direction and normalization. These transforms can be implemented through the fast Fourier transform, reducing the conversion cost to . Care with endpoint weights and the constant coefficient is essential: different software libraries often use different normalizations even when their sample grids agree.
Differentiation can also be performed directly in coefficient space. If
set , compute
and finally replace by . Antiderivatives follow from
with handled separately. Multiplication uses the product identity or transform-based evaluation and resampling. In nonlinear computations, the sampling grid must be enlarged sufficiently to prevent higher-degree products from aliasing into retained coefficients.
Spectral methods, matrix algorithms, and filters
Chebyshev representations are central to spectral methods for differential equations on bounded, nonperiodic intervals. A solution is approximated by
and its coefficients are chosen so that a differential equation and its boundary conditions are satisfied in a prescribed discrete sense. In collocation methods, the equation is enforced at selected Chebyshev points. In Galerkin or tau formulations, residual conditions are imposed through weighted projections or coefficient constraints.
At a Lobatto grid, differentiation can be represented by a matrix. If are barycentric weights, its off-diagonal entries are
and diagonal entries can be defined by
The row-sum condition ensures that constants differentiate to zero. Boundary conditions replace or supplement selected equations. For smooth solutions, accuracy can increase much faster with degree than in a fixed-order local discretization; for analytic solutions, geometric convergence is possible.
Endpoint clustering is both useful and costly. The smallest grid spacing is of order , which helps resolve rapid endpoint variation but can impose restrictive explicit time steps for time-dependent equations. Differentiation also amplifies high-degree errors, so accurately approximating a function does not automatically guarantee equally accurate high derivatives. Singular solutions, discontinuous coefficients, and complex geometries often require domain decomposition, mappings, or other adaptations rather than a single global expansion.
In numerical linear algebra, Chebyshev polynomials provide controlled polynomial filters. Suppose a symmetric positive-definite matrix has spectrum in , with . Mapping that interval to gives the normalized residual polynomial
It minimizes the maximum magnitude on among degree-at-most- polynomials with this normalization. Writing ,
This property underlies Chebyshev semi-iterative methods. Their recurrence coefficients can be prepared from spectral bounds, avoiding the inner products required by some other iterative methods, although inaccurate bounds can impair convergence.
Chebyshev polynomials also shape equal-ripple responses in signal processing. A type-I Chebyshev filter has normalized squared magnitude
For , bounded oscillation produces passband ripple controlled by ; beyond that range, rapid polynomial growth produces attenuation. The same mathematics appears in Dolph–Chebyshev array weighting and windows, where equal-ripple sidelobes implement a minimax trade-off under specified constraints. These applications exploit the contrast between controlled oscillation within an interval and strong growth outside it.