TOPICS
Search

Favard's Theorem


Favard's theorem characterizes orthogonal polynomials on the real line by a three-term recurrence relation. Let P_(-1)=0 and P_0=1, and define monic polynomials by

 P_(n+1)(x)=(x-b_n)P_n(x)-beta_nP_(n-1)(x)
(1)

for n=0, 1, ..., where b_n is real, beta_n>0 for n>=1, and beta_0=0. There exists a finite positive measure mu on the real line, not concentrated on any finite set and having finite moments of every order, such that

 int_RP_m(x)P_n(x)dmu(x)=h_ndelta_(mn),
(2)

where h_n>0 and delta_(mn) is the Kronecker delta. Conversely, monic polynomials orthogonal with respect to such a measure satisfy this recurrence relation (Favard 1935).

The coefficients satisfy beta_n=h_n/h_(n-1), so the squared norms are

 h_n=h_0product_(j=1)^nbeta_j.
(3)

The measure need not have a density and need not be unique even after its total mass is fixed. This is related to the moment problem. With a_n=sqrt(beta_n), the recurrence relation is encoded by a Jacobi matrix. The theorem concerns orthogonal polynomials in general, rather than only the classical families that satisfy second-order differential equations.


See also

Jacobi Matrix, Moment Problem, Monic Polynomial, Orthogonal Polynomials, Positive Measure, Recurrence Relation

Explore with Wolfram|Alpha

References

Chihara, T. S. An Introduction to Orthogonal Polynomials. New York: Gordon and Breach, p. 21, 1978.Favard, J. "Sur les polynômes de Tchebicheff." C. R. Acad. Sci. Paris 200, 2052-2053, 1935.National Institute of Standards and Technology. "General Orthogonal Polynomials." §18.2 in NIST Digital Library of Mathematical Functions. https://dlmf.nist.gov/18.2.

Cite this as:

Weisstein, Eric W. "Favard's Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/FavardsTheorem.html

Subject classifications