Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

25.3.1 — the characteristic function of every zero-sum n-person game satisfies (25:3:a)–(25:3:c)

Proved
TheoryOfGames.CharFun.charFun_isCharFunction

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

characteristic-functiongame-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games

Let Γ\GammaΓ be a zero-sum nnn-person game in normalized form (finitely many pure strategies βk≧1\beta_k \geqq 1βk​≧1 for each player kkk, real payoffs Hk\mathcal H_kHk​ with ∑kHk≡0\sum_k \mathcal H_k \equiv 0∑k​Hk​≡0), and let v(S)v(S)v(S) be its characteristic function (25.1.3): the value Max⁡ξMin⁡ηK(ξ,η)\operatorname{Max}_\xi \operatorname{Min}_\eta K(\xi,\eta)Maxξ​Minη​K(ξ,η) of the two-person game between the coalition SSS and its complement −S-S−S, the coalition mixing jointly over its members' strategy tuples. Then vvv fulfills

v(⊖)=0,v(−S)=−v(S),v(S∪T)≧v(S)+v(T)  if S∩T=⊖,v(\ominus) = 0, \qquad v(-S) = -v(S), \qquad v(S \cup T) \geqq v(S) + v(T) \ \text{ if } S \cap T = \ominus,v(⊖)=0,v(−S)=−v(S),v(S∪T)≧v(S)+v(T)  if S∩T=⊖,

that is, (25:3:a)–(25:3:c), for all subsets S,TS, TS,T of I={1,…,n}I = \{1, \dots, n\}I={1,…,n}.

This is the "only if" half of the characterization of characteristic functions in 26.2.

Formalization Note Players are Fin n, coalitions Finset (Fin n), −S-S−S is Sᶜ.

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_CharFun_ZeroSumGame
import Definitions.Def_TheoryOfGames_CharFun_charFun
import Definitions.Def_TheoryOfGames_CharFun_IsCharFunction
Formal statement
namespace TheoryOfGames.CharFun

/-- 25.3.1: the characteristic function `v(S)` of every zero-sum `n`-person game fulfills
(25:3:a) `v(∅) = 0`, (25:3:b) `v(-S) = -v(S)` and (25:3:c) `v(S ∪ T) ≥ v(S) + v(T)` if
`S ∩ T = ∅`. -/
theorem charFun_isCharFunction {n : ℕ} (Γ : ZeroSumGame n) :
    IsCharFunction Γ.charFun := by sorry

end TheoryOfGames.CharFun
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 241, 25.3.1, (25:3:a)–(25:3:c)
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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