Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7 (6) — V(A) ⊆ πV(τ^A) for every A ∈ 𝒞

Proved
FuzzyGames.NTUCore.eq_7_6

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

balanced-gamescooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let C\mathcal{C}C be a family of nonempty coalitions of N={1,…,n}N = \{1,\dots,n\}N={1,…,n} containing NNN and every singleton, and let VVV be a game without side payments on C\mathcal{C}C: for every A∈CA \in \mathcal{C}A∈C, V(A)V(A)V(A) is a nonempty, closed, convex subset of RA\mathbb{R}^ARA that is comprehensive and bounded above (§7 (1)). Its fuzzy extension is

πV(τ)=⋃m∈C(τ)∑A∈Cm(A) V(A),\pi V(\tau) = \bigcup_{m \in \mathcal{C}(\tau)} \sum_{A \in \mathcal{C}} m(A)\, V(A),πV(τ)=m∈C(τ)⋃​A∈C∑​m(A)V(A),

where C(τ)\mathcal{C}(\tau)C(τ) is the set of nonnegative weights mmm on C\mathcal{C}C with ∑A∋im(A)=τi\sum_{A \ni i} m(A) = \tau_i∑A∋i​m(A)=τi​ for every player iii (§6 (3)–(4), §7 (5)). Then

V(A)⊆πV(τA)for every A∈C.V(A)\subseteq \pi V(\tau^A)\qquad\text{for every } A\in\mathcal{C}.V(A)⊆πV(τA)for every A∈C.

It shows that πV\pi VπV extends VVV from the coalitions of C\mathcal{C}C to all fuzzy coalitions without losing any payoff.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_NTUCore_Basic

open Set Finset Pointwise
Formal statement
namespace FuzzyGames.NTUCore

/-- §7 (6), p. 9: `V(A) ⊆ πV(τ^A)` for every `A ∈ 𝒞`. -/
theorem eq_7_6 {n : ℕ} (𝒞 : CoalFamily n) {V : Finset (Fin n) → Set (Fin n → ℝ)}
    (hV : IsNTUGame 𝒞 V) :
    ∀ A ∈ 𝒞.C, V A ⊆ piV 𝒞 V (coal A) := by sorry

end FuzzyGames.NTUCore
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §7 (6), p. 9
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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