Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10a), p. 27 — on a demand slice the SO cost is Lipschitz with constant |A|·T(w)

Proved
SensitivityPoA.Holder.lemma_10_a

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysensitivity-analysissocial-optimum

Let www be a demand vector with T(w)>0T(w) > 0T(w)>0, and let Γ1=(π(1),w)\Gamma_1 = (\pi^{(1)}, w)Γ1​=(π(1),w) and Γ2=(π(2),w)\Gamma_2 = (\pi^{(2)}, w)Γ2​=(π(2),w) be two games of the game space with the same demand vector (the demand slice G(G,K,S)∣w\mathcal G(G,\mathcal K,\mathcal S)|_wG(G,K,S)∣w​). Then

∣C∗(Γ1)−C∗(Γ2)∣≤∣A∣⋅T(w)⋅∥Γ1−Γ2∥.|\mathcal C^*(\Gamma_1) - \mathcal C^*(\Gamma_2)| \le |A|\cdot T(w)\cdot\|\Gamma_1 - \Gamma_2\|.∣C∗(Γ1​)−C∗(Γ2​)∣≤∣A∣⋅T(w)⋅∥Γ1​−Γ2​∥.

On a demand slice the optimal cost therefore moves at most linearly in the distance of the cost functions.

Formalization Note ∥Γ1−Γ2∥\|\Gamma_1 - \Gamma_2\|∥Γ1​−Γ2​∥ is the distance (3.3); on a demand slice it is the largest difference of the cost functions on [0,T(w)][0, T(w)][0,T(w)].

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

/-- Lemma 10a), p. 27: on a demand slice the SO cost is Lipschitz with constant `|A|·T(w)`. -/
theorem lemma_10_a (N : Network) (hN : N.Standing) (Γ1 Γ2 : Game N)
    (h1 : Γ1 ∈ gameSpace N) (h2 : Γ2 ∈ gameSpace N) (hd : Γ1.d = Γ2.d) :
    |SOCost Γ1 - SOCost Γ2| ≤ (N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2 := 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. 27, Lemma 10a)
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