Chapter 6 · Ordinary Differential Equations

6.3 Series Solutions, Legendre and Bessel Functions, Sturm Theory

Power series solutions at ordinary points, the Frobenius method at regular singular points, Legendre polynomials and Bessel functions with their recurrences and orthogonality, and Sturm's separation and comparison theorems with regular Sturm–Liouville problems — the variable-coefficient toolkit of GATE MA.

The constant-coefficient and Cauchy–Euler equations of §6.1 can be solved with exponentials and powers. Most second-order equations that arise in physics cannot: Legendre's equation comes from separating Laplace's equation in spherical coordinates, Bessel's equation from separating the wave or heat equation in a disc or a cylinder, Airy's equation from optics and quantum tunnelling. For such equations the next best thing to a closed formula is a power series whose coefficients obey a recurrence. Where the coefficients of the equation are analytic, ordinary power series work; at a regular singular point Frobenius' idea of multiplying by $x^r$ rescues the method; and two families of solutions — Legendre polynomials and Bessel functions — are important enough to have their own catalogue of identities. When no formula is available at all, Sturm's theorems still say a great deal about the zeros of solutions, and the Sturm–Liouville theory explains why the eigenfunctions of these problems are orthogonal.

GATE MA asks this material in a very recognisable way: classify a singular point and find the indicial roots; give a lower bound for the radius of convergence of a series solution; compute a coefficient of a series solution (a favourite NAT); evaluate $\int_{-1}^1 x^kP_mP_n\,dx$ or a value $P_n(0)$; simplify an expression with Bessel recurrences or $J_{\pm1/2}$; decide, in an MSQ, how many zeros a solution of $y''+q(x)y=0$ can have on an interval; and find the eigenvalues of a Sturm–Liouville problem. Throughout, the equation is written $y''+P(x)y'+Q(x)y=0$ or $P_0(x)y''+P_1(x)y'+P_2(x)y=0$, and "analytic at $x_0$" means "equal to a convergent power series in $x-x_0$ near $x_0$".

Power Series Solutions at Ordinary Points

📘 Definition 6.15 — Ordinary, regular singular and irregular singular points
Consider $y''+P(x)y'+Q(x)y=0$. A point $x_0$ is an ordinary point if $P$ and $Q$ are both analytic at $x_0$; otherwise it is a singular point. A singular point $x_0$ is regular singular if $(x-x_0)P(x)$ and $(x-x_0)^2Q(x)$ are both analytic at $x_0$, and irregular singular otherwise. For $P_0y''+P_1y'+P_2y=0$ with polynomial coefficients without a common factor, $P=P_1/P_0$ and $Q=P_2/P_0$; the singular points are the (real or complex) zeros of $P_0$.

Informally: at a regular singular point $P$ has at worst a simple pole and $Q$ at worst a double pole. Thus $x=0$ is a regular singular point of Bessel's equation $x^2y''+xy'+(x^2-\nu^2)y=0$ (here $xP=1$ and $x^2Q=x^2-\nu^2$), while it is an irregular singular point of $x^3y''+y=0$ ($x^2Q=1/x$ is not analytic).

📐 Theorem 6.28 — Power series solutions at an ordinary point
Let $x_0$ be an ordinary point of $y''+Py'+Qy=0$, and suppose the power series of $P$ and $Q$ about $x_0$ converge for $|x-x_0|\lt R$. Then for any $a_0,a_1$ there is exactly one solution of the form $$y=\sum_{k=0}^{\infty}a_k(x-x_0)^k,\qquad y(x_0)=a_0,\ \ y'(x_0)=a_1,$$ and this series converges for $|x-x_0|\lt R$. The other coefficients are determined by a recurrence obtained by substituting the series into the equation. The two solutions with $(a_0,a_1)=(1,0)$ and $(0,1)$ form a fundamental set. For $P_0y''+P_1y'+P_2y=0$ with polynomial coefficients, $R$ can be taken to be the distance from $x_0$ to the nearest zero of $P_0$ in the complex plane.

Proof (idea; the full majorant proof is in the 📚 box). Formal part. Take $x_0=0$, write $P=\sum p_kx^k$, $Q=\sum q_kx^k$ and substitute $y=\sum a_kx^k$. The coefficient of $x^k$ in $y''+Py'+Qy$ is

$$(k+2)(k+1)a_{k+2}+\sum_{j=0}^{k}\Big[(j+1)a_{j+1}p_{k-j}+a_jq_{k-j}\Big],$$

