Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — the partial potential is cost-revealing

Proved
WeightedCongestionBR.lemma_5

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-game-theoryapproximate-equilibriacongestion-gamesp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Γ\GammaΓ be a weighted polynomial congestion game of degree d≥1d\ge1d≥1 with weights wu≥1w_u\ge1wu​≥1. For any group of players R⊆NR\subseteq NR⊆N and any state sss,

∑u∈RCu(s)≤ΦR(s)≤α∑u∈RCu(s).\sum_{u\in R}C_u(s)\le\Phi_R(s)\le\alpha\sum_{u\in R}C_u(s).u∈R∑​Cu​(s)≤ΦR​(s)≤αu∈R∑​Cu​(s).

It converts bounds on the partial potential into bounds on costs, and back, throughout §4.

Differences from the source:

  • encoding: finite player and resource sets N, E → Fin n, Fin r with n, r ≥ 1 (HarksKlimm.Consistency.Game); reason: excludes only games without players or resources, where every cost is 0 and the statement is empty
Preamble
import Mathlib
import Definitions.Def_HarksKlimm_Consistency_privateCost
import Definitions.Def_CongestionApproxPNE_IsPolyGame
import Definitions.Def_WeightedCongestionBR_groupCost
import Definitions.Def_WeightedCongestionBR_partialPot
import Definitions.Def_WeightedCongestionBR_alphaC
set_option autoImplicit false
open scoped NNReal
open HarksKlimm.Consistency
Formal statement
namespace WeightedCongestionBR

/-- **Lemma 5** (Giannakopoulos, Noarov, Schulz, *Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses*, arXiv:1810.12806v6, p.12). For any group of players `R ⊆ N`,
`∑_{u ∈ R} C_u(s) ≤ Φ_R(s) ≤ α ∑_{u ∈ R} C_u(s)`.

**Formalization Note** As in §4 of the paper, weights satisfy `w_u ≥ 1` (p.6); without it Lemma 4,
and this lemma, fail. -/
theorem lemma_5 {n r : ℕ} (G : Game n r) (d : ℕ) (hd : 1 ≤ d)
    (hG : CongestionApproxPNE.IsPolyGame d G) (hw : ∀ u, 1 ≤ G.demand u)
    (R : Finset (Fin n)) (s : G.Profile) :
    groupCost G R s ≤ partialPot G R s ∧ partialPot G R s ≤ alphaC d * groupCost G R s := by sorry

end WeightedCongestionBR
Source
Giannakopoulos, Noarov, Schulz, Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses, arXiv:1810.12806v6, Lemma 5, p.12
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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