Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — stochastic boundedness of ⟨Mn,2⟩(t)=μn∫0tQn(s) ds\langle M_{n,2}\rangle(t)=\frac{\mu}{n}\int_0^tQ_n(s)\,ds⟨Mn,2​⟩(t)=nμ​∫0t​Qn​(s)ds

Proved
MartingaleHT.InfiniteServer.lemma_6_2

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

heavy-trafficp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstochastic-boundedness

Fix μ>0\mu>0μ>0. For every n≥1n\ge1n≥1 let QnQ_nQn​ be the number of customers in an M/M/∞M/M/\inftyM/M/∞ queue with arrival rate λn=nμ\lambda_n=n\muλn​=nμ and service rate μ\muμ per customer, built as in (12) from its own pair of independent unit-rate Poisson processes An,SnA_n,S_nAn​,Sn​ and an initial number Qn(0)Q_n(0)Qn​(0) independent of them, all systems on one probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P). Let Xn(t)=(Qn(t)−n)/nX_n(t)=(Q_n(t)-n)/\sqrt nXn​(t)=(Qn​(t)−n)/n​, and assume Xn(0)⇒X(0)X_n(0)\Rightarrow X(0)Xn​(0)⇒X(0) in R\mathbb RR, i.e. Xn(0)X_n(0)Xn​(0) converges in distribution to a probability law ν\nuν on R\mathbb RR (4). Assume moreover E[Qn(0)]<∞E[Q_n(0)]<\inftyE[Qn​(0)]<∞ for every n≥1n\ge1n≥1 (the assumption of Theorem 3.4). Then for each t>0t>0t>0 the random variables

⟨Mn,2⟩(t)=μn∫0tQn(s) ds,n≥1,\langle M_{n,2}\rangle(t)=\frac{\mu}{n}\int_0^tQ_n(s)\,ds,\qquad n\ge1,⟨Mn,2​⟩(t)=nμ​∫0t​Qn​(s)ds,n≥1,

are stochastically bounded in R\mathbb RR.

This is the one non-trivial input of the martingale route to the fluid limit; ⟨Mn,1⟩(t)=μt\langle M_{n,1}\rangle(t)=\mu t⟨Mn,1​⟩(t)=μt is deterministic.

Formalization Note The systems use one pair of Poisson processes per nnn (the paper uses one pair for all nnn, a special case; weak convergence depends only on laws). The hypothesis (4) is stated with bounded continuous test functions.

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 ErlangA.Diffusion

/-- **Lemma 6.2** (p. 240). Under the assumptions of Theorems 1.1 and 3.4 (the conditions of
Theorem 1.1 and `E[Qₙ(0)] < ∞` for every `n ≥ 1`), for each `t > 0` the random variables
`⟨M_{n,2}⟩(t) = (μ/n) ∫₀ᵗ Qₙ(s) ds`, `n ≥ 1`, are stochastically bounded in `ℝ`. -/
theorem lemma_6_2 (μ : ℝ) (hμ : 0 < μ)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    (A S : ℕ → Ω → ℝ → ℝ) (Q : ℕ → Ω → ℝ → ℕ)
    (hsys : ∀ n : ℕ, 1 ≤ n → IsMMInfSystem P (n * μ) μ (A n) (S n) (Q n))
    (ν : ProbabilityMeasure ℝ)
    (h0 : ∀ g : ℝ →ᵇ ℝ, Tendsto (fun n : ℕ => ∫ ω, g (scaled n (Q n) ω 0 0) ∂P) atTop
      (𝓝 (∫ x, g x ∂(ν : Measure ℝ))))
    (hmom : ∀ n : ℕ, 1 ≤ n → Integrable (fun ω => (Q n ω 0 : ℝ)) P) :
    ∀ t : ℝ, 0 < t → IsSBReal P (fun n ω => phiS n μ (Q n) ω t) := 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. 240, Lemma 6.2
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