Discrete Chebyshev polynomials

Template:Distinguish In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, 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 $t_n^N(x)$ is a polynomial of degree n in x, for $n=0,1,2,\dots ,N-1$, constructed such that two polynomials of unequal degree are orthogonal with respect to the weight function $$w(x)=\sum _{r=0}^{N-1}\delta (x-r),$$ with $\delta (\cdot )$ being the Dirac delta function. That is, $$\underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}{t}_n^N(x)t_m^N(x)w(x)dx=0\text{ if }n\ne m.$$

The integral on the left is actually a sum because of the delta function, and we have, $$\sum _{r=0}^{N-1}{t}_n^N(r)t_m^N(r)=0\text{ if }n\ne m.$$

Thus, even though $t_n^N(x)$ is a polynomial in $x$, only its values at a discrete set of points, $x=0,1,2,\dots ,N-1$ 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 $$\sum _{n=0}^{N-1}{t}_n^N(r)t_n^N(s)=0\text{ if }r\ne s.$$

Chebyshev chose the normalization so that $$\sum _{r=0}^{N-1}{t}_n^N(r)t_n^N(r)=\frac{N}{2n+1}\prod _{k=1}^n(N^2-k^2).$$

This fixes the polynomials completely along with the sign convention, $t_n^N(N-1)>0$.

If the independent variable is linearly scaled and shifted so that the end points assume the values $-1$ and $1$, then as $N\to \mathrm{\infty }$, $t_n^N(\cdot )\to P_n(\cdot )$ times a constant, where $P_n$ is the Legendre polynomial.

Advanced Definition

Let Template:Math be a smooth function defined on the closed interval [−1, 1], whose values are known explicitly only at points Template:Math, where k and m are integers and Template:Math. The task is to approximate f as a polynomial of degree n < m. Consider a positive semi-definite bilinear form $${(g,h)}_d:=\frac{1}{m}\sum _{k=1}^{m}g(x_k)h(x_k),$$ where Template:Math and Template:Math are continuous on [−1, 1] and let $${\Vert g\Vert }_d:=(g,g{)}_d^{1/2}$$ be a discrete semi-norm. Let ${\phi }_k$ be a family of polynomials orthogonal to each other $${({\phi }_k,{\phi }_i)}_d=0$$ whenever Template:Mvar is not equal to Template:Mvar. Assume all the polynomials ${\phi }_k$ have a positive leading coefficient and they are normalized in such a way that $${\Vert {\phi }_k\Vert }_d=1.$$

The ${\phi }_k$ are called discrete Chebyshev (or Gram) polynomials.

Connection with Spin Algebra

The discrete Chebyshev polynomials have surprising connections to various algebraic properties of spin: spin transition probabilities, the probabilities for observations of the spin in Bohm's spin-s version of the Einstein-Podolsky-Rosen experiment, and Wigner functions for various spin states.

Specifically, the polynomials turn out to be the eigenvectors of the absolute square of the rotation matrix (the Wigner D-matrix). The associated eigenvalue is the Legendre polynomial $P_{\ell }(\cos \theta )$, where $\theta$ is the rotation angle. In other words, if $$d_{m{m}^{\prime }}=⟨j,m|e^{-i\theta J_y}|j,m^{\prime }⟩,$$ where $|j,m⟩$ are the usual angular momentum or spin eigenstates, and $$F_{m{m}^{\prime }}(\theta )=|d_{m{m}^{\prime }}(\theta ){|}^2,$$ then $$\sum _{m^{\prime }=-j}^j{F}_{m{m}^{\prime }}(\theta )f_{\ell }^j(m^{\prime })=P_{\ell }(\cos \theta )f_{\ell }^j(m).$$

The eigenvectors $f_{\ell }^j(m)$ are scaled and shifted versions of the Chebyshev polynomials. They are shifted so as to have support on the points $m=-j,-j+1,\dots ,j$ instead of $r=0,1,\dots ,N$ for $t_n^N(r)$ with $N$ corresponding to $2j+1$, and $n$ corresponding to $\ell$. In addition, the $f_{\ell }^j(m)$ can be scaled so as to obey other normalization conditions. For example, one could demand that they satisfy $$\frac{1}{2j+1}\sum _{m=-j}^j{f}_{\ell }^j(m)f_{{\ell }^{\prime }}^j(m)={\delta }_{\ell {\ell }^{\prime }},$$ along with $f_{\ell }^j(j)>0$.