AFTD Auto-Formalizing Theoretical Domains

simple_graph_dominated_by

def

A vertex $u$ is dominated by a distinct vertex $t$ in a simple graph $G$ if the closed neighborhood of $u$ is contained in the closed neighborhood of $t$.

Statement

def simple_graph_dominated_by {V : Type*} (G : SimpleGraph V) (u t : V) : Prop
Defined in
arXiv:2611.14430, Section 2
Verified
11 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

For a simple graph G on a vertex type V and vertices u, t : V, simple_graph_dominated_by G u t asserts that u ≠ t and the closed neighborhood of u (i.e. {u} ∪ G.neighborSet u) is a subset of the closed neighborhood of t (i.e. {t} ∪ G.neighborSet t).

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 u is dominated by distinct vertex t if the closed neighborhood of u is a subset of that of t. -/
def simple_graph_dominated_by {V : Type*} (G : SimpleGraph V) (u t : V) : Prop :=
  u ≠ t ∧ insert u (G.neighborSet u) ⊆ insert t (G.neighborSet t)
See it in the graphDiscuss this resultChallenge it