Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 (4) — the core of a fuzzy game with side payments is the superdifferential ∂v(τN)\partial v(\tau^N)∂v(τN)

Proved
FuzzyGames.TUCore.core_eq_superdiff

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

convex-analysiscooperative-gamescorefuzzy-coalitionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let vvv be a fuzzy game with side payments: v(0)=0v(0)=0v(0)=0 and v(tτ)=t v(τ)v(t\tau)=t\,v(\tau)v(tτ)=tv(τ) for all t>0t>0t>0 and τ∈R+n\tau\in\mathbb R^n_+τ∈R+n​. For c∈Rnc\in\mathbb R^nc∈Rn the following are equivalent:

  1. ∑i∈Nci=v(τN)\sum_{i\in N}c_i=v(\tau^N)∑i∈N​ci​=v(τN) and ∑i∈Nτici≥v(τ)\sum_{i\in N}\tau_ic_i\ge v(\tau)∑i∈N​τi​ci​≥v(τ) for every fuzzy coalition τ∈[0,1]n\tau\in[0,1]^nτ∈[0,1]n;
  2. c∈∂v(τN)c\in\partial v(\tau^N)c∈∂v(τN), i.e. v(τN)−v(σ)≥∑i∈Nci(1−σi)v(\tau^N)-v(\sigma)\ge\sum_{i\in N}c_i(1-\sigma_i)v(τN)−v(σ)≥∑i∈N​ci​(1−σi​) for every σ∈R+n\sigma\in\mathbb R^n_+σ∈R+n​.

In other words,

core⁡(v)=∂v(τN).\operatorname{core}(v)=\partial v(\tau^N).core(v)=∂v(τN).

This identification of the fuzzy core with a superdifferential is what lets convex analysis describe the core.

Formalization Note Positive homogeneity and v(0)=0v(0)=0v(0)=0 are the standing assumptions of §2 ("We assume in this section that"), so they are hypotheses here. The superdifferential is taken with σ\sigmaσ ranging over R+n\mathbb R^n_+R+n​, the domain of the extended vvv; the paper leaves that range implicit.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_TUCore_Basic
Formal statement
namespace FuzzyGames.TUCore

theorem core_eq_superdiff {n : ℕ} (v : (Fin n → ℝ) → ℝ) (hv : IsFuzzyTUGame v) :
    fuzzyCore v = superdiff v (FuzzyGames.NTUCore.coal Finset.univ) := by sorry

end FuzzyGames.TUCore
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §2, (4)–(5), p. 3
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