Discrete Chebyshev polynomials

From testwiki
Jump to navigation Jump to search

Template:Short description 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[1] and rediscovered by Gram.[2] They were later found to be applicable to various algebraic properties of spin angular momentum. This connection shows that they can be expressed as Clebsch-Gordan coefficients.

Elementary definition

The discrete Chebyshev polynomial tnN(x) is a polynomial of degree n in x, for n=0,1,2,…,N−1, constructed such that two polynomials of unequal degree are orthogonal with respect to the weight function w(x)=∑r=0N−1δ(x−r), with δ(⋅) being the Dirac delta function. That is, ∫−∞∞tnN(x)tmN(x)w(x)dx=0 if n≠m.

The integral on the left is actually a sum because of the delta function, and we have, ∑r=0N−1tnN(r)tmN(r)=0 if n≠m.

Thus, even though tnN(x) is a polynomial in x, only its values at a discrete set of points, x=0,1,2,…,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 ∑n=0N−1tnN(r)tnN(s)=0 if r≠s.

Chebyshev chose the normalization so that ∑r=0N−1tnN(r)tnN(r)=N2n+1∏k=1n(N2−k2).

This fixes the polynomials completely along with the sign convention, tnN(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→∞, tnN(⋅)→Pn(⋅) times a constant, where Pn 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:=1m∑k=1mg(xk)h(xk), where Template:Math and Template:Math are continuous on [−1, 1] and let ‖g‖d:=(g,g)d1/2 be a discrete semi-norm. Let φk be a family of polynomials orthogonal to each other (φk,φi)d=0 whenever Template:Mvar is not equal to Template:Mvar. Assume all the polynomials φk have a positive leading coefficient and they are normalized in such a way that ‖φk‖d=1.

The φk are called discrete Chebyshev (or Gram) polynomials.[3]

Connection with spin algebra

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

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ℓ(cos⁡θ), where θ is the rotation angle. In other words, if dmm′=⟨j,m|e−iθJy|j,m′⟩, where |j,m⟩ are the usual angular momentum or spin eigenstates, and Fmm′(θ)=|dmm′(θ)|2, then ∑m′=−jjFmm′(θ)fℓj(m′)=Pℓ(cos⁡θ)fℓj(m).

The eigenvectors fℓ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,…,j instead of r=0,1,…,N for tnN(r) with N corresponding to 2j+1, and n corresponding to ℓ. In addition, the fℓj(m) can be scaled so as to obey other normalization conditions. For example, one could demand that they satisfy 12j+1∑m=−jjfℓj(m)fℓ′j(m)=δℓℓ′, along with fℓj(j)>0.


Connection with Clebsch-Gordan coefficients

In the form, fℓj(m), the connection with spin algebra shows that these polynomials are Clebsch-Gordan coefficients. To be consistent with the normalization given above, the relation is

fℓj(m)=(−1)j−m2j+1⟨jjℓ0|j,m;j,−m⟩.

References

Template:Reflist