and setting it to zero expresses $a_{k+2}$ through $a_0,\dots,a_{k+1}$. So $a_0,a_1$ determine the whole series. Convergence. One compares $|a_k|$ with the coefficients of an explicitly solvable "majorant" equation (Cauchy's method) and shows that the series converges wherever the series of $P$ and $Q$ do. A slicker route uses complex analysis: the same existence theorem holds for $y''+P(z)y'+Q(z)y=0$ on the disc $|z|\lt R$ of $\mathbb{C}$, the solution is holomorphic there, and the Taylor series of a holomorphic function converges on every disc contained in its domain. Uniqueness and independence follow from the uniqueness theorem of §6.1: a solution is fixed by $y(x_0)$ and $y'(x_0)$, and the Wronskian of the two basic solutions at $x_0$ is $\det I=1\ne0$. ∎

🧭 Problem-solving strategy — the series method in four steps
  1. Locate and classify the singular points (zeros of $P_0$, also complex ones). The radius guaranteed about $x_0$ is the distance to the nearest one.
  2. Substitute $y=\sum a_kx^k$; shift indices so that every sum runs over the same power $x^k$; read off the recurrence (often a two-term recurrence $a_{k+2}=c(k)\,a_k$, which splits even and odd coefficients).
  3. Write the two basic solutions and, if possible, recognise them (an exponential, a polynomial, $1/(1+x^2)$, …). A polynomial solution appears exactly when the recurrence factor vanishes for some $k$.
  4. If the recurrence gives $\lim|a_{k+2}/a_k|=L$, the even and odd series converge for $|x|\lt1/\sqrt L$ — a useful check against step 1.
✏️ Example 1 — A series that sums to a Gaussian
Solve $y''+xy'+y=0$ by power series about $x=0$. Identify the solutions, and find the solution with $y(0)=1$, $y'(0)=0$ and its value of $y^{(6)}(0)$.
Classify $P=x$ and $Q=1$ are polynomials: every point is ordinary and Theorem 6.28 gives series converging on all of $\mathbb{R}$.
Recurrence With $y=\sum a_kx^k$: $y''=\sum_k(k+2)(k+1)a_{k+2}x^k$ and $xy'=\sum_kka_kx^k$. The coefficient of $x^k$ gives $(k+2)(k+1)a_{k+2}+(k+1)a_k=0$, that is $$a_{k+2}=-\frac{a_k}{k+2}\qquad(k\ge0).$$
Even series $a_2=-\tfrac{a_0}{2}$, $a_4=\tfrac{a_0}{2\cdot4}$, and in general $a_{2m}=\dfrac{(-1)^m}{2^mm!}a_0$. So $$y_1=\sum_{m\ge0}\frac{(-1)^m}{m!}\Big(\frac{x^2}{2}\Big)^m=e^{-x^2/2}.$$
Odd series $a_{2m+1}=\dfrac{(-1)^m a_1}{1\cdot3\cdot5\cdots(2m+1)}$, so $y_2=x-\tfrac{x^3}{3}+\tfrac{x^5}{15}-\tfrac{x^7}{105}+\cdots$. This is $e^{-x^2/2}\int_0^xe^{s^2/2}\,ds$, as reduction of order (§6.1) confirms; it is not elementary.
IVP $y(0)=1,y'(0)=0$ gives $y=e^{-x^2/2}$. Then $y^{(6)}(0)=6!\,a_6=720\cdot\left(-\tfrac{1}{48}\right)=-15$. Check: the Taylor coefficient of $x^6$ in $e^{-x^2/2}$ is $\tfrac{(-1/2)^3}{3!}=-\tfrac1{48}$. ✓
✏️ Example 2 — Classifying points and predicting the radius
(a) Classify the singular points of $x^3(x-1)y''+(x-1)y'+2xy=0$. (b) Find the indicial roots of $2x^2y''+3xy'-(1+x)y=0$ at $0$ (Definition 6.16 below). (c) Give the radius of convergence guaranteed by Theorem 6.28 for series solutions of $(x^2-2x+5)y''+xy'-y=0$ about $x_0=0$ and about $x_0=1$. (d) Show that $(1+x^2)y''+4xy'+2y=0$ has the solution $\dfrac1{1+x^2}$, and explain why its Maclaurin series converges only for $|x|\lt1$ although the function is smooth on $\mathbb{R}$.
(a) $P=\dfrac{x-1}{x^3(x-1)}=\dfrac1{x^3}$ and $Q=\dfrac{2}{x^2(x-1)}$. At $0$: $xP=x^{-2}$ is not analytic, so $0$ is irregular. At $1$: $P$ is analytic there and $(x-1)Q=2/x^2$, $(x-1)^2Q=2(x-1)/x^2$ are analytic, so $1$ is regular singular. (The factor $x-1$ cancels in $P$, but not in $Q$.)
(b) $xP=\tfrac32$ and $x^2Q=-\tfrac{1+x}{2}$, so $p_0=\tfrac32$, $q_0=-\tfrac12$ and $r(r-1)+\tfrac32r-\tfrac12=0$, i.e. $2r^2+r-1=(2r-1)(r+1)=0$: $r=\tfrac12,-1$. The difference $\tfrac32$ is not an integer, so two Frobenius series exist (Theorem 6.29).
(c) $x^2-2x+5=0$ at $x=1\pm2i$. The distance from $0$ is $|1\pm2i|=\sqrt5$ and from $1$ it is $|\pm2i|=2$. So the series converge at least for $|x|\lt\sqrt5$, respectively $|x-1|\lt2$.
(d) $\big((1+x^2)y\big)''=(1+x^2)y''+4xy'+2y$, so the equation says $\big((1+x^2)y\big)''=0$: the general solution is $\dfrac{a+bx}{1+x^2}$. The series $\frac1{1+x^2}=\sum(-1)^kx^{2k}$ has radius $1$ — exactly the distance from $0$ to the complex singular points $\pm i$ of the equation. The real line cannot see these points, but the power series can. This is the reason for "in the complex plane" in Theorem 6.28.

Regular Singular Points: the Frobenius Method

At a singular point a power series may not exist. For the Cauchy–Euler equation $x^2y''+axy'+by=0$ the solutions are powers $x^r$ with $r(r-1)+ar+b=0$, often non-integer or with a $\log x$. Frobenius' method combines the two ideas: near a regular singular point, look for $x^r$ times a power series.

📘 Definition 6.16 — Indicial equation and exponents
Let $0$ be a regular singular point of $y''+Py'+Qy=0$, with $xP(x)=\sum_{k\ge0}p_kx^k$ and $x^2Q(x)=\sum_{k\ge0}q_kx^k$. The indicial polynomial is $F(r)=r(r-1)+p_0r+q_0$, the indicial equation is $F(r)=0$, and its roots $r_1,r_2$ are the exponents at $0$. (At a regular singular point $x_0\ne0$, replace $x$ by $x-x_0$.)
📐 Theorem 6.29 — Frobenius' theorem
Let $0$ be a regular singular point, with the series of $xP$ and $x^2Q$ convergent for $|x|\lt R$, and let the exponents $r_1,r_2$ be real with $r_1\ge r_2$. Then on $0\lt x\lt R$ there are two linearly independent solutions of the following forms, all series converging for $|x|\lt R$ and with $a_0=b_0=1$:
  1. always: $y_1=x^{r_1}\sum_{k\ge0}a_kx^k$;
  2. if $r_1-r_2\notin\mathbb{Z}$: $y_2=x^{r_2}\sum_{k\ge0}b_kx^k$;
  3. if $r_1=r_2$: $y_2=y_1\log x+x^{r_1}\sum_{k\ge1}b_kx^k$ — a logarithm is unavoidable;
  4. if $r_1-r_2=N\in\mathbb{N}$: $y_2=c\,y_1\log x+x^{r_2}\sum_{k\ge0}b_kx^k$ for some constant $c$, which may be zero.
On $-R\lt x\lt0$ the same holds with $x^r$ and $\log x$ replaced by $|x|^r$ and $\log|x|$.

Proof (the algebra in full, convergence sketched). Substitute $y=\sum_{k\ge0}a_kx^{k+r}$ ($a_0=1$) into $x^2y''+x(xP)y'+(x^2Q)y=0$. The coefficient of $x^{k+r}$ is

$$F(r+k)\,a_k+\sum_{j=0}^{k-1}\Big[(r+j)\,p_{k-j}+q_{k-j}\Big]a_j=0 .\qquad(\ast)$$

For $k=0$ this is $F(r)=0$: $r$ must be an exponent. Since $F(s)=(s-r_1)(s-r_2)$, we have $F(r_1+k)=k(k+r_1-r_2)\ne0$ for every $k\ge1$, so $(\ast)$ determines all $a_k$ for $r=r_1$: this is (1). For $r=r_2$ the same works unless $F(r_2+k)=0$ for some $k\ge1$, i.e. unless $r_1-r_2=k$ is a positive integer: this gives (2). In case (4), at $k=N$ the left side of $(\ast)$ reads $0\cdot b_N+(\text{known})$; if the known part happens to vanish, $b_N$ is free and $c=0$, otherwise no series of this form exists and a logarithm is needed.

For (3), let $r$ vary near $r_1$, define $a_k(r)$ by $(\ast)$ for $k\ge1$ (possible since $F(r+k)\ne0$ for $r$ near $r_1$) and set $Y(x,r)=\sum a_k(r)x^{k+r}$. Then all coefficients except the first cancel, and

$$x^2Y''+x(xP)Y'+(x^2Q)Y=F(r)\,x^r=(r-r_1)^2x^r .$$

Differentiating with respect to $r$ and putting $r=r_1$, the right side gives $2(r-r_1)x^r+(r-r_1)^2x^r\log x=0$, so $\partial Y/\partial r\,(x,r_1)=y_1\log x+\sum_ka_k'(r_1)x^{k+r_1}$ is a solution; it is independent of $y_1$ because of the logarithm. A variant of this differentiation (applied to $(r-r_2)Y$) produces case (4). Convergence of all these series for $|x|\lt R$ is proved by the majorant method, as for Theorem 6.28 (📚 box). ∎

Two remarks that GATE uses constantly. At an ordinary point $p_0=q_0=0$, so the exponents are $0$ and $1$ — and no logarithm occurs (Exercise I.8). And the Cauchy–Euler equation $x^2y''+axy'+by=0$ is the case where $xP$ and $x^2Q$ are constants: all $p_k,q_k$ with $k\ge1$ vanish, the series stop after one term, and the solutions are $x^{r_1},x^{r_2}$ (or $x^{r_1},x^{r_1}\log x$ when $r_1=r_2$).

✏️ Example 3 — Two Frobenius series
Find two linearly independent Frobenius solutions of $3xy''+y'-y=0$ about $x=0$, with the first four terms of each.
Classify In normal form $P=\tfrac{1}{3x}$, $Q=-\tfrac1{3x}$: $xP=\tfrac13$ and $x^2Q=-\tfrac x3$ are analytic (polynomials, $R=\infty$), so $0$ is regular singular with $p_0=\tfrac13$, $q_0=0$.
Exponents $F(r)=r(r-1)+\tfrac r3=r\left(r-\tfrac23\right)$: $r_1=\tfrac23$, $r_2=0$, difference $\tfrac23\notin\mathbb{Z}$. Case (2): two series, no logarithm.
Recurrence With $y=\sum a_kx^{k+r}$: $3xy''+y'=\sum(k+r)(3k+3r-2)a_kx^{k+r-1}$ and $y=\sum a_{k-1}x^{k+r-1}$. Hence $$(k+r)(3k+3r-2)\,a_k=a_{k-1}\qquad(k\ge1).$$
$r=0$ $a_k=\dfrac{a_{k-1}}{k(3k-2)}$: $a_1=1$, $a_2=\tfrac18$, $a_3=\tfrac1{168}$, so $y_2=1+x+\tfrac{x^2}{8}+\tfrac{x^3}{168}+\cdots$.
$r=\tfrac23$ $(k+\tfrac23)\cdot3k\,a_k=a_{k-1}$, i.e. $a_k=\dfrac{a_{k-1}}{k(3k+2)}$: $a_1=\tfrac15$, $a_2=\tfrac1{80}$, $a_3=\tfrac1{2640}$, so $y_1=x^{2/3}\left(1+\tfrac x5+\tfrac{x^2}{80}+\tfrac{x^3}{2640}+\cdots\right)$.
Check Both ratio tests give $a_k/a_{k-1}\to0$: the series converge for all $x$, as $R=\infty$ predicts; the solutions are valid on $(0,\infty)$ (and on $(-\infty,0)$ with $|x|^{2/3}$). $y_1/y_2\sim x^{2/3}$ is not constant, so they are independent.
✏️ Example 4 — Prove or disprove: an integer difference forces a logarithm
At $x=0$ the exponents of $x^2y''+xy'+\left(x^2-\tfrac14\right)y=0$ (Bessel's equation of order $\tfrac12$) differ by $1$. Prove or disprove: every second solution contains $\log x$. Then do the same for $xy''-y=0$.
Exponents $p_0=1$, $q_0=-\tfrac14$: $F(r)=r^2-\tfrac14$, so $r_1=\tfrac12$, $r_2=-\tfrac12$, $N=1$.
Recurrence With $y=\sum a_kx^{k+r}$ the coefficient of $x^{k+r}$ is $F(k+r)a_k+a_{k-2}=0$ (with $a_{-1}=0$). For $r=-\tfrac12$ and $k=1$: $F(\tfrac12)a_1+a_{-1}=0\cdot a_1+0=0$. The equation is satisfied for every $a_1$: no obstruction, so $c=0$ in Theorem 6.29(4).
Identify Put $y=x^{-1/2}u$. Then $x^2y''+xy'=x^{-1/2}\left(x^2u''+\tfrac14u\right)$, and the equation becomes $u''+u=0$. So $y=x^{-1/2}(A\cos x+B\sin x)$: the statement is false here — both solutions are Frobenius series, $x^{-1/2}\cos x$ and $x^{1/2}\cdot\frac{\sin x}{x}$. (Up to the factor $\sqrt{2/\pi}$ these are $J_{-1/2}$ and $J_{1/2}$, Theorem 6.33.)
$xy''-y=0$ $x^2y''-x\cdot y=0$: $p_0=0$, $q_0=0$, $F(r)=r(r-1)$, exponents $1,0$. The recurrence is $(k+r)(k+r-1)a_k=a_{k-1}$. For $r=0$, $k=1$: $0\cdot a_1=a_0=1$ — impossible. So here a logarithm is forced: $c\ne0$. The first solution is $y_1=\sum_{k\ge0}\dfrac{x^{k+1}}{k!\,(k+1)!}$.
Lesson When $r_1-r_2\in\mathbb{N}$, test the recurrence at $k=N$ for $r=r_2$; both outcomes occur.

Legendre Polynomials

📘 Definition 6.17 — Legendre's equation and the Legendre polynomials
Legendre's equation of index $\nu$ is $(1-x^2)y''-2xy'+\nu(\nu+1)y=0$. The point $0$ is ordinary, the singular points $\pm1$ are regular singular (with exponents $0,0$), and by Theorem 6.28 the series solutions about $0$ converge for $|x|\lt1$, with recurrence $$a_{k+2}=\frac{(k-\nu)(k+\nu+1)}{(k+1)(k+2)}\,a_k .$$ For $\nu=n\in\{0,1,2,\dots\}$ the factor $k-n$ vanishes at $k=n$, so the even series (if $n$ is even) or the odd series (if $n$ is odd) terminates. The resulting polynomial solution of degree $n$, normalised by $P_n(1)=1$, is the Legendre polynomial $P_n$.

The first few are $P_0=1$, $P_1=x$, $P_2=\tfrac12(3x^2-1)$, $P_3=\tfrac12(5x^3-3x)$, $P_4=\tfrac18(35x^4-30x^2+3)$, $P_5=\tfrac18(63x^5-70x^3+15x)$. The recurrence comes from substituting $y=\sum a_kx^k$: the coefficient of $x^k$ is $(k+2)(k+1)a_{k+2}-\left[k(k+1)-\nu(\nu+1)\right]a_k$, and $k(k+1)-\nu(\nu+1)=(k-\nu)(k+\nu+1)$.

📐 Theorem 6.30 — Rodrigues' formula and the basic values
For $n\ge0$, $$P_n(x)=\frac{1}{2^n\,n!}\,\frac{d^n}{dx^n}\left(x^2-1\right)^n .$$ Consequently $P_n$ has degree $n$ with leading coefficient $\dfrac{(2n)!}{2^n(n!)^2}$, $P_n(-x)=(-1)^nP_n(x)$, $P_n(1)=1$, $P_n(-1)=(-1)^n$, and $P_n'(1)=\tfrac12n(n+1)$. Every polynomial solution of Legendre's equation with $\nu=n$ is a constant multiple of $P_n$.

Proof. Let $u=(x^2-1)^n$, so $(x^2-1)u'=2nxu$. Differentiate this identity $n+1$ times with Leibniz' rule; only three terms survive on each side:

$$(x^2-1)u^{(n+2)}+2(n+1)x\,u^{(n+1)}+n(n+1)u^{(n)}=2nx\,u^{(n+1)}+2n(n+1)u^{(n)} .$$

Rearranged, $(1-x^2)w''-2xw'+n(n+1)w=0$ for $w=u^{(n)}$: the right-hand side of Rodrigues' formula solves Legendre's equation, and it is a polynomial of degree $n$ with leading coefficient $\frac{2n(2n-1)\cdots(n+1)}{2^nn!}=\frac{(2n)!}{2^n(n!)^2}$. Polynomial solutions form a one-dimensional space, because only one of the two series of Definition 6.17 terminates (the other has $a_{k+2}/a_k\to1$ and nonzero coefficients for all large $k$). So Rodrigues' polynomial is a multiple of $P_n$, and it remains to check its value at $1$: writing $u=(x-1)^n(x+1)^n$, every term of $u^{(n)}$ in Leibniz' rule contains a factor $x-1$ except $n!\,(x+1)^n$, which equals $n!\,2^n$ at $x=1$. Parity: $u$ is even, so $u^{(n)}$ has the parity of $n$. Finally, putting $x=1$ in Legendre's equation gives $-2P_n'(1)+n(n+1)P_n(1)=0$. ∎

📐 Theorem 6.31 — Generating function and Bonnet's recurrence
For $|x|\le1$ and $|t|\lt1$, $$\frac{1}{\sqrt{1-2xt+t^2}}=\sum_{n=0}^{\infty}P_n(x)\,t^n ,$$ and for $n\ge1$: $(n+1)P_{n+1}(x)=(2n+1)\,x\,P_n(x)-n\,P_{n-1}(x)$. Also $P_{n+1}'-P_{n-1}'=(2n+1)P_n$ and $xP_n'-P_{n-1}'=nP_n$.

Proof. Write $G(x,t)=(1-2xt+t^2)^{-1/2}=(1-u)^{-1/2}$ with $u=2xt-t^2$ and expand by the binomial series: the coefficient $g_n(x)$ of $t^n$ is a polynomial in $x$ of degree $n$. Differentiating, $(1-2xt+t^2)\,G_t=(x-t)\,G$; inserting $G=\sum g_nt^n$ and comparing the coefficients of $t^n$,

