AFTD Auto-Formalizing Theoretical Domains

cyclic_permutation_subtraction_set

deforiginal

For natural numbers d, s, a, b, cyclic_permutation_subtraction_set d s a b is the finite set in Finset (List (Fin d)) consisting of the list obtained by concatenating a copies of List.finRange d and the list obtained by concatenating b copies of (List.finRange d).rotate s.

Statement

def cyclic_permutation_subtraction_set (d : ℕ) (s : ℕ) (a b : ℕ) : Finset (List (Fin d))
Related work
arXiv:2611.09157
Verified
10 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given natural numbers d, s, a, and b, cyclic_permutation_subtraction_set d s a b is defined as the finite set (Finset) of lists with elements in Fin d consisting of (at most) two elements: 1. The concatenation of a copies of List.finRange d (the list of all elements of Fin d in canonical order [0, 1, ..., d - 1]). 2. The concatenation of b copies of (List.finRange d).rotate s (List.finRange d cyclically rotated by s positions).

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

/-- The subtraction set containing w^a and rot_s(w)^b for the cyclic permutation word game over Fin d. -/
def cyclic_permutation_subtraction_set (d : ℕ) (s : ℕ) (a b : ℕ) : Finset (List (Fin d)) := { (List.replicate a (List.finRange d)).flatten,
    (List.replicate b ((List.finRange d).rotate s)).flatten }
See it in the graphDiscuss this resultChallenge it