Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.1 — reduction to nondecreasing paths: x↑ ∈ E and (x↑)⁻¹ = x⁻¹

Proved
WhittFLT.FirstPassage.firstPassage_runSup

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

first-passage-timep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1supremum

Let x∈Ex\in Ex∈E and x↑(t)=sup⁡0≤s≤tx(s)x^{\uparrow}(t)=\sup_{0\le s\le t}x(s)x↑(t)=sup0≤s≤t​x(s). Then x↑∈Ex^{\uparrow}\in Ex↑∈E, and xxx and its running supremum have the same first passage times:

(x↑)−1=x−1.(x^{\uparrow})^{-1}=x^{-1}.(x↑)−1=x−1.

This is the fact behind the sentence "It suffices to look at nondecreasing functions in EEE because the supremum function is continuous (M1M_1M1​)" in the proof of Theorem 7.1: x↑x^{\uparrow}x↑ is nondecreasing, and replacing xxx by x↑x^{\uparrow}x↑ leaves the first passage time function unchanged.

Formalization Note The equality is stated as an equality of functions on all of R\mathbb RR; it holds at every level ttt because x↑(s)>tx^{\uparrow}(s)>tx↑(s)>t exactly when x(u)>tx(u)>tx(u)>t for some u∈[0,s]u\in[0,s]u∈[0,s].

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

open Set Filter Topology

/-- Whitt (1980), proof of Theorem 7.1, p. 82: "it suffices to look at nondecreasing functions in
`E`" — for `x ∈ E`, `x↑ ∈ E` and `(x↑)⁻¹ = x⁻¹`. -/
theorem firstPassage_runSup (x : ℝ → ℝ) (hx : InE x) :
    InE (WhittFLT.Reflection.runSup x) ∧ firstPassage (WhittFLT.Reflection.runSup x) = firstPassage x := by sorry

end WhittFLT.FirstPassage
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), proof of Theorem 7.1, 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