Lemma A.1 — Λⁱ, Πⁱ are projections of C₀; γⁱ Ker Λⁱ ⊥₀ γⁱ Im Λⁱ; NoGⁱ = Ker Λⁱ, NSGⁱ = Im Λⁱ
ProvedDecompGames.Duplication.lemma_A_1game-decompositionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1projections
Let be a finite set of players; player has a finite strategy set , and is the set of strategy profiles. A game is a vector of payoff functions ; is the space of games. For let be a strictly positive measure on , the product measure, , and let be a co-measure vector, a strictly positive function of .
Let with , and (A.1), operators on . Let be the functions not depending on (A.2) and the functions with for every (A.3). Fix a player . Then:
- and are projections of : linear and idempotent, , .
- For every and every ,
- and .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.