spider_blocked_two_three_level_five_sub_sum_seven
The two sub-states with free centre where a leg of length 2 with far end inward (resp. outward) is added to the free legs 2 and 3 have value 6 at fuel 10.
Statement
theorem spider_blocked_two_three_level_five_sub_sum_seven :
spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 6 ∧
spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 6- Source
- step towards spider_blocked_two_three_level_five
- Verified
- 20 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
- 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…
- Used by 1
- spider_blocked_two_three_level_fiveAt level t = 5, the inward blocked family for the configuration (none; {2^*, 3^*}) at canonical fuel 11 is at most 7.
The proof, explained
The theorem asserts that two game states on a spider graph—both having a free centre and legs of lengths 2, 2, and 3, distinguished by whether the endpoint of the first leg of length 2 is inward or outward—have Sprague-Grundy value 6. The proof splits into the two cases, applies `spider_gamma_fuel_independent` to reduce fuel 10 to the canonical fuel threshold 8 (since $2 + 2 + 3 + 1 = 8 \le 10$), and then evaluates the recursive definition of `spider_gamma` by computational reflection (`decide`) to confirm the value is 6 in both cases.
The game value `spider_gamma` at fuel 10 equals 6 for both the inward and outward leg configurations. automation
The proof splits the conjunction into two symmetric cases: one where the end of the first leg is inward, and one where it is outward. For each case, because the total length of the legs plus 1 is $(2 + 2 + 3) + 1 = 8 \le 10$, the lemma `spider_gamma_fuel_independent` reduces the evaluation from fuel 10 to fuel 8. Lean's `decide` tactic then closes both goals by directly computing the recursive function `spider_gamma` on the finite state space down to fuel 0 and verifying that the resulting Grundy value is 6.
uses
spider_gamma_fuel_independentrefine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
spider_gamma_fuel_independent- If the provided fuel is at least one plus the sum of the leg lengths, the value of `spider_gamma` equals its value at that minimal fuel threshold.
- The evaluation of `spider_gamma` at canonical fuel 8 is performed by Lean's computational decider (`decide`), which exhaustively traverses the finite game tree of transitions and computes the mex of options.
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.
/-- Value 6 of the two j = 3 cuts of the long leg, at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_sum_seven : spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 6 ∧ spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 6 := by refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide