§6 (5) — a coalition with positive weight in lies in the support of
ProvedFuzzyGames.TUCore.balances_supportcooperative-gamesfuzzy-coalitionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a family of nonempty coalitions containing and every singleton, let and let , i.e. , vanishes off and for every . Then for every coalition ,
Only players who actually participate in the fuzzy coalition can belong to a coalition used with positive weight to decompose .
Formalization Note The paper considers a fuzzy coalition; the statement is made for every , which contains the paper's case.
Preamble
import Mathlib import Definitions.Def_FuzzyGames_TUCore_Basic
Formal statement
namespace FuzzyGames.TUCore
theorem balances_support {n : ℕ} (𝒞 : FuzzyGames.NTUCore.CoalFamily n) (τ : Fin n → ℝ)
(m : Finset (Fin n) → ℝ) (hm : m ∈ FuzzyGames.NTUCore.balances 𝒞 τ) (A : Finset (Fin n)) (hA : 0 < m A) :
A ⊆ Finset.univ.filter (fun i => 0 < τ i) := by sorry
end FuzzyGames.TUCore
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §6, (5), p. 8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.