AFTD Auto-Formalizing Theoretical Domains

l_path_graph

def

The graph L_t is obtained from a complete graph on t vertices by attaching a path of length two to one clique vertex.

Statement

def l_path_graph (t : ℕ) : SimpleGraph (Sum (Fin t) (Fin 2))
Defined in
arXiv:2610.40279 Section 1
Verified
07 Nov 2026
Axioms
none listed

Read back from the Lean

l_path_graph t defines a SimpleGraph on the vertex type Sum (Fin t) (Fin 2) for any natural number t. Two distinct vertices u and v are adjacent if and only if: 1. Both are in the left component (Sum.inl i and Sum.inl j) and i ≠ j (forming a clique of size t); 2. One vertex is Sum.inl i with (i : ℕ) = 0 and the other is Sum.inr 0; or 3. One vertex is Sum.inr 0 and the other is Sum.inr 1. All other pairs of vertices are non-adjacent.

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 graph L_t obtained from K_t by attaching a path of length two to one clique vertex. -/
def l_path_graph (t : ℕ) : SimpleGraph (Sum (Fin t) (Fin 2)) :=
  SimpleGraph.fromRel fun u v =>
    match u, v with
    | Sum.inl i, Sum.inl j => i ≠ j
    | Sum.inl i, Sum.inr 0 => (i : ℕ) = 0
    | Sum.inr 0, Sum.inl j => (j : ℕ) = 0
    | Sum.inr 0, Sum.inr 1 => True
    | Sum.inr 1, Sum.inr 0 => True
    | _, _ => False
See it in the graphDiscuss this resultChallenge it