arrows_realizable_grundy_values
def
The set of natural numbers g such that there exists a finite tree G (a simple graph G on a finite type V satisfying G.IsTree) with arrows_tree_grundy G = g.
Statement
def arrows_realizable_grundy_values : Set ℕ- Defined in
- arXiv:2610.15145 Section 5.1 & Theorem 7.3
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Built on 1
- arrows_tree_grundyThe Grundy value of the Game of Arrows on a finite simple graph G is the Grundy value of the empty position ArrowsEmptyPos V at fuel…
Read back from the Lean
The set of all natural numbers g such that there exists a type V : Type with Fintype V and DecidableEq V, a simple graph G : SimpleGraph V with decidable adjacency DecidableRel G.Adj, such that G is a tree (G.IsTree), and the Grundy value of the Arrows game on G (arrows_tree_grundy G) equals g.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The set of realizable Grundy values of the Game of Arrows on finite trees. -/ def arrows_realizable_grundy_values : Set ℕ := { g : ℕ | ∃ (V : Type) (_ : Fintype V) (_ : DecidableEq V) (G : SimpleGraph V) (_ : DecidableRel G.Adj) (_ : G.IsTree), arrows_tree_grundy G = g }