Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.5 — existence of fluid limits (milestone)

Disproved
ProcessingNetworks.FluidStability.fluid_limit_existence

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

fluid-limitqueueingstochastic-processing-network

Theorem 6.5 (existence of fluid limits). Fix a sample point ω\omegaω at which the SLLNs (2.14) (for external arrivals) and (2.15) (for processing variables) and the negligibility condition (6.38) all hold. For any unbounded set C⊂XC \subset \mathcal XC⊂X of initial states, there is a sequence {xn}⊂C\{x_n\} \subset C{xn​}⊂C with ∣xn∣→∞|x_n| \to \infty∣xn​∣→∞ such that

(D^xn,F^xn,T^xn,Z^xn)(⋅,ω) →u.o.c. (D^,F^,T^,Z^)as n→∞,\big(\hat D^{x_n}, \hat F^{x_n}, \hat T^{x_n}, \hat Z^{x_n}\big)(\cdot,\omega) \ \xrightarrow{\text{u.o.c.}}\ (\hat D, \hat F, \hat T, \hat Z) \quad \text{as } n \to \infty,(D^xn​,F^xn​,T^xn​,Z^xn​)(⋅,ω) u.o.c.​ (D^,F^,T^,Z^)as n→∞,

for some F^,T^∈C([0,∞),RJ)\hat F, \hat T \in C([0,\infty),\mathbb{R}^J)F^,T^∈C([0,∞),RJ) and D^,Z^∈C([0,∞),RI)\hat D, \hat Z \in C([0,\infty),\mathbb{R}^I)D^,Z^∈C([0,∞),RI); furthermore, (D^,F^,T^,Z^)(\hat D, \hat F, \hat T, \hat Z)(D^,F^,T^,Z^) satisfies the fluid equations (6.1)-(6.6) with ∣Z^(0)∣=1|\hat Z(0)| = 1∣Z^(0)∣=1.

This is what makes fluid limit paths (Definition 6.6) a nonempty, well-behaved family: not only do they exist along every unbounded sequence of initial states, but every one of them is automatically a fluid model solution, which is the bridge Theorem 6.2 needs.

Formalization note. ∣Z^(0)∣=1|\hat Z(0)| = 1∣Z^(0)∣=1 is a normalization coming from the choice of scaling sequence, not an added restriction on the SPN — it is stated here as part of the conclusion, exactly as the book states it. Continuous Dh ∧ Continuous Fh ∧ Continuous Th ∧ Continuous Zh makes explicit the theorem's own "F^,T^∈C(R+,RJ)\hat F, \hat T \in C(\mathbb{R}_+, \mathbb{R}^J)F^,T^∈C(R+​,RJ) and D^,Z^∈C(R+,RI)\hat D, \hat Z \in C(\mathbb{R}_+,\mathbb{R}^I)D^,Z^∈C(R+​,RI)" clause. The SLLNs (2.14), (2.15) and the condition (6.38) are hypotheses on the fixed sample point ω\omegaω, for the core stochastic elements E,v,φE, v, \varphiE,v,φ that the standard setup SPNProcessFamily is built from; the fluid equations (6.1)–(6.6) for the limit follow from the system relations of Section 2.5 satisfied by every version xxx of the family.

Preamble
import Mathlib
import Definitions.Def_ProcessingNetworks_Stability_MarkovRepresentation
import Definitions.Def_ProcessingNetworks_FluidStability_FluidEquationData
import Definitions.Def_ProcessingNetworks_Stability_SPNModel
import Definitions.Def_ProcessingNetworks_FluidStability_SPNProcessFamily
Formal statement
namespace ProcessingNetworks.FluidStability

open MeasureTheory ProbabilityTheory Filter ProcessingNetworks.Stability

