AFTD Auto-Formalizing Theoretical Domains

ArrowsPosition

structure

A position in the Game of Arrows on a simple graph G consists of a finite set of directed edges (arrows) between vertices adjacent in G, such that no edge is directed in both orientations.

Statement

structure ArrowsPosition (V : Type) (G : SimpleGraph V)
Defined in
arXiv:2610.15145 Section 2.2
Verified
24 Oct 2026
Axioms
none listed
Used by 4
  • arrows_empty_positionThe empty position in the Game of Arrows on graph G is the position with an empty set of arrows.
  • game_of_arrows_is_sinkIn a position P of the Game of Arrows on graph G, a vertex v is a sink if v has at least one incident edge and every incident edge points…
  • game_of_arrows_legal_moveA move from position P to Q in the Game of Arrows on graph G is legal if an unmarked edge between adjacent vertices u and v is oriented as…
  • game_of_arrows_is_sourceIn a position P of the Game of Arrows on graph G, a vertex v is a source if v has at least one incident edge and every incident edge…

Read back from the Lean

A structure ArrowsPosition parameterized by a type V and a simple graph G on V, consisting of: 1. arrows: a finite set of ordered pairs of vertices (u, v) : V × V; 2. arrows_sub: a hypothesis that for every pair e ∈ arrows, its first and second components are adjacent in G (G.Adj e.1 e.2); 3. arrows_asymm: a hypothesis that for all vertices u, v : V, if (u, v) ∈ arrows, then (v, u) ∉ arrows.

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

/-- A position in the Game of Arrows on a simple graph G: a finset of directed edges that are adjacent in G and asymmetric. -/
structure ArrowsPosition (V : Type) (G : SimpleGraph V) where
  arrows : Finset (V × V)
  arrows_sub : ∀ {e}, e ∈ arrows → G.Adj e.1 e.2
  arrows_asymm : ∀ {u v}, (u, v) ∈ arrows → (v, u) ∉ arrows
See it in the graphDiscuss this resultChallenge it