In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of
discrete orthogonal polynomials used in
approximation theory
In mathematics, approximation theory is concerned with how function (mathematics), functions can best be approximation, approximated with simpler functions, and with quantitative property, quantitatively characterization (mathematics), characteri ...
, introduced by
Pafnuty Chebyshev and rediscovered by
Gram.
They were later found to be applicable to various algebraic properties of spin angular momentum.
Elementary Definition
The discrete Chebyshev polynomial
is a polynomial of degree ''n'' in ''x'', for
, constructed such that two polynomials of unequal degree are orthogonal with respect to the weight function
with
being the Dirac delta function. That is,
The integral on the left is actually a sum because of the delta function, and we have,
Thus, even though
is a polynomial in
, only its values at a discrete set of points,
are of any significance. Nevertheless, because these polynomials can be defined in terms of orthogonality with respect to a nonnegative weight function, the entire theory of orthogonal polynomials is applicable. In particular, the polynomials are complete in the sense that
Chebyshev chose the normalization so that
This fixes the polynomials completely along with the sign convention,
.
If the independent variable is linearly scaled and shifted so that the end points assume the values
and
, then as
,
times a constant, where
is the Legendre polynomial.
Advanced Definition
Let be a
smooth function
In mathematical analysis, the smoothness of a function (mathematics), function is a property measured by the number of Continuous function, continuous Derivative (mathematics), derivatives it has over some domain, called ''differentiability cl ...
defined on the
closed interval minus;1,&