About the Project
18 Orthogonal PolynomialsGeneral Orthogonal Polynomials

§18.2 General Orthogonal Polynomials

Contents
  1. §18.2(i) Definition
  2. §18.2(ii) x-Difference Operators
  3. §18.2(iii) Standardization and Related Constants
  4. §18.2(iv) Recurrence Relations
  5. §18.2(v) Christoffel–Darboux Formula
  6. §18.2(vi) Zeros
  7. §18.2(vii) Quadratic Transformations
  8. §18.2(viii) Uniqueness of Orthogonality Measure and Completeness
  9. §18.2(ix) Moments
  10. §18.2(x) Orthogonal Polynomials and Continued Fractions
  11. §18.2(xi) Some Special Classes of General Orthogonal Polynomials
  12. §18.2(xii) Other Special Constructions Involving General OP’s

§18.2(i) Definition

Orthogonality on Intervals

Let (a,b) be a finite or infinite open interval in \mathbb{R}. A system (or set) of polynomials \{p_{n}(x)\}, n=0,1,2,\ldots, where p_{n}(x) has degree n as in §18.1(i), is said to be orthogonal on (a,b)with respect to the weight function w(x) (\geq 0) if

18.2.1 \int_{a}^{b}p_{n}(x)p_{m}(x)w(x)\,\mathrm{d}x=0,n\neq m.

Here w(x) is continuous or piecewise continuous or integrable such that

It is assumed throughout this chapter that for each polynomial p_{n}(x) that is orthogonal on an open interval (a,b) the variable x is confined to the closure of (a,b)unless indicated otherwise. (However, under appropriate conditions almost all equations given in the chapter can be continued analytically to various complex values of the variables.)

Orthogonality on Countable Sets

Let X be a finite set of distinct points on \mathbb{R}, or a countable infinite set of distinct points on \mathbb{R}, and w_{x}, x\in X, be a set of positive constants. Then a system of polynomials \{p_{n}(x)\}, n=0,1,2,\ldots, is said to be orthogonal on X with respect to the weights w_{x} if

when X is infinite, or

when X is a finite set of N+1 distinct points. In the former case we also require

18.2.4 \sum_{x\in X}|x|^{n}w_{x}<\infty, n=0,1,\dots,

whereas in the latter case the system \{p_{n}(x)\} is finite: n=0,1,\ldots,N.

Orthogonality on General Sets

More generally than (18.2.1)–(18.2.3), w(x)\,\mathrm{d}x may be replaced in (18.2.1) by \,\mathrm{d}\mu(x), where the measure \mu is the Lebesgue–Stieltjes measure \mu_{\alpha} corresponding to a bounded nondecreasing function \alpha on the closure of (a,b) with an infinite number of points of increase, and such that \int_{a}^{b}|x|^{n}\,\mathrm{d}\mu(x)<\infty for all n. See §1.4(v), McDonald and Weiss (1999, Chapters 3, 4) and Szegő (1975, §1.4). Then

18.2.4_5 \int_{a}^{b}p_{n}(x)p_{m}(x)\,\mathrm{d}\mu(x)=0,n\neq m.

§18.2(ii) x-Difference Operators

If the orthogonality discrete set X is \{0,1,\dots,N\} or \{0,1,2,\dots\}, then the role of the differentiation operator \ifrac{\mathrm{d}}{\mathrm{d}x} in the case of classical OP’s (§18.3) is played by \Delta_{x}, the forward-difference operator, or by \nabla_{x}, the backward-difference operator; compare §18.1(i). This happens, for example, with the Hahn class OP’s (§18.20(i)).

If the orthogonality interval is (-\infty,\infty) or (0,\infty), then the role of \ifrac{\mathrm{d}}{\mathrm{d}x} can be played by \delta_{x}, the central-difference operator in the imaginary direction (§18.1(i)). This happens, for example, with the continuous Hahn polynomials and Meixner–Pollaczek polynomials (§18.20(i)).

§18.2(iii) Standardization and Related Constants

