Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, first display, p. 13 — ∑eℓˉe(fe∗)fe∗−C(f∗)≤C(f)\sum_e \bar\ell_e(f^*_e) f^*_e - C(f^*) \le C(f)∑e​ℓˉe​(fe∗​)fe∗​−C(f∗)≤C(f)

Proved
SelfishRouting.Bicriteria.barCost_sub_cost_le

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

nash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1selfish-routing

Let AAA be a 0/10/10/1 edge–route incidence matrix and ℓe\ell_eℓe​ edge latency functions that are nonnegative on [0,∞)[0,\infty)[0,∞). Let fff and f∗f^*f∗ be two route flows with nonnegative entries, with edge flows fef_efe​ and fe∗f^*_efe∗​, and let ℓˉ\bar\ellℓˉ be the modified latencies built from the edge flows of fff: ℓˉe(x)=ℓe(fe)\bar\ell_e(x) = \ell_e(f_e)ℓˉe​(x)=ℓe​(fe​) for x≤fex \le f_ex≤fe​ and ℓˉe(x)=ℓe(x)\bar\ell_e(x) = \ell_e(x)ℓˉe​(x)=ℓe​(x) for x≥fex \ge f_ex≥fe​. Then

∑eℓˉe(fe∗) fe∗−C(f∗)≤C(f).\sum_e \bar\ell_e(f^*_e)\, f^*_e - C(f^*) \le C(f).e∑​ℓˉe​(fe∗​)fe∗​−C(f∗)≤C(f).

In words: evaluating f∗f^*f∗ with the latencies ℓˉ\bar\ellℓˉ rather than ℓ\ellℓ increases its cost by at most C(f)C(f)C(f). This is the upper half of the proof of Theorem 3.1.

Formalization Note. The statement needs neither equilibrium nor feasibility nor monotonicity of ℓ\ellℓ; only nonnegative route flows, a 0/10/10/1 incidence matrix and ℓe≥0\ell_e \ge 0ℓe​≥0 on [0,∞)[0,\infty)[0,∞) are assumed, so it is slightly more general than the context on the page, where fff is a Nash flow and f∗f^*f∗ is feasible for 2r2r2r.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SelfishRouting_Bicriteria_Model
import Definitions.Def_SelfishRouting_Bicriteria_BarLatency
Formal statement
namespace SelfishRouting.Bicriteria

open KellyStochasticNetworks

/-- Proof of Theorem 3.1, first display (p. 13):
`∑ₑ ℓ̄ₑ(f*ₑ) f*ₑ − C(f*) ≤ C(f)`, where `ℓ̄` is built from the edge flows of `f`. -/
theorem barCost_sub_cost_le {J R : ℕ} (A : Fin J → Fin R → ℝ) (ℓ : Fin J → ℝ → ℝ)
    (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
    (hℓnn : ∀ j t, 0 ≤ t → 0 ≤ ℓ j t)
    (x y : Fin R → ℝ) (hx : ∀ r, 0 ≤ x r) (hy : ∀ r, 0 ≤ y r) :
    (∑ j, barLatency ℓ (linkFlow A x) j (linkFlow A y j) * linkFlow A y j) - cost A ℓ y
      ≤ cost A ℓ x := by sorry

end SelfishRouting.Bicriteria
Source
Roughgarden & Tardos, How Bad is Selfish Routing?, J. ACM 49(2) (2002), author's manuscript of 5 Dec 2001, p. 13, proof of Theorem 3.1, first display
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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