Theorem 3, p. 203 — weak fluid stability implies pathwise stability
ProvedMaxPressure.Throughput.fluid_weak_stability_implies_pathwisefluid-stabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pathwise-stability
Let a stochastic processing network satisfy the primitive laws of large numbers (3)–(4) almost surely and the network equations (39)–(43). Let be its corresponding fluid model: every fluid limit at a sample path satisfying those laws belongs to . If every solution in starting with zero buffer levels remains at zero, then
This is the transfer theorem from weak fluid stability to pathwise stability for a general service policy. The correspondence condition lets the fluid model include equations imposed by that policy.
Preamble
import Mathlib import Definitions.Def_MaxPressure_Throughput_Dynamics open MeasureTheory
Formal statement
namespace MaxPressure.Throughput
/-- Theorem 3, p. 203: weak stability of the corresponding fluid model
implies pathwise stability of the stochastic network. -/
theorem fluid_weak_stability_implies_pathwise {I J K : ℕ} {Ω : Type*}
[MeasurableSpace Ω] (Pr : Measure Ω) [IsProbabilityMeasure Pr]
(N : Network I J K) (hN : N.Standing)
(P : Primitives I J Ω) (hP : P.Valid N Pr)
(Z : Ω → ℝ → Fin I → ℝ) (T : Ω → ℝ → Fin J → ℝ)
(heq : ∀ ω, NetworkEquations N P Z T ω)
(FM : (ℝ → Fin I → ℝ) → (ℝ → Fin J → ℝ) → Prop)
(hcorresponding : ∀ ω Zb Tb,
IsFluidLimit N P Z T ω Zb Tb → FM Zb Tb)
(hweak : WeaklyStable FM) : PathwiseStable Pr Z := by sorry
end MaxPressure.Throughput
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 203, Theorem 3 and Definition 3; proof p. 213, §A.2; https://doi.org/10.1287/opre.1040.0170
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.