Worked examples — Legendre's equation and Legendre polynomials (intro)
Before we start, one reminder of notation, so nothing is used unearned:
The scenario matrix
| Cell | Case class | What's special | Example |
|---|---|---|---|
| A | Build a new from the recurrence | tests the engine, even parity | Ex 1 () |
| B | Rodrigues' formula for a specific | alternate route, odd parity | Ex 2 () |
| C | Degenerate input | the "flat pattern", trivial recurrence | Ex 3 |
| D | Endpoint / sign values , parity | boundary + negative argument | Ex 4 |
| E | Orthogonality with (different indices) | the integral is zero | Ex 5 |
| F | Orthogonality with (normalization integral) | the integral is nonzero | Ex 6 |
| G | Expand a given polynomial in the basis | real "Fourier-in-polynomials" use | Ex 7 |
| H | Word problem: potential on a sphere () | physics, limiting behaviour at poles | Ex 8 |
| I | Exam twist: non-integer , why no polynomial | degenerate/limiting termination fails | Ex 9 |
The recurrence engine we lean on repeatedly:
Cell A — Build from the recurrence
Step 1 — pick the parity. Since is even, use the even series: start from , set . Why this step? The recurrence links coefficients two apart; terminates the even branch at degree 4, so the odd branch would only add junk (and must vanish for a genuine ).
Step 2 — climb the ladder. With , . Feed into the engine:
- ✔ terminates.
Why this step? Each rung uses the previous; the numerator hitting at is exactly the "magic termination" — it kills everything of degree and up.
Step 3 — assemble.
Step 4 — normalize with . So
Verify: ✔. Matches the parent's forecast answer. Top coefficient positive — check your guess.
Cell B — Rodrigues' formula for (odd parity)
Step 1 — write the prefactor. . Why this step? This constant is what makes come out right; getting it wrong scales the whole answer.
Step 2 — expand with the binomial theorem. The binomial theorem says ; here , , , and the coefficients read off Pascal's row with alternating signs from the : Why this step? Differentiating a clean polynomial 5 times is far easier than differentiating a product; the binomial theorem gives that clean expansion in one line.
Step 3 — differentiate five times. Term-by-term, (and if ):
- lower terms vanish.
Why this step? Only terms of degree survive five derivatives — this is why the result has degree exactly .
Step 4 — divide by .
Verify: ✔. And ✔ (odd), matching the forecast.
Cell C — The degenerate case
Step 1 — write the equation with . Why this step? Plugging removes the undifferentiated term, leaving a first-order equation in .
Step 2 — substitute . Why this step? It's now separable; is exactly , which we can integrate.
Step 3 — integrate. Then
Step 4 — apply boundedness at the poles. As , . To stay bounded we must set , leaving const. Normalize : .
Verify: The discarded piece, up to the constant factor, is , whose derivative is — matching . This is , the log-divergent second solution the parent warned about. Answer to forecast: yes, a second solution exists — we just reject it as unbounded.
Cell D — Endpoint values and negative argument
Step 1 — use parity at . The rule .
Why this step? . Parity does the work for free — no polynomial evaluation needed.
Step 2 — reflect the whole function. . Explicitly — and indeed ✔.
Step 3 — a plain interior value. , so
Verify: By evenness ✔. Forecast: , .
Cell E — Orthogonality with different indices ()
Step 1 — invoke orthogonality. . Here , so . Why this step? Different eigenvalues of a Sturm–Liouville problem ⇒ orthogonal eigenfunctions (see Sturm-Liouville Theory). No computation required.
Step 2 — sanity by parity. is even, is odd, so the product is odd; the integral of an odd function over the symmetric interval is . Why this step? It confirms the answer by an independent route — parity, not orthogonality.
Verify: Direct: integrates an odd polynomial → ✔.
Cell F — Orthogonality with equal indices (normalization integral)
Step 1 — square . . Why this step? We need the explicit integrand to check the theorem, not just quote it.
Step 2 — integrate each power over . Using :
Step 3 — combine.
Verify: Rule gives ✔. Matches. Also , as any integral of a square must be.
Cell G — Expand a given polynomial in the basis
Step 1 — decide which can appear. Degree and even parity ⇒ only and . Why this step? The form a basis; a degree-2 even polynomial lives entirely in the span of , so the sum is finite.
Step 2 — match by algebra (fastest here). Write . Coefficient of : . Constant: .
Step 3 — cross-check with the projection formula. . The integral , so ✔. Why this step? Orthogonality turns "find the coefficients" into a single integral each — the Fourier Series idea in polynomial clothing.
Verify: ✔.
Cell H — Word problem: potential outside a hemisphere (physics, )

How to read the figure. Left panel: a sphere seen edge-on; each coloured spoke is drawn at an angle from the north pole, and its colour encodes the surface potential there — warm near the top (high ) cooling toward the bottom. The two labelled arrows mark the poles where we will read off values. Right panel: the same plotted against ; the coral dot at sits far higher than the lavender dot at — a visual proof that the top and bottom are not the same, which is exactly the fingerprint of the odd (dipole) term. If contained only even modes, the curve would be symmetric about ; the tilt you see is the dipole.
Step 1 — substitute . . Why this step? In Laplace's Equation in Spherical Coordinates, boundary data naturally comes in powers of ; converting to lets us use Legendre machinery directly.
Step 2 — use the Ex 7 expansion for . , plus , : Why this step? Each is one "multipole mode"; the coefficients are the physical monopole/dipole/quadrupole strengths.
Step 3 — evaluate at the poles using . North pole : . South pole : .
Verify: Direct from : at , ✔; at , ✔. The two poles differ — the (dipole, top-vs-bottom) term breaks the symmetry, exactly what the figure's asymmetric shading shows. Both values are finite — the are bounded at the poles, the physical selection rule at work.
Cell I — Exam twist: non-integer , why no polynomial
Step 1 — write . . Why this step? Termination requires some integer with . But is always an integer for integer (), never .
Step 2 — compute the first few ratios (even branch ).
- — and it never becomes zero.
Why this step? Explicitly seeing proves the series is genuinely infinite; there's no clean stopping index.
Step 3 — convergence argument at the endpoints (ratio test). Look at the ratio of successive even coefficients for large : More precisely the ratio behaves like , so the coefficients shrink only like — far too slowly. Compare with the divergent series at : the terms at do not go to zero fast enough to be summable, so the series diverges as . Why this step? This is the reason physics forces to be a non-negative integer — only then does the numerator vanish, the series stop, and the solution stay finite at the poles.
Verify: Numerically, , and the ratio as — the tell-tale of a boundary-divergent series. Non-integer ⇒ no polynomial ✔.
Recall Self-test: match example to matrix cell
Which cell is "the answer is zero by parity"? ::: Cell E ( orthogonality). Which cell shows the second solution explicitly? ::: Cell C ( degenerate case). Which cell proves non-integer gives no polynomial? ::: Cell I. Which coefficients express ? ::: (Cell G).
Connections
- Power Series / Frobenius Method — the recurrence engine used in Cells A, C, I.
- Sturm-Liouville Theory — why the orthogonality of Cells E, F holds.
- Laplace's Equation in Spherical Coordinates — origin of the Cell H potential problem.
- Fourier Series — the "expand in a basis" idea of Cell G.
- Generating Functions — an alternate route to the same .
- Associated Legendre Functions & Spherical Harmonics — the next step after this intro.