Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1, p. 1945 — co(S) is closed under 0 ≤ a ≤ c

Proved
ConstrainedQueueing.MaxThroughput.lemma_A_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

constraint-setconvex-hulldownward-closedp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let SSS be the constraint set of a constrained queueing network with NNN servers, viewed as a family of subsets of {1,…,N}\{1,\dots,N\}{1,…,N}, and let co(S)⊂RN\mathrm{co}(S)\subset\mathbb R^Nco(S)⊂RN 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 c∈co(S)c\in\mathrm{co}(S)c∈co(S) and a∈RNa\in\mathbb R^Na∈RN satisfies

0≤a≤c(componentwise),0\le a\le c\quad\text{(componentwise)},0≤a≤c(componentwise),

then a∈co(S)a\in\mathrm{co}(S)a∈co(S).

The lemma says that the capacity region co(S)\mathrm{co}(S)co(S) is downward closed in the nonnegative orthant; it is used to scale a feasible service vector in the drift argument for policy π0\pi_0π0​.

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
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me