Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — a feasible flow is at Nash equilibrium iff every used path has minimum latency

Proved
SelfishRouting.Linear.lemma_2_2

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

nash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1selfish-routingwardrop-equilibrium

Consider the routing model with routes given by 0/10/10/1 edge incidences, commodities iii with positive rates ri>0r_i>0ri​>0, and edge latency functions ℓe\ell_eℓe​ that are nonnegative, nondecreasing and continuous on [0,∞)[0,\infty)[0,∞). Let fff be a route flow. Then fff is at Nash equilibrium (Definition 2.1) if and only if fff is feasible and for every commodity iii and routes P1,P2∈PiP_1,P_2\in\mathcal P_iP1​,P2​∈Pi​ with fP1>0f_{P_1}>0fP1​​>0,

ℓP1(f)≤ℓP2(f).\ell_{P_1}(f)\le \ell_{P_2}(f).ℓP1​​(f)≤ℓP2​​(f).

The right-hand side is the Wardrop condition. This lemma turns the deviation-based Definition 2.1 into a condition on the latencies at fff alone, which is what all of the paper's later arguments use.

Formalization Note The right-hand side is the published KellyStochasticNetworks.IsWardropEquilibrium (which includes feasibility). Continuity replaces the paper's differentiability (footnote 3, p. 7, licenses this), which weakens a hypothesis; the latency hypotheses are imposed only on [0,∞)[0,\infty)[0,∞), where flows live. Definition 2.1 is formalized with P1≠P2P_1\neq P_2P1​=P2​ and 0<δ≤fP10<\delta\le f_{P_1}0<δ≤fP1​​ (see the definition item). Routes are 0/10/10/1 incidence columns rather than simple paths, a disclosed generalization.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SelfishRouting_Linear_Model
Formal statement
namespace SelfishRouting.Linear

open KellyStochasticNetworks

/-- Lemma 2.2 (Roughgarden–Tardos, p. 7): for latencies that are nonnegative, nondecreasing
and continuous on `[0, ∞)`, a flow is at Nash equilibrium (Definition 2.1) if and only if it
is feasible and every route carrying positive flow has latency at most that of any route
serving the same commodity (the Wardrop condition). -/
theorem lemma_2_2 {J R Sd : ℕ} (A : Fin J → Fin R → ℝ) (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
    (s : Fin R → Fin Sd) (rate : Fin Sd → ℝ) (hrate : ∀ i, 0 < rate i)
    (ℓ : Fin J → ℝ → ℝ) (hℓnn : ∀ j t, 0 ≤ t → 0 ≤ ℓ j t)
    (hℓmono : ∀ j, MonotoneOn (ℓ j) (Set.Ici 0))
    (hℓcont : ∀ j, ContinuousOn (ℓ j) (Set.Ici 0))
    (x : Fin R → ℝ) :
    SelfishRouting.Bicriteria.IsNashFlow A s ℓ rate x ↔ IsWardropEquilibrium A s ℓ rate x := by sorry

end SelfishRouting.Linear
Source
Roughgarden & Tardos, How Bad is Selfish Routing?, J. ACM 49(2) (2002), author's manuscript of 5 Dec 2001, p. 7, Lemma 2.2
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