AFTD Auto-Formalizing Theoretical Domains

diamond_graph

def

The diamond graph is the simple graph on vertex type Fin 4 obtained from the complete graph ⊤ by deleting the single edge between vertex 0 and vertex 3.

Statement

def diamond_graph : SimpleGraph (Fin 4)
Defined in
arXiv:2610.32404:11
Verified
27 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

diamond_graph is defined as the simple graph on the vertex type Fin 4 obtained from the complete graph ⊤ on Fin 4 by deleting the undirected edge between vertex 0 and vertex 3.

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 diamond graph on vertex type Fin 4, obtained by deleting the edge between 0 and 3 from K_4. -/
def diamond_graph : SimpleGraph (Fin 4) := (⊤ : SimpleGraph (Fin 4)).deleteEdges {s(0, 3)}
See it in the graphDiscuss this resultChallenge it