AFTD Auto-Formalizing Theoretical Domains

game_of_arrows_is_sink

def

In 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 toward v.

Statement

def game_of_arrows_is_sink {V : Type} (G : SimpleGraph V) (P : ArrowsPosition V G) (v : V) : Prop
Defined in
arXiv:2610.15145 Section 2.2
Verified
24 Oct 2026
Axioms
none listed
Built on 1
  • ArrowsPositionA 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,…
Used by 1
  • 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…

Read back from the Lean

Given a type V, a simple graph G on V, an arrows position P on G, and a vertex v : V, game_of_arrows_is_sink G P v asserts that: 1. There exists a vertex u : V such that u is adjacent to v in G, and 2. For every vertex u : V, if u is adjacent to v in G, then the directed pair (u, v) belongs to P.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 vertex v is a sink in position P of the Game of Arrows if it has degree at least 1 and all incident edges point to v. -/
def game_of_arrows_is_sink {V : Type} (G : SimpleGraph V) (P : ArrowsPosition V G) (v : V) : Prop := (∃ u, G.Adj u v) ∧ ∀ u, G.Adj u v → (u, v) ∈ P.arrows
See it in the graphDiscuss this resultChallenge it