AFTD Auto-Formalizing Theoretical Domains

digraph_is_oriented

def

A digraph G : Digraph V on vertex type V is oriented (digraph_is_oriented G) if for all vertices u v : V, G.Adj u v implies ¬ G.Adj v u.

Statement

def digraph_is_oriented {V : Type*} (G : Digraph V) : Prop
Defined in
arXiv:2610.18600 Section 1
Verified
23 Oct 2026
Axioms
none listed
Used by 5

Read back from the Lean

For a type V and a directed graph G : Digraph V, digraph_is_oriented G asserts that for all vertices u, v : V, if there is an edge from u to v (G.Adj u v), then there is no edge from v to u (¬ G.Adj v u) (i.e., the adjacency relation is asymmetric, which also precludes self-loops).

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 digraph G is oriented if it contains no directed 2-cycles and no loops. -/
def digraph_is_oriented {V : Type*} (G : Digraph V) : Prop := ∀ u v, G.Adj u v → ¬ G.Adj v u
See it in the graphDiscuss this resultChallenge it