Skip to content

Applications

Example (Spectral Theory and ODEs). Consider the Sturm-Liouville problem −u"′+q(x)u=λu-u"' + q(x)u = \lambda u on [a,b][a, b] with boundary conditions u(a)=u(b)=0u(a) = u(b) = 0. The inverse operator T=(−d2/dx2+q)−1T = (-d^2/dx^2 + q)^{-1} is a compact self-adjoint operator on L2[a,b]L^2[a, b]. By the spectral theorem, the eigenfunctions form an orthonormal basis, and the eigenvalues λn→∞\lambda_n \to \infty.

In quantum mechanics, the state space of a system is a Hilbert space HH (in standard practice L2(R3)L^2(\mathbb{R}^3), the space of square-integrable wavefunctions). Observables are self-adjoint operators on HH. The spectral theorem guarantees that every observable has a spectral decomposition:

A=∫σ(A)λ dP(λ)A = \int_{\sigma(A)} \lambda\, dP(\lambda)

where PP is the projection-valued measure associated with AA.

Example. The position operator (Xψ)(x)=xψ(x)(X\psi)(x) = x\psi(x) and momentum operator (Pψ)(x)=−iℏψ′(x)(P\psi)(x) = -i\hbar\psi'(x) are self-adjoint on suitable domains of L2(R)L^2(\mathbb{R}). The canonical commutation relation [X,P]=iℏI[X, P] = i\hbar I is fundamental to quantum mechanics.

7.3 Weak Solutions of Partial Differential Equations

Section titled “7.3 Weak Solutions of Partial Differential Equations”

Classical solutions of PDEs require pointwise differentiability, which is too restrictive for many problems. Functional analysis provides the framework for weak (distributional) solutions.

Consider the Poisson equation −Δu=f-\Delta u = f on a bounded domain Ω⊂Rn\Omega \subset \mathbb{R}^n with u∣∂Ω=0u|_{\partial\Omega} = 0. Multiply both sides by a smooth test function φ\varphi with φ∣∂Ω=0\varphi|_{\partial\Omega} = 0 and integrate by parts:

∫Ω∇u⋅∇φ dx=∫Ωfφ dx\int_\Omega \nabla u \cdot \nabla \varphi\, dx = \int_\Omega f \varphi\, dx

This is the weak formulation: find uu in a suitable function space such that the above holds for all test functions φ\varphi.

The natural space for this problem is the Sobolev space H01(Ω)H^1_0(\Omega), defined as the completion of Cc∞(Ω)C_c^\infty(\Omega) under the norm ∥u∥H1=(∫Ω∣u∣2+∣∇u∣2 dx)1/2\|u\|_{H^1} = \left(\int_\Omega |u|^2 + |\nabla u|^2\, dx\right)^{1/2}. The Riesz representation theorem applied to the inner product ⟨u,v⟩H01=∫Ω∇u⋅∇v dx\langle u, v\rangle_{H^1_0} = \int_\Omega \nabla u \cdot \nabla v\, dx yields existence and uniqueness of the weak solution. This is known as the Lax-Milgram theorem:

Theorem 7.1 (Lax-Milgram). Let HH be a Hilbert space and B:H×H→RB : H \times H \to \mathbb{R} a bounded bilinear form that is coercive, i.e., there exists c>0c > 0 such that B(u,u)≥c∥u∥2B(u, u) \geq c\|u\|^2 for all u∈Hu \in H. Then for every bounded linear functional ℓ∈H∗\ell \in H^*, there exists a unique u∈Hu \in H such that B(u,v)=ℓ(v)B(u, v) = \ell(v) for all v∈Hv \in H.

Sobolev spaces Wk,p(Ω)W^{k,p}(\Omega) (for k≥0k \geq 0, 1≤p≤∞1 \leq p \leq \infty) generalise this idea: Wk,pW^{k,p} consists of functions whose weak derivatives up to order kk belong to LpL^p. They are Banach spaces, and Wk,2=HkW^{k,2} = H^k are Hilbert spaces.

7.4 Fourier Analysis and Signal Processing

Section titled “7.4 Fourier Analysis and Signal Processing”

The Fourier transform on L2(Rn)L^2(\mathbb{R}^n) is a unitary operator F:L2→L2\mathcal{F} : L^2 \to L^2 defined by:

