Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§A.2, p. 213 — fluid limits satisfy equations (14)–(18)

Proved
MaxPressure.Throughput.fluid_limit_equations

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

fluid-limitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-processing-network

Fix a network with the standing assumptions of §2, including positive processing-time means mj>0m_j>0mj​>0. On a sample path where the processing-time and routing laws of large numbers (3)–(4) hold, suppose its network paths Z,TZ,TZ,T satisfy the stochastic network equations (39)–(43). If the positively scaled paths have a fluid limit (Zˉ,Tˉ)(\bar Z,\bar T)(Zˉ,Tˉ) uniformly on compact time intervals, then

(Zˉ,Tˉ) satisfies (14)–(18),Zˉ(0)=0.(\bar Z,\bar T)\text{ satisfies (14)–(18)},\qquad \bar Z(0)=0.(Zˉ,Tˉ) satisfies (14)–(18),Zˉ(0)=0.

This identifies the equations obeyed by every fluid limit used in Theorem 3 and Lemma 4. The original initial buffer contents need not vanish: scaling sends a fixed initial state to zero.

Preamble
import Mathlib
import Definitions.Def_MaxPressure_Throughput_Dynamics
Formal statement
namespace MaxPressure.Throughput

/-- Appendix A.2, p. 213: a fluid limit of (39)–(43) solves (14)–(18)
and starts with zero buffer levels. -/
theorem fluid_limit_equations {I J K : ℕ} {Ω : Type*}
    (N : Network I J K) (hN : N.Standing) (P : Primitives I J Ω)
    (Z : Ω → ℝ → Fin I → ℝ) (T : Ω → ℝ → Fin J → ℝ)
    (ω : Ω)
    (heq : NetworkEquations N P Z T ω)
    (Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
    (hlim : IsFluidLimit N P Z T ω Zb Tb) :
    IsFluidSolution N Zb Tb ∧ Zb 0 = 0 := by sorry

end MaxPressure.Throughput
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 213, §A.2, paragraph following (47); https://doi.org/10.1287/opre.1040.0170
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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