Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(65:S) — the construction of 65.7.1 reaches A_i = ⊖

Proved
TheoryOfGames.Acyclic.exists_stageA_eq_empty

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

cooperative-gamesorder-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets

Assume the standing hypotheses of 65.7.1: DDD is finite and S\mathcal SS is acyclic on DDD (for finite DDD equivalently strictly acyclic, i.e. property (65:K)). Let A1=D,A2,A3,…A_1 = D, A_2, A_3, \dotsA1​=D,A2​,A3​,… be the sets of the inductive construction of 65.7.1 (Bi=AimB_i = A_i^mBi​=Aim​, CiC_iCi​ the elements of AiA_iAi​ dominated by an element of BiB_iBi​, Ai+1=Ai−Bi−CiA_{i+1} = A_i - B_i - C_iAi+1​=Ai​−Bi​−Ci​). Then

∃ i: Ai=⊖.\exists\, i:\ A_i = \ominus.∃i: Ai​=⊖.

The smallest such iii is the index i0i_0i0​ of (65:T), which makes V0=B1∪⋯∪Bi0−1V_0 = B_1 \cup \cdots \cup B_{i_0-1}V0​=B1​∪⋯∪Bi0​−1​ of (65:2) well defined as a finite union.

Formalization Note The Lean stages are indexed from 000 (stageA D S 0 = D is A1A_1A1​); the statement is the existence of some index and so is unaffected by the shift.

Preamble
import Mathlib
import Definitions.Def_TheoryOfGames_Acyclic_Solution
import Definitions.Def_TheoryOfGames_Acyclic_Acyclicity
import Definitions.Def_TheoryOfGames_Acyclic_Construction
Formal statement
namespace TheoryOfGames.Acyclic

/-- (65:S), p. 598: under the standing assumptions of 65.7.1 — `D` finite and `S` acyclic on `D`
(equivalently, for finite `D`, strictly acyclic, i.e. (65:K)) — there exists an `i` with
`A_i = ⊖`, for the sets `A_i` of the construction of 65.7.1. -/
theorem exists_stageA_eq_empty {α : Type*} (D : Set α) (S : α → α → Prop)
    (hD : D.Finite) (hS : IsAcyclic D S) :
    ∃ k : ℕ, stageA D S k = ∅ := by sorry

end TheoryOfGames.Acyclic
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 598, 65.7.1, (65:S)
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