digraph_is_isolated_edge
An edge uv in a digraph G is isolated if uv is an arc, u has no other out-neighbors and no in-neighbors, and v has no other in-neighbors and no out-neighbors.
Statement
def digraph_is_isolated_edge {V : Type*} (G : Digraph V) (u v : V) : Prop
- Defined in
- arXiv:2610.18600, Lemma 2.1
- Verified
- 23 Oct 2026
- Axioms
- none listed
Read back from the Lean
For a type V, a directed graph G : Digraph V, and vertices u, v : V, digraph_is_isolated_edge G u v asserts that:
1. u is adjacent to v (G.Adj u v),
2. for all w : V, if G.Adj u w then w = v (the only directed edge originating at u goes to v),
3. for all w : V, there is no directed edge from w to u (u has in-degree zero),
4. for all w : V, there is no directed edge from v to w (v has out-degree zero), and
5. for all w : V, if G.Adj w v then w = u (the only directed edge terminating at v comes from u).
In other words, the directed edge from u to v forms an isolated weakly connected component of two vertices in G.
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
/-- An isolated edge in a digraph is an arc whose endpoints have no other incident arcs. -/ def digraph_is_isolated_edge {V : Type*} (G : Digraph V) (u v : V) : Prop := G.Adj u v ∧ (∀ w, G.Adj u w → w = v) ∧ (∀ w, ¬ G.Adj w u) ∧ (∀ w, ¬ G.Adj v w) ∧ (∀ w, G.Adj w v → w = u)