Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 1940 (one class, M = I) — C̄′ = {a ≥ 0 : ∃ f ∈ F_a, c ∈ co(S), f ≤ c}

Proved
ConstrainedQueueing.Nonstationary.lemma_3_1

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

closureconstrained-queueingflowsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability-region

Consider the single-class network with one-slot service times (mi=1m_i=1mi​=1 for every server). For a rate vector a∈RLa\in\mathbb R^La∈RL let FaF_aFa​ be the set of aaa-admissible flows, i.e. vectors f∈RNf\in\mathbb R^Nf∈RN with f≥0f\ge0f≥0 and a=−Rfa=-Rfa=−Rf, where RRR is the routing matrix. Let C′C'C′ be the set of nonnegative aaa for which some f∈Faf\in F_af∈Fa​ and some c∈co(S)c\in\mathrm{co}(S)c∈co(S) satisfy fi<cif_i<c_ifi​<ci​ whenever fi>0f_i>0fi​>0 and fi=0f_i=0fi​=0 whenever ci=0c_i=0ci​=0. Then the closure of C′C'C′ is

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

This is the specialisation of the paper's Lemma 3.1 to J=1J=1J=1 and M=IM=IM=I, 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 Cˉ′\bar C'Cˉ′.

Formalization Note. The closure is taken in Fin L → ℝ with its product topology. Both sides include a≥0a\ge0a≥0, the shared convention for rate vectors (the paper's sets carry no explicit sign condition). No hypothesis on SSS is needed.

Preamble
import Mathlib
import Definitions.Def_ConstrainedQueueing_Nonstationary_Model
Formal statement
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
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, §III.C, Lemma 3.1, specialised to one class and M = I as in §IV, p. 1941
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