Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10b), p. 27 — on a demand slice the potential values of WE flows differ by O(|A|·T(w)·‖Γ1 − Γ2‖)

Proved
SensitivityPoA.Holder.lemma_10_b

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-functionprice-of-anarchysensitivity-analysis

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 www, and let f~\tilde ff~​ and g~\tilde gg~​ be WE flows of Γ1\Gamma_1Γ1​ and Γ2\Gamma_2Γ2​. Then

  1. ∣Φ(Γ1,f)−Φ(Γ2,f)∣≤∣A∣ T(w) ∥Γ1−Γ2∥|\Phi(\Gamma_1, f) - \Phi(\Gamma_2, f)| \le |A|\,T(w)\,\|\Gamma_1-\Gamma_2\|∣Φ(Γ1​,f)−Φ(Γ2​,f)∣≤∣A∣T(w)∥Γ1​−Γ2​∥ for every flow fff;
  2. ∣Φ(Γ1,f~)−Φ(Γ2,g~)∣≤∣A∣ T(w) ∥Γ1−Γ2∥|\Phi(\Gamma_1, \tilde f) - \Phi(\Gamma_2, \tilde g)| \le |A|\,T(w)\,\|\Gamma_1-\Gamma_2\|∣Φ(Γ1​,f~​)−Φ(Γ2​,g~​)∣≤∣A∣T(w)∥Γ1​−Γ2​∥;
  3. 0≤Φ(Γ1,g~)−Φ(Γ1,f~)≤2∣A∣ T(w) ∥Γ1−Γ2∥0 \le \Phi(\Gamma_1, \tilde g) - \Phi(\Gamma_1, \tilde f) \le 2|A|\,T(w)\,\|\Gamma_1-\Gamma_2\|0≤Φ(Γ1​,g~​)−Φ(Γ1​,f~​)≤2∣A∣T(w)∥Γ1​−Γ2​∥;
  4. 0≤Φ(Γ2,f~)−Φ(Γ2,g~)≤2∣A∣ T(w) ∥Γ1−Γ2∥0 \le \Phi(\Gamma_2, \tilde f) - \Phi(\Gamma_2, \tilde g) \le 2|A|\,T(w)\,\|\Gamma_1-\Gamma_2\|0≤Φ(Γ2​,f~​)−Φ(Γ2​,g~​)≤2∣A∣T(w)∥Γ1​−Γ2​∥.

The WE flow of each game is thus an almost-minimizer of the other game's potential.

Formalization Note "Every flow" is a flow of the common demand vector www.

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

/-- Lemma 10b), p. 27: potential values on a demand slice. -/
theorem lemma_10_b (N : Network) (hN : N.Standing) (Γ1 Γ2 : Game N)
    (h1 : Γ1 ∈ gameSpace N) (h2 : Γ2 ∈ gameSpace N) (hd : Γ1.d = Γ2.d)
    (ftil gtil : Fin N.R → ℝ) (hftil : IsWE Γ1 ftil) (hgtil : IsWE Γ2 gtil) :
    (∀ f, IsFlow Γ1 f →
      |potential Γ1 f - potential Γ2 f| ≤ (N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2) ∧
    |potential Γ1 ftil - potential Γ2 gtil| ≤ (N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2 ∧
    (0 ≤ potential Γ1 gtil - potential Γ1 ftil ∧
      potential Γ1 gtil - potential Γ1 ftil ≤ 2 * (N.J : ℝ) * totalDemand Γ1.d * gameDist Γ1 Γ2) ∧
    (0 ≤ potential Γ2 ftil - potential Γ2 gtil ∧
      potential Γ2 ftil - potential Γ2 gtil ≤ 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 10b)
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