Proof of Theorem 5, p. 215 — Z̄(t) = 0 for t ≥ ‖Z̄(0)‖/δ
ProvedMaxPressure.FluidStab.explicit_emptying_timeLet a stochastic processing network satisfy the standing assumptions of §2, Assumption 1 (EAA) and Assumption 2, and suppose the static planning LP (9)–(13) has a feasible solution with . Then there is a constant such that every maximum pressure fluid model solution (satisfying (14)–(18) and (20)) has
where is the Euclidean norm.
This is the last line of the proof of Theorem 5 and gives an explicit emptying time, linear in the initial fluid level. Theorem 5 follows with the constant of Definition 4 equal to .
Formalization Note depends only on the network (it is for the vector of the proof), not on the solution. Assumption 1 is a hypothesis because the paper states the result under it (it justifies (20)); the fluid-level argument does not use it.
import Mathlib import Definitions.Def_MaxPressure_FluidStab_Network
namespace MaxPressure.FluidStab
open Matrix
/-- Proof of Theorem 5, App. B, p. 215 (last line): under Assumptions 1 and 2, if the LP (9)–(13)
has a feasible solution with `ρ < 1`, there is `ε > 0` (the paper's `δ`) such that every maximum
pressure fluid model solution has `Z̄(t) = 0` for `t ≥ ‖Z̄(0)‖/ε`. -/
theorem explicit_emptying_time {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
(hEAA : EAA N) (h2 : Assumption2 N)
(hLP : ∃ (x : Fin J → ℝ) (ρ : ℝ), ρ < 1 ∧ LPFeasible N x ρ) :
∃ ε : ℝ, 0 < ε ∧ ∀ (Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ),
IsFluidSolution N Zb Tb → MPFluidEq N Zb Tb →
∀ t, Real.sqrt (∑ i, Zb 0 i ^ 2) / ε ≤ t → Zb t = 0 := by sorry
end MaxPressure.FluidStab
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.