Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1 — if x̄ is in the fuzzy core then 0 ∉ co(⋃ᵢ Q(i))

Proved
FuzzyGames.Walras.zero_not_mem_convexHull_Q

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

convex-analysiscooperative-gamesgeneral-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let an exchange economy satisfy the assumptions of §4 and let xˉ\bar xxˉ belong to its fuzzy core. With Q(i)=Y(i)−{xi∈R+l:xi≻ixˉi}Q(i) = Y(i) - \{x^i \in \mathbb{R}^l_+ : x^i \succ_i \bar x^i\}Q(i)=Y(i)−{xi∈R+l​:xi≻i​xˉi} for i=1,…,ni = 1,\dots,ni=1,…,n,

0∉co⁡(⋃i=1nQ(i)),0 \notin \operatorname{co}\Big(\bigcup_{i=1}^n Q(i)\Big),0∈/co(i=1⋃n​Q(i)),

where co⁡\operatorname{co}co denotes the convex hull in Rl\mathbb{R}^lRl.

This is the step of the proof of Theorem 4.1 that converts membership in the fuzzy core into a convex-geometric statement: a convex combination of elements of the Q(i)Q(i)Q(i) equal to 000 would describe a fuzzy coalition, with the weights as rates of participation, that improves upon xˉ\bar xxˉ. The separation theorem is then applied to this convex set to produce the equilibrium price.

Formalization Note. The convex hull is Mathlib's convexHull ℝ.

Preamble
import Mathlib
import Definitions.Def_FuzzyGames_Walras_Basic
Formal statement
namespace FuzzyGames.Walras

/-- Proof of Theorem 4.1 (Aubin 1981, p. 6): if `x̄` belongs to the fuzzy core, then
`0 ∉ co(⋃ᵢ Q(i))`. -/
theorem zero_not_mem_convexHull_Q {n l : ℕ} (E : Economy n l) (hE : E.Assumptions)
    (xbar : Fin n → Fin l → ℝ) (hx : xbar ∈ E.fuzzyCore) :
    (0 : Fin l → ℝ) ∉ convexHull ℝ (⋃ i, E.Q xbar i) := by sorry

end FuzzyGames.Walras
Source
Aubin, Cooperative Fuzzy Games, Math. Oper. Res. 6(1) (1981), proof of Theorem 4.1, p. 6
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