Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.4 — explicit LBFS emptying time

Proved
DaiWeissFluid.LBFS.emptying_time

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

buffer-priorityfluid-modelp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reentrant-line

Let a reentrant line have at least one class, positive mean service times mkm_kmk​, and station workloads ρi<1\rho_i<1ρi​<1. For every LBFS priority fluid solution, put ∣Q(0)∣=∑kQk(0)|Q(0)|=\sum_kQ_k(0)∣Q(0)∣=∑k​Qk​(0) and λ^=1/max⁡iρi\hat\lambda=1/\max_i\rho_iλ^=1/maxi​ρi​. Every buffer is empty and remains empty by the time

δ=∣Q(0)∣λ^−1.\delta=\frac{|Q(0)|}{\hat\lambda-1}.δ=λ^−1∣Q(0)∣​.

Thus Qk(t)=0Q_k(t)=0Qk​(t)=0 for every class kkk and every t≥δt\ge\deltat≥δ. This bound holds for every initial fluid level, before normalizing ∣Q(0)∣=1|Q(0)|=1∣Q(0)∣=1 in Definition 1.3.

Formalization Note Classes are 0-based. The assumption K>0K>0K>0 makes the maximum station workload positive under mk>0m_k>0mk​>0, so λ^>1\hat\lambda>1λ^>1 and the denominator is positive. For ∣Q(0)∣=0|Q(0)|=0∣Q(0)∣=0, the statement includes t=0t=0t=0.

Preamble
import Mathlib
import Definitions.Def_DaiWeissFluid_LBFS_FluidModel
Formal statement
namespace DaiWeissFluid.LBFS

/-- The explicit uniform extinction time in the proof of Theorem 4.4, p. 125. -/
theorem emptying_time {I K : ℕ} (L : ReentrantLine I K)
    (hm : ∀ k, 0 < L.m k) (hρ : ∀ i, L.ρ i < 1) (hK : 0 < K)
    (Q T : ℝ → Fin K → ℝ) (hsol : L.IsPrioritySolution Fin.revPerm Q T) :
    ∀ t, (∑ k, Q 0 k) / (L.lamHat - 1) ≤ t → ∀ k, Q t k = 0 := by sorry

end DaiWeissFluid.LBFS
Source
Dai and Weiss, Stability and instability of fluid models for reentrant lines, Math. Oper. Res. 21(1) (1996), p. 125, proof of Theorem 4.4 (emptying time)
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