Proof of Theorem 5, p. 215 — RṪ(t)·Z̄(t) ≥ Rx*·Z̄(t) ≥ δ Σ_i Z̄_i(t) ≥ δ‖Z̄(t)‖ at regular times
ProvedMaxPressure.FluidStab.pressure_lower_boundfluid-modellyapunov-functionmaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let a stochastic processing network satisfy the standing assumptions of §2, and let be a maximum pressure fluid model solution: it satisfies (14)–(18) and (20). Let and satisfy . Then at every regular time
where is the Euclidean norm on .
The first inequality is where the maximum pressure policy enters: by (20) the instantaneous allocation attains the largest pressure over , hence over .
Formalization Note The three inequalities are stated as three conjuncts. Assumptions 1 and 2 and the LP are not hypotheses here: only the properties of and they produce are used.
Preamble
import Mathlib import Definitions.Def_MaxPressure_FluidStab_Network
Formal statement
namespace MaxPressure.FluidStab
open Matrix
/-- Proof of Theorem 5, App. B, p. 215: let `(Z̄, T̄)` be a maximum pressure fluid model
solution ((14)–(18) and (20)), `x* ∈ 𝒜` and `ε > 0` with `Rx* ≥ εe`. At every regular time `t`,
`R Ṫ(t) · Z̄(t) ≥ Rx* · Z̄(t) ≥ ε ∑_i Z̄_i(t) ≥ ε ‖Z̄(t)‖`, with `‖·‖` the Euclidean norm. -/
theorem pressure_lower_bound {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
(Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
(hsol : IsFluidSolution N Zb Tb) (hmp : MPFluidEq N Zb Tb)
(xs : Fin J → ℝ) (hxs : xs ∈ allocSet N) (ε : ℝ) (hε : 0 < ε)
(hR : ∀ i, ε ≤ (R N *ᵥ xs) i) (t : ℝ) (ht : IsRegular Zb Tb t) :
pressure N xs (Zb t) ≤ pressure N (deriv Tb t) (Zb t) ∧
ε * ∑ i, Zb t i ≤ pressure N xs (Zb t) ∧
ε * Real.sqrt (∑ i, Zb t i ^ 2) ≤ ε * ∑ i, Zb t i := by sorry
end MaxPressure.FluidStab
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 215, proof of Theorem 5 (App. B), first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.