Hille-Yosida and BCR Semigroup Theory
A Lean 4 formalization of contraction semigroups (Hille-Yosida), Bernstein's theorem for completely monotone functions, and the BCR Bochner theorem (Theorem 4.1.13) for positive-definite functions on involutive semigroups.
Main Results
Hille-Yosida Resolvent Theorem (fully proved, 0 axioms)
For a contraction semigroup
Bernstein's Theorem (fully proved, 0 axioms)
A completely monotone function on
BCR Theorem 4.1.13 -- Semigroup Bochner (fully proved, 0 axioms)
Bounded continuous positive-definite functions on
Existence (semigroupGroupBochner): decomposes into spatial Bochner + temporal BCR d=0 + product measure assembly.
Uniqueness (laplaceFourier_unique): finite measures on
File Structure
Axiom Inventory
All main theorems are fully proved with 0 axioms and 0 sorry's — the library is now
axiom-free. (Future/GenerationTheorem.lean, the converse Hille–Yosida / Lumer–Phillips
direction, holds only scaffolding — the IsDissipative setup — and no longer declares
axioms.) The kernel-authoritative audit is in AXIOM_AUDIT.md; generate the
live trace with lake env lean audit/axiom_report.lean.
Assurance conventions
This project follows
math-commons/formalization-assurance
(verification / validation / faithfulness, axiom vetting, formalization.yaml, object
contracts). Local settings:
| Setting | Where |
|---|---|
| Project card | formalization.yaml |
| Axiom audit | AXIOM_AUDIT.md — 0 axioms |
| Vetting strictness | audit/vetting/policy.yml — L1 |
| Faithfulness (informal↔formal) | audit/FAITHFULNESS.md |
| Acceptance / characterization | audit/VALIDATION.md |
| Object contracts | audit/contracts/ — known_values cards (resolvent, completelyMonotone) |
| Kernel axiom report | audit/axiom_report.lean (generator) |
| CI assurance gate | .github/workflows/assurance.yml → the hub's reusable assure.yml (build + axiom-report-in-sync + sorry-confinement; warn-only at L1) |
Machine-gate TODO: commit the golden
audit/axiom-report.txtfrom a build (lake env lean audit/axiom_report.lean > audit/axiom-report.txt) and raise the policy toL2to enforce.
BCR d=0: Proof Architecture (1503 lines)
The core engine semigroup_pd_laplace in BCR_d0.lean proves that bounded continuous semigroup-PD functions on
- PD to alternating differences: Vandermonde convolution for even order, convexity bootstrap for odd order
- Iterated integral bridge: The n-th forward difference equals the n-th iterated integral of the n-th derivative (bypasses Widder IV.12a)
- Mollifier trick: Smooth approximation inherits alternating differences, hence is
IsCompletelyMonotone - Bernstein to measures: Apply
bernstein_theoremto each mollified function - Prokhorov extraction: Uniform mass bound + tightness gives weak limit
- Verification: Pointwise convergence + Laplace convergence gives the representation
Application: QFT Reconstruction
This project provides the semigroupGroupBochner theorem needed by OSreconstruction for the E-to-R direction of Osterwalder-Schrader reconstruction. The Fourier-Laplace measure representation connects Euclidean contraction semigroups
Dependencies
- Mathlib (v4.29.0-rc6)
- BochnerMinlos -- Bochner's theorem for finite-dimensional PD functions
References
- Berg-Christensen-Ressel, Harmonic Analysis on Semigroups (1984), Theorem 4.1.13
- Engel-Nagel, One-Parameter Semigroups for Linear Evolution Equations, GTM 194 (2000)
- Widder, The Laplace Transform (1941), Chapter IV
- Reed-Simon I-II (1972-1975)
Author
Michael R. Douglas
License
Copyright (c) 2026 Michael R. Douglas. Released under the Apache 2.0 license.