Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1b), p. 13 — potential gap between an ǫ-approximate WE flow and a WE flow

Proved
SensitivityPoA.Holder.lemma_1_b

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

approximate-equilibriumcongestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let Γ=(τ,d)\Gamma = (\tau, d)Γ=(τ,d) be a generalized nonatomic congestion game, ϵ>0\epsilon > 0ϵ>0, fff an ϵ\epsilonϵ-approximate WE flow and f~\tilde ff~​ a WE flow of Γ\GammaΓ, with arc flows faf_afa​ and f~a\tilde f_af~​a​. Then

0≤∑a∈Aτa(f~a)(fa−f~a)≤Φ(Γ,f)−Φ(Γ,f~)≤∑a∈Aτa(fa)(fa−f~a)≤ϵ,0 \le \sum_{a\in A}\tau_a(\tilde f_a)(f_a - \tilde f_a) \le \Phi(\Gamma, f) - \Phi(\Gamma, \tilde f) \le \sum_{a\in A}\tau_a(f_a)(f_a - \tilde f_a) \le \epsilon,0≤a∈A∑​τa​(f~​a​)(fa​−f~​a​)≤Φ(Γ,f)−Φ(Γ,f~​)≤a∈A∑​τa​(fa​)(fa​−f~​a​)≤ϵ,

and consequently

0≤∑a∈A∣τa(fa)−τa(f~a)∣⋅∣fa−f~a∣≤ϵ.0 \le \sum_{a\in A}|\tau_a(f_a) - \tau_a(\tilde f_a)|\cdot|f_a - \tilde f_a| \le \epsilon.0≤a∈A∑​∣τa​(fa​)−τa​(f~​a​)∣⋅∣fa​−f~​a​∣≤ϵ.

The second estimate is what turns approximate equilibrium into closeness of arc costs in Lemma 1c).

Formalization Note Network.Basic contains G1–G2 but does not impose the later Condition 1. Both upper bounds are printed as "<ϵ< \epsilon<ϵ"; Example 2 attains equality in both, so the statement uses ≤\le≤.

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

/-- Lemma 1b), p. 13 (both printed `< ǫ` read `≤ ǫ`, attained in Example 2). -/
theorem lemma_1_b (N : Network) (hN : N.Basic) (Γ : Game N) (hΓ : Γ.IsGeneralized)
    (ε : ℝ) (hε : 0 < ε) (f ftil : Fin N.R → ℝ) (hf : IsApproxWE Γ ε f) (hftil : IsWE Γ ftil) :
    (0 ≤ ∑ j, Γ.τ j (linkFlow N.A ftil j) * (linkFlow N.A f j - linkFlow N.A ftil j) ∧
      ∑ j, Γ.τ j (linkFlow N.A ftil j) * (linkFlow N.A f j - linkFlow N.A ftil j)
        ≤ potential Γ f - potential Γ ftil ∧
      potential Γ f - potential Γ ftil
        ≤ ∑ j, Γ.τ j (linkFlow N.A f j) * (linkFlow N.A f j - linkFlow N.A ftil j) ∧
      ∑ j, Γ.τ j (linkFlow N.A f j) * (linkFlow N.A f j - linkFlow N.A ftil j) ≤ ε) ∧
    (0 ≤ ∑ j, |Γ.τ j (linkFlow N.A f j) - Γ.τ j (linkFlow N.A ftil j)|
          * |linkFlow N.A f j - linkFlow N.A ftil j| ∧
      ∑ j, |Γ.τ j (linkFlow N.A f j) - Γ.τ j (linkFlow N.A ftil j)|
          * |linkFlow N.A f j - linkFlow N.A ftil j| ≤ ε) := 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 1b)
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