Lemma 6.2 — stochastic boundedness of
ProvedMartingaleHT.InfiniteServer.lemma_6_2Fix . For every let be the number of customers in an queue with arrival rate and service rate per customer, built as in (12) from its own pair of independent unit-rate Poisson processes and an initial number independent of them, all systems on one probability space . Let , and assume in , i.e. converges in distribution to a probability law on (4). Assume moreover for every (the assumption of Theorem 3.4). Then for each the random variables
are stochastically bounded in .
This is the one non-trivial input of the martingale route to the fluid limit; is deterministic.
Formalization Note The systems use one pair of Poisson processes per (the paper uses one pair for all , a special case; weak convergence depends only on laws). The hypothesis (4) is stated with bounded continuous test functions.
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
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.