Lemma 3.1, p. 1940 (one class, M = I) — C̄′ = {a ≥ 0 : ∃ f ∈ F_a, c ∈ co(S), f ≤ c}
ProvedConstrainedQueueing.Nonstationary.lemma_3_1Consider the single-class network with one-slot service times ( for every server). For a rate vector let be the set of -admissible flows, i.e. vectors with and , where is the routing matrix. Let be the set of nonnegative for which some and some satisfy whenever and whenever . Then the closure of is
This is the specialisation of the paper's Lemma 3.1 to and , the setting of §IV. It identifies the boundary of the region outside of which, by Theorem 4.1, no policy can keep the queues bounded; the proof of Lemma 4.1 uses the inclusion of the right-hand side in .
Formalization Note. The closure is taken in Fin L → ℝ with its product topology. Both sides include , the shared convention for rate vectors (the paper's sets carry no explicit sign condition). No hypothesis on is needed.
import Mathlib import Definitions.Def_ConstrainedQueueing_Nonstationary_Model
namespace ConstrainedQueueing.Nonstationary
/-- Lemma 3.1 (p. 1940), for one class and `M = I` (§IV: `M_i(t) = 1`): the closure of `C'` is
the set of nonnegative rate vectors `a` for which there are an `a`-admissible flow `f` and a
point `c ∈ co(S)` with `f ≤ c`. -/
theorem lemma_3_1 {L N : ℕ} (net : Network L N) :
closure (Cprime net) =
{a : Fin L → ℝ | 0 ≤ a ∧ ∃ f, IsAdmissibleFlow net a f ∧ ∃ c ∈ coS net, f ≤ c} := by sorry
end ConstrainedQueueing.Nonstationary
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.