AFTD Auto-Formalizing Theoretical Domains

petrial_R_graph

def

For any natural number m, R_m is the simple graph on the vertex type Option (Fin m × Fin 5) obtained by connecting a root vertex none to the middle vertex 2 of each of m disjoint copies of the five-vertex path graph P_5.

Statement

def petrial_R_graph (m : ℕ) : SimpleGraph (Option (Fin m × Fin 5))
Defined in
arXiv:2611.07503 Section 3
Verified
08 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given a natural number m, petrial_R_graph m is defined as the simple graph whose vertex type is Option (Fin m × Fin 5) (that is, an extra vertex none together with m disjoint sets of 5 vertices some (i, v) indexed by i : Fin m and v : Fin 5), where: - none is not adjacent to none; - none is adjacent to some (i, v) (and symmetrically some (i, v) is adjacent to none) if and only if v = 2; - two vertices some (i₁, v₁) and some (i₂, v₂) are adjacent if and only if i₁ = i₂ and v₁ is adjacent to v₂ in SimpleGraph.pathGraph 5.

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 tree R_m obtained by connecting a root vertex to the middle vertex of each of m disjoint copies of P_5. -/
def petrial_R_graph (m : ℕ) : SimpleGraph (Option (Fin m × Fin 5)) where
  Adj
    | none, none => False
    | none, some (_, v) => v = 2
    | some (_, v), none => v = 2
    | some (i₁, v₁), some (i₂, v₂) => i₁ = i₂ ∧ (SimpleGraph.pathGraph 5).Adj v₁ v₂
  symm := ⟨by
    intro a b h
    match a, b with
    | none, none => exact h
    | none, some (i, v) => exact h
    | some (i, v), none => exact h
    | some (i₁, v₁), some (i₂, v₂) =>
      obtain ⟨h1, h2⟩ := h
      exact ⟨h1.symm, h2.symm⟩⟩
  loopless := ⟨by
    intro a
    match a with
    | none => intro h; exact h
    | some (i, v) =>
      intro h
      obtain ⟨-, h2⟩ := h
      exact h2.ne rfl⟩
See it in the graphDiscuss this resultChallenge it