AFTD Auto-Formalizing Theoretical Domains

ArrowsEmptyPos

def

The empty starting position in ArrowsPos V whose boolean relation is everywhere false.

Statement

def ArrowsEmptyPos (V : Type*) : ArrowsPos V
Defined in
arXiv:2610.15145 Section 2.2
Verified
24 Oct 2026
Axioms
none listed
Built on 1
  • ArrowsPosGiven a type V, ArrowsPos V is the subtype of boolean-valued binary relations p : V → V → Bool that are asymmetric, meaning that for all…
Used by 3
  • 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…
  • arrows_markable_unmarked_emptyIn the empty position the number of unmarked markable edges equals the number of markable (non-pendant) edges, tree_markable_edges.
  • arrows_parity_of_strategy_classLet T be a finite tree and S a class of positions of the Game of Arrows on T that contains the empty position, such that from every…

Read back from the Lean

For any type V, ArrowsEmptyPos V is the element of ArrowsPos V consisting of the constantly false boolean relation on V (i.e., fun _ _ => false), together with the vacuous proof that for all u, v : V, false implies ¬false.

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 empty starting position with every entry false. -/
def ArrowsEmptyPos (V : Type*) : ArrowsPos V := ⟨fun _ _ => false, fun _ _ h => nomatch h⟩
See it in the graphDiscuss this resultChallenge it