Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.9 — FWLLN from stochastic boundedness: XnX_nXn​ SB in DkD^kDk and an→∞a_n\to\inftyan​→∞ imply Xn/an⇒0X_n/a_n\Rightarrow0Xn​/an​⇒0

Proved
MartingaleHT.InfiniteServer.lemma_5_9

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

fluid-limitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-boundedness

Let XnX_nXn​, n≥1n\ge1n≥1, be random elements of DkD^kDk (processes with values in Rk\mathbb R^kRk, paths right-continuous with left limits, measurable coordinates) and let an>0a_n>0an​>0 with an→∞a_n\to\inftyan​→∞. If (Xn)(X_n)(Xn​) is stochastically bounded in DkD^kDk, then

Xnan⇒ηin Dk as n→∞,(82)\frac{X_n}{a_n}\Rightarrow\eta\quad\text{in }D^k\text{ as }n\to\infty, \tag{82}an​Xn​​⇒ηin Dk as n→∞,(82)

where η(t)=(0,…,0)\eta(t)=(0,\dots,0)η(t)=(0,…,0) for t≥0t\ge0t≥0.

With an=na_n=\sqrt nan​=n​ 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 η\etaη 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
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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