Theorem 1.5 — obliquely reflected diffusion generation
ProvedEthierKurtz.oblique_reflection_diffusionA uniformly elliptic diffusion on a bounded connected C²,μ region with a C¹,μ reflection field uniformly oblique to the outward normal has a single-valued closed reflected graph that is exactly the generator of a conservative positive strongly continuous contraction semigroup.
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
/-- The full obliquely reflected uniformly elliptic diffusion generation
statement, including graph single-valuedness and exact generator equality. -/
theorem oblique_reflection_diffusion (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)
(∀ f g₁ g₂, (f, g₁) ∈ A → (f, g₂) ∈ A → g₁ = g₂) ∧
∃ 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).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.