Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1 — Δ0,m=hmΠm\Delta_{0,m} = h_m\Pi_mΔ0,m​=hm​Πm​

Proved
HarmonicGames.Decomposition.lemma_4_1

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

game-theoryharmonic-gameslinear-algebrap2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games

For a finite game with players M\mathcal MM and nonempty finite strategy sets EmE^mEm, let Dm:C0→C1D_m : C_0 \to C_1Dm​:C0​→C1​ be the gradient along mmm-comparable pairs of profiles, Δ0,m=Dm∗Dm\Delta_{0,m} = D_m^* D_mΔ0,m​=Dm∗​Dm​ the Laplacian of the graph of mmm-comparable profiles, and Πm=Dm†Dm\Pi_m = D_m^\dagger D_mΠm​=Dm†​Dm​ (adjoint and Moore–Penrose pseudoinverse for the inner products (7)).

Lemma 4.1. With hm=∣Em∣h_m = |E^m|hm​=∣Em∣ the number of strategies of player mmm,

Δ0,m=hm Πm.\Delta_{0,m} = h_m\,\Pi_m .Δ0,m​=hm​Πm​.

The Laplacian of each player's comparison graph is thus a multiple of the orthogonal projection onto (ker⁡Dm)⊥(\ker D_m)^\perp(kerDm​)⊥; this is what makes the pseudoinverses in the decomposition explicit.

Formalization Note hmh_mhm​ is Fintype.card (E m); adjoints and pseudoinverses are for the 12\tfrac1221​-weighted inner product on edge flows and the standard one on C0C_0C0​.

Preamble
import Mathlib
import Definitions.Def_HarmonicGames_Decomposition_Pinv
import Definitions.Def_HarmonicGames_Decomposition_Flows
import Definitions.Def_HarmonicGames_Decomposition_Games
Formal statement
namespace HarmonicGames.Decomposition

theorem lemma_4_1 (ι : Type) [Fintype ι] [DecidableEq ι] (E : ι → Type) [∀ m, Fintype (E m)]
    [∀ m, DecidableEq (E m)] [∀ m, Nonempty (E m)] (m : ι) :
    Delta0m E m = (Fintype.card (E m) : ℝ) • Pim E m := by sorry

end HarmonicGames.Decomposition
Source
Candogan, Menache, Ozdaglar, Parrilo, Flows and Decompositions of Games: Harmonic and Potential Games, arXiv:1005.2405v2, p. 15, Lemma 4.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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