Book 4A

© 2026 NeckPinch · www.neckpinch.com · All rights reserved.

Course 4Book 4A: Function Spaces and Sobolev SpacesChapter 7

Compact Operators and Spectra

The spectral theorem for compact self-adjoint operators and the eigenvalues of the Laplacian.

23 min read · Updated Oct 2, 2026

Read with Brezis, chapter 6, "Compact Operators. Spectral Decomposition of Self-Adjoint Compact Operators" (compact operators, the Riesz–Fredholm theory, the spectrum, the spectral decomposition), or Kreyszig chapter 8 (compact operators) with §9.1–9.3 for the self-adjoint case.

In this chapter · 7 sections
  1. 7.1Patterns in sand
  2. 7.2Compact operators
  3. 7.3The Fredholm alternative
  4. 7.4The spectral theorem
  5. 7.5The spectrum of the Laplacian
  6. 7.5.1The Rayleigh quotient
  7. 7.6History
  8. 7.7Exercises

In finite dimensions, a symmetric matrix has an orthonormal basis of eigenvectors with real eigenvalues (1A.6 Symmetric Matrices and the Spectral Theorem). In infinite dimensions this can fail completely: the multiplication operator f(x)↦xf(x)f(x) \mapsto xf(x) on L2(0,1)L^2(0, 1) is symmetric and has no eigenvectors at all. But for one important class of operators the finite-dimensional picture survives almost unchanged. Compact operators, those that map bounded sets to sets with compact closure, behave like matrices whose entries fade out. For them, the Fredholm alternative holds ("unique solvability follows from uniqueness"), and the self-adjoint ones have an orthonormal basis of eigenvectors with eigenvalues tending to 00.

The main example is the inverse of the Laplacian on a bounded domain or a closed manifold. Its eigenfunctions are the vibration modes of a drum, the shapes that sand traces on a vibrating plate, and the building blocks of the heat equation on a curved space. And the bottom of the spectrum of an operator of this kind, −4Δ+R-4\Delta + R, is Perelman's λ\lambda-invariant.

By the end of this chapter you will be able to:

  • recognise compact operators (finite rank, Hilbert–Schmidt integral operators, diagonal operators with entries tending to 00), and explain why they turn weak convergence into strong;
  • state the Fredholm alternative and use it;
  • prove the spectral theorem for compact self-adjoint operators by maximising a quadratic form;
  • describe the Dirichlet eigenvalues and eigenfunctions of the Laplacian, compute them on an interval, a square and a disc, and use the Rayleigh quotient;
  • explain what can and cannot be heard about the shape of a drum.

Patterns in sand

In the world Model Chladni figures

In 1787 Ernst Chladni published Entdeckungen über die Theorie des Klanges ("Discoveries in the theory of sound"), describing an experiment that still fascinates: sprinkle sand on a thin metal plate, clamp it at the centre, and draw a violin bow along its edge. At certain pitches the plate sounds a clear note and the sand dances away from most of the surface and collects along a pattern of lines. The lines are the nodal lines of a vibration mode, the places that stay still while the rest of the plate moves. Each pitch has its own pattern, and higher pitches give more intricate ones. Chladni toured Europe demonstrating them, and the problem of explaining them prompted the Paris Academy prize that Sophie Germain won in 1816 for her theory of elastic plates. The experiment is easy to repeat today with a loudspeaker driving a plate from below.

The modes are eigenfunctions. A vibrating plate is governed by a fourth-order equation (the biharmonic operator), and a stretched membrane, such as a drumhead, by the Laplacian: its standing waves are u(x,t)=ϕ(x)cos⁡(ωt)u(x, t) = \phi(x)\cos(\omega t) with −Δϕ=λϕ-\Delta\phi = \lambda\phi inside and ϕ=0\phi = 0 on the clamped edge, where ω=cλ\omega = c\sqrt\lambda. The theorem of this chapter says these modes form an orthonormal basis, so every vibration is a superposition of them, and that the frequencies are a discrete sequence tending to infinity. Figure 7.1 shows computed nodal patterns for a square and a circular drum.

