Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(B.6) — x1(Amii∩A(−i)c)=x1(ε(mi))=ui(a)−P(a)x^1(A^i_{m_i}\cap A(-i)^c) = x^1(\varepsilon(m^i)) = u^i(a) - P(a)x1(Ami​i​∩A(−i)c)=x1(ε(mi))=ui(a)−P(a)

Proved
MondererShapley.Congestion.eq_B_6

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

congestion-gamesgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games

Let Γ\GammaΓ be a finite game with players N={1,…,n}N = \{1,\dots,n\}N={1,…,n}, finite strategy sets YiY^iYi, payoffs uiu^iui, and let PPP be a potential for Γ\GammaΓ. On the facility set MMM of the proof of Theorem 3.2, let AliA^i_lAli​, ε(mi)\varepsilon(m^i)ε(mi), M2M_2M2​ (B.5) and the vector x1x^1x1 be as defined on pp. 140–141, with QiQ^iQi of (B.4). Then for every m=(m1,…,mn)∈Km = (m_1, \dots, m_n) \in Km=(m1​,…,mn​)∈K, with A=(Am11,…,Amnn)∈ΣA = (A^1_{m_1}, \dots, A^n_{m_n}) \in \SigmaA=(Am1​1​,…,Amn​n​)∈Σ, a=(am11,…,amnn)a = (a^1_{m_1}, \dots, a^n_{m_n})a=(am1​1​,…,amn​n​) and mi=(mk)k≠im^i = (m_k)_{k\neq i}mi=(mk​)k=i​,

x1(Amii∩A(−i)c)=x1(ε(mi))=ui(a)−P(a)for every i∈N,(B.6)x^1\big(A^i_{m_i}\cap A(-i)^c\big) = x^1\big(\varepsilon(m^i)\big) = u^i(a) - P(a) \qquad \text{for every } i \in N, \tag{B.6}x1(Ami​i​∩A(−i)c)=x1(ε(mi))=ui(a)−P(a)for every i∈N,(B.6)

where A(−i)=⋃k≠iAmkkA(-i) = \bigcup_{k\neq i} A^k_{m_k}A(−i)=⋃k=i​Amk​k​ and x(B)=∑j∈Bx(j)x(B) = \sum_{j\in B} x(j)x(B)=∑j∈B​x(j).

Together with (B.2) and Lemma B.1, (B.6) shows that the congestion game built in the proof reproduces the payoffs of Γ\GammaΓ.

Formalization Note. Two misprints of the page are corrected: the printed x1(Amii∩A(−i))x^1(A^i_{m_i}\cap A(-i))x1(Ami​i​∩A(−i)) is x1(Amii∩A(−i)c)x^1(A^i_{m_i}\cap A(-i)^c)x1(Ami​i​∩A(−i)c), the set of the x1x^1x1 term of Lemma B.1 (the facility ε(mi)\varepsilon(m^i)ε(mi) lies in AmiiA^i_{m_i}Ami​i​ and in no AmkkA^k_{m_k}Amk​k​, k≠ik\neq ik=i), and the printed Pi(a)P^i(a)Pi(a) is P(a)P(a)P(a). K(i)K(i)K(i) is identified with YiY^iYi.

Preamble
import Mathlib
import Definitions.Def_MondererShapley_ClosedPath_IsPotential
import Definitions.Def_MondererShapley_Congestion_FacilityConstruction
Formal statement
namespace MondererShapley.Congestion

/-- Monderer and Shapley (1996), p. 141, (B.6): let `P` be a potential for the finite game `Γ`. For every
`m = (m₁, …, mₙ) ∈ K`, with `A = (A¹_{m₁}, …, Aⁿ_{mₙ})` and `a = (a¹_{m₁}, …, aⁿ_{mₙ})`,
`x¹(Aⁱ_{m_i} ∩ A(−i)^c) = x¹(ε(mⁱ)) = uⁱ(a) − P(a)` for every player `i`, where `mⁱ = (m_k)_{k≠i}` and
`A(−i) = ∪_{k≠i} Aᵏ_{m_k}`.

**Formalization Note.** Two misprints are corrected: the printed `A(−i)` is `A(−i)^c` (the set of
Lemma B.1's `x¹` term; `ε(mⁱ)` lies in `Aⁱ_{m_i}` and in no `Aᵏ_{m_k}`, `k ≠ i`), and the printed
`Pⁱ(a)` is `P(a)`. `K(i)` is identified with `Yⁱ`. -/
theorem eq_B_6 {ι : Type*} [Fintype ι] [DecidableEq ι] {Y : ι → Type*} [∀ i, Fintype (Y i)]
    [∀ i, DecidableEq (Y i)] (u : ι → (∀ i, Y i) → ℝ) (P : (∀ i, Y i) → ℝ)
    (hP : MondererShapley.ClosedPath.IsPotential u P) (m : ∀ i, Y i) (i : ι) :
    vecSum (x1 u P) (stratFac i (m i) ∩ (⋃ k ∈ {k | k ≠ i}, stratFac k (m k))ᶜ) =
        x1 u P (epsMinus i m) ∧
      x1 u P (epsMinus i m) = u i m - P m := by sorry

end MondererShapley.Congestion
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 141 (PDF p. 18), (B.6)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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