Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1 — Λⁱ, Πⁱ are projections of C₀; γⁱ Ker Λⁱ ⊥₀ γⁱ Im Λⁱ; NoGⁱ = Ker Λⁱ, NSGⁱ = Im Λⁱ

Proved
DecompGames.Duplication.lemma_A_1

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

game-decompositionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1projections

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 Λi(h)(si,s−i)=∑tiμˉi(ti)h(ti,s−i)\Lambda^i(h)(s^i,s^{-i})=\sum_{t^i}\bar\mu^i(t^i)h(t^i,s^{-i})Λi(h)(si,s−i)=∑ti​μˉ​i(ti)h(ti,s−i) with μˉi=μi/μi(Si)\bar\mu^i=\mu^i/\mu^i(S^i)μˉ​i=μi/μi(Si), and Πi=IdC0−Λi\Pi^i=\mathrm{Id}_{C_0}-\Lambda^iΠi=IdC0​​−Λi (A.1), operators on C0={h:S→R}C_0=\{h:S\to\mathbb R\}C0​={h:S→R}. Let NSGi\mathsf{NSG}^iNSGi be the functions not depending on sis^isi (A.2) and NoGi\mathsf{NoG}^iNoGi the functions with ∑siμi(si)h(si,s−i)=0\sum_{s^i}\mu^i(s^i)h(s^i,s^{-i})=0∑si​μi(si)h(si,s−i)=0 for every s−is^{-i}s−i (A.3). Fix a player iii. Then:

  1. Λi\Lambda^iΛi and Πi\Pi^iΠi are projections of C0C_0C0​: linear and idempotent, Λi∘Λi=Λi\Lambda^i\circ\Lambda^i=\Lambda^iΛi∘Λi=Λi, Πi∘Πi=Πi\Pi^i\circ\Pi^i=\Pi^iΠi∘Πi=Πi.
  2. For every hKer∈Ker⁡Λih_{\mathrm{Ker}}\in\operatorname{Ker}\Lambda^ihKer​∈KerΛi and every hIm∈Im⁡Λih_{\mathrm{Im}}\in\operatorname{Im}\Lambda^ihIm​∈ImΛi,
⟨γihKer,γihIm⟩0=∑s∈Sμ(s) γi(s−i)2 hKer(s) hIm(s)=0.\big\langle\gamma^ih_{\mathrm{Ker}},\gamma^ih_{\mathrm{Im}}\big\rangle_0=\sum_{s\in S}\mu(s)\,\gamma^i(s^{-i})^2\,h_{\mathrm{Ker}}(s)\,h_{\mathrm{Im}}(s)=0.⟨γihKer​,γihIm​⟩0​=s∈S∑​μ(s)γi(s−i)2hKer​(s)hIm​(s)=0.
  1. NoGi=Ker⁡Λi\mathsf{NoG}^i=\operatorname{Ker}\Lambda^iNoGi=KerΛi and NSGi=Im⁡Λi\mathsf{NSG}^i=\operatorname{Im}\Lambda^iNSGi=ImΛi.

This identifies the normalized and nonstrategic parts of one payoff function with the kernel and image of a single orthogonal projection, the first step towards Proposition 2.10.

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: NSGⁱ: h(sⁱ, s⁻ⁱ) = ℓ(s⁻ⁱ) for some ℓ : S⁻ⁱ → ℝ (A.2) → h (Function.update s i a) = h s for all s, a (IsNSGi); reason: a function on S is of the form ℓ(s⁻ⁱ) exactly when it does not depend on sⁱ
  • encoding: Λⁱ and Πⁱ are projections onto C₀ → Λⁱ and Πⁱ are ℝ-linear (IsLinearMap) and idempotent (Λⁱ ∘ Λⁱ = Λⁱ, Πⁱ ∘ Πⁱ = Πⁱ); reason: a projection of a vector space is an idempotent linear map
Preamble
import Mathlib
import Definitions.Def_DecompGames_Duplication_Operators
Formal statement
namespace DecompGames.Duplication

open Finset

/-- Lemma A.1, p. 24: `Λⁱ` and `Πⁱ` are (linear, idempotent) projections of `C₀`; `γⁱ`-scaled
kernel and image of `Λⁱ` are `⟨·,·⟩₀`-orthogonal; `NoGⁱ = Ker Λⁱ` and `NSGⁱ = Im Λⁱ`. -/
theorem lemma_A_1 {ι : Type} [Fintype ι] [DecidableEq ι] {S : ι → Type}
    [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (μ : ∀ i, S i → ℝ) (hμ : IsMeasureVec μ)
    (γ : ι → (∀ i, S i) → ℝ) (hγ : IsCoMeasureVec γ) (i : ι) :
    ((IsLinearMap ℝ (lam μ i) ∧ IsLinearMap ℝ (proj μ i)) ∧
      (lam μ i ∘ lam μ i = lam μ i ∧ proj μ i ∘ proj μ i = proj μ i)) ∧
    (∀ hKer hIm : (∀ j, S j) → ℝ, lam μ i hKer = 0 → hIm ∈ Set.range (lam μ i) →
      ip0 μ (coScale γ i hKer) (coScale γ i hIm) = 0) ∧
    ((∀ h : (∀ j, S j) → ℝ, IsNoGi μ i h ↔ lam μ i h = 0) ∧
      (∀ h : (∀ j, S j) → ℝ, IsNSGi i h ↔ h ∈ Set.range (lam μ i))) := by sorry

end DecompGames.Duplication
Source
Abdou, Pnevmatikos, Scarsini & Venel, Decomposition of Games: Some Strategic Considerations, arXiv:1901.06048v2, p. 24, Lemma A.1 (with (A.1)–(A.3))
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