Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 43 — the constant-cost game Γ′ = (σ, d/T(d)), σ_a ≡ τ_a(0), has SO cost C∗(Γ′) ≥ τmin(0)

Proved
SensitivityPoA.SmallDemand.SOCost_const_ge

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

congestion-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchysocial-optimum

Fix a structure satisfying the standing assumptions. Let τ=(τa)a∈A\tau = (\tau_a)_{a\in A}τ=(τa​)a∈A​ be functions with τa(0)>0\tau_a(0) > 0τa​(0)>0 for every arc, and let

τmin⁡(0)=min⁡a∈Aτa(0).\tau_{\min}(0) = \min_{a \in A} \tau_a(0).τmin​(0)=a∈Amin​τa​(0).

Let d≥0d \ge 0d≥0 be a demand vector with T(d)>0T(d) > 0T(d)>0, let σa(x)≡τa(0)\sigma_a(x) \equiv \tau_a(0)σa​(x)≡τa​(0), and let Γ′=(σ,d/T(d))\Gamma' = (\sigma, d/T(d))Γ′=(σ,d/T(d)). Then

C∗(Γ′)≥τmin⁡(0).\mathcal C^*(\Gamma') \ge \tau_{\min}(0).C∗(Γ′)≥τmin​(0).

The lower bound does not depend on ddd, because Γ′\Gamma'Γ′ always has total demand T(d/T(d))=1T(d/T(d)) = 1T(d/T(d))=1; this uniformity is what makes the constant of Corollary 5.1 independent of the demand.

Formalization Note τmin⁡(0)\tau_{\min}(0)τmin​(0) is passed as a real number that is the least element of {τa(0):a∈A}\{\tau_a(0) : a \in A\}{τa​(0):a∈A}.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SensitivityPoA_SmallDemand_Setting
Formal statement
namespace SensitivityPoA.SmallDemand

open KellyStochasticNetworks

/-- p. 43: with `σ_a ≡ τ_a(0) > 0` and `τmin(0) = min_a τ_a(0)`, the SO cost of the auxiliary game
`Γ' = (σ, d/T(d))` is at least `τmin(0)` for every demand vector `d`, since `T(d/T(d)) = 1`. -/
theorem SOCost_const_ge (N : Network) (hN : N.Standing) (τ : Fin N.J → ℝ → ℝ)
    (hpos : ∀ j, 0 < τ j 0) (τmin : ℝ) (hτmin : IsLeast (Set.range fun j => τ j 0) τmin)
    (d : Fin N.Sd → ℝ) (hd : ∀ k, 0 ≤ d k) (hT : 0 < totalDemand d) :
    τmin ≤ SOCost (⟨fun j _ => τ j 0, fun k => d k / totalDemand d⟩ : Game N) := by sorry

end SensitivityPoA.SmallDemand
Source
Wu, Möhring, A sensitivity analysis of the PoA in non-atomic congestion games, arXiv:2007.13979v3 (2021), p. 43, §5.2, "C∗(Γ′) ≥ τmin(0)"
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