Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.11 — g = Π(h) + Π(g − h) + Λ(g) is the (μ,γ)-decomposition, hⁱ = φ/γⁱ, φ any solution of δ*δφ = δ*D(g) (e.g. δ†D(g))

Proved
DecompGames.Duplication.lemma_A_11

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

game-decompositionorthogonal-decompositionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let NNN be a finite set of players; player iii has a finite strategy set SiS^iSi, and S=∏i∈NSiS=\prod_{i\in N}S^iS=∏i∈N​Si is the set of strategy profiles. A game is a vector g=(gi)i∈Ng=(g^i)_{i\in N}g=(gi)i∈N​ of payoff functions gi:S→Rg^i:S\to\mathbb Rgi:S→R; G\mathcal GG is the space of games. For i∈Ni\in Ni∈N let μi\mu^iμi be a strictly positive measure on SiS^iSi, μ(s)=∏iμi(si)\mu(s)=\prod_i\mu^i(s^i)μ(s)=∏i​μi(si) the product measure, μi(Si)=∑tiμi(ti)\mu^i(S^i)=\sum_{t^i}\mu^i(t^i)μi(Si)=∑ti​μi(ti), and let γ=(γi)i∈N\gamma=(\gamma^i)_{i\in N}γ=(γi)i∈N​ be a co-measure vector, γi\gamma^iγi a strictly positive function of s−is^{-i}s−i.

Let Λ,Π\Lambda,\PiΛ,Π be as in (A.5)–(A.6), δ=∑iδi\delta=\sum_i\delta^iδ=∑i​δi, δ∗=∑iδi∗\delta^*=\sum_i\delta^{i*}δ∗=∑i​δi∗ and D(g)=∑iδi(γigi)D(g)=\sum_i\delta^i(\gamma^ig^i)D(g)=∑i​δi(γigi) (A.18). Fix a game ggg.

  1. The normal equation δ∗δφ=δ∗D(g)\delta^*\delta\varphi=\delta^*D(g)δ∗δφ=δ∗D(g) has a solution φ:S→R\varphi:S\to\mathbb Rφ:S→R (for instance φ=δ†D(g)\varphi=\delta^\dagger D(g)φ=δ†D(g), with δ†\delta^\daggerδ† the Moore–Penrose pseudo-inverse of δ\deltaδ).
  2. For every solution φ\varphiφ, let h=(1γ1φ,…,1γnφ)h=\big(\tfrac1{\gamma^1}\varphi,\dots,\tfrac1{\gamma^n}\varphi\big)h=(γ11​φ,…,γn1​φ) (A.26) and
gP=Π(h),gH=Π(g−h),gNSG=Λ(g).(A.25)g_P=\Pi(h),\qquad g_H=\Pi(g-h),\qquad g_{NSG}=\Lambda(g). \qquad (A.25)gP​=Π(h),gH​=Π(g−h),gNSG​=Λ(g).(A.25)

Then g=gP+gH+gNSGg=g_P+g_H+g_{NSG}g=gP​+gH​+gNSG​ (A.27), gPg_PgP​ is γ\gammaγ-potential and μ\muμ-normalized, gHg_HgH​ is (μ,γ)(\mu,\gamma)(μ,γ)-harmonic and μ\muμ-normalized, and gNSGg_{NSG}gNSG​ is nonstrategic; so (gNSG,gP,gH)(g_{NSG},g_P,g_H)(gNSG​,gP​,gH​) is the (μ,γ)(\mu,\gamma)(μ,γ)-decomposition of ggg.

This is the existence half of Theorem 2.11, with an explicit formula for the components.

