AFTD Auto-Formalizing Theoretical Domains

simple_graph_cone

def

The cone or graph join G ∨ K_1 of a simple graph G is the simple graph on Option V obtained by adding a universal vertex none adjacent to every vertex of G.

Statement

def simple_graph_cone {V : Type*} (G : SimpleGraph V) : SimpleGraph (Option V)
Defined in
arXiv:2611.13656 Section 1
Verified
12 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given a type V and a simple graph G on V, simple_graph_cone G is the simple graph on vertex type Option V (adding a new vertex none to V) whose adjacency relation is defined by: - for all u, v : V, some u and some v are adjacent if and only if u and v are adjacent in G; - for all v : V, none and some v are adjacent; - for all u : V, some u and none are adjacent; - none is not adjacent to none.

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

/-- The cone graph G ∨ K_1 formed by adding a universal vertex none to G. -/
def simple_graph_cone {V : Type*} (G : SimpleGraph V) : SimpleGraph (Option V) where
  Adj
    | some u, some v => G.Adj u v
    | none, some _ => True
    | some _, none => True
    | none, none => False
  symm := ⟨by
    rintro (_ | u) (_ | v) h <;> try trivial
    exact G.adj_symm h⟩
  loopless := ⟨by
    rintro (_ | u) h
    · exact h
    · exact G.loopless.irrefl u h⟩
See it in the graphDiscuss this resultChallenge it