The orthogonality relations (18.2.1)–(18.2.3) each determine the polynomials p_{n}(x) uniquely up to constant factors, which may be fixed by suitable standardizations.

Constants

Throughout this chapter we will use constants h_{n} and k_{n}, and variants of these, related to OP’s p_{n}(x).

The h_{n} are defined as:

Thus

and similar extensions for (18.2.4_5) and (18.2.2).

The constants \tilde{h}_{n}, k_{n}, \tilde{k}_{n} and \tilde{\tilde{k}}_{n} are defined as:

and

18.2.7 p_{n}(x)=k_{n}x^{n}+\tilde{k}_{n}x^{n-1}+\tilde{\tilde{k}}_{n}x^{n-2}+\cdots,

where \tilde{k}_{0}=0 and \tilde{\tilde{k}}_{n}=0 for n=0,1.

Standardizations

The classical orthogonal polynomials are defined with:

(i) the traditional OP standardizations of Table 18.3.1, where each is defined in terms of the above constants.

Two, more specialized, standardizations are:

(ii) monic OP’s: k_{n}=1.

(iii) orthonormal OP’s: h_{n}=1 (and usually, but not always, k_{n}>0);

The constant function p_{0}(x) will often, but not always, be identically 1 (see, for example, (18.2.11_8)), p_{-1}(x)=0 in all cases, by convention, as indicated in §18.1(i).

§18.2(iv) Recurrence Relations

As in §18.1(i) we assume that p_{-1}(x)\equiv 0.

First Form

Here A_{n}, B_{n} (n\geq 0), and C_{n} (n\geq 1) are real constants. Then

18.2.9
A_{n}=\frac{k_{n+1}}{k_{n}},
B_{n}=\left(\frac{\tilde{k}_{n+1}}{k_{n+1}}-\frac{\tilde{k}_{n}}{k_{n}}\right)%
A_{n}=-\frac{\tilde{h}_{n}}{h_{n}}A_{n},
C_{n}=\frac{A_{n}\tilde{\tilde{k}}_{n}+B_{n}\tilde{k}_{n}-\tilde{\tilde{k}}_{n%
+1}}{k_{n-1}}=\frac{A_{n}}{A_{n-1}}\frac{h_{n}}{h_{n-1}}.

Hence A_{n-1}A_{n}C_{n}=A_{n}^{2}\ifrac{h_{n}}{h_{n-1}} (n\geq 1), so

18.2.9_5 A_{n-1}A_{n}C_{n}>0,n\geq 1.

The OP’s are orthonormal iff C_{n}=A_{n}/A_{n-1} (n\geq 1) and h_{0}=1. The OP’s are monic iff A_{n}=1 (n\geq 0) and k_{0}=1.

Second Form

Here a_{n}, b_{n} (n\geq 0), c_{n} (n\geq 1) are real constants. Then

18.2.11
a_{n}=\frac{k_{n}}{k_{n+1}},
b_{n}=\frac{\tilde{k}_{n}}{k_{n}}-\frac{\tilde{k}_{n+1}}{k_{n+1}}=\frac{\tilde%
{h}_{n}}{h_{n}},
c_{n}=\frac{\tilde{\tilde{k}}_{n}-a_{n}\tilde{\tilde{k}}_{n+1}-b_{n}\tilde{k}_%
{n}}{k_{n-1}}=a_{n-1}\frac{h_{n}}{h_{n-1}}.

Hence

18.2.11_1 \sum_{j=0}^{n}b_{j}=\frac{\tilde{k}_{n+1}}{k_{n+1}}.

Furthermore, a_{n-1}c_{n}=a_{n-1}^{2}\ifrac{h_{n}}{h_{n-1}} (n\geq 1), so

18.2.11_2 a_{n-1}c_{n}>0,n\geq 1.

The OP’s are orthonormal iff c_{n}=a_{n-1} (n\geq 1) and h_{0}=1. The OP’s are monic iff a_{n}=1 (n\geq 0) and k_{0}=1.

