Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Analysis

320 missions · 177 completed

Missions

Open143Completed177All320
🏆Completed
Functional AnalysisHarmonic AnalysisMathematical Physics+1·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics IX: The Free Schrödinger OperatorTextbook

Motivation

The free Schrödinger operator H0=−ΔH_0 = -\DeltaH0​=−Δ is the Hamiltonian of a quantum particle, or of NNN non-interacting particles, moving in Rn\mathbb R^nRn without external forces. Every Schrödinger operator H=−Δ+VH = -\Delta + VH=−Δ+V studied in quantum mechanics is a perturbation of it, and each standard tool of the theory refers back to H0H_0H0​: the Kato–Rellich theorem asks that VVV be relatively bounded with respect to H0H_0H0​, Weyl's theorem compares essential spectra with that of H0H_0H0​, and scattering theory compares the dynamics e−itHe^{-itH}e−itH with the free dynamics e−itH0e^{-itH_0}e−itH0​. Knowing exactly what H0H_0H0​ is (its domain, its self-adjointness, its spectrum and its time evolution) is therefore the base case of the spectral theory of Schrödinger operators.

All of this is obtained from one tool, the Fourier transform, which turns differentiation into multiplication. This mission follows Chapter 7 of G. Teschl, Mathematical Methods in Quantum Mechanics (AMS GSM 99, 2009), doi:10.1090/gsm/099. The chapter first develops the Fourier transform on the Schwartz space, on L1L^1L1 and on L2L^2L2, and then applies it to H0H_0H0​. The same material appears in Reed–Simon (Vol. II, Sec. IX.1 and IX.7).

Setting

Write Rn\mathbb R^nRn for Euclidean space with px=∑jpjxjpx = \sum_j p_j x_jpx=∑j​pj​xj​ and x2=∣x∣2x^2 = |x|^2x2=∣x∣2. For an integrable f:Rn→Cf : \mathbb R^n \to \mathbb Cf:Rn→C the Fourier transform and its inverse are

f^(p)=F(f)(p)=1(2π)n/2∫Rne−ipxf(x) dnx,gˇ(x)=1(2π)n/2∫Rneipxg(p) dnp.\hat f(p) = \mathcal F(f)(p) = \frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n} e^{-ipx} f(x)\,d^nx, \qquad \check g(x) = \frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n} e^{ipx} g(p)\,d^np .f^​(p)=F(f)(p)=(2π)n/21​∫Rn​e−ipxf(x)dnx,gˇ​(x)=(2π)n/21​∫Rn​eipxg(p)dnp.

The Schwartz space S(Rn)\mathcal S(\mathbb R^n)S(Rn) consists of the smooth functions all of whose derivatives decay faster than any polynomial. L1(Rn)L^1(\mathbb R^n)L1(Rn) and L2(Rn)L^2(\mathbb R^n)L2(Rn) are the usual Lebesgue spaces, and C∞(Rn)C_\infty(\mathbb R^n)C∞​(Rn) denotes the continuous functions vanishing at infinity. The convolution of f,g∈L1f, g \in L^1f,g∈L1 is (f∗g)(x)=∫f(y)g(x−y) dny(f*g)(x) = \int f(y)g(x-y)\,d^ny(f∗g)(x)=∫f(y)g(x−y)dny.

The Sobolev space is H2(Rn)={ψ∈L2∣p2ψ^(p)∈L2}H^2(\mathbb R^n) = \{\psi \in L^2 \mid p^2\hat\psi(p) \in L^2\}H2(Rn)={ψ∈L2∣p2ψ^​(p)∈L2}. The free Schrödinger operator is

H0ψ=−Δψ=F−1(p2ψ^(p)),D(H0)=H2(Rn),H_0\psi = -\Delta\psi = \mathcal F^{-1}\big(p^2\hat\psi(p)\big), \qquad \mathfrak D(H_0) = H^2(\mathbb R^n),H0​ψ=−Δψ=F−1(p2ψ^​(p)),D(H0​)=H2(Rn),

in units with ℏ=1\hbar = 1ℏ=1 and mass m=1/2m = 1/2m=1/2. Its time evolution is e−itH0ψ=F−1(e−itp2ψ^)e^{-itH_0}\psi = \mathcal F^{-1}(e^{-itp^2}\hat\psi)e−itH0​ψ=F−1(e−itp2ψ^​). For a linear operator AAA with domain D(A)\mathfrak D(A)D(A), the resolvent set ρ(A)\rho(A)ρ(A) is the set of z∈Cz \in \mathbb Cz∈C for which A−zA - zA−z maps D(A)\mathfrak D(A)D(A) bijectively onto the Hilbert space with a bounded inverse RA(z)R_A(z)RA​(z), and the spectrum is σ(A)=C∖ρ(A)\sigma(A) = \mathbb C\setminus\rho(A)σ(A)=C∖ρ(A). For self-adjoint AAA and a vector ψ\psiψ, the spectral measure μψ\mu_\psiμψ​ is the finite Borel measure on R\mathbb RR with ⟨ψ,RA(z)ψ⟩=∫(λ−z)−1 dμψ(λ)\langle\psi, R_A(z)\psi\rangle = \int (\lambda - z)^{-1}\,d\mu_\psi(\lambda)⟨ψ,RA​(z)ψ⟩=∫(λ−z)−1dμψ​(λ) for all z∉Rz \notin \mathbb Rz∈/R. The absolutely continuous, singular continuous and pure point spectra σac,σsc,σpp\sigma_{ac}, \sigma_{sc}, \sigma_{pp}σac​,σsc​,σpp​ are the spectra of AAA restricted to the vectors whose spectral measures are of the respective type. A subspace D⊆D(A)D \subseteq \mathfrak D(A)D⊆D(A) is a core if the closure of A∣DA|_DA∣D​ is AAA.

Formalization targets

Goal: Theorem 7.8

For n≥1n \ge 1n≥1, H0H_0H0​ is self-adjoint and

σ(H0)=σac(H0)=[0,∞),σsc(H0)=σpp(H0)=∅.\sigma(H_0) = \sigma_{ac}(H_0) = [0,\infty), \qquad \sigma_{sc}(H_0) = \sigma_{pp}(H_0) = \emptyset .σ(H0​)=σac​(H0​)=[0,∞),σsc​(H0​)=σpp​(H0​)=∅.

In the Lean statement the spectral-type part is the equivalent assertion that every spectral measure μψ\mu_\psiμψ​ of H0H_0H0​ is absolutely continuous with respect to Lebesgue measure.

Milestones

  • Gaussians (Lemma 7.3). For Re⁡z>0\operatorname{Re} z > 0Rez>0, e−zx2/2∈S(Rn)e^{-zx^2/2} \in \mathcal S(\mathbb R^n)e−zx2/2∈S(Rn) and F(e−zx2/2)(p)=z−n/2e−p2/(2z)\mathcal F(e^{-zx^2/2})(p) = z^{-n/2} e^{-p^2/(2z)}F(e−zx2/2)(p)=z−n/2e−p2/(2z), with zn/2=(z)nz^{n/2} = (\sqrt z)^nzn/2=(z​)n for the principal root.
  • Inversion on S\mathcal SS (Theorem 7.4). F\mathcal FF is a bijection of S(Rn)\mathcal S(\mathbb R^n)S(Rn) with inverse g↦gˇg \mapsto \check gg↦gˇ​, and F2f(x)=f(−x)\mathcal F^2 f(x) = f(-x)F2f(x)=f(−x), so F4=I\mathcal F^4 = \mathbb IF4=I.
  • Plancherel (Theorem 7.5). F\mathcal FF extends to a unitary operator on L2(Rn)L^2(\mathbb R^n)L2(Rn) with σ(F)={1,−1,i,−i}\sigma(\mathcal F) = \{1,-1,i,-i\}σ(F)={1,−1,i,−i}.
  • Riemann–Lebesgue (Lemma 7.6). F:L1→C∞\mathcal F : L^1 \to C_\inftyF:L1→C∞​ is injective and ∥f^∥∞≤(2π)−n/2∥f∥1\|\hat f\|_\infty \le (2\pi)^{-n/2}\|f\|_1∥f^​∥∞​≤(2π)−n/2∥f∥1​.
  • Convolution (Lemma 7.7). f∗g∈L1f * g \in L^1f∗g∈L1, ∥f∗g∥1≤∥f∥1∥g∥1\|f*g\|_1 \le \|f\|_1\|g\|_1∥f∗g∥1​≤∥f∥1​∥g∥1​ and (f∗g)∧=(2π)n/2f^g^(f*g)^\wedge = (2\pi)^{n/2}\hat f\hat g(f∗g)∧=(2π)n/2f^​g^​.
  • Core (Lemma 7.9). Cc∞(Rn)C_c^\infty(\mathbb R^n)Cc∞​(Rn) is a core for H0H_0H0​.
  • Asymptotics (Lemma 7.10). For ψ∈L2\psi \in L^2ψ∈L2, e−itH0ψ(x)−(2it)−n/2eix2/(4t)ψ^(x/(2t))→0e^{-itH_0}\psi(x) - (2it)^{-n/2} e^{ix^2/(4t)}\hat\psi(x/(2t)) \to 0e−itH0​ψ(x)−(2it)−n/2eix2/(4t)ψ^​(x/(2t))→0 in L2L^2L2 as ∣t∣→∞|t|\to\infty∣t∣→∞.

Significance

The result. Theorem 7.8 says that a free quantum particle has no bound states and that its energy spectrum is purely absolutely continuous and fills [0,∞)[0,\infty)[0,∞). Combined with the RAGE theorem this gives the escape of every free wave packet from bounded regions, and Lemma 7.10 makes the escape quantitative: at large times the position distribution is the momentum distribution rescaled by 2t2t2t. The self-adjointness of H0H_0H0​ on H2(Rn)H^2(\mathbb R^n)H2(Rn) and the core Cc∞(Rn)C_c^\infty(\mathbb R^n)Cc∞​(Rn) are the inputs to the Kato–Rellich treatment of atomic Hamiltonians, and σess(H0)=[0,∞)\sigma_{ess}(H_0) = [0,\infty)σess​(H0​)=[0,∞) is the reference spectrum of Weyl's theorem and of the HVZ theorem.

Formalizing it. The results are classical. Mathlib contains the Fourier transform on L1L^1L1, Schwartz space and L2L^2L2 in the normalization e−2πi⟨x,ξ⟩e^{-2\pi i\langle x,\xi\rangle}e−2πi⟨x,ξ⟩ (including Fourier inversion, Riemann–Lebesgue and the L2L^2L2 isometry), and the Prove2Me corpus holds several of these as FamousTheorems in that normalization. What is missing is Teschl's normalization with its constants, the spectrum of the L2L^2L2 Fourier transform, the operator H0H_0H0​ as an unbounded self-adjoint operator, its resolvent spectrum and spectral type, and the free dynamics. This mission produces these objects in a form the later chapters (Kato–Rellich for atoms, Weyl, HVZ, scattering) can build on.

Difficulty

The Fourier-analytic milestones are close to Mathlib but not in it: every constant has to be transported from the 2π2\pi2π-in-the-exponent convention to Teschl's (2π)−n/2(2\pi)^{-n/2}(2π)−n/2 convention, including the branch of zn/2z^{n/2}zn/2 in Lemma 7.3 and the phase (2it)−n/2(2it)^{-n/2}(2it)−n/2 in Lemma 7.10. The lower bound σ(F)⊇{1,−1,i,−i}\sigma(\mathcal F) \supseteq \{1,-1,i,-i\}σ(F)⊇{1,−1,i,−i} in Theorem 7.5 needs an eigenfunction for each fourth root of unity, which the book defers to the Hermite functions of Section 8.3.

For the goal, self-adjointness and σ(H0)=[0,∞)\sigma(H_0) = [0,\infty)σ(H0​)=[0,∞) require working with the resolvent spectrum of an unbounded LinearPMap, which Mathlib does not provide, and transporting self-adjointness and resolvents through the unitary Fourier transform. The spectral-type statement requires identifying the spectral measure μψ\mu_\psiμψ​ of an unbounded operator from its resolvent alone, without a spectral theorem in the library, and showing that it has a density for every ψ∈L2\psi \in L^2ψ∈L2, not only for nice ψ\psiψ. Lemma 7.9 is a statement about the graph norm of −Δ-\Delta−Δ, which is not controlled by the L2L^2L2 norm alone.

Formalization scope

Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n), so that pxpxpx and x2x^2x2 are the Euclidean ones, and L2(Rn)L^2(\mathbb R^n)L2(Rn) is Lp ℂ 2 volume. fourier and fourierInv are Teschl's integrals (7.3) and (7.8) with the prefactor (2π)−n/2(2\pi)^{-n/2}(2π)−n/2. The L2L^2L2 transform ψ^\hat\psiψ^​ (fourierL2) is Mathlib's unitary L2L^2L2 transform rescaled by ψ^(p)=(2π)−n/2(FMψ)(p/2π)\hat\psi(p) = (2\pi)^{-n/2}(\mathcal F_{\mathrm M}\psi)(p/2\pi)ψ^​(p)=(2π)−n/2(FM​ψ)(p/2π), and Theorem 7.5 asserts that it is the unitary extension of (7.3). H0H_0H0​ (freeHamiltonian) and e−itH0e^{-itH_0}e−itH0​ (timeEvolution) are defined as Fourier conjugates of the maximal multiplication operator by the symbol of −Δ-\Delta−Δ and of multiplication by e−itp2e^{-itp^2}e−itp2, written with Mathlib's L2L^2L2 transform, where the symbol is 4π2∣ξ∣24\pi^2|\xi|^24π2∣ξ∣2. These are the same operators as Teschl's, and the domain is exactly H2(Rn)H^2(\mathbb R^n)H2(Rn). Unbounded operators are Mathlib LinearPMaps, self-adjointness is Mathlib's IsSelfAdjoint, and the resolvent and spectrum are the bijective-with-bounded-inverse notions of Teschl, p. 73, not Mathlib's Banach-algebra spectrum, which is used only for the bounded operator F\mathcal FF in Theorem 7.5. Statements that need it carry n≥1n \ge 1n≥1, which the book leaves implicit.

No projection-valued measure or functional calculus is taken as data. The spectral types in (7.25) are expressed through the spectral measures μψ\mu_\psiμψ​, and these are pinned down intrinsically by their Borel transforms ⟨ψ,RH0(z)ψ⟩\langle\psi, R_{H_0}(z)\psi\rangle⟨ψ,RH0​​(z)ψ⟩.

A trivializing formalization is ruled out: σ(H0)\sigma(H_0)σ(H0​) is the resolvent spectrum of the operator, not the essential range of p2p^2p2, so σ(H0)=[0,∞)\sigma(H_0) = [0,\infty)σ(H0​)=[0,∞) is not a computation on a multiplication symbol. The absolutely continuous measure in the goal must reproduce the actual resolvent matrix elements, so it cannot be chosen freely, and e−itH0e^{-itH_0}e−itH0​ is not defined by its integral kernel (7.30).

A complete development needs change of normalization lemmas for the Fourier transform, the Hermite eigenfunctions of F\mathcal FF, unitary equivalence of LinearPMaps and its effect on adjoints and resolvents, self-adjointness of maximal real multiplication operators, polar coordinates on Rn\mathbb R^nRn, and graph-norm approximation by cut-offs. The normalization bridge and the multiplication-operator results are reusable across the series. Contributions of either are welcome.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, Graduate Studies in Mathematics 99, AMS, 2009, Chapter 7. https://doi.org/10.1090/gsm/099
  • M. Reed and B. Simon, Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness, Academic Press, 1975, Sections IX.1 and IX.7.
  • E. M. Stein and G. Weiss, Introduction to Fourier Analysis on Euclidean Spaces, Princeton University Press, 1971, Chapter I. https://doi.org/10.1515/9781400883899
12 thms4 active usersReviewed
🏆Completed
Functional AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics VI: Relatively Bounded Perturbations and the Kato–Rellich TheoremTextbook

Why relatively bounded perturbations matter

A quantum-mechanical Hamiltonian is usually a sum H=H0+VH = H_0 + VH=H0​+V of a kinetic energy H0H_0H0​ (for a free particle, H0=−ΔH_0 = -\DeltaH0​=−Δ in units with ℏ=1\hbar = 1ℏ=1, m=1/2m = 1/2m=1/2) and a potential energy VVV. Observables must be self-adjoint operators, not merely symmetric ones: only then does the spectral theorem apply and the time evolution e−itHe^{-itH}e−itH exist as a unitary group. Self-adjointness of H0H_0H0​ is usually a direct computation. For the sum it is not, because H0H_0H0​ and VVV are unbounded, and the sum of two self-adjoint unbounded operators need not be self-adjoint or even densely defined.

The Kato–Rellich theorem settles this when VVV is small compared with H0H_0H0​ in a precise sense. The result goes back to Rellich's perturbation theory of spectral decompositions (see the notes to Section V.4 of Kato's monograph), and Kato used it in 1951 (Trans. AMS 70, 195–211) to prove that atomic Hamiltonians with Coulomb interactions are self-adjoint. It is the standard first tool in the mathematical theory of Schrödinger operators. This mission formalizes Section 6.1 of G. Teschl, Mathematical Methods in Quantum Mechanics (AMS GSM 99, 2009): the notion of relative boundedness, its characterizations, the theorem itself, and the second resolvent formula.

Setting

Let H\mathfrak{H}H be a complex Hilbert space with inner product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩, conjugate-linear in the first slot. A linear operator AAA is a linear map A:D(A)→HA : \mathfrak{D}(A) \to \mathfrak{H}A:D(A)→H defined on a subspace D(A)⊆H\mathfrak{D}(A) \subseteq \mathfrak{H}D(A)⊆H, its domain. The sum A+BA + BA+B is defined on D(A)∩D(B)\mathfrak{D}(A) \cap \mathfrak{D}(B)D(A)∩D(B). AAA is symmetric if D(A)\mathfrak{D}(A)D(A) is dense and ⟨φ,Aψ⟩=⟨Aφ,ψ⟩\langle \varphi, A\psi\rangle = \langle A\varphi, \psi\rangle⟨φ,Aψ⟩=⟨Aφ,ψ⟩ for φ,ψ∈D(A)\varphi, \psi \in \mathfrak{D}(A)φ,ψ∈D(A). It is self-adjoint if it equals its adjoint A∗A^*A∗, domains included, and essentially self-adjoint if its closure A‾\overline{A}A (the operator whose graph is the closure of the graph of AAA) is self-adjoint. AAA is bounded from below by γ∈R\gamma \in \mathbb{R}γ∈R if ⟨ψ,Aψ⟩≥γ∥ψ∥2\langle\psi, A\psi\rangle \ge \gamma\|\psi\|^2⟨ψ,Aψ⟩≥γ∥ψ∥2 for all ψ∈D(A)\psi \in \mathfrak{D}(A)ψ∈D(A).

The resolvent set ρ(A)\rho(A)ρ(A) is the set of z∈Cz \in \mathbb{C}z∈C for which A−z:D(A)→HA - z : \mathfrak{D}(A) \to \mathfrak{H}A−z:D(A)→H is a bijection with bounded inverse RA(z)=(A−z)−1R_A(z) = (A - z)^{-1}RA​(z)=(A−z)−1, the resolvent.

An operator BBB is AAA bounded if D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and there are constants a,b≥0a, b \ge 0a,b≥0 with

∥Bψ∥≤a∥Aψ∥+b∥ψ∥,ψ∈D(A).(6.1)\|B\psi\| \le a\|A\psi\| + b\|\psi\|, \qquad \psi \in \mathfrak{D}(A). \tag{6.1}∥Bψ∥≤a∥Aψ∥+b∥ψ∥,ψ∈D(A).(6.1)

The AAA-bound of BBB is the infimum of the admissible aaa. If BBB is AAA bounded, the product BRA(z)BR_A(z)BRA​(z) is defined on all of H\mathfrak{H}H for z∈ρ(A)z \in \rho(A)z∈ρ(A).

Formalization targets

Goal: the Kato–Rellich theorem (Theorem 6.4, self-adjoint case)

Let AAA be self-adjoint and BBB symmetric with AAA-bound less than one. Then

A+B with D(A+B)=D(A) is self-adjoint,A + B \text{ with } \mathfrak{D}(A + B) = \mathfrak{D}(A) \text{ is self-adjoint,}A+B with D(A+B)=D(A) is self-adjoint,

and if AAA is bounded from below by γ\gammaγ and (6.1) holds with constants a∈[0,1)a \in [0,1)a∈[0,1) and b≥0b \ge 0b≥0, then

A+B ≥ γ−max⁡(a∣γ∣+b, b1−a).A + B \ \ge\ \gamma - \max\Big(a|\gamma| + b,\ \frac{b}{1-a}\Big).A+B ≥ γ−max(a∣γ∣+b, 1−ab​).

The printed form of (6.3) has b/(a−1)b/(a-1)b/(a−1) where this statement has b/(1−a)b/(1-a)b/(1−a). The printed version is false: a two-dimensional example with γ=0\gamma = 0γ=0, a≈0.93a \approx 0.93a≈0.93, b≈5.97b \approx 5.97b≈5.97 has lowest eigenvalue of A+BA + BA+B about −6.66<−b-6.66 < -b−6.66<−b. The corrected constant is the one in Kato's monograph (Theorem V.4.11). The lower bound is stated for every admissible pair (a,b)(a, b)(a,b), not for the AAA-bound itself, which is an infimum and need not be attained.

Milestones

  1. Lemma 6.1. AAA bounded operators form a linear space, and the AAA-bound of α1B1+α2B2\alpha_1 B_1 + \alpha_2 B_2α1​B1​+α2​B2​ is at most ∣α1∣a1+∣α2∣a2|\alpha_1| a_1 + |\alpha_2| a_2∣α1​∣a1​+∣α2​∣a2​.
  2. Lemma 6.2. For AAA closed with nonempty resolvent set and BBB closable, the following are equivalent: BBB is AAA bounded; D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B); BRA(z)BR_A(z)BRA​(z) is bounded for one z∈ρ(A)z \in \rho(A)z∈ρ(A); BRA(z)BR_A(z)BRA​(z) is bounded for all z∈ρ(A)z \in \rho(A)z∈ρ(A). The AAA-bound is at most inf⁡z∈ρ(A)∥BRA(z)∥\inf_{z \in \rho(A)} \|BR_A(z)\|infz∈ρ(A)​∥BRA​(z)∥.
  3. Lemma 6.3. For AAA self-adjoint and BBB AAA bounded, the AAA-bound equals lim⁡λ→∞∥BRA(±iλ)∥\lim_{\lambda\to\infty}\|BR_A(\pm i\lambda)\|limλ→∞​∥BRA​(±iλ)∥, and also lim⁡λ→∞∥BRA(−λ)∥\lim_{\lambda\to\infty}\|BR_A(-\lambda)\|limλ→∞​∥BRA​(−λ)∥ when AAA is bounded from below.
  4. Theorem 6.4, essentially self-adjoint case. For AAA essentially self-adjoint and BBB symmetric with AAA-bound less than one, A+BA + BA+B is essentially self-adjoint, D(A‾)⊆D(B‾)\mathfrak{D}(\overline{A}) \subseteq \mathfrak{D}(\overline{B})D(A)⊆D(B) and A+B‾=A‾+B‾\overline{A + B} = \overline{A} + \overline{B}A+B​=A+B, with the same lower bound.
  5. Lemma 6.5. For closed AAA, BBB with D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and z∈ρ(A)∩ρ(A+B)z \in \rho(A) \cap \rho(A+B)z∈ρ(A)∩ρ(A+B),
RA+B(z)−RA(z)=−RA(z)BRA+B(z)=−RA+B(z)BRA(z).R_{A+B}(z) - R_A(z) = -R_A(z) B R_{A+B}(z) = -R_{A+B}(z) B R_A(z).RA+B​(z)−RA​(z)=−RA​(z)BRA+B​(z)=−RA+B​(z)BRA​(z).

Significance

