Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.5 — stochastic boundedness for integral representations Xn=Xn(0)+∑iYn,i+∫0⋅h(Xn)X_n=X_n(0)+\sum_iY_{n,i}+\int_0^\cdot h(X_n)Xn​=Xn​(0)+∑i​Yn,i​+∫0⋅​h(Xn​)

Proved
MartingaleHT.InfiniteServer.lemma_5_5

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

integral-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-boundedness

Let hhh be Lipschitz as in (62) (there is c>0c>0c>0 with ∣h(s1)−h(s2)∣≤c∣s1−s2∣|h(s_1)-h(s_2)|\le c|s_1-s_2|∣h(s1​)−h(s2​)∣≤c∣s1​−s2​∣), fix kkk, and for each n≥1n\ge1n≥1 let XnX_nXn​ and Yn,1,…,Yn,kY_{n,1},\dots,Y_{n,k}Yn,1​,…,Yn,k​ be real processes with paths in DDD and measurable coordinates such that, almost surely,

Xn(t)=Xn(0)+Yn,1(t)+⋯+Yn,k(t)+∫0th(Xn(s)) ds,t≥0.X_n(t)=X_n(0)+Y_{n,1}(t)+\cdots+Y_{n,k}(t)+\int_0^th(X_n(s))\,ds,\qquad t\ge0 .Xn​(t)=Xn​(0)+Yn,1​(t)+⋯+Yn,k​(t)+∫0t​h(Xn​(s))ds,t≥0.

If {Xn(0):n≥1}\{X_n(0):n\ge1\}{Xn​(0):n≥1} is stochastically bounded in R\mathbb RR and {Yn,i:n≥1}\{Y_{n,i}:n\ge1\}{Yn,i​:n≥1} is stochastically bounded in DDD for each 1≤i≤k1\le i\le k1≤i≤k, then {Xn:n≥1}\{X_n:n\ge1\}{Xn​:n≥1} is stochastically bounded in DDD.

Applied to the representation (32) with h(s)=−μsh(s)=-\mu sh(s)=−μs, it reduces stochastic boundedness of XnX_nXn​ to that of the initial values and of the martingales.

Formalization Note h(0)=0h(0)=0h(0)=0 is not assumed, as in the paper. The representation is required almost surely.

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.5** (stochastic boundedness for integral representations, p. 236). Let `h` be
Lipschitz as in (62) and, for each `n ≥ 1`, let `Xₙ`, `Yₙ,₁, …, Yₙ,ₖ` be processes with paths in
`D` and measurable coordinates such that, almost surely, for all `t ≥ 0`,
`Xₙ(t) = Xₙ(0) + Yₙ,₁(t) + ⋯ + Yₙ,ₖ(t) + ∫₀ᵗ h(Xₙ(s)) ds`. If `(Xₙ(0))` is stochastically bounded
in `ℝ` and each `(Yₙ,ᵢ)` is stochastically bounded in `D`, then `(Xₙ)` is stochastically bounded
in `D`. -/
theorem lemma_5_5 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {k : ℕ} (h : ℝ → ℝ) (c : ℝ) (hc : 0 < c)
    (hLip : ∀ s₁ s₂ : ℝ, |h s₁ - h s₂| ≤ c * |s₁ - s₂|)
    (X : ℕ → Ω → ℝ → ℝ) (Y : ℕ → Fin k → Ω → ℝ → ℝ)
    (hXcad : ∀ n : ℕ, 1 ≤ n → ∀ ω, IsCadlag (X n ω))
    (hYcad : ∀ n : ℕ, 1 ≤ n → ∀ i ω, IsCadlag (Y n i ω))
    (hXmeas : ∀ n : ℕ, 1 ≤ n → ∀ t, Measurable (fun ω => X n ω t))
    (hYmeas : ∀ n : ℕ, 1 ≤ n → ∀ i t, Measurable (fun ω => Y n i ω t))
    (hrep : ∀ n : ℕ, 1 ≤ n → ∀ᵐ ω ∂P, ∀ t : ℝ, 0 ≤ t →
      X n ω t = X n ω 0 + ∑ i, Y n i ω t + ∫ s in (0 : ℝ)..t, h (X n ω s))
    (hX0 : IsSBReal P (fun n ω => X n ω 0))
    (hY : ∀ i, IsSBD P (fun n ω t (_ : Fin 1) => Y n i ω t)) :
    IsSBD P (fun n ω t (_ : Fin 1) => X 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. 236, Lemma 5.5
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