Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — upper semicontinuity of the delayed hitting probability

Proved
OptStopC1.SpaceDeriv.lemma_1

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regularitystochastic-processes

Let D⊆RdD\subseteq\mathbb R^dD⊆Rd be closed and let XXX be a standard Markov flow. If XXX is strong Feller, then for every ε>0\varepsilon>0ε>0,

x⟼Px(σD≥ε)is upper semicontinuous on Rd.x\longmapsto P_x(\sigma_D\ge\varepsilon)\quad\text{is upper semicontinuous on }\mathbb R^d.x⟼Px​(σD​≥ε)is upper semicontinuous on Rd.

This is the first link from strong Feller continuity to boundary regularity. The hitting time is the first strictly positive time in DDD.

Preamble
import Definitions.Def_OptStopC1_SpaceDeriv_LocalBounds

open MeasureTheory Filter Set
open scoped NNReal ENNReal Topology Interval
Formal statement
namespace OptStopC1.SpaceDeriv

theorem lemma_1
    {d : ℕ} (hd : 0 < d) {Ω : Type*} [mΩ : MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (𝔽 : Filtration ℝ≥0 mΩ) (X : Flow d Ω)
    (hX : IsStandardMarkovFlow X P 𝔽)
    (D : Set (State d)) (hD : IsClosed D)
    (hF : IsStrongFeller X P) (ε : ℝ≥0) (hε : 0 < ε) :
    UpperSemicontinuous
      (fun x : State d => P {ω | (ε : ℝ≥0∞) ≤ hittingTime X x D ω}) := by sorry
end OptStopC1.SpaceDeriv
Source
De Angelis & Peskir, Global C¹ Regularity of the Value Function in Optimal Stopping Problems, arXiv:1812.04564v2, p. 9, Lemma 1, equation (3.1)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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