Theorem 5.38 — Lumer–Phillips theorem
ProvedHunterPDE.Semigroup.lumer_phillipsLet be a Banach space over or and a linear operator. Then is the generator of a strongly continuous contraction semigroup on if and only if
- is closed and densely defined, and
- is m-dissipative: for every real ,
and maps onto for some .
The Lumer–Phillips theorem replaces the resolvent estimates of the Hille–Yosida theorem by an energy inequality and a solvability condition for one resolvent equation, which is how semigroup generation is usually verified for PDEs (for example, for the Laplacian on ).
Formalization Note. "Generator" is Definition 5.30: the left side says there is a strongly continuous contraction semigroup whose generator equals , domain included. Operators are Mathlib's partially defined linear maps X →ₗ.[𝕜] X; closedness is closedness of the graph.
import Mathlib import Definitions.Def_HunterPDE_Semigroup_C0Semigroup import Definitions.Def_HunterPDE_Semigroup_Resolvent
namespace HunterPDE.Semigroup
/-- Theorem 5.38 (Lumer–Phillips) of Hunter, *Notes on PDEs* (p. 147). An operator
`A : D(A) ⊂ X → X` in a Banach space `X` (over `𝕜 = ℝ` or `ℂ`) is the generator of a contraction
semigroup on `X` if and only if (1) `A` is closed and densely defined; (2) `A` is m-dissipative
(Definition 5.37). "Generator" is Definition 5.30: the generator's domain is exactly where the
right difference quotient converges, so the left side says `A` equals, domain included, the
generator of some strongly continuous contraction semigroup. -/
theorem lumer_phillips {𝕜 : Type*} [RCLike 𝕜] {X : Type*} [NormedAddCommGroup X]
[NormedSpace 𝕜 X] [CompleteSpace X] (A : X →ₗ.[𝕜] X) :
(∃ T : ℝ → X →L[𝕜] X, IsContractionSemigroup T ∧ IsGenerator T A) ↔
(A.IsClosed ∧ Dense (A.domain : Set X)) ∧ IsMDissipative A := by sorry
end HunterPDE.Semigroup
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a field that is either or (formally, any field with Mathlib's "real-or-complex" structure). Let be a Banach space over : a normed vector space over that is complete. Let be a partially defined linear operator from to . Concretely, has a domain , which is a linear subspace of , and is -linear. No other assumptions are placed on . The statement says that two conditions are equivalent (each implies the other).
Left side. There is a family of bounded linear operators
indexed by every real number , negative values included, such that both of the following hold:
- satisfies the predicate .
- and together satisfy the predicate .
Both predicates are defined in the imported bundle files Def_HunterPDE_Semigroup_C0Semigroup and Def_HunterPDE_Semigroup_Resolvent, and their definitions were not given to this auditor. So this read-back cannot spell out what they require. In particular, it cannot say:
- whether "contraction semigroup" includes strong continuity, , the semigroup law, and ;
- which values of those conditions cover;
- whether "generator" requires to equal exactly the set of where converges as , and to equal that limit.
The docstring attached to the theorem describes these meanings, but a docstring is commentary, not code. Nothing here confirms it.
Right side. All three of the following hold:
- is closed: its graph is a closed subset of (this is Mathlib's standard notion).
- is densely defined: is dense in in the norm topology.
- satisfies the predicate . This is also defined in the unseen bundle files, so its content (for example, a dissipativity inequality together with some range condition on ) cannot be confirmed here.
The statement is a biconditional. It asserts both directions: if such a exists, then has all three properties; and if has all three properties, then such a exists.
Degenerate cases. If , then and is the zero map. Its graph is the single point , so is closed, and is dense. The right side then reduces to whether holds for the zero operator on the zero space. On the left side, the only possible family is for all . So the left side reduces to whether that constant family satisfies both unseen predicates. With the definitions unavailable, it cannot be determined whether these cases are true or vacuous. There is no restriction on : it may be even when is nontrivial, and in that case the density condition fails. is defined on all of , so its values at negative exist but are constrained only as far as the unseen predicates constrain them. No division, natural-number subtraction, integral or supremum appears in the statement itself; any such default values would sit inside the unseen definitions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.