The coefficients A_{n},B_{n},C_{n} in the first form and a_{n},b_{n},c_{n} in the second form are related by

18.2.11_3
a_{n}=A_{n}^{-1},\quad b_{n}=-A_{n}^{-1}B_{n},\quad c_{n}=A_{n}^{-1}C_{n};
A_{n}=a_{n}^{-1},\quad B_{n}=-a_{n}^{-1}b_{n},\quad C_{n}=a_{n}^{-1}c_{n}.

Monic and Orthonormal Forms

Assume that the p_{n}(x) are monic, so A_{n}=1=a_{n}. Then, with

18.2.11_4
\alpha_{n}\equiv b_{n}=-B_{n},
\beta_{n}\equiv c_{n}=C_{n}=\ifrac{h_{n}}{h_{n-1}},

the monic recurrence relations (18.2.8) and (18.2.10) take the form

18.2.11_5
xp_{n}(x)=p_{n+1}(x)+\alpha_{n}p_{n}(x)+\beta_{n}p_{n-1}(x),n\geq 1,
p_{1}(x)=x-\alpha_{0},
p_{0}(x)=1.

See also (3.5.30). Note that

18.2.11_6 \beta_{n}>0,n\geq 1.

In terms of the monic OP’s p_{n} define the orthonormal OP’s q_{n} by

18.2.11_7 q_{n}(x)=\ifrac{p_{n}(x)}{\sqrt{h_{n}}},n\geq 0.

Then, with the coefficients (18.2.11_4) associated with the monic OP’s p_{n}, the orthonormal recurrence relation for q_{n} takes the form

18.2.11_8
xq_{n}(x)=\sqrt{\beta_{n+1}}\,q_{n+1}(x)+\alpha_{n}q_{n}(x)+\sqrt{\beta_{n}}\,%
q_{n-1}(x),n\geq 1
q_{1}(x)=(x-\alpha_{0})/\sqrt{h_{0}\beta_{1}},
q_{0}(x)=1/\sqrt{h_{0}},

with h_{0} still being associated with the monic p_{0}(x)=1.

The monic and orthonormal OP’s, and their determination via recursion, are more fully discussed in §§3.5(v) and 3.5(vi), where modified recursion coefficients are listed for the classical OP’s in their monic and orthonormal forms.

Remarks

If polynomials p_{n}(x) are generated by recurrence relation (18.2.8) under assumption of inequality (18.2.9_5) (or similarly for the other three forms) then the p_{n}(x) are orthogonal by Favard’s theorem, see §18.2(viii), in that the existence of a bounded non-decreasing function \alpha(x) on (a,b) yielding the orthogonality realtion (18.2.4_5) is guaranteed.

If the polynomials p_{n}(x) (n=0,1,\ldots,N) are orthogonal on a finite set X of N+1 distinct points as in (18.2.3), then the polynomial p_{N+1}(x) of degree N+1, up to a constant factor defined by (18.2.8) or (18.2.10), vanishes on X.

The recurrence relations (18.2.10) can be equivalently written as

18.2.11_9 \begin{pmatrix}b_{0}&a_{0}&&0\\[6.0pt]
c_{1}&b_{1}&a_{1}&\\
&c_{2}&\ddots&\ddots\\
0&&\ddots&\ddots\end{pmatrix}\begin{pmatrix}p_{0}(x)\\[6.0pt]
p_{1}(x)\\
\vdots\\
\vdots\end{pmatrix}=x\begin{pmatrix}p_{0}(x)\\[6.0pt]
p_{1}(x)\\
\vdots\\
\vdots\end{pmatrix}.

The matrix on the left-hand side is an (infinite tridiagonal) Jacobi matrix. This matrix is symmetric iff c_{n}=a_{n-1} (n\geq 1).

§18.2(v) Christoffel–Darboux Formula

With notation (18.2.4_5), (18.2.5), (18.2.7)

