Lemma 4.3 — basic fluid limit in
ProvedMartingaleHT.InfiniteServer.lemma_4_3Fix . 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). Then the fluid-scaled number in system (69) satisfies
where for ; that is, for every and , .
The fluid limit is the input of Lemma 4.4, which completes the proof of Theorem 1.1.
Formalization Note Convergence in distribution to a deterministic continuous limit is convergence in probability (p. 229); it is stated as uniform convergence on compact intervals in probability. The paper's is the constant path , not a sample point. 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. No moment condition on is assumed: §6.3 of the paper removes it.
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 4.3** (basic fluid limit, p. 229). Under the conditions of Theorem 1.1,
`Ψ_{S,n}(t) = Qₙ(t)/n` converges to the constant path `1` uniformly on compact time intervals
in probability (convergence in distribution in `D` to a deterministic continuous limit). -/
theorem lemma_4_3 (μ : ℝ) (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 ℝ)))) :
UocInProb P (fun n ω t (_ : Fin 1) => psiS n (Q n) ω t) (fun _ _ => 1) := by sorry
end MartingaleHT.InfiniteServer
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.