(Ff)(ξ)=1(2π)n/2∫Rnf(x)e−ix⋅ξdx(\mathcal{F}f)(\xi) = \frac{1}{(2\pi)^{n/2}} \int_{\mathbb{R}^n} f(x) e^{-i x \cdot \xi} dx

Plancherel’s theorem states ∥Ff∥2=∥f∥2\|\mathcal{F}f\|_2 = \|f\|_2. The Schwartz space S(Rn)\mathcal{S}(\mathbb{R}^n) of rapidly decaying smooth functions is dense in L2L^2 and is invariant under the Fourier transform.

In signal processing, the sampling theorem (Nyquist-Shannon) follows from the Paley-Wiener theorem characterising functions with compactly supported Fourier transforms. Functional analysis also underpins wavelet theory: the existence of orthonormal wavelet bases of L2(R)L^2(\mathbb{R}) relies on the theory of frames and multiresolution analysis.

7.5 Applied Functional Analysis: The Galerkin Method

Section titled “7.5 Applied Functional Analysis: The Galerkin Method”

The Galerkin method approximates solutions of PDEs by projecting onto finite-dimensional subspaces. Let Vh⊂H01(Ω)V_h \subset H^1_0(\Omega) be a finite-dimensional subspace (e.g., finite elements). Find uh∈Vhu_h \in V_h such that:

∫Ω∇uh⋅∇vh dx=∫Ωfvh dx∀vh∈Vh\int_\Omega \nabla u_h \cdot \nabla v_h\, dx = \int_\Omega f v_h\, dx \quad \forall v_h \in V_h

This reduces to solving a linear system Au=bA\mathbf{u} = \mathbf{b} where Aij=∫Ω∇ϕi⋅∇ϕj dxA_{ij} = \int_\Omega \nabla\phi_i \cdot \nabla\phi_j\, dx for basis functions {ϕi}\{\phi_i\}. Céa’s lemma provides a quasi-optimal error estimate:

∥u−uh∥H1≤Cinf⁡vh∈Vh∥u−vh∥H1\|u - u_h\|_{H^1} \leq C \inf_{v_h \in V_h} \|u - v_h\|_{H^1}

In convex optimisation, the existence of minimisers for a functional J:H→RJ : H \to \mathbb{R} follows from the direct method of calculus of variations: if JJ is coercive, lower semicontinuous, and HH is reflexive, then a minimiser exists. This applies to problems such as:

min⁡u∈H01(Ω)12∫Ω∣∇u∣2 dx−∫Ωfu dx\min_{u \in H^1_0(\Omega)} \frac{1}{2} \int_\Omega |\nabla u|^2\, dx - \int_\Omega f u\, dx

The optimality condition is precisely the weak formulation of the Poisson equation.

Theorem 7.2 (Stampacchia). Let HH be a Hilbert space, K⊂HK \subset H a nonempty closed convex set, and a(⋅,⋅)a(\cdot, \cdot) a coercive bilinear form. For any ℓ∈H∗\ell \in H^*, there exists a unique u∈Ku \in K such that a(u,v−u)≥ℓ(v−u)a(u, v - u) \geq \ell(v - u) for all v∈Kv \in K. This is the foundation of variational inequalities and obstacle problems.

7.7 Worked Example: Compact Operators and Integral Equations

Section titled “7.7 Worked Example: Compact Operators and Integral Equations”

Problem. Solve the Fredholm integral equation u(x)−λ∫abK(x,y)u(y)dy=f(x)u(x) - \lambda \int_a^b K(x, y) u(y) dy = f(x) where KK is a continuous kernel on [a,b]2[a, b]^2.

Solution

The integral operator (Tu)(x)=∫abK(x,y)u(y)dy(T u)(x) = \int_a^b K(x, y) u(y) dy is compact on L2[a,b]L^2[a, b] (by the Arzela-Ascoli theorem or more generally by the fact that KK is Hilbert-Schmidt). For λ\lambda not in the spectrum of TT, the equation has a unique solution by the Fredholm alternative: either the homogeneous equation has only the trivial solution and the inhomogeneous equation has a unique solution, or the homogeneous equation has nontrivial solutions and the inhomogeneous equation has solutions only for ff orthogonal to the nullspace of T∗T^*.

The solution can be expressed using the resolvent operator Rλ=(I−λT)−1R_\lambda = (I - \lambda T)^{-1}:

u=f+λRλfu = f + \lambda R_\lambda f

