AFTD Auto-Formalizing Theoretical Domains

slow_exact_nim_followers

def

For 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 positions in Fin n → ℕ obtained by applying slow_exact_nim_step x S for all subsets S : Finset (Fin n) of size k whose elements all satisfy 0 < x i.

Statement

def slow_exact_nim_followers (k n : ℕ) (x : Fin n → ℕ) : Finset (Fin n → ℕ)
Defined in
arXiv:2611.14546, Section 1
Verified
14 Nov 2026
Axioms
none listed
Built on 1
  • slow_exact_nim_stepGiven 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…
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_grundy_compFor natural numbers k and n, fuel : ℕ, and position x : Fin n → ℕ, the fuel-bounded Sprague-Grundy value slow_exact_nim_grundy_comp k n…

Read back from the Lean

The definition slow_exact_nim_followers takes two natural numbers k and n, and a state x : Fin n → ℕ, and returns the finite set of states obtained by mapping each subset S of Fin n of cardinality k that satisfies ∀ i ∈ S, 0 < x i under slow_exact_nim_step x.

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 finite set of legal followers of a position in slow exact k-Nim on n piles. -/
def slow_exact_nim_followers (k n : ℕ) (x : Fin n → ℕ) : Finset (Fin n → ℕ) := ((Finset.powersetCard k (Finset.univ : Finset (Fin n))).filter (fun S => ∀ i ∈ S, 0 < x i)).image (slow_exact_nim_step x)
See it in the graphDiscuss this resultChallenge it