AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_cone

def

A simple graph is a cone if it is non-empty and has an apex (a universal vertex adjacent to all other vertices).

Statement

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

Read back from the Lean

Given a type V and a simple graph G on V, simple_graph_is_cone G asserts that V is nonempty and there exists a vertex apex : V that is universal in G, meaning that apex is adjacent to every other vertex w : V with w ≠ apex.

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 simple graph is a cone if it is non-empty and has a universal vertex (apex). -/
def simple_graph_is_cone {V : Type*} (G : SimpleGraph V) : Prop :=
  Nonempty V ∧ ∃ apex : V, G.IsUniversal apex
See it in the graphDiscuss this resultChallenge it