Theorem 6.4 — reflection of linearly centered paths
ProvedWhittFLT.Reflection.theorem_6_4heavy-trafficp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reflectionskorohod-space
Let be a real interval with closed left endpoint . Let and , suppose in , and assume . For and :
- If , then in .
- If , then in .
- If and has no positive jumps, then uniformly on compact subintervals of .
The three conclusions describe how the reflecting barrier behaves under finite, large positive, and large negative linear drifts.
Formalization Note Membership in is included in the hypothesis. The paper’s standing assumptions that is an interval, is its closed left endpoint, and are explicit. Paths are total functions on ; convergence is sequential and uses the extended nonnegative metric. The paper’s subtracts the entire running infimum.
Preamble
import Mathlib import Definitions.Def_WhittFLT_Reflection_Supremum
Formal statement
namespace WhittFLT.Reflection
open Set Filter Topology
/-- Whitt (1980), Theorem 6.4, p. 81. -/
theorem theorem_6_4 (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) (hx0 : x 0 = 0) :
(∀ c₀ : ℝ, Tendsto c atTop (𝓝 c₀) →
WhittFLT.Composition.J1Tendsto T (fun n => barrier (xs n)) (barrier (fun t => x t + c₀ * t))) ∧
(Tendsto c atTop atTop →
WhittFLT.Composition.J1Tendsto T (fun n t => barrier (xs n) t - c n * t) x) ∧
(Tendsto c atTop atBot → NoPosJump T x →
WhittFLT.Composition.UTendsto T (fun n => barrier (xs n)) (fun _ => 0)) := by sorry
end WhittFLT.Reflection
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), Theorem 6.4, p. 81
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.