$$(n+1)g_{n+1}-2xn\,g_n+(n-1)g_{n-1}=x\,g_n-g_{n-1},$$

which is Bonnet's recurrence for $g_n$. Also $g_0=1$ and $g_1=x$ (from $G=1+xt+O(t^2)$). A similar computation with $G_x$, namely $(1-2xt+t^2)G_x=tG$, gives the derivative identities. To see that $g_n=P_n$, one checks by differentiation that $G$ satisfies $(1-x^2)G_{xx}-2xG_x+t\,\partial_t^2(tG)=0$; comparing coefficients shows that $g_n$ solves Legendre's equation with $\nu=n$. It is a polynomial, and $g_n(1)=1$ because $G(1,t)=(1-t)^{-1}=\sum t^n$; by the uniqueness in Theorem 6.30, $g_n=P_n$. ∎

📐 Theorem 6.32 — Orthogonality, norms, expansions and zeros
  1. $\displaystyle\int_{-1}^{1}P_m(x)P_n(x)\,dx=\frac{2}{2n+1}\,\delta_{mn}$.
  2. $\int_{-1}^1q(x)P_n(x)\,dx=0$ for every polynomial $q$ of degree $\lt n$. Every polynomial $f$ of degree $N$ is $f=\sum_{n=0}^Nc_nP_n$ with $c_n=\frac{2n+1}{2}\int_{-1}^1fP_n\,dx$; more generally, for $f$ square-integrable on $[-1,1]$, $\sum c_nP_n$ converges to $f$ in the mean, and the partial sum of degree $N$ is the best polynomial approximation of degree $\le N$ in the $L^2$ sense.
  3. $P_n$ has exactly $n$ zeros in $(-1,1)$, all simple.

Proof. (1), $m\ne n$: Legendre's equation is $\left((1-x^2)y'\right)'+n(n+1)y=0$. Multiply the equation for $P_n$ by $P_m$, the one for $P_m$ by $P_n$, subtract and integrate:

$$\big[n(n+1)-m(m+1)\big]\int_{-1}^1P_mP_n\,dx=\Big[(1-x^2)\big(P_mP_n'-P_nP_m'\big)\Big]_{-1}^{1}=0,$$

because $1-x^2$ vanishes at $\pm1$ — no boundary condition is needed. Since $n(n+1)\ne m(m+1)$, the integral is $0$. For $m=n$ use Rodrigues: with $u=(x^2-1)^n$, every $u^{(k)}$, $k\lt n$, vanishes at $\pm1$, so $n$ integrations by parts give $\int(u^{(n)})^2=(-1)^n\int u\,u^{(2n)}=(2n)!\int_{-1}^1(1-x^2)^n\,dx$. The last integral equals $\frac{2^{2n+1}(n!)^2}{(2n+1)!}$ (substitute $x=\cos\theta$, or use the Beta function), so $\int P_n^2=\frac{(2n)!\,2^{2n+1}(n!)^2}{(2n+1)!\,4^n(n!)^2}=\frac{2}{2n+1}$.

(2) $P_0,\dots,P_{n-1}$ have degrees $0,\dots,n-1$, so they span the polynomials of degree $\lt n$; apply (1). The coefficient formula follows by multiplying $f=\sum c_kP_k$ by $P_n$ and integrating; the mean convergence and best-approximation statements are the Hilbert-space facts of §8.3 for the orthogonal basis $\{P_n\}$ of $L^2[-1,1]$. (3) Let $x_1,\dots,x_k$ be the points of $(-1,1)$ where $P_n$ changes sign. If $k\lt n$, then $P_n(x)\prod_i(x-x_i)$ has constant sign on $(-1,1)$ and is not identically zero, so its integral is nonzero — contradicting (2). Hence $k\ge n$; as $\deg P_n=n$, the $n$ sign changes are all the zeros, and they are simple. ∎

✏️ Example 5 — Legendre computations GATE asks for
(a) Expand $f(x)=x^3+2x^2$ in Legendre polynomials and evaluate $\int_{-1}^1f(x)P_2(x)\,dx$. (b) Show that $\int_{-1}^1xP_n(x)P_{n-1}(x)\,dx=\dfrac{2n}{4n^2-1}$. (c) Find $P_4(0)$ and $P_5(0)$ from the generating function. (d) Find the solution of $(1-x^2)y''-2xy'+20y=0$ that is bounded on $(-1,1)$ and satisfies $y(1)=3$.
(a) From $P_3=\tfrac12(5x^3-3x)$: $x^3=\tfrac25P_3+\tfrac35P_1$; from $P_2$: $x^2=\tfrac23P_2+\tfrac13P_0$. So $$f=\tfrac25P_3+\tfrac43P_2+\tfrac35P_1+\tfrac23P_0 .$$ By orthogonality only the $P_2$ term survives: $\int_{-1}^1fP_2\,dx=\tfrac43\cdot\tfrac25=\tfrac{8}{15}$. Check: the coefficients add up to $f(1)=3$ since every $P_n(1)=1$: $\tfrac25+\tfrac43+\tfrac35+\tfrac23=3$ ✓.
(b) Bonnet with $n-1$ in place of $n$: $xP_{n-1}=\dfrac{nP_n+(n-1)P_{n-2}}{2n-1}$. Multiply by $P_n$ and integrate: only $P_n^2$ survives, giving $\dfrac{n}{2n-1}\cdot\dfrac{2}{2n+1}=\dfrac{2n}{4n^2-1}$. (For $n=3$: $\tfrac6{35}$.)
(c) At $x=0$: $G(0,t)=(1+t^2)^{-1/2}=1-\tfrac12t^2+\tfrac38t^4-\tfrac5{16}t^6+\cdots$, which has only even powers. So $P_4(0)=\tfrac38$ and $P_5(0)=0$; in general $P_{2m}(0)=(-1)^m\dfrac{(2m)!}{4^m(m!)^2}$ and $P_{2m+1}(0)=0$. Check: $P_4(0)=\tfrac38\cdot1$ from the explicit formula ✓.
(d) $\nu(\nu+1)=20$ gives $\nu=4$. The solutions bounded on $(-1,1)$ are the multiples of $P_4$ (the other series solution has a logarithmic singularity at $\pm1$; see the pitfalls box). With $P_4(1)=1$: $y=3P_4(x)=\tfrac38(35x^4-30x^2+3)$.

Bessel Functions

📘 Definition 6.18 — Bessel's equation and the Bessel function $J_\nu$
For $\nu\ge0$, Bessel's equation of order $\nu$ is $x^2y''+xy'+(x^2-\nu^2)y=0$. The point $0$ is regular singular with $p_0=1$, $q_0=-\nu^2$, so the exponents are $\pm\nu$. The Bessel function of the first kind of order $\nu$ (any real $\nu$ with $\nu+1\notin\{0,-1,-2,\dots\}$, and by the convention $1/\Gamma(-j)=0$ for all real $\nu$) is $$J_\nu(x)=\sum_{m=0}^{\infty}\frac{(-1)^m}{m!\,\Gamma(m+\nu+1)}\left(\frac{x}{2}\right)^{2m+\nu},\qquad x\gt0,$$ where $\Gamma$ is the Gamma function: $\Gamma(s+1)=s\,\Gamma(s)$, $\Gamma(n+1)=n!$, $\Gamma(\tfrac12)=\sqrt\pi$.

The Frobenius recurrence for exponent $r=\nu$ is $k(k+2\nu)a_k=-a_{k-2}$ (with $a_1=0$), so only even $k$ occur and $a_{2m}=\frac{(-1)^m}{4^mm!\,(\nu+1)(\nu+2)\cdots(\nu+m)}a_0$; the choice $a_0=\frac{1}{2^\nu\Gamma(\nu+1)}$ produces $J_\nu$. In particular $J_0(x)=1-\frac{x^2}{4}+\frac{x^4}{64}-\cdots$ and $J_1(x)=\frac x2-\frac{x^3}{16}+\cdots$. The series converges for all $x$.

📐 Theorem 6.33 — Solutions of Bessel's equation
  1. $J_\nu$ solves Bessel's equation of order $\nu$ on $(0,\infty)$; so does $J_{-\nu}$.
  2. If $\nu\notin\mathbb{Z}$, then $J_\nu$ and $J_{-\nu}$ are linearly independent: the general solution is $c_1J_\nu+c_2J_{-\nu}$. This includes the half-integers, where $r_1-r_2=2\nu$ is an odd integer.
  3. If $\nu=n\in\{0,1,2,\dots\}$, then $J_{-n}=(-1)^nJ_n$, and a second solution $Y_n$ (the Bessel function of the second kind) contains the term $\frac2\pi J_n(x)\log x$ and is unbounded as $x\to0^+$. A solution bounded near $0$ is a multiple of $J_n$.
  4. $J_{1/2}(x)=\sqrt{\dfrac{2}{\pi x}}\,\sin x$ and $J_{-1/2}(x)=\sqrt{\dfrac{2}{\pi x}}\,\cos x$.

Proof. (1) The equation only involves $\nu^2$, and the series with $\nu$ replaced by $-\nu$ satisfies the same recurrence. (2) Near $0$, $J_\nu\sim\frac{(x/2)^\nu}{\Gamma(\nu+1)}\to0$ while $J_{-\nu}\sim\frac{(x/2)^{-\nu}}{\Gamma(1-\nu)}$ is unbounded ($\Gamma(1-\nu)$ is finite and nonzero for $\nu\notin\mathbb{Z}$), so neither is a multiple of the other. (3) For $\nu=-n$ the terms with $m\lt n$ vanish because $1/\Gamma(m-n+1)=0$; putting $m=j+n$,

$$J_{-n}(x)=\sum_{j\ge0}\frac{(-1)^{j+n}}{(j+n)!\,j!}\left(\frac x2\right)^{2j+n}=(-1)^nJ_n(x).$$

So $J_{-n}$ gives nothing new, and the exponents $\pm n$ differ by the integer $2n$ (or coincide, for $n=0$); the second solution of Theorem 6.29 contains a logarithm, which makes it unbounded at $0$. Since $J_n$ is bounded, a solution bounded near $0$ cannot contain $Y_n$. (4) Using $\Gamma(m+\tfrac32)=\frac{(2m+1)!\sqrt\pi}{2^{2m+1}m!}$ (induction from $\Gamma(\tfrac32)=\tfrac{\sqrt\pi}{2}$),

$$J_{1/2}(x)=\sum_{m\ge0}\frac{(-1)^m\,2^{2m+1}}{(2m+1)!\,\sqrt\pi}\left(\frac x2\right)^{2m+1/2}=\sqrt{\frac{2}{\pi x}}\sum_{m\ge0}\frac{(-1)^mx^{2m+1}}{(2m+1)!}=\sqrt{\frac{2}{\pi x}}\sin x,$$

and $J_{-1/2}$ in the same way (or from Example 4, where $x^{-1/2}\cos x$ and $x^{-1/2}\sin x$ were found to be solutions). ∎

📐 Theorem 6.34 — Recurrence relations for $J_\nu$
For all real $\nu$ and $x\gt0$: $$\frac{d}{dx}\Big(x^\nu J_\nu(x)\Big)=x^\nu J_{\nu-1}(x),\qquad \frac{d}{dx}\Big(x^{-\nu}J_\nu(x)\Big)=-x^{-\nu}J_{\nu+1}(x).$$ Hence $J_{\nu-1}+J_{\nu+1}=\dfrac{2\nu}{x}J_\nu$, $\ J_{\nu-1}-J_{\nu+1}=2J_\nu'$, $\ J_0'=-J_1$, and the integrals $\int x^\nu J_{\nu-1}\,dx=x^\nu J_\nu+C$, $\int x^{-\nu}J_{\nu+1}\,dx=-x^{-\nu}J_\nu+C$. Also $e^{\frac x2\left(t-\frac1t\right)}=\sum_{n\in\mathbb{Z}}J_n(x)\,t^n$ for $t\ne0$.

