AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_fort

def

For a simple graph G on an arbitrary type V, a subset F of V is a fort if F is nonempty and for every vertex v not in F, it is not the case that there exists a unique vertex u in F adjacent to v in G (¬ ∃! u, u ∈ F ∧ G.Adj v u).

Statement

def simple_graph_is_fort {V : Type*} (G : SimpleGraph V) (F : Set V) : Prop
Defined in
arXiv:2611.01102 Sec. 2, Definition 2.1
Verified
03 Nov 2026
Axioms
none listed
Used by 4

Read back from the Lean

For a type V, a simple graph G on V, and a subset F : Set V, simple_graph_is_fort G F asserts that: 1. F is non-empty, and 2. For every vertex v : V not in F, there does not exist a unique vertex u : V such that u ∈ F and v is adjacent to u in G (i.e., no vertex outside F has exactly one neighbor in F).

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 subset F of vertices is a fort if F is nonempty and no vertex outside F has a unique neighbor in F. -/
def simple_graph_is_fort {V : Type*} (G : SimpleGraph V) (F : Set V) : Prop := F.Nonempty ∧ ∀ v ∉ F, ¬ ∃! u, u ∈ F ∧ G.Adj v u
See it in the graphDiscuss this resultChallenge it