Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.38 — Lumer–Phillips theorem

Proved
HunterPDE.Semigroup.lumer_phillips

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysislumer-phillipsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesemigroups

Let XXX be a Banach space over K=R\mathbb{K} = \mathbb{R}K=R or C\mathbb{C}C and A:D(A)⊂X→XA : \mathcal{D}(A) \subset X \to XA:D(A)⊂X→X a linear operator. Then AAA is the generator of a strongly continuous contraction semigroup on XXX if and only if

  1. AAA is closed and densely defined, and
  2. AAA is m-dissipative: for every real λ>0\lambda > 0λ>0,
λ∥f∥≤∥(λI−A)f∥for all f∈D(A),\lambda\|f\| \le \|(\lambda I - A) f\| \qquad \text{for all } f \in \mathcal{D}(A),λ∥f∥≤∥(λI−A)f∥for all f∈D(A),

and λI−A\lambda I - AλI−A maps D(A)\mathcal{D}(A)D(A) onto XXX for some λ>0\lambda > 0λ>0.

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 H2(Rn)⊂L2(Rn)H^2(\mathbb{R}^n) \subset L^2(\mathbb{R}^n)H2(Rn)⊂L2(Rn)).

Formalization Note. "Generator" is Definition 5.30: the left side says there is a strongly continuous contraction semigroup whose generator equals AAA, domain included. Operators are Mathlib's partially defined linear maps X →ₗ.[𝕜] X; closedness is closedness of the graph.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Semigroup_C0Semigroup
import Definitions.Def_HunterPDE_Semigroup_Resolvent
Formal statement
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
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 147, Theorem 5.38
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let K\mathbb{K}K be a field that is either R\mathbb{R}R or C\mathbb{C}C (formally, any field with Mathlib's "real-or-complex" structure). Let XXX be a Banach space over K\mathbb{K}K: a normed vector space over K\mathbb{K}K that is complete. Let AAA be a partially defined linear operator from XXX to XXX. Concretely, AAA has a domain D(A)D(A)D(A), which is a linear subspace of XXX, and A:D(A)→XA : D(A) \to XA:D(A)→X is K\mathbb{K}K-linear. No other assumptions are placed on AAA. The statement says that two conditions are equivalent (each implies the other).

Left side. There is a family of bounded linear operators

T:R→L(X),t↦T(t),T : \mathbb{R} \to \mathcal{L}(X), \qquad t \mapsto T(t),T:R→L(X),t↦T(t),

indexed by every real number ttt, negative values included, such that both of the following hold:

  • TTT satisfies the predicate IsContractionSemigroup(T)\mathrm{IsContractionSemigroup}(T)IsContractionSemigroup(T).
  • TTT and AAA together satisfy the predicate IsGenerator(T,A)\mathrm{IsGenerator}(T, A)IsGenerator(T,A).

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, T(0)=IT(0) = IT(0)=I, the semigroup law, and ∥T(t)∥≤1\|T(t)\| \le 1∥T(t)∥≤1;
  • which values of ttt those conditions cover;
  • whether "generator" requires D(A)D(A)D(A) to equal exactly the set of xxx where 1t(T(t)x−x)\frac{1}{t}(T(t)x - x)t1​(T(t)x−x) converges as t→0+t \to 0^+t→0+, and AAA 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:

  1. AAA is closed: its graph {(x,Ax):x∈D(A)}\{(x, Ax) : x \in D(A)\}{(x,Ax):x∈D(A)} is a closed subset of X×XX \times XX×X (this is Mathlib's standard notion).
  2. AAA is densely defined: D(A)D(A)D(A) is dense in XXX in the norm topology.
  3. AAA satisfies the predicate IsMDissipative(A)\mathrm{IsMDissipative}(A)IsMDissipative(A). This is also defined in the unseen bundle files, so its content (for example, a dissipativity inequality together with some range condition on λI−A\lambda I - AλI−A) cannot be confirmed here.

The statement is a biconditional. It asserts both directions: if such a TTT exists, then AAA has all three properties; and if AAA has all three properties, then such a TTT exists.

Degenerate cases. If X={0}X = \{0\}X={0}, then D(A)={0}=XD(A) = \{0\} = XD(A)={0}=X and AAA is the zero map. Its graph is the single point {(0,0)}\{(0,0)\}{(0,0)}, so AAA is closed, and D(A)D(A)D(A) is dense. The right side then reduces to whether IsMDissipative(A)\mathrm{IsMDissipative}(A)IsMDissipative(A) holds for the zero operator on the zero space. On the left side, the only possible family is T(t)=0T(t) = 0T(t)=0 for all ttt. 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 D(A)D(A)D(A): it may be {0}\{0\}{0} even when XXX is nontrivial, and in that case the density condition fails. TTT is defined on all of R\mathbb{R}R, so its values at negative ttt 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.

Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me