Figure 7.1. Dirichlet eigenfunctions of the Laplacian, computed: on the unit square, sin⁡(mπx)sin⁡(nπy)\sin(m\pi x)\sin(n\pi y) for (m,n)=(1,1),(2,1),(2,2),(3,2)(m, n) = (1,1), (2,1), (2,2), (3,2); on the unit disc, Jm(jm,kr)cos⁡(mθ)J_m(j_{m,k}r)\cos(m\theta) for (m,k)=(0,2),(1,1),(2,1),(1,2)(m, k) = (0,2), (1,1), (2,1), (1,2), where jm,kj_{m,k} is the kk-th zero of the Bessel function JmJ_m. Blue and orange mark opposite signs; the boundaries between them are the nodal lines, where sand would collect.

Compact operators

Definition 7.1 Compact operator

A linear operator K:X→YK : X \to Y between Banach spaces is compact if it maps bounded sets to sets with compact closure; equivalently, every bounded sequence (xn)(x_n) has a subsequence for which (Kxnk)(Kx_{n_k}) converges.

Compact operators are automatically bounded. The identity of an infinite-dimensional space is not compact (4A.1 Banach Spaces and Bounded Operators). Examples:

  • Finite rank. A bounded operator with finite-dimensional range is compact (bounded sets in Rn\mathbb{R}^n have compact closure).
  • Limits of finite rank. If ∥Kn−K∥→0\|K_n - K\| \to 0 with each KnK_n compact, then KK is compact (a diagonal argument, Exercise 7.7). Compact operators form a closed subspace of L(X,Y)L(X, Y), and a two-sided ideal: AKAK and KBKB are compact when KK is and AA, BB are bounded.
  • Diagonal operators. On ℓ2\ell^2, D(xk)=(dkxk)D(x_k) = (d_kx_k) is compact exactly when dk→0d_k \to 0 (Exercise 7.6).
  • Integral operators. If k∈L2([0,1]2)k \in L^2([0, 1]^2), then Tf(x)=∫01k(x,y)f(y) dyTf(x) = \int_0^1k(x, y)f(y)\,dy is compact on L2(0,1)L^2(0, 1) (a Hilbert–Schmidt operator): expanding kk in an orthonormal basis of L2([0,1]2)L^2([0,1]^2) and truncating gives finite-rank approximations converging in operator norm (Exercise 7.8). The solution operators of elliptic boundary value problems are of this kind.

The property that makes compact operators useful is the following.

Proposition 7.2 Compact operators turn weak convergence into strong

If KK is compact and xn⇀xx_n \rightharpoonup x, then Kxn→KxKx_n \to Kx in norm.

Proof. First, Kxn⇀KxKx_n \rightharpoonup Kx (ϕ∘K\phi\circ K is a functional). The sequence (xn)(x_n) is bounded (4A.6 Weak Convergence and the Direct Method), so every subsequence of (Kxn)(Kx_n) has a further subsequence converging in norm, necessarily to the weak limit KxKx. A sequence all of whose subsequences have sub-subsequences converging to the same limit converges to it.

The Fredholm alternative

For a matrix, Ax=bAx = b is solvable for every bb if and only if Ax=0Ax = 0 only for x=0x = 0. In infinite dimensions this fails (the shift on ℓ2\ell^2 is injective and not onto, 4A.1 Banach Spaces and Bounded Operators). It survives for compact perturbations of the identity.

Theorem 7.3 Fredholm alternative

Let K:X→XK : X \to X be compact on a Banach space. Then:

  1. the kernel of I−KI - K is finite-dimensional, and its range is closed;
  2. I−KI - K is injective if and only if it is surjective, and then its inverse is bounded;
  3. (on a Hilbert space) (I−K)u=f(I - K)u = f is solvable if and only if ff is orthogonal to the kernel of I−K∗I - K^*, and the kernels of I−KI - K and I−K∗I - K^* have the same finite dimension.