Kato–Rellich is the entry point to self-adjointness of Schrödinger operators. With the Sobolev estimates of later chapters it gives self-adjointness of −Δ+V-\Delta + V−Δ+V on H2(R3)H^2(\mathbb{R}^3)H2(R3) for V∈L2+L∞V \in L^2 + L^\inftyV∈L2+L∞, which covers the hydrogen atom and, through the NNN-body extension, every atom and molecule with Coulomb interactions. The lower bound (6.3) says the perturbed Hamiltonian is still bounded from below, which is the mathematical form of stability of the ground state. The second resolvent formula is used throughout perturbation theory: to compare spectra (Weyl's theorem on essential spectra), to study resolvent convergence, and in scattering theory.

In a formal library, relative boundedness is the shared layer on which every later statement about Schrödinger operators rests. Mathlib has unbounded operators (LinearPMap), their adjoints and closures, but no relative boundedness, no resolvent of an unbounded operator, and no perturbation theorem for self-adjointness. The theorem is textbook material and has been proved many times; what does not yet exist is a machine-checked proof for unbounded operators in this generality.

Difficulty

Self-adjointness of A+BA + BA+B is a statement about the adjoint (A+B)∗(A+B)^*(A+B)∗, whose domain is defined implicitly. The inclusion A+B⊆(A+B)∗A + B \subseteq (A + B)^*A+B⊆(A+B)∗ follows from symmetry, but the reverse inclusion does not come from any manipulation on D(A)\mathfrak{D}(A)D(A). It requires knowing that certain ranges are all of H\mathfrak{H}H, and that range information is not visible from the inequality (6.1) alone. Relating the AAA-bound, an infimum over constants in an inequality on D(A)\mathfrak{D}(A)D(A), to norms of the bounded operators BRA(z)BR_A(z)BRA​(z) is where the self-adjointness of AAA enters. For the essentially self-adjoint case, the domains of three different closures have to be compared. For the lower bound, the constant depends on aaa and bbb in two regimes, and the printed version of the formula gets one regime wrong.

Formalization scope

  • Hilbert space. {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]; separability is not assumed and not needed.
  • Operators are LinearPMaps H →ₗ.[ℂ] H; A+BA + BA+B is Mathlib's sum on the intersection of the domains; closures are LinearPMap.closure; self-adjointness is Mathlib's IsSelfAdjoint; symmetric operators include density of the domain.
  • Relative bounds. IsRelativelyBoundedWith A B a b contains the domain inclusion D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and a,b≥0a, b \ge 0a,b≥0. The AAA-bound relativeBound A B is valued in [0,∞][0,\infty][0,∞] and equals ∞\infty∞ exactly when BBB is not AAA bounded, so "AAA-bound less than one" cannot hold vacuously.
  • Resolvents. ρ(A)\rho(A)ρ(A) and RA(z)R_A(z)RA​(z) are defined for arbitrary operators as in Teschl (2.66): a bounded, everywhere defined two-sided inverse of A−zA - zA−z. Mathlib's Banach-algebra spectrum is not used. resolvent A z is 000 off ρ(A)\rho(A)ρ(A), and statements use it only at points of ρ(A)\rho(A)ρ(A) or eventually along rays that lie in ρ(A)\rho(A)ρ(A).
  • Norms of possibly unbounded operators (opNorm) are valued in [0,∞][0,\infty][0,∞]; "BRA(z)BR_A(z)BRA​(z) is bounded" means everywhere defined with finite norm.
  • Additions to the printed statements. Lemma 6.2 carries ρ(A)≠∅\rho(A) \neq \emptysetρ(A)=∅, without which its "for one zzz" clause is unsatisfiable. Lemma 6.1's "less than" is stated as "at most". (6.3) uses b/(1−a)b/(1-a)b/(1−a).
  • Ruling out trivialization. The hypotheses of the goal are only: AAA self-adjoint, BBB symmetric, and AAA-bound less than one. No hypothesis that A+BA + BA+B is closed, that Ran⁡(A+B±i)=H\operatorname{Ran}(A + B \pm i) = \mathfrak{H}Ran(A+B±i)=H, or that ±i∈ρ(A+B)\pm i \in \rho(A+B)±i∈ρ(A+B) appears, since any of these would assume the conclusion.

A complete development needs basic facts about resolvents of self-adjoint operators (±iλ∈ρ(A)\pm i\lambda \in \rho(A)±iλ∈ρ(A) and the norm estimates for RAR_ARA​), the closed graph theorem for closable operators, and Neumann series. All of these are reusable in later missions of this series: Weyl's theorem, the free Schrödinger operator, atomic Hamiltonians. Contributions that build these as general LinearPMap lemmas are welcome.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, AMS Graduate Studies in Mathematics 99, 2009, Section 6.1. https://doi.org/10.1090/gsm/099
  • T. Kato, Perturbation Theory for Linear Operators, Springer, 2nd ed. 1976, Section V.4. https://doi.org/10.1007/978-3-642-66282-9
  • T. Kato, "Fundamental properties of Hamiltonian operators of Schrödinger type", Trans. Amer. Math. Soc. 70 (1951), 195–211. https://doi.org/10.1090/S0002-9947-1951-0041010-X
  • M. Reed and B. Simon, Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness, Academic Press, 1975, Theorem X.12. ISBN 978-0-12-585002-5
13 thms4 active usersReviewed
🏆Completed
Functional AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations VI: Interior Regularity of Weak Solutions via Difference QuotientsTextbook

Motivation

A second-order elliptic equation in divergence form, Lu=−∑i,j∂i(aij∂ju)=fLu = -\sum_{i,j}\partial_i(a_{ij}\partial_j u) = fLu=−∑i,j​∂i​(aij​∂j​u)=f, is usually solved in a weak sense: the Lax–Milgram theorem or the Fredholm alternative produces a function u∈H1(Ω)u \in H^1(\Omega)u∈H1(Ω), which has only first-order weak derivatives, and the equation holds after one integration by parts against every test function. The phrase "solution of a PDE" then covers objects for which the second derivatives appearing in LLL need not exist. Regularity theory closes this gap: under smoothness of the coefficients and the data, weak solutions have exactly as many derivatives as the equation suggests. It is used throughout the calculus of variations, spectral theory and nonlinear PDE.

The interior H2H^2H2 estimate for divergence-form operators with C1C^1C1 coefficients goes back to the difference-quotient technique of L. Nirenberg (1955) and is standard in textbooks such as Evans, Partial Differential Equations, §6.3, and Gilbarg–Trudinger, Chapter 8. This mission follows the treatment in J. K. Hunter's lecture notes, §4.11 and Appendix 4.C.

Setting

Points of Rn\mathbb{R}^nRn are written x=(x1,…,xn)x = (x_1, \dots, x_n)x=(x1​,…,xn​), and eie_iei​ is the iiith standard unit vector. Let Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn be an open set. A set Ω′\Omega'Ω′ is compactly contained in Ω\OmegaΩ, written Ω′⋐Ω\Omega' \Subset \OmegaΩ′⋐Ω, if Ω′\Omega'Ω′ is nonempty and open, its closure Ω′‾\overline{\Omega'}Ω′ is compact, and Ω′‾⊂Ω\overline{\Omega'} \subset \OmegaΩ′⊂Ω.

A test function is an infinitely differentiable ϕ\phiϕ with compact support inside Ω\OmegaΩ (the space Cc∞(Ω)C_c^\infty(\Omega)Cc∞​(Ω)). A function ggg is the weak derivative ∂αf\partial^\alpha f∂αf of a locally integrable fff (multi-index α\alphaα) if ∫Ωgϕ dx=(−1)∣α∣∫Ωf ∂αϕ dx\int_\Omega g\phi\,dx = (-1)^{|\alpha|}\int_\Omega f\,\partial^\alpha\phi\,dx∫Ω​gϕdx=(−1)∣α∣∫Ω​f∂αϕdx for all test functions ϕ\phiϕ. The Sobolev space Hk(Ω)=Wk,2(Ω)H^k(\Omega) = W^{k,2}(\Omega)Hk(Ω)=Wk,2(Ω) consists of the functions whose weak derivatives of order at most kkk exist and lie in L2(Ω)L^2(\Omega)L2(Ω), with norm ∥u∥Hk(Ω)=(∑∣α∣≤k∥∂αu∥L2(Ω)2)1/2\|u\|_{H^k(\Omega)} = (\sum_{|\alpha|\le k}\|\partial^\alpha u\|_{L^2(\Omega)}^2)^{1/2}∥u∥Hk(Ω)​=(∑∣α∣≤k​∥∂αu∥L2(Ω)2​)1/2; more generally Wk,p(Ω)W^{k,p}(\Omega)Wk,p(Ω) uses LpL^pLp. The space H01(Ω)H^1_0(\Omega)H01​(Ω) is the closure of Cc∞(Ω)C_c^\infty(\Omega)Cc∞​(Ω) in H1(Ω)H^1(\Omega)H1(Ω).

The coefficients are functions aija_{ij}aij​, 1≤i,j≤n1 \le i, j \le n1≤i,j≤n, which are bounded (aij∈L∞(Ω)a_{ij} \in L^\infty(\Omega)aij​∈L∞(Ω)), symmetric (aij=ajia_{ij} = a_{ji}aij​=aji​) and uniformly elliptic: for some θ>0\theta > 0θ>0,

∑i,j=1naij(x)ξiξj≥θ∣ξ∣2for a.e. x∈Ω and all ξ∈Rn.\sum_{i,j=1}^n a_{ij}(x)\xi_i\xi_j \ge \theta|\xi|^2 \quad\text{for a.e. } x \in \Omega \text{ and all } \xi \in \mathbb{R}^n.i,j=1∑n​aij​(x)ξi​ξj​≥θ∣ξ∣2for a.e. x∈Ω and all ξ∈Rn.

Given f∈L2(Ω)f \in L^2(\Omega)f∈L2(Ω), a function u∈H1(Ω)u \in H^1(\Omega)u∈H1(Ω) is a weak solution of Lu=fLu = fLu=f if

a(u,v):=∑i,j=1n∫Ωaij ∂iu ∂jv dx=∫Ωfv dxfor all v∈H01(Ω).a(u, v) := \sum_{i,j=1}^n \int_\Omega a_{ij}\,\partial_i u\,\partial_j v\,dx = \int_\Omega f v\,dx \quad \text{for all } v \in H^1_0(\Omega).a(u,v):=i,j=1∑n​∫Ω​aij​∂i​u∂j​vdx=∫Ω​fvdxfor all v∈H01​(Ω).

No boundary condition is imposed on uuu.

For h≠0h \ne 0h=0 the iiith difference quotient of u:Rn→Ru : \mathbb{R}^n \to \mathbb{R}u:Rn→R is Dihu(x)=(u(x+hei)−u(x))/hD_i^h u(x) = (u(x + he_i) - u(x))/hDih​u(x)=(u(x+hei​)−u(x))/h, and Dhu=(D1hu,…,Dnhu)D^h u = (D_1^h u, \dots, D_n^h u)Dhu=(D1h​u,…,Dnh​u) with pointwise length ∣Dhu∣=(∑i(Dihu)2)1/2|D^h u| = (\sum_i (D_i^h u)^2)^{1/2}∣Dhu∣=(∑i​(Dih​u)2)1/2.

Formalization targets

Goal: interior H2H^2H2 regularity (Theorem 4.27)

If moreover aij∈C1(Ω)a_{ij} \in C^1(\Omega)aij​∈C1(Ω), then for every Ω′⋐Ω\Omega' \Subset \OmegaΩ′⋐Ω there is a constant CCC, depending only on nnn, Ω′\Omega'Ω′, Ω\OmegaΩ and the coefficients, such that every weak solution uuu of Lu=fLu = fLu=f with f∈L2(Ω)f \in L^2(\Omega)f∈L2(Ω) satisfies u∈H2(Ω′)u \in H^2(\Omega')u∈H2(Ω′) and

∥u∥H2(Ω′)≤C(∥f∥L2(Ω)+∥u∥L2(Ω)).\|u\|_{H^2(\Omega')} \le C\big(\|f\|_{L^2(\Omega)} + \|u\|_{L^2(\Omega)}\big).∥u∥H2(Ω′)​≤C(∥f∥L2(Ω)​+∥u∥L2(Ω)​).

Milestones: difference quotients (Appendix 4.C)

  • Proposition 4.52 (1): if uuu and its weak derivative ∂iu\partial_i u∂i​u are locally integrable on Rn\mathbb{R}^nRn, then ∂iDjhu=Djh∂iu\partial_i D_j^h u = D_j^h\partial_i u∂i​Djh​u=Djh​∂i​u.
  • Proposition 4.52 (2): for u∈Lp(Rn)u \in L^p(\mathbb{R}^n)u∈Lp(Rn), v∈Lp′(Rn)v \in L^{p'}(\mathbb{R}^n)v∈Lp′(Rn), 1≤p≤∞1 \le p \le \infty1≤p≤∞, ∫(Dihu) v dx=−∫u (Di−hv) dx\int (D_i^h u)\,v\,dx = -\int u\,(D_i^{-h}v)\,dx∫(Dih​u)vdx=−∫u(Di−h​v)dx.
  • Theorem 4.53 (1): with d=dist⁡(Ω′,∂Ω)d = \operatorname{dist}(\Omega', \partial\Omega)d=dist(Ω′,∂Ω), 1≤p<∞1 \le p < \infty1≤p<∞ and 0<∣h∣<d0 < |h| < d0<∣h∣<d, ∥Dihu∥Lp(Ω′)≤∥∂iu∥Lp(Ω)\|D_i^h u\|_{L^p(\Omega')} \le \|\partial_i u\|_{L^p(\Omega)}∥Dih​u∥Lp(Ω′)​≤∥∂i​u∥Lp(Ω)​ for each iii.
  • Theorem 4.53 (2): if u∈Lp(Ω)u \in L^p(\Omega)u∈Lp(Ω), 1<p<∞1 < p < \infty1<p<∞, and ∥Dhu∥Lp(Ω′)≤C\|D^h u\|_{L^p(\Omega')} \le C∥Dhu∥Lp(Ω′)​≤C for all 0<∣h∣<d/20 < |h| < d/20<∣h∣<d/2, then u∈W1,p(Ω′)u \in W^{1,p}(\Omega')u∈W1,p(Ω′) and ∥Du∥Lp(Ω′)≤C\|Du\|_{L^p(\Omega')} \le C∥Du∥Lp(Ω′)​≤C.

Stronger targets

  • Theorem 4.28: if aij∈Ck+1(Ω)a_{ij} \in C^{k+1}(\Omega)aij​∈Ck+1(Ω) and f∈Hk(Ω)f \in H^k(\Omega)f∈Hk(Ω), then u∈Hk+2(Ω′)u \in H^{k+2}(\Omega')u∈Hk+2(Ω′) with ∥u∥Hk+2(Ω′)≤C(∥f∥Hk(Ω)+∥u∥L2(Ω))\|u\|_{H^{k+2}(\Omega')} \le C(\|f\|_{H^k(\Omega)} + \|u\|_{L^2(\Omega)})∥u∥Hk+2(Ω′)​≤C(∥f∥Hk(Ω)​+∥u∥L2(Ω)​), CCC depending only on n,k,Ω′,Ωn, k, \Omega', \Omegan,k,Ω′,Ω and the coefficients.
  • Corollary 4.29: if aij,f∈C∞(Ω)a_{ij}, f \in C^\infty(\Omega)aij​,f∈C∞(Ω), then uuu agrees a.e. in Ω\OmegaΩ with a C∞(Ω)C^\infty(\Omega)C∞(Ω) function.

Significance

The goal theorem shows that weak solutions of divergence-form equations with C1C^1C1 coefficients are strong solutions: their second weak derivatives are square integrable on compact subsets, so the equation Lu=fLu = fLu=f holds pointwise almost everywhere. The iterated version (Theorem 4.28) and its corollary turn the existence theory for weak solutions into existence of smooth solutions whenever the coefficients and data are smooth; in combination with Sobolev embedding this is how one proves that eigenfunctions of the Dirichlet Laplacian on an open set are smooth in its interior.

All of these results are classical and fully proved in the literature. To the best of the platform's records, none is formalized: Mathlib has Lebesgue spaces, Fréchet derivatives and Hilbert-space tools, but neither weak derivatives nor Sobolev spaces on open sets, and there is no elliptic regularity result in any proof assistant known to the maintainers. A complete development would therefore also deliver reusable infrastructure: weak derivatives, Wk,p(Ω)W^{k,p}(\Omega)Wk,p(Ω) and its norm, difference quotients and their calculus, and cut-off functions subordinate to Ω′⋐Ω\Omega' \Subset \OmegaΩ′⋐Ω.

Difficulty

The formal computation behind the estimate — testing the equation against −∂k(η2∂ku)-\partial_k(\eta^2\partial_k u)−∂k​(η2∂k​u) for a cut-off η\etaη and using ellipticity — is illegitimate for a weak solution, because the test function involves second derivatives of uuu that are not yet known to exist. Replacing derivatives by difference quotients makes every step meaningful but requires a separate theory: commuting difference quotients with weak derivatives, a discrete product rule and integration by parts, and a compactness argument in LpL^pLp (reflexivity) that turns an hhh-uniform bound into a weak derivative. The error terms involve difference quotients of the coefficients, which is where aij∈C1a_{ij} \in C^1aij​∈C1 enters, and the final estimate has to be closed with a Cauchy inequality and a second localization to replace ∥u∥H1\|u\|_{H^1}∥u∥H1​ by ∥u∥L2\|u\|_{L^2}∥u∥L2​.

Formalization scope

Space is Rn\mathbb{R}^nRn = EuclideanSpace ℝ (Fin n) with Lebesgue measure volume; coordinates are 0-based (i : Fin n), so the book's e1,…,ene_1, \dots, e_ne1​,…,en​ are EuclideanSpace.single 0 1, …. Functions are real-valued on all of Rn\mathbb{R}^nRn and only their values on the relevant open set matter. Weak derivatives (HasWeakDeriv, weakDeriv), Wk,p(Ω)W^{k,p}(\Omega)Wk,p(Ω) (MemW), its norm (sobolevNorm, valued in ℝ≥0∞) and W0k,p(Ω)W^{k,p}_0(\Omega)W0k,p​(Ω) (MemW0) are defined in the mission; weakDeriv is a chosen representative and is only used under hypotheses guaranteeing existence. Exponents are p : ℝ≥0∞; conjugate exponents use ENNReal.HolderConjugate. Ck(Ω)C^k(\Omega)Ck(Ω) and C∞(Ω)C^\infty(\Omega)C∞(Ω) are ContDiffOn ℝ k and ContDiffOn ℝ ∞ on Ω\OmegaΩ (smooth, not analytic); "u∈C∞(Ω)u \in C^\infty(\Omega)u∈C∞(Ω)" for a Sobolev function means a.e. equality on Ω\OmegaΩ with such a function.

Conventions committed to:

  • The standing assumptions of §4.6 on the operator — aij∈L∞(Ω)a_{ij} \in L^\infty(\Omega)aij​∈L∞(Ω), aij=ajia_{ij} = a_{ji}aij​=aji​, uniform ellipticity — are explicit hypotheses of Theorems 4.27–4.29, and f∈L2(Ω)f \in L^2(\Omega)f∈L2(Ω) (the setting (4.34)) is a hypothesis of Corollary 4.29.
  • Theorem 4.27 assumes aij∈C1(Ω)a_{ij} \in C^1(\Omega)aij​∈C1(Ω) as printed, not C1(Ω‾)C^1(\overline{\Omega})C1(Ω).
  • Constants: ∃ C : ℝ is quantified after Ω\OmegaΩ, the coefficients, the ellipticity constant and Ω′\Omega'Ω′ (and kkk), and before fff and uuu.
  • dist⁡(Ω′,∂Ω)\operatorname{dist}(\Omega', \partial\Omega)dist(Ω′,∂Ω) in Theorem 4.53 is modelled by any d>0d > 0d>0 with B(x,d)⊆ΩB(x, d) \subseteq \OmegaB(x,d)⊆Ω for all x∈Ω′x \in \Omega'x∈Ω′; the largest such ddd is the book's distance (and +∞+\infty+∞ when Ω=Rn\Omega = \mathbb{R}^nΩ=Rn), so this is the book's condition and avoids Lean's convention that the distance to the empty set is 000.
  • Two corrections of the printed statements: Proposition 4.52 (2) is stated with Di−hvD_i^{-h}vDi−h​v on the right, as the book's proof derives; Theorem 4.53 (1) is stated componentwise, ∥Dihu∥Lp(Ω′)≤∥∂iu∥Lp(Ω)\|D_i^h u\|_{L^p(\Omega')} \le \|\partial_i u\|_{L^p(\Omega)}∥Dih​u∥Lp(Ω′)​≤∥∂i​u∥Lp(Ω)​, which is what its proof establishes and what the proof of Theorem 4.27 uses (the printed vector form with Euclidean lengths fails for large ppp, e.g. for u=max⁡(x1,x2)u = \max(x_1, x_2)u=max(x1​,x2​)).

The theorems are not trivialized by junk values: the difference quotient is only used at h≠0h \ne 0h=0, the weak formulation's Bochner integrals are integrable under the stated L∞L^\inftyL∞ and L2L^2L2 hypotheses, and the conclusion u∈H2(Ω′)u \in H^2(\Omega')u∈H2(Ω′) asserts existence of all weak derivatives of order at most two, not merely a bound on a norm that could be computed from junk representatives.

Contributions welcome: a library of weak derivatives and Sobolev spaces on open subsets of Rn\mathbb{R}^nRn compatible with these definitions, cut-off functions for Ω′⋐Ω\Omega' \Subset \OmegaΩ′⋐Ω (Mathlib's ContDiffBump and exists_smooth_tsupport_subset are natural starting points), and Banach–Alaoglu for LpL^pLp, 1<p<∞1 < p < \infty1<p<∞.

Selected references

  • J. K. Hunter, Notes on Partial Differential Equations, UC Davis lecture notes, revised 6/18/2014, §4.11 and Appendix 4.C. https://www.math.ucdavis.edu/~hunter/pdes/pde_notes.pdf
  • L. C. Evans, Partial Differential Equations, 2nd ed., Graduate Studies in Mathematics 19, American Mathematical Society, 2010, §5.8.2 and §6.3. https://doi.org/10.1090/gsm/019
  • D. Gilbarg and N. S. Trudinger, Elliptic Partial Differential Equations of Second Order, Classics in Mathematics, Springer, 2001, §7.11 and §8.3. https://doi.org/10.1007/978-3-642-61798-0
  • L. Nirenberg, Remarks on strongly elliptic partial differential equations, Communications on Pure and Applied Mathematics 8 (1955), 649–675. https://doi.org/10.1002/cpa.3160080414
12 thms4 active usersReviewed
🏆Completed
Dynamical SystemsFunctional AnalysisMathematical Physics·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems IV: Regular Sturm–Liouville ProblemsTextbook

Why regular Sturm–Liouville problems

Separation of variables reduces the heat equation, the wave equation and the Schrödinger equation on an interval to an eigenvalue problem for a second-order ordinary differential operator with boundary conditions at both ends. Whether the method works depends on one fact: the eigenfunctions of that operator must be complete, so that every reasonable initial profile can be expanded in them. Chapter 5 of Gerald Teschl's Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012) proves this for regular Sturm–Liouville problems. It does so without Lebesgue integration or Hilbert-space completeness: it works in the space of continuous functions with a weighted scalar product, and it develops the necessary spectral theory of compact symmetric operators from scratch.

A short history. Sturm and Liouville (1836–1837) studied the zeros and the eigenvalues of such equations and the expansion of functions in eigenfunctions. Hilbert and Schmidt (1904–1907) put the expansion on a rigorous footing through their theory of integral equations with symmetric kernels, from which the abstract spectral theorem for compact symmetric operators emerged.

Setting

Let a<ba < ba<b and let p,q,rp, q, rp,q,r be real functions on [a,b][a,b][a,b] with

r,q∈C([a,b],R),p∈C1([a,b],R),p(x)>0, r(x)>0  (x∈[a,b]).(5.45)r, q \in C([a,b], \mathbb{R}), \qquad p \in C^1([a,b], \mathbb{R}), \qquad p(x) > 0,\ r(x) > 0 \ \ (x \in [a,b]). \qquad (5.45)r,q∈C([a,b],R),p∈C1([a,b],R),p(x)>0, r(x)>0  (x∈[a,b]).(5.45)

These regularity assumptions hold throughout. The Sturm–Liouville operator is

Lf=1r(−(pf′)′+qf),L f = \frac{1}{r}\Bigl( -(p f')' + q f \Bigr),Lf=r1​(−(pf′)′+qf),

acting on the domain

D(L)={f∈C2([a,b],C):cos⁡(α)f(a)−sin⁡(α)p(a)f′(a)=0,  cos⁡(β)f(b)−sin⁡(β)p(b)f′(b)=0}D(L) = \{ f \in C^2([a,b], \mathbb{C}) : \cos(\alpha) f(a) - \sin(\alpha) p(a) f'(a) = 0,\ \ \cos(\beta) f(b) - \sin(\beta) p(b) f'(b) = 0 \}D(L)={f∈C2([a,b],C):cos(α)f(a)−sin(α)p(a)f′(a)=0,  cos(β)f(b)−sin(β)p(b)f′(b)=0}

for fixed real α,β\alpha, \betaα,β (the separated boundary conditions; α=0\alpha = 0α=0 is Dirichlet, α=π/2\alpha = \pi/2α=π/2 Neumann). The underlying space is H0=C([a,b],C)H_0 = C([a,b], \mathbb{C})H0​=C([a,b],C) with the weighted scalar product

⟨f,g⟩=∫abf(x)∗g(x) r(x) dx\langle f, g \rangle = \int_a^b f(x)^* g(x)\, r(x)\, dx⟨f,g⟩=∫ab​f(x)∗g(x)r(x)dx

and norm ∥f∥=⟨f,f⟩\|f\| = \sqrt{\langle f, f\rangle}∥f∥=⟨f,f⟩​. H0H_0H0​ is an inner product space but it is not complete. A number z∈Cz \in \mathbb{C}z∈C is an eigenvalue of LLL if Lf=zfL f = z fLf=zf for some f∈D(L)f \in D(L)f∈D(L) that does not vanish identically; fff is an eigenfunction. An orthonormal basis of H0H_0H0​ is an orthonormal sequence (un)(u_n)(un​) such that ∥f−∑n<N⟨un,f⟩un∥→0\|f - \sum_{n<N} \langle u_n, f\rangle u_n\| \to 0∥f−∑n<N​⟨un​,f⟩un​∥→0 for every f∈H0f \in H_0f∈H0​.

For the abstract part, H0H_0H0​ is any complex inner product space (again not assumed complete). A linear operator AAA on a dense subspace is symmetric if ⟨g,Af⟩=⟨Ag,f⟩\langle g, Af\rangle = \langle Ag, f\rangle⟨g,Af⟩=⟨Ag,f⟩; an everywhere defined AAA is compact if (Afn)(A f_n)(Afn​) has a convergent subsequence in H0H_0H0​ whenever (fn)(f_n)(fn​) is bounded.

For z∈Cz \in \mathbb{C}z∈C let ua(z,⋅)u_a(z,\cdot)ua​(z,⋅), ub(z,⋅)u_b(z,\cdot)ub​(z,⋅) solve Lu=zuL u = z uLu=zu with ua(z,a)=sin⁡αu_a(z,a) = \sin\alphaua​(z,a)=sinα, p(a)ua′(z,a)=cos⁡αp(a)u_a'(z,a) = \cos\alphap(a)ua′​(z,a)=cosα, ub(z,b)=sin⁡βu_b(z,b) = \sin\betaub​(z,b)=sinβ, p(b)ub′(z,b)=cos⁡βp(b)u_b'(z,b) = \cos\betap(b)ub′​(z,b)=cosβ. Their Wronskian is W(z)=ubpua′−pub′uaW(z) = u_b p u_a' - p u_b' u_aW(z)=ub​pua′​−pub′​ua​, which does not depend on the point where it is evaluated. When W(z)≠0W(z) \neq 0W(z)=0, the resolvent RL(z)R_L(z)RL​(z) is the integral operator with the Green function G(z,x,t)=W(z)−1ub(z,max⁡(x,t)) ua(z,min⁡(x,t))G(z,x,t) = W(z)^{-1} u_b(z,\max(x,t))\, u_a(z,\min(x,t))G(z,x,t)=W(z)−1ub​(z,max(x,t))ua​(z,min(x,t)) and weight rrr.

Formalization targets

Goal: eigenfunction expansion (Theorem 5.11)

There are real numbers EnE_nEn​ and real-valued eigenfunctions un∈D(L)u_n \in D(L)un​∈D(L), Lun=EnunL u_n = E_n u_nLun​=En​un​, such that:

  • the EnE_nEn​ are pairwise distinct and are all the eigenvalues of LLL, and every eigenfunction for EnE_nEn​ is a multiple of unu_nun​ (the eigenvalues are simple);
  • ∣En∣→∞|E_n| \to \infty∣En​∣→∞ (the eigenvalues accumulate only at ∞\infty∞);
  • ⟨um,un⟩=δmn\langle u_m, u_n \rangle = \delta_{mn}⟨um​,un​⟩=δmn​, and for every f∈H0f \in H_0f∈H0​
f=∑n=0∞⟨un,f⟩ unin H0,(5.70)f = \sum_{n=0}^{\infty} \langle u_n, f \rangle\, u_n \quad \text{in } H_0, \qquad (5.70)f=n=0∑∞​⟨un​,f⟩un​in H0​,(5.70)
  • for f∈D(L)f \in D(L)f∈D(L) the series (5.70) converges uniformly on [a,b][a,b][a,b].

Milestones

  1. Theorem 5.4. Eigenvalues of a symmetric operator are real, and eigenvectors for different eigenvalues are orthogonal.
  2. Theorem 5.5. A compact symmetric operator on a nonzero inner product space has an eigenvalue α0\alpha_0α0​ with ∣α0∣=∥A∥=sup⁡∥f∥=1∥Af∥|\alpha_0| = \|A\| = \sup_{\|f\|=1}\|Af\|∣α0​∣=∥A∥=sup∥f∥=1​∥Af∥.
  3. Theorem 5.6 (spectral theorem). A compact symmetric operator has real eigenvalues αj\alpha_jαj​ with orthonormal eigenvectors uju_juj​, infinitely many when H0H_0H0​ is infinite dimensional and then αj→0\alpha_j \to 0αj​→0, and f=∑j⟨uj,f⟩ujf = \sum_j \langle u_j, f\rangle u_jf=∑j​⟨uj​,f⟩uj​ for every f∈Ran⁡(A)f \in \operatorname{Ran}(A)f∈Ran(A); if Ran⁡(A)\operatorname{Ran}(A)Ran(A) is dense the uju_juj​ are an orthonormal basis.
  4. Lemma 5.9. W(z)W(z)W(z) is an entire function of zzz whose zeros are exactly the eigenvalues of LLL.
  5. Lemma 5.10. For W(z)≠0W(z) \ne 0W(z)=0, RL(z)R_L(z)RL​(z) is compact on H0H_0H0​, and symmetric for real zzz.
  6. Lemma 5.12 (Rayleigh–Ritz). The eigenvalues can be ordered E0<E1<⋯E_0 < E_1 < \cdotsE0​<E1​<⋯; E0=min⁡⟨f,Lf⟩=min⁡Q(f)E_0 = \min \langle f, Lf\rangle = \min Q(f)E0​=min⟨f,Lf⟩=minQ(f) over normalized f∈D(L)f \in D(L)f∈D(L), attained exactly at the eigenfunctions for E0E_0E0​; and min⁡[a,b]q≤E0\min_{[a,b]} q \le E_0min[a,b]​q≤E0​ when 0≤α≤π/2≤β≤π0 \le \alpha \le \pi/2 \le \beta \le \pi0≤α≤π/2≤β≤π. Here QQQ is the quadratic form ∫ab(p∣f′∣2+q∣f∣2) dx\int_a^b (p |f'|^2 + q |f|^2)\,dx∫ab​(p∣f′∣2+q∣f∣2)dx plus the boundary terms cot⁡(α)∣f(a)∣2−cot⁡(β)∣f(b)∣2\cot(\alpha)|f(a)|^2 - \cot(\beta)|f(b)|^2cot(α)∣f(a)∣2−cot(β)∣f(b)∣2 (dropped when the angle is 000).

Significance

Theorem 5.11 is the statement that makes eigenfunction expansions legitimate: Fourier sine and cosine series are its special case p=r=1p = r = 1p=r=1, q=0q = 0q=0, and it covers any positive weight and any smooth positive stiffness with separated boundary conditions. Solutions of the heat and wave equations on an interval with variable coefficients are built from it. The uniform convergence for f∈D(L)f \in D(L)f∈D(L) is the version needed to differentiate or evaluate such series pointwise. Lemma 5.12 provides the variational characterisation of the lowest eigenvalue, the starting point for comparison theorems and eigenvalue estimates.

On the formal side, Mathlib has the spectral theorem for self-adjoint operators on finite-dimensional spaces, compact operators on normed spaces, and L2L^2L2 spaces. It has no Sturm–Liouville theory, no Green functions for boundary value problems, and no spectral theorem for compact symmetric operators on incomplete inner product spaces. The platform has finite-dimensional Rayleigh-quotient results and compactness of L2L^2L2 convolution operators, but nothing on this setting. The results here are classical and proved; what is missing is a machine-checked proof in the book's elementary setting of continuous functions.

Difficulty

The operator LLL is unbounded on H0H_0H0​ (Problem 5.16), so the obvious first idea, applying a spectral theorem for compact or bounded symmetric operators to LLL itself, does not work. Completeness of the eigenfunctions is also subtle because H0H_0H0​ is not complete. Hilbert-space arguments that produce limits in a completion, or that go through L2L^2L2, do not by themselves give an expansion of a continuous function in continuous eigenfunctions with convergence in H0H_0H0​, still less uniform convergence. Simplicity of the eigenvalues depends on the separated boundary conditions and fails for periodic ones. On the formal side, one needs analytic dependence of solutions of a linear ODE on a complex parameter, one-sided derivatives at the endpoints, and interval integrals of piecewise-defined kernels.

Formalization scope

  • Spaces. The abstract results use a type with [NormedAddCommGroup E] [InnerProductSpace ℂ E] and no CompleteSpace. Symmetry on a dense domain is IsSymmetricOp; for everywhere defined operators it is Mathlib's LinearMap.IsSymmetric. Compactness is IsCompactOp: subsequences converge in H0H_0H0​ itself. H0=C([a,b],C)H_0 = C([a,b],\mathbb{C})H0​=C([a,b],C) is represented by functions R→C\mathbb{R} \to \mathbb{C}R→C continuous on Set.Icc a b, with SLInner the weighted scalar product (5.52) as an interval integral. It is not L2L^2L2 and not a HilbertBasis.
  • Operator and domain. SLOp, SLDomain, IsSLEigenfunction implement (5.53)–(5.55) with derivWithin on Set.Icc a b (one-sided at the endpoints) and ContDiffOn ℝ 2. RegularSL is (5.45), including a<ba < ba<b. α,β\alpha, \betaα,β are arbitrary reals.
  • Quantifier readings. "Countable, discrete, accumulating only at ∞\infty∞" is an injective sequence EnE_nEn​ exhausting the eigenvalues with ∣En∣→∞|E_n| \to \infty∣En​∣→∞. "Simple" is: every eigenfunction for EnE_nEn​ equals c unc\,u_ncun​ on [a,b][a,b][a,b]. "Can be chosen real-valued" is an existential choice of un:R→Ru_n : \mathbb{R} \to \mathbb{R}un​:R→R. ∥A∥\|A\|∥A∥ in Theorem 5.5 is expressed by IsLUB of {∥Af∥:∥f∥=1}\{\|Af\| : \|f\|=1\}{∥Af∥:∥f∥=1}, and Theorem 5.5 assumes H0≠{0}H_0 \neq \{0\}H0​={0}. In Theorem 5.6, N∈N0∪{∞}N \in \mathbb{N}_0 \cup \{\infty\}N∈N0​∪{∞} is ℕ∞: N=∞N = \inftyN=∞ in infinite dimension and N=dim⁡H0N = \dim H_0N=dimH0​ otherwise. The minima of Lemma 5.12 are IsLeast (attained), and "equality iff f=u0f = u_0f=u0​" reads as "iff fff is an eigenfunction for E0E_0E0​", i.e. f=c u0f = c\,u_0f=cu0​ with ∣c∣=1|c| = 1∣c∣=1. min⁡q≤E0\min q \le E_0minq≤E0​ is ∃x∈[a,b], q(x)≤E0\exists x \in [a,b],\ q(x) \le E_0∃x∈[a,b], q(x)≤E0​. Norm convergence is Re⁡⟨f−SN,f−SN⟩→0\operatorname{Re}\langle f - S_N, f - S_N\rangle \to 0Re⟨f−SN​,f−SN​⟩→0.
  • Ruling out trivial readings. The resolvent is only considered with W(z)≠0W(z) \ne 0W(z)=0 (Lean's 0−1=00^{-1} = 00−1=0 would make it the zero operator). Scalar products are only applied to functions continuous on [a,b][a,b][a,b], so no integral takes a junk value. Eigenfunctions must be nonzero on [a,b][a,b][a,b]. The expansion must hold in the weighted norm for every continuous fff, which an orthonormal family that is merely orthonormal would not satisfy.

A complete development needs linear ODEs with a complex parameter and their analytic dependence on it, Green functions, an Arzelà–Ascoli argument in C([a,b])C([a,b])C([a,b]), and the spectral theorem for compact symmetric operators on an inner product space. The definitions RegularSL, SLOp, SLDomain, SLInner and SLWronskian are reusable for the oscillation and comparison theory (Theorems 5.17–5.25) in the rest of the chapter. Contributions connecting IsCompactOp to Mathlib's IsCompactOperator on the completion are welcome.

Selected references

  • G. Teschl, Ordinary Differential Equations and Dynamical Systems, Graduate Studies in Mathematics 140, American Mathematical Society, 2012. Author's preliminary version: https://www.mat.univie.ac.at/~gerald/ftp/book-ode/ode.pdf ; published version: https://doi.org/10.1090/gsm/140
  • J. C. F. Sturm, Mémoire sur les équations différentielles linéaires du second ordre, Journal de Mathématiques Pures et Appliquées 1 (1836), 106–186. http://www.numdam.org/item/JMPA_1836_1_1__106_0/
  • J. Liouville, Mémoire sur le développement des fonctions ou parties de fonctions en séries dont les divers termes sont assujettis à satisfaire à une même équation différentielle du second ordre, Journal de Mathématiques Pures et Appliquées 1 (1836), 253–265. http://www.numdam.org/item/JMPA_1836_1_1__253_0/
  • E. Schmidt, Zur Theorie der linearen und nichtlinearen Integralgleichungen. I, Mathematische Annalen 63 (1907), 433–476. https://doi.org/10.1007/BF01449770
17 thms4 active usersReviewed
🏆Completed
Dynamical SystemsLinear algebra·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems II: Linear Systems and Floquet TheoryTextbook

Motivation

Linear systems of ordinary differential equations x˙=A(t)x\dot x = A(t)xx˙=A(t)x are the first case of the general theory in which solutions can be described structurally rather than merely shown to exist. They arise directly (circuits, mechanical vibrations, Hill's equation for the stability of periodic motions, the Mathieu equation for parametric resonance) and indirectly, as the linearization of a nonlinear system along an equilibrium or a periodic orbit. In the second role they decide stability: the linearized stability theorems of later chapters, the Poincaré map of a periodic orbit and the stable-manifold theory all reduce questions about nonlinear flows to questions about linear systems with constant or periodic coefficients.

For periodic coefficients the central structural result is due to Gaston Floquet (Sur les équations différentielles linéaires à coefficients périodiques, Annales scientifiques de l'École Normale Supérieure 12 (1883), 47–88, doi:10.24033/asens.220), preceded by G. W. Hill's 1877 work on the lunar perigee, which studied the same equation in the scalar second-order case. Liouville's formula for the Wronski determinant goes back to Abel (1829) and Liouville (1838). This mission follows Chapter 3 of G. Teschl, Ordinary Differential Equations and Dynamical Systems (AMS Graduate Studies in Mathematics 140, 2012), in the author's preliminary version.

Setting

Fix n∈Nn \in \mathbb{N}n∈N, an interval I⊆RI \subseteq \mathbb{R}I⊆R and a continuous matrix function A:I→Rn×nA : I \to \mathbb{R}^{n\times n}A:I→Rn×n. A solution of the linear first-order system

x˙(t)=A(t) x(t)(3.79)\dot x(t) = A(t)\,x(t) \qquad (3.79)x˙(t)=A(t)x(t)(3.79)

on III is a function xxx with values in Rn\mathbb{R}^nRn that at every t∈It \in It∈I has derivative A(t)x(t)A(t)x(t)A(t)x(t) (one-sided at an endpoint of III). In Lean this is TeschlODE.Linear.IsSolution A I x.

The principal matrix solution Π(t,t0)\Pi(t,t_0)Π(t,t0​) is, for each t0∈It_0 \in It0​∈I, the matrix function that solves the matrix initial value problem

ddtΠ(t,t0)=A(t) Π(t,t0),Π(t0,t0)=I.(3.83)\frac{d}{dt}\Pi(t,t_0) = A(t)\,\Pi(t,t_0), \qquad \Pi(t_0,t_0) = \mathbb{I}. \qquad (3.83)dtd​Π(t,t0​)=A(t)Π(t,t0​),Π(t0​,t0​)=I.(3.83)

Its columns are the solutions of (3.79) starting at the canonical basis vectors, and every solution is x(t)=Π(t,t0)x(t0)x(t) = \Pi(t,t_0)x(t_0)x(t)=Π(t,t0​)x(t0​). In Lean the property is TeschlODE.Linear.IsPrincipalMatrixSolution A I Φ (the Lean name of Π\PiΠ is Φ). The Wronski determinant of nnn solutions φ1,…,φn\varphi_1,\dots,\varphi_nφ1​,…,φn​ is W(t)=det⁡(φ1(t),…,φn(t))W(t) = \det(\varphi_1(t),\dots,\varphi_n(t))W(t)=det(φ1​(t),…,φn​(t)).

A system is periodic if I=RI = \mathbb{R}I=R and A(t+T)=A(t)A(t+T) = A(t)A(t+T)=A(t) for all ttt, for some T>0T > 0T>0 (3.117). Its monodromy matrix is M(t0)=Π(t0+T,t0)M(t_0) = \Pi(t_0+T, t_0)M(t0​)=Π(t0​+T,t0​) (3.119). A logarithm of a square matrix MMM is any matrix BBB with exp⁡(B)=M\exp(B) = Mexp(B)=M (3.200), where exp⁡\expexp is the matrix exponential.

Formalization targets

Goal: Floquet's theorem (Theorem 3.15)

Let A∈C(R,Rn×n)A \in C(\mathbb{R}, \mathbb{R}^{n\times n})A∈C(R,Rn×n) be TTT-periodic with T>0T > 0T>0 and Π\PiΠ its principal matrix solution. For every t0∈Rt_0 \in \mathbb{R}t0​∈R there exist Q(t0)∈Cn×nQ(t_0) \in \mathbb{C}^{n\times n}Q(t0​)∈Cn×n and P(⋅,t0):R→Cn×nP(\cdot,t_0) : \mathbb{R} \to \mathbb{C}^{n\times n}P(⋅,t0​):R→Cn×n with

Π(t,t0)=P(t,t0) exp⁡((t−t0) Q(t0)),P(t+T,t0)=P(t,t0),P(t0,t0)=I.\Pi(t,t_0) = P(t,t_0)\,\exp\big((t-t_0)\,Q(t_0)\big), \qquad P(t+T,t_0) = P(t,t_0), \qquad P(t_0,t_0) = \mathbb{I}.Π(t,t0​)=P(t,t0​)exp((t−t0​)Q(t0​)),P(t+T,t0​)=P(t,t0​),P(t0​,t0​)=I.

Milestones

In attack order:

  1. Theorem 3.9 — for continuous AAA on an interval III the initial value problem x˙=A(t)x\dot x = A(t)xx˙=A(t)x, x(t0)=x0x(t_0) = x_0x(t0​)=x0​ has a unique solution, defined on all of III.
  2. Theorem 3.10 — the solutions form an nnn-dimensional vector space, and a principal matrix solution exists with x(t)=Π(t,t0)x0x(t) = \Pi(t,t_0)x_0x(t)=Π(t,t0​)x0​.
  3. Lemma 3.14 — for TTT-periodic AAA, Π(t+T,t0+T)=Π(t,t0)\Pi(t+T, t_0+T) = \Pi(t,t_0)Π(t+T,t0​+T)=Π(t,t0​).
  4. Lemma 3.11 (Liouville's formula) — W(t)=W(t0)exp⁡(∫t0ttr⁡A(s) ds)W(t) = W(t_0)\exp\big(\int_{t_0}^t \operatorname{tr} A(s)\,ds\big)W(t)=W(t0​)exp(∫t0​t​trA(s)ds).
  5. Lemma 3.34 — a complex matrix has a logarithm iff its determinant is nonzero; a real matrix whose real eigenvalues are all positive has a real logarithm; the square of an invertible real matrix has a real logarithm.
  6. Theorem 3.12 (variation of constants) — the solution of x˙=A(t)x+g(t)\dot x = A(t)x + g(t)x˙=A(t)x+g(t), x(t0)=x0x(t_0) = x_0x(t0​)=x0​, is x(t)=Π(t,t0)x0+∫t0tΠ(t,s)g(s) dsx(t) = \Pi(t,t_0)x_0 + \int_{t_0}^t \Pi(t,s)g(s)\,dsx(t)=Π(t,t0​)x0​+∫t0​t​Π(t,s)g(s)ds.

Milestone 6 is not needed for the goal; it completes the linear theory of Section 3.4 on the same definitions and is the input to the perturbation results of Section 3.7.

Significance

Floquet's theorem reduces a periodic linear system to one with constant coefficients by a periodic change of variables. Its consequences in the book are the real version with doubled period (Corollary 3.16), the stability criterion in terms of Floquet multipliers (the eigenvalues of M(t0)M(t_0)M(t0​), Corollary 3.17), the reduction y=P−1xy = P^{-1}xy=P−1x to y˙=Qy\dot y = Q yy˙​=Qy (Corollary 3.18), and the stability analysis of Hill's equation. Later in the book, the stability of a periodic orbit of a nonlinear system is read off from the Floquet multipliers of its linearization, via the Poincaré map.

All results of this mission have been proved for more than a century. What the mission adds is a machine-checked development: Mathlib has the matrix exponential (NormedSpace.exp, with Matrix.exp_add_of_commute), Picard–Lindelöf and Gronwall-type uniqueness for ODEs, but no principal matrix solution, no Liouville formula, no matrix logarithm and no Floquet theory. The two platform nodes named after Floquet's and Liouville's theorems are retired placeholders whose statement is True; no faithful formalization exists on the platform.

Difficulty

The obvious guess for the solution, exp⁡(∫t0tA(s) ds)x0\exp\big(\int_{t_0}^t A(s)\,ds\big)x_0exp(∫t0​t​A(s)ds)x0​, is wrong as soon as the values A(t)A(t)A(t) do not commute, so neither Floquet's theorem nor the variation-of-constants formula can be obtained from the constant-coefficient theory by substitution. Floquet's theorem as stated is equivalent to the existence of a logarithm of the monodromy matrix: once M(t0)=exp⁡(TQ)M(t_0) = \exp(TQ)M(t0​)=exp(TQ) is available, the periodicity of PPP follows from Lemma 3.14. The existence of a matrix logarithm for every invertible complex matrix is the main missing piece of infrastructure; the logarithm is not unique and not continuous in the matrix, and a real invertible matrix need not have a real logarithm (a negative eigenvalue with a single Jordan block prevents it), which is why Q(t0)Q(t_0)Q(t0​) is complex. Liouville's formula, which gives det⁡M(t0)=exp⁡(∫0Ttr⁡A)≠0\det M(t_0) = \exp\big(\int_0^T \operatorname{tr} A\big) \neq 0detM(t0​)=exp(∫0T​trA)=0, needs the derivative of a determinant along a matrix solution.

Formalization scope

  • Vectors are Fin n → ℝ, matrices Matrix (Fin n) (Fin n) ℝ; A(t)xA(t)xA(t)x is Matrix.mulVec. The goal and Lemma 3.34 use Matrix (Fin n) (Fin n) ℂ for PPP, QQQ and the complex logarithm; Π(t,t0)\Pi(t,t_0)Π(t,t0​) is compared with Pexp⁡(⋅)P\exp(\cdot)Pexp(⋅) after coercing its entries to C\mathbb{C}C.
  • An interval is a set III with Set.OrdConnected I; continuity is ContinuousOn A I. Derivatives are HasDerivWithinAt … I t at every t∈It \in It∈I (one-sided at endpoints in III); the matrix derivative in (3.83) is taken entrywise. In Section 3.6 (Lemma 3.14 and the goal) I=RI = \mathbb{R}I=R and AAA is Continuous.
  • The principal matrix solution enters as a hypothesis IsPrincipalMatrixSolution A Set.univ Φ. Theorem 3.10 shows such a Φ\PhiΦ exists and Theorem 3.9 shows it is unique on I×II\times II×I, so this hypothesis names the principal matrix solution, not an arbitrary function.
  • Periodicity is 0 < T and ∀ t, A (t + T) = A t. The periodicity of PPP is required with the same TTT and for all ttt, together with P(t0,t0)=IP(t_0,t_0) = \mathbb{I}P(t0​,t0​)=I. Without the periodicity of PPP the goal would be trivial (Q=0Q = 0Q=0, P=ΠP = \PiP=Π); with it, the goal carries the full content of the theorem.
  • The matrix exponential is Mathlib's NormedSpace.exp. "Logarithm" means any BBB with NormedSpace.exp B = M; no branch is fixed. In the third claim of Lemma 3.34 the hypothesis det⁡A≠0\det A \ne 0detA=0 is explicit: the book states it in the paragraph containing the lemma, and without it the claim fails at A=0A = 0A=0.
  • "The solutions form an nnn-dimensional vector space" is expressed through restrictions to III: closure under linear combinations, nnn solutions linearly independent on III, and every solution a combination of them on III.
  • Needed infrastructure, reusable beyond this mission: existence and uniqueness for linear systems on arbitrary intervals, the principal matrix solution and its cocycle property Π(t,t1)Π(t1,t0)=Π(t,t0)\Pi(t,t_1)\Pi(t_1,t_0) = \Pi(t,t_0)Π(t,t1​)Π(t1​,t0​)=Π(t,t0​), the derivative of det⁡\detdet along a matrix solution, and the matrix logarithm (via the Jordan form or via the holomorphic functional calculus). Contributions of any of these as standalone lemmas are welcome.

Selected references

  • G. Teschl, Ordinary Differential Equations and Dynamical Systems, Graduate Studies in Mathematics 140, American Mathematical Society, 2012; author's preliminary version, Chapter 3. https://www.mat.univie.ac.at/~gerald/ftp/book-ode/ode.pdf (published version: doi:10.1090/gsm/140).
  • G. Floquet, Sur les équations différentielles linéaires à coefficients périodiques, Annales scientifiques de l'École Normale Supérieure 12 (1883), 47–88. doi:10.24033/asens.220
  • W. J. Culver, On the existence and uniqueness of the real logarithm of a matrix, Proceedings of the AMS 17 (1966), 1146–1151. doi:10.1090/S0002-9939-1966-0202740-6
9 thms4 active usersReviewed
🏆Completed
Functional AnalysisHarmonic AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics III: The Herglotz Representation and Stieltjes InversionTextbook

Motivation

In spectral theory the resolvent of a self-adjoint operator AAA is studied through scalar functions Fψ(z)=⟨ψ,(A−z)−1ψ⟩F_\psi(z) = \langle \psi, (A - z)^{-1}\psi\rangleFψ​(z)=⟨ψ,(A−z)−1ψ⟩, defined for non-real zzz. Each FψF_\psiFψ​ is holomorphic on the upper half plane and maps it into itself. The spectral theorem, in the form presented in G. Teschl's Mathematical Methods in Quantum Mechanics (AMS Graduate Studies in Mathematics 99, 2009), comes down to the converse: a function of this kind with the right growth is the Cauchy–Stieltjes transform of a finite measure on R\mathbb{R}R, and that measure is the spectral measure of ψ\psiψ. In the other direction, the absolutely continuous, singularly continuous and pure point spectra of Schrödinger operators are identified by looking at the boundary values of FψF_\psiFψ​ on the real axis. This mission formalizes the appendix to Chapter 3 of Teschl's book (Section 3.4, The Herglotz theorem, pp. 106–110) and Theorem 3.10, the measure-theoretic layer that the rest of the book's spectral analysis stands on.

The representation goes back to G. Herglotz (1911) for the disc and R. Nevanlinna (1922) for the half plane. The inversion formula is due to T. J. Stieltjes (1894). The link between boundary values and the Lebesgue decomposition of the measure is classical harmonic analysis on the half plane (Fatou, de la Vallée Poussin) and is the tool behind the spectral-type results of Gilbert–Pearson subordinacy theory and Aronszajn–Donoghue rank-one perturbation theory.

Setting

Write C+={z∈C∣Im⁡(z)>0}\mathbb{C}_+ = \{z \in \mathbb{C} \mid \operatorname{Im}(z) > 0\}C+​={z∈C∣Im(z)>0}. A Herglotz function is a holomorphic map FFF on C+\mathbb{C}_+C+​ with Im⁡F(z)>0\operatorname{Im} F(z) > 0ImF(z)>0 for every z∈C+z \in \mathbb{C}_+z∈C+​ (IsHerglotz).

For a Borel measure μ\muμ on R\mathbb{R}R, its Borel transform is

F(z)=∫Rdμ(λ)λ−zF(z) = \int_{\mathbb{R}} \frac{d\mu(\lambda)}{\lambda - z}F(z)=∫R​λ−zdμ(λ)​

(borelTransform μ). The spectrum of μ\muμ is its set of growth points, σ(μ)={λ∣μ((λ−ε,λ+ε))>0 for all ε>0}\sigma(\mu) = \{\lambda \mid \mu((\lambda-\varepsilon,\lambda+\varepsilon)) > 0 \text{ for all } \varepsilon > 0\}σ(μ)={λ∣μ((λ−ε,λ+ε))>0 for all ε>0} (measureSpectrum).

With Bε(x)=(x−ε,x+ε)B_\varepsilon(x) = (x - \varepsilon, x + \varepsilon)Bε​(x)=(x−ε,x+ε) and ∣⋅∣|\cdot|∣⋅∣ Lebesgue measure, the upper and lower derivatives of μ\muμ are (D‾μ)(x)=lim sup⁡ε↓0μ(Bε(x))/∣Bε(x)∣(\overline{D}\mu)(x) = \limsup_{\varepsilon\downarrow0} \mu(B_\varepsilon(x))/|B_\varepsilon(x)|(Dμ)(x)=limsupε↓0​μ(Bε​(x))/∣Bε​(x)∣ and (D‾μ)(x)=lim inf⁡ε↓0μ(Bε(x))/∣Bε(x)∣(\underline{D}\mu)(x) = \liminf_{\varepsilon\downarrow0} \mu(B_\varepsilon(x))/|B_\varepsilon(x)|(D​μ)(x)=liminfε↓0​μ(Bε​(x))/∣Bε​(x)∣, values in [0,∞][0,\infty][0,∞] (upperDeriv, lowerDeriv). The derivative (Dμ)(x)(D\mu)(x)(Dμ)(x) is the limit when it exists, possibly ∞\infty∞ (HasMeasureDeriv μ x d).

A set AAA is a support of μ\muμ if μ(R∖A)=0\mu(\mathbb{R}\setminus A) = 0μ(R∖A)=0 (IsSupport). A support MMM is a minimal support if every Borel M0⊆MM_0 \subseteq MM0​⊆M with μ(M0)=0\mu(M_0) = 0μ(M0​)=0 is Lebesgue-null (IsMinimalSupport). The Lebesgue decomposition dμ=dμac+dμsd\mu = d\mu_{ac} + d\mu_sdμ=dμac​+dμs​ with respect to Lebesgue measure refines to dμs=dμsc+dμppd\mu_s = d\mu_{sc} + d\mu_{pp}dμs​=dμsc​+dμpp​, where μpp\mu_{pp}μpp​ lives on the atoms of μ\muμ. The absolutely continuous part μac\mu_{ac}μac​ and the singularly continuous part μsc\mu_{sc}μsc​ are acPart μ and scPart μ.

Formalization targets

Goal: Herglotz representation (Theorem 3.20)

If FFF is a Herglotz function and ∣F(z)∣≤M/Im⁡(z)|F(z)| \le M/\operatorname{Im}(z)∣F(z)∣≤M/Im(z) for all z∈C+z \in \mathbb{C}_+z∈C+​, then there is a Borel measure μ\muμ on R\mathbb{R}R with μ(R)≤M\mu(\mathbb{R}) \le Mμ(R)≤M and

F(z)=∫Rdμ(λ)λ−z,z∈C+.F(z) = \int_{\mathbb{R}} \frac{d\mu(\lambda)}{\lambda - z}, \qquad z \in \mathbb{C}_+ .F(z)=∫R​λ−zdμ(λ)​,z∈C+​.

Milestones

  1. Theorem 3.10. For a finite Borel measure μ\muμ, the transform is holomorphic on C∖σ(μ)\mathbb{C}\setminus\sigma(\mu)C∖σ(μ), is a Herglotz function when μ≠0\mu \ne 0μ=0, and satisfies F(z∗)=F(z)∗F(z^*) = F(z)^*F(z∗)=F(z)∗ and ∣F(z)∣≤μ(R)/Im⁡(z)|F(z)| \le \mu(\mathbb{R})/\operatorname{Im}(z)∣F(z)∣≤μ(R)/Im(z) on C+\mathbb{C}_+C+​.
  2. Theorem 3.21. μ\muμ is determined by its transform on C+\mathbb{C}_+C+​, and for λ1<λ2\lambda_1 < \lambda_2λ1​<λ2​
12(μ((λ1,λ2))+μ([λ1,λ2]))=lim⁡ε↓01π∫λ1λ2Im⁡F(λ+iε) dλ.\tfrac12\bigl(\mu((\lambda_1,\lambda_2)) + \mu([\lambda_1,\lambda_2])\bigr) = \lim_{\varepsilon\downarrow0}\frac1\pi\int_{\lambda_1}^{\lambda_2}\operatorname{Im}F(\lambda+i\varepsilon)\,d\lambda .21​(μ((λ1​,λ2​))+μ([λ1​,λ2​]))=ε↓0lim​π1​∫λ1​λ2​​ImF(λ+iε)dλ.
  1. Theorem 3.22. For every λ\lambdaλ, (D‾μ)(λ)≤lim inf⁡ε↓01πIm⁡F(λ+iε)≤lim sup⁡ε↓01πIm⁡F(λ+iε)≤(D‾μ)(λ)(\underline D\mu)(\lambda) \le \liminf_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon) \le \limsup_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon) \le (\overline D\mu)(\lambda)(D​μ)(λ)≤liminfε↓0​π1​ImF(λ+iε)≤limsupε↓0​π1​ImF(λ+iε)≤(Dμ)(λ).
  2. Theorem 3.23. lim⁡ε↓01πIm⁡F(λ+iε)\lim_{\varepsilon\downarrow0}\frac1\pi\operatorname{Im}F(\lambda+i\varepsilon)limε↓0​π1​ImF(λ+iε) exists in [0,∞][0,\infty][0,∞] for μ\muμ-a.e. and Lebesgue-a.e. λ\lambdaλ, equals (Dμ)(λ)(D\mu)(\lambda)(Dμ)(λ) wherever the latter exists; the set where it is ∞\infty∞ supports μsc\mu_{sc}μsc​, and the set where it lies in (0,∞)(0,\infty)(0,∞) is a minimal support of μac\mu_{ac}μac​.
  3. Corollary 3.24. If lim sup⁡ε↓0Im⁡F(λ+iε)<∞\limsup_{\varepsilon\downarrow0}\operatorname{Im}F(\lambda+i\varepsilon) < \inftylimsupε↓0​ImF(λ+iε)<∞ for all λ\lambdaλ in a Borel set III, then μ∣I\mu|_Iμ∣I​ is absolutely continuous.
  4. Corollary 3.25. lim⁡ε↓0F(λ+iε)\lim_{\varepsilon\downarrow0}F(\lambda+i\varepsilon)limε↓0​F(λ+iε) exists (finite or ∞\infty∞) μ\muμ-a.e. and Lebesgue-a.e., and is finite Lebesgue-a.e.

Significance

Theorem 3.20 together with Theorem 3.10 is a bijection between finite Borel measures on R\mathbb{R}R and Herglotz functions of bounded growth Im⁡(z)∣F(z)∣\operatorname{Im}(z)|F(z)|Im(z)∣F(z)∣. In Teschl's development it produces the spectral measures μψ\mu_\psiμψ​ from the resolvent, and hence the projection-valued measure of an unbounded self-adjoint operator. Theorems 3.21–3.25 turn spectral questions into boundary-value questions. The later chapters on Sturm–Liouville operators and one-dimensional Schrödinger operators decide which spectral type an operator has by reading Im⁡F(λ+i0)\operatorname{Im} F(\lambda + i0)ImF(λ+i0) for the Weyl–Titchmarsh function.

These are textbook results with complete published proofs. Mathlib has the upper half plane as a type, Lebesgue decomposition, Radon–Nikodym derivatives and Vitali-family differentiation of measures, but it has no Borel (Cauchy–Stieltjes) transform of a measure on R\mathbb{R}R, no Herglotz representation on the half plane, and no Stieltjes inversion. The remaining work is to formalize the known proofs against Mathlib's measure theory and complex analysis. No machine-checked version of these statements is known to exist on Prove2Me.

Difficulty

For the goal, the measure has to be built: nothing in the hypothesis names it. A Herglotz function gives no measure directly, only a family of absolutely continuous approximations coming from the boundary values of Im⁡F\operatorname{Im} FImF slightly above the real axis. The difficulty is to pass to a limit that is only a measure (it may have atoms and singular parts), and to identify the limit's transform with FFF itself, not just its imaginary part. The uniform bound is what makes the limit exist and keeps its mass at most MMM. Without it the general Nevanlinna representation carries an extra linear term and a non-finite measure, and the statement here fails.

For the boundary-value theorems, the pointwise behaviour of the Poisson integral has to be compared with the symmetric derivatives of μ\muμ at each point, including points where μ\muμ is singular. The almost-everywhere statements for both μ\muμ and Lebesgue measure need the differentiation theory of measures in its singular form: the derivative is infinite μs\mu_sμs​-almost everywhere, not only finite Lebesgue-almost everywhere.

Formalization scope

Measures are MeasureTheory.Measure ℝ on the Borel σ-algebra. Every theorem assumes IsFiniteMeasure μ, except the goal, whose conclusion μ Set.univ ≤ ENNReal.ofReal M makes μ finite. Functions on the half plane are ℂ → ℂ, constrained only on {z | 0 < z.im}. The Borel transform is a Bochner integral. Every claim evaluates it where the integrand is bounded, so Mathlib's convention that a non-integrable integral is 000 never enters.

Limits as ε↓0\varepsilon \downarrow 0ε↓0 are taken along 𝓝[>] 0. The quantities that may be infinite (derivatives of measures, boundary values of Im⁡F\operatorname{Im}FImF) live in ℝ≥0∞, with Im⁡F(λ+iε)\operatorname{Im}F(\lambda+i\varepsilon)ImF(λ+iε), which is nonnegative for ε>0\varepsilon > 0ε>0, embedded by ENNReal.ofReal. An infinite limit of FFF itself is Tendsto … (Bornology.cobounded ℂ). The lower and upper derivatives, the supports and the parts μac\mu_{ac}μac​, μsc\mu_{sc}μsc​ are defined in the mission's namespace exactly as in the book (Sec. A.8, Sec. 3.2).

Three readings of the printed text are fixed. Theorem 3.22 is stated for Im⁡F(λ+iε)\operatorname{Im}F(\lambda+i\varepsilon)ImF(λ+iε), which is what its proof estimates. Theorem 3.23's identity takes the factor 1/π1/\pi1/π once, consistent with Theorem 3.22. Theorem 3.10's Herglotz conclusion is stated for μ≠0\mu \ne 0μ=0: the book's Herglotz functions map into the open half plane, and the zero measure's transform is identically zero.

A Herglotz function is defined analytically (holomorphic, positive imaginary part), never as "a Borel transform"; the latter would make the goal a tautology. No object is taken as data. The chunk uses no Hilbert space, no operator, and no projection-valued measure.

Useful infrastructure: UpperHalfPlane, Cauchy's integral formula on rectangles and semicircles, weak compactness of finite measures on R\mathbb{R}R (Helly/Prokhorov), Mathlib's VitaliFamily.ae_tendsto_rnDeriv and Measure.singularPart. A reusable Poisson-kernel library for the half plane would be a welcome by-product, as would the vague-convergence lemmas of the book's Appendix A.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, Graduate Studies in Mathematics 99, American Mathematical Society, 2009, Sec. 3.2, Sec. 3.4 and Sec. A.8. https://doi.org/10.1090/gsm/099
  • G. Herglotz, Über Potenzreihen mit positivem, reellen Teil im Einheitskreis, Berichte über die Verhandlungen der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, Math.-Phys. Klasse 63 (1911), 501–511.
  • R. Nevanlinna, Asymptotische Entwicklungen beschränkter Funktionen und das Stieltjessche Momentenproblem, Annales Academiae Scientiarum Fennicae A 18 (1922).
  • T. J. Stieltjes, Recherches sur les fractions continues, Annales de la Faculté des Sciences de Toulouse 8 (1894), J1–J122. https://doi.org/10.5802/afst.108
  • F. Gesztesy, E. Tsekanovskii, On matrix-valued Herglotz functions, Mathematische Nachrichten 218 (2000), 61–138. https://doi.org/10.1002/1522-2616(200010)218:1<61::AID-MANA61>3.0.CO;2-D
28 thms4 active usersReviewed
🏆Completed
Functional AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics I: Self-Adjoint Extensions and Defect IndicesTextbook

Why self-adjoint extensions matter

In quantum mechanics an observable is a self-adjoint operator on a complex Hilbert space H\mathfrak{H}H. Physics, however, usually hands over a symmetric operator: a differential expression such as −i ddx-\mathrm{i}\,\tfrac{d}{dx}−idxd​ or −Δ+V-\Delta + V−Δ+V on a convenient domain of smooth functions, on which integration by parts shows ⟨φ,Aψ⟩=⟨Aφ,ψ⟩\langle \varphi, A\psi\rangle = \langle A\varphi, \psi\rangle⟨φ,Aψ⟩=⟨Aφ,ψ⟩. Symmetry is easy to check and self-adjointness is not. Two questions then decide whether the formal expression defines a physical theory: does AAA have a self-adjoint extension at all, and if so, how many? Different extensions correspond to different boundary conditions and to different dynamics (via Stone's theorem), so the answer is physically meaningful.

John von Neumann answered both questions in 1929–1930 with the Cayley transform and the defect indices (von Neumann 1930). His criterion is the goal of this mission, in the form given in Chapter 2 of G. Teschl, Mathematical Methods in Quantum Mechanics (AMS Graduate Studies in Mathematics 99, 2009), from which every statement of the mission is taken.

Setting

Let H\mathfrak{H}H be a complex Hilbert space with inner product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩, conjugate-linear in the first argument. A linear operator AAA is a linear map A:D(A)→HA : \mathfrak{D}(A) \to \mathfrak{H}A:D(A)→H defined on a linear subspace D(A)\mathfrak{D}(A)D(A), its domain. An operator BBB extends AAA, written A⊆BA \subseteq BA⊆B, if D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and Bψ=AψB\psi = A\psiBψ=Aψ for ψ∈D(A)\psi \in \mathfrak{D}(A)ψ∈D(A).

AAA is symmetric if D(A)\mathfrak{D}(A)D(A) is dense and ⟨φ,Aψ⟩=⟨Aφ,ψ⟩\langle \varphi, A\psi\rangle = \langle A\varphi, \psi\rangle⟨φ,Aψ⟩=⟨Aφ,ψ⟩ for all φ,ψ∈D(A)\varphi, \psi \in \mathfrak{D}(A)φ,ψ∈D(A). For densely defined AAA the adjoint A∗A^*A∗ has domain {ψ∣∃ψ~:⟨ψ,Aφ⟩=⟨ψ~,φ⟩ ∀φ∈D(A)}\{\psi \mid \exists \tilde\psi : \langle\psi, A\varphi\rangle = \langle\tilde\psi, \varphi\rangle \ \forall \varphi \in \mathfrak{D}(A)\}{ψ∣∃ψ~​:⟨ψ,Aφ⟩=⟨ψ~​,φ⟩ ∀φ∈D(A)} and acts by A∗ψ=ψ~A^*\psi = \tilde\psiA∗ψ=ψ~​. AAA is self-adjoint if A=A∗A = A^*A=A∗, domains included, and essentially self-adjoint if its closure A‾\overline{A}A (the operator whose graph is the closure of the graph of AAA) is self-adjoint.

For z∈Cz \in \mathbb{C}z∈C, A+zA + zA+z is the operator ψ↦Aψ+zψ\psi \mapsto A\psi + z\psiψ↦Aψ+zψ on D(A)\mathfrak{D}(A)D(A). The resolvent set ρ(A)\rho(A)ρ(A) is the set of zzz for which A−z:D(A)→HA - z : \mathfrak{D}(A) \to \mathfrak{H}A−z:D(A)→H is a bijection with bounded inverse RA(z)=(A−z)−1R_A(z) = (A-z)^{-1}RA​(z)=(A−z)−1, and the spectrum is σ(A)=C∖ρ(A)\sigma(A) = \mathbb{C}\setminus\rho(A)σ(A)=C∖ρ(A).

For symmetric AAA the defect spaces and defect indices are

K±=Ran⁡(A±i)⊥=Ker⁡(A∗∓i),d±(A)=dim⁡K±,K_\pm = \operatorname{Ran}(A \pm \mathrm{i})^\perp = \operatorname{Ker}(A^* \mp \mathrm{i}), \qquad d_\pm(A) = \dim K_\pm,K±​=Ran(A±i)⊥=Ker(A∗∓i),d±​(A)=dimK±​,

where dim⁡\dimdim is the Hilbert dimension (the cardinality of an orthonormal basis, possibly infinite). The Cayley transform of AAA is

V=(A−i)(A+i)−1:Ran⁡(A+i)→Ran⁡(A−i).V = (A - \mathrm{i})(A + \mathrm{i})^{-1} : \operatorname{Ran}(A + \mathrm{i}) \to \operatorname{Ran}(A - \mathrm{i}).V=(A−i)(A+i)−1:Ran(A+i)→Ran(A−i).

Formalization targets

Goal: von Neumann's criterion (Theorem 2.26)

For every symmetric operator AAA,

∃ B⊇A self-adjoint  ⟺  d+(A)=d−(A).\exists\, B \supseteq A \text{ self-adjoint} \iff d_+(A) = d_-(A).∃B⊇A self-adjoint⟺d+​(A)=d−​(A).

Milestones

In the order of the book:

  • Corollary 2.2. A self-adjoint operator has no proper symmetric extension.
  • Lemma 2.3. If AAA is symmetric and Ran⁡(A+z)=Ran⁡(A+z∗)=H\operatorname{Ran}(A + z) = \operatorname{Ran}(A + z^*) = \mathfrak{H}Ran(A+z)=Ran(A+z∗)=H for one z∈Cz \in \mathbb{C}z∈C, then AAA is self-adjoint.
  • Lemma 2.7. A symmetric AAA is essentially self-adjoint iff Ran⁡(A+z)‾=Ran⁡(A+z∗)‾=H\overline{\operatorname{Ran}(A+z)} = \overline{\operatorname{Ran}(A+z^*)} = \mathfrak{H}Ran(A+z)​=Ran(A+z∗)​=H for one z∈C∖Rz \in \mathbb{C}\setminus\mathbb{R}z∈C∖R, iff Ker⁡(A∗+z)=Ker⁡(A∗+z∗)={0}\operatorname{Ker}(A^*+z) = \operatorname{Ker}(A^*+z^*) = \{0\}Ker(A∗+z)=Ker(A∗+z∗)={0} for one such zzz; for nonnegative AAA, a real z>0z > 0z>0 (spectral point −z<0-z < 0−z<0) may be used too.
  • Theorem 2.18. A symmetric AAA is self-adjoint iff σ(A)⊆R\sigma(A) \subseteq \mathbb{R}σ(A)⊆R; it is self-adjoint with A≥EA \ge EA≥E iff σ(A)⊆[E,∞)\sigma(A) \subseteq [E,\infty)σ(A)⊆[E,∞); and then ∥RA(z)∥≤∣Im⁡z∣−1\|R_A(z)\| \le |\operatorname{Im} z|^{-1}∥RA​(z)∥≤∣Imz∣−1 and ∥RA(λ)∥≤∣λ−E∣−1\|R_A(\lambda)\| \le |\lambda - E|^{-1}∥RA​(λ)∥≤∣λ−E∣−1 for λ<E\lambda < Eλ<E.
  • Theorem 2.25. The Cayley transform is a bijection from the symmetric operators onto the isometric operators VVV with Ran⁡(1−V)\operatorname{Ran}(1 - V)Ran(1−V) dense.
  • Theorem 2.26, (2.103)–(2.104). For a closed symmetric AAA with a self-adjoint extension A1A_1A1​ whose Cayley transform is V1V_1V1​: D(A1)=D(A)+(1−V1)K+\mathfrak{D}(A_1) = \mathfrak{D}(A) + (1 - V_1)K_+D(A1​)=D(A)+(1−V1​)K+​ and A1(ψ+φ+−V1φ+)=Aψ+iφ++iV1φ+A_1(\psi + \varphi_+ - V_1\varphi_+) = A\psi + \mathrm{i}\varphi_+ + \mathrm{i}V_1\varphi_+A1​(ψ+φ+​−V1​φ+​)=Aψ+iφ+​+iV1​φ+​.
  • Lemma 2.27. AAA is closed iff D(V)\mathfrak{D}(V)D(V) is closed iff Ran⁡(V)\operatorname{Ran}(V)Ran(V) is closed iff VVV is closed.
  • Theorem 2.28. If a symmetric AAA commutes with a conjugation CCC (CCC-real), then d+(A)=d−(A)d_+(A) = d_-(A)d+​(A)=d−​(A).

Significance

The criterion is the standard tool for deciding whether a formal Hamiltonian is a legitimate observable, and for classifying its realizations: by the parametrization (2.103)–(2.104), the self-adjoint extensions correspond to the unitary maps K+→K−K_+ \to K_-K+​→K−​. Theorem 2.28 turns the criterion into a practical test, since every real differential operator, for example a Schrödinger operator with real potential, is CCC-real for complex conjugation and therefore has self-adjoint extensions. Lemma 2.7 and Theorem 2.18 are the everyday criteria for self-adjointness and the basic spectral facts on which Chapters 3–6 of the book rest. The Friedrichs extension, Weyl's limit point/limit circle theory and the Kato–Rellich theorem all refine these statements.

All of these results are classical and proved in every text on unbounded operators (for example Schmüdgen 2012, Chapters 3 and 13). None is formalized in Mathlib, which provides the adjoint, closure and self-adjointness of a LinearPMap but no resolvent set, spectrum, Cayley transform or defect theory for unbounded operators. The platform's existing material on essential self-adjointness is stated for specific Hamiltonians on bespoke structures, not for general operators. A formal proof here supplies the unbounded-operator layer that every later mission in this series (spectral theorem, Kato–Rellich, Weyl's theorem, Sturm–Liouville theory) restates.

Difficulty

The obvious reduction, "a self-adjoint extension is a unitary extension of the Cayley transform, and a unitary K+→K−K_+ \to K_-K+​→K−​ exists iff the dimensions agree", hides most of the work. The correspondence between extensions of AAA and extensions of VVV runs through the inverse Cayley transform A=i(1+V)(1−V)−1A = \mathrm{i}(1+V)(1-V)^{-1}A=i(1+V)(1−V)−1, which requires injectivity of 1−V1 - V1−V and careful bookkeeping of partial domains. Extending an isometry to a unitary requires passing to closures of Ran⁡(A±i)\operatorname{Ran}(A \pm \mathrm{i})Ran(A±i) when AAA is not closed. Equal Hilbert dimension must be converted into an actual unitary between the defect spaces. Theorem 2.18 needs the self-adjointness criterion of Lemma 2.7 in the direction "spectrum real implies self-adjoint", where the range conditions come from the resolvent set rather than from symmetry. Each of these steps is routine on paper and requires explicit domain management in Lean.

Formalization scope

Operators are Mathlib LinearPMaps H →ₗ.[ℂ] H on a complex Hilbert space (InnerProductSpace ℂ H, CompleteSpace H). Separability, part of the book's standing assumption, is not needed by any statement and is not assumed. Extension is the order A ≤ B. Self-adjointness is Mathlib's IsSelfAdjoint (equality with LinearPMap.adjoint), and symmetry includes density of the domain, so every adjoint in the mission is taken of a densely defined operator and is the book's A∗A^*A∗. The closure is LinearPMap.closure; closedness is LinearPMap.IsClosed.

The mission uses the series' shared definitions TeschlQM.Shared.IsSymmetric, TeschlQM.Shared.IsEssentiallySelfAdjoint and TeschlQM.Shared.IsResolventAt, resolventSet, spectrum, and defines, in the namespace TeschlQM.SelfAdjoint: addScalar, rangeAdd, kerAdd for A+zA + zA+z, Ran⁡(A+z)\operatorname{Ran}(A+z)Ran(A+z), Ker⁡(A+z)\operatorname{Ker}(A+z)Ker(A+z); IsCayleyTransform, IsIsometric, rangeOneSub; defectPlus, defectMinus, HasEqualDefectIndices; IsConjugation, IsCReal. Nothing that the book derives is taken as data: the Cayley transform is a relation that determines VVV from AAA, and its existence and uniqueness are part of Theorem 2.25.

Conventions that matter:

  • σ(A)\sigma(A)σ(A) is defined exactly as on p. 73 of the book (bijective onto H\mathfrak{H}H with bounded inverse), not with Mathlib's Banach-algebra spectrum. For a non-closed operator this makes σ(A)=C\sigma(A) = \mathbb{C}σ(A)=C.
  • K±K_\pmK±​ are Ran⁡(A±i)⊥\operatorname{Ran}(A\pm\mathrm{i})^\perpRan(A±i)⊥, and d+=d−d_+ = d_-d+​=d−​ is expressed as the existence of a unitary K₊ ≃ₗᵢ[ℂ] K₋, which is equivalent to equality of Hilbert dimensions. Reading "self-adjoint extension" with the order reversed, or taking K±K_\pmK±​ as kernels of A∓iA \mp \mathrm{i}A∓i (which are trivial for symmetric AAA), would make the goal trivial; neither is used.
  • A conjugation satisfies ⟨Cψ,Cφ⟩=⟨φ,ψ⟩\langle C\psi, C\varphi\rangle = \langle\varphi,\psi\rangle⟨Cψ,Cφ⟩=⟨φ,ψ⟩ (antiunitary). The book prints ⟨ψ,φ⟩\langle\psi,\varphi\rangle⟨ψ,φ⟩ on the right, which no nonzero conjugate-linear map satisfies.
  • In Lemma 2.7 the book admits "z∈(−∞,0)z \in (-\infty, 0)z∈(−∞,0)" for nonnegative AAA while writing the conditions on A+zA + zA+z; the correct range in that convention, and the one its proof uses, is z∈(0,∞)z \in (0, \infty)z∈(0,∞), which is what is stated.
  • The (2.103)–(2.104) milestone assumes AAA closed; without it (2.103) is false (a non-closed essentially self-adjoint AAA is a counterexample).

Reusable parts: the resolvent/spectrum layer and the Cayley transform are needed throughout the rest of the book. Proofs of any milestone, and API lemmas about rangeAdd, kerAdd and adjoints (such as Ker⁡(A∗)=Ran⁡(A)⊥\operatorname{Ker}(A^*) = \operatorname{Ran}(A)^\perpKer(A∗)=Ran(A)⊥ and the reversal A⊆B⇒B∗⊆A∗A \subseteq B \Rightarrow B^* \subseteq A^*A⊆B⇒B∗⊆A∗), are welcome.

Selected references

  • G. Teschl, Mathematical Methods in Quantum Mechanics, With Applications to Schrödinger Operators, AMS Graduate Studies in Mathematics 99, 2009, Chapter 2. https://doi.org/10.1090/gsm/099
  • J. von Neumann, Allgemeine Eigenwerttheorie Hermitescher Funktionaloperatoren, Mathematische Annalen 102 (1930), 49–131. https://doi.org/10.1007/BF01782338
  • K. Schmüdgen, Unbounded Self-adjoint Operators on Hilbert Space, Graduate Texts in Mathematics 265, Springer, 2012. https://doi.org/10.1007/978-94-007-4753-1
16 thms4 active usersReviewed
🏆Completed
Control TheoryDynamical SystemsOperations Research+1·Captain: mikedeng1

Generalized Gradients and Applications II: Flow-Invariant Sets of Lipschitz Differential InclusionsResearch Paper

Motivation

A closed set F⊆RnF\subseteq\mathbb R^nF⊆Rn is flow-invariant for a dynamical system when every trajectory that starts in FFF stays in FFF. Invariance of sets underlies state constraints in optimal control, safety certificates for controlled systems, comparison and maximum principles for differential equations, and the positivity of solutions of kinetic and population models. The question is always the same: which infinitesimal condition at the points of FFF is equivalent to the global statement that trajectories cannot leave FFF?

For a smooth vector field and a smooth boundary the answer is that the field must not point strictly outward. For a nonsmooth set, such as a polyhedron, the positive orthant or a set with inward cusps, "pointing inward" must be made precise through a notion of tangent vector that works at corners. Frank H. Clarke's 1975 paper introduces the generalized gradient of a Lipschitz function and derives from it a normal cone and a tangent cone for arbitrary closed sets. Its Theorem (4.4) shows that this tangent cone is exactly the right notion: for a Lipschitz differential inclusion x˙∈X(x)\dot x\in X(x)x˙∈X(x), a closed set is flow-invariant if and only if X(x)X(x)X(x) is contained in the tangent cone at each point of the set.

Timeline:

  • 1942. Nagumo characterizes invariance for continuous ODEs with unique solutions by a condition on the distance function (Proc. Phys.-Math. Soc. Japan 24).
  • 1969. Bony proves an invariance theorem for Lipschitz vector fields, stated through exterior normals, in the course of a maximum principle for degenerate elliptic operators (Bony 1969).
  • 1970. Brezis characterizes flow-invariant closed sets of a locally Lipschitz vector field by lim⁡δ↓0dF(y+δX(y))/δ=0\lim_{\delta\downarrow0} d_F(y+\delta X(y))/\delta=0limδ↓0​dF​(y+δX(y))/δ=0 (Brezis 1970).
  • 1972. Redheffer gives simplified proofs of the Bony and Brezis theorems under weaker "uniqueness function" hypotheses (Amer. Math. Monthly 79, 740–747).
  • 1975. Clarke extends the characterization to Lipschitz multifunctions with nonempty compact values, with tangency in the sense of his new tangent cone, and recovers Bony and Brezis as corollaries (Clarke 1975, Theorem (4.4), Corollaries (4.10), (4.12)).

Setting

Throughout, Rn\mathbb R^nRn carries the Euclidean inner product ζ⋅v\zeta\cdot vζ⋅v and norm ∣⋅∣|\cdot|∣⋅∣.

Generalized gradient. For f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R Lipschitz on bounded sets, ∂f(x)\partial f(x)∂f(x) is the convex hull of all limits lim⁡i∇f(x+hi)\lim_i\nabla f(x+h_i)limi​∇f(x+hi​) with hi→0h_i\to0hi​→0 and fff differentiable at each x+hix+h_ix+hi​ (Definition (1.1)). The generalized directional derivative is f∘(x;v)=lim sup⁡h→0, δ↓0[f(x+h+δv)−f(x+h)]/δf^\circ(x;v)=\limsup_{h\to0,\ \delta\downarrow0}[f(x+h+\delta v)-f(x+h)]/\deltaf∘(x;v)=limsuph→0, δ↓0​[f(x+h+δv)−f(x+h)]/δ (Definition (1.3)).

Distance function. For a nonempty closed E⊆RnE\subseteq\mathbb R^nE⊆Rn, dE(x)=min⁡{∣x−e∣:e∈E}d_E(x)=\min\{|x-e|:e\in E\}dE​(x)=min{∣x−e∣:e∈E}. It is Lipschitz with constant 111. A point e∈Ee\in Ee∈E with ∣x−e∣=dE(x)|x-e|=d_E(x)∣x−e∣=dE​(x) is a closest point to xxx; it exists but need not be unique.

Normal and tangent cones. For e∈Ee\in Ee∈E, the cone of normals is

NE(e)=cl⁡{p: s p∈∂dE(e) for some s>0}(Definition (3.1)),N_E(e)=\operatorname{cl}\{p:\ s\,p\in\partial d_E(e)\text{ for some }s>0\}\qquad\text{(Definition (3.1))},NE​(e)=cl{p: sp∈∂dE​(e) for some s>0}(Definition (3.1)),

and the tangent cone is its dual,

TE(e)={ζ: ζ⋅v≤0 for all v∈NE(e)}(Definition (3.6)).T_E(e)=\{\zeta:\ \zeta\cdot v\le0\text{ for all }v\in N_E(e)\}\qquad\text{(Definition (3.6))}.TE​(e)={ζ: ζ⋅v≤0 for all v∈NE​(e)}(Definition (3.6)).

Differential inclusions. A multifunction XXX assigns to each x∈Rnx\in\mathbb R^nx∈Rn a set X(x)⊆RnX(x)\subseteq\mathbb R^nX(x)⊆Rn; standing assumption of §4: every X(x)X(x)X(x) is nonempty and compact. A trajectory is an absolutely continuous x:[0,1]→Rnx:[0,1]\to\mathbb R^nx:[0,1]→Rn with x˙(t)∈X(x(t))\dot x(t)\in X(x(t))x˙(t)∈X(x(t)) for almost every ttt ((4.1)). XXX is Lipschitz if there is KKK such that for all x1,x2x_1,x_2x1​,x2​ and v1∈X(x1)v_1\in X(x_1)v1​∈X(x1​) some v2∈X(x2)v_2\in X(x_2)v2​∈X(x2​) has ∣v1−v2∣≤K∣x1−x2∣|v_1-v_2|\le K|x_1-x_2|∣v1​−v2​∣≤K∣x1​−x2​∣ ((4.2)). A closed set FFF is flow-invariant for XXX if every trajectory with x(0)∈Fx(0)\in Fx(0)∈F has x(t)∈Fx(t)\in Fx(t)∈F for all t∈[0,1]t\in[0,1]t∈[0,1] ((4.3)).

Formalization targets

Goal: Theorem (4.4)

Let XXX be a Lipschitz multifunction with nonempty compact values and FFF a nonempty closed subset of Rn\mathbb R^nRn. Then

F is flow-invariant for X  ⟺  X(x)⊆TF(x)  for every x∈F.F\text{ is flow-invariant for }X\iff X(x)\subseteq T_F(x)\ \text{ for every }x\in F.F is flow-invariant for X⟺X(x)⊆TF​(x)  for every x∈F.

Milestones, in the order the proof uses them

  1. Proposition (1.4). f∘(x;v)=max⁡{ζ⋅v:ζ∈∂f(x)}f^\circ(x;v)=\max\{\zeta\cdot v:\zeta\in\partial f(x)\}f∘(x;v)=max{ζ⋅v:ζ∈∂f(x)} for locally Lipschitz fff.
  2. Proposition (2.4). If ∇dE(x)\nabla d_E(x)∇dE​(x) exists and is nonzero, then x∉Ex\notin Ex∈/E, xxx has a unique closest point eee, and ∇dE(x)=(x−e)/∣x−e∣\nabla d_E(x)=(x-e)/|x-e|∇dE​(x)=(x−e)/∣x−e∣.
  3. Corollary (2.5). For e∈Ee\in Ee∈E, ∂dE(e)=co⁡{0,lim⁡(xi−ei)/∣xi−ei∣}\partial d_E(e)=\operatorname{co}\{0,\lim (x_i-e_i)/|x_i-e_i|\}∂dE​(e)=co{0,lim(xi​−ei​)/∣xi​−ei​∣} over xi∉Ex_i\notin Exi​∈/E, xi→ex_i\to exi​→e, eie_iei​ closest to xix_ixi​.
  4. Proposition (3.2). NE(e)=cl⁡co⁡{lim⁡si(xi−ei)}N_E(e)=\operatorname{cl}\operatorname{co}\{\lim s_i(x_i-e_i)\}NE​(e)=clco{limsi​(xi​−ei​)} over si≥0s_i\ge0si​≥0, xi→ex_i\to exi​→e, eie_iei​ closest to xix_ixi​.
  5. Inequality (4.8). If X(y)⊆TF(y)X(y)\subseteq T_F(y)X(y)⊆TF​(y) on FFF and xxx is a trajectory, then f(t)=dF(x(t))f(t)=d_F(x(t))f(t)=dF​(x(t)) satisfies f′(t)≤Kf(t)f'(t)\le Kf(t)f′(t)≤Kf(t) almost everywhere.
  6. Limit (4.9). If FFF is flow-invariant, then dF(y+δv)/δ→0d_F(y+\delta v)/\delta\to0dF​(y+δv)/δ→0 as δ↓0\delta\downarrow0δ↓0 for every y∈Fy\in Fy∈F and v∈X(y)v\in X(y)v∈X(y).
  7. Proposition (3.7). v∈TE(e0)v\in T_E(e_0)v∈TE​(e0​) iff lim⁡e→e0, e∈Elim inf⁡δ↓0dE(e+δv)/δ=0\lim_{e\to e_0,\,e\in E}\liminf_{\delta\downarrow0} d_E(e+\delta v)/\delta=0lime→e0​,e∈E​liminfδ↓0​dE​(e+δv)/δ=0.

Significance

The result. Theorem (4.4) turns a statement about all trajectories of a set-valued dynamical system into a pointwise geometric condition on FFF that can be checked without solving anything. It is the prototype of the strong invariance theorems of nonsmooth control theory, later developed in viability theory and in the monograph of Clarke, Ledyaev, Stern and Wolenski, and it is the tool behind state-constrained optimal control and Lyapunov-type arguments for nonsmooth systems. Its corollaries recover the Bony and Brezis theorems for Lipschitz vector fields. The companion milestones (2.5), (3.2) and (3.7) are standalone facts of nonsmooth geometry: the Clarke normal cone is generated by limits of proximal normals, and Clarke tangency can be tested along rays from nearby points of the set.

Formalizing it. The result is proved in the paper and has been reproved in textbooks; to the best of our knowledge it has no machine-checked proof. Mathlib contains Rademacher's theorem, absolutely continuous functions on intervals and the Bouligand tangent cone, but no Clarke generalized gradient, no Clarke normal or tangent cone, and no theory of differential inclusions. A complete development supplies a first nonsmooth-analysis layer on top of Mathlib and a first existence theorem for Lipschitz differential inclusions.

Difficulty

The direction (2) ⇒\Rightarrow⇒ (1) looks like a Gronwall argument for f(t)=dF(x(t))f(t)=d_F(x(t))f(t)=dF​(x(t)), but dFd_FdF​ is not differentiable, xxx is only absolutely continuous, and the closest point to x(t)x(t)x(t) can jump. The step that must be controlled is the comparison between x˙(t)\dot x(t)x˙(t), a nearby admissible velocity at the closest point, and the normal x(t)−yx(t)-yx(t)−y; this is where Proposition (3.2) enters, and it is why the Clarke cone, rather than a weaker cone, is needed.

The direction (1) ⇒\Rightarrow⇒ (2) needs a trajectory through an arbitrary y∈Fy\in Fy∈F whose initial velocity is a prescribed v∈X(y)v\in X(y)v∈X(y). For a nonconvex multifunction this is Filippov's theorem [7, Theorem 5], which the paper cites and does not prove. A solver must prove it, or an equivalent existence result for Lipschitz inclusions with compact values, from scratch in Lean. The Clarke tangent cone and the more familiar Bouligand (contingent) cone differ pointwise at nonconvex corners, so a statement written with Mathlib's tangentConeAt is a different theorem from (4.4). That the two universal conditions "X(x)⊆TF(x)X(x)\subseteq T_F(x)X(x)⊆TF​(x) for all x∈Fx\in Fx∈F" are equivalent for Lipschitz XXX is a later, separate result and cannot be assumed.

Formalization scope

  • Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n); dEd_EdE​ is Metric.infDist · E; "eee is a closest point to xxx" is e ∈ E ∧ dist x e = infDist x E.
  • ∂f\partial f∂f and f∘f^\circf∘ follow Definitions (1.1) and (1.3). The gradient limits carry DifferentiableAt, because Mathlib's gradient is 000 off the differentiability set. f∘f^\circf∘ is a real limsup, and every theorem using it carries the §1 Lipschitz hypothesis.
  • NEN_ENE​ and TET_ETE​ are defined from ∂dE\partial d_E∂dE​ as in (3.1) and (3.6). The tangent cone is not Mathlib's tangentConeAt.
  • A trajectory is x : ℝ → ℝⁿ with AbsolutelyContinuousOnInterval x 0 1 and, for almost every t∈[0,1]t\in[0,1]t∈[0,1], ∃ w ∈ X (x t), HasDerivAt x w t. Values outside [0,1][0,1][0,1] are irrelevant.
  • Standing assumptions made explicit: X(x)X(x)X(x) nonempty and compact for every xxx (§4, p. 259); EEE, FFF nonempty and closed and e∈Ee\in Ee∈E (§3, p. 254); fff Lipschitz on bounded sets (§1, p. 247). The Lipschitz constant of (4.2) is global.
  • Ruled out: dropping absolute continuity (Cantor-type curves would leave FFF), using deriv in (4.1), using a punctured filter in (3.7), which would make (3.7)(2) hold at isolated points, and assuming Filippov's theorem as a hypothesis of (4.9) or of the goal.
  • Needed infrastructure: the Clarke calculus for dEd_EdE​, a chain-rule-type estimate for dF∘xd_F\circ xdF​∘x along absolutely continuous curves, a Gronwall lemma for absolutely continuous functions (Mathlib has norm_le_gronwallBound_of_norm_deriv_right_le for the differentiable case), and Filippov's existence theorem. The generalized gradient, cones and trajectory notions are reusable by any nonsmooth-optimization or control mission. Contributions of any of these as separate lemmas are welcome.
  • The §1 definitions duplicate those of the companion mission Generalized Gradients and Applications I; the two missions were drafted at the same time.

Selected references

  • F. H. Clarke, Generalized gradients and applications, Trans. Amer. Math. Soc. 205 (1975), 247–262. https://doi.org/10.1090/s0002-9947-1975-0367131-6
  • A. F. Filippov, Classical solutions of differential equations with multivalued right-hand side, SIAM J. Control 5 (1967), 609–621. https://doi.org/10.1137/0305040
  • H. Brezis, On a characterization of flow-invariant sets, Comm. Pure Appl. Math. 23 (1970), 261–263. https://doi.org/10.1002/cpa.3160230211
  • J. M. Bony, Principe du maximum, inégalité de Harnack et unicité du problème de Cauchy pour les opérateurs elliptiques dégénérés, Ann. Inst. Fourier 19 (1969), 277–304. https://doi.org/10.5802/aif.319
  • R. M. Redheffer, The theorems of Bony and Brezis on flow-invariant sets, Amer. Math. Monthly 79 (1972), 740–747. MR 46 #2166.
  • F. H. Clarke, Yu. S. Ledyaev, R. J. Stern, P. R. Wolenski, Nonsmooth Analysis and Control Theory, Graduate Texts in Mathematics 178, Springer, 1998. https://doi.org/10.1007/b97650
16 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

A Nonsmooth Version of Newton's Method III: Semismoothness of the Augmented Lagrangian GradientResearch Paper

Motivation

The augmented Lagrangian method (method of multipliers) of Hestenes, Powell and Rockafellar solves a constrained nonlinear program by repeatedly minimizing an unconstrained merit function in the primal variables and then updating the multipliers. For inequality constraints, the augmented Lagrangian in the form the paper takes from Rockafellar (Rockafellar 1981) is continuously differentiable but not twice differentiable, even when all problem data are smooth: its Hessian jumps across the surfaces where a constraint switches between the "active" and "inactive" formula. Newton's method for the inner minimization therefore has no classical Hessian to work with on those surfaces.

Qi and Sun (Math. Programming 58, 1993) extended Newton's method to equations F(x)=0F(x) = 0F(x)=0 with FFF locally Lipschitz, replacing the Jacobian by an element of Clarke's generalized Jacobian, and proved local superlinear convergence when FFF is semismooth. Section 4 of the paper, an example suggested by Rockafellar, shows that the gradient of the augmented Lagrangian of a C2C^2C2 program is semismooth, so the nonsmooth Newton method applies to the stationarity equation ∇Lr=0\nabla L_r = 0∇Lr​=0. This mission formalizes that result, Theorem 4.1.

Setting

Let f0,f1,…,fm:Rn→Rf_0, f_1, \dots, f_m : \mathbb{R}^n \to \mathbb{R}f0​,f1​,…,fm​:Rn→R be of class C2C^2C2 and consider

(NLP)min⁡f0(x)  s.t.  fi(x)=0, i=1,…,p,fi(x)≤0, i=p+1,…,m.(4.1)\text{(NLP)}\quad \min f_0(x)\ \text{ s.t. }\ f_i(x) = 0,\ i = 1,\dots,p,\qquad f_i(x) \le 0,\ i = p+1,\dots,m. \tag{4.1}(NLP)minf0​(x)  s.t.  fi​(x)=0, i=1,…,p,fi​(x)≤0, i=p+1,…,m.(4.1)

Fix r>0r > 0r>0. For a constraint value aaa and a multiplier yyy put

ϕ(r,a,y)={ya+12ra2,y+ra≥0,−12ry2,y+ra≤0,\phi(r, a, y) = \begin{cases} y a + \tfrac12 r a^2, & y + r a \ge 0,\\ -\tfrac{1}{2r} y^2, & y + r a \le 0,\end{cases}ϕ(r,a,y)={ya+21​ra2,−2r1​y2,​y+ra≥0,y+ra≤0,​

(the two cases agree when y+ra=0y + ra = 0y+ra=0). The augmented Lagrangian is the function of (x,y)∈Rn×Rm(x, y) \in \mathbb{R}^n \times \mathbb{R}^m(x,y)∈Rn×Rm

Lr(x,y)=f0(x)+∑i=1p(yifi(x)+12rfi(x)2)+∑i=p+1mϕ(r,fi(x),yi).L_r(x, y) = f_0(x) + \sum_{i=1}^{p}\Big(y_i f_i(x) + \tfrac12 r f_i(x)^2\Big) + \sum_{i=p+1}^{m} \phi\big(r, f_i(x), y_i\big).Lr​(x,y)=f0​(x)+i=1∑p​(yi​fi​(x)+21​rfi​(x)2)+i=p+1∑m​ϕ(r,fi​(x),yi​).

For a locally Lipschitz map FFF between finite-dimensional spaces, let DFD_FDF​ be the set where FFF is differentiable. Clarke's generalized Jacobian is ∂F(x)=co{lim⁡JF(xi):xi→x, xi∈DF}\partial F(x) = \mathrm{co}\{\lim JF(x_i) : x_i \to x,\ x_i \in D_F\}∂F(x)=co{limJF(xi​):xi​→x, xi​∈DF​}. FFF is semismooth at xxx if it is locally Lipschitz near xxx and, for every direction hhh, the limit of Vh′V h'Vh′ over V∈∂F(x+th′)V \in \partial F(x + t h')V∈∂F(x+th′), h′→hh' \to hh′→h, t↓0t \downarrow 0t↓0, exists.

For a single constraint function ggg the proof works with η(x,s)=ϕ(r,g(x),s)\eta(x, s) = \phi(r, g(x), s)η(x,s)=ϕ(r,g(x),s) on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R, and with the surface s+rg(x)=0s + r g(x) = 0s+rg(x)=0 on which the two formulas for ϕ\phiϕ meet.

Formalization targets

Goal: Theorem 4.1

For r>0r > 0r>0 and f0,…,fm∈C2f_0, \dots, f_m \in C^2f0​,…,fm​∈C2:

Lr∈C1,∇Lr semismooth at (x,y) whenever ∃ i>p: yi+rfi(x)=0,L_r \in C^1, \qquad \nabla L_r \text{ semismooth at } (x,y) \text{ whenever } \exists\, i > p:\ y_i + r f_i(x) = 0,Lr​∈C1,∇Lr​ semismooth at (x,y) whenever ∃i>p: yi​+rfi​(x)=0, ∇Lr∈C1 near (x,y) whenever yi+rfi(x)≠0 for all i>p.\nabla L_r \in C^1 \text{ near } (x, y) \text{ whenever } y_i + r f_i(x) \neq 0 \text{ for all } i > p.∇Lr​∈C1 near (x,y) whenever yi​+rfi​(x)=0 for all i>p.

All three clauses are the theorem; the last two together cover every point.

Milestones

  1. η∈C1\eta \in C^1η∈C1, with ∇η(x,s)=((s+rg(x))∇g(x), g(x))\nabla\eta(x,s) = \big((s + r g(x))\nabla g(x),\ g(x)\big)∇η(x,s)=((s+rg(x))∇g(x), g(x)) if s+rg(x)≥0s + r g(x) \ge 0s+rg(x)≥0 and (0,−s/r)(0, -s/r)(0,−s/r) if s+rg(x)≤0s + r g(x) \le 0s+rg(x)≤0, and ∇η\nabla \eta∇η is locally Lipschitz.
  2. Eq. (4.2): the Hessian of η\etaη on each side of the surface, and ∇η∈C1\nabla\eta \in C^1∇η∈C1 near every point off it.
  3. Eq. (4.7): if sˉ+rg(xˉ)=0\bar s + r g(\bar x) = 0sˉ+rg(xˉ)=0 and sˉ+tjαj+rg(xˉ+tjhj)=0\bar s + t_j\alpha_j + r g(\bar x + t_j h_j) = 0sˉ+tj​αj​+rg(xˉ+tj​hj​)=0 with hj→hh_j \to hhj​→h, αj→α\alpha_j \to \alphaαj​→α, tj↓0t_j \downarrow 0tj​↓0, then α+r∇g(xˉ)Th=0\alpha + r\nabla g(\bar x)^{\mathsf T} h = 0α+r∇g(xˉ)Th=0.
  4. ∇η\nabla\eta∇η is semismooth, jointly in (x,s)(x, s)(x,s), at every point of the surface.

Significance

The result places the inner problem of the augmented Lagrangian method inside the scope of the paper's convergence theory: with F=∇LrF = \nabla L_rF=∇Lr​, the generalized-Jacobian Newton iteration converges locally superlinearly at a root where every element of ∂F\partial F∂F is nonsingular. Its practical content is that second-order methods can be run on LrL_rLr​ even though LrL_rLr​ is only C1C^{1}C1, with the elements of ∂∇Lr\partial \nabla L_r∂∇Lr​ playing the role of Hessians. The same pattern (a C1C^1C1 merit function with semismooth gradient) recurs in extended linear-quadratic programming and in semismooth Newton methods for complementarity problems.

The theorem is proved in the paper by direct computation. As far as a search of the platform showed, none of the objects involved (Clarke's generalized Jacobian, semismoothness, Rockafellar's augmented Lagrangian) has a published formalization there, and Mathlib has none of them. The mission produces a machine-checked version of the computation and, as a by-product, reusable statements about C1C^1C1 functions obtained by gluing two C2C^2C2 pieces along a hypersurface.

Difficulty

Clauses 1 and 3 are calculus with a case split: one has to check that the two formulas for ϕ\phiϕ and for its gradient match on the surface. Clause 2 is where the argument is not routine. On the surface, ∇η\nabla\eta∇η is not differentiable, and the generalized Jacobian ∂∇η\partial\nabla\eta∂∇η there contains convex combinations of the two one-sided Hessians of (4.2). Semismoothness asks that V(h′,α′)V(h', \alpha')V(h′,α′) have a single limit over all such VVV, for all approaches (h′,α′)→(h,α)(h', \alpha') \to (h, \alpha)(h′,α′)→(h,α), t↓0t \downarrow 0t↓0, including approaches that cross the surface infinitely often. The two one-sided Hessians are different matrices, so no single derivative describes ∇η\nabla\eta∇η near the surface, and the existence of the limit must be shown for approaches that alternate between the two sides and for the convex combinations that ∂∇η\partial\nabla\eta∂∇η contains on the surface itself. General theorems that piecewise-smooth maps are semismooth appear in later literature but are not available in Mathlib, so they cannot be invoked as a shortcut. A second obstacle is infrastructure: Mathlib has no generalized Jacobian, so every fact about ∂∇η\partial\nabla\eta∂∇η (which limits of derivatives occur near the surface) must be derived from the definition.

Formalization scope

  • Rn\mathbb{R}^nRn and Rm\mathbb{R}^mRm are EuclideanSpace ℝ (Fin n) and EuclideanSpace ℝ (Fin m); LrL_rLr​ is a function on their product, and η\etaη on EuclideanSpace ℝ (Fin n) × ℝ.
  • The constraint index i∈{1,…,m}i \in \{1,\dots,m\}i∈{1,…,m} is i : Fin m with paper index i.val + 1; equality constraints are i.val < p, inequality constraints p ≤ i.val. The paper's implicit p≤mp \le mp≤m is not assumed (for p>mp > mp>m there are no inequality constraints).
  • The paper's first sum prints h(ri,fi(x),yi)h(r_i, f_i(x), y_i)h(ri​,fi​(x),yi​); the single rrr is used, as in the paper's definition of hhh.
  • ϕ\phiϕ uses the first branch when y+ra≥0y + ra \ge 0y+ra≥0; the branches agree on the boundary. Every statement assumes r>0r > 0r>0.
  • C2C^2C2 is ContDiff ℝ 2 on all of Rn\mathbb{R}^nRn; "smooth" is the paper's continuously differentiable, ContDiffAt ℝ 1 of the gradient at the point.
  • ∇Lr\nabla L_r∇Lr​ and ∇η\nabla\eta∇η are Fréchet derivatives, valued in continuous linear functionals; semismoothness is invariant under the Riesz isometry to gradient vectors and under equivalent norms on the domain (Mathlib's product has the sup norm).
  • The Jacobian in Clarke's definition is fderiv, limits are along sequences, and no closure is taken in the convex hull. Semismoothness is the explicit ε\varepsilonε–δ\deltaδ form of the paper's limit, uniform over V∈∂F(x+th′)V \in \partial F(x + th')V∈∂F(x+th′).
  • Hessians in (4.2) are stated as the Fréchet derivative of the gradient map applied to a direction.

A formalization that states only Lr∈C1L_r \in C^1Lr​∈C1, or only the semismoothness of one term η\etaη, is not Theorem 4.1; the goal contains all three clauses for the full LrL_rLr​. The combination step from the terms η\etaη to LrL_rLr​ uses that sums of semismooth maps and C1C^1C1 maps with locally Lipschitz derivative are semismooth; the paper cites this without proof, and a solver will need to prove it.

Contributions welcome: the lemmas above; general facts about clarkeJac (it contains fderiv at points of strict differentiability; it is a singleton for C1C^1C1 maps; behaviour under sums and linear maps); and the semismoothness of sums.

Selected references

  • L. Qi, J. Sun, A nonsmooth version of Newton's method, Mathematical Programming 58 (1993) 353–367. https://doi.org/10.1007/BF01581275
  • R. T. Rockafellar, Proximal subgradients, marginal values, and augmented Lagrangians in nonconvex optimization, Mathematics of Operations Research 6 (1981) 427–437. https://doi.org/10.1287/moor.6.3.427
  • F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, 1983 (reprinted SIAM Classics in Applied Mathematics 5, 1990). https://doi.org/10.1137/1.9781611971309
  • R. Mifflin, Semismooth and semiconvex functions in constrained optimization, SIAM J. Control Optim. 15 (1977) 959–972. https://doi.org/10.1137/0315061
8 thms4 active usersReviewed
🏆Completed
Numerical AnalysisOperations ResearchOptimization·Captain: mikedeng1

A Nonsmooth Version of Newton's Method II: global convergence of the generalized-Jacobian Newton method on a ball, with an error estimateResearch Paper

Motivation

Many problems in optimization and equilibrium modelling reduce to a system of equations F(x)=0F(x) = 0F(x)=0 with F:Rn→RnF : \mathbb{R}^n \to \mathbb{R}^nF:Rn→Rn that is continuous and locally Lipschitz but not differentiable. Complementarity problems rewritten through the min or Fischer–Burmeister functions, Karush–Kuhn–Tucker systems of nonlinear programs, and the gradients of augmented Lagrangians all have this form. Newton's method xk+1=xk−F′(xk)−1F(xk)x^{k+1} = x^k - F'(x^k)^{-1}F(x^k)xk+1=xk−F′(xk)−1F(xk) cannot be applied verbatim, because F′(xk)F'(x^k)F′(xk) need not exist.

Qi and Sun (Math. Programming 58 (1993) 353–367) replaced the Jacobian by an arbitrary element of Clarke's generalized Jacobian and proved that the resulting method converges under a condition they called semismoothness, extending Mifflin's notion (SIAM J. Control Optim. 15 (1977)) from functionals to maps. The paper has two convergence results. Theorem 3.2 is local: near a semismooth root with nonsingular generalized Jacobian the method converges superlinearly. Theorem 3.3, the target of this mission, is global in the Newton–Kantorovich sense: explicit constants on a ball SSS around the starting point guarantee that the iteration never leaves SSS, that FFF has exactly one zero in SSS, and that the iterates converge to it with a computable error bound. The authors describe it as "an extension of the classical Newton-Kantorovich theorem" (p. 361), which is stated for smooth maps in Ortega and Rheinboldt's monograph.

Timeline.

  • 1948: Kantorovich proves semilocal convergence of Newton's method for smooth operators in Banach spaces.
  • 1975–1983: Clarke introduces the generalized gradient and generalized Jacobian of a locally Lipschitz map (Optimization and Nonsmooth Analysis, Wiley 1983).
  • 1977: Mifflin defines semismooth functionals.
  • 1990: Pang proves convergence of a B-derivative Newton method under a strong Fréchet derivative at the solution.
  • 1993: Qi and Sun (this paper) prove local and global convergence of the generalized-Jacobian Newton method for semismooth maps.

Setting

Work in Rn\mathbb{R}^nRn with the Euclidean norm ∥⋅∥\|\cdot\|∥⋅∥; for a linear map VVV, ∥V∥\|V\|∥V∥ is the induced operator norm. Let F:Rn→RnF : \mathbb{R}^n \to \mathbb{R}^nF:Rn→Rn be locally Lipschitz. Write DFD_FDF​ for the set of points where FFF is differentiable and JF(y)JF(y)JF(y) for the derivative at y∈DFy \in D_Fy∈DF​.

  • The generalized Jacobian of FFF at xxx is
∂F(x)=co{lim⁡i→∞JF(xi):xi→x, xi∈DF}.\partial F(x) = \mathrm{co}\Big\{\lim_{i\to\infty} JF(x_i) : x_i \to x,\ x_i \in D_F\Big\}.∂F(x)=co{i→∞lim​JF(xi​):xi​→x, xi​∈DF​}.
  • The directional derivative is F′(x;h)=lim⁡t↓0 (F(x+th)−F(x))/tF'(x;h) = \lim_{t\downarrow 0}\,(F(x+th)-F(x))/tF′(x;h)=limt↓0​(F(x+th)−F(x))/t.
  • FFF is semismooth at xxx if it is Lipschitz near xxx and, for every hhh, Vh′V h'Vh′ has a limit as V∈∂F(x+th′)V \in \partial F(x+th')V∈∂F(x+th′), h′→hh' \to hh′→h, t↓0t \downarrow 0t↓0. Semismoothness implies that F′(x;h)F'(x;h)F′(x;h) exists.
  • A run of the nonsmooth Newton method (3.2) from x0x^0x0 is a pair of sequences (xk)(x^k)(xk), (Vk)(V_k)(Vk​) with Vk∈∂F(xk)V_k \in \partial F(x^k)Vk​∈∂F(xk) and Vk(xk+1−xk)=−F(xk)V_k(x^{k+1} - x^k) = -F(x^k)Vk​(xk+1−xk)=−F(xk) for all kkk; any element of ∂F(xk)\partial F(x^k)∂F(xk) may be chosen.

In Lean these are NonsmoothNewton.Global.clarkeJac, dirDeriv, SemismoothAt and IsNewtonRun, over EuclideanSpace ℝ (Fin n).

Fix x0x^0x0, r≥0r \ge 0r≥0, the closed ball S={x:∥x−x0∥≤r}S = \{x : \|x - x^0\| \le r\}S={x:∥x−x0∥≤r}, and constants β,γ,δ\beta, \gamma, \deltaβ,γ,δ with α=β(γ+δ)\alpha = \beta(\gamma+\delta)α=β(γ+δ).

Formalization targets

Goal: Theorem 3.3 (global convergence)

Assume FFF is semismooth at every point of SSS and, for all x,y∈Sx, y \in Sx,y∈S and V∈∂F(x)V \in \partial F(x)V∈∂F(x): VVV is nonsingular,

∥V−1∥≤β,∥V(y−x)−F′(x;y−x)∥≤γ∥y−x∥,∥F(y)−F(x)−F′(x;y−x)∥≤δ∥y−x∥,\|V^{-1}\| \le \beta,\qquad \|V(y-x) - F'(x;y-x)\| \le \gamma\|y-x\|,\qquad \|F(y)-F(x)-F'(x;y-x)\| \le \delta\|y-x\|,∥V−1∥≤β,∥V(y−x)−F′(x;y−x)∥≤γ∥y−x∥,∥F(y)−F(x)−F′(x;y−x)∥≤δ∥y−x∥,

with α<1\alpha < 1α<1 and β∥F(x0)∥≤r(1−α)\beta\|F(x^0)\| \le r(1-\alpha)β∥F(x0)∥≤r(1−α). Then every run of (3.2) from x0x^0x0 stays in SSS, every VkV_kVk​ is nonsingular, FFF has a unique zero x∗x^*x∗ in SSS, xk→x∗x^k \to x^*xk→x∗, and

∥xk−x∗∥≤α1−α ∥xk−xk−1∥,k=1,2,…(3.4)\|x^k - x^*\| \le \frac{\alpha}{1-\alpha}\,\|x^k - x^{k-1}\|,\qquad k = 1, 2, \dots \tag{3.4}∥xk−x∗∥≤1−αα​∥xk−xk−1∥,k=1,2,…(3.4)

Milestones (steps of the proof, p. 360)

  1. The first step: ∥x1−x0∥≤β∥F(x0)∥≤r(1−α)\|x^1 - x^0\| \le \beta\|F(x^0)\| \le r(1-\alpha)∥x1−x0∥≤β∥F(x0)∥≤r(1−α), so x1∈Sx^1 \in Sx1∈S.
  2. One-step contraction: for consecutive Newton points with xk−1,xk∈Sx^{k-1}, x^k \in Sxk−1,xk∈S, ∥xk+1−xk∥≤α∥xk−xk−1∥\|x^{k+1} - x^k\| \le \alpha\|x^k - x^{k-1}\|∥xk+1−xk∥≤α∥xk−xk−1∥.
  3. All iterates remain in SSS, with ∥xk+1−xk∥≤rαk(1−α)\|x^{k+1} - x^k\| \le r\alpha^k(1-\alpha)∥xk+1−xk∥≤rαk(1−α).
  4. A run that stays in SSS and converges has uniformly bounded ∥Vk∥\|V_k\|∥Vk​∥, and its limit is a zero of FFF.
  5. FFF has at most one zero in SSS.

Significance

The theorem certifies, from data checkable on a single ball, that a solution exists, where it is, that it is unique there, and how far the current iterate is from it; (3.4) is an a-posteriori stopping criterion. It holds for every choice of Vk∈∂F(xk)V_k \in \partial F(x^k)Vk​∈∂F(xk), which is what implementations need, since they compute one element of ∂F\partial F∂F and not the whole set. The result underlies the global and semilocal analysis of semismooth Newton methods for complementarity problems, variational inequalities and nonsmooth KKT systems, a line that continued through the 1990s and 2000s.

The theorem is proved on paper; no machine-checked version is known. The platform has no Newton–Kantorovich theorem, smooth or nonsmooth, and no Clarke generalized Jacobian. A complete formalization would supply both, and the definitions layer here (generalized Jacobian, one-sided directional derivative, semismoothness, Newton runs) is shared with the two companion missions on Qi and Sun's local convergence theorem and on semismoothness of augmented Lagrangian gradients.

Difficulty

The Newton map is set-valued: xk+1x^{k+1}xk+1 depends on the choice of VkV_kVk​, so the Banach fixed-point theorem for a single contraction does not apply directly, and the argument must hold for every sequence of choices. The contraction estimate needs both consecutive steps to start inside SSS, so containment in SSS and the geometric decay of the steps must be established together. Identifying the limit as a zero requires a uniform bound on ∥Vk∥\|V_k\|∥Vk​∥, which is not a hypothesis: it has to come from local Lipschitz continuity through the structure of the generalized Jacobian. Uniqueness uses an element V∗∈∂F(x∗)V^* \in \partial F(x^*)V∗∈∂F(x∗), whose existence rests on Rademacher's theorem. Finally, the directional derivative in the hypotheses is only meaningful because semismoothness makes it exist.

Formalization scope

The space is EuclideanSpace ℝ (Fin n), so the norm is Euclidean, as in the paper (p. 356), and ∥V−1∥\|V^{-1}\|∥V−1∥ is the operator norm. Local Lipschitzness is global (LocallyLipschitz F), the standing assumption of Section 3. Conventions:

  • ∂F(x)\partial F(x)∂F(x) is the convex hull of limits of fderiv along sequences in DFD_FDF​; no closure is taken (the limit set is compact for locally Lipschitz FFF).
  • "VVV nonsingular, ∥V−1∥≤β\|V^{-1}\| \le \beta∥V−1∥≤β" is the existence of a two-sided inverse WWW with ∥W∥≤β\|W\| \le \beta∥W∥≤β; Ring.inverse is not used.
  • F′(x;h)F'(x;h)F′(x;h) is dirDeriv, a limUnder along t→0+t \to 0^+t→0+, used only at points of SSS, where semismoothness makes the limit exist.
  • The run is a relation, not a function; every choice of VkV_kVk​ is covered, and nonsingularity of each VkV_kVk​ is a conclusion.
  • The radius condition r≥0r \ge 0r≥0 is an explicit hypothesis. Without it, r<0r < 0r<0 and β<0\beta < 0β<0 would satisfy all other hypotheses vacuously while x0∉Sx^0 \notin Sx0∈/S.
  • The paper's third inequality sits under "for any V∈∂F(x)V \in \partial F(x)V∈∂F(x)"; it is stated without VVV, which is equivalent because ∂F(x)≠∅\partial F(x) \ne \emptyset∂F(x)=∅.
  • (3.4) is stated at index k+1k+1k+1 for k≥0k \ge 0k≥0, avoiding natural-number subtraction.
  • The paper's statements contain no o(⋅)o(\cdot)o(⋅) or O(⋅)O(\cdot)O(⋅); all constants are explicit and fixed before the quantifiers over points of SSS.

The goal is the full four-part conclusion: containment, existence, uniqueness, and convergence with (3.4). A formalization that proves only that the iterates converge to some zero, or that treats ∂F(x)\partial F(x)∂F(x) as possibly empty so that the hypotheses become vacuous, is not the theorem. The hypotheses are satisfiable by genuinely nonsmooth maps, e.g. F(x)=x+110∣x∣−cF(x) = x + \tfrac{1}{10}|x| - cF(x)=x+101​∣x∣−c on R\mathbb{R}R with a ball containing the kink.

A complete development needs: nonemptiness and local boundedness of the generalized Jacobian (Rademacher's theorem, available in Mathlib as LipschitzWith.ae_differentiableAt); geometric-series and Cauchy-sequence arguments in a complete space. The generalized-Jacobian facts are reusable well beyond this mission. Contributions of any of the milestones, or of these general facts as separate lemmas, are welcome.

Selected references

  • L. Qi, J. Sun, A nonsmooth version of Newton's method, Mathematical Programming 58 (1993) 353–367. https://doi.org/10.1007/BF01581275
  • F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983. https://doi.org/10.1137/1.9781611971309
  • R. Mifflin, Semismooth and semiconvex functions in constrained optimization, SIAM J. Control Optim. 15 (1977) 959–972. https://doi.org/10.1137/0315061
  • J. M. Ortega, W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, 1970. https://doi.org/10.1137/1.9780898719468
  • J.-S. Pang, Newton's method for B-differentiable equations, Mathematics of Operations Research 15 (1990) 311–341. https://doi.org/10.1287/moor.15.2.311
11 thms4 active usersReviewed
🏆Completed
Captain: Lucas

Ahlfors Complex Analysis I: The Riemann Mapping TheoremTextbook

Motivation

The Riemann mapping theorem says that every simply connected region of the complex plane other than the plane itself can be mapped one-to-one and conformally onto the open unit disk. It is the central existence theorem of geometric function theory: it reduces questions about analytic functions on an arbitrary simply connected region to questions on the disk, and it shows that, up to conformal equivalence, there are only two simply connected regions in the plane — the plane and the disk.

In L. V. Ahlfors' textbook Complex Analysis (3rd ed., McGraw-Hill, 1979) the theorem is Theorem 1 of Chapter 6, §1.1 (p. 230). Its proof draws on much of the preceding theory: the general form of Cauchy's theorem (through the existence of logarithms and roots on simply connected regions, Ch. 4, §4.4), Schwarz's lemma (Ch. 4, §3.4), Hurwitz's theorem (Ch. 5, §1.1) and the theory of normal families (Ch. 5, §5). This mission is the first of a series formalizing capstone results of the book.

Timeline (as recorded by Ahlfors, p. 229–230). The theorem was formulated by B. Riemann (1851). A related theorem from which it can be derived was proved earlier by W. F. Osgood; the first successful proof of the mapping theorem itself is credited to P. Koebe. The proof in the book is a shorter variant of Koebe's original proof.

Setting

A region is a nonempty, open, connected subset Ω\OmegaΩ of the complex plane C\mathbb CC (Ch. 3, §1.3, Definition 4). The extended plane is C∪{∞}\mathbb C \cup \{\infty\}C∪{∞}, the one-point compactification of C\mathbb CC. A region Ω\OmegaΩ is simply connected if its complement with respect to the extended plane, (C∪{∞})∖Ω(\mathbb C\cup\{\infty\})\setminus\Omega(C∪{∞})∖Ω, is connected (Ch. 4, §4.2, Definition 1). This is Ahlfors' definition; it is not the usual "every loop is contractible" definition, although the two agree for plane regions. The point ∞\infty∞ always lies in the complement, so, for example, a disk, a half-plane and a parallel strip are simply connected, while the punctured plane and the exterior of a circle are not.

A function fff is analytic in Ω\OmegaΩ if it is complex-differentiable at every point of Ω\OmegaΩ (equivalently, it has a convergent power-series expansion around every point of Ω\OmegaΩ). It is univalent in Ω\OmegaΩ if it is one-to-one there. We write D={w:∣w∣<1}\mathbb D = \{w : |w| < 1\}D={w:∣w∣<1} for the open unit disk.

A family F\mathfrak FF of functions on Ω\OmegaΩ is normal in Ω\OmegaΩ if every sequence of members of F\mathfrak FF has a subsequence which converges uniformly on every compact subset of Ω\OmegaΩ (Ch. 5, §5.1, Definition 2); the limit need not belong to F\mathfrak FF.

Formalization targets

Goal — Riemann mapping theorem (Ch. 6, Theorem 1)

Let Ω\OmegaΩ be a simply connected region with Ω≠C\Omega \ne \mathbb CΩ=C and let z0∈Ωz_0 \in \Omegaz0​∈Ω. Then there is an analytic function fff in Ω\OmegaΩ with

f(z0)=0,f′(z0)>0,f one-to-one on Ω,f(Ω)=D,f(z_0) = 0,\qquad f'(z_0) > 0,\qquad f \text{ one-to-one on } \Omega,\qquad f(\Omega) = \mathbb D,f(z0​)=0,f′(z0​)>0,f one-to-one on Ω,f(Ω)=D,

and any two functions with these properties agree on Ω\OmegaΩ.

Milestones (in the order used by the proof)

  1. Ch. 4, §4.4, Corollary 2 of Theorem 15. On a simply connected region, a nowhere-vanishing analytic function has single-valued analytic branches of log⁡f\log flogf and of fn\sqrt[n]{f}nf​.
  2. Ch. 4, Theorem 13 (Schwarz's lemma). If fff is analytic in D\mathbb DD, ∣f∣≤1|f|\le 1∣f∣≤1 and f(0)=0f(0)=0f(0)=0, then ∣f(z)∣≤∣z∣|f(z)|\le|z|∣f(z)∣≤∣z∣ and ∣f′(0)∣≤1|f'(0)|\le 1∣f′(0)∣≤1, with equality only for rotations.
  3. Ch. 4, §3.4, Exercise 5 (disk case). A one-to-one analytic map of a disk onto a disk is a linear fractional transformation.
  4. Ch. 5, Theorem 2 (Hurwitz). A locally uniform limit of nowhere-vanishing analytic functions on a region is either identically zero or never zero.
  5. Ch. 5, Theorem 15 (Montel). A family of analytic functions is normal if and only if it is uniformly bounded on every compact set.

Significance

The mapping theorem is the entry point to the conformal-mapping part of complex analysis: the uniqueness statement identifies the conformal automorphisms of a simply connected region with those of the disk, and the existence statement is the base case of the uniformization theorem for Riemann surfaces. It also yields the purely topological fact that any simply connected plane region is homeomorphic to a disk.

The theorem is classical and fully proved in the literature. What this mission adds is a machine-checked proof in Lean 4 / Mathlib, together with machine-checked versions of the supporting results listed above in the book's own formulations. Mathlib already contains related material (for example, Cauchy integral formulas and a derivative bound of Schwarz type, Complex.norm_deriv_le_div_of_mapsTo_ball); it should be reused wherever it applies.

Difficulty

The obvious approach — write down the map — is not available: for a general region there is no formula, and the map is obtained from an extremal problem (maximize ∣g′(z0)∣|g'(z_0)|∣g′(z0​)∣ over univalent maps into the disk). Three steps are delicate: showing that the competing family is nonempty (this uses the existence of a square root on Ω\OmegaΩ, i.e. the general Cauchy theorem, applied with Ahlfors' complement-connectedness definition); showing that an extremal function exists and is still univalent (this needs normal families and Hurwitz's theorem, neither of which is a direct consequence of pointwise convergence); and showing that the extremal function is onto (a second square-root construction combined with a Schwarz-lemma-type estimate). Uniqueness requires the classification of the automorphisms of the disk.

Formalization scope

All statements live in the namespace AhlforsComplexAnalysis, shared by the whole book series. Functions are total maps C→C\mathbb C \to \mathbb CC→C; "analytic in Ω\OmegaΩ" is Mathlib's AnalyticOnNhd ℂ f Ω (analytic at every point of Ω\OmegaΩ), and values of fff outside Ω\OmegaΩ are unconstrained. Consequently the uniqueness part of the goal is stated as agreement on Ω\OmegaΩ (Set.EqOn f g Ω), not as equality of functions. The condition f′(z0)>0f'(z_0) > 0f′(z0​)>0 is written as Re⁡f′(z0)>0\operatorname{Re} f'(z_0) > 0Ref′(z0​)>0 and Im⁡f′(z0)=0\operatorname{Im} f'(z_0) = 0Imf′(z0​)=0, with f′f'f′ the complex derivative deriv f. The extended plane is Mathlib's OnePoint ℂ; "connected" is Mathlib's IsConnected (nonempty and preconnected). Uniform convergence on compact subsets is stated literally: for each compact K⊆ΩK \subseteq \OmegaK⊆Ω, uniform convergence on KKK.

The hypothesis Ω≠C\Omega \neq \mathbb CΩ=C is essential and cannot be dropped: by Liouville's theorem no nonconstant bounded analytic function on C\mathbb CC exists. The hypotheses are satisfiable (for example by Ω=D\Omega = \mathbb DΩ=D, z0=0z_0 = 0z0​=0), so the goal is not vacuous.

Needed infrastructure beyond Mathlib likely includes: the equivalence of Ahlfors' simple connectivity with the vanishing of winding numbers (Ch. 4, Theorem 14) and the general Cauchy theorem on such regions; Montel's theorem in the form above; Hurwitz's theorem. These pieces are reusable well beyond this mission, and contributions of any of them — as well as proofs of the milestones — are welcome.

Selected references

  • L. V. Ahlfors, Complex Analysis: An Introduction to the Theory of Analytic Functions of One Complex Variable, 3rd ed., McGraw-Hill, 1979. ISBN 0-07-000657-1.
  • The Mathlib Community, Mathlib4 documentation. https://leanprover-community.github.io/mathlib4_docs/
17 thms4 active usersReviewed
🏆Completed
Mathematical Physics·Captain: Lucas

String Theory (Tong) II: The Virasoro–Shapiro IntegralTextbook

Motivation

The Virasoro–Shapiro amplitude is the tree-level scattering amplitude of four tachyons in the closed bosonic string. Together with the Veneziano amplitude for open strings it is historically the first formula of string theory: both were written down around 1968–69 as closed-form guesses with striking properties, before anyone knew they described strings (Veneziano 1968, Virasoro 1969, Shapiro 1970). In David Tong's Cambridge Part III lecture notes on string theory, the amplitude is reduced in Section 6.2.2 to a single integral over the complex plane, and the whole physical content of the answer (the symmetry in the Mandelstam variables, the infinite tower of poles at the string masses, the soft high-energy behaviour) is read off from the closed form of that integral in terms of Euler's Gamma function, eq. (6.11). The evaluation itself is carried out in the Appendix, Section 6.5.

Setting

For complex numbers a,ba,ba,b define the Virasoro–Shapiro integral

C(a,b)=∫Cd2z ∣z∣2a−2 ∣1−z∣2b−2,C(a,b)=\int_{\mathbb C} d^2z\,|z|^{2a-2}\,|1-z|^{2b-2},C(a,b)=∫C​d2z∣z∣2a−2∣1−z∣2b−2,

where, following Tong's convention, d2z=2 dx dyd^2z = 2\,dx\,dyd2z=2dxdy for z=x+iyz=x+iyz=x+iy (twice Lebesgue measure on R2\mathbb R^2R2). Powers of the positive reals ∣z∣|z|∣z∣ and ∣1−z∣|1-z|∣1−z∣ are rw=ewlog⁡rr^{w}=e^{w\log r}rw=ewlogr. The integral converges absolutely exactly when

Re⁡a>0,Re⁡b>0,Re⁡c>0,where a+b+c=1,\operatorname{Re}a>0,\qquad \operatorname{Re}b>0,\qquad \operatorname{Re}c>0,\qquad\text{where } a+b+c=1,Rea>0,Reb>0,Rec>0,where a+b+c=1,

the three conditions controlling integrability near z=0z=0z=0, near z=1z=1z=1 and at z=∞z=\inftyz=∞ respectively. Γ\GammaΓ denotes Euler's Gamma function, defined by Γ(z)=∫0∞tz−1e−t dt\Gamma(z)=\int_0^\infty t^{z-1}e^{-t}\,dtΓ(z)=∫0∞​tz−1e−tdt for Re⁡z>0\operatorname{Re}z>0Rez>0 (eq. (6.26)) and continued analytically.

In the physics application a=1+α′p2⋅p3/2a=1+\alpha' p_2\cdot p_3/2a=1+α′p2​⋅p3​/2 and b=1+α′p3⋅p4/2b=1+\alpha' p_3\cdot p_4/2b=1+α′p3​⋅p4​/2 are determined by the tachyon momenta, and the three Gamma-function ratios become Γ(−1−α′s/4)/Γ(2+α′s/4)\Gamma(-1-\alpha's/4)/\Gamma(2+\alpha's/4)Γ(−1−α′s/4)/Γ(2+α′s/4) and its t,ut,ut,u analogues (eq. (6.12)).

Formalization targets

Goal: eq. (6.11)

For a+b+c=1a+b+c=1a+b+c=1 with Re⁡a,Re⁡b,Re⁡c>0\operatorname{Re}a,\operatorname{Re}b,\operatorname{Re}c>0Rea,Reb,Rec>0,

C(a,b)=2π Γ(a) Γ(b) Γ(c)Γ(1−a) Γ(1−b) Γ(1−c).C(a,b)=\frac{2\pi\,\Gamma(a)\,\Gamma(b)\,\Gamma(c)}{\Gamma(1-a)\,\Gamma(1-b)\,\Gamma(1-c)}.C(a,b)=Γ(1−a)Γ(1−b)Γ(1−c)2πΓ(a)Γ(b)Γ(c)​.

Milestones (Appendix 6.5, in the order of the notes)

  1. Eq. (6.27), the Euler Beta integral ∫01tx−1(1−t)y−1dt=Γ(x)Γ(y)/Γ(x+y)\int_0^1 t^{x-1}(1-t)^{y-1}dt=\Gamma(x)\Gamma(y)/\Gamma(x+y)∫01​tx−1(1−t)y−1dt=Γ(x)Γ(y)/Γ(x+y) (already published on the platform; used as a reference).
  2. The Gamma-function representation ∣z∣2a−2=Γ(1−a)−1∫0∞t−ae−∣z∣2t dt|z|^{2a-2}=\Gamma(1-a)^{-1}\int_0^\infty t^{-a}e^{-|z|^2t}\,dt∣z∣2a−2=Γ(1−a)−1∫0∞​t−ae−∣z∣2tdt.
  3. The Gaussian reduction of C(a,b)C(a,b)C(a,b) to a double integral over t,u>0t,u>0t,u>0.
  4. The change of variables t=αβt=\alpha\betat=αβ, u=(1−β)αu=(1-\beta)\alphau=(1−β)α.
  5. The α\alphaα-integral ∫0∞α−a−be−β(1−β)αdα=[β(1−β)]a+b−1Γ(1−a−b)\int_0^\infty \alpha^{-a-b}e^{-\beta(1-\beta)\alpha}d\alpha=[\beta(1-\beta)]^{a+b-1}\Gamma(1-a-b)∫0∞​α−a−be−β(1−β)αdα=[β(1−β)]a+b−1Γ(1−a−b).
  6. The Beta-integral form C(a,b)=2πΓ(c)Γ(1−a)Γ(1−b)∫01(1−β)a−1βb−1dβC(a,b)=\frac{2\pi\Gamma(c)}{\Gamma(1-a)\Gamma(1-b)}\int_0^1(1-\beta)^{a-1}\beta^{b-1}d\betaC(a,b)=Γ(1−a)Γ(1−b)2πΓ(c)​∫01​(1−β)a−1βb−1dβ.

Significance

The result. Eq. (6.11) is what turns the four-point function (6.10) into the Virasoro–Shapiro amplitude (6.12). Every property Tong extracts in Section 6.2.3 — the manifest s↔t↔us\leftrightarrow t\leftrightarrow us↔t↔u symmetry, the poles at s=4(n−1)/α′s=4(n-1)/\alpha's=4(n−1)/α′ reproducing the closed-string mass formula, and the exponential fall-off at high energy — is a property of the Gamma-function expression, not of the raw integral. The same integral (with general exponents) is the basic building block of Coulomb-gas computations in two-dimensional conformal field theory (Dotsenko–Fateev 1984).

Formalizing it. The identity is classical and its proof is elementary but analytically delicate. No machine-checked proof of the complex-plane integral is known to the mission author. A formal proof requires a reusable toolkit: Fubini–Tonelli manipulations of absolutely convergent iterated integrals with complex powers, two-dimensional Gaussian integrals, and a polar/affine change of variables on (0,∞)×(0,1)(0,\infty)\times(0,1)(0,∞)×(0,1). The Beta integral (milestone 1) is already in Mathlib.

Difficulty

Each step of the textbook computation interchanges the order of integration in an integral with integrable but unbounded singularities at z=0z=0z=0, z=1z=1z=1 and at infinity, so each interchange must be justified by absolute convergence under exactly the three conditions above. The naive approach of applying Fubini directly to the original integrand in Cartesian coordinates does not factor; the proof in the notes instead introduces two auxiliary Gamma-function integrals, making the integral four-dimensional before any variable is integrated out, and the justification of Tonelli for that four-dimensional integrand is the main technical point.

Formalization scope

The integral is TongString.virasoroShapiroIntegral a b, defined as 2 * ∫ z : ℂ, (‖z‖ : ℂ) ^ (2a-2) * (‖1-z‖ : ℂ) ^ (2b-2), the integral being the Bochner integral against Lebesgue measure on C≅R2\mathbb C\cong\mathbb R^2C≅R2; the factor 222 implements d2z=2 dx dyd^2z=2\,dx\,dyd2z=2dxdy. Complex powers are Mathlib's principal-branch cpow applied to non-negative real bases, which agrees with ewlog⁡re^{w\log r}ewlogr for r>0r>0r>0 (the point z=0z=0z=0, z=1z=1z=1 is a null set). The parameters a,b,ca,b,ca,b,c are complex; the notes use real Mandelstam-type exponents, which are a special case. Since the Bochner integral of a non-integrable function is 000 in Lean, every statement carries the convergence hypotheses; with them the integral is a genuine absolutely convergent integral, so the goal cannot be satisfied vacuously. The Gamma function is Mathlib's Complex.Gamma.

Contributions welcome: proofs of any milestone, and general lemmas on iterated integrals over (0,∞)2(0,\infty)^2(0,∞)2 with complex-power weights, which are reusable for other Selberg- and Dotsenko–Fateev-type integrals.

Selected references

  • D. Tong, String Theory, Cambridge Part III lecture notes, 2009, Sections 6.2.2 and 6.5. http://www.damtp.cam.ac.uk/user/tong/string.html (arXiv:0908.0333)
  • M. A. Virasoro, Alternative constructions of crossing-symmetric amplitudes with Regge behavior, Phys. Rev. 177 (1969) 2309. https://doi.org/10.1103/PhysRev.177.2309
  • J. A. Shapiro, Electrostatic analogue for the Virasoro model, Phys. Lett. B 33 (1970) 361. https://doi.org/10.1016/0370-2693(70)90157-8
  • J. Polchinski, String Theory, Vol. 1, Cambridge University Press, 1998, Section 6.6.
  • Vl. S. Dotsenko, V. A. Fateev, Conformal algebra and multipoint correlation functions in 2D statistical models, Nucl. Phys. B 240 (1984) 312. https://doi.org/10.1016/0550-3213(84)90269-4
8 thms4 active usersReviewed
Dynamical SystemsTopology·Captain: Lucas

Local Connectivity of the Mandelbrot Set (MLC)Open Problem

The set

For a complex parameter ccc, iterate the quadratic map

fc(z)=z2+cf_c(z) = z^2 + cfc​(z)=z2+c

starting at the critical point z=0z = 0z=0. The Mandelbrot set is the set of parameters for which this orbit stays bounded:

M={ c∈C : sup⁡k∈N∣fc k(0)∣<∞ }.M = \{\, c \in \mathbb{C} \ : \ \sup_{k \in \mathbb{N}} \left| f_c^{\,k}(0) \right| < \infty \,\}.M={c∈C : k∈Nsup​​fck​(0)​<∞}.

Equivalently -- and this is the first milestone of the mission -- c∈Mc \in Mc∈M if and only if ∣fc k(0)∣≤2|f_c^{\,k}(0)| \le 2∣fck​(0)∣≤2 for every kkk, which exhibits MMM as a compact subset of the plane.

MMM is the parameter-space picture of the simplest non-trivial family in complex dynamics, and it acts as a dictionary: the shape of MMM near a parameter ccc encodes the dynamics of fcf_cfc​ on its Julia set, so structural questions about MMM are questions about the whole quadratic family at once. Douady and Hubbard proved in 1982 that MMM is connected, by exhibiting a conformal isomorphism

Φ:C∖M⟶C∖D‾\Phi : \mathbb{C} \setminus M \longrightarrow \mathbb{C} \setminus \overline{\mathbb{D}}Φ:C∖M⟶C∖D

between the complement of MMM and the exterior of the closed unit disk.

The question

MLC conjecture. MMM is locally connected: every point of MMM has a neighbourhood basis, in the subspace topology, consisting of connected sets.

By Caratheodory's theorem, MLC is equivalent to the statement that Φ−1\Phi^{-1}Φ−1 extends continuously to the unit circle. That extension would deliver a complete combinatorial description of MMM -- the pinched disk model of Douady and Thurston -- in which every boundary point is labelled by the external rays landing on it. Two headline consequences follow: the density of hyperbolicity in the quadratic family (Fatou's conjecture: every quadratic polynomial can be perturbed to one with an attracting cycle), and zero area for ∂M\partial M∂M.

MLC has been open since the early 1980s and is regarded as the central problem of one-dimensional complex dynamics.

Timeline

  • 1982 -- Douady and Hubbard prove that MMM is connected, via the Boettcher uniformisation of its complement, and formulate MLC.
  • 1984/85 -- The Orsay notes develop the combinatorics of external rays and the pinched-disk model, and show that MLC implies the density of hyperbolicity in the quadratic family.
  • 1990 -- Yoccoz proves MLC at every finitely renormalizable parameter without an indifferent periodic point, introducing the Yoccoz puzzle and the rigidity techniques that dominate later work.
  • 1997 -- Lyubich extends local connectivity to infinitely renormalizable parameters of bounded type, using complex bounds for quadratic-like renormalization.
  • 1997 -- Graczyk-Swiatek and Lyubich prove density of hyperbolicity in the real quadratic family.
  • 1998 -- Shishikura proves that ∂M\partial M∂M has Hausdorff dimension 222, by parabolic implosion. Whether ∂M\partial M∂M has positive area remains open.
  • 2005 -- Buff and Cheritat construct quadratic Julia sets of positive area, showing that the analogous area question in the dynamical plane has a negative answer.
  • Today -- MLC is known at large classes of parameters, but the general case, and with it the density of hyperbolicity, remain open.

What this mission asks for

The goal theorem is MLC itself, in the form "the Mandelbrot set, as a topological subspace of C\mathbb{C}C, is a locally connected space".

The milestones are of three kinds, and are ordered accordingly:

  1. Foundations provable today -- the escape criterion (in the quadratic and the general unicritical degree) and compactness. These make the filter-theoretic definition usable and are the natural entry point for a solver new to the mission.
  2. Known theorems from the literature -- connectedness of MMM (Douady-Hubbard), the implication MLC ⇒\Rightarrow⇒ density of hyperbolicity (Douady-Hubbard), and dim⁡H(∂M)=2\dim_H(\partial M) = 2dimH​(∂M)=2 (Shishikura). These are hard but settled, and formalizing them builds the infrastructure -- Boettcher coordinates, external rays, parabolic implosion -- that any attack on the goal will need.
  3. The open companions -- density of hyperbolicity in the quadratic and unicritical families, zero area of ∂M\partial M∂M, and MLC for all Multibrot sets MnM_nMn​, the parameter sets of z↦zn+cz \mapsto z^n + cz↦zn+c.

All statements are phrased against a single shared definition file, so a solver can move between milestones without re-fixing conventions.

24 thms4 active usersReviewed
🏆Completed
Captain: Lucas

Rudin PMA XI: The Lebesgue TheoryTextbook

Motivation

Chapter 11 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) replaces the Riemann integral of Chapter 6 with the Lebesgue integral, and the reward is a theory of integration whose limit theorems have no superfluous hypotheses and whose space of square-integrable functions is complete. The chapter runs from set functions and outer measures, through the Carathéodory construction of Lebesgue measure, measurable functions and the integral, to the convergence theorems (monotone convergence, Fatou, dominated convergence) and finally to the space L2(μ)\mathscr{L}^2(\mu)L2(μ) and the Riesz–Fischer theorem (Theorem 11.42):

every Cauchy sequence in L2(μ) converges in the mean to an element of L2(μ).\text{every Cauchy sequence in } \mathscr{L}^2(\mu) \text{ converges in the mean to an element of } \mathscr{L}^2(\mu).every Cauchy sequence in L2(μ) converges in the mean to an element of L2(μ).

That completeness is what makes L2\mathscr{L}^2L2 a Hilbert space, and it is the reason the Fourier series of Chapter 8 converge in the mean to the functions they represent.

This mission is the eleventh and last in a series formalizing Rudin Chapters 1–11. It uses the Riemann–Stieltjes integral of Mission VI (for Theorem 11.33, comparing the two integrals) and the trigonometric Fourier series of Mission VIII (for the L2\mathscr{L}^2L2 reading of Parseval's theorem).

Setting

A set function on a ring R\mathscr{R}R of sets is countably additive if it takes the value ∑ϕ(An)\sum \phi(A_n)∑ϕ(An​) on a countable disjoint union. Rudin constructs an outer measure μ∗\mu^*μ∗ from such a ϕ\phiϕ by covering with elementary sets and taking an infimum, calls a set measurable when it is approximable by elementary sets in the metric d(A,B)=μ∗(A△B)d(A, B) = \mu^*(A \triangle B)d(A,B)=μ∗(A△B), and proves that the measurable sets form a σ\sigmaσ-algebra on which μ∗\mu^*μ∗ is countably additive (Theorem 11.10). A real function fff is measurable when {x:f(x)>a}\{x : f(x) > a\}{x:f(x)>a} is measurable for every aaa, and the integral ∫Ef dμ\int_E f\,d\mu∫E​fdμ is defined first for simple functions, then for nonnegative measurable functions as a supremum, and then for general fff by f=f+−f−f = f^+ - f^-f=f+−f−.

The space L2(μ)\mathscr{L}^2(\mu)L2(μ) consists of the measurable fff with ∫∣f∣2dμ<∞\int |f|^2 d\mu < \infty∫∣f∣2dμ<∞, normed by ∥f∥2=(∫∣f∣2dμ)1/2\|f\|_2 = (\int |f|^2 d\mu)^{1/2}∥f∥2​=(∫∣f∣2dμ)1/2; a sequence {fn}\{f_n\}{fn​} converges in the mean to fff if ∥fn−f∥2→0\|f_n - f\|_2 \to 0∥fn​−f∥2​→0.

Mathlib's measure theory is used wherever it is mathematically the same object: MeasureTheory.OuterMeasure and its Carathéodory σ\sigmaσ-algebra, MeasurableSet, Measurable, the lower Lebesgue integral ∫⁻ for nonnegative extended-real functions, the Bochner integral ∫ and Integrable for the general case. What is set up freshly is Rudin's L2\mathscr{L}^2L2 of functions — Rudin.MemL2, Rudin.L2Norm, Rudin.CauchyL2, Rudin.TendstoL2 — rather than Mathlib's quotient space Lp, because the Riesz–Fischer theorem as Rudin states it produces an honest limit function, and the ε-N phrasing of Cauchyness and of mean convergence is part of the statement.

Formalization targets

Goal — the Riesz–Fischer theorem (Theorem 11.42)

If {fn}\{f_n\}{fn​} is a Cauchy sequence in L2(μ)\mathscr{L}^2(\mu)L2(μ), then there exists f∈L2(μ)f \in \mathscr{L}^2(\mu)f∈L2(μ) with ∥fn−f∥2→0\|f_n - f\|_2 \to 0∥fn​−f∥2​→0: the space L2(μ)\mathscr{L}^2(\mu)L2(μ) is complete.

Rudin's proof extracts a subsequence with ∥fnk+1−fnk∥2<2−k\|f_{n_{k+1}} - f_{n_k}\|_2 < 2^{-k}∥fnk+1​​−fnk​​∥2​<2−k, sums the telescoping series, uses the monotone convergence theorem and the Schwarz inequality to show that the sum converges almost everywhere, and identifies the pointwise limit as the mean limit of the whole sequence. Every ingredient is a milestone of this mission.

Milestones

the measurable sets of an outer measure form a σ-algebra on which it is countably additive(11.10)\text{the measurable sets of an outer measure form a } \sigma\text{-algebra on which it is countably additive} \qquad (11.10)the measurable sets of an outer measure form a σ-algebra on which it is countably additive(11.10) sup⁡nfn and lim sup⁡nfn are measurable(11.17)\sup_n f_n \text{ and } \limsup_n f_n \text{ are measurable} \qquad (11.17)nsup​fn​ and nlimsup​fn​ are measurable(11.17) ∣f∣, f+g, fg are measurable(11.16, 11.18)|f|,\ f+g,\ fg \text{ are measurable} \qquad (11.16,\ 11.18)∣f∣, f+g, fg are measurable(11.16, 11.18) E↦∫Ef dμ is countably additive(11.24)E \mapsto \int_E f\,d\mu \text{ is countably additive} \qquad (11.24)E↦∫E​fdμ is countably additive(11.24) ∣∫f dμ∣≤∫∣f∣ dμ(11.26, 11.27)\left|\int f\,d\mu\right| \le \int |f|\,d\mu \qquad (11.26,\ 11.27)​∫fdμ​≤∫∣f∣dμ(11.26, 11.27) ∫lim⁡nfn dμ=lim⁡n∫fn dμ  for 0≤f1≤f2≤⋯(11.28)\int \lim_n f_n \,d\mu = \lim_n \int f_n\,d\mu \ \text{ for } 0 \le f_1 \le f_2 \le \cdots \qquad (11.28)∫nlim​fn​dμ=nlim​∫fn​dμ  for 0≤f1​≤f2​≤⋯(11.28) ∫∑nfn dμ=∑n∫fn dμ  for fn≥0(11.30)\int \sum_n f_n \,d\mu = \sum_n \int f_n\,d\mu \ \text{ for } f_n \ge 0 \qquad (11.30)∫n∑​fn​dμ=n∑​∫fn​dμ  for fn​≥0(11.30) ∫lim inf⁡nfn dμ≤lim inf⁡n∫fn dμ(11.31)\int \liminf_n f_n\,d\mu \le \liminf_n \int f_n\,d\mu \qquad (11.31)∫nliminf​fn​dμ≤nliminf​∫fn​dμ(11.31) dominated convergence(11.32)\text{dominated convergence} \qquad (11.32)dominated convergence(11.32) Riemann-integrable⇒Lebesgue-integrable, with the same integral(11.33)\text{Riemann-integrable} \Rightarrow \text{Lebesgue-integrable, with the same integral} \qquad (11.33)Riemann-integrable⇒Lebesgue-integrable, with the same integral(11.33) ∣∫fg dμ∣≤∥f∥2 ∥g∥2(11.35)\left|\int fg\,d\mu\right| \le \|f\|_2\,\|g\|_2 \qquad (11.35)​∫fgdμ​≤∥f∥2​∥g∥2​(11.35) continuous functions are dense in L2[a,b](11.38)\text{continuous functions are dense in } \mathscr{L}^2[a,b] \qquad (11.38)continuous functions are dense in L2[a,b](11.38) ∑ncn2=∫f2dμ for a complete orthonormal system(11.45)\sum_n c_n^2 = \int f^2 d\mu \text{ for a complete orthonormal system} \qquad (11.45)n∑​cn2​=∫f2dμ for a complete orthonormal system(11.45)

Significance

The Lebesgue theory is the point at which analysis acquires limit theorems that do not require uniform convergence. Monotone convergence, Fatou's lemma and dominated convergence are the three statements that make the integral usable in probability, in Fourier analysis and in the theory of partial differential equations, and the Riesz–Fischer theorem is what makes L2\mathscr{L}^2L2 a Hilbert space and therefore the natural home of Fourier expansions: Parseval's identity (11.45) is the assertion that the Fourier coefficient map is an isometry onto ℓ2\ell^2ℓ2.

Theorem 11.33 is the bridge back to the earlier chapters — every Riemann-integrable function is Lebesgue-integrable with the same integral, and a bounded function on [a,b][a, b][a,b] is Riemann-integrable exactly when it is continuous almost everywhere — so the two halves of the book agree wherever both apply.

Mathlib has an extensive measure theory and proves many of these results in considerable generality. This mission's contribution is to state them in Rudin's formulation, for Rudin's L2\mathscr{L}^2L2 of functions and with his explicit ε-N definitions, so that the chapter is available as a coherent, self-contained unit that matches the textbook line by line and links back to the Riemann–Stieltjes integral of Mission VI.

Difficulty

Individually, most milestones will reduce to Mathlib results after the correct dictionary is in place, and the interesting work is exactly in that translation: Rudin's measurability ({x : f(x) > a} measurable) versus Mathlib's Measurable, Rudin's integral of a nonnegative function versus ∫⁻ with values in ℝ≥0∞, Rudin's L2\mathscr{L}^2L2 of genuine functions versus Lp as a quotient by almost-everywhere equality. The last of these is what makes the goal theorem nontrivial to derive: Mathlib's completeness of Lp gives a limit class, and one must choose a measurable representative and verify Rudin's mean convergence with the concrete norm Rudin.L2Norm, which is Real.sqrt (∫ f²) and not an ENNReal quantity.

Theorem 11.33 (Riemann implies Lebesgue) and Theorem 11.38 (density of continuous functions) are the two other places where real work is required: the first has to connect the Chapter 6 definition of the Riemann integral with intervalIntegral, and the second is an approximation argument.

Formalization scope

Conventions fixed by this mission:

  • Measure-theoretic vocabulary is Mathlib's: MeasureTheory.Measure, MeasurableSet, Measurable, Integrable, ∫⁻ x, f x ∂μ for nonnegative ℝ≥0∞-valued integrands and ∫ x, f x ∂μ for the general real case. Rudin's Carathéodory construction is MeasureTheory.OuterMeasure.caratheodory.
  • Statements about suprema and upper limits of sequences of functions (11.17), and about term-by-term integration of series (11.30) and Fatou's theorem (11.31), use ℝ≥0∞-valued functions, matching Rudin's use of extended real values there.
  • Rudin.MemL2 μ f is "f is measurable and f² is integrable"; Rudin.L2Norm μ f is Real.sqrt (∫ x, (f x)^2 ∂μ); Rudin.CauchyL2 and Rudin.TendstoL2 are Rudin's ε-N Cauchy condition and mean convergence. No quotient is taken, so the goal theorem produces a function.
  • Theorem 11.33 is stated with Rudin.RiemannIntegrable and Rudin.RiemannIntegral from Mission VI, so the two integrals are literally compared.
  • Parseval (11.45) is stated for an arbitrary complete orthonormal system in L2(μ)\mathscr{L}^2(\mu)L2(μ), completeness being phrased as "a function orthogonal to every φn\varphi_nφn​ has norm zero"; the trigonometric case is Theorem 8.16 of Mission VIII.

Contributions of the convergence theorems (11.28, 11.31, 11.32) and of the Schwarz inequality (11.35) are especially useful, since the goal theorem consumes them directly.

Selected references

  • Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 11 (pp. 300–332).
  • Walter Rudin, Real and Complex Analysis, 3rd edition, McGraw-Hill, 1987, Chapters 1–3.
15 thms4 active usersReviewed
🏆Completed
Captain: Lucas

Rudin PMA VIII: Some Special FunctionsTextbook

Motivation

Chapter 8 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) puts the general theory of the preceding chapters to work on concrete functions. Power series are differentiated term by term; the exponential function is defined by its series and the trigonometric functions and the number π\piπ are extracted from it; the fundamental theorem of algebra is proved; Fourier series are introduced through general orthonormal systems; and the Gamma function is characterized by log-convexity.

The chapter's capstone is Parseval's theorem (Theorem 8.16): for Riemann-integrable 2π2\pi2π-periodic functions, the Fourier series converges in the mean square sense and the L2L^2L2 inner product is computed by the (absolutely convergent) sum of products of Fourier coefficients. It is the statement that the trigonometric system is not merely orthonormal but complete, and it is the finite-dimensional Pythagorean theorem carried to infinite dimensions.

This mission is the eighth in a series formalizing Rudin Chapters 1–11; it uses the convergence tests of Mission III and the uniform-convergence and approximation theorems of Mission VII, and it is the analytic counterpart of the abstract L2L^2L2 theory of Mission XI.

Setting

A power series is ∑cnxn\sum c_n x^n∑cn​xn; by Chapter 3 it converges on an interval (−R,R)(-R,R)(−R,R). A sequence {φn}\{\varphi_n\}{φn​} of complex functions on [a,b][a,b][a,b] is an orthonormal system if ∫abφnφm‾=0\int_a^b \varphi_n \overline{\varphi_m} = 0∫ab​φn​φm​​=0 for n≠mn \ne mn=m and ∫ab∣φn∣2=1\int_a^b |\varphi_n|^2 = 1∫ab​∣φn​∣2=1; the Fourier coefficients of fff relative to it are cn=∫abfφn‾c_n = \int_a^b f \overline{\varphi_n}cn​=∫ab​fφn​​, and the Fourier series is ∑cnφn\sum c_n \varphi_n∑cn​φn​. For the trigonometric system on [−π,π][-\pi,\pi][−π,π] one writes

cn=12π∫−ππf(x)e−inx dx,sN(f;x)=∑n=−NNcneinx,∥h∥2=(12π∫−ππ∣h∣2)1/2.c_n = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(x)e^{-inx}\,dx, \qquad s_N(f;x) = \sum_{n=-N}^{N} c_n e^{inx}, \qquad \|h\|_2 = \Big(\frac{1}{2\pi}\int_{-\pi}^{\pi}|h|^2\Big)^{1/2}.cn​=2π1​∫−ππ​f(x)e−inxdx,sN​(f;x)=n=−N∑N​cn​einx,∥h∥2​=(2π1​∫−ππ​∣h∣2)1/2.

A trigonometric polynomial is a finite sum ∑n=−NNcneinx\sum_{n=-N}^{N} c_n e^{inx}∑n=−NN​cn​einx. The Gamma function is Γ(x)=∫0∞tx−1e−t dt\Gamma(x) = \int_0^\infty t^{x-1}e^{-t}\,dtΓ(x)=∫0∞​tx−1e−tdt for x>0x > 0x>0.

Formalization targets

Goal — Parseval's theorem (Theorem 8.16)

For Riemann-integrable 2π2\pi2π-periodic fff and ggg with Fourier coefficients cnc_ncn​ and γn\gamma_nγn​:

lim⁡N→∞∥f−sN(f)∥2=0,12π∫−ππfgˉ=∑n=−∞∞cnγn‾,12π∫−ππ∣f∣2=∑n=−∞∞∣cn∣2.\lim_{N\to\infty}\|f - s_N(f)\|_2 = 0, \qquad \frac{1}{2\pi}\int_{-\pi}^{\pi} f\bar g = \sum_{n=-\infty}^{\infty} c_n \overline{\gamma_n}, \qquad \frac{1}{2\pi}\int_{-\pi}^{\pi} |f|^2 = \sum_{n=-\infty}^{\infty} |c_n|^2 .N→∞lim​∥f−sN​(f)∥2​=0,2π1​∫−ππ​fgˉ​=n=−∞∑∞​cn​γn​​,2π1​∫−ππ​∣f∣2=n=−∞∑∞​∣cn​∣2.

Milestones

term-by-term differentiation of a power series(8.1)\text{term-by-term differentiation of a power series} \qquad (8.1)term-by-term differentiation of a power series(8.1) ∑cn=C⇒∑cnxn→C as x→1−(8.2)\textstyle\sum c_n = C \Rightarrow \sum c_n x^n \to C \text{ as } x \to 1^- \qquad (8.2)∑cn​=C⇒∑cn​xn→C as x→1−(8.2) interchange of the order of summation in a double series(8.3)\text{interchange of the order of summation in a double series} \qquad (8.3)interchange of the order of summation in a double series(8.3) two power series agreeing on a set with a limit point have equal coefficients(8.5)\text{two power series agreeing on a set with a limit point have equal coefficients} \qquad (8.5)two power series agreeing on a set with a limit point have equal coefficients(8.5) E(z+w)=E(z)E(w), E′=E, growth of E(8.6)E(z+w) = E(z)E(w),\ E' = E,\ \text{growth of } E \qquad (8.6)E(z+w)=E(z)E(w), E′=E, growth of E(8.6) cos⁡(π/2)=0, cos⁡>0 on [0,π/2), ez+2πi=ez, ∣z∣=1⇒z=eit(8.7)\cos(\pi/2) = 0,\ \cos > 0 \text{ on } [0,\pi/2),\ e^{z+2\pi i} = e^z,\ |z| = 1 \Rightarrow z = e^{it} \qquad (8.7)cos(π/2)=0, cos>0 on [0,π/2), ez+2πi=ez, ∣z∣=1⇒z=eit(8.7) every nonconstant complex polynomial has a root(8.8)\text{every nonconstant complex polynomial has a root} \qquad (8.8)every nonconstant complex polynomial has a root(8.8) Fourier partial sums minimize the mean square error; Bessel’s inequality(8.11, 8.12)\text{Fourier partial sums minimize the mean square error; Bessel's inequality} \qquad (8.11,\ 8.12)Fourier partial sums minimize the mean square error; Bessel’s inequality(8.11, 8.12) a local Lipschitz condition at x forces sN(f;x)→f(x)(8.14)\text{a local Lipschitz condition at } x \text{ forces } s_N(f;x) \to f(x) \qquad (8.14)a local Lipschitz condition at x forces sN​(f;x)→f(x)(8.14) trigonometric polynomials approximate continuous periodic functions uniformly(8.15)\text{trigonometric polynomials approximate continuous periodic functions uniformly} \qquad (8.15)trigonometric polynomials approximate continuous periodic functions uniformly(8.15) Γ(x+1)=xΓ(x), Γ(n+1)=n!, log⁡Γ convex(8.18)\Gamma(x+1) = x\Gamma(x),\ \Gamma(n+1) = n!,\ \log\Gamma \text{ convex} \qquad (8.18)Γ(x+1)=xΓ(x), Γ(n+1)=n!, logΓ convex(8.18) Bohr–Mollerup: these three properties characterize Γ(8.19)\text{Bohr–Mollerup: these three properties characterize } \Gamma \qquad (8.19)Bohr–Mollerup: these three properties characterize Γ(8.19)

Significance

Parseval's theorem is the completeness statement for the trigonometric system: Bessel's inequality (8.12) holds for every orthonormal system, and equality for all fff is exactly what distinguishes a complete system. The proof shows how the pieces of the book fit together: it uses the approximation theorem 8.15 (itself a corollary of Stone–Weierstrass from Chapter 7), the minimizing property 8.11, and the Schwarz inequality of Chapter 1. Chapter 11 generalizes the conclusion to arbitrary complete orthonormal systems in L2L^2L2, where the Riemann-integrable hypothesis can be dropped.

The other milestones are where the elementary functions acquire their properties: the 2π2\pi2π-periodicity of the complex exponential, the definition of π\piπ as twice the first positive zero of the cosine, and the log-convexity characterization of the Gamma function are all established here rather than assumed.

Mathlib has the exponential and trigonometric functions, π\piπ, the fundamental theorem of algebra, the Gamma function with the Bohr–Mollerup theorem, and a Fourier theory on the additive circle. The work in this mission is to state Rudin's versions — 2π2\pi2π-periodic functions on R\mathbb{R}R, generic orthonormal systems on an interval, Riemann-integrable rather than square-integrable hypotheses — and connect them to that library.

Difficulty

Parseval's theorem is where an approximation argument in the uniform norm has to be converted into one in the mean square norm. The chain is: approximate fff in ∥⋅∥2\|\cdot\|_2∥⋅∥2​ by a continuous periodic hhh (a nontrivial step for a merely Riemann-integrable fff, and the place where the hypothesis is really used), approximate hhh uniformly by a trigonometric polynomial PPP, and then use the minimizing property of the partial sums to conclude ∥f−sN(f)∥2\|f - s_N(f)\|_2∥f−sN​(f)∥2​ is small. The first step has no analogue in the uniform theory and is the main obstacle; the third depends on sNs_NsN​ being an orthogonal projection, which is Theorem 8.11.

Formalization scope

Conventions fixed by this mission:

  • Integrals of complex-valued functions use Mathlib's interval integral ∫ x in a..b, f x, not the real-valued Riemann–Stieltjes integral built in Mission VI; for the Riemann-integrable integrands of this chapter the two agree. Integrability hypotheses are stated as IntervalIntegrable.
  • Fourier notions are Rudin.fourierCoeff, Rudin.fourierPartialSum, Rudin.L2Norm, Rudin.IsTrigPolynomial, Rudin.HasPeriodTwoPi, and, for general systems, Rudin.IsOrthonormalSystem and Rudin.genFourierCoeff, all following Rudin's normalizations (in particular the 1/2π1/2\pi1/2π in cnc_ncn​ and in ∥⋅∥2\|\cdot\|_2∥⋅∥2​).
  • Series of real numbers use Rudin.SeriesConvergesTo from Mission III, so that conditional convergence is expressible; the two-sided sums ∑n=−∞∞\sum_{n=-\infty}^{\infty}∑n=−∞∞​ of Parseval are stated as limits of the symmetric partial sums ∑∣n∣≤N\sum_{|n| \le N}∑∣n∣≤N​, as in Rudin.
  • exp⁡\expexp, cos⁡\coscos, π\piπ and Γ\GammaΓ are Mathlib's; Theorem 8.7 is therefore stated as the list of properties Rudin derives, not as a redefinition of π\piπ.

Selected references

  • Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 8 (pp. 172–201).
  • P. J. Davis, Leonhard Euler's integral: A historical profile of the Gamma function, American Mathematical Monthly 66 (1959), 849–869. https://doi.org/10.2307/2309786
19 thms4 active usersReviewed
🏆Completed
Differential Geometry·Captain: Lucas

Rudin PMA X: Integration of Differential FormsTextbook

Motivation

Chapter 10 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) builds the calculus of differential forms in Rn\mathbb{R}^nRn and proves the theorem that unifies the integral theorems of vector analysis. The fundamental theorem of calculus, the Green, divergence and classical Stokes theorems all say the same thing — that integrating a derivative over a region is the same as integrating the original object over the boundary of that region — and Stokes' theorem (Theorem 10.33),

∫Ψdω=∫∂Ψω,\int_\Psi d\omega = \int_{\partial \Psi} \omega ,∫Ψ​dω=∫∂Ψ​ω,

is that statement, once "region" is made precise as a chain of parametrized surfaces and "derivative" as the exterior derivative.

This mission is the tenth in a series formalizing Rudin Chapters 1–11; it uses the inverse function theorem and the several-variable calculus of Mission IX.

Setting

For an open E⊆RnE \subseteq \mathbb{R}^nE⊆Rn, a kkk-surface in EEE is a C′C'C′-mapping Φ\PhiΦ from a parameter domain D⊆RkD \subseteq \mathbb{R}^kD⊆Rk — a kkk-cell or the standard simplex Qk={u:ui≥0,∑ui≤1}Q^k = \{u : u_i \ge 0, \sum u_i \le 1\}Qk={u:ui​≥0,∑ui​≤1} — into EEE; surfaces are maps, not point sets. A kkk-form in EEE is a formal sum

ω=∑ai1⋯ik(x) dxi1∧⋯∧dxik\omega = \sum a_{i_1\cdots i_k}(\mathbf{x})\,dx_{i_1}\wedge\cdots\wedge dx_{i_k}ω=∑ai1​⋯ik​​(x)dxi1​​∧⋯∧dxik​​

with continuous coefficients, whose meaning is the rule assigning to each kkk-surface Φ\PhiΦ the number

∫Φω=∫D∑ai1⋯ik(Φ(u)) ∂(φi1,…,φik)∂(u1,…,uk) du.\int_\Phi \omega = \int_D \sum a_{i_1\cdots i_k}(\Phi(\mathbf{u}))\, \frac{\partial(\varphi_{i_1},\dots,\varphi_{i_k})}{\partial(u_1,\dots,u_k)}\,d\mathbf{u}.∫Φ​ω=∫D​∑ai1​⋯ik​​(Φ(u))∂(u1​,…,uk​)∂(φi1​​,…,φik​​)​du.

The exterior derivative of ω\omegaω is the (k+1)(k+1)(k+1)-form with coefficients DjaID_j a_IDj​aI​; the pullback ωT\omega_TωT​ along a differentiable TTT substitutes TTT into the coefficients and the differentials. A kkk-chain is a formal integer combination of kkk-surfaces with parameter domain QkQ^kQk, its integral is the corresponding combination of integrals, and its boundary ∂Ψ\partial\Psi∂Ψ is obtained from the alternating sum ∑j(−1)j\sum_j (-1)^j∑j​(−1)j of the faces of QkQ^kQk.

Formalization targets

Goal — Stokes' theorem (Theorem 10.33)

If Ψ\PsiΨ is a kkk-chain of class C′′C''C′′ in an open V⊆RnV \subseteq \mathbb{R}^nV⊆Rn and ω\omegaω is a (k−1)(k-1)(k−1)-form of class C′C'C′ in VVV, then

∫Ψdω=∫∂Ψω.\int_\Psi d\omega = \int_{\partial\Psi} \omega .∫Ψ​dω=∫∂Ψ​ω.

For k=n=1k = n = 1k=n=1 this is the fundamental theorem of calculus, for k=n=2k = n = 2k=n=2 Green's theorem, for k=n=3k = n = 3k=n=3 the divergence theorem, and for k=2k = 2k=2, n=3n = 3n=3 the theorem of Stokes.

Milestones

the iterated integrals of a continuous function on a cell agree(10.2)\text{the iterated integrals of a continuous function on a cell agree} \qquad (10.2)the iterated integrals of a continuous function on a cell agree(10.2) partitions of unity subordinate to an open cover of a compact set(10.8)\text{partitions of unity subordinate to an open cover of a compact set} \qquad (10.8)partitions of unity subordinate to an open cover of a compact set(10.8) ∫f(y) dy=∫f(T(x)) ∣JT(x)∣ dx(10.9)\int f(\mathbf{y})\,d\mathbf{y} = \int f(T(\mathbf{x}))\,|J_T(\mathbf{x})|\,d\mathbf{x} \qquad (10.9)∫f(y)dy=∫f(T(x))∣JT​(x)∣dx(10.9) d(dω)=0(10.20)d(d\omega) = 0 \qquad (10.20)d(dω)=0(10.20) (dω)T=d(ωT)(10.22c)(d\omega)_T = d(\omega_T) \qquad (10.22\mathrm{c})(dω)T​=d(ωT​)(10.22c) ∫T∘Φω=∫ΦωT(10.25)\int_{T\circ\Phi}\omega = \int_\Phi \omega_T \qquad (10.25)∫T∘Φ​ω=∫Φ​ωT​(10.25) reordering the vertices of a simplex multiplies the integral by the sign(10.27)\text{reordering the vertices of a simplex multiplies the integral by the sign} \qquad (10.27)reordering the vertices of a simplex multiplies the integral by the sign(10.27) Poincareˊ’s lemma: on a convex open set, closed forms are exact(10.39)\text{Poincaré's lemma: on a convex open set, closed forms are exact} \qquad (10.39)Poincareˊ’s lemma: on a convex open set, closed forms are exact(10.39)

Significance

Stokes' theorem is the organizing theorem of multivariable analysis; its formal content is that ddd and ∂\partial∂ are adjoint, which is also the starting point of de Rham cohomology. Poincaré's lemma is its local converse: on a convex set the only obstruction to a closed form being exact disappears, so the failure of exactness measures the shape of the domain. The change of variables theorem (10.9) is what makes integrals independent of the parametrization and is used in the proof of Stokes itself, and partitions of unity (10.8) are the standard device for passing from local to global statements.

Mathlib has a general change-of-variables theorem for the Lebesgue integral, smooth partitions of unity, and the theory of alternating forms and de Rham differentials on manifolds; it does not have Rudin's concrete apparatus of parametrized surfaces, affine chains, and their boundaries, nor a version of Stokes' theorem for such chains. This mission builds that apparatus and states the chapter's theorems for it; the definitions are reusable for any development that wants a hands-on, coordinate-based treatment of forms.

Difficulty

This is the most demanding mission of the series, for two reasons. First, the objects have to be set up before anything can be said: forms as coefficient families, their integrals as Jacobian integrals, chains, and the boundary operator with its signs. Second, Stokes' theorem is proved by reducing to a single oriented simplex, transporting along the parametrization by Theorem 10.25, and then computing the integral over QkQ^kQk by an iterated integral in which all but two terms of the boundary cancel; the cancellation is entirely a matter of getting the signs of the face maps right, and it is where a formalization will spend its time.

A further subtlety: with forms presented by coefficients indexed by all index tuples, the identity d(dω)=0d(d\omega) = 0d(dω)=0 is false coefficient-wise and true as an identity of forms. Since Rudin defines a form to be its integration functional, statements of the shape "this form vanishes" are formalized as "its integral over every surface vanishes", and that is how 10.20, 10.22(c) and 10.39 are stated here.

Formalization scope

Conventions fixed by this mission:

  • Points of Rn\mathbb{R}^nRn are Fin n → ℝ. A kkk-form is Rudin.KForm k n, a coefficient function indexed by all tuples Fin k → Fin n, following Rudin's equation (34).
  • Rudin.integralOverCell and Rudin.integralOverSimplex are Rudin's equation (35) for the two admissible parameter domains, with Rudin.jacobian the determinant of the matrix of partial derivatives. The integral over the parameter domain is the Lebesgue integral for the volume measure, which agrees with Rudin's Riemann integral for continuous integrands.
  • Rudin.extDeriv and Rudin.pullback are the exterior derivative and the pullback; Rudin.Chain, Rudin.Chain.integral and Rudin.Chain.boundary are chains with integer multiplicities, their integrals, and the boundary built from the faces of the standard simplex with Rudin's signs (−1)j(-1)^j(−1)j.
  • Regularity is ContDiff ℝ 1 and ContDiff ℝ 2 for Rudin's C′C'C′ and C′′C''C′′.
  • Equalities between forms are stated as equalities of their integrals over surfaces, as explained above; the goal theorem is an equality of two real numbers, so it is not vacuous.

Contributions of the supporting differential-form identities (10.20, 10.22, 10.25) are especially welcome, since they are exactly the lemmas the goal theorem consumes.

Selected references

  • Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 10 (pp. 245–299).
  • Michael Spivak, Calculus on Manifolds, W. A. Benjamin, 1965.
18 thms4 active usersReviewed
🏆Completed
Captain: Lucas

Rudin PMA V: DifferentiationTextbook

Motivation

Chapter 5 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) is the differential calculus of one real variable, developed from the definition of the derivative as a limit of difference quotients. Its organizing result is the mean value theorem and the family of consequences that follow from it: monotonicity criteria, L'Hospital's rule, and — the chapter's capstone — Taylor's theorem (Theorem 5.15), which approximates a function by a polynomial of degree n−1n-1n−1 and expresses the error exactly as a single nnn-th derivative evaluated at an unspecified intermediate point.

Taylor's theorem is what makes differentiability quantitatively useful. It is the tool that turns local smoothness into explicit error bounds, and the estimates of Chapter 8 for the exponential, trigonometric and Gamma functions all rest on it.

This mission is the fifth in a series formalizing Rudin Chapters 1–11; it uses the continuity and compactness results of Mission IV.

Setting

Let fff be real-valued on [a,b][a,b][a,b]. For x∈[a,b]x \in [a,b]x∈[a,b] the derivative is

f′(x)=lim⁡t→xf(t)−f(x)t−x,f'(x) = \lim_{t \to x} \frac{f(t) - f(x)}{t - x},f′(x)=t→xlim​t−xf(t)−f(x)​,

whenever the limit exists. Higher derivatives f′,f′′,…,f(n)f', f'', \dots, f^{(n)}f′,f′′,…,f(n) are defined by iteration; f(n)f^{(n)}f(n) exists on a set only if f(n−1)f^{(n-1)}f(n−1) exists in a neighbourhood of each of its points. fff has a local maximum at xxx if f(t)≤f(x)f(t) \le f(x)f(t)≤f(x) for all ttt near xxx.

Given a positive integer nnn and a point α\alphaα, the Taylor polynomial of fff at α\alphaα of degree n−1n-1n−1 is

P(t)=∑k=0n−1f(k)(α)k! (t−α)k.P(t) = \sum_{k=0}^{n-1} \frac{f^{(k)}(\alpha)}{k!}\,(t-\alpha)^k .P(t)=k=0∑n−1​k!f(k)(α)​(t−α)k.

Formalization targets

Goal — Taylor's theorem (Theorem 5.15)

Let f(n−1)f^{(n-1)}f(n−1) be continuous on [a,b][a,b][a,b], let f(n)(t)f^{(n)}(t)f(n)(t) exist for t∈(a,b)t \in (a,b)t∈(a,b), and let α≠β\alpha \ne \betaα=β be points of [a,b][a,b][a,b]. Then there is a point xxx strictly between α\alphaα and β\betaβ such that

f(β)  =  ∑k=0n−1f(k)(α)k! (β−α)k  +  f(n)(x)n! (β−α)n.f(\beta) \;=\; \sum_{k=0}^{n-1} \frac{f^{(k)}(\alpha)}{k!}\,(\beta-\alpha)^k \;+\; \frac{f^{(n)}(x)}{n!}\,(\beta-\alpha)^n .f(β)=k=0∑n−1​k!f(k)(α)​(β−α)k+n!f(n)(x)​(β−α)n.

For n=1n = 1n=1 this is exactly the mean value theorem.

Milestones

f differentiable at x⇒f continuous at x(5.2)f \text{ differentiable at } x \Rightarrow f \text{ continuous at } x \qquad (5.2)f differentiable at x⇒f continuous at x(5.2) local maximum at an interior x, f′(x) exists⇒f′(x)=0(5.8)\text{local maximum at an interior } x,\ f'(x) \text{ exists} \Rightarrow f'(x) = 0 \qquad (5.8)local maximum at an interior x, f′(x) exists⇒f′(x)=0(5.8) (f(b)−f(a)) g′(x)=(g(b)−g(a)) f′(x) for some x∈(a,b)(5.9)(f(b)-f(a))\,g'(x) = (g(b)-g(a))\,f'(x) \text{ for some } x \in (a,b) \qquad (5.9)(f(b)−f(a))g′(x)=(g(b)−g(a))f′(x) for some x∈(a,b)(5.9) f(b)−f(a)=(b−a)f′(x) for some x∈(a,b)(5.10)f(b) - f(a) = (b-a) f'(x) \text{ for some } x \in (a,b) \qquad (5.10)f(b)−f(a)=(b−a)f′(x) for some x∈(a,b)(5.10) f′≥0⇒f increasing;f′=0⇒f constant;f′≤0⇒f decreasing(5.11)f' \ge 0 \Rightarrow f \text{ increasing}; \quad f' = 0 \Rightarrow f \text{ constant}; \quad f' \le 0 \Rightarrow f \text{ decreasing} \qquad (5.11)f′≥0⇒f increasing;f′=0⇒f constant;f′≤0⇒f decreasing(5.11) f′(a)<A<f′(b)⇒f′(x)=A for some x∈(a,b)(5.12)f'(a) < A < f'(b) \Rightarrow f'(x) = A \text{ for some } x \in (a,b) \qquad (5.12)f′(a)<A<f′(b)⇒f′(x)=A for some x∈(a,b)(5.12) f,g→0 and f′/g′→A⇒f/g→A(5.13)f, g \to 0 \text{ and } f'/g' \to A \Rightarrow f/g \to A \qquad (5.13)f,g→0 and f′/g′→A⇒f/g→A(5.13) ∥f(b)−f(a)∥≤(b−a) ∥f′(x)∥ for some x∈(a,b), f vector-valued(5.19)\|f(b) - f(a)\| \le (b-a)\,\|f'(x)\| \text{ for some } x \in (a,b),\ f \text{ vector-valued} \qquad (5.19)∥f(b)−f(a)∥≤(b−a)∥f′(x)∥ for some x∈(a,b), f vector-valued(5.19)

Significance

The mean value theorem converts a hypothesis about derivatives into a statement about increments, and everything in the chapter is an application of that conversion. Monotonicity criteria (5.11) are the basis of every "the function is increasing, hence injective" argument, including the change of variable in Chapter 6. Darboux's theorem (5.12) shows that derivatives, though not necessarily continuous, cannot have simple discontinuities — a fact that is easy to state and impossible to guess from the definition. Theorem 5.19 is the form of the mean value theorem that survives for vector-valued functions: the equality is lost (there need be no single point where the vector increment is proportional to the derivative), and only the inequality remains; the same phenomenon dictates the statements of Chapter 9.

Mathlib contains the mean value theorem, L'Hospital's rule, and a Taylor theorem with various remainder forms. The value of this mission is a statement of Taylor's theorem in Rudin's exact formulation — arbitrary distinct endpoints α,β\alpha, \betaα,β in [a,b][a,b][a,b], hypotheses only on f(n−1)f^{(n-1)}f(n−1) and f(n)f^{(n)}f(n), an intermediate point xxx strictly between them — and the derivation of the chapter's other results in a form the later missions can quote.

Difficulty

Taylor's theorem is proved by choosing the constant MMM so that f(β)=P(β)+M(β−α)nf(\beta) = P(\beta) + M(\beta-\alpha)^nf(β)=P(β)+M(β−α)n and applying Rolle's theorem nnn times to g(t)=f(t)−P(t)−M(t−α)ng(t) = f(t) - P(t) - M(t-\alpha)^ng(t)=f(t)−P(t)−M(t−α)n; the bookkeeping is in tracking that g(k)(α)=0g^{(k)}(\alpha) = 0g(k)(α)=0 for k<nk < nk<n and that each application produces a new intermediate point strictly inside the previous interval. In a proof assistant the iteration is the awkward part: the induction is on nnn with the interval shrinking, and the statement must be general enough in α\alphaα and β\betaβ (either order) for the inductive step to apply. The hypothesis that f(n)f^{(n)}f(n) exists only on the open interval, while f(n−1)f^{(n-1)}f(n−1) is merely continuous on the closed one, must be preserved — strengthening it to CnC^nCn on [a,b][a,b][a,b] would make the statement weaker than Rudin's.

Formalization scope

Conventions fixed by this mission:

  • Derivatives are Mathlib's deriv and iteratedDeriv, which are total functions returning 0 where the function is not differentiable; every statement therefore carries explicit differentiability hypotheses exactly where Rudin states them.
  • Intervals are Set.Icc a b and Set.Ioo a b, and "for some xxx between α\alphaα and β\betaβ" is stated as an explicit disjunction, since the goal does not assume α<β\alpha < \betaα<β.
  • Vector-valued functions in 5.19 take values in EuclideanSpace ℝ (Fin k), and the conclusion is the inequality, not an equality — the equality version is false, as Rudin notes.
  • L'Hospital's rule is formalized in the 0/00/00/0 case at a finite left endpoint, which is the first case of Rudin's Theorem 5.13; the ∞\infty∞ case and the limits at ±∞\pm\infty±∞ are not part of this mission.
  • Local maxima in 5.8 are stated with an explicit radius, matching Rudin's Definition 5.7.

Selected references

  • Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 5 (pp. 103–119).
14 thms4 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Dual Moments and Risk Attitudes: The Rank-Dependent Utility Risk Premium of a Small Risk Is Variance Times Utility Risk Aversion Plus Maxiance Times Probability-Weighting Risk AversionResearch Paper

Motivation

The Pratt–Arrow risk premium is the basic local measure of risk aversion under expected utility (EU): a decision-maker with a twice differentiable utility UUU facing a small zero-mean risk ε~\tilde\varepsilonε~ at wealth w0w_0w0​ pays approximately

π≃σ22(−U′′(w0)U′(w0)),\pi \simeq \frac{\sigma^2}{2}\left(-\frac{U''(w_0)}{U'(w_0)}\right),π≃2σ2​(−U′(w0​)U′′(w0​)​),

variance times the index of absolute risk aversion (Pratt 1964; Arrow 1965). It is used throughout portfolio theory, insurance pricing and decision analysis, wherever a risk attitude has to be summarised by one number.

Much of decision theory since the 1980s replaces EU by rank-dependent utility (RDU, Quiggin 1982), which distorts cumulative probabilities by a probability weighting function hhh. Its special case with linear utility is Yaari's dual theory (DT, Yaari 1987). Under these models risk aversion comes from two sources, the curvature of UUU and the curvature of hhh, and the variance alone no longer measures how much a small risk costs. Eeckhoudt and Laeven (arXiv:1612.03347v2, published in Operations Research, 2022) identify the missing measure: the second dual moment, or maxiance, the expected best of two independent draws of the risk. They show that under DT the local risk premium is proportional to the maxiance, and that under RDU it is the sum of a variance term and a maxiance term.

Setting

A finite lottery lists outcomes x1≤⋯≤xnx_1 \le \dots \le x_nx1​≤⋯≤xn​ in increasing order with unconditional probability masses π1,…,πn\pi_1, \dots, \pi_nπ1​,…,πn​. Write Fi=π1+⋯+πiF_i = \pi_1 + \dots + \pi_iFi​=π1​+⋯+πi​ and F0=0F_0 = 0F0​=0. The masses need not sum to one: the risks below are attached to one branch of a lottery and carry only that branch's mass. An RDU decision-maker with utility UUU and weighting function hhh evaluates a lottery by (4.1):

∫U(x) dh(F(x))=∑i=1nU(xi)(h(Fi)−h(Fi−1)).\int U(x)\,\mathrm dh(F(x)) = \sum_{i=1}^n U(x_i)\bigl(h(F_i) - h(F_{i-1})\bigr).∫U(x)dh(F(x))=i=1∑n​U(xi​)(h(Fi​)−h(Fi−1​)).

DT is the case U(x)=xU(x) = xU(x)=x (3.1). The paper assumes that UUU is twice continuously differentiable with U′>0U' > 0U′>0, and that h:[0,1]→[0,1]h : [0,1] \to [0,1]h:[0,1]→[0,1] is twice continuously differentiable with h(0)=0h(0) = 0h(0)=0, h(1)=1h(1) = 1h(1)=1, h′>0h' > 0h′>0.

For a risk with cumulative distribution FFF and mean m=∫x dF(x)m = \int x\,\mathrm dF(x)m=∫xdF(x), the unconditional variance and maxiance are

m2=∫(x−m)2 dF(x),mˉ2=∫(x−m) d(F(x))2,m_2 = \int (x - m)^2\,\mathrm dF(x), \qquad \bar m_2 = \int (x - m)\,\mathrm d(F(x))^2,m2​=∫(x−m)2dF(x),mˉ2​=∫(x−m)d(F(x))2,

and Pr⁡\PrPr denotes the total unconditional mass. For a probability distribution, mˉ2=E[max⁡(ε~(1),ε~(2))]−E[ε~]\bar m_2 = \mathbb E[\max(\tilde\varepsilon^{(1)}, \tilde\varepsilon^{(2)})] - \mathbb E[\tilde\varepsilon]mˉ2​=E[max(ε~(1),ε~(2))]−E[ε~] (2.1).

Fix 0<p0<10 < p_0 < 10<p0​<1, 0<ε1<min⁡{p0,1−p0}0 < \varepsilon_1 < \min\{p_0, 1 - p_0\}0<ε1​<min{p0​,1−p0​}, ε2>0\varepsilon_2 > 0ε2​>0 and initial wealth w0w_0w0​. Lottery CCC pays w0−ε2w_0 - \varepsilon_2w0​−ε2​ with probability p0p_0p0​ and w0+ε2w_0 + \varepsilon_2w0​+ε2​ with probability 1−p01 - p_01−p0​. Lottery DDD takes mass ε1\varepsilon_1ε1​ from each branch of CCC and puts the released mass 2ε12\varepsilon_12ε1​ on a middle outcome w0+yw_0 + yw0​+y with −ε2<y<ε2-\varepsilon_2 < y < \varepsilon_2−ε2​<y<ε2​. The RDU risk premium is λ=0−y\lambda = 0 - yλ=0−y for the yyy that makes the decision-maker indifferent between CCC and DDD, that is, the solution of (4.2). The spread from DDD with y=0y = 0y=0 to CCC attaches to the middle branch the risk ε~12\tilde\varepsilon_{12}ε~12​, which takes the values ±ε2\pm\varepsilon_2±ε2​ each with unconditional probability ε1\varepsilon_1ε1​. The DT construction with lotteries AAA, BBB, outcomes ±1\pm1±1, premium ρ\rhoρ and risk ε~1\tilde\varepsilon_1ε~1​ (±1\pm1±1 with probability ε1\varepsilon_1ε1​ each) is the same with ε2=1\varepsilon_2 = 1ε2​=1 and U(x)=xU(x) = xU(x)=x.

Formalization targets

Goal: the RDU risk premium, (4.3)

As (ε1,ε2)→(0+,0+)(\varepsilon_1, \varepsilon_2) \to (0^+, 0^+)(ε1​,ε2​)→(0+,0+) jointly, with m2m_2m2​, mˉ2\bar m_2mˉ2​, Pr⁡\PrPr the moments of ε~12\tilde\varepsilon_{12}ε~12​,

λ=m22Pr⁡(−U′′(w0)U′(w0))+mˉ22Pr⁡(−h′′(p0)h′(p0))+o ⁣(m2Pr⁡+mˉ2Pr⁡).\lambda = \frac{m_2}{2\Pr}\left(-\frac{U''(w_0)}{U'(w_0)}\right) + \frac{\bar m_2}{2\Pr}\left(-\frac{h''(p_0)}{h'(p_0)}\right) + o\!\left(\frac{m_2}{\Pr} + \frac{\bar m_2}{\Pr}\right).λ=2Prm2​​(−U′(w0​)U′′(w0​)​)+2Prmˉ2​​(−h′(p0​)h′′(p0​)​)+o(Prm2​​+Prmˉ2​​).

Milestones

  1. The moments of ε~1\tilde\varepsilon_1ε~1​: mˉ2=2ε12\bar m_2 = 2\varepsilon_1^2mˉ2​=2ε12​, Pr⁡=2ε1\Pr = 2\varepsilon_1Pr=2ε1​ (§3, p. 6).
  2. The moments of ε~12\tilde\varepsilon_{12}ε~12​: m2=2ε1ε22m_2 = 2\varepsilon_1\varepsilon_2^2m2​=2ε1​ε22​, mˉ2=2ε12ε2\bar m_2 = 2\varepsilon_1^2\varepsilon_2mˉ2​=2ε12​ε2​, Pr⁡=2ε1\Pr = 2\varepsilon_1Pr=2ε1​ (footnote 21).
  3. DT indifference between AAA and BBB is equation (3.2).
  4. The explicit DT premium (3.3): ρ=(h(p0)−h(p0−ε1))−(h(p0+ε1)−h(p0))h(p0+ε1)−h(p0−ε1)\rho = \dfrac{(h(p_0) - h(p_0 - \varepsilon_1)) - (h(p_0 + \varepsilon_1) - h(p_0))}{h(p_0 + \varepsilon_1) - h(p_0 - \varepsilon_1)}ρ=h(p0​+ε1​)−h(p0​−ε1​)(h(p0​)−h(p0​−ε1​))−(h(p0​+ε1​)−h(p0​))​.
  5. The DT approximation (3.4): ρ=mˉ22Pr⁡(−h′′(p0)h′(p0))+o ⁣(mˉ2Pr⁡)\rho = \dfrac{\bar m_2}{2\Pr}\left(-\dfrac{h''(p_0)}{h'(p_0)}\right) + o\!\left(\dfrac{\bar m_2}{\Pr}\right)ρ=2Prmˉ2​​(−h′(p0​)h′′(p0​)​)+o(Prmˉ2​​) as ε1→0+\varepsilon_1 \to 0^+ε1​→0+.
  6. RDU indifference between CCC and DDD is equation (4.2), and it has exactly one solution λ\lambdaλ with −ε2<λ<ε2-\varepsilon_2 < \lambda < \varepsilon_2−ε2​<λ<ε2​.

Significance

The result. Formula (4.3) shows that, for a small zero-mean risk, an RDU decision-maker's premium splits additively into an EU part (variance times utility risk aversion −U′′/U′-U''/U'−U′′/U′) and a DT part (maxiance times probability-weighting risk aversion −h′′/h′-h''/h'−h′′/h′). Variance and maxiance appear on an equal footing, so the maxiance is the natural second risk measure for non-EU preferences, as the variance is for EU. The DT index −h′′(p0)/h′(p0)-h''(p_0)/h'(p_0)−h′′(p0​)/h′(p0​) plays the role of the Arrow–Pratt coefficient in the probability plane. The paper builds its global comparative risk aversion result (Proposition 5.1), its examples with Prelec's weighting function and its portfolio application on this local index.

Formalizing it. The result is proved in the paper by Taylor expansion, with "≃\simeq≃" left informal. This mission fixes the precise asymptotic meaning: a little-o remainder in the joint limit. It also makes definite the claims the paper takes for granted: that the premium exists and is unique, and that the moments of ε~1\tilde\varepsilon_1ε~1​ and ε~12\tilde\varepsilon_{12}ε~12​ take the stated values. No part of this development, nor any rank-dependent utility evaluation, is formalized on the platform or, as far as is known, elsewhere.

Difficulty

The obvious argument expands both sides of (4.2) and keeps "the second-order terms". This needs care on two counts. First, the premium is defined only implicitly, so its size has to be controlled before U(w0−λ)U(w_0 - \lambda)U(w0​−λ) is expanded: the λ2\lambda^2λ2 term is negligible only once λ=O(ε22+ε1ε2)\lambda = O(\varepsilon_2^2 + \varepsilon_1\varepsilon_2)λ=O(ε22​+ε1​ε2​) is known. Second, the two leading terms have different orders, ε22\varepsilon_2^2ε22​ and ε1ε2\varepsilon_1\varepsilon_2ε1​ε2​, and the remainder must be uniformly small relative to their sum in a two-parameter limit. The tempting reading "small variance and small maxiance" (p. 4) with ε1\varepsilon_1ε1​ fixed is false: at fixed ε1\varepsilon_1ε1​ the dual term carries a relative error of order ε1\varepsilon_1ε1​ that does not vanish as ε2→0\varepsilon_2 \to 0ε2​→0. The DT step (3.4) needs the explicit solution (3.3) and the strict positivity of h(p0+ε1)−h(p0−ε1)h(p_0 + \varepsilon_1) - h(p_0 - \varepsilon_1)h(p0​+ε1​)−h(p0​−ε1​).

Formalization scope

All quantities are real. A lottery is a pair of vectors indexed by Fin n\mathrm{Fin}\,nFinn; the evaluation (4.1) is the finite rank-dependent sum, with cumulative masses computed from the vector. The sum equals the Stieltjes integral only for outcomes in increasing order, so the premium predicates keep the page's ranges −1<x<1-1 < x < 1−1<x<1 and −ε2<y<ε2-\varepsilon_2 < y < \varepsilon_2−ε2​<y<ε2​, which order BBB and DDD. Initial wealth w0w_0w0​ is added to every outcome.

Committed conventions:

  • UUU is C2C^2C2 on R\mathbb RR with U′>0U' > 0U′>0 everywhere (footnote 1). hhh is C2C^2C2 on [0,1][0,1][0,1], maps [0,1][0,1][0,1] into itself, satisfies h(0)=0h(0) = 0h(0)=0, h(1)=1h(1) = 1h(1)=1, and has positive one-sided derivative within [0,1][0,1][0,1] (p. 5, footnote 12). These are the page's hypotheses, kept although local differentiability at w0w_0w0​ and p0p_0p0​ would suffice.
  • U′′(w0)U''(w_0)U′′(w0​), h′(p0)h'(p_0)h′(p0​), h′′(p0)h''(p_0)h′′(p0​) are ordinary iterated derivatives; p0p_0p0​ is interior.
  • Pinned reading of "≃\simeq≃". (4.3) is a little-o statement along the filter of (0,0)(0,0)(0,0) restricted to (0,∞)2(0,\infty)^2(0,∞)2, relative to m2/Pr⁡+mˉ2/Pr⁡m_2/\Pr + \bar m_2/\Prm2​/Pr+mˉ2​/Pr; (3.4) is the one-variable analogue as ε1→0+\varepsilon_1 \to 0^+ε1​→0+, relative to mˉ2/Pr⁡\bar m_2/\Prmˉ2​/Pr.
  • The premium is any function of (ε1,ε2)(\varepsilon_1, \varepsilon_2)(ε1​,ε2​) satisfying the indifference on the feasible region; milestone 6 shows it exists and is unique.
  • The moments m2m_2m2​, mˉ2\bar m_2mˉ2​, Pr⁡\PrPr in the goal are computed from ε~12\tilde\varepsilon_{12}ε~12​ by the definitions, not written as 2ε1ε222\varepsilon_1\varepsilon_2^22ε1​ε22​, 2ε12ε22\varepsilon_1^2\varepsilon_22ε12​ε2​, 2ε12\varepsilon_12ε1​. Pr⁡=2ε1>0\Pr = 2\varepsilon_1 > 0Pr=2ε1​>0 on the filter, so no division by zero enters.

A formalization that defined the premium by its Taylor polynomial, replaced λ\lambdaλ by the leading terms, or took the limit in ε2\varepsilon_2ε2​ alone would be trivial or false; the goal quantifies over every solution of the indifference and uses the joint limit.

Not formalized: the equivalence of (2.1) with the Stieltjes form, Proposition 5.1 (global comparative risk aversion), the examples of §6, the portfolio application of §7 and the non-binary generalisation of Appendix A.

Needed infrastructure: finite rank-dependent sums, Taylor expansion of C2C^2C2 functions with little-o remainders (Mathlib's taylor_mean_remainder family and Asymptotics), and the intermediate value theorem. Contributions welcome: proofs of the milestones, and a general Stieltjes-integral version of (4.1) for finitely supported distributions that would let later missions treat non-binary risks.

Selected references

  • L. R. Eeckhoudt, R. J. A. Laeven, Dual Moments and Risk Attitudes, arXiv:1612.03347v2, 2018 (the version formalized here; later published in Operations Research, 2022). https://arxiv.org/abs/1612.03347v2
  • J. W. Pratt, Risk Aversion in the Small and in the Large, Econometrica 32, 1964. https://doi.org/10.2307/1913738
  • J. Quiggin, A Theory of Anticipated Utility, Journal of Economic Behavior & Organization 3, 1982. https://doi.org/10.1016/0167-2681(82)90008-7
  • M. E. Yaari, The Dual Theory of Choice under Risk, Econometrica 55, 1987. https://doi.org/10.2307/1911158
  • K. J. Arrow, Aspects of the Theory of Risk-Bearing, Yrjö Jahnssonin Säätiö, Helsinki, 1965.
8 thms3 active usersReviewed
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

The Challenge of Understanding What Users Want: Inconsistent Preferences and Engagement Optimization III: Whether Utility Rises with Session Length Is Decided by Span Versus MoreishnessResearch Paper

Motivation

Platforms that rank content by engagement (time spent, items consumed) implicitly assume revealed preference: a user who stays longer is a user who is better off. Kleinberg, Mullainathan and Raghavan (arXiv:2202.11776, Management Science 2023, doi:10.1287/mnsc.2022.03683) model a user with inconsistent preferences, a forward-looking system 2 and an impulsive system 1, and show that engagement and utility can come apart. Because utility cannot be read off behavioural data, platforms also run post-session surveys. Section 5.1 of the paper asks what such surveys can reveal: if a survey gives an estimate of the utility SSS of a session, does E[S∣T=t]\mathbb E[S\mid T=t]E[S∣T=t] rise or fall with the session length ttt, and what does that say about the content? Theorem 5.1 answers this in terms of two content parameters, the span qqq and the moreishness ppp.

Setting

A session proceeds in two phases (§2.1, pp. 5–7).

  • Span. After each item, system 2 remains interested with probability qqq. The number of items it enjoys, TqT_qTq​, has the geometric law on {1,2,… }\{1,2,\dots\}{1,2,…}: Pr⁡[Tq=τ]=qτ−1(1−q)\Pr[T_q=\tau]=q^{\tau-1}(1-q)Pr[Tq​=τ]=qτ−1(1−q).
  • Moreishness. Once system 2 is done, system 1 keeps the user on: with probability ppp at each step, the first one included, it consumes one more item. With Tp:=T−Tq+1T_p:=T-T_q+1Tp​:=T−Tq​+1, Pr⁡[Tp=k]=pk−1(1−p)\Pr[T_p=k]=p^{k-1}(1-p)Pr[Tp​=k]=pk−1(1−p) for k≥1k\ge1k≥1.
  • TqT_qTq​ and TpT_pTp​ are independent, and the session length is T=Tq+Tp−1∈{1,2,… }T=T_q+T_p-1\in\{1,2,\dots\}T=Tq​+Tp​−1∈{1,2,…}. For 1≤τ≤t1\le\tau\le t1≤τ≤t,
Pr⁡[Tq=τ∩Tp=t−τ+1]=qτ−1(1−q) pt−τ(1−p).\Pr[T_q=\tau\cap T_p=t-\tau+1]=q^{\tau-1}(1-q)\,p^{t-\tau}(1-p).Pr[Tq​=τ∩Tp​=t−τ+1]=qτ−1(1−q)pt−τ(1−p).
  • Utility. Each item system 2 enjoys has value of mean vˉ\bar vvˉ; every step costs the outside option WWW. The paper's equations (8)–(9) give
E[S∣T=t]=vˉ E[Tq∣T=t]−Wt,E[Tq∣T=t]=∑τ=1tτPr⁡[Tq=τ∩Tp=t−τ+1]∑τ′=1tPr⁡[Tq=τ′∩Tp=t−τ′+1].\mathbb E[S\mid T=t]=\bar v\,\mathbb E[T_q\mid T=t]-Wt,\qquad \mathbb E[T_q\mid T=t]=\frac{\sum_{\tau=1}^{t}\tau\Pr[T_q=\tau\cap T_p=t-\tau+1]}{\sum_{\tau'=1}^{t}\Pr[T_q=\tau'\cap T_p=t-\tau'+1]}.E[S∣T=t]=vˉE[Tq​∣T=t]−Wt,E[Tq​∣T=t]=∑τ′=1t​Pr[Tq​=τ′∩Tp​=t−τ′+1]∑τ=1t​τPr[Tq​=τ∩Tp​=t−τ+1]​.

The Lean development names these objects geomLaw (the law gr(k)=rk−1(1−r)g_r(k)=r^{k-1}(1-r)gr​(k)=rk−1(1−r), k≥1k\ge1k≥1), jointMass, condMeanTq (9) and condUtility (8), all in the namespace EngagementOpt.Survey. Write f(t)=E[S∣T=t]f(t)=\mathbb E[S\mid T=t]f(t)=E[S∣T=t] and

φ(x)=x+1x(1−ln⁡(x+1)x)\varphi(x)=\frac{x+1}{x}\left(1-\frac{\ln(x+1)}{x}\right)φ(x)=xx+1​(1−xln(x+1)​)

(phi), the function of the paper's (11) and Lemma D.1.

Formalization targets

Goal: Theorem 5.1 (p. 19)

Assume 0<p<10<p<10<p<1, 0<q<10<q<10<q<1, vˉ≥0\bar v\ge0vˉ≥0 and W>0W>0W>0. For integer session lengths t≥1t\ge1t≥1:

  1. q=pq=pq=p:   (∀t≥1, f(t)<f(t+1))  ⟺  vˉ>2W\;\bigl(\forall t\ge1,\ f(t)<f(t+1)\bigr)\iff \bar v>2W(∀t≥1, f(t)<f(t+1))⟺vˉ>2W.
  2. q>pq>pq>p: (a) if vˉ>2W\bar v>2Wvˉ>2W then f(t)<f(t+1)f(t)<f(t+1)f(t)<f(t+1) for all t≥1t\ge1t≥1; (b) if vˉ>W\bar v>Wvˉ>W there is t∗t^*t∗ with f(t)<f(t+1)f(t)<f(t+1)f(t)<f(t+1) for all t>t∗t>t^*t>t∗.
  3. q<pq<pq<p: (a) if vˉ<2W\bar v<2Wvˉ<2W then f(t+1)<f(t)f(t+1)<f(t)f(t+1)<f(t) for all t≥1t\ge1t≥1; (b) there is t∗t^*t∗ with f(t+1)<f(t)f(t+1)<f(t)f(t+1)<f(t) for all t>t∗t>t^*t>t∗.

The goal is the conjunction of the five claims.

Milestones, in proof order

  • (9) with p=qp=qp=q (p. 20): E[Tq∣Tq+Tp=t+1]=t+12\mathbb E[T_q\mid T_q+T_p=t+1]=\frac{t+1}{2}E[Tq​∣Tq​+Tp​=t+1]=2t+1​.
  • (10) (p. 21): f(t)=vˉt+12−Wtf(t)=\bar v\frac{t+1}{2}-Wtf(t)=vˉ2t+1​−Wt if p=qp=qp=q, and f(t)=vˉ(tβtβt−1−1β−1)−Wtf(t)=\bar v\bigl(\frac{t\beta^t}{\beta^t-1}-\frac1{\beta-1}\bigr)-Wtf(t)=vˉ(βt−1tβt​−β−11​)−Wt with β=q/p\beta=q/pβ=q/p if p≠qp\ne qp=q.
  • (11) (p. 21): extending (10) to real s>0s>0s>0, its derivative at ttt is vˉ φ(βt−1)−W\bar v\,\varphi(\beta^t-1)-Wvˉφ(βt−1)−W.
  • Proof of Lemma D.1 (pp. 40–41): φ(x)→12\varphi(x)\to\frac12φ(x)→21​ as x→0x\to0x→0; (x+2)ln⁡(x+1)−2x(x+2)\ln(x+1)-2x(x+2)ln(x+1)−2x is ≥0\ge0≥0 for x>0x>0x>0 and ≤0\le0≤0 on (−1,0)(-1,0)(−1,0).
  • Lemma D.1 (p. 40): φ(x)≥12\varphi(x)\ge\frac12φ(x)≥21​ for x>0x>0x>0 and φ(x)≤12\varphi(x)\le\frac12φ(x)≤21​ for −1<x<0-1<x<0−1<x<0.
  • Proof of Theorem 5.1 (p. 22): φ(x)→1\varphi(x)\to1φ(x)→1 as x→∞x\to\inftyx→∞ and φ(x)→0\varphi(x)\to0φ(x)→0 as x→−1+x\to-1^+x→−1+.

Significance

The theorem describes how span and moreishness affect the relation between survey utility and session length. When q>pq>pq>p and vˉ>W\bar v>Wvˉ>W, utility eventually increases; when q<pq<pq<p, it eventually decreases. In the symmetric case q=pq=pq=p, the sign is decided by vˉ\bar vvˉ against 2W2W2W alone. These are conditional predictions for survey data, rather than a converse that identifies qqq and ppp from the sign by itself.

The result is proved in the paper; it has no machine-checked proof. Formalizing it checks the Bayes computation (9)–(10), including an arithmetico-geometric sum and a printed exponent slip on p. 20 (pt+1p^{t+1}pt+1 for pt−1p^{t-1}pt−1, harmless because it cancels), and the real-analytic Lemma D.1. It also makes explicit one hypothesis the printed theorem omits (below).

Difficulty

The closed form (10) needs the sum ∑τ=1tτβτ\sum_{\tau=1}^t\tau\beta^{\tau}∑τ=1t​τβτ and care with βt−1\beta^t-1βt−1 in denominators. The main obstacle is that monotonicity is a statement about integer ttt, while the natural tool, the derivative φ(βt−1)\varphi(\beta^t-1)φ(βt−1) of the real extension, lives on real ttt; the integer statement must be recovered from bounds on φ\varphiφ over whole intervals, not at single points. Lemma D.1 is a two-level sign analysis of a function with a removable singularity at 000, and the two limits at ∞\infty∞ and at −1+-1^+−1+ are of L'Hôpital type. The obvious argument for 2(b), "φ→1>W/vˉ\varphi\to1>W/\bar vφ→1>W/vˉ", silently uses vˉ>W\bar v>Wvˉ>W; without it, since φ<1\varphi<1φ<1 on (0,∞)(0,\infty)(0,∞), the claim fails.

Formalization scope

  • Explicit discrete model. (8) and (9) are taken as the definitions of E[S∣T=t]\mathbb E[S\mid T=t]E[S∣T=t] and E[Tq∣T=t]\mathbb E[T_q\mid T=t]E[Tq​∣T=t]; no measure-theoretic conditioning is involved. Independence of TqT_qTq​ and TpT_pTp​ is the product form of jointMass.
  • Integer time in the goal. t∈Nt\in\mathbb Nt∈N, t≥1t\ge1t≥1 (the support of TTT). "Increases with ttt" is f(t)<f(t+1)f(t)<f(t+1)f(t)<f(t+1), strictly; "for t>t∗t>t^*t>t∗" is ∃t0∈N, ∀t>t0\exists t_0\in\mathbb N,\ \forall t>t_0∃t0​∈N, ∀t>t0​. Real ttt and the real power βt\beta^tβt appear only in the milestone (11).
  • Hypotheses. 0<p<10<p<10<p<1 and 0<q<10<q<10<q<1 are the paper's standing assumptions; they exclude the degenerate p=q=0p=q=0p=q=0, where T=1T=1T=1 almost surely and Lean's x/0=0x/0=0x/0=0 would make claim 1 false. The paper's parameter space has vˉ≥0\bar v\ge0vˉ≥0 (p. 15). W>0W>0W>0 is implicit (§2.1 normalizes W=1W=1W=1). vˉ>W\bar v>Wvˉ>W in 2(b) is added: the proof uses it on p. 22 ("since vˉ>W\bar v>Wvˉ>W by assumption") and 2(b) is false without it.
  • Domain of φ\varphiφ. Every statement about φ\varphiφ restricts xxx to x>0x>0x>0, −1<x<0-1<x<0−1<x<0, a punctured neighbourhood of 000, the right neighbourhood of −1-1−1, or x→∞x\to\inftyx→∞, so the junk values at x=0x=0x=0 and x≤−1x\le-1x≤−1 never enter.
  • Ruled out. Stating the goal for real ttt, dropping p,q>0p,q>0p,q>0, or reading 1 as a one-way implication all give a different theorem.
  • Infrastructure. Mathlib's Real.log, Real.rpow, HasDerivAt, Filter.Tendsto and finite sums suffice. The inequality ln⁡(1+x)≥2x/(x+2)\ln(1+x)\ge 2x/(x+2)ln(1+x)≥2x/(x+2) for x≥0x\ge0x≥0 is in Mathlib (Real.le_log_one_add_of_nonneg). Contributions of any milestone, of alternative discrete proofs of monotonicity that avoid the real extension, and of the full goal are welcome.

Selected references

  • J. Kleinberg, S. Mullainathan, M. Raghavan, The Challenge of Understanding What Users Want: Inconsistent Preferences and Engagement Optimization, Management Science, 2023. arXiv:2202.11776v3 (cited version): https://arxiv.org/abs/2202.11776 ; https://doi.org/10.1287/mnsc.2022.03683
  • G. S. Becker, K. M. Murphy, A Theory of Rational Addiction, Journal of Political Economy 96(4), 1988. https://doi.org/10.1086/261558
14 thms3 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games 1: The Price of Anarchy Is Hölder Continuous with Exponent 1/2 at Every Game with Costs Lipschitz on [0, T(d)]Research Paper

Motivation

The price of anarchy (PoA) of a nonatomic congestion game is the ratio of the total cost of a Wardrop equilibrium to the minimum possible total cost. It quantifies how much selfish routing loses compared with central coordination, and it has been studied intensively since Koutsoupias and Papadimitriou (1999) and Roughgarden and Tardos (2002), mostly through worst-case bounds over classes of cost functions.

Worst-case bounds say nothing about how the PoA of one particular network behaves when its data change. In transport applications both the cost functions (capacities, tolls, travel-time models) and the demands are estimated, so the PoA is only useful if small errors in the data cause small errors in the PoA. Wu and Möhring (arXiv:2007.13979, published in Mathematics of Operations Research, 2023) study this sensitivity question in a setting where cost functions and demands change simultaneously. Earlier sensitivity results changed only the demands, with the cost functions fixed: Englert, Franke and Olbrich (2010) bounded the growth of the PoA of a single-O/D network with polynomial costs of degree at most β\betaβ by a factor (1+ϵ)β(1+\epsilon)^\beta(1+ϵ)β when the demand grows by a factor 1+ϵ1+\epsilon1+ϵ; Takalloo and Kwon (2020) extended this to several O/D pairs whose demands are scaled together; and Cominetti, Dose and Scarsini (arXiv:1907.10101) studied differentiability of the PoA as a function of the demand of a single O/D pair. The main theorem of the paper, Theorem 9, is the subject of this mission.

Setting

A network consists of a finite set AAA of arcs, a finite non-empty set K\mathcal KK of origin–destination (O/D) pairs, and for every k∈Kk \in \mathcal Kk∈K a non-empty set Sk\mathcal S_kSk​ of paths; each path is a non-empty set of arcs. From §3.1 onward the paper also assumes every arc lies on some path and every Sk\mathcal S_kSk​ has at least two paths (Condition 1).

A game Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) on the network consists of cost functions τa:[0,∞)→[0,∞)\tau_a : [0,\infty) \to [0,\infty)τa​:[0,∞)→[0,∞), one per arc, that are continuous and non-decreasing, and demands dk≥0d_k \ge 0dk​≥0, one per O/D pair. The total demand is T(d)=∑kdkT(d) = \sum_k d_kT(d)=∑k​dk​. The game space G(G,K,S)\mathcal G(G,\mathcal K,\mathcal S)G(G,K,S) consists of the games with T(d)>0T(d) > 0T(d)>0 and τa(x)>0\tau_a(x) > 0τa​(x)>0 for all x∈(0,T(d)]x \in (0, T(d)]x∈(0,T(d)].

A flow f=(fs)f = (f_s)f=(fs​) assigns a non-negative amount to every path, with ∑s∈Skfs=dk\sum_{s\in\mathcal S_k} f_s = d_k∑s∈Sk​​fs​=dk​. Its arc flows are fa=∑s∋afsf_a = \sum_{s \ni a} f_sfa​=∑s∋a​fs​, its path costs τs(f)=∑a∈sτa(fa)\tau_s(f) = \sum_{a\in s}\tau_a(f_a)τs​(f)=∑a∈s​τa​(fa​), and its total cost

C(Γ,f)=∑a∈Afa τa(fa).C(\Gamma, f) = \sum_{a\in A} f_a\,\tau_a(f_a).C(Γ,f)=a∈A∑​fa​τa​(fa​).

A Wardrop equilibrium (WE) is a flow in which every used path of a pair is a cheapest path of that pair. The SO cost C∗(Γ)\mathcal C^*(\Gamma)C∗(Γ) is the minimum total cost over all flows, the WE cost C~(Γ)\tilde{\mathcal C}(\Gamma)C~(Γ) is the total cost of a WE flow (all WE flows have the same cost), and

ρ(Γ)=C~(Γ)C∗(Γ).\rho(\Gamma) = \frac{\tilde{\mathcal C}(\Gamma)}{\mathcal C^*(\Gamma)}.ρ(Γ)=C∗(Γ)C~(Γ)​.

Games are compared by the distance

∥Γ−Γ′∥=max⁡{∥d−d′∥∞, max⁡a∈Amax⁡x∈[0,min⁡{T(d),T(d′)}]∣τa(x)−σa(x)∣, ∥τ(T(d))−σ(T(d′))∥∞}\|\Gamma - \Gamma'\| = \max\Big\{\|d-d'\|_\infty,\ \max_{a\in A}\max_{x\in[0,\min\{T(d),T(d')\}]}|\tau_a(x) - \sigma_a(x)|,\ \|\tau(T(d)) - \sigma(T(d'))\|_\infty\Big\}∥Γ−Γ′∥=max{∥d−d′∥∞​, a∈Amax​x∈[0,min{T(d),T(d′)}]max​∣τa​(x)−σa​(x)∣, ∥τ(T(d))−σ(T(d′))∥∞​}

for Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) and Γ′=(σ,d′)\Gamma' = (\sigma, d')Γ′=(σ,d′). It compares cost functions only on the range of flow values both games can produce, plus the values at the respective total demands. A function hhh is Lipschitz continuous on [0,T][0,T][0,T] with constant MMM if ∣h(x)−h(y)∣≤M∣x−y∣|h(x) - h(y)| \le M|x-y|∣h(x)−h(y)∣≤M∣x−y∣ for all x,y∈[0,T]x, y \in [0,T]x,y∈[0,T].

Formalization targets

Goal: Theorem 9 (p. 26)

Let Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) be a game of the game space whose cost functions are Lipschitz continuous on [0,T(d)][0, T(d)][0,T(d)]. Then there are ϵΓ>0\epsilon_\Gamma > 0ϵΓ​>0 and κΓ>0\kappa_\Gamma > 0κΓ​>0, depending only on Γ\GammaΓ, such that

∣ρ(Γ)−ρ(Γ′)∣≤κΓ ∥Γ−Γ′∥1/2for every game Γ′ of the game space with ∥Γ−Γ′∥<ϵΓ.|\rho(\Gamma) - \rho(\Gamma')| \le \kappa_\Gamma\,\|\Gamma - \Gamma'\|^{1/2}\quad\text{for every game } \Gamma' \text{ of the game space with } \|\Gamma - \Gamma'\| < \epsilon_\Gamma.∣ρ(Γ)−ρ(Γ′)∣≤κΓ​∥Γ−Γ′∥1/2for every game Γ′ of the game space with ∥Γ−Γ′∥<ϵΓ​.

The goal fixes the exponent 1/21/21/2 and leaves the radius and the constant existential, which is the form the paper claims.

Milestones

  1. Lemma 1a)–c) (p. 13): properties of ϵ\epsilonϵ-approximate WE flows, ending with
∣C(Γ,f)−C(Γ,f~)∣≤∣A∣Mϵ T(d)+ϵ|C(\Gamma, f) - C(\Gamma, \tilde f)| \le |A|\sqrt{M\epsilon}\,T(d) + \epsilon∣C(Γ,f)−C(Γ,f~​)∣≤∣A∣Mϵ​T(d)+ϵ

for an ϵ\epsilonϵ-approximate WE flow fff and a WE flow f~\tilde ff~​ when all costs are MMM-Lipschitz on [0,T(d)][0,T(d)][0,T(d)]. 2. Lemma 10a)–d) (p. 27): on a demand slice (games with a common demand vector www), C∗\mathcal C^*C∗ is Lipschitz, WE flows of one game are ∣A∣ T(w) ∥Γ1−Γ2∥|A|\,T(w)\,\|\Gamma_1-\Gamma_2\|∣A∣T(w)∥Γ1​−Γ2​∥-approximate WE flows of the other, and C~\tilde{\mathcal C}C~ and ρ\rhoρ are Hölder with exponent 1/21/21/2 with explicit constants. 3. Lemma 11a)–c) (p. 31): on a cost slice (games with a common cost vector and T(w′)≤T(w)T(w') \le T(w)T(w′)≤T(w)), explicit Hölder bounds of exponent 1/21/21/2 for C~\tilde{\mathcal C}C~ and ρ\rhoρ and a Lipschitz bound for C∗\mathcal C^*C∗.

Significance

Theorem 9 is the first pointwise Hölder continuity result for the PoA on the whole game space, with demands and costs perturbed together. Its hypothesis is mild (Lipschitz costs on a compact interval, which covers polynomial, BPR-type and piecewise linear costs), and such games are dense in the game space. Together with Theorem 8 of the same paper, which shows that no uniform Hölder bound exists, it describes exactly what kind of stability the PoA has: local, with a constant depending on the game, and exponent 1/21/21/2 in general. The explicit constants of Lemmas 10 and 11 give computable error bounds for the PoA of a network whose data are known only approximately.

The result is proved in the paper; no machine-checked proof exists. This mission formalizes the statement and the explicit slice estimates the proof rests on. Lemma 1 is a self-contained statement about approximate Wardrop equilibria that is useful well beyond this paper, for instance for analysing iterative traffic-assignment algorithms, which only ever produce approximate equilibria.

Difficulty

The obvious approach compares an equilibrium of Γ\GammaΓ with an equilibrium of Γ′\Gamma'Γ′ directly. This fails because the two games have different demand vectors, so their flows live in different polytopes: an equilibrium of one game is not even a flow of the other. The paper separates the perturbation into a change of costs at fixed demand and a change of demand at fixed costs, through an auxiliary game, and each half needs its own argument. On a demand slice an equilibrium of one game is only an approximate equilibrium of the other, and the passage from an approximate equilibrium to its cost loses a square root (Lemma 1c), which is tight by Example 2). On a cost slice the demand has to be removed path by path from an equilibrium while keeping it an equilibrium of a shifted game. Finally, the constants of the slice estimates depend on the auxiliary game, and they must be controlled uniformly near Γ\GammaΓ.

Formalization scope

The Lean development fixes the following conventions.

  • The network is a structure with ∣A∣|A|∣A∣ arcs, ∣S∣|\mathcal S|∣S∣ paths and ∣K∣|\mathcal K|∣K∣ O/D pairs, a 0/1 arc–path incidence matrix and the map sending a path to its pair. Lemma 1 uses the §2 model assumptions: 0/1 incidence, non-empty paths, K≠∅\mathcal K \neq \emptysetK=∅, and ∣Sk∣≥1|\mathcal S_k| \ge 1∣Sk​∣≥1. The later results add Condition 1 (every arc on a path, ∣Sk∣≥2|\mathcal S_k| \ge 2∣Sk​∣≥2), as assumed from §3.1. Paths are arbitrary non-empty 0/1 columns, not necessarily loop-free paths of a digraph; the results do not use loop-freeness.
  • Cost functions are maps R→R\mathbb R \to \mathbb RR→R required to be continuous, non-decreasing and non-negative on [0,∞)[0,\infty)[0,∞) only.
  • Arc flows, Wardrop equilibria (2.1) and the potential (2.6) come from the published definition KellyStochasticNetworks_Wardrop. ϵ\epsilonϵ-approximate WE flows follow (2.7) in arc form. The total cost uses the arc form, which equals the path form for 0/1 incidence.
  • C∗\mathcal C^*C∗ is the infimum of costs over flows, C~\tilde{\mathcal C}C~ the supremum of costs over WE flows, ρ\rhoρ their quotient. The middle term of the distance is the supremum of the image of the compact set A×[0,min⁡{T(d),T(d′)}]A\times[0,\min\{T(d),T(d')\}]A×[0,min{T(d),T(d′)}], and ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ is the sup norm.
  • Every statement about ρ\rhoρ, C∗\mathcal C^*C∗ or C~\tilde{\mathcal C}C~ quantifies over games of the game space, where ρ\rhoρ is a genuine ratio of positive numbers. Off the game space Lean's division by zero would give ρ=0\rho = 0ρ=0, so quantifying over all pairs (τ,d)(\tau, d)(τ,d) would trivialize the statements; this is ruled out. In the goal, ϵΓ\epsilon_\GammaϵΓ​ and κΓ\kappa_\GammaκΓ​ are chosen before Γ′\Gamma'Γ′.
  • Several printed strict inequalities are posed as non-strict, because they fail at Γ′=Γ\Gamma' = \GammaΓ′=Γ or are attained in the paper's own Example 2. In Lemma 11 the printed constants are corrected by a factor ∣K∣|\mathcal K|∣K∣ that the paper's own argument needs; each item's Formalization Note quotes the printed form.

A complete development needs: existence of Wardrop equilibria and uniqueness of their cost on the game space, existence of social optima, the integral inequality (2.9) for monotone costs, positivity of C∗\mathcal C^*C∗ on the game space, and the path-by-path demand-reduction construction of Lemma 11. The existence and uniqueness results and Lemma 1 are reusable in any formalization of selfish routing. Proofs of any milestone are welcome, as are the supporting lemmas above.

The source is the arXiv preprint arXiv:2007.13979v3 (23 Aug 2021); all page and theorem numbers refer to it, not to the published version.

Selected references

  • Z. Wu, R. H. Möhring, A sensitivity analysis of the price of anarchy in non-atomic congestion games, arXiv:2007.13979v3, 2021; Mathematics of Operations Research 48(3), 2023. https://arxiv.org/abs/2007.13979, https://doi.org/10.1287/moor.2022.1292
  • T. Roughgarden, É. Tardos, How bad is selfish routing?, Journal of the ACM 49(2), 2002. https://doi.org/10.1145/506147.506153
  • E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, STACS 1999. https://doi.org/10.1007/3-540-49116-3_38
  • J. G. Wardrop, Some theoretical aspects of road traffic research, Proceedings of the Institution of Civil Engineers 1(3), 1952. https://doi.org/10.1680/ipeds.1952.11259
  • M. Englert, T. Franke, L. Olbrich, Sensitivity of Wardrop equilibria, Theory of Computing Systems 47(1):3–14, 2010.
  • M. Takalloo, C. Kwon, Sensitivity of Wardrop equilibria: revisited, Optimization Letters 14(3):781–796, 2020.
  • R. Cominetti, V. Dose, M. Scarsini, The price of anarchy in routing games as a function of the demand, 2020. https://arxiv.org/abs/1907.10101
13 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios IV: The Tight Ratio 1 − e^{−α⁽¹⁾} Exceeds (1 − 1/e)σ⁽¹⁾ and the Price-Continuum RatioResearch Paper

Motivation

In online matching with multiple prices, a firm sells nnn items with limited inventories to customers who arrive one at a time; each item can be offered at any price from its own finite price set, and the firm must commit to an offer without knowing future customers. Ma and Simchi-Levi (arXiv:1905.04770, Oper. Res. 2020) show that the best possible competitive ratio (worst-case ratio of the online revenue to the offline LP optimum) for a price set P\mathcal PP is an explicit number F(P)=1−e−α(1)F(\mathcal P) = 1 - e^{-\alpha^{(1)}}F(P)=1−e−α(1), computed from P\mathcal PP alone.

Two tight ratios were known before. For a single item sold over a price set, Ball and Queyranne (Oper. Res. 2009) found the tight ratio σ(1)\sigma^{(1)}σ(1). For many items with one price each, the tight ratio is 1−1/e1 - 1/e1−1/e (Karp, Vazirani and Vazirani 1990; Mehta, Saberi, Vazirani and Vazirani 2007). For a single item whose price ranges over a continuum [r(1),r(m)][r^{(1)}, r^{(m)}][r(1),r(m)], Ball and Queyranne give 1/(1+ln⁡(r(m)/r(1)))1/(1 + \ln(r^{(m)}/r^{(1)}))1/(1+ln(r(m)/r(1))). A reader meeting F(P)F(\mathcal P)F(P) for the first time asks how it compares with these. Proposition 2 of the paper answers that question with strict inequalities, and this mission formalizes it.

Setting

A price set consists of mmm prices

0<r(1)<r(2)<⋯<r(m),0 < r^{(1)} < r^{(2)} < \dots < r^{(m)},0<r(1)<r(2)<⋯<r(m),

with the convention r(0):=0r^{(0)} := 0r(0):=0. Write sj=r(j−1)/r(j)∈(0,1)s_j = r^{(j-1)}/r^{(j)} \in (0,1)sj​=r(j−1)/r(j)∈(0,1) for j=2,…,mj = 2, \dots, mj=2,…,m.

The booking limits α(1),…,α(m)\alpha^{(1)}, \dots, \alpha^{(m)}α(1),…,α(m) are positive numbers with ∑jα(j)=1\sum_j \alpha^{(j)} = 1∑j​α(j)=1 satisfying

1−e−α(1)=1−e−α(j)1−sj,j=2,…,m.(7)1 - e^{-\alpha^{(1)}} = \frac{1 - e^{-\alpha^{(j)}}}{1 - s_j}, \qquad j = 2, \dots, m. \qquad (7)1−e−α(1)=1−sj​1−e−α(j)​,j=2,…,m.(7)

The Ball–Queyranne limits σ(1),…,σ(m)\sigma^{(1)}, \dots, \sigma^{(m)}σ(1),…,σ(m) are positive numbers with ∑jσ(j)=1\sum_j \sigma^{(j)} = 1∑j​σ(j)=1 satisfying

σ(1)=σ(j)1−sj,j=2,…,m.(8)\sigma^{(1)} = \frac{\sigma^{(j)}}{1 - s_j}, \qquad j = 2, \dots, m. \qquad (8)σ(1)=1−sj​σ(j)​,j=2,…,m.(8)

Both systems have exactly one solution (Proposition 1). The paper's ratios are F(P)=1−e−α(1)F(\mathcal P) = 1 - e^{-\alpha^{(1)}}F(P)=1−e−α(1) and G(P)=σ(1)G(\mathcal P) = \sigma^{(1)}G(P)=σ(1) (Definition 2). Finally, for m≥2m \ge 2m≥2 let α\alphaα be the unique real root of

1−e−α=1−αln⁡(r(m)/r(1));1 - e^{-\alpha} = \frac{1 - \alpha}{\ln(r^{(m)}/r^{(1)})};1−e−α=ln(r(m)/r(1))1−α​;

1−e−α1 - e^{-\alpha}1−e−α is the paper's competitive ratio when every item may be priced anywhere in [r(1),r(m)][r^{(1)}, r^{(m)}][r(1),r(m)] (App. E.1).

In Lean the prices are r : ℕ → ℝ read at 1,…,m1, \dots, m1,…,m, and IsPriceSet m r, IsBookingLimits m r α, IsBQLimits m r σ are the predicates above.

Formalization targets

Goal: Proposition 2 (p. 17)

For m≥2m \ge 2m≥2,

(1−1e)σ(1)<1−e−σ(1)<1−e−α(1),(11)\Bigl(1 - \frac1e\Bigr)\sigma^{(1)} < 1 - e^{-\sigma^{(1)}} < 1 - e^{-\alpha^{(1)}}, \qquad (11)(1−e1​)σ(1)<1−e−σ(1)<1−e−α(1),(11) 11+ln⁡(r(m)/r(1))<σ(1),(12)\frac{1}{1 + \ln(r^{(m)}/r^{(1)})} < \sigma^{(1)}, \qquad (12)1+ln(r(m)/r(1))1​<σ(1),(12) 1−e−α<1−e−α(1).(13)1 - e^{-\alpha} < 1 - e^{-\alpha^{(1)}}. \qquad (13)1−e−α<1−e−α(1).(13)

Milestones

  1. Proposition 1 (p. 13): existence and uniqueness of the solutions of (7) and of (8).
  2. Explicit σ\sigmaσ (App. A, p. 38): σ(j)=(1−r(j−1)/r(j))(1+∑j′=2m(1−sj′))−1\sigma^{(j)} = (1 - r^{(j-1)}/r^{(j)})\bigl(1 + \sum_{j'=2}^m (1 - s_{j'})\bigr)^{-1}σ(j)=(1−r(j−1)/r(j))(1+∑j′=2m​(1−sj′​))−1.
  3. Monotonicity (App. A, p. 38): x↦x/(1−e−x)x \mapsto x/(1 - e^{-x})x↦x/(1−e−x) (with its limit value 111 at x=0x = 0x=0) is strictly increasing on [0,1][0, 1][0,1].
  4. (33) (App. A, p. 39): α(1)\alpha^{(1)}α(1) is the unique solution of x+∑j=2m−ln⁡(1−(1−e−x)(1−sj))=1x + \sum_{j=2}^m -\ln\bigl(1 - (1 - e^{-x})(1 - s_j)\bigr) = 1x+∑j=2m​−ln(1−(1−e−x)(1−sj​))=1.
  5. (34) (App. A, p. 39): the root α\alphaα is the unique solution of x+∑j=2m(1−e−x)ln⁡(r(j)/r(j−1))=1x + \sum_{j=2}^m (1 - e^{-x})\ln(r^{(j)}/r^{(j-1)}) = 1x+∑j=2m​(1−e−x)ln(r(j)/r(j−1))=1, and it lies in (0,1)(0,1)(0,1).
  6. Ranges of FFF and GGG (p. 14): 1−e−1/m≤F(P)≤1−e−11 - e^{-1/m} \le F(\mathcal P) \le 1 - e^{-1}1−e−1/m≤F(P)≤1−e−1 and 1/m≤G(P)≤11/m \le G(\mathcal P) \le 11/m≤G(P)≤1.
  7. Two prices, (4) (p. 7): for P={r,ξr}\mathcal P = \{r, \xi r\}P={r,ξr}, F(P)=1−(1+4ξ(ξ−1)/e−1)/(2(ξ−1))F(\mathcal P) = 1 - \bigl(\sqrt{1 + 4\xi(\xi-1)/e} - 1\bigr)/(2(\xi - 1))F(P)=1−(1+4ξ(ξ−1)/e​−1)/(2(ξ−1)).

Significance

The result. Inequality (11) shows that the multi-item, multi-price ratio is not obtained by multiplying the single-item ratio σ(1)\sigma^{(1)}σ(1) by the single-price penalty 1−1/e1 - 1/e1−1/e: the true ratio is strictly larger, so neither the ratio nor the algorithms of the paper can be assembled from the two classical cases. Inequalities (12) and (13) quantify the value of a discrete price menu: restricting the continuum [r(1),r(m)][r^{(1)}, r^{(m)}][r(1),r(m)] to finitely many prices strictly raises the tight ratio, both for one item (Ball–Queyranne) and for many items (this paper). The ranges of FFF and GGG bound the guarantees in terms of the number of prices alone, and the two-price formula (4) is the explicit instance used throughout the paper's introduction.

Formalizing it. All results here are proved in the paper (App. A); none has a machine-checked proof that we know of. The mission produces a checked theory of the booking-limit systems (7) and (8), which the paper's three main theorems (the competitive ratios of Multi-price Balance and Multi-price Ranking, and the matching upper bound) all rest on, and checked proofs of the comparisons. The booking-limit predicates are the same in the companion missions of this series and are intended to be shared after consolidation.

Difficulty

The statements are elementary, but (7) is a nonlinear system: eliminating α(2),…,α(m)\alpha^{(2)}, \dots, \alpha^{(m)}α(2),…,α(m) leaves a polynomial equation of degree mmm in e−α(1)e^{-\alpha^{(1)}}e−α(1), with no closed form for m≥3m \ge 3m≥3. So α(1)\alpha^{(1)}α(1) cannot be computed and compared directly; every inequality has to be derived from properties of the defining equations. The root α\alphaα of (13) is likewise defined only implicitly (via the Lambert WWW function). The naive approach of comparing the two systems equation by equation does not give (11)'s second inequality, because (7) and (8) relate each limit to the first one through different functions and the two families are tied together only by their common normalization ∑j=1\sum_j = 1∑j​=1. In Lean the main friction is bookkeeping: sums over {2,…,m}\{2, \dots, m\}{2,…,m}, natural-number index arithmetic j−1j - 1j−1, and the uniqueness arguments, which require strict monotonicity of the functions in (33) and (34).

Formalization scope

Conventions: prices are r : ℕ → ℝ, 1-based, with price r 0 = 0 for r(0)r^{(0)}r(0); sums over j=2,…,mj = 2, \dots, mj=2,…,m are over Finset.Icc 2 m. The booking limits are not constructed by Classical.choose: every statement takes functions α, σ together with the hypotheses IsBookingLimits m r α / IsBQLimits m r σ (equations (7)/(8), positivity on 1,…,m1, \dots, m1,…,m, sum 111). Proposition 1 shows these hypotheses pin down the paper's values on 1,…,m1, \dots, m1,…,m, so no statement is about an arbitrary α\alphaα; a sanity file exhibits solutions for m=1m = 1m=1 and for the price set {1,2}\{1, 2\}{1,2}, so the hypotheses are satisfiable. Standing assumptions are those of the paper: m≥1m \ge 1m≥1 throughout and m≥2m \ge 2m≥2 in Proposition 2, (33), (34), as printed. The constant 1−1/e1 - 1/e1−1/e is written 1−e−11 - e^{-1}1−e−1.

Clause (13) is stated for every real root of 1−e−a=(1−a)/ln⁡(r(m)/r(1))1 - e^{-a} = (1-a)/\ln(r^{(m)}/r^{(1)})1−e−a=(1−a)/ln(r(m)/r(1)); milestone 5 proves that exactly one root exists, so the clause is neither vacuous nor weaker than the printed "the unique solution". The monotonicity of x/(1−e−x)x/(1 - e^{-x})x/(1−e−x) is posed on the printed [0,1][0,1][0,1] with the value at 000 set explicitly to the limit 111, since Lean's 0/0=00/0 = 00/0=0 would otherwise give a junk value there.

Everything needed is in Mathlib (Real.exp, Real.log, Real.sqrt, finite sums). Contributions are welcome on any milestone; the monotonicity lemma and Proposition 1 are reusable by the other missions of this series. The paper's proofs are in its Appendix A (pp. 38–39).

Selected references

  • W. Ma, D. Simchi-Levi, Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios, arXiv:1905.04770v1, 2019; Operations Research 68(6), 2020. https://arxiv.org/abs/1905.04770, https://doi.org/10.1287/opre.2019.1957
  • M. O. Ball, M. Queyranne, Toward Robust Revenue Management: Competitive Analysis of Online Booking, Operations Research 57(4), 2009. https://doi.org/10.1287/opre.1080.0654
  • R. M. Karp, U. V. Vazirani, V. V. Vazirani, An Optimal Algorithm for On-line Bipartite Matching, STOC 1990. https://doi.org/10.1145/100216.100262
  • A. Mehta, A. Saberi, U. Vazirani, V. Vazirani, AdWords and Generalized Online Matching, Journal of the ACM 54(5), 2007. https://doi.org/10.1145/1284320.1284321
12 thms3 active usersReviewed
🏆Completed
Dynamical SystemsStochastic Systems·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 2: With Constant Coefficients and σ₃ = 0 the Dominating ODE Has a Bounded Solution for Every T Iff F Has a Suitable Zero or Is LinearResearch Paper

Motivation

A forward–backward stochastic differential equation (FBSDE) couples a forward diffusion XXX with a backward equation for a pair (Y,Z)(Y,Z)(Y,Z) whose terminal value depends on XTX_TXT​. FBSDEs are the probabilistic form of quasilinear parabolic PDEs and appear in stochastic control (the stochastic maximum principle), in mathematical finance (hedging with large investors, stochastic differential utility) and in mean-field games. Their solvability over an arbitrary horizon is delicate: the coupling can make a solution exist only on short time intervals.

Ma, Wu, Zhang and Zhang (arXiv:1110.4658v2, Ann. Appl. Probab. 25 (2015)) reduce well-posedness of a general one-dimensional FBSDE to the behaviour of two scalar dominating ODEs: when these have solutions that stay bounded on [0,T][0,T][0,T], the FBSDE has a regular decoupling field and a unique solution. Section 5.1 of the paper tests this programme on the simplest class, the linear FBSDE with constant coefficients, and obtains necessary and sufficient conditions. The authors describe these as setting the "limits" for the solvability of general FBSDEs.

Earlier approaches each covered part of the picture: the method of contraction mappings for small time (Antonelli 1993, MR1233625), the four-step scheme for Markovian FBSDEs with regular coefficients (Ma, Protter, Yong 1994, MR1262970), and the method of continuation under monotonicity conditions (Hu, Peng 1995, MR1355060; Peng, Wu 1999, MR1675098; later Yong 1997, MR1440146). The unified approach of the paper contains these as special cases.

Setting

Let b1,b2,b3,σ1,σ2,f1,f2,f3,hb_1,b_2,b_3,\sigma_1,\sigma_2,f_1,f_2,f_3,hb1​,b2​,b3​,σ1​,σ2​,f1​,f2​,f3​,h be real numbers and consider the linear FBSDE (4.1)

Xt=1+∫0t(b1X+b2Y+b3Z) ds+∫0t(σ1X+σ2Y+σ3Z) dB,Yt=hXT+∫tT(f1X+f2Y+f3Z) ds−∫tTZ dB,\mathcal X_t=1+\int_0^t(b_1\mathcal X+b_2\mathcal Y+b_3\mathcal Z)\,ds+\int_0^t(\sigma_1\mathcal X+\sigma_2\mathcal Y+\sigma_3\mathcal Z)\,dB,\qquad \mathcal Y_t=h\mathcal X_T+\int_t^T(f_1\mathcal X+f_2\mathcal Y+f_3\mathcal Z)\,ds-\int_t^T\mathcal Z\,dB,Xt​=1+∫0t​(b1​X+b2​Y+b3​Z)ds+∫0t​(σ1​X+σ2​Y+σ3​Z)dB,Yt​=hXT​+∫tT​(f1​X+f2​Y+f3​Z)ds−∫tT​ZdB,

in Case 1, σ3=0\sigma_3=0σ3​=0. Then the two dominating ODEs coincide and become the scalar backward equation

yt=h+∫tTF(ys) ds,t∈[0,T],(5.3)y_t=h+\int_t^T F(y_s)\,ds,\qquad t\in[0,T], \tag{5.3}yt​=h+∫tT​F(ys​)ds,t∈[0,T],(5.3)

with the cubic

F(y)=f1+[f2+b1+σ1f3] y+[b2+f3σ2+b3σ1] y2+σ2b3 y3.(5.4)F(y)=f_1+[f_2+b_1+\sigma_1f_3]\,y+[b_2+f_3\sigma_2+b_3\sigma_1]\,y^2+\sigma_2b_3\,y^3 . \tag{5.4}F(y)=f1​+[f2​+b1​+σ1​f3​]y+[b2​+f3​σ2​+b3​σ1​]y2+σ2​b3​y3.(5.4)

In the Appendix's notation (A.3), F(y)=f1+a1y+a2y2+a3y3F(y)=f_1+a_1y+a_2y^2+a_3y^3F(y)=f1​+a1​y+a2​y2+a3​y3 with a1=f2+b1+σ1f3a_1=f_2+b_1+\sigma_1f_3a1​=f2​+b1​+σ1​f3​, a2=b2+f3σ2+b3σ1a_2=b_2+f_3\sigma_2+b_3\sigma_1a2​=b2​+f3​σ2​+b3​σ1​, a3=σ2b3a_3=\sigma_2b_3a3​=σ2​b3​.

A solution on [0,T][0,T][0,T] of yt=h+∫tTG(s,ys) dsy_t=h+\int_t^TG(s,y_s)\,dsyt​=h+∫tT​G(s,ys​)ds is a function yyy such that, for every t∈[0,T]t\in[0,T]t∈[0,T], s↦G(s,ys)s\mapsto G(s,y_s)s↦G(s,ys​) is integrable on [t,T][t,T][t,T] and the equation holds at ttt. A bounded solution additionally has sup⁡[0,T]∣y∣<∞\sup_{[0,T]}|y|<\inftysup[0,T]​∣y∣<∞. In Lean the coefficients form the structure UnifiedFBSDE.Cubic.Coeffs, FFF is Coeffs.F, and the predicates are IsSolution and IsBoundedSolution.

Formalization targets

Goal: Theorem 5.3

(∀T>0, ∃ y bounded solution of (5.3) on [0,T])  ⟺  {(i) F(h)≥0 and F(λ)=0 for some λ≥h, or(ii) F(h)≤0 and F(λ)=0 for some λ≤h, or(iii) σ2b3=0 and b2+f3σ2+b3σ1=0.\Big(\forall T>0,\ \exists\,y \text{ bounded solution of (5.3) on }[0,T]\Big)\iff \begin{cases} \text{(i) } F(h)\ge0 \text{ and } F(\lambda)=0 \text{ for some }\lambda\ge h,\ \text{or}\\ \text{(ii) } F(h)\le0 \text{ and } F(\lambda)=0 \text{ for some }\lambda\le h,\ \text{or}\\ \text{(iii) } \sigma_2b_3=0 \text{ and } b_2+f_3\sigma_2+b_3\sigma_1=0. \end{cases}(∀T>0, ∃y bounded solution of (5.3) on [0,T])⟺⎩⎨⎧​(i) F(h)≥0 and F(λ)=0 for some λ≥h, or(ii) F(h)≤0 and F(λ)=0 for some λ≤h, or(iii) σ2​b3​=0 and b2​+f3​σ2​+b3​σ1​=0.​

Milestones

  1. Lemma 5.1: comparison for backward ODEs. Between a bounded sub-solution and a bounded super-solution, (5.1) has a unique solution.
  2. Remark 5.2: a checkable sufficient condition for hypothesis (iv) of Lemma 5.1.
  3. Sufficiency of (i), (ii): the solution stays in [h,λ][h,\lambda][h,λ] (resp. [λ,h][\lambda,h][λ,h]).
  4. (5.5): under (iii), (5.3) is linear and has a bounded solution.
  5. (A.4): if a3>0a_3>0a3​>0 and FFF has no zero in [h,∞)[h,\infty)[h,∞), then F(y)≥ε(y−y1)3F(y)\ge\varepsilon(y-y_1)^3F(y)≥ε(y−y1​)3 on [h,∞)[h,\infty)[h,∞) for some ε>0\varepsilon>0ε>0, y1<hy_1<hy1​<h.
  6. (A.6): the explicit comparison solution y~t−y1=(2ε(t−T)+(h−y1)−2)−1/2\tilde y_t-y_1=(2\varepsilon(t-T)+(h-y_1)^{-2})^{-1/2}y~​t​−y1​=(2ε(t−T)+(h−y1​)−2)−1/2 and its blow-up time T−1/(2ε(h−y1)2)T-1/(2\varepsilon(h-y_1)^2)T−1/(2ε(h−y1​)2).
  7. Blow-up by comparison: a continuous G≥ε(y−y1)3G\ge\varepsilon(y-y_1)^3G≥ε(y−y1​)3 on [h,∞)[h,\infty)[h,∞) admits no solution on [0,T][0,T][0,T] when T>1/(2ε(h−y1)2)T>1/(2\varepsilon(h-y_1)^2)T>1/(2ε(h−y1​)2).
  8. Case 2: if a3=0a_3=0a3​=0, a2>0a_2>0a2​>0, F(h)>0F(h)>0F(h)>0 and FFF has no zero above hhh, then F(y)≥ε(y−y1)2F(y)\ge\varepsilon(y-y_1)^2F(y)≥ε(y−y1​)2 on [h,∞)[h,\infty)[h,∞) and (5.3) has no solution for TTT large.

Companion: Theorem 5.4

For a fixed horizon TTT: (i) σ2b3<0\sigma_2b_3<0σ2​b3​<0 or F(h)=0F(h)=0F(h)=0; (ii) F(h)>0F(h)>0F(h)>0, σ2b3≤ε\sigma_2b_3\le\varepsilonσ2​b3​≤ε, a2≤εa_2\le\varepsilona2​≤ε; (iii) F(h)<0F(h)<0F(h)<0, σ2b3≤ε\sigma_2b_3\le\varepsilonσ2​b3​≤ε, a2≥−εa_2\ge-\varepsilona2​≥−ε, with ε=ε(T)\varepsilon=\varepsilon(T)ε=ε(T) small. Each guarantees a bounded solution on [0,T][0,T][0,T].

Significance

Theorem 5.3 turns the existence of a global bounded solution of the dominating ODE into a finite check on a cubic polynomial: the sign of F(h)F(h)F(h), the location of a real root, and two coefficient identities. Through the paper's main construction, a bounded solution yields a uniformly Lipschitz decoupling field, and hence well-posedness of the linear FBSDE on any horizon. When none of (i)–(iii) holds, the dominating ODE explodes in finite time. This is the sense in which the paper says the constant-coefficient results "more or less set the 'limits'" for the solvability of general FBSDEs: the conditions it later imposes on random coefficients (§5.2, §7) are modelled on the cases (i)–(iii).

The result is proved in the paper: sufficiency on p. 21, necessity in the Appendix (pp. 46–47). To our knowledge none of it is machine-checked. A formalization produces a reusable comparison theorem for scalar backward integral equations with Lipschitz-on-a-band nonlinearities (Lemma 5.1), explicit finite-time blow-up criteria for polynomial ODEs, and a complete, checked classification of global solvability for the cubic Riccati-type equation (5.3).

Difficulty

Sufficiency rests on Lemma 5.1, which requires Carathéodory existence and uniqueness for an equation that is only Lipschitz on a time-dependent band, followed by an integrating-factor comparison argument. Mathlib's Picard–Lindelöf and Gronwall tools are stated for forward equations with continuous right-hand sides, so they need adaptation.

Necessity is a case analysis whose obvious version fails at two points. First, one cannot simply bound FFF below by a3(y−y1)3a_3(y-y_1)^3a3​(y−y1​)3 using the smallest real root: the intermediate inequality (A.5) as printed points the wrong way for some root orderings, and the correct bound uses the largest root or an infimum over [h,∞)[h,\infty)[h,∞). Second, the blow-up step compares a solution of (5.3) with an explicit exploding solution. This needs the solution to stay above hhh for the whole interval, which in turn needs continuity of the right-hand side. For a discontinuous right-hand side the comparison fails.

Formalization scope

Time is real, with 0<T0<T0<T and t∈[0,T]t\in[0,T]t∈[0,T]. Solutions are functions R→R\mathbb R\to\mathbb RR→R whose values outside [0,T][0,T][0,T] are irrelevant. The integral ∫tT\int_t^T∫tT​ is Mathlib's interval integral. "For arbitrary TTT" is ∀T>0, ∃y\forall T>0,\ \exists y∀T>0, ∃y, with the universal quantifier outside. "A zero point in [h,∞)[h,\infty)[h,∞)" is ∃λ≥h, F(λ)=0\exists\lambda\ge h,\ F(\lambda)=0∃λ≥h, F(λ)=0.

Pinned readings, all disclosed in the items:

  • Lemma 5.1 adds y1≤y2y^1\le y^2y1≤y2 on [0,T][0,T][0,T] (the lemma is false without it), L≥0L\ge0L≥0, and integrability of c1,c2c^1,c^2c1,c2. Its α\alphaα ranges over measurable functions with ∣α∣≤L|\alpha|\le L∣α∣≤L, and FiF^iFi is measurable on R×R\mathbb R\times\mathbb RR×R.
  • The blow-up milestone assumes GGG continuous.
  • In Theorem 5.4(ii)–(iii), ε\varepsilonε is chosen after TTT, hhh, f1f_1f1​ and a1a_1a1​, the data its proof uses.
  • (A.5) is not stated.

Trivializing formalizations are ruled out. The solution predicate carries integrability of the integrand, so Lean's junk value 000 for a non-integrable integral cannot make an arbitrary yyy with yt=hy_t=hyt​=h a solution. The goal assumes neither a zero of FFF nor a blow-up: both are proved in the milestones. Lemma 5.1's uniqueness is over solutions in the band.

The needed infrastructure is scalar ODE theory on Mathlib: existence for Lipschitz Carathéodory equations, differentiation of t↦∫tTgt\mapsto\int_t^T gt↦∫tT​g, comparison of sub- and super-solutions, and elementary real-root facts for cubics. The comparison lemma and the blow-up lemma are reusable beyond this mission. Contributions of either the sufficiency or the necessity chain are welcome independently.

Selected references

  • J. Ma, Z. Wu, D. Zhang, J. Zhang, On well-posedness of forward–backward SDEs—a unified approach, Ann. Appl. Probab. 25(4):2168–2214, 2015. https://arxiv.org/abs/1110.4658 , https://doi.org/10.1214/14-AAP1046
  • F. Antonelli, Backward–forward stochastic differential equations, Ann. Appl. Probab. 3(3):777–793, 1993. MR1233625, https://mathscinet.ams.org/mathscinet-getitem?mr=1233625
  • J. Ma, P. Protter, J. Yong, Solving forward–backward stochastic differential equations explicitly—a four step scheme, Probab. Theory Related Fields 98:339–359, 1994. MR1262970, https://mathscinet.ams.org/mathscinet-getitem?mr=1262970
  • Y. Hu, S. Peng, Solution of forward–backward stochastic differential equations, Probab. Theory Related Fields 103:273–283, 1995. MR1355060, https://mathscinet.ams.org/mathscinet-getitem?mr=1355060
  • S. Peng, Z. Wu, Fully coupled forward–backward stochastic differential equations and applications to optimal control, SIAM J. Control Optim. 37(3):825–843, 1999. MR1675098, https://mathscinet.ams.org/mathscinet-getitem?mr=1675098
  • J. Yong, Finding adapted solutions of forward–backward stochastic differential equations: method of continuation, Probab. Theory Related Fields 107:537–572, 1997. MR1440146, https://mathscinet.ams.org/mathscinet-getitem?mr=1440146
10 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: Lucas

Witten 1998: Anti de Sitter Space and Holography — the massive scalar boundary-value problemResearch Paper

Motivation

In February 1998 Witten's paper Anti de Sitter Space and Holography made precise Maldacena's proposal that large-NNN conformal field theories in ddd dimensions are described by gravity on (d+1)(d+1)(d+1)-dimensional anti de Sitter space AdSd+1\mathrm{AdS}_{d+1}AdSd+1​. The dictionary it proposes identifies boundary values of bulk fields with sources of boundary operators, and reads correlation functions off the dependence of the bulk action on those boundary values. Its most quoted quantitative consequence is the mass–dimension relation: a scalar of mass mmm on AdSd+1\mathrm{AdS}_{d+1}AdSd+1​ corresponds to a boundary operator of conformal dimension

Δ=12(d+d2+4m2),Δ(Δ−d)=m2.\Delta=\tfrac12\big(d+\sqrt{d^2+4m^2}\big),\qquad \Delta(\Delta-d)=m^2 .Δ=21​(d+d2+4m2​),Δ(Δ−d)=m2.

Behind this physics statement sits a piece of classical analysis on hyperbolic space: the Dirichlet-type problem for the operator Δg−m2\Delta_g-m^2Δg​−m2 with prescribed boundary asymptotics, solved by an explicit Poisson-type integral (Section 2 of the paper, eqs. (2.15)–(2.44)). This mission formalizes that analytic core.

Timeline. Maldacena 1997 (hep-th/9711200) conjectured the correspondence; Gubser–Klebanov–Polyakov (hep-th/9802109) and Witten (hep-th/9802150, both February 1998) proposed the precise dictionary; the Euclidean black-hole thermodynamics used in Section 3 goes back to Hawking–Page 1983.

Setting

Euclidean AdSd+1\mathrm{AdS}_{d+1}AdSd+1​ is modelled as the upper half space {(x0,x):x0>0, x∈Rd}\{(x_0,x): x_0>0,\ x\in\mathbb R^d\}{(x0​,x):x0​>0, x∈Rd} with the hyperbolic metric

ds2=1x02(dx02+∑i=1ddxi2)(eq. (2.15)).ds^2=\frac{1}{x_0^2}\Big(dx_0^2+\sum_{i=1}^d dx_i^2\Big)\qquad\text{(eq. (2.15))}.ds2=x02​1​(dx02​+i=1∑d​dxi2​)(eq. (2.15)).

Its Laplace–Beltrami operator is

Δgu=x0d+1∂0(x01−d∂0u)+x02∑j=1d∂j2u=x02(∂02u+∑j∂j2u)−(d−1)x0 ∂0u.\Delta_g u=x_0^{d+1}\partial_0\big(x_0^{1-d}\partial_0 u\big)+x_0^2\sum_{j=1}^d\partial_j^2u = x_0^2\Big(\partial_0^2u+\sum_j\partial_j^2u\Big)-(d-1)x_0\,\partial_0u .Δg​u=x0d+1​∂0​(x01−d​∂0​u)+x02​j=1∑d​∂j2​u=x02​(∂02​u+j∑​∂j2​u)−(d−1)x0​∂0​u.

A massive scalar of squared mass m2∈Rm^2\in\mathbb Rm2∈R solves Δgu=m2u\Delta_g u=m^2uΔg​u=m2u (eqs. (2.34), (2.37)). The conformal dimension is Δ=12(d+d2+4m2)\Delta=\tfrac12(d+\sqrt{d^2+4m^2})Δ=21​(d+d2+4m2​) (eq. (2.44)), the bulk-to-boundary kernel is

KΔ(x0,x)=x0Δ(x02+∣x∣2)Δ(eqs. (2.19), (2.38)),K_\Delta(x_0,x)=\frac{x_0^{\Delta}}{(x_0^2+|x|^2)^{\Delta}}\qquad\text{(eqs. (2.19), (2.38))},KΔ​(x0​,x)=(x02​+∣x∣2)Δx0Δ​​(eqs. (2.19), (2.38)),

and the Poisson-type integral of a boundary datum φ0\varphi_0φ0​ is ∫RdKΔ(x0,x−x′) φ0(x′) dx′\int_{\mathbb R^d}K_\Delta(x_0,x-x')\,\varphi_0(x')\,dx'∫Rd​KΔ​(x0​,x−x′)φ0​(x′)dx′ (eqs. (2.20), (2.41)).

Formalization targets

Goal (eq. (2.41) with (2.43)–(2.44))

For m2>−d2/4m^2>-d^2/4m2>−d2/4 there is a constant c>0c>0c>0 such that for every bounded continuous φ0\varphi_0φ0​ on Rd\mathbb R^dRd,

φ(x0,x)=c∫Rdx0Δ(x02+∣x−x′∣2)Δ φ0(x′) dx′\varphi(x_0,x)=c\int_{\mathbb R^d}\frac{x_0^{\Delta}}{(x_0^2+|x-x'|^2)^{\Delta}}\,\varphi_0(x')\,dx'φ(x0​,x)=c∫Rd​(x02​+∣x−x′∣2)Δx0Δ​​φ0​(x′)dx′

is a C2C^2C2 solution of Δgφ=m2φ\Delta_g\varphi=m^2\varphiΔg​φ=m2φ on the upper half space and x0Δ−d φ(x0,x)→φ0(x)x_0^{\Delta-d}\,\varphi(x_0,x)\to\varphi_0(x)x0Δ−d​φ(x0​,x)→φ0​(x) as x0→0+x_0\to0^+x0​→0+, i.e. φ∼x0d−Δφ0\varphi\sim x_0^{d-\Delta}\varphi_0φ∼x0d−Δ​φ0​ at the boundary (eq. (2.36) with f=x0f=x_0f=x0​).

Milestones

  1. x0Δx_0^{\Delta}x0Δ​ solves the massive equation when Δ(Δ−d)=m2\Delta(\Delta-d)=m^2Δ(Δ−d)=m2 (eqs. (2.16)–(2.17), (2.37)).
  2. The inverted kernel KΔK_\DeltaKΔ​ solves it too (eqs. (2.18)–(2.19), (2.38)).
  3. Scaling: ∫x02Δ−d(x02+∣x∣2)−Δdx\int x_0^{2\Delta-d}(x_0^2+|x|^2)^{-\Delta}dx∫x02Δ−d​(x02​+∣x∣2)−Δdx is independent of x0x_0x0​ (eq. (2.40)).
  4. Approximate identity: these kernels tend to a multiple of δ(x)\delta(x)δ(x) (eq. (2.39)).
  5. The massless case Δ=d\Delta=dΔ=d with φ→φ0\varphi\to\varphi_0φ→φ0​ (eq. (2.20)).
  6. Δ=12(d+d2+4m2)\Delta=\tfrac12(d+\sqrt{d^2+4m^2})Δ=21​(d+d2+4m2​) is the larger root of Δ(Δ−d)=m2\Delta(\Delta-d)=m^2Δ(Δ−d)=m2 (eqs. (2.43)–(2.44)).
  7. The gauge-field profile x0d−2x_0^{d-2}x0d−2​ solves the reduced Maxwell equation (eqs. (2.24)–(2.25)).
  8. Hawking–Page, d=3d=3d=3: β(r+)=12πr+/(1+3r+2)\beta(r_+)=12\pi r_+/(1+3r_+^2)β(r+​)=12πr+​/(1+3r+2​) has a maximum and I(r+)=πr+2(1−r+2)/(1+3r+2)I(r_+)=\pi r_+^2(1-r_+^2)/(1+3r_+^2)I(r+​)=πr+2​(1−r+2​)/(1+3r+2​) is negative for large r+r_+r+​ (eqs. (3.15)–(3.16)).

Significance

The goal is the analytic statement underlying the mass–dimension relation Δ(Δ−d)=m2\Delta(\Delta-d)=m^2Δ(Δ−d)=m2 of the AdS/CFT dictionary: it shows that the boundary datum φ0\varphi_0φ0​ of a massive field is naturally a density of weight d−Δd-\Deltad−Δ, which is how the paper identifies the dimension of the dual operator. The same kernel is the starting point for the two-point function (2.42). The result is classical mathematics (scattering theory on hyperbolic space), proved informally in the paper; this mission produces a machine-checked version together with reusable infrastructure for the hyperbolic Laplacian in half-space coordinates.

Difficulty

The pointwise identities (milestones 1, 2, 6, 7, 8) are calculus. The substance is analytic: differentiating the Poisson-type integral twice under the integral sign with only boundedness of φ0\varphi_0φ0​, and proving the approximate-identity limit with the right normalisation; the scaling integral requires Δ>d/2\Delta>d/2Δ>d/2, and the endpoint m2=−d2/4m^2=-d^2/4m2=−d2/4 (where Δ=d/2\Delta=d/2Δ=d/2 and the kernel is not integrable) must be excluded.

Formalization scope

Points are pairs (x0,x)∈R×EuclideanSpace R (Fin d)(x_0,x)\in\mathbb R\times\mathrm{EuclideanSpace}\ \mathbb R\ (\mathrm{Fin}\ d)(x0​,x)∈R×EuclideanSpace R (Fin d); partial derivatives are one-variable derivs, so the solution predicate also demands C2C^2C2 regularity on {x0>0}\{x_0>0\}{x0​>0}, which rules out junk values of deriv. Real powers are Real.rpow; integrals are Bochner integrals for Lebesgue measure. Boundary data are bounded continuous functions. All declarations live in the namespace WittenAdSHolography, with the shared definitions in one definition file.

Selected references

  • E. Witten, Anti de Sitter Space and Holography, Adv. Theor. Math. Phys. 2 (1998) 253–291. https://arxiv.org/abs/hep-th/9802150
  • J. Maldacena, The Large N Limit of Superconformal Field Theories and Supergravity, Adv. Theor. Math. Phys. 2 (1998) 231–252. https://arxiv.org/abs/hep-th/9711200
  • S. S. Gubser, I. R. Klebanov, A. M. Polyakov, Gauge Theory Correlators from Non-Critical String Theory, Phys. Lett. B 428 (1998) 105–114. https://arxiv.org/abs/hep-th/9802109
  • S. W. Hawking, D. N. Page, Thermodynamics of Black Holes in Anti-de Sitter Space, Commun. Math. Phys. 87 (1983) 577–588. https://doi.org/10.1007/BF01208266
10 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: Lucas

Coupling Constant II: The Beta Function in the Energy Scale and the Running DichotomyTextbook

Motivation

A coupling constant is the number that fixes the strength of an interaction: in the modern formulation it is the parameter weighting the interaction part of a Lagrangian against its kinetic part. In a quantum field theory such a parameter is not constant. Probing a process at a higher energy resolves more of the virtual activity that dresses the interaction, and the value one measures depends on the energy scale μ\muμ at which the measurement is made. This scale dependence is called the running of the coupling, and it is the organising phenomenon behind two of the best-known qualitative facts about the Standard Model: the electromagnetic coupling grows with energy (α≈1/137\alpha \approx 1/137α≈1/137 at low energy, α≈1/127\alpha \approx 1/127α≈1/127 at the ZZZ mass, about 90 GeV) and apparently diverges at a finite energy — the Landau pole — while the strong coupling decreases logarithmically at high energy, the asymptotic freedom found by Gross, Politzer and Wilczek and recognised by the 2004 Nobel Prize.

The source treats the running through the beta function, defined there by

β(g)  =  μ ∂g∂μ  =  ∂g∂ln⁡μ,\beta(g) \;=\; \mu\,\frac{\partial g}{\partial \mu} \;=\; \frac{\partial g}{\partial \ln \mu},β(g)=μ∂μ∂g​=∂lnμ∂g​,

and through the one-loop strong coupling

αs(k2)  ≈  1β0ln⁡(k2/Λ2).\alpha_s(k^2) \;\approx\; \frac{1}{\beta_0 \ln(k^2/\Lambda^2)} .αs​(k2)≈β0​ln(k2/Λ2)1​.

Everything in this mission is the mathematics of those two formulas: an autonomous scalar ordinary differential equation in the logarithm of the energy, and the behaviour of its solutions according to the sign of the one-loop coefficient.

Setting

Write μ>0\mu > 0μ>0 for the energy scale of a process and ggg, or α\alphaα, for a real-valued coupling as a function of that scale. The beta function in the energy scale is the logarithmic derivative used by the source,

β(g)(μ)  =  μ⋅dgdμ(μ),\beta(g)(\mu) \;=\; \mu \cdot \frac{d g}{d \mu}(\mu),β(g)(μ)=μ⋅dμdg​(μ),

a function of μ\muμ built from ggg; a theory whose beta function vanishes identically is scale-invariant, since its coupling then takes the same value at every scale.

A coupling is said to be one-loop running with coefficient bbb on a set SSS of scales when it satisfies, at every μ∈S\mu \in Sμ∈S,

μ dαdμ(μ)  =  b α(μ)2,\mu \, \frac{d\alpha}{d\mu}(\mu) \;=\; b \, \alpha(\mu)^2 ,μdμdα​(μ)=bα(μ)2,

equivalently dα/dμ=b α2/μd\alpha/d\mu = b\,\alpha^2/\mudα/dμ=bα2/μ. Here b<0b < 0b<0 is the asymptotically free sign (QCD) and b>0b > 0b>0 the sign the source attributes to QED. The equation is the one-loop truncation written in μ\muμ rather than in t=ln⁡μt = \ln \mut=lnμ: both forms appear in the source, and the first milestone is precisely their agreement.

The one-loop strong coupling with one-loop coefficient β0>0\beta_0 > 0β0​>0 and QCD scale Λ>0\Lambda > 0Λ>0 is the explicit function

α(Q)  =  1β0ln⁡(Q2/Λ2),Q>Λ,\alpha(Q) \;=\; \frac{1}{\beta_0 \ln(Q^2/\Lambda^2)}, \qquad Q > \Lambda ,α(Q)=β0​ln(Q2/Λ2)1​,Q>Λ,

the formula the source quotes for αs(k2)\alpha_s(k^2)αs​(k2). It is defined by an existing platform definition, which this mission reuses rather than restates.

Formalization targets

Goal — the running dichotomy in the energy scale

For every reference scale μ0>0\mu_0 > 0μ0​>0 and every positive reference value α0\alpha_0α0​ of the coupling at that scale:

b<0:α(μ)  =  α01−b α0ln⁡(μ/μ0)  (μ≥μ0),α(μ)→μ→∞0;b<0:\quad \alpha(\mu) \;=\; \frac{\alpha_0}{1 - b\,\alpha_0 \ln(\mu/\mu_0)} \ \ (\mu \ge \mu_0), \qquad \alpha(\mu) \xrightarrow[\mu \to \infty]{} 0 ;b<0:α(μ)=1−bα0​ln(μ/μ0​)α0​​  (μ≥μ0​),α(μ)μ→∞​0; b>0:no coupling obeys μ dαdμ=b α2 on all of [μ0, μ0e1/(bα0)] with α(μ0)=α0.b>0:\quad \text{no coupling obeys } \mu\,\frac{d\alpha}{d\mu} = b\,\alpha^2 \text{ on all of } \Big[\mu_0,\ \mu_0 e^{1/(b\alpha_0)}\Big] \text{ with } \alpha(\mu_0)=\alpha_0 .b>0:no coupling obeys μdμdα​=bα2 on all of [μ0​, μ0​e1/(bα0​)] with α(μ0​)=α0​.

The negative-coefficient half is asymptotic freedom together with the uniqueness of the solution; the positive-coefficient half is the Landau pole, stated as the non-existence of any solution up to the pole scale rather than as a divergence of one chosen formula. The pole scale μ0e1/(bα0)\mu_0 e^{1/(b\alpha_0)}μ0​e1/(bα0​) is the one the one-loop equation itself predicts.

Supporting levels

The milestones below range from the definitional identity μ ∂μg=∂ln⁡μg\mu\,\partial_\mu g = \partial_{\ln \mu} gμ∂μ​g=∂lnμ​g, through the three qualitative readings of the sign of β\betaβ that the source states in words (vanishing beta function means scale invariance; positive beta function means the coupling grows with energy; negative means it falls), to the identification of the quoted QCD formula as an exact solution of the one-loop equation and the determination of Λ\LambdaΛ from a single measured value.

Significance

The dichotomy is the mathematical content of two physical statements that the source presents side by side. Asymptotic freedom is what makes perturbative QCD predictive at high energy; the Landau pole is the reason the source warns that the perturbative beta function cannot be trusted at strong coupling, since the one-loop equation has no solution reaching the pole scale at all. Formalizing the uniqueness half also pins down what "the" running coupling means: the explicit formula is not merely one solution of the renormalization-group equation but the only one through a given data point.

An earlier public mission on the same source ("Coupling Constant: One-Loop Running, Asymptotic Freedom and the Landau Pole") formalized the one-loop flow in the logarithmic variable t=ln⁡μt = \ln\mut=lnμ with a cubic beta function β(g)=b g3\beta(g) = b\,g^3β(g)=bg3, and its statements are proved. This mission is stated in the other variable the source uses — the energy scale μ\muμ itself, with the quadratic one-loop equation for α\alphaα — and adds the parts of the source that the earlier mission does not cover: the defining identity between the two forms of the beta function, the sign-to-monotonicity statements for an arbitrary (not necessarily one-loop) coupling, the explicit pole scale, and the determination of the QCD scale Λ\LambdaΛ from a measurement. Where the earlier mission already settles a statement in the quoted formula's variables, this proposal references the published theorem instead of restating it.

Difficulty

The equation is elementary, and the difficulty is entirely in what the statements quantify over. The negative-coefficient half asserts that every function satisfying the equation on [μ0,∞)[\mu_0,\infty)[μ0​,∞) is the explicit one, so it needs a uniqueness argument for a nonlinear scalar ordinary differential equation rather than a verification that a formula works; the substitution u=1/αu = 1/\alphau=1/α that makes the equation linear is legitimate only while α\alphaα is known not to vanish, which is part of what has to be proved. The positive-coefficient half is a non-existence statement on a closed interval reaching the pole, so no local solution can be extended to it; the naive attempt — differentiate the explicit formula and observe that it blows up — proves nothing about the other candidate solutions.

Formalization scope

Couplings are total functions R→R\mathbb{R} \to \mathbb{R}R→R, and every statement restricts to the scales it is about: the positive half-line for the beta-function statements, (Λ,∞)(\Lambda,\infty)(Λ,∞) for the explicit QCD formula, [μ0,∞)[\mu_0,\infty)[μ0​,∞) or a closed interval for the one-loop flow. Outside those ranges nothing is claimed — in particular at Q≤ΛQ \le \LambdaQ≤Λ, where the logarithm in the quoted formula vanishes or is negative and the reciprocal returns a junk value. Differentiability is a hypothesis where it is needed, written as a two-sided derivative at each scale of the set, so that a statement cannot be satisfied by a one-sided artefact at an endpoint. The one-loop property is phrased as an exact differential equation, never as an asymptotic approximation, and the Landau-pole milestone is a non-existence claim rather than a divergence claim, so it cannot be discharged by exhibiting a formula with a singularity.

A complete development needs the mean value theorem, Gronwall- or uniqueness-type arguments for scalar ordinary differential equations, and the standard logarithm and exponential API; the uniqueness lemma for u˙=bu2\dot u = b u^2u˙=bu2 and the reciprocal substitution are reusable beyond this mission. Contributions of a general scalar-ODE uniqueness lemma, usable by both this mission and the earlier one, are especially welcome.

Selected references

  • Wikipedia, Coupling constant, revision 1354339557. https://en.wikipedia.org/w/index.php?title=Coupling_constant&oldid=1354339557
  • A. Deur, S. J. Brodsky, G. F. de Téramond, The QCD running coupling, Progress in Particle and Nuclear Physics 90 (2016) 1-74. https://arxiv.org/abs/1604.08082
  • ATLAS Collaboration, A precise determination of the strong-coupling constant from the recoil of Z bosons with the ATLAS experiment at s=8\sqrt{s} = 8s​=8 TeV, 2023. https://arxiv.org/abs/2309.12986
  • P. A. Zyla et al. (Particle Data Group), Review of Particle Physics - Chapter 9, Quantum Chromodynamics, PTEP 2020 (8). https://doi.org/10.1093/ptep/ptaa104
12 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: Lucas

Verlinde 2016: Apparent Dark Matter and the Baryonic Tully-Fisher RelationResearch Paper

Motivation

In emergent gravity proposals, spacetime and gravity are macroscopic descriptions of an underlying quantum system. In Verlinde (2016) it is argued that in de Sitter space (a universe with positive dark energy) the entanglement entropy has, besides the usual area-law part, a thermal volume-law part, and that matter displaces this volume-law entropy. The elastic response of the medium to this displacement produces an extra gravitational pull, which the paper proposes as the origin of the effects usually ascribed to dark matter in galaxies and clusters.

The physical derivation is heuristic, but it ends in explicit mathematical relations between the baryonic (visible) mass profile MB(r)M_B(r)MB​(r) and the apparent dark matter mass profile MD(r)M_D(r)MD​(r) of a spherically symmetric, isolated system. The central one is the integral relation (7.40),

∫0rG MD(r′)2r′2 dr′=MB(r) a0 r6,\int_0^r \frac{G\,M_D(r')^2}{r'^2}\,dr' = \frac{M_B(r)\,a_0\,r}{6},∫0r​r′2GMD​(r′)2​dr′=6MB​(r)a0​r​,

where GGG is Newton's constant and a0=cH0a_0 = cH_0a0​=cH0​ is the Hubble acceleration scale. For a point mass it reproduces Milgrom's empirical acceleration relation and the baryonic Tully-Fisher relation vf4=aMGMBv_f^4 = a_M G M_Bvf4​=aM​GMB​ with aM=a0/6a_M = a_0/6aM​=a0​/6.

Setting

All quantities are real numbers or real functions of the radius r>0r>0r>0. G>0G>0G>0 and a0>0a_0>0a0​>0 are constants. MB(r)M_B(r)MB​(r) and MD(r)M_D(r)MD​(r) are the baryonic and apparent dark masses inside radius rrr. The Newtonian accelerations are gB(r)=GMB(r)/r2g_B(r) = GM_B(r)/r^2gB​(r)=GMB​(r)/r2 and gD(r)=GMD(r)/r2g_D(r) = GM_D(r)/r^2gD​(r)=GMD​(r)/r2 (7.42). The averaged density inside radius rrr is ρˉ(r)=3M(r)/(4πr3)\bar\rho(r) = 3M(r)/(4\pi r^3)ρˉ​(r)=3M(r)/(4πr3) (7.45), and the slope parameter is β(r)=− dlog⁡ρˉ/dlog⁡r=−rρˉ′(r)/ρˉ(r)\beta(r) = -\,d\log\bar\rho/d\log r = -r\bar\rho'(r)/\bar\rho(r)β(r)=−dlogρˉ​/dlogr=−rρˉ​′(r)/ρˉ​(r) (7.46). A local density ρ\rhoρ gives M(r)=∫0rρ(r′) 4πr′2 dr′M(r) = \int_0^r \rho(r')\,4\pi r'^2\,dr'M(r)=∫0r​ρ(r′)4πr′2dr′ (7.39).

The paper also uses two purely mathematical facts about elastic strain in d−1d-1d−1 spatial dimensions: a bound (7.30) on the largest principal strain of a traceless symmetric strain tensor, and the integration-by-parts identity (7.31) between the squared Hessian and the squared Laplacian.

Formalization targets

Goal: Milgrom relation for a central point mass (7.43)

If MB>0M_B>0MB​>0 is constant and (7.40) holds for every r>0r>0r>0, then for every r>0r>0r>0

gD(r)=aM gB(r),aM=a06.g_D(r) = \sqrt{a_M\, g_B(r)}, \qquad a_M = \frac{a_0}{6}.gD​(r)=aM​gB​(r)​,aM​=6a0​​.

Milestones

  • (4.44) the strain-squared integral outside a spherical inclusion: ∫c∞(c/V)2 dV=c\int_{c}^{\infty} (c/V)^2\,dV = c∫c∞​(c/V)2dV=c.
  • (7.30) ε2≤d−2d−1∑ijεij′2\varepsilon^2 \le \frac{d-2}{d-1}\sum_{ij}\varepsilon'^2_{ij}ε2≤d−1d−2​∑ij​εij′2​ for a traceless symmetric ε′\varepsilon'ε′ with eigenvalue ε\varepsilonε.
  • (7.31) ∫(∇i∇jχ)2 dV=∫(∇2χ)2 dV\int (\nabla_i\nabla_j\chi)^2\,dV = \int (\nabla^2\chi)^2\,dV∫(∇i​∇j​χ)2dV=∫(∇2χ)2dV.
  • (7.47) ρˉD(r)2=(4−βB(r)) a0 ρˉB(r)8πGr\bar\rho_D(r)^2 = (4-\beta_B(r))\,\frac{a_0\,\bar\rho_B(r)}{8\pi G r}ρˉ​D​(r)2=(4−βB​(r))8πGra0​ρˉ​B​(r)​ for a general baryonic profile.
  • (7.48) ρD(r)=(1−13βD(r)) ρˉD(r)\rho_D(r) = (1-\tfrac13\beta_D(r))\,\bar\rho_D(r)ρD​(r)=(1−31​βD​(r))ρˉ​D​(r).
  • (7.51) ΩD2=43 ΩB\Omega_D^2 = \tfrac43\,\Omega_BΩD2​=34​ΩB​ when (7.47) is applied at the Hubble radius with βB=0\beta_B = 0βB​=0.

Significance

The point-mass relation (7.43) is what connects the paper to the observed flat rotation curves and the baryonic Tully-Fisher law; (7.47) is its extension to extended mass profiles, which the paper uses to discuss galaxy clusters. The formal content checked here is the mathematics that turns the stated relation (7.40) into these observable consequences, plus the two elasticity lemmas used on the way to (7.40). The physical steps that lead to (7.40) (the entropy-displacement picture, the elastic interpretation, the identification (7.35)) are not mathematical statements and are outside the scope of this mission. None of these relations is known to have been machine-checked before.

Difficulty

The algebra is short once one may differentiate; the work is in the analysis. (7.40) is an integral identity with a singular weight 1/r′21/r'^21/r′2 at the origin, so recovering pointwise information requires the fundamental theorem of calculus on (0,∞)(0,\infty)(0,∞) with only continuity there, and care with integrability at 000. (7.31) is a double integration by parts in Rn\mathbb R^nRn that must be justified for the chosen decay class. (7.30) needs the spectral theorem for symmetric matrices, or an equivalent argument.

Formalization scope

All statements live in the namespace Verlinde2016. Radial profiles are functions R→R\mathbb R\to\mathbb RR→R, with hypotheses only on (0,∞)(0,\infty)(0,∞). The integral in (7.40) is Lean's interval integral over [0,r][0,r][0,r]; since it would be 000 for a non-integrable integrand, the positivity of the right-hand side forces integrability. Continuity of MDM_DMD​ (and of densities) on (0,∞)(0,\infty)(0,∞) is taken as a standing physical convention. In (7.31) the paper's condition that "χ\chiχ falls off rapidly enough" is formalized as χ\chiχ smooth with compact support. Spatial dimension is d−1d-1d−1 in (7.30); (7.40)–(7.51) use d=4d=4d=4 as in Section 7.2. Definitions: avgDensity, slopeParam, partialDeriv.

Selected references

  • E. Verlinde, Emergent Gravity and the Dark Universe, SciPost Phys. 2, 016 (2017). https://arxiv.org/abs/1611.02269
  • M. Milgrom, A modification of the Newtonian dynamics as a possible alternative to the hidden mass hypothesis, Astrophys. J. 270 (1983) 365. https://doi.org/10.1086/161130
8 thms3 active usersReviewed
PreviousPage 2 of 13Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me