Theorem 8.1, proof — the diagonal maps (4) are Pareto optimal, symmetric and atomic
ProvedFuzzyGames.Values.diag_axiomsaumann-shapleycooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1value
The maps given by the diagonal formula
satisfy
- Pareto optimality: for all , ;
- the symmetry axiom: for every permutation of , where and ;
- the atomicity axiom: for every partition of into nonempty types and , , where .
Together with the linearity and continuity of the previous milestone, this says that the diagonal formula is a sequence of fuzzy values.
Formalization Note The paper derives symmetry and atomicity from (5) with and ; Pareto optimality is the implicit part of "it is clear". The games and are passed as elements of , with their defining identities; a partition into nonempty types is a surjection Fin n → Fin m.
Preamble
import Mathlib import Definitions.Def_FuzzyGames_Values_Basic
Formal statement
namespace FuzzyGames.Values
/-- §8, proof of Theorem 8.1 (p. 10): the maps `ψ_n v = ∫_0^1 Dv(tτ^N) dt` of (4) satisfy
the Pareto optimality, symmetry and atomicity axioms. -/
theorem diag_axioms :
IsParetoOptimal (fun n (v : Vn n) => diagValue v.1) ∧
IsSymmetric (fun n (v : Vn n) => diagValue v.1) ∧
IsAtomic (fun n (v : Vn n) => diagValue v.1) := by sorry
end FuzzyGames.Values
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §8, proof of Theorem 8.1, p. 10 ("The symmetry and atomicity axioms follow by taking A = θ* and A = P*")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.