Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5, p. 14 — at most Ry packets on g in every y-frame for T ≤ y ≤ 2T − 1 implies the same for all y ≥ T

Proved
PacketRouting.CongDil.lemma_3_5

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1packet-routingscheduling

Fix any schedule of a finite set of packets (valid or not), an edge ggg, a real number RRR and a frame size T≥1T\ge 1T≥1. For a frame of yyy consecutive steps starting at step ttt, let Cg(t,y)C_g(t,y)Cg​(t,y) be the number of packets that cross ggg at some step of the frame.

Lemma 3.5. If

Cg(t,y)≤R yfor every start t and every y with T≤y≤2T−1,C_g(t,y)\le R\,y\qquad\text{for every start } t \text{ and every } y \text{ with } T\le y\le 2T-1,Cg​(t,y)≤Ryfor every start t and every y with T≤y≤2T−1,

then Cg(t,y)≤R yC_g(t,y)\le R\,yCg​(t,y)≤Ry for every start ttt and every y≥Ty\ge Ty≥T.

The lemma reduces the frame-congestion bounds of the refinement step to frames of a bounded range of sizes; it is used several times in the proof of Theorem 3.4.

Formalization Note The hypothesis T≥1T\ge1T≥1 is implicit on the page: for T=0T=0T=0 the range T≤y≤2T−1T\le y\le 2T-1T≤y≤2T−1 is empty and the conclusion fails. The range is written T≤y<2TT\le y<2TT≤y<2T.

Preamble
import Mathlib
import Definitions.Def_PacketRouting_CongDil_Timetable
Formal statement
namespace PacketRouting.CongDil

/-- Lemma 3.5 (Leighton–Maggs–Rao, p. 14): in any schedule (valid or not), if for every `y`
with `T ≤ y ≤ 2T − 1` at most `R y` packets use edge `g` in every `y`-frame, then at most `R y`
packets use `g` in every `y`-frame for every `y ≥ T`. -/
theorem lemma_3_5 {P E : Type*} [Fintype P] {path : P → List E} (τ : Timetable path)
    (g : E) (R : ℝ) (T : ℕ) (hT : 1 ≤ T)
    (h : ∀ y t : ℕ, T ≤ y → y < 2 * T → (τ.frameCount g t y : ℝ) ≤ R * y) :
    ∀ y t : ℕ, T ≤ y → (τ.frameCount g t y : ℝ) ≤ R * y := by sorry

end PacketRouting.CongDil
Source
Leighton, Maggs & Rao, Packet routing and job-shop scheduling in O(congestion + dilation) steps, authors' manuscript (preprint of Combinatorica 14 (1994), DOI 10.1007/BF01215349), p. 14, Lemma 3.5
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