Proof architecture (Brezis, Theorem 6.6). (1) On the kernel, KK acts as the identity, so the unit ball of the kernel is compact, and the kernel is finite-dimensional by Riesz's lemma (4A.1 Banach Spaces and Bounded Operators). Closed range: if (I−K)un→f(I - K)u_n \to f, one can arrange (un)(u_n) to be bounded (subtract components in the kernel), and then compactness of KK gives a convergent subsequence of KunKu_n, hence of unu_n. (2) If I−KI - K is injective but not surjective, the ranges Xn=(I−K)n(X)X_n = (I - K)^n(X) form a strictly decreasing sequence of closed subspaces; Riesz's lemma gives unit vectors xn∈Xnx_n \in X_n at distance ≥12\geq \tfrac12 from Xn+1X_{n+1}, and then ∥Kxn−Kxm∥≥12\|Kx_n - Kx_m\| \geq \tfrac12, contradicting compactness. The converse uses duality, and boundedness of the inverse is the bounded inverse theorem (4A.2 Baire Category and Its Consequences).

In words: for an equation "identity minus compact", uniqueness implies existence, with a bounded solution operator. This is how existence is proved for many linear elliptic problems (6A.5 Weak Solutions and Elliptic Regularity): show the problem is of Fredholm type, then show that the homogeneous equation has only the zero solution.

The spectral theorem

An operator KK on a Hilbert space is self-adjoint if ⟨Kx,y⟩=⟨x,Ky⟩\langle Kx, y\rangle = \langle x, Ky\rangle for all x,yx, y. Its eigenvalues are then real and eigenvectors for different eigenvalues are orthogonal, by the computations of 1A.6 Symmetric Matrices and the Spectral Theorem.

Theorem 7.4 Spectral theorem for compact self-adjoint operators

Let KK be a compact self-adjoint operator on a separable Hilbert space HH. Then there is an orthonormal basis of HH consisting of eigenvectors of KK. The non-zero eigenvalues form a finite or countable set of real numbers, each of finite multiplicity, and if there are infinitely many they tend to 00. So

Kx=∑kμk⟨x,ek⟩ek.Kx = \sum_k\mu_k\langle x, e_k\rangle e_k.

Proof. Step 1: an eigenvalue of largest size exists. Suppose K≠0K \neq 0, and let m=sup⁡∥x∥=1∣⟨Kx,x⟩∣m = \sup_{\|x\|=1}|\langle Kx, x\rangle|; for a self-adjoint operator m=∥K∥m = \|K\| (Exercise 7.9). Choose unit vectors xnx_n with ⟨Kxn,xn⟩→μ\langle Kx_n, x_n\rangle \to \mu, where μ=±m\mu = \pm m. Pass to a weakly convergent subsequence, xn⇀xx_n \rightharpoonup x (4A.6 Weak Convergence and the Direct Method); then Kxn→KxKx_n \to Kx in norm, so ⟨Kxn,xn⟩→⟨Kx,x⟩\langle Kx_n, x_n\rangle \to \langle Kx, x\rangle (one factor converges strongly, the other weakly). Thus ⟨Kx,x⟩=μ≠0\langle Kx, x\rangle = \mu \neq 0, so x≠0x \neq 0, and ∥x∥≤1\|x\| \leq 1 by lower semicontinuity of the norm; since ∣⟨Kx,x⟩∣≤m∥x∥2|\langle Kx, x\rangle| \leq m\|x\|^2, in fact ∥x∥=1\|x\| = 1. The function y↦⟨Ky,y⟩−μ∥y∥2y \mapsto \langle Ky, y\rangle - \mu\|y\|^2 has a maximum (if μ>0\mu > 0; minimum if μ<0\mu < 0) at xx on the whole space, so its derivative vanishes there: Kx=μxKx = \mu x (Exercise 7.10).

Step 2: induct. The orthogonal complement H1=x⊥H_1 = x^\perp is mapped into itself by KK (if y⊥xy \perp x, then ⟨Ky,x⟩=⟨y,Kx⟩=μ⟨y,x⟩=0\langle Ky, x\rangle = \langle y, Kx\rangle = \mu\langle y, x\rangle = 0), and KK restricted to it is compact and self-adjoint. Repeat. This produces orthonormal eigenvectors e1,e2,…e_1, e_2, \ldots with ∣μ1∣≥∣μ2∣≥⋯|\mu_1| \geq |\mu_2| \geq \cdots.

