Christoffel–Darboux formula

From HandWiki

In mathematics, the Christoffel–Darboux formula or Christoffel–Darboux theorem is an identity for a sequence of orthogonal polynomials, introduced by Elwin Bruno Christoffel (1858) and Jean Gaston Darboux (1878). It states that

j=0nfj(x)fj(y)hj=knhnkn+1fn(y)fn+1(x)fn+1(y)fn(x)xy

where fj(x) is the jth term of a set of orthogonal polynomials of squared norm hj and leading coefficient kj.

There is also a "confluent form" of this identity by taking yx limit:j=0nfj2(x)hj=knhnkn+1[fn+1(x)fn(x)fn(x)fn+1(x)].

Proof

Let pn be a sequence of polynomials orthonormal with respect to a probability measure μ, and definean=xpn,pn+1,bn=xpn,pn,n0(they are called the "Jacobi parameters"), then we have the three-term recurrence[1]p0(x)=1,p1(x)=xb0a0,xpn(x)=anpn+1(x)+bnpn(x)+an1pn1(x),n1

Proof: By definition, xpn,pk=pn,xpk, so if kn2, then xpk is a linear combination of p0,...,pn1, and thus xpn,pk=0. So, to construct pn+1, it suffices to perform Gram-Schmidt process on xpn using pn,pn1, which yields the desired recurrence.


Proof of Christoffel–Darboux formula:

Since both sides are unchanged by multiplying with a constant, we can scale each fn to pn.

Since kn+1knxpnpn+1 is a degree n polynomial, it is perpendicular to pn+1, and so kn+1knxpn,pn+1=pn+1,pn+1=1. Now the Christoffel-Darboux formula is proved by induction, using the three-term recurrence.

Specific cases

Hermite polynomials:

k=0nHk(x)Hk(y)k!2k=1n!2n+1Hn(y)Hn+1(x)Hn(x)Hn+1(y)xy.k=0nHek(x)Hek(y)k!=1n!Hen(y)Hen+1(x)Hen(x)Hen+1(y)xy.

Associated Legendre polynomials:

(μμ)l=mL(2l+1)(lm)!(l+m)!Plm(μ)Plm(μ)=(Lm+1)!(L+m)![PL+1m(μ)PLm(μ)PLm(μ)PL+1m(μ)].

See also

References

  1. Świderski, Grzegorz; Trojan, Bartosz (2021-08-01). "Asymptotic Behaviour of Christoffel–Darboux Kernel Via Three-Term Recurrence Relation I" (in en). Constructive Approximation 54 (1): 49–116. doi:10.1007/s00365-020-09519-w. ISSN 1432-0940.