spider_blocked_two_three_level_four
At level t = 4, the inward blocked family for the configuration (none; {2^*, 3^*}) at canonical fuel 10 is at most 7.
Statement
theorem spider_blocked_two_three_level_four :
spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] ≤ 7- Source
- step towards spider_eventual_parity_two_three_blocked_small
- Verified
- 19 Oct 2026
- Axioms
Quot.soundpropext- Built on 4
- spider_gamma_fuel_independentFor every fuel at least the total number of markable edges in L plus one, the value of spider_gamma does not depend on the fuel: it equals…
- 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…
- Used by 1
- spider_eventual_parity_two_three_blocked_smallFor the configuration κ0 = (none;{2^*,3^*}), the blocked family at level t is 2 for t = 1 and 6 for t = 2, for both far ends, and it is at…
The proof, explained
The theorem bounds the Grundy value (game value $\gamma$) of a specific spider game configuration—having no central token, one inward leg of length 4, and two free legs of lengths 2 and 3—by 7 at fuel 10. Because the configuration, transition relations, and Grundy value calculation are finite and fully constructive, the inequality is a decidable proposition on concrete terms. The proof is completed by direct computation using the `decide` tactic, which evaluates the expression to 5 and confirms $5 \le 7$.
The game value `spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)]` is at most 7 (specifically, it evaluates to 5). automation
The statement is a closed proposition over completely concrete inputs to primitive recursive functions (`spider_gamma`, `spider_rho`, and `nat_mex_list`). The `decide` tactic evaluates the left-hand side by direct computation in Lean's kernel, obtaining 5, and confirms that $5 \le 7$.
decide
- The evaluation of `spider_gamma` explores all reachable game transitions within the fuel bound of 10 using list operations and the minimum excluded value (`nat_mex_list`). Lean computes this entire state-space exploration internally via `decide` without recording intermediate game states in the proof script.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- At level t = 4, the inward blocked family for the configuration (none; {2^*, 3^*}) at canonical fuel 10 is at most 7. -/theorem spider_blocked_two_three_level_four : spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] ≤ 7 := by decide