Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hille-Yosida semigroup with exact generator

Proved
EthierKurtz.oblique_hy_semigroup

by caleb · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-processesprobability

Hille-Yosida semigroup with exact generator.

Assume the dissipative estimate and the dense-range statement for the closed reflected graph AAA of Theorem 1.5. Then there exists a strongly continuous contraction semigroup TTT on C(Ωˉ)C(\bar\Omega)C(Ωˉ) whose generator is exactly AAA:

lim⁡t↓0t−1(Ttf−f)=g  ⟺  (f,g)∈A.\lim_{t \downarrow 0} t^{-1}(T_t f - f) = g \iff (f, g) \in A.t↓0lim​t−1(Tt​f−f)=g⟺(f,g)∈A.

This is the abstract generation half of the Hille--Yosida argument: the two resolvent estimates produce the semigroup and identify its generator, before any positivity or conservativeness is established.

Formalization Note Lean takes the two estimates as explicit hypotheses and quantifies TTT over R→((closure Ω)→b R)\toL[R]((closure Ω)→b R)\mathbb{R} \to ((closure~\Omega) \to^b~\mathbb{R}) \toL[\mathbb{R}] ((closure~\Omega) \to^b~\mathbb{R})R→((closure Ω)→b R)\toL[R]((closure Ω)→b R), with convergence in the N[>](0)\mathcal{N}[>](0)N[>](0) filter.

Preamble
import Definitions.Def_EthierKurtz_BoundaryCTwiceHolder
import Definitions.Def_EthierKurtz_BoundaryCOnceHolder
import Definitions.Def_EthierKurtz_IsOutwardUnitNormal
import Definitions.Def_EthierKurtz_obliqueDiffusionGraph
import Definitions.Def_EthierKurtz_IsStronglyContinuousContractionSemigroup

open Filter
open scoped Topology BoundedContinuousFunction

namespace EthierKurtz
Formal statement
/-- Hille-Yosida semigroup with exact generator: dissipativity plus dense
range for the closed reflected graph produces a strongly continuous
contraction semigroup whose generator is exactly the graph. -/
theorem oblique_hy_semigroup (n : ℕ) (hd : 2 ≤ n + 1)
    (Ω : Set (EuclideanSpace ℝ (Fin (n + 1))))
    (hbounded : Bornology.IsBounded Ω) (hconnected : IsConnected Ω)
    (hopen : IsOpen Ω) (μ : ℝ) (hμ : 0 < μ ∧ μ ≤ 1)
    (hboundary : BoundaryCTwiceHolder Ω μ)
    (a : EuclideanSpace ℝ (Fin (n + 1)) → Matrix (Fin (n + 1)) (Fin (n + 1)) ℝ)
    (b c normal : EuclideanSpace ℝ (Fin (n + 1)) → EuclideanSpace ℝ (Fin (n + 1)))
    (ha : ∀ x ∈ Ω, (a x).PosSemidef)
    (haHolder : ∀ i j, ComponentHolder Ω μ (fun x => a x i j))
    (hbHolder : ∀ i, ComponentHolder Ω μ (fun x => b x i))
    (helliptic : ∃ ε : ℝ, 0 < ε ∧ ∀ x ∈ Ω,
      ∀ θ : EuclideanSpace ℝ (Fin (n + 1)), ‖θ‖ = 1 →
        ε ≤ ∑ i, ∑ j, θ i * a x i j * θ j)
    (hc : ∀ i, BoundaryCOnceHolder Ω μ (fun x => c x i))
    (hnormal : ∀ x ∈ frontier Ω, IsOutwardUnitNormal Ω x (normal x))
    (hoblique : ∃ ε : ℝ, 0 < ε ∧ ∀ x ∈ frontier Ω,
      ε ≤ ∑ i, c x i * normal x i)
    (hest : ∀ fg ∈ closure (obliqueDiffusionGraph Ω μ a b c),
      ∀ lam : ℝ, 0 < lam → lam * ‖fg.1‖ ≤ ‖lam • fg.1 - fg.2‖)
    (hrange : ∃ lam₀ : ℝ, 0 < lam₀ ∧ ∀ h : (closure Ω) →ᵇ ℝ, ∀ delta : ℝ,
      0 < delta → ∃ fg ∈ closure (obliqueDiffusionGraph Ω μ a b c),
        ‖(lam₀ • fg.1 - fg.2) - h‖ < delta) :
    let A := closure (obliqueDiffusionGraph Ω μ a b c)
    ∃ T : ℝ → ((closure Ω) →ᵇ ℝ) →L[ℝ] ((closure Ω) →ᵇ ℝ),
      IsStronglyContinuousContractionSemigroup T ∧
      (∀ f g, Tendsto (fun t : ℝ => t⁻¹ • (T t f - f))
        (𝓝[>] (0 : ℝ)) (𝓝 g) ↔ (f, g) ∈ A) := by sorry
Source
Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, Wiley, 1986. Chapter 8, Section 1, Theorem 1.5, printed p. 369 (PDF p. 378); Hille-Yosida generation with (1.15) and (1.19)--(1.20).

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