18.2.12 K_{n}(x,y)\equiv\sum_{\ell=0}^{n}\frac{p_{\ell}(x)p_{\ell}(y)}{h_{\ell}}=\frac%
{k_{n}}{h_{n}k_{n+1}}\frac{p_{n+1}(x)p_{n}(y)-p_{n}(x)p_{n+1}(y)}{x-y},x\neq y,

Kernel property

18.2.12_5 \int_{a}^{b}f(y)K_{n}(x,y)\,\mathrm{d}\mu(y)=\begin{cases}f(x),&\text{$f\in%
\operatorname{Span}(p_{0},p_{1},\ldots,p_{n})$,}\\
0,&\text{$\int_{a}^{b}f(x)p_{\ell}(x)\,\mathrm{d}\mu(x)=0$\quad($\ell=0,1,%
\ldots,n$).}\end{cases}

Confluent Form

18.2.13 K_{n}(x,x)=\sum_{\ell=0}^{n}\frac{(p_{\ell}(x))^{2}}{h_{\ell}}=\frac{k_{n}}{h_%
{n}k_{n+1}}{\left(p_{n+1}^{\prime}(x)p_{n}(x)-p_{n}^{\prime}(x)p_{n+1}(x)%
\right)}.

Kernel Polynomials

Assume y\notin(a,b) in (18.2.12). Then the kernel polynomials

18.2.14 q_{n}(x)=q_{n}(x;y)\equiv K_{n}(x,y)=\sum_{\ell=0}^{n}\frac{p_{\ell}(x)p_{\ell%
}(y)}{h_{\ell}}

are OP’s with orthogonality relation

18.2.15 \int_{a}^{b}q_{n}(x)q_{m}(x)|y-x|\,\mathrm{d}\mu(x)=0,n\neq m.

Between the systems \{p_{n}(x)\} and \{q_{n}(x)\} there are the contiguous relations

18.2.16 q_{n}(x)-q_{n-1}(x)=\frac{p_{n}(y)}{h_{n}}p_{n}(x),
18.2.17 p_{n}(y)p_{n+1}(x)-p_{n+1}(y)p_{n}(x)=\frac{h_{n}k_{n+1}}{k_{n}}(x-y)q_{n}(x).

§18.2(vi) Zeros

All n zeros of an OP p_{n}(x) are simple, and they are located in the interval of orthogonality (a,b). The zeros of p_{n}(x) and p_{n+1}(x) separate each other, and if m<n then between any two zeros of p_{m}(x) there is at least one zero of p_{n}(x).

For illustrations of these properties see Figures 18.4.118.4.7.

For usage of the zeros of an OP in Gauss quadrature see §3.5(v). When the Jacobi matrix in (18.2.11_9) is truncated to an n\times n matrix

18.2.18 \mathbf{J}_{n}=\begin{pmatrix}b_{0}&a_{0}&&&0\\[6.0pt]
c_{1}&b_{1}&a_{1}&&\\
&c_{2}&\ddots&\ddots&\\
&&\ddots&\ddots&a_{n-2}\\[6.0pt]
0&&&c_{n-1}&b_{n-1}\end{pmatrix}

then the zeros of p_{n}(x) are the eigenvalues of \mathbf{J}_{n} (see also §3.5(vi)).

Discriminants

Let x_{1},\ldots,x_{n} be the zeros of the OP p_{n}, so

18.2.19 p_{n}(x)=k_{n}\prod_{j=1}^{n}(x-x_{j}).

The discriminant of p_{n} is defined by

18.2.20 \operatorname{Disc}\left(p_{n}\right)=k_{n}^{2n-2}\prod_{1\leq i<j\leq n}(x_{i%
}-x_{j})^{2}.

See Ismail (2009, §3.4) for another expression of the discriminant in the case of a general OP.

§18.2(vii) Quadratic Transformations

For OP’s \{p_{n}(x)\} on \mathbb{R} with respect to an even weight function w(x) we have

18.2.21 p_{n}(-x)=(-1)^{n}p_{n}(x),

so we can put

