Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(32:A) — for −1 ≦ c < ½ the imputations with αᵢ = c form a solution

Proved
TheoryOfGames.ThreePerson.lineSet_isSolution

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

cooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets

In the reduced essential zero-sum three-person game (32:1), let ccc be a number with

(32:8)−1≦c<12,\text{(32:8)}\quad -1 \leqq c < \tfrac12 ,(32:8)−1≦c<21​,

and let i∈{1,2,3}i \in \{1, 2, 3\}i∈{1,2,3}. Then the set of all imputations α⃗\vec\alphaα with αi=c\alpha_i = cαi​=c — the set (32:7), (32:7*) or (32:7**) for i=1,2,3i = 1, 2, 3i=1,2,3 — is a solution in the sense of (30:5:a), (30:5:b).

These are the book's "discriminatory" solutions: player iii is assigned the fixed amount ccc and the other two divide −c-c−c in every possible way. The bound c<12c < \tfrac12c<21​ is strict.

Formalization Note Players 1,2,31, 2, 31,2,3 are indices 0, 1, 2.

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_ThreePerson_Solution
import Definitions.Def_TheoryOfGames_ThreePerson_ReducedThreePerson
Formal statement
namespace TheoryOfGames.ThreePerson

/-- (32:A) with (32:7), (32:7*), (32:7**), (32:8), 32.2.2: for every `c` with `-1 ≦ c < ½` and
every player `i`, the set of all imputations with `αᵢ = c` is a solution of the reduced
essential zero-sum three-person game (32:1). -/
theorem lineSet_isSolution (i : Fin 3) (c : ℝ) (hc1 : -1 ≤ c) (hc2 : c < 1 / 2) :
    IsSolution redV (lineSet i c) := by sorry

end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), pp. 287–288, 32.2.2, (32:7), (32:7*), (32:7**), (32:8); p. 288, 32.2.3, (32:A)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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