AFTD Auto-Formalizing Theoretical Domains

is_round_robin_picking_sequence

def

A picking sequence σ : ℕ → Fin n is a round-robin sequence if there exists a permutation π of Fin n such that the agent picking at turn k is π(k mod n).

Statement

def is_round_robin_picking_sequence (n : ℕ) [NeZero n] (σ : ℕ → Fin n) : Prop
Defined in
arXiv:2611.00432, Section 3
Verified
03 Nov 2026
Axioms
none listed

Read back from the Lean

For a positive natural number $n$ (given with the assumption $n \ne 0$) and a sequence $\sigma : \mathbb{N} \to \mathrm{Fin}(n)$, $\sigma$ satisfies is_round_robin_picking_sequence if and only if there exists a permutation $\pi$ of $\mathrm{Fin}(n)$ such that for every natural number $k$, $\sigma(k)$ is equal to $\pi$ applied to $k \bmod n$ (as an element of $\mathrm{Fin}(n)$).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A round-robin picking sequence repeats a fixed permutation of the agents. -/
def is_round_robin_picking_sequence (n : ℕ) [NeZero n] (σ : ℕ → Fin n) : Prop := ∃ π : Equiv.Perm (Fin n), ∀ k : ℕ, σ k = π ⟨k % n, Nat.mod_lt k (NeZero.pos n)⟩
See it in the graphDiscuss this resultChallenge it