slow_exact_nim_truncate
def
The truncated position obtained from x on k+1 piles in slow exact k-Nim by capping each pile size x_i at the truncation bound slow_exact_nim_truncation_bound k x.
Statement
noncomputable def slow_exact_nim_truncate (k : ℕ) (x : Fin (k + 1) → ℕ) : Fin (k + 1) → ℕ
- Defined in
- arXiv:2611.14546:182
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 1
- slow_exact_nim_truncation_boundThe truncation bound L for a position x on k+1 piles in slow exact k-Nim, defined as the infimum of ⌊(∑_{i < j} x_i) / (j-1)⌋ over all j…
- Used by 2
- slow_exact_nim_predicted_grundyThe explicit Sprague-Grundy function value for a position x on k+1 piles in slow exact k-Nim: with truncated piles y =…
- slow_exact_nim_predicted_grundy_zeroFor every integer k ≥ 2, the explicit formula slow_exact_nim_predicted_grundy k evaluated on the zero position equals 0.
Read back from the Lean
The definition slow_exact_nim_truncate takes a natural number k and a function x : Fin (k + 1) → ℕ, and returns a function Fin (k + 1) → ℕ defined pointwise for each index i as the minimum of x i and slow_exact_nim_truncation_bound k 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 truncated position y_i = min(x_i, L) in slow exact k-Nim with k+1 piles. -/ noncomputable def slow_exact_nim_truncate (k : ℕ) (x : Fin (k + 1) → ℕ) : Fin (k + 1) → ℕ := fun i => min (x i) (slow_exact_nim_truncation_bound k x)