Proof. Differentiate termwise (the series converge uniformly on compact subsets of $(0,\infty)$). For the first identity, $x^\nu J_\nu=\sum_m\frac{(-1)^mx^{2m+2\nu}}{2^{2m+\nu}m!\,\Gamma(m+\nu+1)}$, and since $(2m+2\nu)/\Gamma(m+\nu+1)=2/\Gamma(m+\nu)$,

$$\frac{d}{dx}\big(x^\nu J_\nu\big)=\sum_m\frac{(-1)^mx^{2m+2\nu-1}}{2^{2m+\nu-1}m!\,\Gamma(m+\nu)}=x^\nu\sum_m\frac{(-1)^m}{m!\,\Gamma(m+\nu)}\left(\frac x2\right)^{2m+\nu-1}=x^\nu J_{\nu-1}.$$

For the second, $x^{-\nu}J_\nu=\sum_m\frac{(-1)^mx^{2m}}{2^{2m+\nu}m!\,\Gamma(m+\nu+1)}$; the $m=0$ term is constant, and with $m=j+1$ the derivative is $-\sum_j\frac{(-1)^jx^{2j+1}}{2^{2j+\nu+1}j!\,\Gamma(j+\nu+2)}=-x^{-\nu}J_{\nu+1}$. Expanding the products: $J_\nu'+\frac\nu xJ_\nu=J_{\nu-1}$ and $J_\nu'-\frac\nu xJ_\nu=-J_{\nu+1}$; subtracting and adding gives the two three-term relations, and $\nu=0$ in the second identity gives $J_0'=-J_1$. The integrals restate the two identities. The generating function: multiply the series $e^{xt/2}=\sum_j\frac{(xt/2)^j}{j!}$ and $e^{-x/(2t)}=\sum_m\frac{(-x/(2t))^m}{m!}$; the coefficient of $t^n$ ($n\ge0$) is $\sum_m\frac{(-1)^m(x/2)^{2m+n}}{m!\,(m+n)!}=J_n(x)$, and $t\mapsto-1/t$ handles $n\lt0$. ∎

📐 Theorem 6.35 — Orthogonality of Bessel functions on $[0,1]$
Let $\nu\gt-1$ and let $\alpha\ne\beta$ be positive zeros of $J_\nu$. Then $$\int_0^1x\,J_\nu(\alpha x)\,J_\nu(\beta x)\,dx=0,\qquad\int_0^1x\,J_\nu(\alpha x)^2\,dx=\tfrac12J_\nu'(\alpha)^2=\tfrac12J_{\nu+1}(\alpha)^2\quad(\nu\ge0).$$ Moreover $J_\nu$ has infinitely many positive zeros $\alpha_1\lt\alpha_2\lt\cdots$, all simple, with $\alpha_{k+1}-\alpha_k\to\pi$.

Proof. $u(x)=J_\nu(\alpha x)$ satisfies $x^2u''+xu'+(\alpha^2x^2-\nu^2)u=0$ (chain rule), i.e. $(xu')'+\left(\alpha^2x-\frac{\nu^2}{x}\right)u=0$; similarly for $v(x)=J_\nu(\beta x)$ with $\beta$. Multiply the first by $v$, the second by $u$, subtract and integrate over $[\varepsilon,1]$:

$$(\beta^2-\alpha^2)\int_\varepsilon^1xuv\,dx=\Big[x\,(u'v-uv')\Big]_\varepsilon^1 .$$

At $x=1$ both $u$ and $v$ vanish. As $\varepsilon\to0^+$: $u=ax^\nu(1+O(x^2))$, $v=bx^\nu(1+O(x^2))$, and the leading terms of $x(u'v-uv')$ cancel, leaving $O(x^{2\nu+2})\to0$ because $\nu\gt-1$. Hence the integral vanishes. For the norm (with $\nu\ge0$), a direct computation using the equation gives $\frac{d}{dx}\Big[(xu')^2+(\alpha^2x^2-\nu^2)u^2\Big]=2\alpha^2xu^2$. Integrate over $[0,1]$: at $x=1$, $u=0$ and $xu'=\alpha J_\nu'(\alpha)$; at $x=0$ the bracket is $0$. So $2\alpha^2\int_0^1xu^2=\alpha^2J_\nu'(\alpha)^2$, and $J_\nu'(\alpha)=\frac\nu\alpha J_\nu(\alpha)-J_{\nu+1}(\alpha)=-J_{\nu+1}(\alpha)$ by Theorem 6.34. Zeros are simple because a solution with $u(\alpha)=u'(\alpha)=0$ at $\alpha\gt0$ vanishes identically. The statements about infinitely many zeros and the gaps follow from Sturm's comparison theorem applied to the normal form (Theorem 6.39(4) below). ∎

✏️ Example 6 — Bessel identities at work
(a) Find $J_{3/2}$ in closed form. (b) Compute $\int x^3J_0(x)\,dx$. (c) Express $J_2$ and $J_0''$ in terms of $J_0$ and $J_1$. (d) Show that $\int_0^1xJ_0(\alpha_1x)J_0(\alpha_2x)\,dx=0$ for the first two positive zeros $\alpha_1\approx2.4048$, $\alpha_2\approx5.5201$ of $J_0$, but $\int_0^1J_0(\alpha_1x)J_0(\alpha_2x)\,dx\ne0$.
(a) $J_{\nu+1}=\frac{2\nu}{x}J_\nu-J_{\nu-1}$ with $\nu=\tfrac12$: $J_{3/2}=\frac1xJ_{1/2}-J_{-1/2}=\sqrt{\dfrac{2}{\pi x}}\left(\dfrac{\sin x}{x}-\cos x\right)$.
(b) Write $x^3J_0=x^2\cdot xJ_0$ and use $\int xJ_0=xJ_1$ (Theorem 6.34 with $\nu=1$). By parts: $\int x^3J_0\,dx=x^3J_1-\int 2x\cdot xJ_1\,dx=x^3J_1-2\int x^2J_1\,dx$, and $\int x^2J_1=x^2J_2$ ($\nu=2$). So $$\int x^3J_0(x)\,dx=x^3J_1(x)-2x^2J_2(x)+C .$$ Check: numerically $\int_0^2x^3J_0\,dx\approx1.79113$, and $8J_1(2)-8J_2(2)\approx1.79113$ ✓.
(c) $\nu=1$ in $J_{\nu-1}+J_{\nu+1}=\frac{2\nu}xJ_\nu$: $J_2=\frac2xJ_1-J_0$. Then $J_0''=-J_1'$ and $J_1'=J_0-\frac1xJ_1$ (from $J_\nu'+\frac\nu xJ_\nu=J_{\nu-1}$), so $J_0''=\frac1xJ_1-J_0$. Check with Bessel's equation of order $0$: $J_0''+\frac1xJ_0'+J_0=\frac1xJ_1-J_0-\frac1xJ_1+J_0=0$ ✓.
(d) The first integral is the case $\nu=0$ of Theorem 6.35. Without the weight $x$ there is no reason for cancellation: numerically $\int_0^1J_0(\alpha_1x)J_0(\alpha_2x)\,dx\approx0.196$. The weight comes from the self-adjoint form $(xu')'+\alpha^2xu=0$, where $\alpha^2$ multiplies $x\,u$.

Sturm Theory and Sturm–Liouville Problems

Bessel functions oscillate like damped sines, Legendre polynomials have all their zeros in $(-1,1)$ — and yet we proved these facts with special tricks. Sturm's theorems give the general principle: the zeros of solutions of $y''+q(x)y=0$ are controlled by the size of $q$.

📐 Theorem 6.36 — Sturm separation theorem
Let $P,Q$ be continuous on an interval $I$ and let $y_1,y_2$ be linearly independent solutions of $y''+Py'+Qy=0$ on $I$. Then $y_1$ and $y_2$ have no common zero, every zero is simple, and between any two consecutive zeros of $y_1$ there is exactly one zero of $y_2$ (and vice versa): the zeros interlace.

Proof. The Wronskian $W=y_1y_2'-y_1'y_2$ never vanishes on $I$ (Abel's formula, §6.1), so it has a constant sign. A common zero would make $W=0$ there, and a zero $a$ of $y_1$ with $y_1'(a)=0$ would make $y_1\equiv0$ by uniqueness. Let $a\lt b$ be consecutive zeros of $y_1$, say $y_1\gt0$ on $(a,b)$. Then $y_1'(a)\gt0$ and $y_1'(b)\lt0$ (simple zeros, and $y_1$ is positive in between). At the zeros, $W(a)=-y_1'(a)y_2(a)$ and $W(b)=-y_1'(b)y_2(b)$; since $W(a)$ and $W(b)$ have the same sign while $y_1'(a)$ and $y_1'(b)$ have opposite signs, $y_2(a)$ and $y_2(b)$ have opposite signs, and $y_2$ vanishes in $(a,b)$ by the intermediate value theorem. If $y_2$ had two zeros in $(a,b)$, the argument with the roles exchanged would give a zero of $y_1$ between them — contradicting consecutiveness. ∎

📐 Theorem 6.37 (Lemma) — Normal form
If $P\in C^1(I)$ and $Q\in C(I)$, the substitution $y=u\,\exp\!\left(-\tfrac12\int P\right)$ transforms $y''+Py'+Qy=0$ into $$u''+q(x)u=0,\qquad q=Q-\tfrac14P^2-\tfrac12P' ,$$ and $y$ and $u$ have the same zeros. For Bessel's equation ($P=\frac1x$, $Q=1-\frac{\nu^2}{x^2}$, $y=x^{-1/2}u$): $\ q(x)=1+\dfrac{1-4\nu^2}{4x^2}$.

Proof. With $e=\exp(-\frac12\int P)$ we have $e'=-\frac12Pe$ and $e''=\left(\frac14P^2-\frac12P'\right)e$. Then $y'=e\left(u'-\frac12Pu\right)$ and $y''=e\left(u''-Pu'+\left(\frac14P^2-\frac12P'\right)u\right)$, and $y''+Py'+Qy=e\left(u''+\left(Q-\frac14P^2-\frac12P'\right)u\right)$. The factor $e$ is positive. For Bessel: $\frac14P^2+\frac12P'=\frac1{4x^2}-\frac1{2x^2}=-\frac1{4x^2}$. ∎

📐 Theorem 6.38 — Sturm comparison theorem
Let $q_1,q_2$ be continuous on $[a,b]$ with $q_2\ge q_1$. Let $y\not\equiv0$ solve $y''+q_1y=0$ with $y(a)=y(b)=0$, and let $z\not\equiv0$ solve $z''+q_2z=0$. Then $z$ has a zero in the open interval $(a,b)$, unless $q_1\equiv q_2$ on $[a,b]$ and $z$ is a constant multiple of $y$. In words: the equation with the larger coefficient oscillates at least as fast.

Proof. We may take $a,b$ consecutive zeros of $y$ with $y\gt0$ on $(a,b)$ (shrinking $[a,b]$ only strengthens the conclusion), so $y'(a)\gt0\gt y'(b)$. Suppose $z$ has no zero in $(a,b)$; replacing $z$ by $-z$, $z\gt0$ on $(a,b)$ and $z(a),z(b)\ge0$. Then

$$\big(y'z-yz'\big)'=y''z-yz''=(q_2-q_1)\,yz\ \ge0\quad\text{on }(a,b).$$

Integrating over $[a,b]$ and using $y(a)=y(b)=0$:

