Full text not available for this paper
Summary (Overview)
- This paper presents a comprehensive formalisation in Lean 4 of the solvability of the Dirichlet problem for second-order linear elliptic operators in divergence form, built on top of Mathlib.
- The machine-verified results (with no
sorryin the development) include the Poincaré inequality, Lax–Milgram theorem, Rellich–Kondrachov compactness, Fredholm alternative, spectral theorem, interior regularity estimates, and the Sobolev embedding theorem. - The authors develop a self-contained theory of Sobolev spaces independently of existing formalisations, using a weak-derivative Hilbert space approach.
- The library achieves classical solvability for sufficiently regular coefficients and data, with every prose statement associated with a named machine-checked Lean declaration.
- The development was assisted by language models (Claude Opus 4.5 and 5) used as agents, though no model output forms part of the trusted proof object—the Lean kernel checks every proof term.
Introduction and Theoretical Foundation
The paper addresses the formalisation of partial differential equation (PDE) theory in interactive proof assistants, an area still in its early stages. While mathematical analysis has recently come within reach of proof assistants, PDE theory formalisation lags behind. Previous work includes interior De Giorgi–Nash–Moser regularity theory in Lean 4 [AK26], Gagliardo–Nirenberg–Sobolev inequality formalisations [DM24], and Schwartz functions and tempered distributions [Dol25].
The mathematical foundation concerns second-order linear partial differential operators in divergence form with coefficients :
The operator is uniformly elliptic if there exist constants such that for each :
The Dirichlet problem is:
A weak solution satisfies:
where the bilinear form is:
The approach follows the two-stage classical strategy: first obtain weak solutions via functional-analytic methods (Lax–Milgram and Fredholm alternative), then show via interior regularity estimates and Sobolev embedding that weak solutions are classical when coefficients and data are sufficiently regular.
Methodology
Formalisation Framework
The formalisation assigns one of four statuses to each proof obligation:
- Discharged: established by a machine-checked Lean proof term
- Warranted: deferred to a located external source
- Routine: relies on shared mathematical competence
- Open: no justification given
Acceptance criteria are mechanical: the full development must build from a clean clone with no sorry and no warnings, the environment linter must pass, and #print axioms must report exactly the three standard Lean core axioms (propositional extensionality, axiom of choice, and quotient soundness).
Library Architecture
The library consists of three layers:
-
Weak-derivative Sobolev layer: Sobolev spaces realised as weak-derivative Hilbert spaces, where a member is an function together with its gradients. The ambient space is , encoded as
PiLp 2overFin (n + 1). The space is the topological closure of test-function graphs. -
Poincaré reduction layer: The Poincaré constant is derived from one-dimensional estimates. Two key lemmas are formalised:
- Lemma 1 (One-dimensional Cauchy–Schwarz):
- Lemma 2 (One-dimensional Poincaré):
-
Sobolev embedding layer: Provides passage from equivalence classes to pointwise-defined functions, using Gagliardo–Nirenberg–Sobolev and Morrey inequalities.
Key Formalised Theorems
Theorem 1 (Poincaré inequality): For bounded , there exists such that for all .
Theorem 2 (Lax–Milgram): For a Hilbert space with bounded coercive bilinear form satisfying for , and , there is a unique with for all .
Theorem 3 (Gårding inequality): With :
Theorem 5 (Fredholm alternative): For bounded measurable and uniformly elliptic , either the homogeneous problem has a non-zero weak solution, or for every , the problem has a unique weak solution.
Theorem 10 (Sobolev embedding): For , bounded open with boundary, , , :
- If , then with
- If , then with
Theorem 11 (Interior regularity): If , , , and is a weak solution, then with for each open .
Theorem 12 (Higher interior regularity): With and , a weak solution satisfies with appropriate estimates.
Theorem 13 (Infinite differentiability): With coefficients and data, weak solutions have smooth representatives.
Empirical Validation / Results
The paper provides detailed Lean statements for each theorem. Key results include:
Corollary 1 (Poisson equation): For every , there is a unique with for every .
Theorem 4 (Existence I): For bounded , uniformly elliptic with and , the problem (3) has a unique weak solution with where .
Theorem 7 (Variational principle): For symmetric coercive with compact embedding, is attained, and the minimiser satisfies for all .
Theorem 8 (Spectrum of compact operator): For compact operator on infinite-dimensional real Hilbert space, zero lies in the spectrum, non-zero spectrum consists of countably many eigenvalues with finitely many satisfying for each .
Corollary 3 (Classical solvability): With principal coefficients, coefficients, and data for all , the Dirichlet problem has a unique weak solution with a smooth representative satisfying pointwise almost everywhere.
The discharge ratio (fraction of claimed results established by named Lean declarations) is 1—every claimed result is discharged by a named declaration with no warranted, routine, or open steps.
Theoretical and Practical Implications
-
Mathematical significance: The formalisation covers the complete chain from weak solvability through regularity to classical solvability, representing a substantial portion of modern linear elliptic PDE theory placed on machine-verified footing.
-
Technical contributions:
- The Poincaré inequality is derived from one-dimensional estimates alone, giving explicit constants
- Compactness of the embedding is proved via the Fréchet–Kolmogorov criterion
- The declaration for Theorem 12 takes weaker hypotheses (, ) than the classical statement
- Variational construction of eigenvalues is independent of the spectral theorem and extends to semilinear equations
-
Practical implications: The library provides reusable infrastructure for further formalisation work in PDE theory, including boundary regularity, Harnack's inequality, and Schauder theory.
Conclusion
The paper successfully formalises the classical solvability of the Dirichlet problem for linear elliptic PDEs in divergence form using Lean 4 and Mathlib. Key achievements include:
- A self-contained weak-derivative Sobolev space theory
- Complete proofs of existence, uniqueness, and regularity theorems
- Explicit correspondence between prose statements and machine-checked Lean declarations
Future directions identified by the authors include:
- Removing the hypothesis on principal coefficients (requires identifying functions with Lipschitz representatives)
- Boundary regularity theory (closest to completion, with half-ball geometry and tangential difference quotients already formalised)
- Harnack's inequality (requires Moser iteration, not yet in the library)
- Schauder theory (Campanato's characterisation proved but unused)
- Completion of eigenvalue theory (positivity and simplicity of require strong maximum principle)
- Boundary integration by parts against surface measure (requires divergence theorem on manifolds with boundary, as in [CLQ26])
The library is openly available at https://github.com/alejandro-soto-franco/EllipticPDE, pinned at commit da8dd98, built with Lean 4 v4.31.0-rc1 and Mathlib commit 542645a.
Related papers
- The Economics of Recursive Self-Improvement
A formal elasticity framework shows current AI feedback loops fall below the self-sustaining acceleration threshold, though trends suggest it may soon be crossed.
- Why Gated DeltaNet Survives 4-Bit Quantization: NVFP4 W4A4 for the Recurrent Half of a Hybrid 27B LLM
NVFP4 W4A4 quantization matches BF16 accuracy on a hybrid 27B LLM because Gated DeltaNet's gating and delta-rule recurrence make it more robust to quantization than attention layers.
- GenLimitLib: A Formal Library for Language Generation in the Limit and AI-Assisted Mathematical Research
GenLimitLib, a 124,000-line Lean formalization of 30 papers, boosts AI proof success from 48% to 79% and yields three new mathematical results.