Legendre Polynomials

The uniquely normalized polynomial sequence orthogonal on [-1,1] with unit weight and solving Legendre's differential equation.

Version

v1 · 2026-08-30 · History

Domain-specific #

2174

Origin domain

mathematics

Subdomain

special functions

Aliases

Legendre polynomial sequence

Core Idea

The Legendre polynomials \(P_n(x)\) are the normalized sequence of real polynomials, one of each nonnegative degree, orthogonal on \([-1,1]\) with respect to unit weight. Their standard normalization is \(P_n(1)=1\). Equivalently, \(P_n\) is the polynomial solution of Legendre’s differential equation

\[ (1-x^2)y''-2xy'+n(n+1)y=0 \]

with that normalization. The two characterizations connect spectral expansion, boundary-value problems, spherical harmonics, and Gaussian quadrature.

Orthogonality is exact:

\[ \int_{-1}^{1}P_m(x)P_n(x)\,dx=\frac{2}{2n+1}\delta_{mn}. \]

Scope of Application

Legendre polynomials recur wherever functions on a finite interval are expanded under uniform weight. In numerical analysis they form spectral bases and determine Gauss–Legendre quadrature nodes through their zeros. In potential theory the generating function expands the Newtonian kernel in separated radial and angular variables. In mathematical physics they solve the azimuthally symmetric angular part of Laplace’s equation in spherical coordinates. In approximation, truncated Legendre series project data onto mutually orthogonal degrees.

Clarity

The named family aligns several formulas that otherwise appear unrelated. Rodrigues’ formula

\[ P_n(x)=\frac{1}{2^n n!}\frac{d^n}{dx^n}(x^2-1)^n \]

fixes polynomial coefficients and parity. The recurrence

\[ (n+1)P_{n+1}(x)=(2n+1)xP_n(x)-nP_{n-1}(x) \]

Manages Complexity

Orthogonality converts a coupled approximation problem into scalar projections. Given a suitable function \(f\), its coefficient is

\[ a_n=\frac{2n+1}{2}\int_{-1}^{1}f(x)P_n(x)\,dx. \]

A truncated expansion isolates approximation by degree and avoids solving a dense normal equation in exact arithmetic. The recurrence avoids repeatedly expanding Rodrigues derivatives. Gauss–Legendre quadrature reuses zeros and weights to integrate polynomials of high degree exactly with relatively few samples.

Abstract Reasoning

Parity follows from Rodrigues’ formula: \(P_n(-x)=(-1)^nP_n(x)\). Orthogonality follows from integration by parts because lower-degree polynomials vanish after enough derivatives while endpoint terms vanish. The differential equation makes degrees distinct eigenfunctions of a Sturm–Liouville operator, explaining orthogonality structurally rather than as a table of integrals.

Knowledge Transfer

Transfer is literal across approximation, quadrature, and spherical boundary problems because the same sequence and invariants are used. Coefficients computed in one Legendre basis can be interpreted in another application after matching the interval and normalization.

The portable skeleton is Orthogonal Basis: choose an inner product, construct mutually orthogonal elements, and project. That skeleton transfers to Fourier, Chebyshev, Hermite, and wavelet systems. The Legendre name should not transfer unless unit weight on the mapped interval and the corresponding polynomial family remain present.

Relationships to Other Abstractions

Current abstraction Legendre Polynomials Domain-specific

Parents (1) — more general patterns this builds on

• Legendre Polynomials presupposes Basis Prime

  Legendre Polynomials instantiate Basis: finite initial segments span polynomials up to the matching degree, and the completed orthogonal system supports suitable function expansions.

Hierarchy path (1) — routes to 1 parentless root

• Legendre Polynomials → Basis → Set and Membership

Neighborhood in Abstraction Space

Legendre Polynomials sits in a sparse region of the domain-specific corpus (86^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Christoffel–Darboux formula — 0.80
• Minimal Polynomial (Linear Algebra) — 0.80
• Secondary Measure — 0.80
• Quadratic Space — 0.80
• Knuth–Eve Algorithm — 0.79

Computed from structural-signature embeddings · 2026-09-08