Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7 — for x ∈ E, x⁻¹ ∈ E ∩ D₀([0, ∞), [0, ∞))

Proved
WhittFLT.FirstPassage.firstPassage_mem

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

first-passage-timep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1skorohod-space

Let x∈Ex\in Ex∈E: x∈D([0,∞),R)x\in D([0,\infty),\mathbb R)x∈D([0,∞),R), unbounded above, with x(0)≥0x(0)\ge0x(0)≥0. Then its first passage time function x−1(t)=inf⁡{s≥0:x(s)>t}x^{-1}(t)=\inf\{s\ge0:x(s)>t\}x−1(t)=inf{s≥0:x(s)>t} satisfies

x−1∈E∩D0([0,∞),[0,∞)),x^{-1}\in E\cap D_0([0,\infty),[0,\infty)),x−1∈E∩D0​([0,∞),[0,∞)),

that is, x−1x^{-1}x−1 is càdlàg on [0,∞)[0,\infty)[0,∞), unbounded above, nonnegative at 000, nondecreasing on [0,∞)[0,\infty)[0,∞), and maps [0,∞)[0,\infty)[0,∞) into [0,∞)[0,\infty)[0,∞).

This places the first passage time map inside the spaces on which Theorems 7.1 and 7.2 state its continuity.

Formalization Note D0([0,∞),[0,∞))D_0([0,\infty),[0,\infty))D0​([0,∞),[0,∞)) is written as "càdlàg on [0,∞)[0,\infty)[0,∞), monotone on [0,∞)[0,\infty)[0,∞), maps [0,∞)[0,\infty)[0,∞) into [0,∞)[0,\infty)[0,∞)" (the paper's D0(T1,T2)D_0(T_1,T_2)D0​(T1​,T2​), p. 74, is the nondecreasing T2T_2T2​-valued paths in DDD).

Preamble
import Mathlib
import Definitions.Def_WhittFLT_FirstPassage_FirstPassage
Formal statement
namespace WhittFLT.FirstPassage

open Set Filter Topology

/-- Whitt (1980), §7, p. 82: for `x ∈ E`, `x⁻¹ ∈ E ∩ D₀([0, ∞), [0, ∞))`. -/
theorem firstPassage_mem (x : ℝ → ℝ) (hx : InE x) :
    InE (firstPassage x) ∧ MonotoneOn (firstPassage x) (Ici 0) ∧
      MapsTo (firstPassage x) (Ici 0) (Ici 0) := by sorry

end WhittFLT.FirstPassage
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), §7, p. 82
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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