Proposition 2.10 — G = μ-NoG ⊕_{μ,γ} NSG
ProvedDecompGames.Duplication.proposition_2_10Let 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 (2.13)–(2.15). The space of games is the direct orthogonal sum of the -normalized and the nonstrategic games:
That is, every game can be written in exactly one way as with -normalized and nonstrategic, and for every -normalized and every nonstrategic .
This is the first decomposition of the paper; with uniform and it is the normalized/nonstrategic split of Candogan et al. (2011).
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: G is the direct ⟨·,·⟩{μ,γ}-orthogonal sum ⊕{μ,γ} of the classes → every game has exactly one representation as a sum of members of the classes (∃!), and members of different classes are ⟨·,·⟩_{μ,γ}-orthogonal; reason: this is the meaning of a direct orthogonal sum of subspaces; each class is a linear subspace
import Mathlib import Definitions.Def_DecompGames_Duplication_Operators
namespace DecompGames.Duplication
open Finset
/-- Proposition 2.10, p. 10, (2.16): `G = μ-NoG ⊕_{μ,γ} NSG`. Every game is uniquely the sum of a
`μ`-normalized and a nonstrategic game, and the two classes are `⟨·,·⟩_{μ,γ}`-orthogonal. -/
theorem proposition_2_10 {ι : 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, ∃! ab : Game ι S × Game ι S,
IsNormalized μ ab.1 ∧ IsNonstrategic ab.2 ∧ g = ab.1 + ab.2) ∧
∀ a b : Game ι S, IsNormalized μ a → IsNonstrategic b → ipGame μ γ a b = 0 := by sorry
end DecompGames.Duplication
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.