AFTD Auto-Formalizing Theoretical Domains

cycle_labeling_complete_nine

theoremverifiedoriginal

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

Statement

theorem cycle_labeling_complete_nine : cycle_labeling_complete 9 [1, 2, 3, 4, 5, 6, 8, 9, 7]
Related work
arXiv:2610.08889 (Consecutive Cycle Sums), list entry OP-121: a complete placement for n = 9 (the increasing order is incomplete by Theorem 1).
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 asserts that the arrangement $[1, 2, 3, 4, 5, 6, 8, 9, 7]$ forms a complete cycle labeling of the 9-cycle, meaning it is a permutation of $\{1, \dots, 9\}$ and every integer from $1$ to $45$ is the sum of some contiguous arc. After unfolding the definition, the statement is a decidable proposition over finite ranges, which is proved by direct computation using the `decide` tactic.

  1. The sequence $[1, 2, 3, 4, 5, 6, 8, 9, 7]$ is a complete cycle labeling of length $9$. automation

    Unfolding the definition of `cycle_labeling_complete` reveals two decidable properties: that the list $[1, 2, 3, 4, 5, 6, 8, 9, 7]$ is a permutation of $\{1, \dots, 9\}$, and that for every integer $k$ from $1$ to $9(9+1)/2 = 45$, there exists a contiguous sublist in the circular arrangement of length between $1$ and $9$ whose elements sum to $k$. Because all quantifiers range over finite sets, Lean's `decide` tactic evaluates both conditions by finite exhaustive 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_nine : cycle_labeling_complete 9 [1, 2, 3, 4, 5, 6, 8, 9, 7] := by  unfold cycle_labeling_complete; decide
See it in the graphDiscuss this resultChallenge it