Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 213 — maximum-pressure fluid equation (20)

Proved
MaxPressure.Throughput.fluid_limit_max_pressure

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

fluid-limitmaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a preemptive, processor-splitting maximum-pressure process satisfying EAA and the network equations. On a sample path where the primitive limits (3)–(4) hold, let (Zˉ,Tˉ)(\bar Z,\bar T)(Zˉ,Tˉ) be any fluid limit. At each positive regular time ttt, its instantaneous activity allocation attains the greatest pressure among the extreme allocations:

p(Tˉ˙(t),Zˉ(t))=max⁡a∈Ep(a,Zˉ(t)).p(\dot{\bar T}(t),\bar Z(t))=\max_{a\in\mathcal E}p(a,\bar Z(t)).p(Tˉ˙(t),Zˉ(t))=a∈Emax​p(a,Zˉ(t)).

This supplies the policy equation that distinguishes maximum-pressure fluid limits from those of a general service policy. Regularity means that both fluid paths are differentiable at ttt.

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

/-- Lemma 4, p. 213: every fluid limit of the maximum-pressure process
satisfies fluid equation (20). -/
theorem fluid_limit_max_pressure {I J K : ℕ} {Ω : Type*}
    (N : Network I J K) (hN : N.Standing) (hEAA : EAA N)
    (E : Finset (Fin J → ℝ)) (hE : (E : Set (Fin J → ℝ)) = extremeAllocs N)
    (P : Primitives I J Ω) (Z : Ω → ℝ → Fin I → ℝ)
    (Ta : Ω → (Fin J → ℝ) → ℝ → ℝ) (ω : Ω)
    (heq : NetworkEquations N P Z (activityTime E Ta) ω)
    (hmp : MPProcess N E Z Ta ω)
    (Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
    (hlim : IsFluidLimit N P Z (activityTime E Ta) ω Zb Tb) :
    MPFluidEq N Zb Tb := by sorry

end MaxPressure.Throughput
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 213, Lemma 4; equation (20) p. 203; proof p. 214; 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