Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4 — the online routing algorithm respects capacities and serves ≥ OPT/(4B ln 2 · ln(P(max)+2)) − 1 requests

Proved
BNCovPack.Routing.lemma_5_4

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

competitive-analysisderandomizationonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1routing

Let EEE be a non-empty finite set of mmm edges with capacities u(e)>0u(e) > 0u(e)>0, let σ\sigmaσ be a sequence of requests whose paths have at most P(max⁡)P(\max)P(max) edges each, and let B=exp⁡(1+ln⁡(2m)/u(min⁡))−1B = \exp(1 + \ln(2m)/u(\min)) - 1B=exp(1+ln(2m)/u(min))−1. Run the integral online routing algorithm of Section 5.2 on σ\sigmaσ, and let χ(e)\chi(e)χ(e) be the number of chosen paths through edge eee and ∑riχ(ri)\sum_{r_i} \chi(r_i)∑ri​​χ(ri​) the number of served requests. Then

  1. no capacity is violated: χ(e)≤u(e)\chi(e) \le u(e)χ(e)≤u(e) for every edge eee;
  2. for every feasible fractional routing fff of σ\sigmaσ (in particular an optimal one, of value OPT\mathrm{OPT}OPT),
∑riχ(ri) ≥ val(f)4Bln⁡2⋅ln⁡(P(max⁡)+2)−1.\sum_{r_i} \chi(r_i) \ \ge\ \frac{\mathrm{val}(f)}{4B \ln 2 \cdot \ln\big(P(\max)+2\big)} - 1 .ri​∑​χ(ri​) ≥ 4Bln2⋅ln(P(max)+2)val(f)​−1.

Since every integral routing is a feasible fractional routing, the bound holds against the integral optimum as well. This is the paper's deterministic online algorithm for throughput-competitive routing of virtual circuits, matching the competitive factor of Awerbuch, Azar and Plotkin.

Formalization Note The paper writes O(log⁡P(max⁡)⋅[exp⁡(1+2ln⁡m/u(min⁡))−1])O(\log P(\max) \cdot [\exp(1 + 2\ln m/u(\min)) - 1])O(logP(max)⋅[exp(1+2lnm/u(min))−1]); the proof yields the explicit bound above, with the rounding scale B=exp⁡(1+ln⁡(2m)/u(min⁡))−1B = \exp(1+\ln(2m)/u(\min)) - 1B=exp(1+ln(2m)/u(min))−1 chosen on p. 15 and the fractional factor 2ln⁡(1+ℓ)=2ln⁡(P(max⁡)+2)2\ln(1+\ell) = 2\ln(P(\max)+2)2ln(1+ℓ)=2ln(P(max)+2). For m≥2m \ge 2m≥2, ln⁡(2m)≤2ln⁡m\ln(2m) \le 2\ln mln(2m)≤2lnm, so this is at least as strong as the printed rate; at m=1m = 1m=1 the printed "2ln⁡m2 \ln m2lnm" =0= 0=0 does not follow from the proof, and the proof's constant is stated. Paths are arbitrary finite edge sets (simple paths of a graph are a special case), and P(max⁡)P(\max)P(max) is any upper bound on their size.

Preamble
import Mathlib
import Definitions.Def_BNCovPack_Routing_Routing
import Definitions.Def_BNCovPack_Routing_Potential
import Definitions.Def_BNCovPack_Routing_Algorithm
Formal statement
namespace BNCovPack.Routing

/-- Lemma 5.4, Buchbinder–Naor 2009, p. 16 (explicit form from the proof, pp. 16–17). Let `E` be
a non-empty finite set of `m` edges with capacities `u e > 0`, let every path of every request in
`σ` have at most `Pmax` edges, and let `B = exp(1 + ln(2m)/u(min)) − 1`. After the online routing
algorithm of §5.2 has processed `σ`:
1. no capacity is violated: `χ(e) ≤ u(e)` for every edge `e`;
2. the number of served requests is at least `OPT/(4 B ln 2 · ln(Pmax + 2)) − 1`, where `OPT` is the
   value of any feasible fractional routing of `σ`. -/
theorem lemma_5_4 {E : Type*} [Fintype E] [Nonempty E] [DecidableEq E] (u : E → ℝ)
    (hu : ∀ e, 0 < u e) (Pmax : ℕ) (σ : List (List (Finset E)))
    (hP : ∀ ps ∈ σ, ∀ P ∈ ps, P.card ≤ Pmax) :
    (∀ e, ((algorithm u Pmax σ).chi e : ℝ) ≤ u e) ∧
    ∀ f : List (List ℝ), IsFeasibleRouting u σ f →
      routingValue f / (4 * roundingScale u * Real.log 2 * Real.log ((Pmax : ℝ) + 2)) - 1 ≤
        ((algorithm u Pmax σ).served : ℝ) := by sorry

end BNCovPack.Routing
Source
Buchbinder, Naor, Online Primal-Dual Algorithms for Covering and Packing, Math. Oper. Res. (2009), DOI 10.1287/moor.1080.0363, p. 16, Lemma 5.4 (proof pp. 16–17)
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