Then \{r_{n}(x)\} are OP’s on (0,\infty) with respect to weight function x^{-\frac{1}{2}}v(x) and \{s_{n}(x)\} are OP’s on (0,\infty) with respect to weight function x^{\frac{1}{2}}v(x).

As a slight variant let \{p_{n}(x)\} be OP’s with respect to an even weight function w(x) on (-1,1). Then (18.2.21) still holds and we can put

Then \{r_{n}(x)\} are OP’s on (-1,1) with respect to weight function (1+x)^{-\frac{1}{2}}v(x) and \{s_{n}(x)\} are OP’s on (-1,1) with respect to weight function (1+x)^{\frac{1}{2}}v(x).

See Chihara (1978, Ch. I, §8).

§18.2(viii) Uniqueness of Orthogonality Measure and Completeness

If a system of polynomials \{p_{n}(x)\} satisfies any of the formula pairs (recurrence relation and coefficient inequality) (18.2.8), (18.2.9_5) or (18.2.10), (18.2.11_2) or (18.2.11_5), (18.2.11_6) or (18.2.11_8), (18.2.11_6) then \{p_{n}(x)\} is orthogonal with respect to some positive measure on \mathbb{R} (Favard’s theorem). The measure is not necessarily absolutely continuous (i.e., of the form w(x)\,\mathrm{d}x) nor is it necessarily unique, up to a positive constant factor. However, if OP’s have an orthogonality relation on a bounded interval, then their orthogonality measure is unique, up to a positive constant factor.

A system \{p_{n}(x)\} of OP’s satisfying (18.2.1) and (18.2.5) is complete if each f(x) in the Hilbert space L_{w}^{2}((a,b)) can be approximated in Hilbert norm by finite sums \sum_{n}\lambda_{n}p_{n}(x). For such a system, functions f\in L_{w}^{2}((a,b)) and sequences \{\lambda_{n}\} (n=0,1,2,\ldots) satisfying \sum_{n=0}^{\infty}h_{n}|\lambda_{n}|^{2}<\infty can be related to each other in a similar way as was done for Fourier series in (1.8.1) and (1.8.2):

if and only if

18.2.25 f(x)=\sum_{n=0}^{\infty}{\lambda_{n}}p_{n}(x)

(convergence in L_{w}^{2}((a,b))). A system of OP’s with unique orthogonality measure is always complete, see Shohat and Tamarkin (1970, Theorem 2.14). In particular, a system of OP’s on a bounded interval is always complete.

§18.2(ix) Moments

The moments for an orthogonality measure \,\mathrm{d}\mu(x) are the numbers

18.2.26 \mu_{n}=\int_{a}^{b}x^{n}\,\mathrm{d}\mu(x),n=0,1,2,\ldots.

The Hankel determinant \Delta_{n} of order n is defined by \Delta_{0}=1 and

18.2.27 \Delta_{n}=\begin{vmatrix}\mu_{0}&\mu_{1}&\ldots&\mu_{n-1}\\
\mu_{1}&\mu_{2}&\ldots&\mu_{n}\\
\vdots&\vdots&&\vdots\\
\mu_{n-1}&\mu_{n}&\ldots&\mu_{2n-2}\end{vmatrix},n=1,2,\ldots.

Also define determinants \Delta_{n}^{\prime} by \Delta_{0}^{\prime}=0, \Delta_{1}^{\prime}=\mu_{1} and

18.2.28 \Delta_{n}^{\prime}=\begin{vmatrix}\mu_{0}&\mu_{1}&\ldots&\mu_{n-2}&\mu_{n}\\
\mu_{1}&\mu_{2}&\ldots&\mu_{n-1}&\mu_{n+1}\\
\vdots&\vdots&&\vdots&\vdots\\
\mu_{n-1}&\mu_{n}&\ldots&\mu_{2n-3}&\mu_{2n-1}\end{vmatrix},n=2,3,\ldots.

The monic OP’s p_{n}(x) with respect to the measure \,\mathrm{d}\mu(x) can be expressed in terms of the moments by

