(65:S) — the construction of 65.7.1 reaches A_i = ⊖
ProvedTheoryOfGames.Acyclic.exists_stageA_eq_emptycooperative-gamesorder-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets
Assume the standing hypotheses of 65.7.1: is finite and is acyclic on (for finite equivalently strictly acyclic, i.e. property (65:K)). Let be the sets of the inductive construction of 65.7.1 (, the elements of dominated by an element of , ). Then
The smallest such is the index of (65:T), which makes of (65:2) well defined as a finite union.
Formalization Note The Lean stages are indexed from (stageA D S 0 = D is ); 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.