Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1c), p. 13 — with M-Lipschitz costs, an ǫ-approximate WE flow costs within |A|·√(M·ǫ)·T(d) + ǫ of a WE flow

Proved
SensitivityPoA.Holder.lemma_1_c

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

approximate-equilibriumcongestion-gameslipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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Γ. Suppose every arc cost τa\tau_aτa​ is Lipschitz continuous on [0,T(d)][0, T(d)][0,T(d)] with Lipschitz constant M>0M > 0M>0. Write Lk(τ,d)=min⁡s′∈Skτs′(f~)L_k(\tau,d) = \min_{s'\in\mathcal S_k}\tau_{s'}(\tilde f)Lk​(τ,d)=mins′∈Sk​​τs′​(f~​) for the user cost of pair kkk (2.2). Then:

  1. ∣τa(fa)−τa(f~a)∣≤Mϵ|\tau_a(f_a) - \tau_a(\tilde f_a)| \le \sqrt{M\epsilon}∣τa​(fa​)−τa​(f~​a​)∣≤Mϵ​ for every arc aaa;
  2. ∣Lk(τ,d)−min⁡s′∈Skτs′(f)∣≤∣A∣Mϵ|L_k(\tau,d) - \min_{s'\in\mathcal S_k}\tau_{s'}(f)| \le |A|\sqrt{M\epsilon}∣Lk​(τ,d)−mins′∈Sk​​τs′​(f)∣≤∣A∣Mϵ​ for every O/D pair kkk;
∣C(Γ,f)−C(Γ,f~)∣≤∣A∣Mϵ T(d)+ϵ.|C(\Gamma, f) - C(\Gamma, \tilde f)| \le |A|\sqrt{M\epsilon}\,T(d) + \epsilon.∣C(Γ,f)−C(Γ,f~​)∣≤∣A∣Mϵ​T(d)+ϵ.

This is the estimate that produces the exponent 1/21/21/2 in the Hölder continuity of the price of anarchy (Lemma 10d), Theorem 9); Example 2 shows it is tight.

Formalization Note Network.Basic contains G1–G2 but does not impose the later Condition 1. The first bound is printed with "<<<"; Example 2 (M=1M = 1M=1) gives ∣τu(fu)−τu(f~u)∣=ϵ|\tau_u(f_u) - \tau_u(\tilde f_u)| = \sqrt\epsilon∣τu​(fu​)−τu​(f~​u​)∣=ϵ​, as the paper notes on p. 14, so the statement uses ≤\le≤. ∣A∣|A|∣A∣ is the number of arcs, cast to a real number.

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

/-- Lemma 1c), p. 13 (the first printed `<` read `≤`, attained in Example 2). The user cost
`L_k(τ, d)` (2.2) is `minPathCost Γ ftil k` for the WE flow `ftil`. -/
theorem lemma_1_c (N : Network) (hN : N.Basic) (Γ : Game N) (hΓ : Γ.IsGeneralized)
    (ε : ℝ) (hε : 0 < ε) (f ftil : Fin N.R → ℝ) (hf : IsApproxWE Γ ε f) (hftil : IsWE Γ ftil)
    (M : ℝ) (hM0 : 0 < M) (hM : ∀ j, LipOnIcc (Γ.τ j) (totalDemand Γ.d) M) :
    (∀ j, |Γ.τ j (linkFlow N.A f j) - Γ.τ j (linkFlow N.A ftil j)| ≤ Real.sqrt (M * ε)) ∧
    (∀ k, |minPathCost Γ ftil k - minPathCost Γ f k| ≤ (N.J : ℝ) * Real.sqrt (M * ε)) ∧
    |cost Γ f - cost Γ ftil| ≤ (N.J : ℝ) * Real.sqrt (M * ε) * totalDemand Γ.d + ε := 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 1c)
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