Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — Nash flows are exactly the Wardrop equilibria

Proved
SelfishRouting.Bicriteria.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 an instance with edge–route incidence matrix AAA (entries 000 or 111), commodities i=1,…,ki = 1,\dots,ki=1,…,k with rates ri>0r_i > 0ri​>0, routes Pi\mathcal P_iPi​ serving commodity iii, and edge latency functions ℓe\ell_eℓe​ that are nonnegative, nondecreasing and continuous on [0,∞)[0,\infty)[0,∞). A flow fff is a Nash flow (Definition 2.1) if and only if it is feasible for rrr and, for every iii and all 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: every route that carries flow has minimum latency among the routes of its commodity. The lemma is the working form of the equilibrium used in every later proof.

Formalization Note. The right-hand side is the published KellyStochasticNetworks.IsWardropEquilibrium, which includes feasibility; the page's "a flow fff feasible for instance (G,r,ℓ)(G,r,\ell)(G,r,ℓ)" is therefore on both sides. Routes are arbitrary 0/10/10/1 incidence columns (a generalization of simple paths). The page assumes differentiable latencies; continuity replaces differentiability, as licensed by footnote 3 (p. 7) and §3 (p. 11), which strengthens the statement. Hypotheses on ℓe\ell_eℓe​ are imposed only on [0,∞)[0,\infty)[0,∞), where edge flows live.

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

open KellyStochasticNetworks

/-- Lemma 2.2 (p. 7): Definition 2.1 is equivalent to the Wardrop condition. -/
theorem lemma_2_2 {J R Sd : ℕ} (A : Fin J → Fin R → ℝ) (s : Fin R → Fin Sd)
    (ℓ : Fin J → ℝ → ℝ) (rate : Fin Sd → ℝ)
    (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
    (hrate : ∀ i, 0 < rate i)
    (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 → ℝ) :
    IsNashFlow A s ℓ rate x ↔ IsWardropEquilibrium A s ℓ rate 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. 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