Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 Part II — stability of every work-conserving fluid model

Proved
DaiWeissFluid.LuKumar.wc_stable

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

fluid-modellu-kumarp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing-network-stability

For positive service times with m1+m4<1m_1+m_4<1m1​+m4​<1, m2+m3<1m_2+m_3<1m2​+m3​<1, and m2+m4<1m_2+m_4<1m2​+m4​<1, every work-conserving fluid solution of the Lu–Kumar line with initial total content one is empty after a common finite time:

FluidStable⁡(Lu–Kumar work-conserving model).\operatorname{FluidStable}(\text{Lu–Kumar work-conserving model}).FluidStable(Lu–Kumar work-conserving model).

This is the stable half of the exact parameter classification.

Formalization Note The theorem is stated for the full work-conserving fluid model, so it applies to each particular work-conserving discipline. Stability uses Definition 1.3, with ∣Q(0)∣=∑kQk(0)=1|Q(0)|=\sum_k Q_k(0)=1∣Q(0)∣=∑k​Qk​(0)=1.

Preamble
import Mathlib
import Definitions.Def_DaiWeissFluid_LuKumar_FluidModel
import Definitions.Def_DaiWeissFluid_LuKumar_Network
Formal statement
namespace DaiWeissFluid.LuKumar

/-- Part II of Theorem 5.1: every work-conserving fluid model is stable. -/
theorem wc_stable (m : Fin 4 → ℝ) (hm : ∀ k, 0 < m k)
    (h51₁ : m 0 + m 3 < 1) (h51₂ : m 1 + m 2 < 1)
    (h52 : m 1 + m 3 < 1) :
    DaiWeissFluid.ThreeBuffer.FluidStable (luKumar m).IsWorkConserving := by sorry

end DaiWeissFluid.LuKumar
Source
Dai and Weiss, Stability and instability of fluid models for reentrant lines, Math. Oper. Res. 21(1) (1996), pp. 125 and 127–128, proof of Theorem 5.1, Part II
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