Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 1940 — the closure of C′ is {a : ∃ f ∈ F_a, c ∈ co(S), M⁻¹f̂ ≤ c}

Proved
ConstrainedQueueing.MaxThroughput.lemma_3_1

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

closuremulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability-region

Consider a constrained queueing network with service probabilities mi>0m_i>0mi​>0, and let MMM be the diagonal matrix with entries m1,…,mNm_1,\dots,m_Nm1​,…,mN​. Let FaF_aFa​ be the set of aaa-admissible multicommodity flows, f^=∑jfj\hat f=\sum_j f^jf^​=∑j​fj the total flow, and C′C'C′ the set of arrival-rate vectors defined on p. 1940 (see the Model definition).

Lemma 3.1. The closure Cˉ′\bar C'Cˉ′ of C′C'C′ is

Cˉ′={a≥0: there exist f∈Fa and c∈co(S) with M−1f^≤c}.\bar C'=\{a\ge 0:\ \text{there exist } f\in F_a \text{ and } c\in\mathrm{co}(S) \text{ with } M^{-1}\hat f\le c\}.Cˉ′={a≥0: there exist f∈Fa​ and c∈co(S) with M−1f^​≤c}.

Thus the strict inequalities in the definition of C′C'C′ become non-strict on the boundary. The lemma identifies the outer bound Cˉ′\bar C'Cˉ′ of the stability region in a form that no stationary policy can exceed.

Formalization Note. Rate vectors are indexed by the queues (l,j)(l,j)(l,j) with l∉Vjl\notin V_jl∈/Vj​; the condition a≥0a\ge 0a≥0 is part of both sides (the paper's rate vectors are nonnegative). M−1f^≤cM^{-1}\hat f\le cM−1f^​≤c is written componentwise as f^i/mi≤ci\hat f_i/m_i\le c_if^​i​/mi​≤ci​.

Preamble
import Mathlib
import Definitions.Def_ConstrainedQueueing_MaxThroughput_MarkovChain
import Definitions.Def_ConstrainedQueueing_MaxThroughput_Model
Formal statement
namespace ConstrainedQueueing.MaxThroughput

/-- Lemma 3.1 (p. 1940): `C̄′ = {a ≥ 0 : ∃ f ∈ F_a, ∃ c ∈ co(S), M⁻¹ f̂ ≤ c}`. -/
theorem lemma_3_1 {L N J : ℕ} (net : Network L N J) (hm : ∀ i, 0 < net.m i) :
    closure (Cprime net) =
      {a | (∀ p, 0 ≤ a p) ∧ ∃ f, IsAdmissibleFlow net a f ∧
        ∃ c ∈ coS net, ∀ i, fhat f i / net.m i ≤ c i} := 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. 1940, Lemma 3.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