Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.1, proof — the diagonal maps (4) are Pareto optimal, symmetric and atomic

Proved
FuzzyGames.Values.diag_axioms

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

aumann-shapleycooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1value

The maps ψn:Vn→Rn\psi_n:V^n\to\mathbb R^nψn​:Vn→Rn given by the diagonal formula

(ψnv)i=∫01∂v∂τi(tτN) dt(\psi_n v)_i=\int_0^1\frac{\partial v}{\partial\tau_i}(t\tau^N)\,dt(ψn​v)i​=∫01​∂τi​∂v​(tτN)dt

satisfy

  1. Pareto optimality: ∑i∈N(ψnv)i=v(τN)\sum_{i\in N}(\psi_n v)_i=v(\tau^N)∑i∈N​(ψn​v)i​=v(τN) for all n≥1n\ge1n≥1, v∈Vnv\in V^nv∈Vn;
  2. the symmetry axiom: ψn(θ∗v)=θ∗(ψnv)\psi_n(\theta^*v)=\theta^*(\psi_n v)ψn​(θ∗v)=θ∗(ψn​v) for every permutation θ\thetaθ of NNN, where (θ∗v)(τ)=v(τθ−1(1),…,τθ−1(n))(\theta^*v)(\tau)=v(\tau_{\theta^{-1}(1)},\dots,\tau_{\theta^{-1}(n)})(θ∗v)(τ)=v(τθ−1(1)​,…,τθ−1(n)​) and (θ∗c)i=cθ(i)(\theta^*c)_i=c_{\theta(i)}(θ∗c)i​=cθ(i)​;
  3. the atomicity axiom: for every partition PPP of NNN into mmm nonempty types A1,…,AmA_1,\dots,A_mA1​,…,Am​ and v∈Vnv\in V^nv∈Vn, ψm(P∗v)j=∑i∈Aj(ψnv)i\psi_m(P^*v)_j=\sum_{i\in A_j}(\psi_n v)_iψm​(P∗v)j​=∑i∈Aj​​(ψn​v)i​, where (P∗v)(σ)=v(P⋅σ)(P^*v)(\sigma)=v(P\cdot\sigma)(P∗v)(σ)=v(P⋅σ).

Together with the linearity and continuity of the previous milestone, this says that the diagonal formula is a sequence of fuzzy values.

Formalization Note The paper derives symmetry and atomicity from (5) with A=θ∗A=\theta^*A=θ∗ and A=P∗A=P^*A=P∗; Pareto optimality is the implicit part of "it is clear". The games θ∗v\theta^*vθ∗v and P∗vP^*vP∗v are passed as elements of VnV^nVn, VmV^mVm with their defining identities; a partition into nonempty types is a surjection Fin n → Fin m.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_Values_Basic
Formal statement
namespace FuzzyGames.Values

/-- §8, proof of Theorem 8.1 (p. 10): the maps `ψ_n v = ∫_0^1 Dv(tτ^N) dt` of (4) satisfy
the Pareto optimality, symmetry and atomicity axioms. -/
theorem diag_axioms :
    IsParetoOptimal (fun n (v : Vn n) => diagValue v.1) ∧
      IsSymmetric (fun n (v : Vn n) => diagValue v.1) ∧
      IsAtomic (fun n (v : Vn n) => diagValue v.1) := by sorry

end FuzzyGames.Values
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), §8, proof of Theorem 8.1, p. 10 ("The symmetry and atomicity axioms follow by taking A = θ* and A = P*")
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