/-- Theorem 6.5, Dai & Harrison p. 116 (PDF p. 132): fix `ω` such that the SLLNs (2.14), (2.15)
for the core stochastic elements and the negligibility condition (6.38) all hold. For any
unbounded set `C ⊂ 𝒳` of initial states, there is a sequence `{xₙ} ⊂ C` with `|xₙ| → ∞` such
that the fluid-scaled processes (6.37) converge u.o.c. to some continuous
`(D̂, F̂, T̂, Ẑ) ∈ C^I × C^J × C^J × C^I` (6.39), and furthermore `(D̂, F̂, T̂, Ẑ)` satisfies the
fluid equations (6.1)-(6.6) with `|Ẑ(0)| = 1`. -/
theorem fluid_limit_existence
    {Xstate : Type*} [Countable Xstate] {Ω : Type*} [MeasureSpace Ω] {I J K : ℕ}
    {N : ℝ → Ω → Fin J → ℕ} {Z : ℝ → Ω → Fin I → ℕ}
    {Mrep : MarkovRepresentation Xstate I J N Z} {sd : SPNData I J K}
    {dat : FluidEquationData I J K} {E : Fin I → ℝ → Ω → ℕ} {v : Fin J → ℕ → Ω → ℝ}
    {φ : Fin J → ℕ → Ω → Fin I → ℕ} (fam : SPNProcessFamily Mrep sd dat E v φ)
    (E : Fin I → ℝ → Ω → ℕ) (v : Fin J → ℕ → Ω → ℝ) (φ : Fin J → ℕ → Ω → Fin I → ℕ) (ω : Ω)
    (C : Set Xstate) (hC : ¬ BddAbove ((spnSize Mrep) '' C))
    (h214 : ∀ i, Tendsto (fun t : ℝ => (E i t ω : ℝ) / t) atTop (nhds (dat.lam i)))
    (h215 :
      ∀ j, Tendsto (fun n : ℕ => (∑ ℓ ∈ Finset.range n, v j ℓ ω) / n) atTop (nhds (dat.m j)) ∧
        ∀ i, Tendsto (fun n : ℕ => (∑ ℓ ∈ Finset.range n, (φ j ℓ ω i : ℝ)) / n) atTop
          (nhds (dat.Γ i j)))
    (h638 :
      ∀ j, Tendsto (fun n : ℕ => (n : ℝ)⁻¹ * ⨆ ℓ ∈ Finset.range n, v j ℓ ω) atTop
        (nhds 0)) :
    ∃ (x : ℕ → Xstate) (Dh : ℝ → Fin I → ℝ) (Fh Th : ℝ → Fin J → ℝ) (Zh : ℝ → Fin I → ℝ),
      (∀ n, x n ∈ C) ∧ Tendsto (fun n => spnSize Mrep (x n)) atTop atTop ∧
      Continuous Dh ∧ Continuous Fh ∧ Continuous Th ∧ Continuous Zh ∧
      UOCConverges
        (fun n t i => (spnSize Mrep (x n))⁻¹ * (fam.D (x n) (spnSize Mrep (x n) * t) ω i : ℝ)) Dh ∧
      UOCConverges
        (fun n t j => (spnSize Mrep (x n))⁻¹ * (fam.F (x n) (spnSize Mrep (x n) * t) ω j : ℝ)) Fh ∧
      UOCConverges
        (fun n t j => (spnSize Mrep (x n))⁻¹ * fam.T (x n) (spnSize Mrep (x n) * t) ω j) Th ∧
      UOCConverges
        (fun n t i => (spnSize Mrep (x n))⁻¹ * (fam.Zx (x n) (spnSize Mrep (x n) * t) ω i : ℝ)) Zh ∧
      IsFluidModelSolution dat Dh Fh Th Zh ∧ (∑ i, Zh 0 i) = 1 := by sorry

end ProcessingNetworks.FluidStability
Source
Dai & Harrison, Processing Networks: Fluid Models and Stability, pre-publication draft 2020-4-2, p. 116, Theorem 6.5
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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