AFTD Auto-Formalizing Theoretical Domains

wheel5

def

The 6-vertex wheel graph W₅ with center u and rim cycle v 0, ..., v 4.

Statement

def wheel5 : SimpleGraph Wheel5Vert
Defined in
arXiv:2611.03236 Sec. 3
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • Wheel5VertThe vertex set of the 5-wheel W₅, consisting of a central vertex u and five rim vertices v 0, ..., v 4.
Used by 1
  • wheel5_scaled_list_uncolorableFor all integers t ≥ 0 and b ≥ 3t + 2, there exists a list assignment L* on the 5-wheel W₅ such that |L*(x)| = b * f_W(x) + t for every…

Read back from the Lean

wheel5 is defined as the simple graph on the vertex type Wheel5Vert (consisting of a vertex u and five vertices v i for i : Fin 5). Two vertices x and y are adjacent if and only if: - one is u and the other is v i for some i : Fin 5; or - x = v i and y = v j for some i, j : Fin 5 such that i and j are adjacent in SimpleGraph.cycleGraph 5. The vertex u is not adjacent to itself, making the graph loopless and symmetric.

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 6-vertex wheel graph W₅ with center u and rim 5-cycle. -/
def wheel5 : SimpleGraph Wheel5Vert := {
  Adj := fun x y =>
    match x, y with
    | .u, .v _ => True
    | .v _, .u => True
    | .v i, .v j => (SimpleGraph.cycleGraph 5).Adj i j
    | .u, .u => False
  symm := ⟨by
    rintro (_ | i) (_ | j) h
    · exact False.elim h
    · trivial
    · trivial
    · exact (SimpleGraph.cycleGraph 5).adj_symm h⟩
  loopless := ⟨by
    rintro (_ | i) h
    · exact False.elim h
    · exact (SimpleGraph.cycleGraph 5).loopless.irrefl i h⟩
}
See it in the graphDiscuss this resultChallenge it