Step 3: the eigenvalues tend to 00. If ∣μk∣≥ε>0|\mu_k| \geq \varepsilon > 0 for infinitely many kk, then Kek=μkekKe_k = \mu_ke_k would be a bounded sequence with no convergent subsequence (∥μjej−μkek∥2≥2ε2\|\mu_je_j - \mu_ke_k\|^2 \geq 2\varepsilon^2), contradicting compactness, since ek⇀0e_k \rightharpoonup 0.

Step 4: completeness. On the orthogonal complement of all the eke_k, KK has norm smaller than every ∣μk∣|\mu_k|, hence 00. So that complement is the kernel of KK, and adding an orthonormal basis of the kernel (eigenvalue 00) completes the basis.

Step 1 is the direct method (4A.6 Weak Convergence and the Direct Method): maximise a quadratic form on the unit sphere, using weak compactness, with the compact operator providing the continuity that weak convergence alone would not. It is also Lagrange multipliers (2B.9 The Inverse and Implicit Function Theorems): the eigenvector equation Kx=μxKx = \mu x is the condition for a critical point of ⟨Kx,x⟩\langle Kx, x\rangle on the sphere ∥x∥=1\|x\| = 1. In finite dimensions this was 2B.9 The Inverse and Implicit Function Theorems's exercise proving that symmetric matrices have eigenvectors.

In the world In use Principal component analysis

A data set of NN measurements of dd quantities has a d×dd \times d covariance matrix CC, symmetric and positive semidefinite. Its eigenvectors are the principal components: the first is the direction in which the data vary most (the unit vector maximising ⟨Cv,v⟩\langle Cv, v\rangle, the variance of the projection onto vv, exactly Step 1 above), the second the direction of greatest remaining variance orthogonal to the first, and so on. Projecting the data onto the first few components is the standard way of reducing dimension in statistics and data science, introduced by Karl Pearson (1901) and Harold Hotelling (1933). Its infinite-dimensional version, for random functions, is the Karhunen–Loève expansion, the spectral theorem for a covariance operator, which is compact and self-adjoint.

The spectrum of the Laplacian

Let Ω⊆Rn\Omega \subseteq \mathbb{R}^n be a bounded open set. For f∈L2(Ω)f \in L^2(\Omega), Lax–Milgram (4A.4 Hilbert Spaces and Lax–Milgram) gives a unique weak solution u=Gf∈H01(Ω)u = Gf \in H^1_0(\Omega) of −Δu=f-\Delta u = f, u=0u = 0 on ∂Ω\partial\Omega. The solution operator G:L2→L2G : L^2 \to L^2 is bounded, self-adjoint and positive (⟨Gf,f⟩=∫∣∇u∣2>0\langle Gf, f\rangle = \int|\nabla u|^2 > 0 for f≠0f \neq 0). It is also compact, because it maps L2L^2 boundedly into H01H^1_0 and the inclusion H01(Ω)↪L2(Ω)H^1_0(\Omega) \hookrightarrow L^2(\Omega) is compact. That last fact is Rellich's theorem, proved in 4A.10 Sobolev Embeddings and Critical Exponents; we use it now and complete the argument there.

Applying the spectral theorem to GG and inverting its eigenvalues μk\mu_k gives:

Theorem 7.5 Dirichlet eigenvalues

There is an orthonormal basis (ϕk)(\phi_k) of L2(Ω)L^2(\Omega) with ϕk∈H01(Ω)\phi_k \in H^1_0(\Omega) and −Δϕk=λkϕk-\Delta\phi_k = \lambda_k\phi_k weakly, where

0<λ1≤λ2≤λ3≤⋯→∞.0 < \lambda_1 \leq \lambda_2 \leq \lambda_3 \leq \cdots \to \infty.

The eigenfunctions are smooth inside Ω\Omega (by elliptic regularity, 6A.5 Weak Solutions and Elliptic Regularity).

