AFTD Auto-Formalizing Theoretical Domains

simple_graph_prism

def

The prism graph P₁ □ C_n on vertex set Fin 2 × Fin n, defined as the Cartesian box product of the 2-vertex complete graph K₂ (the path P₁) and the cycle graph C_n.

Statement

def simple_graph_prism (n : ℕ) : SimpleGraph (Fin 2 × Fin n)
Defined in
arXiv:2610.18463 Question 5.4
Verified
25 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

simple_graph_prism n is defined for any natural number n as the simple graph on vertex type Fin 2 × Fin n given by the box product (Cartesian product of graphs, □) of the complete graph on Fin 2 and the cycle graph on Fin n.

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 prism graph P₁ □ C_n as the Cartesian box product of K₂ and C_n. -/
def simple_graph_prism (n : ℕ) : SimpleGraph (Fin 2 × Fin n) :=
  SimpleGraph.completeGraph (Fin 2) □ SimpleGraph.cycleGraph n
See it in the graphDiscuss this resultChallenge it