Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(31:K) — never α ⊱ α

Proved
TheoryOfGames.ThreePerson.never_dominates_self

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

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

Let vvv be a function on the subsets of the player set I={1,…,n}I = \{1, \dots, n\}I={1,…,n} and let α⃗\vec\alphaα be an imputation for vvv. Then α⃗\vec\alphaα does not dominate itself:

never α⃗≻α⃗.\text{never } \vec\alpha \succ \vec\alpha .never α≻α.

Domination is irreflexive; this is used whenever a one-element set is tested as a solution, as in (31:O).

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

/-- (31:K), 31.2.2: never `α ⊱ α`. -/
theorem never_dominates_self {n : ℕ} (v : Finset (Fin n) → ℝ) (α : Fin n → ℝ)
    (hα : IsImputation v α) : ¬ Dominates v α α := by sorry

end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 278, 31.2.2, (31:K)
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