Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1 — c is in the core of a fuzzy game without side payments iff its maximum complaint α(c) is ≤ 0

Proved
FuzzyGames.NTUCore.proposition_3_1

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

cooperative-gamescorep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1support-function

Let VVV be a fuzzy game without side payments: for every τ∈R+n\tau \in \mathbb{R}^n_+τ∈R+n​, V(τ)V(\tau)V(τ) is a nonempty, closed, convex subset of Rτ\mathbb{R}^\tauRτ, comprehensive and bounded above, and V(tτ)=tV(τ)V(t\tau) = tV(\tau)V(tτ)=tV(τ) for t>0t > 0t>0 (§3 (3)). Write v(τ,λ)=sup⁡c∈V(τ)∑iλiciv(\tau,\lambda) = \sup_{c\in V(\tau)}\sum_i\lambda_i c_iv(τ,λ)=supc∈V(τ)​∑i​λi​ci​ for its support function and MτM^\tauMτ for the set of λ≥0\lambda \ge 0λ≥0 supported on Aτ={i:τi>0}A_\tau = \{i : \tau_i > 0\}Aτ​={i:τi​>0} with ∑iλi=1\sum_i \lambda^i = 1∑i​λi=1. Let c∈V(τN)c \in V(\tau^N)c∈V(τN) and define the maximum complaint

α(c)=sup⁡τ∈[0,1]n, τ≠0 inf⁡λ∈Mτ[v(τ,λ)−∑i∈Nλiτici].\alpha(c) = \sup_{\tau\in[0,1]^n,\ \tau\neq 0}\ \inf_{\lambda\in M^\tau}\Big[v(\tau,\lambda) - \sum_{i\in N}\lambda^i\tau_i c_i\Big].α(c)=τ∈[0,1]n, τ=0sup​ λ∈Mτinf​[v(τ,λ)−i∈N∑​λiτi​ci​].

Then ccc belongs to the core of VVV (no fuzzy coalition τ≠0\tau \neq 0τ=0 has τ⋅c∈V(τ)−R˚+τ\tau\cdot c \in V(\tau) - \mathring{\mathbb{R}}^\tau_+τ⋅c∈V(τ)−R˚+τ​) if and only if

α(c)≤0.\alpha(c) \le 0.α(c)≤0.

The proposition turns the blocking condition, one set-membership test per fuzzy coalition, into a single scalar inequality through support functions; Theorem 3.1 is derived from it.

Formalization Note. α(c)\alpha(c)α(c) is computed in EReal. The paper takes the supremum over all τ∈[0,1]n\tau\in[0,1]^nτ∈[0,1]n; at τ=0\tau = 0τ=0 the set M0M^0M0 is empty and the inner infimum is +∞+\infty+∞, so we take it over τ≠0\tau \neq 0τ=0, matching the core's quantifier.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_NTUCore_Basic

open Set Finset Pointwise
Formal statement
namespace FuzzyGames.NTUCore

/-- Proposition 3.1 (§3, p. 4): for `c ∈ V(τ^N)`, `c` is in the core iff `α(c) ≤ 0`. -/
theorem proposition_3_1 {n : ℕ} {V : (Fin n → ℝ) → Set (Fin n → ℝ)} (hV : IsNTUFuzzyGame V)
    {c : Fin n → ℝ} (hc : c ∈ V (coal Finset.univ)) :
    c ∈ fuzzyCore V ↔ maxComplaint V c ≤ 0 := by sorry

end FuzzyGames.NTUCore
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), Proposition 3.1 and (7), p. 4
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