slow_exact_nim_predicted_grundy_zero
For every integer k ≥ 2, the explicit formula slow_exact_nim_predicted_grundy k evaluated on the zero position equals 0.
Statement
theorem slow_exact_nim_predicted_grundy_zero (k : ℕ) (hk : 2 ≤ k) : slow_exact_nim_predicted_grundy k (fun _ => 0) = 0
- Source
- arXiv:2611.14546:470
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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_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…
- 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
For any natural number $k$ such that $k \ge 2$, the predicted Grundy value (slow_exact_nim_predicted_grundy) for dimension parameter $k$ evaluated on the constant zero tuple (the function $(\mathrm{Fin}\,(k + 1) \to \mathbb{N})$ mapping every index to $0$) is equal to $0$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof evaluates the explicit Grundy value formula directly on the zero position. Because every pile has size 0, truncation leaves all piles at 0, resulting in a total sum of 0, remainder s = 0 modulo 2k, and o = 0 odd piles. The formula's default condition o ≤ r is satisfied, which yields 0 unless the branch s = 2k - 1 is taken. For k ≥ 2, 2k - 1 is at least 3 and therefore nonzero, confirming that the predicted Grundy value is 0.
Evaluating the predicted Grundy formula on the zero position reduces to showing that 2k - 1 ≠ 0 whenever k - 1 ≠ 0.
Unfolding the definitions of slow_exact_nim_predicted_grundy and slow_exact_nim_truncate on the all-zero position x = (fun _ => 0), each truncated pile size is y i = min 0 _ = 0. Therefore, the sum is S = 0, the remainder modulo 2k is s = 0, and the number of odd piles is o = 0. In the nested conditionals of the formula, the branch o ≤ r holds (as 0 ≤ 0), which evaluates to 0. The only way the expression could produce a non-zero value is if the branch s = 2k - 1 were reached, which requires s ≠ k - 1. Simplifying these conditionals reduces the equality to the implication ¬(0 = k - 1) → ¬(0 = 2k - 1).
unfold slow_exact_nim_predicted_grundy slow_exact_nim_truncate simp
The formula evaluates to 0 because 2k - 1 cannot equal 0 when k ≥ 2.
Since k ≥ 2, we have 2k - 1 ≥ 3, which is nonzero. Thus the consequent ¬(0 = 2k - 1) is true, and linear integer arithmetic (via omega) closes the goal.
omega
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Sanity check: the explicit formula gives 0 on the zero position. -/theorem slow_exact_nim_predicted_grundy_zero (k : ℕ) (hk : 2 ≤ k) : slow_exact_nim_predicted_grundy k (fun _ => 0) = 0 := by unfold slow_exact_nim_predicted_grundy slow_exact_nim_truncate simp omega