AFTD Auto-Formalizing Theoretical Domains

cycle_labeling_complete_range_five

theoremverifiedformalization

The 5-cycle labelled 1, 2, 3, 4, 5 in order is complete.

Statement

theorem cycle_labeling_complete_range_five : cycle_labeling_complete 5 (List.range' 1 5)
Formalizes
arXiv:2610.08889 (Consecutive Cycle Sums), Sec. 1 (the 5-cycle is complete).
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 proof proceeds by unfolding the definition of a complete cycle labelling for $n = 5$ on the list $[1, 2, 3, 4, 5]$. This reduces the statement to verifying that the list is a permutation of $\{1, \dots, 5\}$ and that every sum from $1$ to $15$ is realised by some contiguous circular subsegment. Since all quantifiers are bounded over finite sets, Lean's decision procedure verifies the claim by direct computation.

  1. The list $[1, 2, 3, 4, 5]$ is a complete cycle labelling of length $5$. automation

    Unfolding the definition `cycle_labeling_complete` reduces the theorem to two finite checks: first, that $[1, 2, 3, 4, 5]$ is a permutation of the range from $1$ to $5$; second, that every integer $k$ in the range from $1$ to $5(5+1)/2 = 15$ can be obtained as the sum of a contiguous circular sublist of length between $1$ and $5$. Because both conditions involve only bounded quantifiers and finite list manipulations, the `decide` tactic completes the proof by 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_range_five : cycle_labeling_complete 5 (List.range' 1 5) := by  unfold cycle_labeling_complete; decide
See it in the graphDiscuss this resultChallenge it