spider_eventual_parity_two_three_centre_const
The paper's constant W_in(κ0) = Γ(in;{2^*,3^*}) and W_out(κ0) = Γ(out;{2^*,3^*}) for the configuration κ0 = (n;{2^*,3^*}) both equal 3.
Statement
theorem spider_eventual_parity_two_three_centre_const :
spider_gamma 6 CentreStatus.incoming [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 ∧
spider_gamma 6 CentreStatus.outgoing [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3- Source
- step towards spider_eventual_parity_two_three
- Verified
- 19 Oct 2026
- Axioms
Quot.soundpropext- Built on 3
- SpiderLegEndThe end condition of an attached leg in a spider state is either free (no arc on the leg), inward (pointing towards the centre), or…
- CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
The proof, explained
The theorem verifies that the two-leg spider positions $(i; \{2^*, 3^*\})$ and $(o; \{2^*, 3^*\})$ each have Grundy value $3$. Because the game rules, transition options, and mex operations are defined computably in `spider_gamma`, the result is established by direct finite computation using the `decide` tactic.
The Grundy values $\Gamma(\mathrm{incoming}; \{2^*, 3^*\})$ and $\Gamma(\mathrm{outgoing}; \{2^*, 3^*\})$ are both equal to $3$. automation
The function `spider_gamma` computes the Grundy value of a spider position by exhaustively generating all legal single-move transitions and computing the minimal excluded natural number (mex). Because the configuration and the fuel bound (6) are concrete finite data, all operations are decidable. The `decide` tactic evaluates the finite game tree to normal form and verifies that both values equal 3.
decide
- The proof relies entirely on computational evaluation; the recursive game-tree exploration and mex calculations defined by `spider_gamma` are performed automatically by Lean's evaluator without intermediate lemmas.
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 two two-leg constant positions (i;{2^*,3^*}) and (o;{2^*,3^*}) both have Grundy value 3. -/theorem spider_eventual_parity_two_three_centre_const : spider_gamma 6 CentreStatus.incoming [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 ∧ spider_gamma 6 CentreStatus.outgoing [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 := by decide