op_1453_zycle_four_card
The 4-zycle Z₄ has exactly 8 hyperedges.
Statement
theorem op_1453_zycle_four_card : (zycle 4).card = 8- Formalizes
- arXiv:2611.12582 Section 1
- Verified
- 13 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- zycleFor 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),…
Read back from the Lean
The cardinality of zycle 4 is 8, where zycle ℓ is defined as the union over all i : ZMod ℓ of the 3-element subsets {(i, 0), (i, 1), (i + 1, 0)} and {(i, 0), (i, 1), (i + 1, 1)} of ZMod ℓ × Fin 2.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that the 4-zycle Z₄ has exactly 8 hyperedges. Because Z₄ is defined as an explicit finite union of two 3-element subsets for each element of ℤ/4ℤ, Lean establishes the identity (zycle 4).card = 8 by direct computation (definitional equality).
The cardinality of zycle 4 is 8.
By definition, the 4-zycle Z₄ is the union over i ∈ ℤ/4ℤ of two 3-element hyperedges: {(i, 0), (i, 1), (i + 1, 0)} and {(i, 0), (i, 1), (i + 1, 1)}. Since ℤ/4ℤ has 4 elements and all 8 resulting subsets are distinct, the cardinality evaluates directly to 8 by definitional equality (rfl).
uses
rfltheorem op_1453_zycle_four_card : (zycle 4).card = 8 := rfl
rfl- Equality is reflexive (a = a); it proves an equality whenever both sides reduce to the same value by definition.
- The proof relies entirely on computation (definitional reduction) in Lean's kernel: the finite set operations and cardinality evaluation are computed automatically without manual case analysis.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The 4-zycle Z₄ has 8 edges. -/theorem op_1453_zycle_four_card : (zycle 4).card = 8 := rfl