$$y'(b)z(b)-y'(a)z(a)=\int_a^b(q_2-q_1)\,y\,z\,dx .$$

The left side is $\le0$ (both terms are), the right side is $\ge0$. So both are $0$: $z(a)=z(b)=0$, and $(q_2-q_1)yz\equiv0$, i.e. $q_1=q_2$ on $(a,b)$ (where $yz\gt0$), hence on $[a,b]$. Then $y,z$ solve the same equation with $y(a)=z(a)=0$, so $W(y,z)(a)=0$ and $z$ is a multiple of $y$. ∎

📐 Theorem 6.39 — Consequences: how far apart are the zeros?
Let $q$ be continuous on an interval $I$ and $y\not\equiv0$ a solution of $y''+q(x)y=0$.
  1. If $q\le0$ on $I$, then $y$ has at most one zero in $I$ (it is non-oscillatory).
  2. If $q\le M^2$ on $I$ ($M\gt0$), consecutive zeros of $y$ are at distance $\ge\pi/M$.
  3. If $q\ge m^2\gt0$ on $I$, every closed interval $[c,c+\pi/m]\subseteq I$ contains a zero of $y$; consecutive zeros are at distance $\le\pi/m$; and if $I=[c,\infty)$, $y$ has infinitely many zeros.
  4. Every solution of Bessel's equation of any order $\nu$ has infinitely many zeros in $(0,\infty)$, and the gaps between consecutive zeros tend to $\pi$. For $0\le\nu\lt\frac12$ the gaps are $\lt\pi$, for $\nu=\frac12$ they equal $\pi$, for $\nu\gt\frac12$ they are $\gt\pi$.

