AFTD Auto-Formalizing Theoretical Domains

is_round_robin_sequence

def

A picking sequence seq of type List (Fin n) is a Round-Robin sequence if there exists an instance of NeZero n such that seq equals round_robin_sequence n seq.length.

Statement

def is_round_robin_sequence (n : ℕ) (seq : List (Fin n)) : Prop
Defined in
arXiv:2610.23686, Sec. 2
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • round_robin_sequenceThe Round-Robin picking sequence (1, 2, ..., n, 1, 2, ...) of length m, with agents numbered 0, ..., n-1.
Used by 2

Read back from the Lean

Given a natural number n and a list seq of elements in Fin n, is_round_robin_sequence n seq asserts that n is non-zero (witnessed by an instance of NeZero n) and that seq is equal to round_robin_sequence n seq.length.

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 picking sequence seq of type List (Fin n) is a Round-Robin sequence if there exists an instance of NeZero n such that seq equals round_robin_sequence n seq.length. -/
def is_round_robin_sequence (n : ℕ) (seq : List (Fin n)) : Prop :=
  ∃ (_ : NeZero n), seq = round_robin_sequence n seq.length
See it in the graphDiscuss this resultChallenge it