Proof of Theorem 4.3 — the inductive step: once buffers 1, …, k−1 stay empty, buffer k empties by t_k
ProvedDaiWeissFluid.FBFS.inductive_stepConsider a reentrant line with and for every station (1.7), and a solution of the FBFS fluid model, i.e. (1.8)–(1.12) with (4.4) for . Fix a class and a time such that all buffers are empty at every time . Then buffer is empty at every time
Here consists of the classes served at station , so . Iterating over is the induction that proves Theorem 4.3.
Formalization Note The paper's inductive hypothesis reads "stay empty for "; the statement uses , which is how the proof uses it (the two agree by continuity of ). The paper writes "let the content … be "; the case is also covered here, which is stronger. The paper's conclusion "buffer will be empty at time … and will stay empty at all times after " is stated as for all . Classes are 0-based, so "buffers " are the Lean indices .
import Mathlib import Definitions.Def_DaiWeissFluid_FBFS_FluidModel
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.