Proof. (1) If $y(a)=y(b)=0$ with $a\lt b$, then $(yy')'=y'^2+yy''=y'^2-qy^2\ge y'^2$, and integrating, $\int_a^by'^2\le[yy']_a^b=0$. So $y'\equiv0$ on $[a,b]$, $y$ is constant, hence $y\equiv0$ — a contradiction. (2) Let $a\lt b$ be consecutive zeros with $b-a\lt\pi/M$. Then $z=\sin M(x-a)$ solves $z''+M^2z=0$ with $M^2\ge q$ and has no zero in $(a,b)$; by Theorem 6.38, $q\equiv M^2$ and $z$ is a multiple of $y$, so $b=a+\pi/M$ — a contradiction. (3) Apply Theorem 6.38 with $q_1=m^2$, the solution $\sin m(x-c)$ on $[c,c+\pi/m]$, and $q_2=q$: either $y$ vanishes inside, or $y$ is a multiple of $\sin m(x-c)$ and vanishes at the end points. The other claims follow by placing such intervals end to end. (4) By Theorem 6.37 the zeros on $(0,\infty)$ are those of $u''+\left(1+\frac{1-4\nu^2}{4x^2}\right)u=0$. Given $\varepsilon\gt0$, for $x$ large $q$ lies between $(1-\varepsilon)^2$ and $(1+\varepsilon)^2$, and (2), (3) trap the gaps between $\frac{\pi}{1+\varepsilon}$ and $\frac{\pi}{1-\varepsilon}$. The sign of $1-4\nu^2$ decides whether $q\gt1$, $q=1$ or $q\lt1$ for all $x$, which compares the gaps with $\pi$ exactly. ∎

📘 Definition 6.19 — Regular Sturm–Liouville problem
A regular Sturm–Liouville problem on $[a,b]$ consists of the equation $$\big(p(x)y'\big)'+q(x)y+\lambda\,r(x)y=0,$$ with $p\in C^1[a,b]$, $q,r\in C[a,b]$, $p\gt0$ and $r\gt0$ on $[a,b]$, and separated boundary conditions $$\alpha_1y(a)+\alpha_2y'(a)=0,\qquad\beta_1y(b)+\beta_2y'(b)=0,\qquad(\alpha_1,\alpha_2)\ne(0,0)\ne(\beta_1,\beta_2).$$ A number $\lambda$ for which a nontrivial solution exists is an eigenvalue, the solution an eigenfunction, and $r$ the weight. If $p$ or $r$ vanishes at an end point, or the interval is infinite, the problem is singular (Legendre on $[-1,1]$, Bessel on $[0,1]$); periodic conditions $y(a)=y(b)$, $y'(a)=y'(b)$ (with $p(a)=p(b)$) give a periodic problem.
📐 Theorem 6.40 (Lemma) — Every second-order equation has a self-adjoint form
If $a_0\gt0$, $a_1,a_2,a_3$ are continuous on $[a,b]$, multiplying $a_0y''+a_1y'+(a_2+\lambda a_3)y=0$ by $\mu=\dfrac1{a_0}\exp\!\int\frac{a_1}{a_0}\,dx$ gives $(py')'+(q+\lambda r)y=0$ with $p=\exp\!\int\frac{a_1}{a_0}$, $q=\mu a_2$, $r=\mu a_3$.

Proof. $p'=\frac{a_1}{a_0}p$, so $(py')'=py''+\frac{a_1}{a_0}py'=\mu(a_0y''+a_1y')$. ∎ For instance $x^2y''+xy'+\lambda y=0$ becomes $(xy')'+\frac\lambda xy=0$: $p=x$, $q=0$, weight $r=\frac1x$.

📐 Theorem 6.41 — The Sturm–Liouville theorem
For a regular Sturm–Liouville problem (Definition 6.19):
  1. every eigenvalue is real, and the eigenfunctions may be taken real;
  2. eigenfunctions $\varphi,\psi$ belonging to different eigenvalues are orthogonal with weight $r$: $\int_a^b\varphi\,\psi\,r\,dx=0$;
  3. every eigenvalue is simple: its eigenfunctions are multiples of one of them;
  4. the eigenvalues form an increasing sequence $\lambda_1\lt\lambda_2\lt\cdots\to+\infty$, and the eigenfunction $\varphi_n$ of $\lambda_n$ has exactly $n-1$ zeros in $(a,b)$;
  5. if $q\le0$, $\alpha_1\alpha_2\le0$ and $\beta_1\beta_2\ge0$, all eigenvalues are $\ge0$; the eigenfunctions form an orthogonal basis of the space of square-integrable functions with weight $r$.

Proof of (1)–(3) and the sign in (5); (4) and the basis property are sketched. Write $Ly=(py')'+qy$. Lagrange's identity: $uLv-vLu=\big(p(uv'-u'v)\big)'$, by expanding both sides. If $u,v$ satisfy the same separated condition at $a$, the vectors $(u(a),u'(a))$ and $(v(a),v'(a))$ are both orthogonal to $(\alpha_1,\alpha_2)\ne0$, hence parallel, so $u(a)v'(a)-u'(a)v(a)=0$; likewise at $b$. Thus $\int_a^b(uLv-vLu)\,dx=0$ for all $u,v$ satisfying the conditions (also complex ones, since the conditions have real coefficients). (1) If $L\varphi=-\lambda r\varphi$, apply this to $u=\bar\varphi$, $v=\varphi$: $(\bar\lambda-\lambda)\int r|\varphi|^2=0$, and $\int r|\varphi|^2\gt0$, so $\lambda$ is real; then the real and imaginary parts of $\varphi$ are real eigenfunctions. (2) With $L\varphi=-\lambda r\varphi$, $L\psi=-\mu r\psi$: $(\lambda-\mu)\int r\varphi\psi=0$. (3) Two eigenfunctions for $\lambda$ satisfy the same condition at $a$, so their Wronskian vanishes at $a$, and solutions of the same linear equation with vanishing Wronskian are dependent. (5, sign) Multiply $L\varphi=-\lambda r\varphi$ by $\varphi$ and integrate by parts:

$$\lambda\int_a^br\varphi^2=\int_a^b\left(p\varphi'^2-q\varphi^2\right)dx+p(a)\varphi(a)\varphi'(a)-p(b)\varphi(b)\varphi'(b) .$$

If $\alpha_2\ne0$, then $\varphi'(a)=-\frac{\alpha_1}{\alpha_2}\varphi(a)$ and the term from $a$ is $-p(a)\frac{\alpha_1}{\alpha_2}\varphi(a)^2\ge0$ when $\alpha_1\alpha_2\le0$; if $\alpha_2=0$ it is $0$. Likewise the term from $b$ is $p(b)\frac{\beta_1}{\beta_2}\varphi(b)^2\ge0$ when $\beta_1\beta_2\ge0$. With $q\le0$ every term on the right is $\ge0$, so $\lambda\ge0$. (4) One introduces the Prüfer angle $\theta$ with $p y'=\rho\cos\theta$, $y=\rho\sin\theta$; it increases with $\lambda$ and passes the values $k\pi$ exactly at zeros of $y$, and Sturm comparison makes $\theta(b,\lambda)$ increase continuously from near $0$ to $+\infty$; each time it reaches the value required by the condition at $b$ an eigenvalue appears, with one more interior zero than the previous one. The full argument and the expansion theorem are in the 📚 box. ∎

✏️ Example 7 — Eigenvalues, weights and zeros: compute, then prove or disprove
(a) Solve $y''+\lambda y=0$, $y(0)=0$, $y'(\pi)=0$. (b) Solve $x^2y''+xy'+\lambda y=0$, $y(1)=y(e)=0$, and verify the orthogonality of Theorem 6.41(2). (c) Prove or disprove: every nontrivial solution of $y''+\left(2+\frac{x}{1+x}\right)y=0$ has at least two and at most four zeros in $[0,2\pi]$. (d) Prove or disprove: since $q(x)=\frac{1}{4x^2}\gt0$, every nontrivial solution of $y''+\frac{1}{4x^2}y=0$ on $[1,\infty)$ has infinitely many zeros.
(a) Here $p=r=1$, $q=0$, $\alpha_1=1,\alpha_2=0$, $\beta_1=0,\beta_2=1$, so all $\lambda\ge0$ by Theorem 6.41(5). $\lambda=0$: $y=A+Bx$, $y(0)=0\Rightarrow A=0$, $y'(\pi)=B=0$: not an eigenvalue. $\lambda=\mu^2\gt0$: $y=\sin\mu x$ and $\cos\mu\pi=0$, so $\mu=n-\tfrac12$: $$\lambda_n=\left(n-\tfrac12\right)^2,\qquad\varphi_n=\sin\left(n-\tfrac12\right)x,\qquad n=1,2,\dots$$ $\varphi_n$ has zeros $\frac{k\pi}{n-1/2}$, $k=1,\dots,n-1$, in $(0,\pi)$: exactly $n-1$ ✓.
(b) Self-adjoint form $(xy')'+\frac\lambda xy=0$: weight $\frac1x$. With $t=\log x$ the equation becomes $\frac{d^2y}{dt^2}+\lambda y=0$ on $[0,1]$ with Dirichlet conditions, so $\lambda_n=n^2\pi^2$ and $\varphi_n=\sin(n\pi\log x)$. Orthogonality: $\int_1^e\sin(m\pi\log x)\sin(n\pi\log x)\,\frac{dx}{x}=\int_0^1\sin m\pi t\,\sin n\pi t\,dt=0$ for $m\ne n$ — with the weight $\frac1x$, exactly as predicted.
(c) Bounds on $q$ On $[0,2\pi]$, $q(x)=2+\frac{x}{1+x}$ increases from $2$ to $2+\frac{2\pi}{1+2\pi}\approx2.8627$. So $m^2=2$ and $M^2=2.8627$ in Theorem 6.39.
(c) At least two By Theorem 6.39(3) every closed interval of length $\pi/\sqrt2\approx2.2214$ contains a zero. The disjoint intervals $[0,\,2.2214]$ and $[2.2215,\,4.4429]$ lie in $[0,2\pi]$ ($2\pi\approx6.2832$), so there are at least two zeros. (A third interval would end at $6.664\gt2\pi$.)
(c) At most four By Theorem 6.39(2) consecutive zeros are at least $\pi/\sqrt{2.8627}\approx1.8568$ apart. Five zeros would need four gaps, of total length $\ge7.427\gt2\pi$. So there are at most four. The statement is true. (Numerically, as the solution varies, the count in $[0,2\pi]$ is always $3$ or $4$. Comparison bounds are honest but not sharp.)
(d) False $y=\sqrt x$ is a solution: $y''=-\tfrac14x^{-3/2}=-\frac{1}{4x^2}y$. It has no zeros at all on $[1,\infty)$. Positivity of $q$ is not enough; Theorem 6.39(3) needs $q\ge m^2$ with a positive constant $m$. (The general solution $\sqrt x\,(A+B\log x)$ has at most one zero.)
⚠️ Counterexamples and pitfalls
  1. The radius is decided in $\mathbb{C}$. $(1+x^2)y''+4xy'+2y=0$ has the solution $\frac1{1+x^2}$, smooth on $\mathbb{R}$, whose Maclaurin series diverges for $|x|\gt1$: the singular points $\pm i$ are invisible on the real line (Example 2(d), Interactive 1).
  2. Theorem 6.28 gives a lower bound only. For Legendre's equation with $\nu=n$ the guaranteed radius about $0$ is $1$, but the solution $P_n$ is a polynomial whose series converges everywhere; only the other solution really has radius $1$.
  3. Frobenius needs a regular singular point. At the irregular point $0$ of $x^2y''+(3x-1)y'+y=0$ the formal series $\sum_kk!\,x^k$ satisfies the equation term by term but converges only at $x=0$.
  4. Integer difference does not force a logarithm (Bessel of order $\frac12$, and every Cauchy–Euler equation, e.g. $x^2y''+xy'-y=0$ with solutions $x$, $x^{-1}$), but equal exponents always do, and $xy''-y=0$ shows that integer difference sometimes does (Example 4).
  5. $J_{-n}$ is not new. For integer $n$, $J_{-n}=(-1)^nJ_n$; the second solution is $Y_n$, unbounded at $0$. For non-integer $\nu$ (including $\nu=\frac12,\frac32$), $J_\nu,J_{-\nu}$ are a fundamental set.
  6. Not every solution of Legendre's equation with $\nu=n$ is a polynomial. The second solution $Q_n$ behaves like $\log\frac{1+x}{1-x}$ near $\pm1$; for instance $Q_0=\frac12\log\frac{1+x}{1-x}$ solves the case $n=0$. And for non-integer $\nu$ no nonzero solution is bounded on $(-1,1)$.
  7. Orthogonality needs the right weight and interval. $\int_0^1J_0(\alpha_1x)J_0(\alpha_2x)\,dx\approx0.196\ne0$; the weight is $x$. Legendre polynomials are orthogonal on $[-1,1]$, not on $[0,1]$: $\int_0^1P_0P_1\,dx=\frac12$.
  8. Sturm separation needs linear independence and the same equation. $\sin x$ and $2\sin x$ share all their zeros; $\sin x$ and $\sin 2x$ solve different equations and do not interlace ($0,\pi$ are common zeros).
  9. $q\gt0$ does not imply oscillation: $y''+\frac{1}{4x^2}y=0$ has the zero-free solution $\sqrt x$ on $[1,\infty)$. A positive lower bound $q\ge m^2$ is what forces infinitely many zeros.
  10. Periodic problems can have double eigenvalues. $y''+\lambda y=0$, $y(0)=y(2\pi)$, $y'(0)=y'(2\pi)$ has $\lambda=n^2$ with the two independent eigenfunctions $\cos nx$, $\sin nx$ ($n\ge1$). Simplicity in Theorem 6.41(3) is for separated conditions.
  11. Negative eigenvalues happen when the sign conditions fail. With the convention $(py')'+qy+\lambda ry=0$, the problem $y''+\lambda y=0$, $y(0)=0$, $y'(1)=2y(1)$ has $\beta_1\beta_2=2\cdot(-1)\lt0$, and indeed $y=\sinh\mu x$ is an eigenfunction for $\lambda=-\mu^2$ whenever $\tanh\mu=\mu/2$: $\mu\approx1.915$, $\lambda\approx-3.667$. Compare Exercise IV.7, where $\beta_1\beta_2=1\gt0$ and all eigenvalues are positive.
📚 Go deeper — full proofs in the CSIR NET course
  • CSIR Unit 3 · §2.2 Non-Homogeneous Equations and Variation of Parameters — its final part, on series solutions, proves the convergence of power series solutions by Cauchy's method of majorants, treats Frobenius' theorem in all three cases with the logarithmic solutions written out, and collects Legendre's and Bessel's functions with their second solutions $Q_n$ and $Y_n$.
  • CSIR Unit 3 · §2.3 Sturm–Liouville Boundary Value Problems — solvability of two-point problems, Lagrange's identity and Green's formula, the Sturm–Picone comparison theorem, the oscillation theorem (infinitely many eigenvalues, $n-1$ zeros) via the Prüfer angle, the Rayleigh quotient and minimum principle, the eigenfunction expansion theorem, and singular problems with Legendre and Bessel expansions.

Two Labs

Interactive 1 — Partial Sums of a Series Solution and the Radius of Convergence

The black curve is the true solution; the red curve is the partial sum $S_N$ of its power series about $0$ (terms up to $x^N$). The green band is the interval $|x|\lt R$ guaranteed by Theorem 6.28. Press Play to add terms. Inside the band the red curve locks on; outside it either keeps converging (when $R=\infty$) or tears away — even for $\frac1{1+x^2}$, whose singularities $\pm i$ are not on the real axis. For Legendre with $n=4$ the series stops: a polynomial solution.

degree N—
guaranteed R—
max error, |x| ≤ R/2—
error at test point—
Interactive 2 — Sturm's Theorems: Interlacing Zeros and Zero Spacing

For $y''+q(x)y=0$ the blue curve is the fixed solution with $y(c)=0$, $y'(c)=1$, and the red curve is $y_\theta=\cos\theta\,u+\sin\theta\,v$, where $u(c)=1,u'(c)=0$ (here $c$ is the left end, except $c=4$ for $\nu=3$) and $v$ is the blue solution. Drag $\theta$ (or press Play): the red zeros slide continuously but always stay one between each pair of blue zeros (separation theorem). The bottom strip shows $q(x)$ against the dashed level $0$; the readouts compare the actual gaps between zeros with the comparison bounds $\pi/\sqrt{\max q}$ and $\pi/\sqrt{\min q}$. Bessel's normal form shows gaps tending to $\pi$; with $\nu=3$ there is a zero-free stretch where $q\lt0$.

θ—
zeros of y_θ—
gaps (min – max)—
Sturm bounds—

Exercises

I
Ordinary points, singular points and the Frobenius method.
  • 1 Find the recurrence and the first four nonzero terms of the two basic power series solutions of Airy's equation $y''-xy=0$ about $0$. What is their radius of convergence?
  • 2 Show that $y''-2xy'+4y=0$ has a polynomial solution and find it. Is the other basic solution a polynomial?
  • 3 Without solving, give the radius of convergence guaranteed for series solutions of $(x^2+2x+2)y''+xy'+y=0$ about $x_0=0$ and about $x_0=1$.
  • 4 Classify all singular points of $x^2(x+1)^2y''+(x^2-1)y'+2y=0$.
  • 5 Find the exponents at $0$ of $2x^2y''-xy'+(1+x)y=0$ and the first three terms of two independent Frobenius solutions.
  • 6 Show that $xy''+y'-y=0$ has exponents $0,0$ at the origin, find the Frobenius solution $y_1$ in closed summation form, and state the form of a second solution.
  • 7 Find the Frobenius solution of $xy''-y=0$ with exponent $1$, and prove that every solution independent of it contains $\log x$.
  • 8 Prove that at an ordinary point (viewed as a "regular singular point"), the indicial equation is $r(r-1)=0$, and explain why no logarithm appears although the exponents differ by $1$.
  • 9 Give an example of an equation with a regular singular point at $0$ whose exponents differ by $2$ and which has two independent solutions of the form $x^r\sum a_kx^k$, or show that none exists.
1 Coefficient of $x^k$: $(k+2)(k+1)a_{k+2}=a_{k-1}$ (with $a_{-1}=0$), so $a_2=0$ and $a_{k+2}=\frac{a_{k-1}}{(k+2)(k+1)}$. $y_1=1+\frac{x^3}{6}+\frac{x^6}{180}+\frac{x^9}{12960}+\cdots$, $y_2=x+\frac{x^4}{12}+\frac{x^7}{504}+\frac{x^{10}}{45360}+\cdots$. Every point is ordinary: $R=\infty$.
2 $a_{k+2}=\frac{2(k-2)}{(k+2)(k+1)}a_k$ vanishes at $k=2$: with $a_0=1,a_1=0$, $a_2=-2$ and $a_4=0$, so $y=1-2x^2$. Check: $-4-2x(-4x)+4(1-2x^2)=0$ ✓. The odd series has $a_{2m+3}/a_{2m+1}=\frac{2(2m-1)}{(2m+3)(2m+2)}\ne0$ for all $m\ge0$: not a polynomial.
3 $x^2+2x+2=0$ at $-1\pm i$. Distances: from $0$, $\sqrt2$; from $1$, $|2\mp i|=\sqrt5$. Guaranteed radii $\sqrt2$ and $\sqrt5$.
4 $P=\frac{x^2-1}{x^2(x+1)^2}=\frac{x-1}{x^2(x+1)}$, $Q=\frac{2}{x^2(x+1)^2}$. At $0$: $xP=\frac{x-1}{x(x+1)}$ is not analytic: irregular. At $-1$: $(x+1)P=\frac{x-1}{x^2}$ and $(x+1)^2Q=\frac2{x^2}$ are analytic: regular singular.
5 $p_0=-\frac12$, $q_0=\frac12$: $r^2-\frac32r+\frac12=0$, $r=1,\frac12$. Recurrence $(2s-1)(s-1)\big|_{s=k+r}a_k=-a_{k-1}$. $r=1$: $a_k=-\frac{a_{k-1}}{k(2k+1)}$, $y_1=x\left(1-\frac x3+\frac{x^2}{30}-\cdots\right)$. $r=\frac12$: $a_k=-\frac{a_{k-1}}{k(2k-1)}$, $y_2=x^{1/2}\left(1-x+\frac{x^2}{6}-\cdots\right)$.
6 $x^2y''+xy'-xy=0$: $p_0=1$, $q_0=0$, $F(r)=r^2$. Recurrence $(k+r)^2a_k=a_{k-1}$; with $r=0$, $a_k=\frac{a_{k-1}}{k^2}$, so $y_1=\sum_{k\ge0}\frac{x^k}{(k!)^2}$. Equal exponents: $y_2=y_1\log x+\sum_{k\ge1}b_kx^k$ (Theorem 6.29(3)).
7 Recurrence $(k+r)(k+r-1)a_k=a_{k-1}$. $r=1$: $a_k=\frac{a_{k-1}}{k(k+1)}$, $y_1=\sum\frac{x^{k+1}}{k!\,(k+1)!}=x+\frac{x^2}{2}+\frac{x^3}{12}+\cdots$. For $r=0$, $k=1$ requires $0\cdot b_1=b_0=1$: impossible, so no second solution $\sum b_kx^k$ exists, and by Theorem 6.29(4) the second solution is $cy_1\log x+\sum b_kx^k$ with $c\ne0$.
8 At an ordinary point $P,Q$ are analytic, so $xP$ and $x^2Q$ vanish at $0$: $p_0=q_0=0$ and $F(r)=r(r-1)$. Theorem 6.28 provides two independent power series solutions, which are Frobenius series with $r=1$ (from $y(0)=0,y'(0)=1$) and $r=0$; so the "$c$" of Theorem 6.29(4) is $0$: at an ordinary point the obstruction at $k=N=1$ never arises.
9 Exists: the Cauchy–Euler equation $x^2y''+xy'-y=0$ has exponents $\pm1$ (difference $2$) and the solutions $x$ and $x^{-1}$, both Frobenius series with one term.
II
Legendre polynomials.
  • 1 Compute $P_3$ from Rodrigues' formula and check $P_3(1)=1$ and $P_3'(1)=6$.
  • 2 Express $x^4$ as a combination of $P_0,\dots,P_4$.
  • 3 Evaluate $\int_{-1}^1P_3(x)^2\,dx$, $\int_{-1}^1x^2P_3(x)\,dx$ and $\int_{-1}^1x^3P_3(x)\,dx$.
  • 4 Find $P_6(0)$ and $P_7(0)$.
  • 5 Prove $P_n(1)=1$ and $P_n(-x)=(-1)^nP_n(x)$ directly from the generating function.
  • 6 Show that $\int_{-1}^1x\,P_n(x)P_n'(x)\,dx=\frac{2n}{2n+1}$.
  • 7 Find the solution of $(1-x^2)y''-2xy'+12y=0$ that is bounded on $(-1,1)$ with $y(1)=2$.
  • 8 (Approximation.) Find the polynomial $p$ of degree $\le2$ minimising $\int_{-1}^1\big(|x|-p(x)\big)^2dx$.
1 $(x^2-1)^3=x^6-3x^4+3x^2-1$; its third derivative is $120x^3-72x$; divide by $2^3\cdot3!=48$: $P_3=\frac52x^3-\frac32x$. $P_3(1)=1$, $P_3'(1)=\frac{15}2-\frac32=6=\frac{3\cdot4}{2}$ ✓.
2 $c_n=\frac{2n+1}2\int x^4P_n$: $x^4=\frac{8}{35}P_4+\frac47P_2+\frac15P_0$. Check at $x=1$: $\frac8{35}+\frac{20}{35}+\frac7{35}=1$ ✓.
3 $\frac27$; $0$ (degree $2\lt3$); and $x^3=\frac25P_3+\frac35P_1$ gives $\frac25\cdot\frac27=\frac4{35}$.
4 $P_{2m}(0)=(-1)^m\frac{(2m)!}{4^m(m!)^2}$: $P_6(0)=-\frac{720}{64\cdot36}=-\frac5{16}$; $P_7(0)=0$ (odd).
5 $G(1,t)=(1-t)^{-1}=\sum t^n$ gives $P_n(1)=1$. $G(-x,t)=G(x,-t)$, so $\sum P_n(-x)t^n=\sum P_n(x)(-t)^n$; compare coefficients.
6 $xP_n'$ is a polynomial of degree $n$ with leading coefficient $n$ times that of $P_n$, so $xP_n'=nP_n+(\text{degree}\lt n)$. By orthogonality $\int xP_n'P_n=n\int P_n^2=\frac{2n}{2n+1}$.
7 $\nu(\nu+1)=12$: $\nu=3$. Bounded solutions are multiples of $P_3$: $y=2P_3=5x^3-3x$.
8 Best approximation = Legendre partial sum: $c_0=\frac12\int|x|=\frac12$, $c_1=0$ (odd), $c_2=\frac52\int|x|P_2=5\int_0^1x\cdot\frac{3x^2-1}2\,dx=\frac58$. So $p=\frac12+\frac58P_2=\frac{15x^2+3}{16}$.
III
Bessel functions.
  • 1 Prove $J_0'=-J_1$ directly from the series.
  • 2 Express $J_2$ and $J_3$ in terms of $J_0$ and $J_1$.
  • 3 Show that $J_{-1/2}(x)=\sqrt{\frac{2}{\pi x}}\cos x$ and compute the Wronskian of $J_{1/2}$ and $J_{-1/2}$.
  • 4 Evaluate $\int xJ_0(x)\,dx$, $\int x^2J_1(x)\,dx$ and $\int J_1(x)\,dx$.
  • 5 Show that between two consecutive positive zeros of $J_0$ there is exactly one zero of $J_1$.
  • 6 Show that $y=J_0(2\sqrt x)$ solves $xy''+y'+y=0$.
  • 7 Let $\alpha_n$ be the positive zeros of $J_0$. Find the coefficients $c_n$ in the Fourier–Bessel expansion $1=\sum_nc_nJ_0(\alpha_nx)$ on $(0,1)$.
1 $J_0=\sum_m\frac{(-1)^m}{(m!)^2}\left(\frac x2\right)^{2m}$; differentiating, the $m$-th term gives $\frac{(-1)^m\,m}{(m!)^2}\left(\frac x2\right)^{2m-1}$; with $m=j+1$ this is $-\frac{(-1)^j}{j!\,(j+1)!}\left(\frac x2\right)^{2j+1}$, the series of $-J_1$.
2 $J_2=\frac2xJ_1-J_0$, and $J_3=\frac4xJ_2-J_1=\left(\frac8{x^2}-1\right)J_1-\frac4xJ_0$ (checked numerically at $x=1.7$).
3 $J_{-1/2}=\sum_m\frac{(-1)^m}{m!\,\Gamma(m+\frac12)}\left(\frac x2\right)^{2m-1/2}$ with $\Gamma(m+\tfrac12)=\frac{(2m)!\sqrt\pi}{4^mm!}$, giving $\sqrt{\frac2{\pi x}}\sum\frac{(-1)^mx^{2m}}{(2m)!}$. With $f=\sqrt{2/(\pi x)}$: $W=J_{1/2}J_{-1/2}'-J_{1/2}'J_{-1/2}=f^2(\sin x\cdot(-\sin x)-\cos x\cdot\cos x)=-\frac{2}{\pi x}$ (consistent with Abel: $W\propto e^{-\int dx/x}=\frac1x$).
4 $xJ_1+C$; $x^2J_2+C$; $-J_0+C$ (since $J_0'=-J_1$).
5 $J_0'=-J_1$; by Rolle, $J_0'$ — hence $J_1$ — vanishes between consecutive zeros of $J_0$. Conversely $(xJ_1)'=xJ_0$, so between consecutive zeros of $xJ_1$ (i.e. of $J_1$, for $x\gt0$) there is a zero of $J_0$; two zeros of $J_1$ between consecutive zeros of $J_0$ would give a zero of $J_0$ between them. So exactly one.
6 With $z=2\sqrt x$: $\frac{dz}{dx}=x^{-1/2}$, $y'=x^{-1/2}J_0'(z)$, $y''=x^{-1}J_0''(z)-\frac12x^{-3/2}J_0'(z)$. Then $xy''+y'+y=J_0''+\frac12x^{-1/2}J_0'+J_0=J_0''+\frac1zJ_0'+J_0=0$ ✓.
7 $c_n=\frac{\int_0^1xJ_0(\alpha_nx)\,dx}{\frac12J_1(\alpha_n)^2}$ and $\int_0^1xJ_0(\alpha_nx)\,dx=\frac{1}{\alpha_n^2}\left[tJ_1(t)\right]_0^{\alpha_n}=\frac{J_1(\alpha_n)}{\alpha_n}$. So $c_n=\frac{2}{\alpha_nJ_1(\alpha_n)}$: $c_1\approx1.602$, $c_2\approx-1.065$, $c_3\approx0.851$.
IV
Sturm theory and Sturm–Liouville problems.
  • 1 Verify the separation theorem for $\sin x$ and $\cos x$, and compute their Wronskian.
  • 2 Show that every nontrivial solution of $y''+\left(4+\frac{x^2}{1+x^2}\right)y=0$ has infinitely many zeros in $[0,\infty)$, with consecutive zeros at distance between $\pi/\sqrt5$ and $\pi/2$.
  • 3 Show that a nontrivial solution of $y''-(1+x^2)y=0$ has at most one real zero.
  • 4 Use the normal form to show that consecutive positive zeros of $J_0$ are less than $\pi$ apart, and those of $J_2$ more than $\pi$ apart.
  • 5 Find all eigenvalues and eigenfunctions of $y''+\lambda y=0$, $y'(0)=0$, $y'(L)=0$.
  • 6 Put Chebyshev's equation $(1-x^2)y''-xy'+\lambda y=0$ into self-adjoint form on $(-1,1)$ and state the weight for which its polynomial solutions are orthogonal.
  • 7 For $y''+\lambda y=0$, $y(0)=0$, $y(1)+y'(1)=0$, show that the eigenvalues satisfy $\tan\sqrt\lambda=-\sqrt\lambda$ and compute $\lambda_1$ to three decimals.
  • 8 Without solving, prove that every eigenvalue of $(xy')'+\frac\lambda xy=0$, $y(1)=y(e)=0$, is positive.
  • 9 Prove or disprove: the eigenvalues of $y''+\lambda y=0$, $y(0)=y(2\pi)$, $y'(0)=y'(2\pi)$ are all simple.
1 Both solve $y''+y=0$; zeros $k\pi$ and $\frac\pi2+k\pi$ alternate. $W=\sin x\cdot(-\sin x)-\cos x\cdot\cos x=-1\ne0$.
2 $4\le q\lt5$. Theorem 6.39(3) with $m=2$: infinitely many zeros, gaps $\le\frac\pi2$; (2) with $M=\sqrt5$: gaps $\ge\frac{\pi}{\sqrt5}$.
3 $q=-(1+x^2)\lt0$: Theorem 6.39(1).
4 $q=1+\frac{1-4\nu^2}{4x^2}$. $\nu=0$: $q\gt1$, so by Theorem 6.38 (compare with $\sin(x-a)$, $q_1=1$) a zero of $u$ lies strictly inside $(a,a+\pi)$ after each zero $a$: gaps $\lt\pi$. $\nu=2$: $q=1-\frac{15}{4x^2}\lt1$; compare the other way: $\sin(x-a)$ vanishes strictly inside any interval between consecutive zeros of $u$, so the gaps are $\gt\pi$.
5 $\lambda=0$: $y=1$ is an eigenfunction. $\lambda=\mu^2\gt0$: $y=\cos\mu x$, $\sin\mu L=0$: $\lambda_n=\left(\frac{n\pi}L\right)^2$, $y_n=\cos\frac{n\pi x}L$, $n=0,1,2,\dots$. $\lambda=-\mu^2\lt0$: $y=\cosh\mu x$ and $\sinh\mu L\ne0$: none.
6 $\mu=\frac{1}{1-x^2}\exp\int\frac{-x}{1-x^2}dx=(1-x^2)^{-1/2}$: $\left(\sqrt{1-x^2}\,y'\right)'+\frac{\lambda}{\sqrt{1-x^2}}y=0$. Weight $(1-x^2)^{-1/2}$: $\int_{-1}^1T_mT_n\frac{dx}{\sqrt{1-x^2}}=0$ for $m\ne n$.
7 $\lambda=0$: $y=x$, $y(1)+y'(1)=2\ne0$. $\lambda=-\mu^2$: $y=\sinh\mu x$, $\sinh\mu+\mu\cosh\mu\gt0$: none. $\lambda=\mu^2$: $y=\sin\mu x$, $\sin\mu+\mu\cos\mu=0$, i.e. $\tan\mu=-\mu$. The first root lies in $(\frac\pi2,\pi)$: $\mu_1\approx2.0288$, $\lambda_1\approx4.116$.
8 Multiply by $y$ and integrate by parts: $\lambda\int_1^e\frac{y^2}x\,dx=\int_1^exy'^2\,dx$ (boundary terms vanish). If $\lambda\le0$, then $y'\equiv0$ and $y\equiv y(1)=0$. So $\lambda\gt0$ (indeed $\lambda_n=n^2\pi^2$, Example 7(b)).
9 False: $\lambda=n^2$ ($n\ge1$) has the two independent eigenfunctions $\cos nx$, $\sin nx$. Only $\lambda=0$ (eigenfunction $1$) is simple. Periodic conditions are not separated.
🎯 GATE corner GATE MA · MCQGATE MA · MSQGATE MA · NAT

E1. GATE MA · MCQ A fundamental set of solutions of $9x^2y''+9xy'+(9x^2-4)y=0$ on $(0,\infty)$ is (A) $J_{2/3}(x),\ J_{-2/3}(x)$; (B) $J_{2/3}(x),\ J_{3/2}(x)$; (C) $J_{2/3}(3x),\ J_{-2/3}(3x)$; (D) $J_{2/3}(x),\ xJ_{2/3}(x)$.

Idea Divide by $9$: $x^2y''+xy'+\left(x^2-\frac49\right)y=0$ is Bessel's equation of order $\nu=\frac23$.
Options $\nu\notin\mathbb{Z}$, so $J_{2/3},J_{-2/3}$ is a fundamental set (Theorem 6.33(2)): (A). (B) $J_{3/2}$ solves a different equation. (C) $J_\nu(3x)$ solves $x^2y''+xy'+(9x^2-\nu^2)y=0$ — the distractor for those who do not divide by $9$. (D) $xJ_{2/3}$ is not a solution.
Answer (A).

E2. GATE MA · MCQ If $x^3=aP_3(x)+bP_2(x)+cP_1(x)+dP_0(x)$, then $a+b+c+d$ equals (A) $\frac25$; (B) $1$; (C) $\frac35$; (D) $\frac65$.

Idea Put $x=1$: every $P_n(1)=1$, so $a+b+c+d=1^3=1$. No expansion needed.
Check $x^3=\frac25P_3+\frac35P_1$: $a=\frac25$, $c=\frac35$, $b=d=0$. (A) and (C) are the individual coefficients; (D) adds $\frac35$ twice.
Answer (B).

E3. GATE MA · MSQ Consider $x^2(1-x)y''-x(1+x)y'+y=0$. Which of the following is/are true? (One or more options may be correct.) (A) $x=0$ is a regular singular point. (B) The exponents at $x=0$ are $1$ and $-1$. (C) Every solution on $(0,1)$ is of the form $x^r\sum_{k\ge0}a_kx^k$. (D) The equation has a Frobenius solution about $0$ whose series converges for $|x|\lt1$.

(A) True $xP=-\frac{1+x}{1-x}$ and $x^2Q=\frac1{1-x}$ are analytic at $0$ (radius $1$).
(B) False $p_0=-1$, $q_0=1$: $r(r-1)-r+1=(r-1)^2$. The exponent $1$ is double.
(C) False Equal exponents force a logarithm in the second solution (Theorem 6.29(3)).
(D) True Theorem 6.29 with $R=1$ (the next singular point is $x=1$). In fact the recurrence gives $a_k=1$ for all $k$: $y_1=x+x^2+x^3+\cdots=\frac{x}{1-x}$, and one checks directly that $\frac x{1-x}$ solves the equation.
Answer (A) and (D).

E4. GATE MA · MSQ Let $y\not\equiv0$ solve $y''+(2+\cos x)y=0$ on $\mathbb{R}$. Which of the following is/are true? (One or more options may be correct.) (A) $y$ has infinitely many zeros in $[0,\infty)$. (B) Consecutive zeros of $y$ are less than $\pi$ apart. (C) Consecutive zeros of $y$ are less than $\pi/\sqrt3$ apart. (D) $y$ has at most $7$ zeros in $[0,4\pi]$.

Bounds $1\le q\le3$, with equality only at isolated points. Theorem 6.38 against $\sin(x-a)$ and $\sin\sqrt3(x-a)$ gives: every gap $d$ satisfies $\frac{\pi}{\sqrt3}\lt d\lt\pi$ (strict, because $q\not\equiv1$ and $q\not\equiv3$ on any interval).
(A) True, (B) True Theorem 6.39(3) with $m=1$.
(C) False The gaps are more than $\frac{\pi}{\sqrt3}\approx1.814$, never less.
(D) True $8$ zeros would need $7$ gaps of total length $\gt\frac{7\pi}{\sqrt3}\approx12.70\gt4\pi\approx12.57$.
Answer (A), (B) and (D).

E5. GATE MA · NAT Let $y=\sum_{k\ge0}a_kx^k$ be the solution of $y''+xy'+3y=0$ with $y(0)=1$, $y'(0)=0$. The value of $a_6$ is ______ (correct to two decimal places).

Recurrence Coefficient of $x^k$: $(k+2)(k+1)a_{k+2}+ka_k+3a_k=0$, so $a_{k+2}=-\dfrac{(k+3)\,a_k}{(k+1)(k+2)}$.
Compute $a_0=1$: $a_2=-\frac32$, $a_4=-\frac{5}{12}\cdot\left(-\frac32\right)=\frac58$, $a_6=-\frac{7}{30}\cdot\frac58=-\frac{7}{48}\approx-0.1458$.
Answer $-0.15$ (accept $-0.15$ to $-0.14$).

E6. GATE MA · NAT The smallest eigenvalue $\lambda$ of $x^2y''+xy'+\lambda y=0$, $y(1)=0$, $y(e^2)=0$, is ______ (correct to two decimal places).

Idea $t=\log x$ turns the Cauchy–Euler operator into $\frac{d^2}{dt^2}$: $y_{tt}+\lambda y=0$ on $[0,2]$, $y(0)=y(2)=0$.
Compute $\lambda_n=\left(\frac{n\pi}{2}\right)^2$, eigenfunctions $\sin\left(\frac{n\pi}{2}\log x\right)$. Smallest: $\frac{\pi^2}4\approx2.4674$. (All eigenvalues are positive by the argument of Exercise IV.8.)
Answer $2.47$ (accept $2.46$ to $2.48$).
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Series and Frobenius. Definition 6.15 with three quick classifications; Theorem 6.28 and the four-step strategy; Example 1 on the board (let the class discover $e^{-x^2/2}$). Project Interactive 1 on $\frac1{1+x^2}$ and ask where the series "knows" to stop converging. Definition 6.16, Theorem 6.29 with the recurrence $(\ast)$ and the $\partial/\partial r$ trick for equal exponents; Examples 3 and 4.
  2. Legendre and Bessel. Definition 6.17 and the terminating recurrence; Rodrigues (Theorem 6.30) with the Leibniz computation; generating function and Bonnet (Theorem 6.31); orthogonality via the self-adjoint form, the norm via Rodrigues, zeros (Theorem 6.32); Example 5 as a quick-fire drill. Definition 6.18, Theorems 6.33–6.35, Example 6.
  3. Sturm theory. Theorem 6.36 via the Wronskian sign; the normal form; Theorem 6.38 with its two-line integral proof and Theorem 6.39. Project Interactive 2: first $q=1$, then $2+\cos x$ with the readouts, then Bessel $\nu=3$. Definition 6.19, Theorems 6.40–6.41 and Example 7; finish with GATE corner E4 and E6.

Discussion questions. (1) Why does the radius of convergence of a series solution "see" complex singular points of the equation, and what does this say about Taylor series of real functions in general? (2) The Legendre and Bessel orthogonality proofs needed no boundary conditions at $\pm1$ or at $0$. What replaced them? (3) In Interactive 2, why can a red zero never overtake a blue zero, however $\theta$ is changed?

Misconceptions to watch for. Taking the radius as the distance to the nearest real singular point; applying Frobenius at irregular points; "integer difference ⇒ logarithm" (and its converse); using $J_{-n}$ as a second solution; forgetting the weight $x$ in Bessel orthogonality or using $[0,1]$ for Legendre; concluding oscillation from $q\gt0$; claiming simple eigenvalues for periodic problems; mixing up the direction of the comparison theorem.

Suggested homework. I(1, 3, 5, 7, 9), II(2, 3, 4, 7, 8), III(2, 4, 5, 7), IV(2, 4, 5, 7, 9); GATE corner E1, E3, E5.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. Why does a drum not sound like a guitar string? The overtones of a string are whole-number multiples of its fundamental; what are the overtones of a circular membrane, and what role do the zeros of Bessel functions play?

Why it matters. Orchestral timpani, tabla and mridangam makers, loudspeaker designers and engineers who test vibrating plates and MEMS membranes all work with the modes of a disc. Separating the wave equation $u_{tt}=c^2\Delta u$ on the disc $r\le a$ (with $u=0$ on the rim) in polar coordinates gives modes $J_m(kr)\cos m\theta\,\cos ckt$, and the rim condition $J_m(ka)=0$ quantises $k$: the frequencies are $\frac{c\,j_{m,n}}{2\pi a}$, where $j_{m,n}$ is the $n$-th positive zero of $J_m$.

What to do.

  1. Separate variables: show that $u=R(r)\Theta(\theta)T(t)$ leads to Bessel's equation $r^2R''+rR'+(k^2r^2-m^2)R=0$, and explain why only $J_m(kr)$ (not $Y_m$) is allowed.
  2. Compute the zeros $j_{m,n}$ for $m=0,1,2,3$ and $n=1,2,3$, either with a library or by bisection on the series. Use Theorem 6.39(4) to predict the spacing and compare.
  3. List the eight lowest frequencies in your table as ratios $j_{m,n}/j_{0,1}$. Which, if any, are close to integers or simple fractions? Compare with a string, whose ratios are $1,2,3,\dots$
  4. Timpani are struck off-centre and their air cavity lowers some modes; players report the modes $(1,1),(2,1),(3,1),(4,1)$ in a ratio close to $2:3:4:5$. Compute the ideal-membrane ratios of these four modes and discuss how close they are.

Tools: Python with scipy.special.jn_zeros (or your own series and bisection); Interactive 2 (Bessel presets) for the spacing of zeros.

Hand in: the separation of variables; a table of $j_{m,n}$; the ratio list; a paragraph comparing a drum, a string and a tuned timpano.

Going further. Read about Mark Kac's question "Can one hear the shape of a drum?" (1966) and the 1992 answer by Gordon, Webb and Wolpert: two differently shaped drums with exactly the same frequencies.

Instructor note: $j_{0,1}\approx2.4048$, $j_{1,1}\approx3.8317$, $j_{2,1}\approx5.1356$, $j_{0,2}\approx5.5201$, $j_{3,1}\approx6.3802$, $j_{1,2}\approx7.0156$, $j_{2,2}\approx8.4172$, $j_{0,3}\approx8.6537$. Ratios to $j_{0,1}$: $1,\ 1.593,\ 2.136,\ 2.295,\ 2.653,\ 2.917,\ 3.500,\ 3.598$ — none harmonic. For the four "timpani" modes, $j_{1,1}:j_{2,1}:j_{3,1}:j_{4,1}\approx3.832:5.136:6.380:7.588$, i.e. $2:2.68:3.33:3.96$, which the air loading pulls towards $2:3:4:5$. Students should notice that the gaps $j_{0,n+1}-j_{0,n}$ ($3.115$, $3.134$, …) approach $\pi$ from below, as Theorem 6.39(4) predicts for $\nu=0$.

🧪 Self-check quiz

0/5 correct

Q1. For $x^2y''+(\sin x)\,y'+y=0$, the point $x=0$ is

Q2. The radius of convergence guaranteed for power series solutions of $(x^2+9)y''+y=0$ about $x_0=4$ is

Q3. $\int_{-1}^{1}P_5(x)^2\,dx$ equals

Q4. $J_{1/2}(x)$ equals

Q5. For a regular Sturm–Liouville problem with eigenvalues $\lambda_1\lt\lambda_2\lt\cdots$, the eigenfunction of $\lambda_4$ has, in the open interval $(a,b)$,