Legendre Polynomials
Legendre polynomials are what the angular half of a spherically symmetric problem is made of. Separate the Laplacian in spherical coordinates, drop any azimuthal () dependence, and set : the polar equation collapses to . Insist that the solution stay finite at the poles — a physical demand, since the potential there is finite — and the separation constant is forced to the ladder , . The regular solution is the polynomial ; its companion blows up logarithmically at the endpoints and is exiled from the interior of any sphere. Three faces of the same object organize everything that follows. As a Sturm–Liouville eigenfunction on with weight unity, is automatically orthogonal to its siblings and the family is complete — any square-integrable function has a convergent Legendre series. As a Rodrigues derivative it is a compact closed form, , ideal for proofs. And as the generating-function coefficient of it is no abstract machinery: that function is literally the inverse-distance kernel of Newton and Coulomb, so every Legendre index is a multipole order and every axisymmetric potential is a Legendre series. From this hub the theory branches: restore azimuthal dependence and is promoted to the associated Legendre functions , which dressed with become the spherical harmonics ; follow the radial coordinate and the same separation delivers the spherical Bessel functions. Legendre is the hub.
- The Legendre polynomials are the polynomial solutions of on that stay finite at the poles ; regularity is what quantises the eigenvalue to .
- They form a complete orthogonal set with weight : , normalised by .
- The generating function is the Coulomb/Newton kernel , so is the angular pattern of the -th multipole.
- Two closed forms: Rodrigues , and Bonnet's recurrence for stable numerics.
- Low orders: ; each has exactly zeros in and parity .
- They are the spherical harmonics and the building blocks of associated Legendre functions; their zeros are the optimal Gauss–Legendre quadrature nodes.
- Key idea: is the unique degree- polynomial solution of Legendre's equation regular at and normalised to — equivalently the coefficients in , which is precisely the inverse-distance kernel of potential theory.
Where this lives today
The Legendre family runs inside working instruments and codes right now. Every time a routine evaluates an integral by Gauss–Legendre quadrature it uses the zeros of as nodes — the default in finite-element solvers, spectral methods, and quantum-chemistry packages, because points nail polynomials up to degree . In cosmology the sky is a function on a sphere: the cosmic-microwave-background temperature map is expanded in spherical harmonics and compressed into the angular power spectrum ; Planck measured it to multipole , and its acoustic peaks pin down the geometry and contents of the universe. Geodesy does the same for the Earth's gravity field — the EGM2008 geoid is a spherical-harmonic series to degree and order 2190, tens of thousands of coefficients that missions like GRACE refine. In quantum scattering, the partial-wave expansion sorts an amplitude by orbital angular momentum , each channel weighted by , and resonances show up as bumps in a particular -wave. The open frontier is high-degree stability: transforms at demand recurrence algorithms that fight underflow and round-off — keeping Bonnet's 1850s recurrence a subject of active research.
The physical picture
Think of every function on as a vector, with as its dot product. Feed the monomials through Gram–Schmidt under that inner product and rescale each so it passes through at : out drops exactly . They are the natural orthogonal axes for any quantity depending on over a sphere, just as sines and cosines are on a circle. Higher means finer angular structure — crosses zero exactly times inside , a Sturm oscillation property — so a Legendre series resolves a shape the way higher multipoles resolve a charge distribution. The first figure shows the whole family, pinned together at the right endpoint.
The generating function turns this abstract basis into physics. Drop a point charge at and read its potential at ; expand in powers of and the angular shape of the -th term is exactly , with the opening angle between the two vectors. So is the monopole, the dipole pattern, the quadrupole — the Legendre index simply is the multipole order. The second figure carries a real number through it: for a source at seen from at , successive multipoles march the partial sum toward the exact kernel value.
Two further symmetries earn their keep. Each has definite parity , so even- terms carry the part of a function symmetric about and odd- the antisymmetric part — halving the work when a source has reflection symmetry. And the exact endpoint values , make the poles the cleanest places to fix boundary coefficients.
The core equations
Everything begins with the eigenvalue problem. Legendre's equation is the -independent angular piece of after ; is its regular eigenfunction and its eigenvalue.
where: — independent variable, ; — non-negative integer degree, physically the multipole order; — separation constant, quantised by regularity at . Reading it: the coefficient vanishes at the endpoints, making regular singular points — why finiteness there is a real constraint. Rodrigues' formula packages the same polynomial as a single differential operation — the workhorse for explicit expressions and orthogonality proofs.
where: — -fold ordinary derivative; — normalisation constant fixed so that . Reading it: differentiating a degree- polynomial times leaves degree . The generating function is the identity that makes Legendre polynomials physical rather than merely orthogonal — expanding its algebraic left side in produces the whole family as coefficients.
where: — expansion parameter, physically ; — cosine of the angle between field and source points. Reading it: the bracket is , so is the inverse-distance kernel — every statement about is one about a potential. Bonnet's three-term recurrence connects neighbouring degrees and is the numerically stable way to evaluate (upward recursion, well-conditioned for ).
where: — neighbouring-degree polynomials; start from , . Reading it: gives , i.e. — the recurrence builds the table. Orthogonality with weight unity, plus the explicit norm, make the family a genuine basis.
where: — Kronecker delta; — the squared norm of on . Reading it: distinct degrees are orthogonal; the norm shrinks like . Completeness turns orthogonality into an expansion: any square-integrable function is a Legendre series, coefficients read off by projection.
where: — any function with ; — coefficient, from projecting onto and dividing by the norm. Reading it: the factor is the reciprocal norm from equation (5). The multipole expansion is the generating function in physical variables — the single most used consequence of the theory.
where: — the smaller and larger of ; — angle between and . Reading it: convergence is set by , so the series converges geometrically away from . Finally a derivative recurrence, useful for quadrature weights and term-by-term integration of a series.
where: — first derivative with respect to . Reading it: integrating over collapses the right side to boundary terms — the trick behind many Legendre integrals.
The goal is to show why the eigenvalue is locked to the ladder and why the eigenfunction is a polynomial rather than an infinite series. We insert a power series into equation (1), read off the two-step recurrence it forces on the coefficients, examine how the series behaves as , and find that finiteness at the poles — a physical demand on a potential — can only be met if the series chops off. That truncation both quantises the eigenvalue and makes the solution a polynomial of definite degree.
Step 1. Seek and substitute into . Matching the coefficient of gives the two-step recurrence , which links even coefficients among themselves and odd among themselves. Why: the equation has even symmetry, so the even and odd series are independent solutions — exactly the two families we expect from a second-order ODE.
Step 2. Examine the tail. For large , , so the series behaves like , diverging as . A potential that blows up at the poles is unphysical, so a generic is not allowed. Why: the endpoints are the poles of the sphere, ordinary points of space where the field must stay finite.
Step 3. The only escape is termination: if vanishes at some , then and the series stops at a polynomial of degree . That requires with a non-negative integer, and the companion series is killed by zeroing its seed. Why: quantisation is born here — a boundary-regularity demand, not any external postulate, selects the discrete spectrum .
Step 4. Fix the normalisation by ; the discarded second solution, continued as an infinite series, is , diverging logarithmically at . Why: this pins uniquely and explains why survives only for regions that exclude the poles, such as shells. *Check: substituting into equation (1) with gives .*
Go deeper · Derivation B · 1 minBonnet's recurrence straight from the generating function
The aim is to manufacture the three-term recurrence (4) without writing down a single polynomial, using only the generating function (3). The manoeuvre is classic: differentiate with respect to , notice the derivative obeys a tidy first-order relation in , clear the denominator, and match the coefficient of a general power on the two sides. Because encodes the entire family at once, one differentiation yields a relation valid for all — far cheaper than proving the recurrence polynomial by polynomial.
Step 1. Differentiate in :
Hence . Why: this replaces the awkward power with the original , giving an exact first-order relation between and its -derivative that the series must inherit.
Step 2. Insert the series and :
Why: turning the functional relation into a statement about coefficients is what converts calculus into an algebraic recurrence.
Step 3. Collect the coefficient of : the left side gives , the right side . Equate and simplify to
Why: matching one power of delivers Bonnet's recurrence in a line, valid for every .
Step 4. Seed with , giving , , and crank: yields , then , then . Why: the recurrence plus two seeds reproduces the entire table and is the stable algorithm used in practice. *As a consistency check: upward recursion from reproduces exactly, and at every step since .*
Go deeper · Derivation C · 1 minOrthogonality and the norm 2 over (2ℓ+1)
The target is the full orthonormality statement (5): distinct Legendre polynomials are orthogonal on , and the squared norm of is . Orthogonality follows from the self-adjoint (Sturm–Liouville) structure, with the boundary term killed by the same factor that vanishes at the poles. The norm is then extracted by a slick integral: square , integrate over , keep only the diagonal by orthogonality, and recognise the elementary left-hand integral as a logarithmic series in whose coefficients read off the norm.
Step 1. Write equation (1) in self-adjoint form, , i.e. with , weight . Multiply the -equation by , the -equation by , and subtract to get a total derivative:
Why: the self-adjoint form is what makes the left side an exact derivative, so integrating it will only leave boundary data.
Step 2. Integrate over . The boundary term carries the factor , which is zero at both , so it vanishes and
For the bracket is nonzero, forcing . Why: orthogonality is a free gift of the endpoints being the singular points — no integration by parts survives.
Step 3. For the norm, square the generating function and integrate:
the last step using the orthogonality just proved. Why: squaring generates every cross term, but orthogonality annihilates all but the diagonal, leaving a clean sum over the norms alone.
Step 4. Do the elementary integral: . Matching the coefficient of against Step 3 gives
Why: the entire norm sequence drops out of one logarithmic expansion — no polynomial is integrated directly. *As a concrete check: the series is standard, and direct integration gives .*
Limiting cases
| Case | Result | Meaning |
|---|---|---|
| Endpoint values | Fixes the normalisation; read straight off at , where . | |
| Value at the origin | Odd polynomials vanish at by parity; even ones give (so , ). | |
| Large- (Laplace–Heine) | For fixed as : oscillatory, amplitude , away from the poles. | |
| Near the pole (Mehler–Heine) | Zooming into the forward direction turns the polynomial into a Bessel function — the bridge from spherical to cylindrical geometry. | |
| Parity | Even index gives an even polynomial, odd index an odd one; immediate from the symmetry of . |
Worked examples
1 · Gauss–Legendre quadrature: the zeros do the integrating (confidence builder)
The two-point Gauss–Legendre rule places its nodes at the zeros of . Find the nodes and weights, then estimate and compare with the exact value.
Step 1. The nodes are the roots of : . By symmetry the weights are equal, and since the rule must reproduce , each is . (The general formula with gives .)
Step 2. Apply the rule: .
Step 3. Compare: the exact integral is , so the two-point rule lands within , a relative error of — from just two function evaluations. That is the payoff: with nodes at 's zeros, the -point rule integrates every polynomial up to degree exactly, so it "sees" the cubic part of for free. The three-point rule (nodes , weights ) gives , cutting the error to . Two zeros of integrate to 0.33%; three zeros of reach 0.003%.
2 · A boundary-value problem on a sphere
A sphere of radius is held at surface potential , with no charge outside. Find the potential everywhere outside the sphere.
Step 1. Azimuthal symmetry makes the exterior solution of a Legendre series in decaying powers: . The task reduces to matching the boundary data — pure algebra, no integrals if we recognise the combination.
Step 2. Express the boundary data in Legendre polynomials. Since , invert: . So — only and appear, all other vanish.
Step 3. Match at term by term: and , giving and . Hence
Step 4. Read the physics. The piece is a monopole — the sphere carries net charge , the angular average of the surface potential. The piece is a pure quadrupole, decaying as ; there is no dipole because is even. Far away the monopole dominates; close in, the quadrupole distortion shows through. : a monopole plus a quadrupole, no dipole.
Physics of the portrait
Legendre polynomials are where three enterprises — the shape of the Earth, the stability of the solar system, and the theory of orthogonal functions — turned out to be the same mathematics. The man whose name they carry met them while asking a concrete question about gravity.
Origins · 1 minAdrien-Marie Legendre and how this was discovered
Adrien-Marie Legendre introduced the polynomials that bear his name in a 1782 memoir on the gravitational attraction of spheroids — the practical problem of computing the pull of a slightly flattened, spinning body like the Earth. Expanding the Newtonian potential in powers of the distance ratio, he found the coefficients were a new family of polynomials in , and proved their orthogonality and recurrence long before anyone spoke of Sturm–Liouville theory. Pierre-Simon Laplace, working the same celestial mechanics, immediately deployed them (and their -dependent cousins, the spherical harmonics) against planetary perturbations, so that for decades they were known simply as the "coefficients of Laplace." Legendre was one of the great systematisers of eighteenth-century analysis — elliptic integrals, the method of least squares (1805, sparking a bitter priority dispute with Gauss), number theory — yet it is these harmonics of the sphere that keep his name in daily use. The closed differential form came later from Olinde Rodrigues (1816) and the three-term recurrence from Ossian Bonnet; but the object, and the instinct that a potential is best organised by its multipoles, are Legendre's.
Going further
Texts. Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., Ch. 15 (Legendre functions) · Hassani, Mathematical Physics, Ch. on classical orthogonal polynomials and Sturm–Liouville theory · Stone & Goldbart, Mathematics for Physics, Sturm–Liouville and special-function chapters · Byron & Fuller, Mathematics of Classical and Quantum Physics, Ch. 5–6 · Jackson, Classical Electrodynamics, 3rd ed., Ch. 3 (multipole expansion) · Abramowitz & Stegun, Handbook of Mathematical Functions, Ch. 8 (tables and asymptotics). All key results can be checked numerically: Bonnet's recurrence and Rodrigues' formula reproduce –; the norm is confirmed by the squared-generating-function argument and by direct integration of ; the two- and three-point Gauss–Legendre estimates of are and against the exact value ; the multipole partial sums for march as ; and the decomposition holds exactly. Laplace–Heine and Mehler–Heine asymptotics are treated in Abramowitz & Stegun Ch. 8.
Prerequisites. Orthogonal Polynomials: General Theory · Generating Functions for Special Functions · The Gamma Function. Leads to. Associated Legendre Functions · Spherical Harmonics · Recurrence Relations for Special Functions · Spherical Bessel Functions.
Ask the tutor: Want to see how the same grows azimuthal structure into the associated Legendre functions and spherical harmonics — or how its zeros power the quadrature inside your solver? Ask, and we will build it from here.
Are Legendre polynomials the same thing as spherical harmonics?
Not quite — they are the azimuthally symmetric special case. A spherical harmonic depends on both angles; setting removes the -dependence and leaves a Legendre polynomial up to a constant: . The general are the associated Legendre functions times , and the plain is just . So whenever a problem has rotational symmetry about an axis — a uniform field, an on-axis charge — the full spherical-harmonic machinery collapses to a single Legendre series in .
Why does the generating function have that particular square-root form?
Because it is a disguised distance. The separation between two points at radii with opening angle is . Factor out and set , : the bracket becomes , so . The generating function is not chosen for convenience — it is the Newtonian/Coulomb kernel itself, which is why its coefficients in are the multipole patterns and why shows up in every potential problem.
When do I need Q_ℓ, the second solution?
Whenever your region excludes the poles . The two solutions are (finite on all of ) and (finite on the open interval but diverging logarithmically at the endpoints). For the interior of a solid sphere, or wherever the polar axis is in the domain, is unphysical and dropped. But for a region that avoids the axis — a cone, or the space between two coaxial cones — is regular and both solutions are needed. It is exactly like keeping the divergent radial solution of Laplace's equation when the origin lies outside your domain.
How do I actually compute P_ℓ(x) for large ℓ on a computer?
Use Bonnet's recurrence upward, not Rodrigues' formula. Start from , and iterate . For this is numerically stable — the polynomials stay bounded by , so nothing overflows and errors do not amplify. Rodrigues' formula, by contrast, needs -fold differentiation and suffers catastrophic cancellation; it is a proof tool, not a computational one. For the zeros (quadrature nodes), use Newton's method seeded with , evaluating and via the recurrence.
What is the connection to Bessel functions?
It is a limit linking spherical and cylindrical geometry. Away from the poles, a high-degree oscillates like a damped cosine (Laplace–Heine), the spherical analogue of a plane wave. Zoom into the forward direction with argument and let : the Mehler–Heine formula gives — the polynomial becomes a Bessel function. Physically, a tiny patch of a huge sphere looks flat, and the harmonics on a flat patch with circular symmetry are Bessel functions. That is why the two families are neighbours in every course.
Why is P_ℓ(1) = 1 chosen instead of unit norm?
Because is the physically meaningful point: it is , two directions aligned. Then means every multipole contributes with unit weight along the axis, so the on-axis potential of a point charge is the geometric series , the elementary result. Unit normalisation would instead scatter factors of through every formula. The price of is the explicit norm you must divide by for series coefficients — a small cost for clean endpoint and generating-function values.