Lemma A.1, p. 1945 — co(S) is closed under 0 ≤ a ≤ c
ProvedConstrainedQueueing.MaxThroughput.lemma_A_1constraint-setconvex-hulldownward-closedp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the constraint set of a constrained queueing network with servers, viewed as a family of subsets of , and let be the convex hull of the indicator vectors of its elements. Assume C.1: every subset of an activation set is an activation set.
Lemma A.1. If and satisfies
then .
The lemma says that the capacity region is downward closed in the nonnegative orthant; it is used to scale a feasible service vector in the drift argument for policy .
Preamble
import Mathlib import Definitions.Def_ConstrainedQueueing_MaxThroughput_MarkovChain import Definitions.Def_ConstrainedQueueing_MaxThroughput_Model
Formal statement
namespace ConstrainedQueueing.MaxThroughput
/-- Lemma A.1 (p. 1945): under C.1, `co(S)` is closed under `0 ≤ a ≤ c`. -/
theorem lemma_A_1 {L N J : ℕ} (net : Network L N J) (hC1 : C1 net) :
∀ c ∈ coS net, ∀ a : Fin N → ℝ, 0 ≤ a → a ≤ c → a ∈ coS net := by sorry
end ConstrainedQueueing.MaxThroughput
Source
Tassiulas and Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Trans. Automat. Control 37(12) (1992), p. 1945, Appendix, Lemma A.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.