AFTD Auto-Formalizing Theoretical Domains

block_snake_seq

def

The block-snake picking sequence for natural numbers n, k, and r with hr : r < n, and draw permutation π : Equiv.Perm (Fin n), defined as a function Fin (k * n + r) → Fin n. For turn m : Fin (k * n + r), if m.val < k * n with round t = m.val / n and offset j = m.val % n: if j < n - r then it gives π of index j (if t is even) or (n - r - 1 - j) (if t is odd); if j ≥ n - r then it gives π of index n - r + (j - (n - r)) (if t is even) or n - r + (r - 1 - (j - (n - r))) (if t is odd). For m.val ≥ k * n with offset j = m.val - k * n, it gives π of index n - r + j (if k is even) or n - r + (r - 1 - j) (if k is odd).

Statement

def block_snake_seq (n k r : ℕ) (hr : r < n) (π : Equiv.Perm (Fin n)) :
    Fin (k * n + r) → Fin n
Defined in
arXiv:2611.09685, Section 4.1
Verified
09 Nov 2026
Axioms
none listed

Read back from the Lean

block_snake_seq defines a sequence (a function) from Fin (k * n + r) to Fin n, parameterized by natural numbers n, k, and r, a proof hr : r < n, and a permutation π of Fin n. For an input index m : Fin (k * n + r): 1. If m.val < k * n, let t = m.val / n and j = m.val % n: - If j < n - r: it evaluates to π(j) if t is even, and π(n - r - 1 - j) if t is odd. - If j ≥ n - r: let j' = j - (n - r); it evaluates to π(n - r + j') if t is even, and π(n - r + (r - 1 - j')) (which is π(n - 1 - j')) if t is odd. 2. If m.val ≥ k * n, let j = m.val - k * n: - It evaluates to π(n - r + j) if k is even, and π(n - r + (r - 1 - j)) (which is π(n - 1 - j)) if k is odd.

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 block-snake sequence for n agents and kn + r objects determined by a draw permutation π. -/
def block_snake_seq (n k r : ℕ) (hr : r < n) (π : Equiv.Perm (Fin n)) :
    Fin (k * n + r) → Fin n := fun m =>
  if ht : m.val < k * n then
    let t := m.val / n
    let j := m.val % n
    if hj : j < n - r then
      π ⟨if t % 2 = 0 then j else n - r - 1 - j, by split_ifs <;> omega⟩
    else
      π ⟨n - r + (if t % 2 = 0 then j - (n - r) else r - 1 - (j - (n - r))), by
        have : m.val % n < n := Nat.mod_lt _ (by omega)
        split_ifs <;> omega⟩
  else
    let j := m.val - k * n
    π ⟨n - r + (if k % 2 = 0 then j else r - 1 - j), by
      have hm := m.isLt
      split_ifs <;> omega⟩
See it in the graphDiscuss this resultChallenge it