Theorem 6.2 — running supremum of linearly centered paths
ProvedWhittFLT.Reflection.theorem_6_2heavy-trafficp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1running-supremumskorohod-space
Let be a real interval with closed left endpoint . Let and , and suppose in , where . The running supremum has three drift regimes:
- If , then in .
- If and has no negative jumps, then in .
- If , then uniformly on compact subintervals of .
This is the source’s trichotomy for the running supremum and supplies the corresponding infimum facts used in Theorem 6.4.
Formalization Note The paper's standing assumptions of §6 (, an interval with as closed left endpoint) are explicit. Membership in is included in convergence. Paths are total functions on .
Preamble
import Mathlib import Definitions.Def_WhittFLT_Reflection_Supremum
Formal statement
namespace WhittFLT.Reflection
open Set Filter Topology
/-- Whitt (1980), Theorem 6.2, pp. 80–81. -/
theorem theorem_6_2 (T : Set ℝ) (hT : T.OrdConnected) (h0 : IsLeast T 0)
(xs : ℕ → ℝ → ℝ) (x : ℝ → ℝ) (c : ℕ → ℝ)
(hconv : WhittFLT.Composition.J1Tendsto T (fun n t => xs n t - c n * t) x) :
(∀ c₀ : ℝ, Tendsto c atTop (𝓝 c₀) →
WhittFLT.Composition.J1Tendsto T (fun n => runSup (xs n)) (runSup (fun t => x t + c₀ * t))) ∧
(Tendsto c atTop atTop → NoNegJump T x →
WhittFLT.Composition.J1Tendsto T (fun n t => runSup (xs n) t - c n * t) x) ∧
(Tendsto c atTop atBot →
WhittFLT.Composition.UTendsto T (fun n => runSup (xs n)) (fun _ => x 0)) := by sorry
end WhittFLT.Reflection
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), Theorem 6.2, p. 80, proof p. 81
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.