AFTD Auto-Formalizing Theoretical Domains

cycle_labeling_complete_ten

theoremverifiedoriginal

The 10-cycle labelled 1, 2, 3, 4, 5, 9, 7, 8, 6, 10 in order is complete.

Statement

theorem cycle_labeling_complete_ten : cycle_labeling_complete 10 [1, 2, 3, 4, 5, 9, 7, 8, 6, 10]
Related work
arXiv:2610.08889 (Consecutive Cycle Sums), list entry OP-121: a complete placement for n = 10 (found by computer search).
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • cycle_labeling_completePlacing the labels L (a permutation of 1, …, n) in order around an n-cycle gives a complete cycle: every k ∈ {1, …, n(n+1)/2} is the sum…

The proof, explained

The theorem states that the sequence $(1, 2, 3, 4, 5, 9, 7, 8, 6, 10)$ is a complete cycle labeling of order 10: it is a permutation of $\{1, \dots, 10\}$ whose contiguous cyclic subsegments realize every sum from $1$ to $10(10+1)/2 = 55$. The proof unfolds the definition into a bounded assertion over finite sets and lists, and then verifies it by direct exhaustive evaluation via the `decide` tactic.

  1. The list $[1, 2, 3, 4, 5, 9, 7, 8, 6, 10]$ is a complete cycle labeling for $n = 10$. automation

    Unfolding the definition of `cycle_labeling_complete` reduces the goal to verifying two conditions: that the list is a permutation of $\{1, \dots, 10\}$, and that every integer $k \in \{1, \dots, 55\}$ can be written as the sum of a contiguous subsegment of length $1 \le l \le 10$ in the 10-cycle. Because all domains, list operations, and quantifiers are finite and bounded, the resulting proposition is decidable, and `decide` verifies it by direct finite computation.

    line 2

      unfold cycle_labeling_complete; decide

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem cycle_labeling_complete_ten : cycle_labeling_complete 10 [1, 2, 3, 4, 5, 9, 7, 8, 6, 10] := by  unfold cycle_labeling_complete; decide
See it in the graphDiscuss this resultChallenge it