Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1a), p. 13 — an ǫ-approximate WE flow is within ǫ of the per-pair minimum path cost

Proved
SensitivityPoA.Holder.lemma_1_a

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

approximate-equilibriumcongestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wardrop-equilibrium

Let Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) be a generalized nonatomic congestion game (continuous, non-decreasing, non-negative arc costs on [0,∞)[0,\infty)[0,∞), non-negative demands), let ϵ>0\epsilon > 0ϵ>0 and let fff be an ϵ\epsilonϵ-approximate Wardrop equilibrium flow of Γ\GammaΓ. Then for every O/D pair kkk,

0≤∑s∈Skfs τs(f)−dkmin⁡s′∈Skτs′(f)≤ϵ,0 \le \sum_{s\in\mathcal S_k} f_s\,\tau_s(f) - d_k \min_{s'\in\mathcal S_k}\tau_{s'}(f) \le \epsilon,0≤s∈Sk​∑​fs​τs​(f)−dk​s′∈Sk​min​τs′​(f)≤ϵ,

and moreover

∑k∈Kdkmin⁡s′∈Skτs′(f)≤C(Γ,f)≤∑k∈Kdkmin⁡s′∈Skτs′(f)+ϵ.\sum_{k\in\mathcal K} d_k \min_{s'\in\mathcal S_k}\tau_{s'}(f) \le C(\Gamma, f) \le \sum_{k\in\mathcal K} d_k \min_{s'\in\mathcal S_k}\tau_{s'}(f) + \epsilon.k∈K∑​dk​s′∈Sk​min​τs′​(f)≤C(Γ,f)≤k∈K∑​dk​s′∈Sk​min​τs′​(f)+ϵ.

The total cost of an approximate equilibrium is thus within ϵ\epsilonϵ of what each user would pay on a cheapest path; this is the basic estimate behind Lemma 1c).

Formalization Note Network.Basic contains G1–G2 but does not impose the later Condition 1. The paper prints the first upper bound as "<ϵ< \epsilon<ϵ". Only "≤ϵ\le \epsilon≤ϵ" follows from (2.7), and Example 2 (p. 13: Pigou's game with f=(1−ϵ,ϵ)f = (1-\sqrt\epsilon, \sqrt\epsilon)f=(1−ϵ​,ϵ​)) attains equality, so the statement uses ≤\le≤. The lemma's preamble also names a WE flow f~\tilde ff~​, which part a) does not use; it is omitted.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SensitivityPoA_Holder_Setting
Formal statement
namespace SensitivityPoA.Holder
open KellyStochasticNetworks

/-- Lemma 1a), p. 13 (printed `< ǫ` read `≤ ǫ`, attained in Example 2). -/
theorem lemma_1_a (N : Network) (hN : N.Basic) (Γ : Game N) (hΓ : Γ.IsGeneralized)
    (ε : ℝ) (hε : 0 < ε) (f : Fin N.R → ℝ) (hf : IsApproxWE Γ ε f) :
    (∀ k : Fin N.Sd,
      0 ≤ (∑ r ∈ Finset.univ.filter (fun r => N.s r = k), f r * pathCost Γ f r)
          - Γ.d k * minPathCost Γ f k ∧
      (∑ r ∈ Finset.univ.filter (fun r => N.s r = k), f r * pathCost Γ f r)
          - Γ.d k * minPathCost Γ f k ≤ ε) ∧
    (∑ k, Γ.d k * minPathCost Γ f k ≤ cost Γ f ∧
      cost Γ f ≤ (∑ k, Γ.d k * minPathCost Γ f k) + ε) := by sorry

end SensitivityPoA.Holder
Source
Wu, Möhring, A sensitivity analysis of the PoA in non-atomic congestion games, arXiv:2007.13979v3 (2021), p. 13, Lemma 1a)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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