18.2.29 p_{n}(x)={\frac{1}{\Delta_{n}}}\begin{vmatrix}\mu_{0}&\mu_{1}&\ldots&\mu_{n}\\
\mu_{1}&\mu_{2}&\ldots&\mu_{n+1}\\
\vdots&\vdots&&\vdots\\
\mu_{n-1}&\mu_{n}&\ldots&\mu_{2n-1}\\
1&x&\ldots&x^{n}\end{vmatrix},n=1,2,\ldots.

The recurrence coefficients \alpha_{n} and \beta_{n} in (18.2.11_5) can be expressed in terms of the determinants (18.2.27) and (18.2.28) by

18.2.30
\alpha_{n}=\frac{\Delta_{n+1}^{\prime}}{\Delta_{n+1}}-\frac{\Delta_{n}^{\prime%
}}{\Delta_{n}},n=0,1,2,\ldots.
\beta_{n}=\frac{\Delta_{n+1}\Delta_{n-1}}{\Delta_{n}^{2}},n=1,2,\ldots.

It is to be noted that, although formally correct, the results of (18.2.30) are of little utility for numerical work, as Hankel determinants are notoriously ill-conditioned. See Gautschi (2004, p. 54), and Golub and Meurant (2010, pp. 56, 57). Alternatives for numerical calculation of the recursion coefficients in terms of the moments are discussed in these references, and in §18.40(ii).

§18.2(x) Orthogonal Polynomials and Continued Fractions

In this subsection fix the recurrence coefficients \alpha_{n} (n=0,1,2,\ldots) and \beta_{n} (n=1,2,\ldots) as in (18.2.11_5), with p_{n}(x) the corresponding monic OP’s and with \,\mathrm{d}\mu(x), a and b as in the orthogonality relation (18.2.4_5). Define the first associated monic orthogonal polynomials p_{n}^{(1)}(x) as monic OP’s satisfying

18.2.31
p_{0}^{(1)}(x)=1,
p_{1}^{(1)}(x)=x-\alpha_{1},
xp_{n}^{(1)}(x)=p_{n+1}^{(1)}(x)+\alpha_{n+1}p_{n}^{(1)}(x)+\beta_{n+1}p_{n-1}%
^{(1)}(x),n=1,2,\ldots,

where the first indicates that the indices of the recursion coefficients \alpha_{n}, \beta_{n} of (18.2.31) have been incremented by 1, when compared to those of (18.2.11_5). More generally, §18.30 defines the recurrence relation of the cth associated monic OP by means of a similar shift by c in (18.2.11_5).

The OP’s p_{n}^{(1)}(x) may also be calculated from the original recursion (18.2.11_5), but with independent initial conditions for p_{0},p_{1}:

18.2.32
p_{0}^{(0)}(x)=0,
p_{1}^{(0)}(x)=1,
xp_{n}^{(0)}(x)=p_{n+1}^{(0)}(x)+\alpha_{n}p_{n}^{(0)}(x)+\beta_{n}p_{n-1}^{(0%
)}(x),n=1,2,\ldots,

resulting in p_{n}^{(0)}(x)=p_{n-1}^{(1)}(x), by simple comparison of the two recursions. The p_{n}^{(0)}(x) are the monic corecursive orthogonal polynomials. These relationships are further explored in §§18.30(vi) and 18.30(vii).

The polynomials p_{n}^{(1)}(x) may be also be directly expressed in terms of the p_{n}{(x)} of (18.2.11_5):

18.2.33 p_{n-1}^{(1)}(z)=\frac{1}{\mu_{0}}\int_{a}^{b}\frac{p_{n}(z)-p_{n}(x)}{z-x}\,%
\mathrm{d}\mu(x),z\in\mathbb{C}\backslash[a,b], n=1,2,\ldots,

with moment \mu_{0} defined in (18.2.26).

Using the terminology of §1.12(ii), the n-th approximant of the continued fraction

