Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, proof of Theorem 3.1(b) — superadditivity makes τ ↦ v(τ, λ) concave on ℝ^n_+

Proved
FuzzyGames.NTUCore.support_concave

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

convex-analysiscooperative-gamesp2o-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)). Assume VVV is superadditive: V(τ)+V(σ)⊆V(τ+σ)V(\tau)+V(\sigma)\subseteq V(\tau+\sigma)V(τ)+V(σ)⊆V(τ+σ) for all τ,σ∈R+n\tau,\sigma\in\mathbb{R}^n_+τ,σ∈R+n​. Fix λ∈R+n\lambda \in \mathbb{R}^n_+λ∈R+n​. Then the support function v(τ,λ)=sup⁡c∈V(τ)∑iλiciv(\tau,\lambda) = \sup_{c\in V(\tau)} \sum_i \lambda_i c_iv(τ,λ)=supc∈V(τ)​∑i​λi​ci​ is finite for every τ∈R+n\tau \in \mathbb{R}^n_+τ∈R+n​, and

τ⟼v(τ,λ)is concave on R+n.\tau \longmapsto v(\tau,\lambda)\quad\text{is concave on } \mathbb{R}^n_+.τ⟼v(τ,λ)is concave on R+n​.

Concavity in τ\tauτ is the hypothesis of the minisup theorem in the proof of Theorem 3.1(b).

Formalization Note. The support function is EReal-valued; the statement first asserts that it is finite on the orthant (the paper notes on p. 4 that v(τ,λ)v(\tau,\lambda)v(τ,λ) is finite iff λ∈R+τ\lambda \in \mathbb{R}^\tau_+λ∈R+τ​), and then that its real value is concave on R+n\mathbb{R}^n_+R+n​.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_NTUCore_Basic

open Set Finset Pointwise
Formal statement
namespace FuzzyGames.NTUCore

/-- §3, proof of Theorem 3.1(b) (p. 5): under superadditivity (9), for every `λ ∈ ℝ^n_+` the
support function `τ ↦ v(τ, λ)` is finite and concave on `ℝ^n_+`. -/
theorem support_concave {n : ℕ} {V : (Fin n → ℝ) → Set (Fin n → ℝ)} (hV : IsNTUFuzzyGame V)
    (hsup : Superadditive V) {l : Fin n → ℝ} (hl : ∀ i, 0 ≤ l i) :
    (∀ τ ∈ orthant n, ∃ r : ℝ, supportFn (V τ) l = (r : EReal)) ∧
      ConcaveOn ℝ (orthant n) (fun τ => (supportFn (V τ) l).toReal) := by sorry

end FuzzyGames.NTUCore
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §3, proof of Theorem 3.1(b), p. 5
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