On simple domains the eigenfunctions can be found by separating variables:

  • Interval (0,π)(0, \pi): ϕk=2/πsin⁡(kx)\phi_k = \sqrt{2/\pi}\sin(kx), λk=k2\lambda_k = k^2 (Exercise 7.11).
  • Square (0,1)2(0, 1)^2: ϕm,n=2sin⁡(mπx)sin⁡(nπy)\phi_{m,n} = 2\sin(m\pi x)\sin(n\pi y), λ=π2(m2+n2)\lambda = \pi^2(m^2 + n^2), for m,n≥1m, n \geq 1.
  • Unit disc: Jm(jm,kr)cos⁡(mθ)J_m(j_{m,k}r)\cos(m\theta) and Jm(jm,kr)sin⁡(mθ)J_m(j_{m,k}r)\sin(m\theta), λ=jm,k2\lambda = j_{m,k}^2, where JmJ_m is the Bessel function and jm,kj_{m,k} its kk-th positive zero. The lowest is λ1=j0,12≈2.4052≈5.78\lambda_1 = j_{0,1}^2 \approx 2.405^2 \approx 5.78.

The Rayleigh quotient

Step 1 of the spectral theorem, applied to GG, says the first eigenvalue is a minimum:

λ1=min⁡u∈H01, u≠0∫Ω∣∇u∣2∫Ωu2,\lambda_1 = \min_{u\in H^1_0,\ u\neq0}\frac{\int_\Omega|\nabla u|^2}{\int_\Omega u^2},

the Rayleigh quotient, attained exactly at multiples of ϕ1\phi_1. Higher eigenvalues are minima over orthogonal complements, or, without knowing the earlier eigenfunctions, the min–max values λk=min⁡dim⁡V=kmax⁡u∈V∖0∫∣∇u∣2∫u2\lambda_k = \min_{\dim V = k}\max_{u\in V\setminus0}\frac{\int|\nabla u|^2}{\int u^2} (the Courant–Fischer principle). Any test function gives an upper bound for λ1\lambda_1: a bump on a small ball inside Ω\Omega shows that small domains have large λ1\lambda_1, and since λ1(Ω)\lambda_1(\Omega) decreases when Ω\Omega grows (more test functions), a drum's lowest note goes down as it gets bigger.

Figure 7.2. The Rayleigh quotient ⟨Av,v⟩\langle Av, v\rangle of a 2×22 \times 2 symmetric matrix, for unit vectors v=(cos⁡θ,sin⁡θ)v = (\cos\theta, \sin\theta). Its maximum and minimum are the eigenvalues, attained at the eigenvectors, 90°90° apart. For the Laplacian, the same picture has infinitely many directions, and only a minimum.
In the world Model Can one hear the shape of a drum?

In 1966 Mark Kac asked, in a famous article in the American Mathematical Monthly, whether the sequence of eigenvalues of a drum (its set of pure tones) determines its shape. Some things can be heard. Hermann Weyl proved in 1911 that the number of eigenvalues below Λ\Lambda grows like area4πΛ\frac{\text{area}}{4\pi}\Lambda for a planar domain, so the area is audible, and later work showed that the perimeter is too (Exercise 7.12). But in 1992 Carolyn Gordon, David Webb and Scott Wolpert constructed two different planar polygons with exactly the same Dirichlet eigenvalues: one cannot, in general, hear the shape of a drum. (John Milnor had found two different flat tori in sixteen dimensions with the same spectrum in 1964.) The spectrum determines much, but not everything, about a geometry, a theme that returns when heat-kernel asymptotics are used to read curvature off a manifold's spectrum (9B.7 The Heat Equation on a Manifold).

Where this goes Spectra on manifolds, and Perelman's λ\lambda

On a closed Riemannian manifold the Laplacian has the same structure, with the constants as eigenfunctions for λ0=0\lambda_0 = 0; its eigenfunction expansion solves the heat equation there, u(t)=∑ke−λkt⟨u0,ϕk⟩ϕku(t) = \sum_ke^{-\lambda_kt}\langle u_0, \phi_k\rangle\phi_k, as Fourier series did on the ring (2B.7 Fourier Series and the First Heat Equation, 9B.7 The Heat Equation on a Manifold). In 12A.2 Ricci Flow as a Gradient Flow Perelman defines

