spider_blocked_two_three_level_five_sub_short_legs
With centre incoming (resp. outgoing) and the legs (5,inward) and the free leg 2, the value at fuel 10 is 0 (resp. 1).
Statement
theorem spider_blocked_two_three_level_five_sub_short_legs :
spider_gamma 10 CentreStatus.incoming [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0 ∧
spider_gamma 10 CentreStatus.outgoing [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1- 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 proof evaluates the game values of the spider position with legs (5, inward) and (2, free) under incoming and outgoing centre statuses. It splits the conjunction into the two centre status cases, applies `spider_gamma_fuel_independent` to reduce the fuel parameter from 10 to the minimal sufficient fuel 8, and completes both evaluations to 0 and 1 via finite computation using `decide`.
The game value `spider_gamma 10` evaluates to 0 for the incoming centre status and 1 for the outgoing centre status. automation
The goal is split into two cases: incoming centre status and outgoing centre status. For each case, the sum of leg lengths plus one is 5 + 2 + 1 = 8 ≤ 10, so rewriting with `spider_gamma_fuel_independent` replaces the fuel parameter 10 with the canonical minimal fuel 8 (with the arithmetic check 8 ≤ 10 verified by `decide`). Finally, `decide` evaluates the finite recursion of `spider_gamma` at fuel 8 to obtain 0 for the incoming status and 1 for the outgoing status.
uses
spider_gamma_fuel_independentrefine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
spider_gamma_fuel_independent- If the fuel is at least one plus the sum of the leg lengths, the game value `spider_gamma` equals its value computed with fuel exactly equal to one plus the sum of the leg lengths.
- The proof relies on kernel evaluation via the `decide` tactic both to verify the fuel bound (5 + 2 + 1 ≤ 10) and to exhaustively compute the game values of `spider_gamma` at fuel 8.
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.
/-- Values 0 and 1 of the two j = 1 cuts of the free leg 2, at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_short_legs : spider_gamma 10 CentreStatus.incoming [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0 ∧ spider_gamma 10 CentreStatus.outgoing [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1 := by refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide