Proof of Theorem 7.1 — reduction to nondecreasing paths: x↑ ∈ E and (x↑)⁻¹ = x⁻¹
ProvedWhittFLT.FirstPassage.firstPassage_runSupfirst-passage-timep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1supremum
Let and . Then , and and its running supremum have the same first passage times:
This is the fact behind the sentence "It suffices to look at nondecreasing functions in because the supremum function is continuous ()" in the proof of Theorem 7.1: is nondecreasing, and replacing by leaves the first passage time function unchanged.
Formalization Note The equality is stated as an equality of functions on all of ; it holds at every level because exactly when for some .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.