AFTD Auto-Formalizing Theoretical Domains

zycle

def

For any positive integer ℓ, the 3-uniform zycle Z_ℓ has vertex set ZMod ℓ × Fin 2 and edge set consisting of the triples {(i,0), (i,1), (i+1,0)} and {(i,0), (i,1), (i+1,1)} for all i in ZMod ℓ.

Statement

def zycle (ℓ : ℕ) [NeZero ℓ] : Finset (Finset (ZMod ℓ × Fin 2))
Defined in
arXiv:2611.12582 Section 1
Verified
13 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

For a natural number ℓ with typeclass assumption [NeZero ℓ], zycle ℓ is defined as the finite set of finite subsets of ZMod ℓ × Fin 2 obtained by taking the union over all i : ZMod ℓ of the two sets {(i, 0), (i, 1), (i + 1, 0)} and {(i, 0), (i, 1), (i + 1, 1)}.

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 3-uniform zycle Z_ℓ with vertices x_i = (i,0) and y_i = (i,1) for i in ZMod ℓ and edges {x_i, y_i, x_{i+1}} and {x_i, y_i, y_{i+1}}. -/
def zycle (ℓ : ℕ) [NeZero ℓ] : Finset (Finset (ZMod ℓ × Fin 2)) := Finset.univ.biUnion fun (i : ZMod ℓ) =>
    { {(i, 0), (i, 1), (i + 1, 0)}, {(i, 0), (i, 1), (i + 1, 1)} }
See it in the graphDiscuss this resultChallenge it