Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generation of the reflected semigroup with exact generator

Proved
EthierKurtz.oblique_semigroup_generation

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

markov-processesprobability

Generation of the obliquely reflected semigroup with exact generator.

Let Ω⊂Rn+1\Omega \subset \mathbb{R}^{n+1}Ω⊂Rn+1 be a bounded connected open set with C2,μC^{2,\mu}C2,μ boundary, and let L=12∑aij∂ij+∑bi∂iL = \tfrac{1}{2}\sum a_{ij}\partial_{ij} + \sum b_i\partial_iL=21​∑aij​∂ij​+∑bi​∂i​ be uniformly elliptic with H"older coefficients. Let ccc be a C1,μC^{1,\mu}C1,μ reflection field uniformly oblique to the outward unit normal on the boundary, and let AAA be the closure of the operator graph defined by (1.15) with the oblique boundary condition (1.19)--(1.20). Then there exists a strongly continuous contraction semigroup TTT on C(Ωˉ)C(\bar\Omega)C(Ωˉ) that is positive (f≥0  ⟹  Ttf≥0f \ge 0 \implies T_t f \ge 0f≥0⟹Tt​f≥0) and conservative (Tt1=1T_t 1 = 1Tt​1=1), 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 existence / Hille--Yosida half of Theorem 1.5: the resolvent of the oblique-derivative elliptic problem inverts λ−A\lambda - Aλ−A on a dense set, and the generated semigroup is identified as the reflected diffusion.

Formalization Note Lean 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) and expresses the generator identity through 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
/-- Semigroup generation with exact generator identification: under the
hypotheses of Theorem 1.5, the closed graph is exactly the generator of a
conservative positive strongly continuous contraction semigroup. -/
theorem oblique_semigroup_generation (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) :
    let A := closure (obliqueDiffusionGraph Ω μ a b c)
    ∃ T : ℝ → ((closure Ω) →ᵇ ℝ) →L[ℝ] ((closure Ω) →ᵇ ℝ),
      IsStronglyContinuousContractionSemigroup T ∧
      (∀ t : ℝ, 0 ≤ t → ∀ f, (∀ x, 0 ≤ f x) → ∀ x, 0 ≤ T t f x) ∧
      (∀ t : ℝ, 0 ≤ t → T t 1 = 1) ∧
      (∀ 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); operator equation (1.15) and boundary equations (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