spider_blocked_none_one_inward_one_outward_base
The base case r = 1 of the κ₁ blocked family: for both far ends φ ≠ free, (none;{1^in,1^out,(1,φ)}) at canonical fuel 4 has value 1.
Statement
theorem spider_blocked_none_one_inward_one_outward_base (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) :
spider_gamma 4 CentreStatus.none [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward), (1, φ)] = 1- Source
- step towards spider_blocked_none_one_inward_one_outward
- Verified
- 20 Oct 2026
- Axioms
Quot.soundpropext- Built on 3
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
- 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_none_one_inward_one_outwardFor the configuration κ₁ = (none;{(1,inward),(1,outward)}), the blocked family V^φ_κ₁(r) equals r for every r ≥ 1 and both φ.
The proof, explained
The proof proceeds by case analysis on the leg end φ. The case φ = free is ruled out immediately by the hypothesis that φ ≠ free. In the remaining cases, φ = inward and φ = outward, all arguments to the recursive function `spider_gamma` are concrete, and both equalities evaluate to 1 by definitional equality (reflexivity).
The case φ = free is eliminated, leaving only φ = inward and φ = outward.
We perform a case analysis on the inductive type `SpiderLegEnd` for the leg end φ. When φ is `SpiderLegEnd.free`, the hypothesis `hφ : φ ≠ SpiderLegEnd.free` becomes `SpiderLegEnd.free ≠ SpiderLegEnd.free`, which is a contradiction.
cases φ · contradiction
When φ = inward, the game value is 1.
Substituting φ = inward leaves a fully concrete game state with centre status `none` and three legs of length 1 (two inward, one outward). Expanding the recursive definition of `spider_gamma` with fuel 4 computes the Sprague-Grundy value to be 1, so the goal holds by definitional equality.
· rflWhen φ = outward, the game value is 1.
Similarly, substituting φ = outward yields a fully concrete game state with one inward leg and two outward legs of length 1. Unfolding `spider_gamma` with fuel 4 again evaluates definitionally to 1.
· rfl
- Evaluating `spider_gamma` via `rfl` relies on Lean's kernel reducing the recursive definition and computing the minimum excluded value (`nat_mex_list`) across all transitions within the allotted fuel.
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.
/-- Base case r = 1 of the κ₁ blocked family. -/theorem spider_blocked_none_one_inward_one_outward_base (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) : spider_gamma 4 CentreStatus.none [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward), (1, φ)] = 1 := by cases φ · contradiction · rfl · rfl