18.2.34 \cfrac{1}{x-\alpha_{0}-\cfrac{\beta_{1}}{x-\alpha_{1}-\cfrac{\beta_{2}}{x-%
\alpha_{2}-\cdots}}}

is given by

18.2.35 F_{n}(x)=\cfrac{1}{x-\alpha_{0}-\cfrac{\beta_{1}}{x-\alpha_{1}-\cfrac{\beta_{2%
}}{x-\alpha_{2}-\cdots}}}\frac{\beta_{n-1}}{x-\alpha_{n-1}}.

Then

18.2.36 F_{n}(x)=\frac{p_{n-1}^{(1)}(x)}{p_{n}(x)}=\frac{p_{n}^{(0)}(x)}{p_{n}(x)}=%
\frac{1}{\mu_{0}}\sum_{k=1}^{n}\frac{w_{k}}{x-x_{k}},

where x_{1},x_{2},\ldots,x_{n} are the zeros of p_{n}(x) and

are the Christoffel numbers, see also (3.5.18). Because of (18.2.36) the OP’s p_{n}(x) are also called monic denominator polynomials and the OP’s p_{n-1}^{(1)}(x), or, equivalently, the p_{n}^{(0)}(x), are called the monic numerator polynomials.

Assume that the interval [a,b] is bounded. Markov’s theorem states that

18.2.38 \lim_{n\to\infty}F_{n}(z)=\frac{1}{\mu_{0}}\int_{a}^{b}\frac{\,\mathrm{d}\mu(x%
)}{z-x},z\in\mathbb{C}\backslash[a,b].

See Chihara (1978, pp. 86–89), and, in slightly different notation, Ismail (2009, §§2.3, 2.6, 2.10), where it is assumed that \mu_{0}=1. See also the extended development of these ideas in §§18.30(vi), 18.30(vii), and in §18.40(ii) where they form the basis for one method of solving the classical moment problem.

§18.2(xi) Some Special Classes of General Orthogonal Polynomials

The Szegő Class \mathcal{G}

This is the class of weight functions w on (-1,1) such that, in addition to (18.2.1_5),

18.2.39 \int_{-1}^{1}\frac{\left|\ln\left(w(x)\right)\right|}{\sqrt{1-x^{2}}}\,\mathrm%
{d}x<\infty.

For OP’s p_{n}(x) with weight function in the class \mathcal{G} there are asymptotic formulas as n\to\infty, respectively for x\in\mathbb{C} outside [-1,1] and for x\in[-1,1], see Szegő (1975, Theorems 12.1.2, 12.1.4). Under further conditions on the weight function there is an equiconvergence theorem, see Szegő (1975, Theorem 13.1.2). This says roughly that the series (18.2.25) has the same pointwise convergence behavior as the same series with p_{n}(x)=T_{n}\left(x\right), a Chebyshev polynomial of the first kind, see Table 18.3.1.

Generalizations of the Szegő Class

Nevai (1979, p.39) defined the class \mathcal{S} of orthogonality measures with support inside [-1,1] such that the absolutely continuous part w(x)\,\mathrm{d}x has w in the Szegő class \mathcal{G}. For OP’s with orthogonality measure in \mathcal{S}Nevai (1979, pp. 148–150) generalized Szegő’s equiconvergence theorem. In further generalizations of the class \mathcal{S} discrete mass points x_{k} outside [-1,1] are allowed. If these x_{k} satisfy \sum_{k}(|x_{k}|-1)^{\ifrac{1}{2}}<\infty then Szegő type asymptotics outside [-1,1] can be given for the corresponding OP’s, see Simon (2011, Corollary 3.7.2 and following).

The Nevai class {\mathbf{M}}(a,b)

The class \mathbf{M}(a,b) (a>0, b\in\mathbb{R}), introduced by Nevai (1979, p.10), consists of all orthogonality measures \,\mathrm{d}\mu such that the coefficients \sqrt{\beta_{n}} and \alpha_{n} in the recurrence relation (18.2.11_8) for the corresponding orthonormal OP’s satisfy

