Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.7, p. 12 — a Nash flow is a min-cost flow for the costs ℓₑ(fₑ): Σₑ ℓₑ(fₑ)fₑ ≤ Σₑ ℓₑ(fₑ)f*ₑ

Proved
PoAIndep.Topology.lemma_3_7

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

min-cost-flownash-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1selfish-routing

Let (G,r,ℓ)(G,r,\ell)(G,r,ℓ) be an instance, let fff be a feasible flow at Nash equilibrium and let f∗f^*f∗ be any feasible flow. Then

∑e∈Eℓe(fe) fe≤∑e∈Eℓe(fe) fe∗.\sum_{e\in E}\ell_e(f_e)\,f_e\le\sum_{e\in E}\ell_e(f_e)\,f^*_e .e∈E∑​ℓe​(fe​)fe​≤e∈E∑​ℓe​(fe​)fe∗​.

That is, a Nash flow is a minimum-cost flow, in the classical sense, for the fixed edge costs ℓe(fe)\ell_e(f_e)ℓe​(fe​). In Theorem 3.8 it shows that the error term ∑e(fe∗−fe)ℓe(fe)\sum_e(f^*_e-f_e)\ell_e(f_e)∑e​(fe∗​−fe​)ℓe​(fe​) is nonnegative.

Formalization Note. The page says "fff be at Nash equilibrium and f∗f^*f∗ feasible for instance (G,r,ℓ)(G,r,\ell)(G,r,ℓ)"; the formal statement reads "feasible" as applying to fff as well, since the proof invokes Proposition 2.3, which requires it, and the inequality fails for a Nash flow routing larger rates.

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

theorem lemma_3_7 {V E : Type} [Fintype V] [DecidableEq V] [Fintype E]
    [DecidableEq E] (I : Instance V E) (f g : Flow I) (hf : IsFlow I f) (hfeas : IsFeasible I f)
    (hnash : IsNashFlow I f) (hg : IsFlow I g) (hgfeas : IsFeasible I g) :
    ∑ e, I.ℓ e (edgeFlow I f e) * edgeFlow I f e ≤
      ∑ e, I.ℓ e (edgeFlow I f e) * edgeFlow I g e := by sorry

end PoAIndep.Topology
Source
Roughgarden, The price of anarchy is independent of the network topology (journal-version manuscript, Dec. 23, 2002), p. 12, Lemma 3.7
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