spider_grundy_val_one_three_up_to_four
For every natural number z with 1 ≤ z and z ≤ 4, the Grundy value spider_grundy_val 1 3 z of the spider tree S(1, 3, z) in the Game of Arrows is equal to z % 2.
Statement
theorem spider_grundy_val_one_three_up_to_four (z : ℕ) (h1 : 1 ≤ z) (h4 : z ≤ 4) : spider_grundy_val 1 3 z = z % 2- Source
- arXiv:2610.15145, Conjecture 7.4
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- spider_grundy_valThe Grundy value spider_grundy_val of the 3-legged spider tree with leg parameters x, y, z : ℕ is defined as spider_gamma (x + y + z + 1)…
- spider_grundy_val_one_three_up_to_threeFor every natural number z with 1 ≤ z and z ≤ 3, the Grundy value spider_grundy_val 1 3 z of the spider tree S(1, 3, z) in the Game of…
Read back from the Lean
For every natural number $z$, if $1 \le z$ and $z \le 4$ (that is, $z \in \{1, 2, 3, 4\}$), then spider_grundy_val 1 3 z equals $z \pmod 2$.
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 splits into two cases based on the upper bound z ≤ 4: either z = 4 or z < 4. In the boundary case z = 4, the equality is checked by direct evaluation of the computable game definitions. In the remaining case z < 4, we have z ≤ 3, which is handled directly by the induction base theorem spider_grundy_val_one_three_up_to_three.
Either z = 4 or z < 4.
By eq_or_lt_of_le applied to the hypothesis z ≤ 4, either z equals 4 or z is strictly less than 4.
uses
eq_or_lt_of_lercases eq_or_lt_of_le h4 with rfl | h3
When z = 4, spider_grundy_val 1 3 4 = 4 % 2. automation
Since all arguments to spider_grundy_val are concrete constants, the claim reduces to a finite computation that evaluates to true.
· decideWhen z < 4, spider_grundy_val 1 3 z = z % 2.
The strict inequality z < 4 means z < 3 + 1, so Nat.le_of_lt_succ gives z ≤ 3. Combining this with 1 ≤ z, the previously proved theorem spider_grundy_val_one_three_up_to_three directly yields the result.
uses
spider_grundy_val_one_three_up_to_three,Nat.le_of_lt_succ· exact spider_grundy_val_one_three_up_to_three z h1 (Nat.le_of_lt_succ h3)
eq_or_lt_of_le- In any partial order, a ≤ b implies a = b or a < b.
Nat.le_of_lt_succ- For natural numbers, m < n + 1 implies m ≤ n.
spider_grundy_val_one_three_up_to_three- For any natural number z with 1 ≤ z ≤ 3, the Grundy value spider_grundy_val 1 3 z equals z % 2.
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.
/-- The Grundy value of S(1, 3, z) equals z % 2 for all 1 ≤ z ≤ 4. -/theorem spider_grundy_val_one_three_up_to_four (z : ℕ) (h1 : 1 ≤ z) (h4 : z ≤ 4) : spider_grundy_val 1 3 z = z % 2 := by rcases eq_or_lt_of_le h4 with rfl | h3 · decide · exact spider_grundy_val_one_three_up_to_three z h1 (Nat.le_of_lt_succ h3)