Proof of Lemma 3, p. 208 — and for
ProvedMaxPressure.ReversedLeontief.pressure_split_by_processoractivity-pressuremaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reversed-leontief
Consider a reversed Leontief network satisfying the standing assumptions of §2 and an extreme allocation . Let be the activity processor works on under ( if is idle). Then
- for every processor ;
- for every ,
where .
The second identity is used in the converse direction of Lemma 3: it turns the comparison of total pressures into a comparison processor by processor.
Formalization Note. is arbitrary here (the page has the buffer level ); this is a disclosed strengthening.
Preamble
import Mathlib import Definitions.Def_MaxPressure_ReversedLeontief_Network
Formal statement
namespace MaxPressure.ReversedLeontief
/-- Proof of Lemma 3, p. 208: in a reversed Leontief network, for an extreme allocation `a`,
`j_k(a) ∈ 𝒥(k)` for every processor `k`, and `p(a, z) = ∑_k p(j_k(a), z)` for every `z`. -/
theorem pressure_split_by_processor {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
(hRL : IsReversedLeontief N) (a : Fin J → ℝ) (ha : a ∈ extremeAllocs N) :
(∀ k, activityOf N a k ∈ procActs N k) ∧
∀ z : Fin I → ℝ, pressure N a z = ∑ k, actPressure' N (activityOf N a k) z := by sorry
end MaxPressure.ReversedLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 208, §8, proof of Lemma 3 (converse direction)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.