tournament_is_king
def
A vertex v in a tournament T is a king if every other vertex u is reachable from v in at most two steps: either there is an arc from v to u, or there is a vertex w with arcs from v to w and from w to u.
Statement
def tournament_is_king {V : Type*} (T : Digraph V) (v : V) : Prop
- Defined in
- arXiv:2610.40521 Section 1
- Verified
- 30 Oct 2026
- Axioms
- none listed
Read back from the Lean
Given a type V, a directed graph T on V, and a vertex v : V, tournament_is_king T v is the proposition that for every vertex u : V, if u ≠ v, then either v is adjacent to u in T (T.Adj v u), or there exists a vertex w : V such that v is adjacent to w in T (T.Adj v w) and w is adjacent to u in T (T.Adj w u).
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 in a tournament T is a king if every other vertex is reachable from v by a directed path of length at most two. -/ def tournament_is_king {V : Type*} (T : Digraph V) (v : V) : Prop := ∀ u, u ≠ v → T.Adj v u ∨ ∃ w, T.Adj v w ∧ T.Adj w u