For degenerate (separable) kernels K(x,y)=∑i=1ngi(x)hi(y)K(x, y) = \sum_{i=1}^n g_i(x) h_i(y), the equation reduces to an n×nn \times n linear system.

■\blacksquare

Problem. Solve u−Tu=fu - Tu = f by iteration where ∥T∥<1\|T\| < 1.

Solution

Since ∥T∥<1\|T\| < 1, the Neumann series (I−T)−1=∑n=0∞Tn(I - T)^{-1} = \sum_{n=0}^\infty T^n converges in operator norm. The solution is:

u=∑n=0∞Tnfu = \sum_{n=0}^\infty T^n f

The error after NN terms satisfies ∥u−uN∥≤∥T∥N+11−∥T∥∥f∥\|u - u_N\| \leq \frac{\|T\|^{N+1}}{1 - \|T\|} \|f\|.

■\blacksquare

7.9 Application: Control Theory and the Riccati Equation

Section titled “7.9 Application: Control Theory and the Riccati Equation”

In optimal control, the linear-quadratic regulator (LQR) problem seeks to minimise:

J(u)=∫0∞(x(t)TQx(t)+u(t)TRu(t)) dtJ(u) = \int_0^\infty (x(t)^T Q x(t) + u(t)^T R u(t))\, dt

subject to x˙=Ax+Bu\dot{x} = Ax + Bu. The optimal control is u=−Kxu = -Kx where K=R−1BTPK = R^{-1}B^T P and PP solves the algebraic Riccati equation:

ATP+PA−PBR−1BTP+Q=0A^T P + P A - P B R^{-1} B^T P + Q = 0

The existence and uniqueness of a positive definite solution PP follows from spectral theory of Hamiltonian matrices and functional analysis on the space of symmetric operators.

7.10 Application: Machine Learning and Reproducing Kernel Hilbert Spaces

Section titled “7.10 Application: Machine Learning and Reproducing Kernel Hilbert Spaces”

A reproducing kernel Hilbert space (RKHS) HH is a Hilbert space of functions on XX such that the evaluation functional δx(f)=f(x)\delta_x(f) = f(x) is bounded for all x∈Xx \in X. By the Riesz representation theorem, there exists kx∈Hk_x \in H with f(x)=⟨f,kx⟩f(x) = \langle f, k_x \rangle.

The kernel k(x,y)=⟨kx,ky⟩k(x, y) = \langle k_x, k_y \rangle is a positive definite function. The Moore-Aronszajn theorem states that every positive definite kernel corresponds to a unique RKHS. RKHS theory underpins kernel methods in machine learning, including support vector machines and Gaussian processes.

Functional analysis provides the language and machinery for solving differential equations, signal processing, and machine learning. In PDE theory, weak solutions are obtained by projecting onto finite-dimensional subspaces via the Galerkin method, with existence guaranteed by the Lax-Milgram theorem. The Fourier transform decomposes signals into frequencies, and the sampling theorem connects continuous signals to their discrete representations. In quantum mechanics, states live in Hilbert space and observables are self-adjoint operators whose spectral decompositions determine measurement outcomes. In machine learning, reproducing kernel Hilbert spaces provide the mathematical framework for support vector machines and Gaussian processes, where inner products encode similarity between data points.

Mistake 1: Assuming the Lax-Milgram theorem requires a Hilbert space inner product The Lax-Milgram theorem applies to any coercive bounded bilinear form on a Hilbert space, not just the standard inner product. Students often restrict themselves to the inner product formulation and miss that the theorem handles more general problems like those arising from PDEs with non-symmetric bilinear forms.

Mistake 2: Confusing weak and strong solutions of PDEs A weak solution satisfies the PDE in a distributional sense, while a strong solution satisfies it pointwise with enough regularity. Students sometimes assume that existence of a weak solution immediately gives a classical solution. Additional regularity theory (elliptic regularity, Sobolev embedding) is needed to upgrade weak solutions to strong ones.

Mistake 3: Forgetting that compactness is essential for extracting convergent subsequences In the direct method of calculus of variations, one needs a minimizing sequence, weak lower semicontinuity of the functional, and weak compactness of the domain. Students frequently try to extract a strongly convergent subsequence from a bounded sequence, which fails in infinite dimensions. Weak compactness (via reflexivity) and then using the compactness of certain operators is the correct approach.