Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.3 — the inductive step: once buffers 1, …, k−1 stay empty, buffer k empties by t_k

Proved
DaiWeissFluid.FBFS.inductive_step

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

fluid-modelp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1priority-disciplinereentrant-line

Consider a reentrant line with mk>0m_k > 0mk​>0 and ρi<1\rho_i < 1ρi​<1 for every station (1.7), and a solution (Q,T)(Q,T)(Q,T) of the FBFS fluid model, i.e. (1.8)–(1.12) with (4.4) for π(k)=k\pi(k) = kπ(k)=k. Fix a class kkk and a time τ=tk−1≥0\tau = t_{k-1} \ge 0τ=tk−1​≥0 such that all buffers 1,…,k−11,\dots,k-11,…,k−1 are empty at every time t≥τt \ge \taut≥τ. Then buffer kkk is empty at every time

t  ≥  tk  =  τ+Qk(τ) mk1−∑l∈Hkml.t \;\ge\; t_k \;=\; \tau + \frac{Q_k(\tau)\, m_k}{1 - \sum_{l\in H_k} m_l} .t≥tk​=τ+1−∑l∈Hk​​ml​Qk​(τ)mk​​.

Here HkH_kHk​ consists of the classes l≤kl \le kl≤k served at station σ(k)\sigma(k)σ(k), so 1−∑l∈Hkml≥1−ρσ(k)>01 - \sum_{l\in H_k} m_l \ge 1 - \rho_{\sigma(k)} > 01−∑l∈Hk​​ml​≥1−ρσ(k)​>0. Iterating over k=1,…,Kk = 1,\dots,Kk=1,…,K is the induction that proves Theorem 4.3.

Formalization Note The paper's inductive hypothesis reads "stay empty for t>tk−1t > t_{k-1}t>tk−1​"; the statement uses t≥tk−1t \ge t_{k-1}t≥tk−1​, which is how the proof uses it (the two agree by continuity of QQQ). The paper writes "let the content … be Qk(tk−1)>0Q_k(t_{k-1}) > 0Qk​(tk−1​)>0"; the case Qk(tk−1)=0Q_k(t_{k-1}) = 0Qk​(tk−1​)=0 is also covered here, which is stronger. The paper's conclusion "buffer kkk will be empty at time tkt_ktk​ … and will stay empty at all times after tkt_ktk​" is stated as Qk(t)=0Q_k(t) = 0Qk​(t)=0 for all t≥tkt \ge t_kt≥tk​. Classes are 0-based, so "buffers 1,…,k−11,\dots,k-11,…,k−1" are the Lean indices l<kl < kl<k.

Preamble
import Mathlib
import Definitions.Def_DaiWeissFluid_FBFS_FluidModel
Formal statement
namespace DaiWeissFluid.FBFS

/-- The inductive step of the proof of Theorem 4.3, p. 124. In an FBFS fluid model, if at time
`τ = t_{k-1} ≥ 0` all classes before `k` are empty and stay empty from then on, then class `k` is
empty from time `t_k = τ + Q_k(τ) m_k / (1 - ∑_{l ∈ H_k} m_l)` on. -/
theorem inductive_step {I K : ℕ} (L : ReentrantLine I K) (hm : ∀ k, 0 < L.m k)
    (hρ : ∀ i, L.ρ i < 1) (Q T : ℝ → Fin K → ℝ) (hsol : L.IsPrioritySolution (fbfs K) Q T)
    (k : Fin K) (τ : ℝ) (hτ : 0 ≤ τ) (hprev : ∀ t, τ ≤ t → ∀ l, l < k → Q t l = 0) :
    ∀ t, τ + Q τ k * L.m k / (1 - ∑ l ∈ L.H (fbfs K) k, L.m l) ≤ t → Q t k = 0 := by sorry

end DaiWeissFluid.FBFS
Source
Dai and Weiss, Stability and instability of fluid models for reentrant lines, Math. Oper. Res. 21(1) (1996), p. 124, proof of Theorem 4.3 (inductive step)
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