AFTD Auto-Formalizing Theoretical Domains

slow_exact_nim_truncation_bound

def

The 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 in the interval [2, k+1].

Statement

noncomputable def slow_exact_nim_truncation_bound (k : ℕ) (x : Fin (k + 1) → ℕ) : ℕ
Defined in
arXiv:2611.14546:182
Verified
16 Nov 2026
Axioms
none listed
Used by 2
  • 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.
  • slow_exact_nim_truncateThe 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…

Read back from the Lean

Given a natural number k and a tuple of natural numbers x : Fin (k + 1) → ℕ, slow_exact_nim_truncation_bound k x is defined as the infimum (sInf in ℕ) of the set of natural numbers of the form (∑ i : Fin (k + 1), if i.val < j then x i else 0) / (j - 1) for j in the closed interval of natural numbers [2, k + 1]. Here / is natural number division (truncated division), and the sum is over all indices i in Fin (k + 1) such that i < j (i.e., ∑_{i=0}^{j-1} x i).

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 truncation bound L for a position x on k+1 piles in slow exact k-Nim, defined as the minimum over 2 ≤ j ≤ k+1 of ⌊P_j / (j-1)⌋. -/
noncomputable def slow_exact_nim_truncation_bound (k : ℕ) (x : Fin (k + 1) → ℕ) : ℕ := sInf ((fun j => (∑ i : Fin (k + 1), if i.val < j then x i else 0) / (j - 1)) '' (Set.Icc 2 (k + 1)))
See it in the graphDiscuss this resultChallenge it