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
- zycle_hom_implies_closed_walkIf f : ZMod ℓ × Fin 2 → α is a hypergraph homomorphism is_hypergraph_hom from the zycle Z_ℓ to a 3-uniform hypergraph G : Finset (Finset…
- zycle_not_div_three_no_hom_tripartite_turanLet ℓ ≥ 2 be an integer with 3 ∤ ℓ. For any family of pairwise disjoint finite sets V : ZMod 3 → Finset α, there is no function f : ZMod ℓ…
- op_1453_zycle_six_cardThe 6-zycle Z₆ has exactly 12 hyperedges.
- op_1453_zycle_four_cardThe 4-zycle Z₄ has exactly 8 hyperedges.
- op_1453_zycle_four_three_uniformThe 4-zycle Z₄ is a 3-uniform hypergraph, meaning every hyperedge has cardinality 3.
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)} }