Lemma 5.9 — FWLLN from stochastic boundedness: SB in and imply
ProvedMartingaleHT.InfiniteServer.lemma_5_9fluid-limitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-boundedness
Let , , be random elements of (processes with values in , paths right-continuous with left limits, measurable coordinates) and let with . If is stochastically bounded in , then
where for .
With it turns stochastic boundedness of the diffusion-scaled queue into the fluid limit of Lemma 4.3.
Formalization Note Convergence in distribution to the deterministic continuous limit is convergence in probability (p. 229), stated as uniform convergence on compact time intervals in probability (UocInProb).
Preamble
import Mathlib import Definitions.Def_BellWilliams2001_ThresholdPolicy_Paths import Definitions.Def_ManyServerQED_Scheduling_Model import Definitions.Def_ErlangA_Diffusion_SDE import Definitions.Def_ErlangA_Diffusion_Queue import Definitions.Def_MartingaleHT_InfiniteServer_Model import Definitions.Def_MartingaleHT_InfiniteServer_Toolkit open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal BoundedContinuousFunction
Formal statement
namespace MartingaleHT.InfiniteServer
open BellWilliams2001.ThresholdPolicy ManyServerQED.Scheduling ErlangA.Diffusion
/-- **Lemma 5.9** (FWLLN from stochastic boundedness in `Dᵏ`, p. 238). Let `Xₙ` be random
elements of `Dᵏ` and `aₙ > 0` with `aₙ → ∞`. If `(Xₙ)` is stochastically bounded in `Dᵏ`, then
`Xₙ/aₙ ⇒ η` in `Dᵏ`, where `η ≡ 0`; since the limit is deterministic and continuous this is
uniform convergence on compact time intervals in probability. -/
theorem lemma_5_9 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
{k : ℕ} (X : ℕ → Ω → ℝ → Fin k → ℝ)
(hcad : ∀ n : ℕ, 1 ≤ n → ∀ ω i, IsCadlag (fun t => X n ω t i))
(hmeas : ∀ n : ℕ, 1 ≤ n → ∀ t, Measurable (fun ω => X n ω t))
(a : ℕ → ℝ) (ha : ∀ n : ℕ, 1 ≤ n → 0 < a n) (hlim : Tendsto a atTop atTop)
(hSB : IsSBD P X) :
UocInProb P (fun n ω t => (a n)⁻¹ • X n ω t) (fun _ => 0) := by sorry
end MartingaleHT.InfiniteServer
Source
Pang, Talreja & Whitt, Martingale Proofs of Many-Server Heavy-Traffic Limits for Markovian Queues, arXiv:0712.4211v1 (reprint of Probab. Surveys 4 (2007) 193–267), p. 238, Lemma 5.9, (82)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.