Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — p≥(2α+1)α PoAd(α+1/p)=(2α+1)α Φd,α+1/pd+1p\ge(2\alpha+1)\alpha\,\mathrm{PoA}_d(\alpha+1/p)=(2\alpha+1)\alpha\,\Phi_{d,\alpha+1/p}^{d+1}p≥(2α+1)αPoAd​(α+1/p)=(2α+1)αΦd,α+1/pd+1​

Proved
WeightedCongestionBR.lemma_7

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

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

For any positive integer ddd, with α=d+1\alpha=d+1α=d+1 from (6) and ppp from (9),

p≥(2α+1) α⋅PoAd(α+1p)=(2α+1) α Φd,α+1pd+1.p\ge(2\alpha+1)\,\alpha\cdot\mathrm{PoA}_d\Big(\alpha+\frac1p\Big)=(2\alpha+1)\,\alpha\,\Phi_{d,\alpha+\frac1p}^{d+1}.p≥(2α+1)α⋅PoAd​(α+p1​)=(2α+1)αΦd,α+p1​d+1​.

This is the property of ppp that drives the contradiction in the proof of the Key Property (Theorem 3).

Differences from the source:

  • encoding: PoA_d(α + 1/p) = Φ_{d,α+1/p}^{d+1} → IsLUB of PoASet d (α + 1/p) at Φ_{d,α+1/p}^{d+1}; reason: PoA_d is the supremum of PoASet; IsLUB at a value says the supremum is that value
  • encoding: PoA_d(ρ) = sup over games Γ of max over ρ-equilibria of C(s)/C(s*) → PoASet ranges over ratios with C(s*) > 0; reason: games with C(s*) = 0 have the undefined ratio 0/0; Theorem 2's games have C(s*) > 0, so the supremum is unchanged
  • 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 ratio is undefined
Preamble
import Mathlib
import Definitions.Def_WeightedCongestionBR_genGolden
import Definitions.Def_WeightedCongestionBR_PoASet
import Definitions.Def_WeightedCongestionBR_alphaC
import Definitions.Def_WeightedCongestionBR_pConst
set_option autoImplicit false
open scoped NNReal
Formal statement
namespace WeightedCongestionBR

/-- **Lemma 7** (Giannakopoulos, Noarov, Schulz, *Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses*, arXiv:1810.12806v6, p.13). For any positive integer `d`, the parameter `p` of (9) satisfies
`p ≥ (2α + 1) α · PoA_d(α + 1/p) = (2α + 1) α Φ_{d,α+1/p}^{d+1}`.

**Formalization Note** The equality `PoA_d(α + 1/p) = Φ_{d,α+1/p}^{d+1}` is stated as `IsLUB` of
`PoASet d (α + 1/p)` at that value; the inequality is then stated for the value. -/
theorem lemma_7 (d : ℕ) (hd : 1 ≤ d) :
    IsLUB (PoASet d (alphaC d + 1 / pConst d)) (genGolden d (alphaC d + 1 / pConst d) ^ (d + 1)) ∧
      (2 * alphaC d + 1) * alphaC d * genGolden d (alphaC d + 1 / pConst d) ^ (d + 1) ≤
        pConst d := by sorry

end WeightedCongestionBR
Source
Giannakopoulos, Noarov, Schulz, Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses, arXiv:1810.12806v6, Lemma 7, p.13
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