AFTD Auto-Formalizing Theoretical Domains

multileaf_repeater_graph

def

For a natural number k and a block size function n : Fin k → ℕ, the multi-leaf repeater graph on vertex type Σ i : Fin k, Fin (n i) is the simple graph where two distinct vertices are adjacent if and only if they are distinct core vertices (both having local index 0), or they belong to the same block and at least one is the core vertex (has local index 0).

Statement

def multileaf_repeater_graph {k : ℕ} (n : Fin k → ℕ) :
    SimpleGraph ((i : Fin k) × Fin (n i))
Defined in
arXiv:2603.23892, Section 3 and Appendix C
Verified
08 Nov 2026
Axioms
none listed

Read back from the Lean

Definition of multileaf_repeater_graph: for an implicit natural number $k$ and a function $n : \text{Fin } k \to \mathbb{N}$, multileaf_repeater_graph n is the simple graph with vertex set $\Sigma (i : \text{Fin } k), \text{Fin}(n(i))$, where two vertices $p = (i, a)$ and $q = (i', b)$ are adjacent if and only if $p \ne q$ and either: 1. $i \ne i'$ and $a = 0$ and $b = 0$, or 2. $i = i'$ and ($a = 0$ or $b = 0$).

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 multi-leaf repeater graph with k core vertices and block sizes n. -/
def multileaf_repeater_graph {k : ℕ} (n : Fin k → ℕ) :
    SimpleGraph ((i : Fin k) × Fin (n i)) where
  Adj p q := p ≠ q ∧
    ((p.1 ≠ q.1 ∧ p.2.val = 0 ∧ q.2.val = 0) ∨
     (p.1 = q.1 ∧ (p.2.val = 0 ∨ q.2.val = 0)))
  symm := ⟨fun p q h => by
    rcases h with ⟨hne, ⟨h1, h2, h3⟩ | ⟨h1, h2⟩⟩
    · exact ⟨hne.symm, Or.inl ⟨h1.symm, h3, h2⟩⟩
    · exact ⟨hne.symm, Or.inr ⟨h1.symm, h2.symm⟩⟩⟩
  loopless := ⟨fun p h => h.1 rfl⟩
See it in the graphDiscuss this resultChallenge it