AFTD Auto-Formalizing Theoretical Domains

is_path_graph

def

A simple graph is a path graph if it is isomorphic to a standard path graph on n vertices for some n.

Statement

def is_path_graph {V : Type*} (G : SimpleGraph V) : Prop
Defined in
arXiv:2611.09627:332
Verified
09 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

For a simple graph G on a vertex type V, is_path_graph G asserts that there exists a natural number n such that G is isomorphic (as a simple graph) to SimpleGraph.pathGraph 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

/-- A simple graph is a path graph if it is isomorphic to SimpleGraph.pathGraph n for some natural number n. -/
def is_path_graph {V : Type*} (G : SimpleGraph V) : Prop := ∃ n : ℕ, Nonempty (G ≃g SimpleGraph.pathGraph n)
See it in the graphDiscuss this resultChallenge it