λ(g)=inf⁡{∫(4∣∇w∣2+Rw2) dV:∫w2 dV=1},\lambda(g) = \inf\Big\{\int(4|\nabla w|^2 + Rw^2)\,dV : \int w^2\,dV = 1\Big\},

the bottom of the spectrum of the Schrödinger-type operator −4Δ+R-4\Delta + R, a Rayleigh quotient. It is attained (by Rellich, on a closed manifold), its minimiser is a positive eigenfunction, and Perelman shows that λ(g(t))\lambda(g(t)) is non-decreasing along Ricci flow, with equality only for steady solitons. That monotonicity rules out non-trivial steady "breathers", flows that return to their starting metric up to diffeomorphism (12A.2 Ricci Flow as a Gradient Flow). Exercise 7.13 computes λ\lambda for a metric of constant scalar curvature.

History

Ivar Fredholm's 1903 theory of integral equations contained the alternative now named after him. David Hilbert (1904–1910) and Erhard Schmidt (1907) developed the spectral theory of symmetric integral operators, and Frigyes Riesz (1918) gave the abstract theory of compact operators. Hermann Weyl's asymptotic law for eigenvalues appeared in 1911, and Richard Courant's min–max principle around 1920. Chladni's experiments date from 1787, Sophie Germain's prize-winning memoir from 1816, Pearson's principal axes from 1901, Kac's question from 1966 and Gordon, Webb and Wolpert's answer from 1992.

Recall Where we stand

Compact operators map bounded sets to precompact ones and weakly convergent sequences to norm convergent ones; finite-rank operators, their limits and Hilbert–Schmidt integral operators are compact. For I−KI - K with KK compact, uniqueness implies existence (Fredholm). A compact self-adjoint operator has an orthonormal basis of eigenvectors with eigenvalues tending to 00, found by maximising ⟨Kx,x⟩\langle Kx, x\rangle on the unit sphere. Applied to the inverse of the Dirichlet Laplacian (compact by Rellich), this gives eigenvalues λk→∞\lambda_k \to \infty and an eigenfunction basis, with λ1\lambda_1 the minimum of the Rayleigh quotient. The spectrum determines the area of a drum but not always its shape. 4A.8 Distributions and Weak Derivatives extends differentiation to functions that are not differentiable, as needed to define Sobolev spaces properly.

Exercises

Exercise 7.6 Diagonal operators

Show that the diagonal operator D(xk)=(dkxk)D(x_k) = (d_kx_k) on ℓ2\ell^2 is bounded iff (dk)(d_k) is bounded, and compact iff dk→0d_k \to 0. (For compactness, approximate by the finite-rank truncations; for the converse, apply DD to the basis vectors.)

Exercise 7.7 Limits of compact operators

Show that if ∥Kn−K∥→0\|K_n - K\| \to 0 and each KnK_n is compact, then KK is compact. (Given a bounded sequence (xj)(x_j), extract successively subsequences on which K1xjK_1x_j, K2xjK_2x_j, … converge, take the diagonal, and show KxjKx_j is Cauchy by an ε/3\varepsilon/3 argument.)

Exercise 7.8 Hilbert–Schmidt operators

Let k∈L2([0,1]2)k \in L^2([0,1]^2) and TT its integral operator. (a) Show ∥T∥≤∥k∥L2\|T\| \leq \|k\|_{L^2} (Cauchy–Schwarz in yy, then integrate in xx). (b) Approximating kk in L2L^2 by finite sums ∑aijui(x)uj(y)\sum a_{ij}u_i(x)u_j(y) (with (ui)(u_i) an orthonormal basis of L2(0,1)L^2(0, 1)), deduce that TT is a norm limit of finite-rank operators, hence compact.

Exercise 7.9 The norm of a self-adjoint operator

For KK self-adjoint on a Hilbert space, show ∥K∥=sup⁡∥x∥=1∣⟨Kx,x⟩∣\|K\| = \sup_{\|x\|=1}|\langle Kx, x\rangle|. (One inequality is Cauchy–Schwarz. For the other, with mm the right side, expand ⟨K(x+y),x+y⟩−⟨K(x−y),x−y⟩=4Re⁡⟨Kx,y⟩\langle K(x + y), x + y\rangle - \langle K(x - y), x - y\rangle = 4\operatorname{Re}\langle Kx, y\rangle and use the parallelogram law.)

