Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.3, p. 6 — the cost of a feasible Nash flow is Σᵢ Lᵢ(f) rᵢ

Proved
PoAIndep.Topology.proposition_2_3

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

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

The page notes after Proposition 2.2: "if fff is at Nash equilibrium then all sis_isi​-tit_iti​ flow paths (sis_isi​-tit_iti​ paths to which fff assigns a positive amount of flow) have equal latency, say Li(f)L_i(f)Li​(f)."

Let fff be a flow at Nash equilibrium that is feasible for the instance (G,r,ℓ)(G,r,\ell)(G,r,ℓ). Then there are numbers L1(f),…,Lk(f)L_1(f),\dots,L_k(f)L1​(f),…,Lk​(f) such that every path PPP with fPi>0f^i_P>0fPi​>0 has latency ℓP(f)=Li(f)\ell_P(f)=L_i(f)ℓP​(f)=Li​(f), and

C(f)=∑i=1kLi(f) ri.C(f)=\sum_{i=1}^k L_i(f)\,r_i .C(f)=i=1∑k​Li​(f)ri​.

This expresses the cost of a Nash flow through the common latencies of its commodities; it is the first step in the proof of Lemma 3.7.

Formalization Note. The common latencies Li(f)L_i(f)Li​(f), defined in the sentence before the proposition, are carried as an existential witness.

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

theorem proposition_2_3 {V E : Type} [Fintype V] [DecidableEq V] [Fintype E]
    [DecidableEq E] (I : Instance V E) (f : Flow I) (hf : IsFlow I f) (hfeas : IsFeasible I f)
    (hnash : IsNashFlow I f) :
    ∃ Lc : Fin I.k → ℝ, (∀ i P, 0 < f i P → pathLatency I f P = Lc i) ∧
      cost I f = ∑ i, Lc i * I.r i := 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.3 (and the sentence defining L_i(f) before it)
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