Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.2, p. 6 — f is a Nash flow iff every used path of a commodity is a shortest path

Proved
PoAIndep.Topology.proposition_2_2

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

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

Let (G,r,ℓ)(G,r,\ell)(G,r,ℓ) be an instance (latency functions nonnegative, differentiable and nondecreasing on [0,∞)[0,\infty)[0,∞)) and let fff be a flow. Then fff is at Nash equilibrium in the sense of Definition 2.1 if and only if, for every commodity iii and all simple sis_isi​–tit_iti​ paths P1,P2P_1,P_2P1​,P2​ with fP1i>0f^i_{P_1}>0fP1​i​>0,

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

In words: in a Nash flow all flow travels on minimum-latency paths. The page derives it from Definition 2.1 by letting the moved amount δ\deltaδ tend to 000, using continuity and monotonicity of the edge latencies. It is the working characterization of Nash flows used in Proposition 2.3 and Lemma 3.7.

Formalization Note. The hypothesis that fff is a flow (nonnegative, supported on simple sis_isi​–tit_iti​ paths) is the paper's standing setting; feasibility is not needed.

Preamble
import Mathlib
import Definitions.Def_PoAIndep_Topology_Model
Formal statement
namespace PoAIndep.Topology

theorem proposition_2_2 {V E : Type} [Fintype V] [DecidableEq V] [Fintype E]
    [DecidableEq E] (I : Instance V E) (f : Flow I) (hf : IsFlow I f) :
    IsNashFlow I f ↔
      ∀ (i : Fin I.k) (P₁ P₂ : List E),
        IsSimplePath I.src I.tgt P₁ (I.s i) (I.t i) →
        IsSimplePath I.src I.tgt P₂ (I.s i) (I.t i) →
        0 < f i P₁ → pathLatency I f P₁ ≤ pathLatency I f P₂ := by sorry

end PoAIndep.Topology
Source
Roughgarden, The price of anarchy is independent of the network topology (journal-version manuscript, Dec. 23, 2002), p. 6, Proposition 2.2 (with the sentence preceding it on p. 5)
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