arrows_empty_position
def
The empty position in the Game of Arrows on graph G is the position with an empty set of arrows.
Statement
def arrows_empty_position {V : Type} (G : SimpleGraph V) : ArrowsPosition V G
- 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,…
Read back from the Lean
Given an arbitrary type V and a simple graph G on V, arrows_empty_position defines a term of type ArrowsPosition V G whose arrows field is the empty finset (∅), satisfying the conditions that every arrow is an edge of G and that arrows are asymmetric vacuously.
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 position with no marked arrows on a graph G. -/ def arrows_empty_position {V : Type} (G : SimpleGraph V) : ArrowsPosition V G where arrows := ∅ arrows_sub := by simp arrows_asymm := by simp