Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1 — the sum of δ0∗X^\delta_0^*\hat Xδ0∗​X^ over a set of profiles is minus the flow leaving the set

Proved
HarmonicGames.UniformMixed.lemma_A_1

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

game-theorygraph-flowsharmonic-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(E,A)\mathcal G = (E, A)G=(E,A) be the game graph of a finite game (nodes: strategy profiles; p,qp, qp,q adjacent iff they differ in exactly one player's strategy), C1C_1C1​ the space of edge flows on it with the inner product ⟨X,Y⟩1=12∑(p,q)∈AX(p,q)Y(p,q)\langle X, Y\rangle_1 = \tfrac12 \sum_{(p,q)\in A} X(p,q)Y(p,q)⟨X,Y⟩1​=21​∑(p,q)∈A​X(p,q)Y(p,q), and δ0∗:C1→C0\delta_0^* : C_1 \to C_0δ0∗​:C1​→C0​ the adjoint of the combinatorial gradient δ0\delta_0δ0​. For every edge flow X^∈C1\hat X \in C_1X^∈C1​ and every set of strategy profiles S^⊂E\hat S \subset ES^⊂E, with complement S^c=E∖S^\hat S^c = E \setminus \hat SS^c=E∖S^,

∑p∈S^(δ0∗X^)(p)=−∑p∈S^∑q∈S^cX^(p,q).\sum_{p \in \hat S} (\delta_0^* \hat X)(p) = -\sum_{p \in \hat S} \sum_{q \in \hat S^c} \hat X(p,q).p∈S^∑​(δ0∗​X^)(p)=−p∈S^∑​q∈S^c∑​X^(p,q).

The identity expresses the total divergence over a set of nodes as the net flow across its boundary; in the paper it turns the harmonic condition δ0∗Du=0\delta_0^* D u = 0δ0∗​Du=0 into the payoff identity of Lemma 5.2.

Formalization Note δ0∗\delta_0^*δ0∗​ is Mathlib's LinearMap.adjoint for the inner products (7), including the factor 12\tfrac1221​; without it the left side would be off by a factor 222. S^\hat SS^ is a Finset of profiles.

Preamble
import Mathlib
import Definitions.Def_HarmonicGames_Decomposition_Games
import Definitions.Def_HarmonicGames_GenericPure_Games
Formal statement
namespace HarmonicGames.UniformMixed

/-- **Lemma A.1** (p. 43): for every edge flow `X̂ ∈ C1` on the game graph and every set of
strategy profiles `Ŝ ⊂ E`, `∑_{p ∈ Ŝ} (δ0* X̂)(p) = -∑_{p ∈ Ŝ} ∑_{q ∈ Ŝᶜ} X̂(p,q)`, where
`δ0*` is the adjoint of the combinatorial gradient for the inner products (7). -/
theorem lemma_A_1 {ι : Type} [Fintype ι] [DecidableEq ι] (E : ι → Type) [∀ m, Fintype (E m)]
    [∀ m, DecidableEq (E m)]
    (X : HarmonicGames.Decomposition.Flow E) (S : Finset (∀ k, E k)) :
    ∑ p ∈ S, (LinearMap.adjoint (HarmonicGames.Decomposition.delta0 (HarmonicGames.Decomposition.gameGraph E)) X) p = -∑ p ∈ S, ∑ q ∈ Sᶜ, X p q := by sorry

end HarmonicGames.UniformMixed
Source
Candogan, Menache, Ozdaglar, Parrilo, Flows and Decompositions of Games: Harmonic and Potential Games, arXiv:1005.2405v2, p. 43, Appendix A, Lemma A.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