AFTD Auto-Formalizing Theoretical Domains

slow_exact_nim_step

def

Given a natural number n, a position x : Fin n → ℕ on n piles, and a subset of pile indices S : Finset (Fin n), the follower position slow_exact_nim_step x S is the function Fin n → ℕ that maps each index i ∈ S to x i - 1 (using natural number subtraction) and every index i ∉ S to x i.

Statement

def slow_exact_nim_step {n : ℕ} (x : Fin n → ℕ) (S : Finset (Fin n)) : Fin n → ℕ
Defined in
arXiv:2611.14546, Section 1
Verified
14 Nov 2026
Axioms
none listed
Used by 2
  • op_1600_slow_exact_nim_bounded_grundyIn the normal-play game of slow exact k-Nim on k+2 piles, for every integer k ≥ 3, the range of the Sprague-Grundy function is bounded:…
  • slow_exact_nim_followersFor natural numbers k and n and a position x : Fin n → ℕ, the finite set of legal followers slow_exact_nim_followers k n x is the set of…

Read back from the Lean

Given a natural number n, a function x : Fin n → ℕ, and a finite subset S ⊆ Fin n, slow_exact_nim_step x S is the function from Fin n to ℕ mapping each index i : Fin n to x i - 1 (using natural number saturating subtraction) if i ∈ S, and to x i otherwise.

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

/-- One move step in slow exact k-Nim on n piles, decrementing coordinates in S. -/
def slow_exact_nim_step {n : ℕ} (x : Fin n → ℕ) (S : Finset (Fin n)) : Fin n → ℕ := fun i => if i ∈ S then x i - 1 else x i
See it in the graphDiscuss this resultChallenge it