Generated by GPT-5-mini| Gegenbauer polynomials | |
|---|---|
| Name | Gegenbauer polynomials |
| Field | Harmonic analysis; Approximation theory; Special functions |
| Introduced by | Ernst Gegenbauer |
| Year | 1874 |
| Other names | Ultraspherical polynomials |
Gegenbauer polynomials are a family of orthogonal polynomials that generalize Legendre polynomials, Chebyshev polynomials of the first kind, and Chebyshev polynomials of the second kind and arise in expansions on spheres and in solutions of partial differential equations such as Laplace's equation in hyperspherical coordinates. They were introduced by Ernst Gegenbauer in the 19th century and have connections to representation theory of SO(n), spherical harmonics used in Quantum mechanics, and classical analysis methods applied by mathematicians like Carl Friedrich Gauss, Adrien-Marie Legendre, and Pafnuty Chebyshev.
Gegenbauer polynomials are denoted by C_n^{(λ)}(x) where n is a nonnegative integer and λ is a parameter with Re(λ) > −1/2. The normalization commonly used satisfies C_0^{(λ)}(x)=1 and C_1^{(λ)}(x)=2λx. These polynomials belong to the family of hypergeometric functions and can be written in terms of the Gauss hypergeometric function _2F_1; they appear in works by Ernst Gegenbauer, in tables by Frank Olver, and in compendia such as the Bateman Manuscript Project.
For λ > −1/2 the polynomials C_n^{(λ)}(x) are orthogonal on the interval [−1,1] with respect to the weight (1−x^2)^{λ−1/2}. Explicitly, ∫_{−1}^{1} C_m^{(λ)}(x) C_n^{(λ)}(x) (1−x^2)^{λ−1/2} dx = 0 for m ≠ n, a property used in expansions analogous to Fourier series in work related to Joseph Fourier and in the study of spherical harmonics developed by Pierre-Simon Laplace and later by Hermann Weyl. Norms and orthogonality constants are tabulated in references such as the NIST Handbook of Mathematical Functions and monographs by Gábor Szegő.
Gegenbauer polynomials satisfy three-term recurrence relations used in numerical algorithms associated with authors like Wim Gautschi and Gene H. Golub. A standard recurrence is (n+1) C_{n+1}^{(λ)}(x) = 2 (n+λ) x C_n^{(λ)}(x) − (n+2λ−1) C_{n−1}^{(λ)}(x), valid for n ≥ 1 with initial polynomials above. They are eigenfunctions of the Gegenbauer differential operator: (1−x^2) y'' − (2λ+1) x y' + n(n+2λ) y = 0, a second-order linear ordinary differential equation appearing in classical Sturm–Liouville theory studied by Jacques Charles François Sturm and Joseph Liouville.
The generating function is (1−2xt+t^2)^{−λ} = Σ_{n=0}^∞ C_n^{(λ)}(x) t^n, a form exploited in generatingfunctionology as developed by Herbert Wilf and used in combinatorial identities treated by Richard Stanley. Explicit formulas include the hypergeometric representation C_n^{(λ)}(x) = (2λ)_n / n! · _2F_1(−n, n+2λ; λ+1/2; (1−x)/2), with Pochhammer symbol (a)_n familiar from the work of Augustin-Louis Cauchy and Carl Gustav Jacob Jacobi.
When λ = 1/2, C_n^{(1/2)}(x) are proportional to Legendre polynomials P_n(x); when λ = 1, they reduce to Chebyshev polynomials of the second kind U_n(x); in limits they connect to Hermite polynomials under appropriate scaling limits used in asymptotic analysis by Paul Erdős and Géza Freud. Relationships include Rodrigues-type formulas akin to those for Jacobi polynomials P_n^{(α,β)}(x) and limit transitions mapped out in the Askey scheme catalogued by Richard Askey and James Wilson.
Gegenbauer polynomials are central in expansions of functions on the sphere S^{d−1} via spherical harmonics in works by Lord Kelvin and Augustin-Jean Fresnel-era analysis; they appear in multipole expansions in classical electrodynamics as developed by James Clerk Maxwell and in potential theory studied by George Green. They are used in numerical quadrature, spectral methods in computational fluid dynamics associated with researchers like Clive Canuto, and in approximation theory addressed by Achieser and Bernstein. In quantum mechanics they appear in radial and angular parts of wavefunctions in higher dimensions in texts by Paul Dirac and Richard Feynman.
Zeros of C_n^{(λ)}(x) are real, simple, and lie in (−1,1); interlacing properties with adjacent degrees follow from classical theorems by Sturm and were studied further by Gábor Szegő. Normalization constants can be chosen so the leading coefficient equals 2^n (λ)_n / n!, or so that C_n^{(λ)}(1)= (2λ)_n / n!, conventions appearing in tables by Milton Abramowitz and Frank Olver. Symmetry under x ↦ −x is parity: C_n^{(λ)}(−x) = (−1)^n C_n^{(λ)}(x), reflecting even/odd behavior used in expansions in works by Sophie Germain and Évariste Galois.