{
  "id": "orthogonal-polynomials",
  "title": "Orthogonal Polynomials",
  "lang": "en",
  "source_lang": "en",
  "summary": "Orthogonal polynomials are polynomial sequences mutually orthogonal under an inner product, linking approximation, integration, spectral theory, and probability.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Orthogonal polynomial systems",
    "Orthogonal polynomial sequences"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/orthogonal-polynomials/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/orthogonal-polynomials/",
      "json": "https://aiwiki.page/zh/orthogonal-polynomials.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Orthogonal polynomials are sequences of polynomials in which distinct members have zero inner product with respect to a specified measure or weight. Typically, the sequence contains one polynomial of each nonnegative degree. Familiar examples include the Legendre, Chebyshev, Jacobi, Laguerre, and Hermite polynomials. Their orthogonality plays a role analogous to the perpendicularity of coordinate axes: it separates polynomial components that would otherwise interact when functions are expanded or approximated.\n\nThese systems connect algebraic structure with analysis. Orthogonality forces a short recurrence relation, constrains the location of zeros, and produces integration formulas of exceptionally high exactness. Particular families also satisfy differential or difference equations. Consequently, orthogonal polynomials are fundamental tools in approximation theory, numerical integration, probability, mathematical physics, and the spectral analysis of operators. Their theory extends beyond continuous weights on intervals to discrete measures, complex contours, several variables, and matrix-valued systems."
    },
    {
      "heading": "Orthogonality, measures, and normalization",
      "text": "The standard setting begins with a positive measure \\(\\mu\\) on the real line, having infinite support and finite moments of every order:\n\n\\[m_k=\\int_{\\mathbb R}x^k\\,d\\mu(x),\\qquad k=0,1,2,\\ldots.\\]\n\nMore precisely, absolute moments are assumed finite, so every polynomial product is integrable. The measure defines\n\n\\[\\langle f,g\\rangle_\\mu =\\int_{\\mathbb R}f(x)\\overline{g(x)}\\,d\\mu(x).\\]\n\nThe language of measure theory accommodates continuous distributions, discrete point masses, and mixtures within the same definition. When \\(d\\mu(x)=w(x)\\,dx\\) on an interval \\(I\\), the function \\(w\\) is called the weight.\n\nAn orthogonal polynomial sequence \\(\\{p_n\\}_{n\\geq0}\\) satisfies\n\n\\[\\deg p_n=n,\\qquad \\langle p_n,p_m\\rangle_\\mu=0\\quad(n\\ne m).\\]\n\nInfinite support ensures that every nonzero polynomial has positive squared norm: a polynomial has only finitely many zeros and therefore cannot vanish almost everywhere for such a measure. Applying the Gram–Schmidt process to \\(1,x,x^2,\\ldots\\) consequently constructs the sequence. If the support consists of exactly \\(N\\) distinct points, the corresponding construction instead gives \\(N\\) nonzero orthogonal polynomials, of degrees \\(0\\) through \\(N-1\\).\n\nOrthogonality alone leaves an arbitrary nonzero multiplier at every degree. Two standard conventions remove this freedom. A monic polynomial has leading coefficient \\(1\\); an orthonormal polynomial has norm \\(1\\), conventionally with positive leading coefficient. Classical named families often use other normalizations, chosen for convenient endpoint values, generating functions, or differentiation formulas. Thus the statement that a family is orthogonal does not by itself specify its squared norms or recurrence coefficients.\n\nIf \\(P_n\\) is monic and \\(h_n=\\langle P_n,P_n\\rangle_\\mu\\), orthogonality gives an important extremal characterization. Every other monic degree-\\(n\\) polynomial has the form \\(P_n+r\\), with \\(\\deg r<n\\), and hence\n\n\\[\\|P_n+r\\|_\\mu^2=h_n+\\|r\\|_\\mu^2.\\]\n\nTherefore \\(P_n\\) uniquely minimizes the weighted squared norm among monic polynomials of its degree. This is an instance of orthogonal projection, rather than a separate optimization phenomenon.\n\nThe moments also define a Gram matrix,\n\n\\[G_n=(m_{j+k})_{j,k=0}^{n}.\\]\n\nIts positive definiteness is equivalent to positivity of the polynomial inner product through degree \\(n\\). Determinant formulas derived from these matrices express orthogonal polynomials in terms of moments. They establish an algebraic connection between the sequence and its measure, although they are often poor formulas for numerical computation because moment matrices can be severely ill-conditioned."
    },
    {
      "heading": "Three-term recurrence and spectral structure",
      "text": "Multiplication by the independent variable is the central operation behind the theory. Let \\(p_n\\) be orthonormal with positive leading coefficient, and set \\(p_{-1}=0\\). Then\n\n\\[xp_n(x) =a_{n+1}p_{n+1}(x)+b_np_n(x)+a_np_{n-1}(x),\\]\n\nwhere \\(a_n>0\\) for \\(n\\geq1\\), \\(b_n\\) is real, and the term involving \\(p_{-1}\\) is omitted at \\(n=0\\). This three-term recurrence replaces a degree-\\(n\\) polynomial calculation with a fixed number of operations per step.\n\nThe absence of lower-degree terms follows directly from orthogonality. If \\(k\\leq n-2\\), then\n\n\\[\\langle xp_n,p_k\\rangle_\\mu =\\langle p_n,xp_k\\rangle_\\mu=0,\\]\n\nbecause \\(xp_k\\) has degree at most \\(n-1\\). Only degrees \\(n+1,n,n-1\\) can remain. The coefficients have the integral expressions\n\n\\[b_n=\\int xp_n(x)^2\\,d\\mu(x),\\qquad a_n=\\int xp_n(x)p_{n-1}(x)\\,d\\mu(x).\\]\n\nFor a measure symmetric about zero, the polynomials alternate between even and odd parity, and every \\(b_n\\) vanishes.\n\nIn monic normalization the recurrence becomes\n\n\\[P_{n+1}(x)=(x-b_n)P_n(x)-\\beta_nP_{n-1}(x), \\qquad \\beta_n=\\frac{h_n}{h_{n-1}}>0.\\]\n\nFavard’s theorem gives a converse: a real polynomial sequence satisfying such a recurrence with positive \\(\\beta_n\\) is orthogonal for some positive measure with infinite support and finite moments. The theorem guarantees existence, but not necessarily uniqueness, of that measure.\n\nThe recurrence can be represented by a symmetric tridiagonal Jacobi matrix:\n\n\\[J= \\begin{pmatrix} b_0&a_1&0&\\cdots\\\\ a_1&b_1&a_2&\\cdots\\\\ 0&a_2&b_2&\\ddots\\\\ \\vdots&\\vdots&\\ddots&\\ddots \\end{pmatrix}.\\]\n\nIn the polynomial basis this is the matrix of multiplication by \\(x\\). Its leading \\(n\\times n\\) block \\(J_n\\) satisfies\n\n\\[\\det(xI-J_n)=P_n(x).\\]\n\nThus polynomial zeros are eigenvalues of finite symmetric tridiagonal matrices.\n\nFor a compactly supported measure, multiplication by \\(x\\) is a bounded self-adjoint operator on the relevant function space, and the spectral theorem provides a direct operator interpretation of the measure. On unbounded supports, domains and self-adjoint extensions require greater care. In particular, a formally symmetric infinite Jacobi matrix need not determine a unique self-adjoint operator. This distinction is closely related to whether a moment sequence determines a unique measure."
    },
    {
      "heading": "Classical continuous families",
      "text": "The classical continuous families are distinguished by a combination of orthogonality, second-order differential equations, and differentiation identities. Their weights satisfy a Pearson equation\n\n\\[(\\sigma w)'=\\tau w,\\]\n\nwhere \\(\\sigma\\) has degree at most two and \\(\\tau\\) has degree at most one. With suitable endpoint conditions, the differential operator\n\n\\[Lf=\\frac{1}{w}\\frac{d}{dx}\\left(\\sigma w f'\\right) =\\sigma f''+\\tau f'\\]\n\nis symmetric on polynomials. Its polynomial eigenfunctions satisfy\n\n\\[\\sigma y''+\\tau y'+\\lambda_n y=0, \\qquad \\lambda_n=-n\\tau'-\\frac{n(n-1)}2\\sigma''.\\]\n\nThe endpoint conditions are essential: they remove boundary terms when integration by parts is used to prove orthogonality.\n\nJacobi polynomials \\(P_n^{(\\alpha,\\beta)}\\) are orthogonal on \\([-1,1]\\) with\n\n\\[w(x)=(1-x)^\\alpha(1+x)^\\beta,\\qquad \\alpha,\\beta>-1.\\]\n\nThey satisfy\n\n\\[(1-x^2)y'' +\\bigl[\\beta-\\alpha-(\\alpha+\\beta+2)x\\bigr]y' +n(n+\\alpha+\\beta+1)y=0.\\]\n\nThe parameter restrictions make the weight integrable at both endpoints. Legendre polynomials are the case \\(\\alpha=\\beta=0\\), conventionally normalized by \\(P_n(1)=1\\), with\n\n\\[\\int_{-1}^{1}P_n(x)P_m(x)\\,dx =\\frac{2}{2n+1}\\delta_{nm}.\\]\n\nTheir first terms are \\(1,x,(3x^2-1)/2\\), and \\((5x^3-3x)/2\\).\n\nChebyshev polynomials of the first kind are characterized by\n\n\\[T_n(\\cos\\theta)=\\cos(n\\theta).\\]\n\nThey are orthogonal for \\(w(x)=(1-x^2)^{-1/2}\\). Those of the second kind satisfy\n\n\\[U_n(\\cos\\theta)=\\frac{\\sin((n+1)\\theta)}{\\sin\\theta}\\]\n\nand use the weight \\((1-x^2)^{1/2}\\). Both are proportional to special cases of Jacobi polynomials. Their trigonometric representations account for their explicit zeros and their close connection with cosine transforms.\n\nGeneralized Laguerre polynomials \\(L_n^{(\\alpha)}\\) use the half-line weight\n\n\\[w(x)=x^\\alpha e^{-x},\\qquad x>0,\\quad \\alpha>-1,\\]\n\nand satisfy\n\n\\[xy''+(\\alpha+1-x)y'+ny=0.\\]\n\nTheir squared norms in the conventional normalization are\n\n\\[\\int_0^\\infty x^\\alpha e^{-x} L_n^{(\\alpha)}(x)L_m^{(\\alpha)}(x)\\,dx =\\frac{\\Gamma(n+\\alpha+1)}{n!}\\delta_{nm},\\]\n\nwhere \\(\\Gamma\\) is the gamma function.\n\nHermite polynomials occur in two common conventions. The physicists’ polynomials \\(H_n\\) are orthogonal for \\(e^{-x^2}\\) and satisfy\n\n\\[H_n''-2xH_n'+2nH_n=0.\\]\n\nThe probabilists’ polynomials \\(\\operatorname{He}_n\\) are orthogonal for \\(e^{-x^2/2}\\), with\n\n\\[H_n(x)=2^{n/2}\\operatorname{He}_n(\\sqrt2\\,x).\\]\n\nFor example, \\(H_2(x)=4x^2-2\\), whereas \\(\\operatorname{He}_2(x)=x^2-1\\). Confusing these conventions changes both recurrence coefficients and quadrature scaling. Classical families also admit Rodrigues formulas; for instance,\n\n\\[P_n(x)=\\frac{1}{2^n n!} \\frac{d^n}{dx^n}(x^2-1)^n.\\]\n\nSuch formulas provide explicit constructions, but repeatedly differentiating them is rarely the best computational procedure."
    },
    {
      "heading": "Zeros, reproducing kernels, and asymptotic behavior",
      "text": "A degree-\\(n\\) orthogonal polynomial for a positive real measure has \\(n\\) distinct real zeros, all lying in the interior of the convex hull of the support. For a measure supported on an interval, every zero is therefore strictly between the extreme support points. If the support has gaps, some zeros may lie in those gaps; the theorem does not require every zero to belong to the support itself.\n\nA sign-change argument explains the result. Form the product \\(q\\) of the factors corresponding to sign changes of \\(p_n\\) inside the support’s convex hull. If there were fewer than \\(n\\) such changes, then \\(\\deg q<n\\), while \\(p_nq\\) would have one sign on the support and would not vanish almost everywhere. Its integral could not be zero, contradicting orthogonality. This excludes repeated zeros, nonreal zeros, and zeros outside the permitted interval.\n\nZeros of consecutive degrees strictly interlace. Writing the zeros of \\(p_n\\) as \\(x_{1,n}<\\cdots<x_{n,n}\\), the pattern is\n\n\\[x_{1,n+1}<x_{1,n}<x_{2,n+1}<\\cdots <x_{n,n}<x_{n+1,n+1}.\\]\n\nThis can be proved from the recurrence or from eigenvalue interlacing for the leading blocks of the Jacobi matrix. Interlacing supplies effective root brackets and helps explain the regular distribution of quadrature nodes.\n\nFor an orthonormal sequence, define the kernel\n\n\\[K_n(x,y)=\\sum_{k=0}^{n}p_k(x)p_k(y).\\]\n\nIt reproduces every polynomial \\(q\\) of degree at most \\(n\\):\n\n\\[q(x)=\\int K_n(x,y)q(y)\\,d\\mu(y).\\]\n\nThe Christoffel–Darboux formula compresses this sum to\n\n\\[K_n(x,y)=a_{n+1} \\frac{p_{n+1}(x)p_n(y)-p_n(x)p_{n+1}(y)}{x-y}.\\]\n\nAt \\(x=y\\), the quotient is interpreted by taking a limit. The formula follows by telescoping the three-term recurrences, and it is central to estimates for expansions and zeros.\n\nThe reciprocal diagonal,\n\n\\[\\lambda_n(x)=\\frac{1}{K_n(x,x)},\\]\n\nis the Christoffel function. It has a variational interpretation:\n\n\\[\\lambda_n(x) =\\min_{\\substack{\\deg q\\leq n\\\\q(x)=1}} \\int |q(t)|^2\\,d\\mu(t).\\]\n\nIt measures how cheaply a polynomial can attain unit value at a specified point while remaining small in weighted mean square.\n\nLarge-degree behavior depends on both the support and the weight. For Jacobi weights, the normalized zero-counting measures converge to the arcsine distribution,\n\n\\[\\frac{dx}{\\pi\\sqrt{1-x^2}},\\qquad -1<x<1,\\]\n\nindependently of the fixed admissible parameters \\(\\alpha,\\beta\\). On unbounded intervals, zeros must instead be rescaled: Hermite zeros have scale \\(\\sqrt n\\), while Laguerre zeros have scale \\(n\\). Precise asymptotic formulas distinguish interior oscillations, endpoint behavior, and regions outside the zeros."
    },
    {
      "heading": "Gaussian quadrature",
      "text": "Orthogonal polynomials determine Gaussian quadrature, which approximates a weighted integral using function values:\n\n\\[\\int f(x)\\,d\\mu(x) \\approx\\sum_{i=1}^{n}\\omega_i f(x_i).\\]\n\nThe Gaussian nodes \\(x_i\\) are the zeros of the degree-\\(n\\) orthogonal polynomial. The weights \\(\\omega_i\\) are chosen so that the formula integrates every polynomial of degree at most \\(n-1\\) exactly. Orthogonality then raises the degree of exactness to \\(2n-1\\).\n\nTo see why, divide any polynomial \\(f\\) of degree at most \\(2n-1\\) by \\(P_n\\):\n\n\\[f=P_nq+r,\\qquad \\deg q,\\deg r\\leq n-1.\\]\n\nThe integral of \\(P_nq\\) is zero. At every Gaussian node, \\(P_nq\\) also vanishes, so both the integral and the quadrature reduce to the remainder \\(r\\). Exactness for \\(r\\) follows from ordinary polynomial interpolation. The extra accuracy is therefore a direct consequence of orthogonality rather than a fortuitous choice of nodes.\n\nAll Gaussian weights are positive. If \\(\\ell_i\\) is the degree-\\((n-1)\\) cardinal polynomial equal to \\(1\\) at \\(x_i\\) and \\(0\\) at the other nodes, exactness gives\n\n\\[\\omega_i=\\int \\ell_i(x)^2\\,d\\mu(x)>0.\\]\n\nEquivalently, in orthonormal notation,\n\n\\[\\omega_i=\\frac{1}{K_{n-1}(x_i,x_i)}.\\]\n\nPositivity prevents cancellation between weights and makes Gaussian rules especially useful for positive measures.\n\nThe degree \\(2n-1\\) is optimal for an \\(n\\)-node rule with freely chosen real nodes. If exactness extended through degree \\(2n\\), applying the rule to\n\n\\[r(x)=\\prod_{i=1}^{n}(x-x_i)^2\\]\n\nwould give zero, although its integral is strictly positive for an infinite-support positive measure. Under suitable smoothness assumptions on a compact interval, a sharper error statement is\n\n\\[\\int f\\,d\\mu-\\sum_{i=1}^{n}\\omega_i f(x_i) =\\frac{f^{(2n)}(\\xi)}{(2n)!}\\int P_n(x)^2\\,d\\mu(x)\\]\n\nfor some point \\(\\xi\\) in the interval.\n\nThe standard named rules follow their weights: Gauss–Legendre for unit weight on a finite interval, Gauss–Jacobi for algebraic endpoint factors, Gauss–Laguerre for exponentially decaying half-line integrals, and Gauss–Hermite for Gaussian weights. A change of variables adapts them to other scales and locations.\n\nThe Golub–Welsch algorithm, published in 1969, computes the nodes as eigenvalues of \\(J_n\\). If an eigenvector associated with \\(x_i\\) has unit Euclidean norm and first component \\(v_{i,1}\\), then\n\n\\[\\omega_i=m_0|v_{i,1}|^2.\\]\n\nThis transforms quadrature construction into symmetric tridiagonal eigenvalue computation. Related Gauss–Radau and Gauss–Lobatto formulas prescribe one or both interval endpoints, sacrificing some degree of exactness to accommodate those constraints."
    },
    {
      "heading": "Expansions, approximation, and numerical computation",
      "text": "An orthonormal system provides polynomial projections of functions. For \\(f\\) in the space L^2(\\mu), define\n\n\\[c_n=\\int f(x)p_n(x)\\,d\\mu(x),\\qquad S_Nf=\\sum_{n=0}^{N}c_np_n.\\]\n\nThe function \\(S_Nf\\) uniquely minimizes \\(\\|f-q\\|_{L^2(\\mu)}\\) among polynomials of degree at most \\(N\\). Orthogonality yields\n\n\\[\\|f-S_Nf\\|_{L^2(\\mu)}^2 =\\|f\\|_{L^2(\\mu)}^2-\\sum_{n=0}^{N}|c_n|^2.\\]\n\nThis identity concerns weighted mean-square approximation; it does not by itself imply small maximum error or pointwise convergence.\n\nWhether the projections converge to every \\(L^2\\) function depends on completeness. On a compact real support, continuous functions can be uniformly approximated by polynomials, and polynomials are dense in \\(L^2(\\mu)\\). The orthonormal sequence therefore forms an orthonormal basis. For unbounded supports, completeness requires additional hypotheses and cannot be inferred merely from the existence of all moments. Thus the phrase “orthogonal polynomial expansion” must distinguish a formal series from an expansion known to converge to the original function.\n\nSmoothness and complex analyticity govern convergence rates. For Chebyshev series, if \\(f\\) is analytic inside a Bernstein ellipse with parameter \\(\\rho>1\\) and bounded there by \\(M\\), its coefficients satisfy bounds proportional to \\(M\\rho^{-n}\\). Such geometric decay explains the efficiency of polynomial approximation for analytic functions. Limited differentiability typically gives algebraic rather than geometric decay. Discontinuities can produce persistent local oscillations analogous to those in Fourier series.\n\nChebyshev expansions are particularly convenient because\n\n\\[f(\\cos\\theta) =\\sum_{n\\geq0}c_n\\cos(n\\theta)\\]\n\nconverts the polynomial expansion into a cosine expansion. Values sampled at suitable cosine-spaced nodes can be transformed efficiently using algorithms related to the fast Fourier transform. These nodes are much denser near the endpoints than uniformly spaced nodes, reducing the severe endpoint oscillations that can occur in high-degree interpolation at equally spaced points.\n\nFor direct evaluation, the three-term recurrence usually avoids the expense and cancellation associated with monomial coefficients. A finite orthogonal expansion can be evaluated by the Clenshaw algorithm, a backward recurrence generalizing Horner’s rule. Its effectiveness depends on the family, evaluation region, scaling, and arithmetic; recurrence formulas are not automatically stable in every setting.\n\nConstructing recurrence coefficients from raw moments is a separate numerical problem. Although moment determinant formulas are exact symbolically, their condition numbers may be enormous. Floating-point arithmetic can then destroy the positive-definite structure on which orthogonality depends. More reliable approaches include carefully implemented Stieltjes procedures, modified moments relative to a known reference family, and Lanczos-type reductions of discretized multiplication operators. Numerical orthogonality must often be monitored rather than assumed."
    },
    {
      "heading": "Applications in probability, differential equations, and spectral algorithms",
      "text": "In probability, orthogonal polynomials organize functions of a random variable according to its distribution. If \\(X\\) is standard normal, the probabilists’ Hermite polynomials satisfy\n\n\\[\\mathbb E[\\operatorname{He}_m(X)\\operatorname{He}_n(X)] =n!\\,\\delta_{mn}.\\]\n\nThus \\(\\operatorname{He}_n/\\sqrt{n!}\\) is orthonormal. Under the appropriate completeness conditions, a square-integrable function of \\(X\\) can be expanded in this basis, and its variance becomes a sum of squared nonconstant coefficients.\n\nThis idea extends to polynomial chaos expansions for uncertainty quantification. Independent input variables with suitable marginal distributions lead to product bases: Hermite polynomials for Gaussian inputs, Jacobi polynomials for beta-type inputs, and Laguerre polynomials for gamma-type inputs. For an orthonormal expansion\n\n\\[Y=\\sum_{\\boldsymbol{\\alpha}} c_{\\boldsymbol{\\alpha}}\\Psi_{\\boldsymbol{\\alpha}},\\]\n\nthe mean is \\(c_{\\boldsymbol0}\\) and the variance is\n\n\\[\\operatorname{Var}(Y) =\\sum_{\\boldsymbol{\\alpha}\\ne\\boldsymbol0} |c_{\\boldsymbol{\\alpha}}|^2.\\]\n\nThe usefulness of the decomposition depends on the input measure and on controlling the number of retained multivariate terms.\n\nClassical polynomials also arise through separation of variables in differential equations. Legendre polynomials describe the axisymmetric angular dependence of solutions to Laplace’s equation in spherical coordinates. In quantum mechanics, the one-dimensional harmonic oscillator has wavefunctions proportional to\n\n\\[e^{-\\xi^2/2}H_n(\\xi),\\]\n\nwhere \\(\\xi\\) is a dimensionless position. Associated Laguerre polynomials occur in hydrogenic radial wavefunctions. In these examples, polynomial orthogonality is embedded in the orthogonality of physical eigenfunctions, with additional weight factors supplied by the coordinate system and exponential envelopes.\n\nIn spectral methods, a solution of a differential equation is approximated by a global polynomial expansion. Galerkin methods require the residual to be orthogonal to a chosen test space, while collocation methods enforce the equation at selected nodes. Legendre bases are natural for unweighted \\(L^2\\) formulations, and Chebyshev bases are attractive for fast transforms and well-developed interpolation formulas. Boundary conditions may be imposed by modifying basis functions, replacing selected equations, or adding constrained terms.\n\nOrthogonal polynomials also connect iterative numerical linear algebra with approximation on spectra. The Lanczos algorithm produces a tridiagonal matrix from a symmetric matrix and a starting vector. Its recurrence is an orthogonal polynomial recurrence for the discrete spectral measure determined by that vector. This connection explains why Gaussian quadrature can approximate quantities such as \\(v^\\mathsf{T}f(A)v\\) without diagonalizing the full matrix.\n\nA further connection appears in random matrix theory. For unitary invariant ensembles with eigenvalue density proportional to\n\n\\[\\prod_{i<j}(x_i-x_j)^2\\prod_i w(x_i),\\]\n\northogonal polynomials for the weight \\(w\\) express eigenvalue correlation functions through a determinantal kernel. The Christoffel–Darboux identity then reduces many large-degree questions to asymptotic analysis of only two consecutive polynomials."
    },
    {
      "heading": "Discrete systems, moment problems, and broader generalizations",
      "text": "Orthogonality does not require integration against a continuous density. On a discrete support \\(\\{x_j\\}\\), it takes the form\n\n\\[\\langle f,g\\rangle =\\sum_j w_jf(x_j)\\overline{g(x_j)},\\qquad w_j>0.\\]\n\nImportant discrete families include Charlier polynomials for Poisson weights, Krawtchouk polynomials for binomial weights, and Meixner polynomials for negative-binomial weights. Hahn polynomials provide another major finite-support family. Their role parallels that of the classical continuous families, but differential equations are replaced by second-order difference equations.\n\nFinite support changes the length of the system. For a binomial distribution supported on \\(0,1,\\ldots,N\\), there are \\(N+1\\) mutually orthogonal polynomial functions, which may be represented by degrees \\(0\\) through \\(N\\). Any higher-degree polynomial function on those nodes reduces to a lower-degree representative. This is a statement about the dimension of the function space, not a failure of the orthogonalization procedure.\n\nA foundational issue is the moment problem: does a sequence \\(\\{m_k\\}\\) arise from a positive measure, and if so, is that measure unique? The Hamburger problem concerns measures on the whole real line, while the Stieltjes problem restricts them to the nonnegative half-line. Compactly supported positive measures are determined by their moments. On unbounded supports, different measures can have identical moments and hence identical monic orthogonal polynomials.\n\nCarleman’s condition is a useful sufficient criterion for uniqueness in the Hamburger problem:\n\n\\[\\sum_{n=1}^{\\infty}m_{2n}^{-1/(2n)}=\\infty.\\]\n\nIt is not necessary. The lognormal distribution illustrates why finite moments alone are insufficient. If \\(X=e^Z\\), where \\(Z\\) is standard normal, then\n\n\\[\\mathbb E[X^k\\sin(2\\pi\\log X)]=0\\]\n\nfor every nonnegative integer \\(k\\). Multiplying the lognormal density by\n\n\\[1+\\varepsilon\\sin(2\\pi\\log x),\\qquad |\\varepsilon|\\leq1,\\]\n\ntherefore produces distinct probability measures with the same moments. The same identity supplies a nonzero function orthogonal to every polynomial in the original \\(L^2\\) space, showing directly that polynomial completeness can fail.\n\nOrthogonal polynomials on the unit circle form another major theory. They use \\(1,z,z^2,\\ldots\\) with an inner product over \\(|z|=1\\). Because multiplication by \\(z\\) is unitary rather than self-adjoint, their basic recurrence has a different structure and involves reversed polynomials. Its parameters are Verblunsky coefficients, lying in the open unit disk for a nontrivial infinite system. Real-line three-term recurrences should not be transferred to this setting unchanged.\n\nIn several real variables, each total degree contains multiple independent monomials, so there is no single canonical polynomial at every degree. Product measures give simple tensor-product constructions; more general measures lead to vector or block recurrences. Matrix-valued weights similarly produce matrix orthogonal polynomials. Other extensions include multiple orthogonality with respect to several measures, Sobolev inner products containing derivatives, and \\(q\\)-orthogonal systems governed by multiplicative rather than additive shifts."
    },
    {
      "heading": "Historical development and modern research",
      "text": "Orthogonal polynomial theory developed from several practical and analytical problems rather than from a single definition. Eighteenth-century work on gravitational potentials and spherical geometry led to Legendre polynomials. Their generating function,\n\n\\[(1-2xt+t^2)^{-1/2} =\\sum_{n=0}^{\\infty}P_n(x)t^n,\\]\n\narises naturally when expanding inverse-distance potentials. This origin explains the family’s enduring association with celestial mechanics and potential theory.\n\nIn 1814, Carl Friedrich Gauss introduced the principle of choosing quadrature nodes to achieve the highest possible polynomial exactness. The nodes were linked to what are now recognized as orthogonal polynomials. This established one of the subject’s most important connections: integral approximation could be improved by allowing the evaluation points themselves to vary, rather than fixing equally spaced nodes.\n\nDuring the nineteenth century, Jacobi, Chebyshev, Hermite, and Laguerre developed families associated with special functions, approximation, and differential equations. Chebyshev’s work in the 1850s connected polynomial approximation with practical mechanical problems and with broader questions of optimality. Thomas Stieltjes subsequently developed deep connections among orthogonal polynomials, continued fractions, and moments. Continued fractions for transforms such as\n\n\\[F(z)=\\int\\frac{d\\mu(x)}{z-x}\\]\n\nencode the same coefficients that appear in the three-term recurrence.\n\nThe abstract theory consolidated in the early twentieth century. Salomon Bochner’s 1929 classification identified the classical families under the standard second-order differential-operator assumptions and positive real orthogonality conditions. Favard’s 1935 theorem established the recurrence-based existence principle. Gábor Szegő’s Orthogonal Polynomials, first published in 1939, organized much of the theory and became a central reference for zeros, expansions, and asymptotics. These developments shifted attention from separate named sequences toward structural properties shared by whole classes of measures.\n\nElectronic computation created a further phase. The 1969 Golub–Welsch formulation made Gaussian quadrature a practical application of symmetric eigenvalue algorithms. Later work emphasized stable recurrence-coefficient construction, fast polynomial transforms, high-order differential-equation solvers, and the interaction between orthogonality and finite-precision arithmetic. The relevant distinction is often between a formula that is mathematically exact and an algorithm that preserves its structure numerically.\n\nModern asymptotic research uses complex-variable methods, logarithmic potential theory, and matrix Riemann–Hilbert problems. A Riemann–Hilbert formulation developed in the early 1990s, together with nonlinear steepest-descent methods, made it possible to derive detailed large-degree formulas for broad classes of weights. Applications include eigenvalue statistics, varying exponential weights, and transitions near singular endpoints or merging intervals. Active problems also concern nonclassical measures, multiple and matrix orthogonality, and the behavior of recurrence coefficients when the support or weight develops increasingly complicated structure."
    }
  ],
  "links": [
    "polynomial",
    "inner-product",
    "mathematical-analysis",
    "probability",
    "measure-theory",
    "gram-schmidt-process",
    "orthogonal-projection",
    "gram-matrix",
    "recurrence-relation",
    "eigenvalues-and-eigenvectors",
    "self-adjoint-operator",
    "spectral-theorem",
    "integration-by-parts",
    "legendre-polynomials",
    "chebyshev-polynomials",
    "gamma-function",
    "hermite-polynomials",
    "interpolation",
    "lp-space",
    "orthonormal-basis",
    "fourier-series",
    "fast-fourier-transform",
    "condition-number",
    "floating-point-arithmetic",
    "variance",
    "differential-equation",
    "quantum-mechanics",
    "numerical-linear-algebra",
    "random-matrix-theory",
    "carl-friedrich-gauss",
    "continued-fraction"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}