Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.15 — duplicating a strategy commutes with the (μ,γ)-decomposition: the (μ̌,γ̌)-decomposition of ǧ is the extension of the (μ,γ)-decomposition of g

Proved
DecompGames.Duplication.theorem_3_15

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

duplicate-strategiesgame-decompositionharmonic-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1potential-games

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 π=(πj:S′j→Sj)j∈N\pi=(\pi^j:S'^j\to S^j)_{j\in N}π=(πj:S′j→Sj)j∈N​ be a collapsing map, Tˇ\check TTˇ the extending map Tˇ(f)j(s′)=fj(π(s′))\check T(f)^j(s')=f^j(\pi(s'))Tˇ(f)j(s′)=fj(π(s′)), gˇ=Tˇ(g)\check g=\check T(g)gˇ​=Tˇ(g), γˇ=Tˇ(γ)\check\gamma=\check T(\gamma)γˇ​=Tˇ(γ) the extended nonstrategic game of γ\gammaγ, and μˇ\check\muμˇ​ a strictly positive extension of μ\muμ, ∑b:πj(b)=aμˇj(b)=μj(a)\sum_{b:\pi^j(b)=a}\check\mu^j(b)=\mu^j(a)∑b:πj(b)=a​μˇ​j(b)=μj(a). Duplicating the strategy s1is^i_1s1i​ of player iii into s0i,s1is^i_0,s^i_1s0i​,s1i​ (Definition 3.13) is the case S′i=Si∪{s0i}S'^i=S^i\cup\{s^i_0\}S′i=Si∪{s0i​}, πi(s0i)=s1i\pi^i(s^i_0)=s^i_1πi(s0i​)=s1i​, all other π\piπ's the identity.

Let ggg be a game with (μ,γ)(\mu,\gamma)(μ,γ)-decomposition (g(μ,γ)-NS,g(μ,γ)-P,g(μ,γ)-H)(g_{(\mu,\gamma)\text{-NS}},g_{(\mu,\gamma)\text{-P}},g_{(\mu,\gamma)\text{-H}})(g(μ,γ)-NS​,g(μ,γ)-P​,g(μ,γ)-H​) (Theorem 2.11). Then the (μˇ,γˇ)(\check\mu,\check\gamma)(μˇ​,γˇ​)-decomposition of gˇ\check ggˇ​ is the extension of that of ggg:

Tˇ(g(μ,γ)-NS)=(gˇ)(μˇ,γˇ)-NS,Tˇ(g(μ,γ)-P)=(gˇ)(μˇ,γˇ)-P,Tˇ(g(μ,γ)-H)=(gˇ)(μˇ,γˇ)-H.\check T\big(g_{(\mu,\gamma)\text{-NS}}\big)=(\check g)_{(\check\mu,\check\gamma)\text{-NS}},\qquad \check T\big(g_{(\mu,\gamma)\text{-P}}\big)=(\check g)_{(\check\mu,\check\gamma)\text{-P}},\qquad \check T\big(g_{(\mu,\gamma)\text{-H}}\big)=(\check g)_{(\check\mu,\check\gamma)\text{-H}}.Tˇ(g(μ,γ)-NS​)=(gˇ​)(μˇ​,γˇ​)-NS​,Tˇ(g(μ,γ)-P​)=(gˇ​)(μˇ​,γˇ​)-P​,Tˇ(g(μ,γ)-H​)=(gˇ​)(μˇ​,γˇ​)-H​.

Equivalently: a triple (n′,p′,h′)(n',p',h')(n′,p′,h′) of games on S′S'S′ is a (μˇ,γˇ)(\check\mu,\check\gamma)(μˇ​,γˇ​)-decomposition of gˇ\check ggˇ​ if and only if n′=Tˇ(g(μ,γ)-NS)n'=\check T(g_{(\mu,\gamma)\text{-NS}})n′=Tˇ(g(μ,γ)-NS​), p′=Tˇ(g(μ,γ)-P)p'=\check T(g_{(\mu,\gamma)\text{-P}})p′=Tˇ(g(μ,γ)-P​) and h′=Tˇ(g(μ,γ)-H)h'=\check T(g_{(\mu,\gamma)\text{-H}})h′=Tˇ(g(μ,γ)-H​). Extensions and decompositions commute.

The decomposition is therefore insensitive to duplicated strategies, provided the measure is split among the copies and the co-measure is copied: strategically equivalent descriptions of a game have the same potential, harmonic and nonstrategic parts.

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 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: a single duplication: Šⁱ = Sⁱ ∪ {s⁰ⁱ}, ǧ(s⁰ⁱ, s⁻ⁱ) = g(s¹ⁱ, s⁻ⁱ), μ̌ⁱ(s⁰ⁱ) + μ̌ⁱ(s¹ⁱ) = μⁱ(s¹ⁱ), μ̌ = μ elsewhere (Definition 3.13) → any family of collapsing maps πʲ : S'ʲ → Sʲ, with ǧʲ(s') = gʲ(π(s')) (extend π g) and μ' strictly positive with ∑_{b ∈ (πʲ)⁻¹(a)} μ'ʲ(b) = μʲ(a) (IsMeasureExtension); reason: Definition 3.13 is the case S'ⁱ = Sⁱ ∪ {s⁰ⁱ}, πⁱ(s⁰ⁱ) = s¹ⁱ, πⁱ = id on Sⁱ, πʲ = id for j ≠ i, where the fibre condition is exactly (i)–(ii) of the extension of μ; the Lean statement also covers several duplications at once
  • encoding: μ̌ an extension of μ (a measure, strictly positive as every measure of Definition 2.2) → μ' with the hypothesis IsMeasureVec μ' (0 < μ' i b); reason: the classes of Definition 2.2 are defined for strictly positive measures
  • reading: γ̌ the extended nonstrategic game of γ → γ̌ = Ť(γ) = extend π γ, γ̌ʲ(s') = γʲ(π(s')); reason: γ regarded as a nonstrategic game and extended by Ť, as on p. 19 ("the nonstrategic game γ is changed into γ̌ by also duplicating the strategy s¹ⁱ") and in the proof on p. 40; the sum-type extension of γ printed in Definition 3.13 makes the theorem false (counterexample in the Extension definition and in Lemma 3.14)
Preamble
import Mathlib
import Definitions.Def_DecompGames_Duplication_Extension
Formal statement
namespace DecompGames.Duplication

open Finset

/-- Theorem 3.15, p. 19, for an extension along any collapsing map `π` (a single duplication is the
case of Definition 3.13): if `(n, p, h) = (g_{(μ,γ)-NS}, g_{(μ,γ)-P}, g_{(μ,γ)-H})` is the
`(μ, γ)`-decomposition of `g`, `μ̌` is an extension of `μ` and `γ̌ = Ť(γ)` is the extended
nonstrategic game of `γ`, then the `(μ̌, γ̌)`-decomposition of `ǧ = Ť(g)` is exactly
`(ň, p̌, ȟ)`: extensions and decompositions commute. -/
theorem theorem_3_15 {ι : Type} [Fintype ι] [DecidableEq ι] {S S' : ι → Type}
    [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    [∀ i, Fintype (S' i)] [∀ i, DecidableEq (S' i)]
    (μ : ∀ i, S i → ℝ) (hμ : IsMeasureVec μ)
    (γ : ι → (∀ i, S i) → ℝ) (hγ : IsCoMeasureVec γ)
    (π : ∀ i, S' i → S i) (μ' : ∀ i, S' i → ℝ) (hμ' : IsMeasureVec μ')
    (hext : IsMeasureExtension π μ μ')
    (g n p h : Game ι S) (hdec : IsDecomposition μ γ g n p h)
    (n' p' h' : Game ι S') :
    IsDecomposition μ' (extend π γ) (extend π g) n' p' h' ↔
      n' = extend π n ∧ p' = extend π p ∧ h' = extend π h := by sorry

end DecompGames.Duplication
Source
Abdou, Pnevmatikos, Scarsini & Venel, Decomposition of Games: Some Strategic Considerations, arXiv:1901.06048v2, p. 19, Theorem 3.15 (with Definition 3.13, p. 18; proof pp. 39–40)
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