Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.32 — the generator of a C₀ semigroup is closed and densely defined

Proved
HunterPDE.Semigroup.generator_isClosed_dense

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

functional-analysisp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1semigroupsunbounded-operators

Let XXX be a Banach space over K=R\mathbb{K} = \mathbb{R}K=R or C\mathbb{C}C, let {T(t):t≥0}\{T(t) : t \ge 0\}{T(t):t≥0} be a strongly continuous semigroup on XXX, and let A:D(A)⊂X→XA : \mathcal{D}(A) \subset X \to XA:D(A)⊂X→X be its generator. Then AAA is closed — its graph

G(A)={(f,Af):f∈D(A)}G(A) = \{(f, Af) : f \in \mathcal{D}(A)\}G(A)={(f,Af):f∈D(A)}

is a closed subset of X×XX \times XX×X — and its domain D(A)\mathcal{D}(A)D(A) is dense in XXX.

This is the first half of the necessity direction of the Hille–Yosida and Lumer–Phillips theorems.

Formalization Note. Closedness is Mathlib's LinearPMap.IsClosed (closed graph), the equivalent graph form of Definition 5.31 given on the same page.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Semigroup_C0Semigroup
Formal statement
namespace HunterPDE.Semigroup

/-- Theorem 5.32 of Hunter, *Notes on PDEs* (p. 145). If `A` is the generator (Definition 5.30)
of a strongly continuous semigroup `{T(t)}` on a Banach space `X`, then `A` is closed (its graph
is closed in `X × X`, Definition 5.31) and its domain `D(A)` is dense in `X`. -/
theorem generator_isClosed_dense {𝕜 : Type*} [RCLike 𝕜] {X : Type*} [NormedAddCommGroup X]
    [NormedSpace 𝕜 X] [CompleteSpace X] (T : ℝ → X →L[𝕜] X) (A : X →ₗ.[𝕜] X)
    (hT : IsC0Semigroup T) (hA : IsGenerator T A) :
    A.IsClosed ∧ Dense (A.domain : Set X) := by sorry

end HunterPDE.Semigroup
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 145, Theorem 5.32
Read-back

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

Setting.

  • K\mathbb{K}K is R\mathbb{R}R or C\mathbb{C}C, and XXX is a complete normed K\mathbb{K}K-space (a Banach space).
  • T:R→L(X)T : \mathbb{R} \to \mathcal{L}(X)T:R→L(X) is a family of bounded linear operators.
  • AAA is a partially defined linear operator: a subspace D(A)⊆XD(A) \subseteq XD(A)⊆X with a linear map A:D(A)→XA : D(A) \to XA:D(A)→X.

Hypotheses.

  1. TTT is a C₀ semigroup:
    • T(0)=IT(0) = IT(0)=I.
    • T(s)T(t)=T(s+t)T(s)T(t) = T(s+t)T(s)T(t)=T(s+t) for all s,t≥0s, t \ge 0s,t≥0.
    • For every f∈Xf \in Xf∈X, T(h)f→fT(h)f \to fT(h)f→f in norm as h↓0h \downarrow 0h↓0 (strictly positive hhh).
    • The values of TTT at negative times are unconstrained.
  2. AAA is the generator of TTT: for all f,g∈Xf, g \in Xf,g∈X,
lim⁡h↓01h(T(h)f−f)=g  ⟺  (f∈D(A) and Af=g).\lim_{h\downarrow 0}\frac{1}{h}\bigl(T(h)f - f\bigr) = g \iff \bigl(f \in D(A) \text{ and } Af = g\bigr).h↓0lim​h1​(T(h)f−f)=g⟺(f∈D(A) and Af=g).

Conclusion. Both of the following hold:

  • AAA is closed: its graph {(f,Af):f∈D(A)}\{(f, Af) : f \in D(A)\}{(f,Af):f∈D(A)} is a closed subset of X×XX \times XX×X.
  • D(A)D(A)D(A) is dense in XXX.

Degenerate cases. If X={0}X = \{0\}X={0}, the hypotheses hold for the only possible TTT and AAA, and the conclusion is trivially true. The theorem places no condition on T(t)T(t)T(t) for t<0t < 0t<0.

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