Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.14 (corrected: the extended co-measure copies γ) — extensions preserve γ-potential, nonstrategic, μ-normalized and (μ,γ)-harmonic games

Proved
DecompGames.Duplication.lemma_3_14

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

duplicate-strategiesgame-decompositionp2o-batch-pfp2ap2o-correctedp2o-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 π=(π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, gˇj(s′)=gj(π(s′))\check g^j(s')=g^j(\pi(s'))gˇ​j(s′)=gj(π(s′)) the extended game and γˇj(s′)=γj(π(s′))\check\gamma^j(s')=\gamma^j(\pi(s'))γˇ​j(s′)=γj(π(s′)) the extended co-measure vector (the extending map Tˇ\check TTˇ applied to γ\gammaγ), and let μˇ\check\muμˇ​ be 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) for all jjj and a∈Sja\in S^ja∈Sj. 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. For every game ggg:

  1. (i) if ggg is γ\gammaγ-potential, then gˇ\check ggˇ​ is γˇ\check\gammaγˇ​-potential;
  2. (ii) if ggg is nonstrategic, then gˇ\check ggˇ​ is nonstrategic;
  3. (iii) if ggg is μ\muμ-normalized, then gˇ\check ggˇ​ is μˇ\check\muμˇ​-normalized;
  4. (iv) if ggg is (μ,γ)(\mu,\gamma)(μ,γ)-harmonic, then gˇ\check ggˇ​ is (μˇ,γˇ)(\check\mu,\check\gamma)(μˇ​,γˇ​)-harmonic.

Each class of the decomposition is mapped into the corresponding class of the extended game; with uniqueness of the decomposition this gives Theorem 3.15.

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ⁱ
  • 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
  • correction: γ̌ an extension of γ: γ̌ⁱ(s⁻ⁱ) = γ⁻ⁱ(s⁻ⁱ) and, for j ≠ i, γ̌ʲ(s⁰ⁱ, s^{−(i,j)}) + γ̌ʲ(s¹ⁱ, s^{−(i,j)}) = γʲ(s¹ⁱ, s^{−(i,j)}) (Definition 3.13) → γ̌ = Ť(γ), γ̌ʲ(s') = γʲ(π(s')): γ̌ⁱ = γⁱ and γ̌ʲ(s⁰ⁱ, ·) = γ̌ʲ(s¹ⁱ, ·) = γʲ(s¹ⁱ, ·); reason: with the printed sum (i) is false: two players, Sʲ = {sʲ, tʲ}, μ ≡ 1, γ ≡ 1, g¹ = g² = Ψ with Ψ(s¹,s²) = Ψ(t¹,t²) = 1, Ψ(s¹,t²) = Ψ(t¹,s²) = −1 (γ-potential); duplicate s¹ with μ̌¹ = (½, ½, 1) and γ̌²(s¹₀,·) = γ̌²(s¹₁,·) = ½; a γ̌-potential Ψ̌ of ǧ would need Ψ̌(t¹,t²) − Ψ̌(t¹,s²) = 3 ≠ 2 = g²(t¹,t²) − g²(t¹,s²). The proof on p. 40 uses the copy, which also makes γ̌ unique ("the extension of γ"); γ⁻ⁱ in (i) is read as γⁱ
Preamble
import Mathlib
import Definitions.Def_DecompGames_Duplication_Extension
Formal statement
namespace DecompGames.Duplication

open Finset

/-- Lemma 3.14, p. 18, for an extension along any collapsing map `π` (a single duplication is the
case of Definition 3.13), with the extended co-measure `γ̌ = Ť(γ)` (`γ̌ʲ(s') = γʲ(π(s'))`):
(i) `γ`-potential ⇒ `ǧ` is `γ̌`-potential; (ii) nonstrategic ⇒ `ǧ` nonstrategic;
(iii) `μ`-normalized ⇒ `ǧ` is `μ̌`-normalized; (iv) `(μ, γ)`-harmonic ⇒ `ǧ` is `(μ̌, γ̌)`-harmonic. -/
theorem lemma_3_14 {ι : 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 : Game ι S) :
    (IsPotential γ g → IsPotential (extend π γ) (extend π g)) ∧
    (IsNonstrategic g → IsNonstrategic (extend π g)) ∧
    (IsNormalized μ g → IsNormalized μ' (extend π g)) ∧
    (IsHarmonic μ γ g → IsHarmonic μ' (extend π γ) (extend π g)) := by sorry

end DecompGames.Duplication
Source
Abdou, Pnevmatikos, Scarsini & Venel, Decomposition of Games: Some Strategic Considerations, arXiv:1901.06048v2, p. 18, Lemma 3.14 and Definition 3.13; p. 40, proof of Lemma 3.14(iv)
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