Exercise 7.10 The eigenvector equation

Let KK be self-adjoint, μ=max⁡∥y∥=1⟨Ky,y⟩\mu = \max_{\|y\|=1}\langle Ky, y\rangle, attained at xx. Show that ⟨K(x+tz),x+tz⟩≤μ∥x+tz∥2\langle K(x + tz), x + tz\rangle \leq \mu\|x + tz\|^2 for all real tt and all zz, and differentiate at t=0t = 0 to get Re⁡⟨Kx−μx,z⟩=0\operatorname{Re}\langle Kx - \mu x, z\rangle = 0 for all zz. Conclude Kx=μxKx = \mu x.

Exercise 7.11 Eigenvalues of an interval

Find all λ\lambda and non-zero ϕ\phi with −ϕ′′=λϕ-\phi'' = \lambda\phi on (0,π)(0, \pi) and ϕ(0)=ϕ(π)=0\phi(0) = \phi(\pi) = 0, using the solutions of 2B.10 Ordinary Differential Equations's linear ODEs. Check that λ1=1\lambda_1 = 1 is the minimum of ∫ϕ′2/∫ϕ2\int\phi'^2/\int\phi^2 by expanding ϕ\phi in the sine basis.

Solution

For λ≤0\lambda \leq 0 only ϕ=0\phi = 0 satisfies the boundary conditions. For λ=ω2>0\lambda = \omega^2 > 0, ϕ=asin⁡ωx+bcos⁡ωx\phi = a\sin\omega x + b\cos\omega x; ϕ(0)=0\phi(0) = 0 forces b=0b = 0, and ϕ(π)=0\phi(\pi) = 0 forces ω∈N\omega \in \mathbb{N}. So λk=k2\lambda_k = k^2, ϕk=sin⁡kx\phi_k = \sin kx. If ϕ=∑cksin⁡kx\phi = \sum c_k\sin kx, then ∫ϕ′2=π2∑k2ck2≥π2∑ck2=∫ϕ2\int\phi'^2 = \frac\pi2\sum k^2c_k^2 \geq \frac\pi2\sum c_k^2 = \int\phi^2.

Exercise 7.12 Weyl's law on a square

For the unit square, the eigenvalues π2(m2+n2)\pi^2(m^2 + n^2), m,n≥1m, n \geq 1, below Λ\Lambda correspond to lattice points in a quarter disc of radius Λ/π\sqrt\Lambda/\pi. Show their number is Λ4π+O(Λ)\frac{\Lambda}{4\pi} + O(\sqrt\Lambda), in agreement with Weyl's area4πΛ\frac{\text{area}}{4\pi}\Lambda.

Exercise 7.13 Rehearsal: Perelman's λ\lambda for constant scalar curvature

On a closed Riemannian manifold with constant scalar curvature R0R_0, show that λ(g)=inf⁡{∫(4∣∇w∣2+R0w2):∫w2=1}=R0\lambda(g) = \inf\{\int(4|\nabla w|^2 + R_0w^2) : \int w^2 = 1\} = R_0, attained exactly by the constant functions (normalised). (Use ∫∣∇w∣2≥0\int|\nabla w|^2 \geq 0 with equality only for constants on a connected manifold.) For the round sphere of radius rr in dimension nn, R0=n(n−1)r2R_0 = \frac{n(n-1)}{r^2}. So λ\lambda detects the curvature scale; in 12A.2 Ricci Flow as a Gradient Flow this is the first value of λ\lambda ever computed, and for Einstein metrics it is the comparison case.

Solution

∫(4∣∇w∣2+R0w2)≥R0∫w2=R0\int(4|\nabla w|^2 + R_0w^2) \geq R_0\int w^2 = R_0, with equality iff ∇w=0\nabla w = 0, i.e. ww constant (on a connected manifold), and constants are allowed.

© 2026 NeckPinch (www.neckpinch.com). All content in the guidebook (text, mathematics, figures and exercises) is protected by copyright. All rights reserved. No part may be copied, republished or redistributed without written permission.