AFTD Auto-Formalizing Theoretical Domains

round_robin_sequence_three_eight

theoremverified

The Round-Robin sequence for 3 agents and 8 goods is (1,2,3,1,2,3,1,2).

Statement

theorem round_robin_sequence_three_eight : round_robin_sequence 3 8 = [0, 1, 2, 0, 1, 2, 0, 1]
Source
Sanity lemma for round_robin_sequence (the sequence of arXiv:2610.23686 Proposition 1).
Verified
19 Oct 2026
Axioms
propext
Built on 1
  • round_robin_sequenceThe Round-Robin picking sequence (1, 2, ..., n, 1, 2, ...) of length m, with agents numbered 0, ..., n-1.

The proof, explained

The round-robin sequence for 3 agents and 8 items assigns each item index $t \in \{0, \dots, 7\}$ to the agent $t \bmod 3$. Computing these values directly yields the sequence [0, 1, 2, 0, 1, 2, 0, 1]. Because both sides evaluate to identical lists, the theorem holds by reflexivity.

  1. round_robin_sequence 3 8 = [0, 1, 2, 0, 1, 2, 0, 1]

    By definition, `round_robin_sequence 3 8` evaluates the index modulo 3 for each item index $t \in \{0, 1, \dots, 7\}$. Computing $t \bmod 3$ for each index in order produces $0, 1, 2, 0, 1, 2, 0, 1$. Since both sides reduce to the exact same list, the identity holds by definitional equality (reflexivity).

    line 1

    theorem round_robin_sequence_three_eight : round_robin_sequence 3 8 = [0, 1, 2, 0, 1, 2, 0, 1] := rfl

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

theorem round_robin_sequence_three_eight : round_robin_sequence 3 8 = [0, 1, 2, 0, 1, 2, 0, 1] := rfl
See it in the graphDiscuss this resultChallenge it