18.2.40
\lim_{n\to\infty}\sqrt{\beta_{n}}=\tfrac{1}{2}a,
\lim_{n\to\infty}\alpha_{n}=b.

If \,\mathrm{d}\mu\in{\mathbf{M}}(a,b) then the interval [b-a,b+a] is included in the support of \,\mathrm{d}\mu, and outside [b-a,b+a] the measure \,\mathrm{d}\mu only has discrete mass points x_{k} such that b\pm a are the only possible limit points of the sequence \{x_{k}\}, see Máté et al. (1991, Theorem 10). Part of this theorem was already proved by Blumenthal (1898). Therefore this class is also called the Nevai–Blumenthal class.

§18.2(xii) Other Special Constructions Involving General OP’s

Poisson kernel

For OP’s p_{n} with h_{n} and orthogonality relation as in (18.2.5) and (18.2.5_5), the Poisson kernel is defined by

for x,y in the support of the orthogonality measure and z such that the series in (18.2.41) converges absolutely for all these x,y. Instances where the Poisson kernel is nonnegative are of special interest, see Ismail (2009, Theorem 4.7.12).

Degree lowering and raising differentiation formulas and structure relations

For a large class of OP’s p_{n} there exist pairs of differentiation formulas

18.2.42 \pi_{n}(x)p_{n}^{\prime}(x)+A_{n}(x)p_{n}(x)=\lambda_{n}p_{n-1}(x),
18.2.43 \pi_{n}(x)p_{n}^{\prime}(x)+B_{n}(x)p_{n}(x)=\mu_{n}p_{n+1}(x),

see Ismail (2009, (3.2.3), (3.2.10)). If A_{n}(x) and B_{n}(x) are polynomials of degree independent of n, and moreover \pi_{n}(x) is a polynomial \pi(x) independent of n then

18.2.44 \pi(x)p_{n}^{\prime}(x)=\sum_{j=n-s}^{n+t}a_{n,j}p_{j}(x)

for certain coefficients a_{n,j} with s,t independent of n. Then the OP’s are called semi-classical and (18.2.44) is called a structure relation.

Sheffer Polynomials

Polynomials p_{n}(x) of degree n (n=0,1,2,\ldots) are called Sheffer polynomials if they are generated by a generating function of the form

where f(t) and u(t) are formal power series in t, with f(0)=1, u(0)=0 and u^{\prime}(0)=1. Often a standardization c_{n}=1 is taken. If v(s) is the formal power series such that v(u(t))=t then a property equivalent to (18.2.45) with c_{n}=1 is that

The operator {D}_{x} is a delta operator, i.e., {D}_{x} commutes with translation in the variable x and {D}_{x}x is a nonzero constant.

The generating functions (18.12.13), (18.12.15), (18.23.3), (18.23.4), (18.23.5) and (18.23.7) for Laguerre, Hermite, Krawtchouk, Meixner, Charlier and Meixner–Pollaczek polynomials, respectively, can be written in the form (18.2.45). In fact, these are the only OP’s which are Sheffer polynomials (with Krawtchouk polynomials being only a finite system)

The Bernoulli polynomials B_{n}\left(x\right) and Euler polynomials E_{n}\left(x\right) are examples of Sheffer polynomials which are not OP’s, see the generating functions (24.2.3) and (24.2.8). For other examples of Sheffer polynomials, not in DLMF, see Roman (1984).

For further details see Meixner (1934), Sheffer (1939), Rota et al. (1973) and Butzer and Koornwinder (2019).

Monotonic Weight Functions

For OP’s p_{n} on [a,b] with weight function w(x) and orthogonality relation (18.2.5_5) assume that b<\infty and w(x) is non-decreasing in the interval [a,b]. Then the functions \sqrt{w(x)}p_{n}(x) attain their maximum in [a,b] for x=b. See Szegő (1975, Theorem 7.2).

Equations (18.14.3_5) and (18.14.8), both for \alpha=0, can be seen as special cases of this result for Jacobi and Laguerre polynomials, respectively.