Proof of Theorem 8 (p. 24) — a feasible vector outside the core is dominated by a core point
ProvedCoresConvexGames.Stability.dominated_by_core_of_not_mem_coreLet be a finite set of players and a game, i.e. a set function with . For a payoff vector and a coalition write . Suppose is convex: for all . Let be the core ( and for all ), call feasible if , and say that dominates if some nonempty has and for all . Then every feasible is dominated by an element of :
This is the external stability of the core of a convex game, the substantive half of Theorem 8.
Formalization Note Players are Fin n (a relabelling of Shapley's arbitrary finite ), a game is f : Finset (Fin n) → ℝ, and the core is the published Supermodularity.Cooperative.Core Finset.univ f. The paper's proof starts from a regular configuration; the hypothesis here is convexity, which is the hypothesis of Theorem 8 whose proof this is (regularity follows by Theorem 5, and the last step of the proof uses the convexity inequality directly).
import Mathlib import Definitions.Def_Supermodularity_Cooperative_IsConvexGame import Definitions.Def_Supermodularity_Cooperative_Core import Definitions.Def_CoresConvexGames_Stability_IsFeasible import Definitions.Def_CoresConvexGames_Stability_Dominates
namespace CoresConvexGames.Stability
open Supermodularity.Cooperative
/-- Shapley (1971), p. 24, §4.3, proof of Theorem 8, first paragraph: in a convex game,
every feasible payoff vector outside the core is dominated by an element of the core. -/
theorem dominated_by_core_of_not_mem_core {n : ℕ} (f : Finset (Fin n) → ℝ)
(hf : IsConvexGame f) (b : Fin n → ℝ) (hb : IsFeasible f b)
(hbC : b ∉ Core Finset.univ f) :
∃ a ∈ Core Finset.univ f, Dominates f a b := by sorry
end CoresConvexGames.Stability
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Fix , , a game (real-valued on subsets of ) and a vector .
Hypotheses.
- holds. This is an external definition whose body is not shown.
- is feasible: .
- . This is also an external definition whose body is not shown.
There is no hypothesis , unless one is built into .
Conclusion. There exists that dominates . That is, there is a nonempty coalition such that
In particular, the conclusion implies that the core is nonempty whenever such a exists.
Degenerate cases: when there is no nonempty coalition, so the conclusion cannot hold. The statement then says the hypotheses can never all be met: it forbids a convex game on the empty player set whose single vector is feasible () but not in the core. Whether that matches the unseen definitions of and cannot be told from the code given.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.