Differences from the source:

  • generalization: standing assumptions n ≥ 2 players and |Sⁱ| ≥ 2 strategies for every player (p. 7) → any finite type of players ι and any finite strategy sets S i, of any size; reason: the result holds without these assumptions (with an empty Sⁱ the space of profiles is empty and every game is 0); every instance of the source is an instance of the Lean statement
  • encoding: μⁱ a strictly positive finite measure on Sⁱ → μ i : S i → ℝ, the point masses, with 0 < μ i a for all a (IsMeasureVec); reason: a measure on a finite set is determined by its point masses; μⁱ(Sⁱ) is mass μ i = ∑ₐ μ i a
  • encoding: γⁱ a co-measure, a strictly positive measure on S⁻ⁱ (Definition 2.1) → γ i : (∀ j, S j) → ℝ positive with γ i (Function.update s i a) = γ i s (IsCoMeasureVec); reason: functions on S⁻ⁱ are exactly the functions on S that do not depend on the coordinate sⁱ
  • encoding: statements over s⁻ⁱ ∈ S⁻ⁱ and profiles (tⁱ, s⁻ⁱ) → statements over full profiles s : ∀ j, S j, with (tⁱ, s⁻ⁱ) written Function.update s i tⁱ; reason: the coordinate sⁱ of s is overwritten, so the quantifier ranges over the same subprofiles
  • encoding: g nonstrategic: for each i there is ℓⁱ : S⁻ⁱ → ℝ with gⁱ(sⁱ, s⁻ⁱ) = ℓⁱ(s⁻ⁱ) (2.4) → gⁱ(Function.update s i a) = gⁱ(s) for all i, s, a (IsNonstrategic); reason: a function on S is of the form ℓⁱ(s⁻ⁱ) exactly when it does not depend on sⁱ
  • encoding: δⁱ* the adjoint of δⁱ, characterized by (A.14); δ* = ∑ᵢ δⁱ* → deltaStar μ i, defined by the explicit formula (A.15); deltaStarAll = ∑ᵢ deltaStar μ i; reason: Proposition A.3 (a milestone of this mission) states that the formula is the adjoint on flows, and every flow appearing here (δⁱh, D(g)) is skew-symmetric
  • encoding: the components g_{(μ,γ)-NS}, g_{(μ,γ)-P}, g_{(μ,γ)-H} of the (μ,γ)-decomposition (2.18) → a triple (n, p, h) with IsDecomposition μ γ g n p h: n ∈ NSG, p ∈ μ-NoG ∩ γ-PG, h ∈ μ-NoG ∩ (μ,γ)-HG, g = n + p + h; reason: by Theorem 2.11 the triple is unique, so it is the decomposition; the order (NS, P, H) is that of (2.18)
  • generalization: φ = δ†D(g), with δ† the Moore–Penrose pseudo-inverse of δ for ⟨·,·⟩₀ and ⟨·,·⟩₁ (A.26) → existence of a solution φ of δδφ = δD(g), and the conclusion for every such φ; reason: δδ† is the orthogonal projection onto Im δ, so (Id − δδ†)D(g) ∈ Ker δ* and φ = δ†D(g) solves the normal equation; the Lean statement specializes to the paper's φ
Preamble
import Mathlib
import Definitions.Def_DecompGames_Duplication_Operators
Formal statement
namespace DecompGames.Duplication

open Finset

/-- Lemma A.11, p. 32, with `δ†D(g)` replaced by any solution `φ` of the normal equation
`δ*δφ = δ*D(g)` (which `φ = δ†D(g)` solves): with `h = ((1/γ¹)φ, …, (1/γⁿ)φ)` (A.26), the games
`g_NSG = Λ(g)`, `g_P = Π(h)`, `g_H = Π(g − h)` (A.25) form the `(μ, γ)`-decomposition of `g` (A.27). -/
theorem lemma_A_11 {ι : Type} [Fintype ι] [DecidableEq ι] {S : ι → Type}
    [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (μ : ∀ i, S i → ℝ) (hμ : IsMeasureVec μ)
    (γ : ι → (∀ i, S i) → ℝ) (hγ : IsCoMeasureVec γ) :
    ∀ g : Game ι S,
      (∃ φ : (∀ j, S j) → ℝ, deltaStarAll μ (deltaAll μ φ) = deltaStarAll μ (embed μ γ g)) ∧
      ∀ φ : (∀ j, S j) → ℝ, deltaStarAll μ (deltaAll μ φ) = deltaStarAll μ (embed μ γ g) →
        IsDecomposition μ γ g (lamGame μ g) (projGame μ (fun i s => φ s / γ i s))
          (projGame μ (g - fun i s => φ s / γ i s)) := by sorry

end DecompGames.Duplication
Source
Abdou, Pnevmatikos, Scarsini & Venel, Decomposition of Games: Some Strategic Considerations, arXiv:1901.06048v2, p. 32, Lemma A.11, (A.25)–(A.27); p. 30 (δ†); p. 33 (the property of δ† used)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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