spider_none_one_inward_one_outward_raw_opts
def
The raw option list of the state (none;{(1,inward),(1,outward),(r,φ)}) after one unfolding step, in the exact order the recursion enumerates: the j = 1 cut of each of the two short legs, the j = 1 cuts of the long leg, the cuts j = 2..r-1 of the long leg (reindexed i = j-2), and the last cut j = r of the long leg, each entry being a rho coefficient xor the value of the resulting sub-state at fuel r+2.
Statement
def spider_none_one_inward_one_outward_raw_opts (r : ℕ) (φ : SpiderLegEnd) : List ℕ- Source
- step towards spider_blocked_none_one_inward_one_outward
- Verified
- 19 Oct 2026
- Axioms
- none listed
- 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_rhoThe function spider_rho takes h : ℕ and delta, phi : SpiderLegEnd, returning h if phi = free; if phi = inward, it returns h % 2 when delta…
- CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
- 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…
- Used by 3
- spider_blocked_none_one_inward_one_outward_opts_eqFor r ≥ 2, φ ≠ free, and assuming the closed form for all smaller levels, the mex of the raw option list equals the mex of the explicit…
- 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 φ.
- spider_blocked_none_one_inward_one_outward_raw_opts_eqFor r ≥ 2 and φ ≠ free, the value of (none;{(1,inward),(1,outward),(r,φ)}) at fuel r+3 is the mex of the raw option list…
Lean source view module on GitHub
/-- The definitionally unfolded option list of the κ₁ state, still containing the sub-state values. -/ def spider_none_one_inward_one_outward_raw_opts (r : ℕ) (φ : SpiderLegEnd) : List ℕ := [ spider_gamma (r + 2) CentreStatus.incoming [(1, SpiderLegEnd.outward), (r, φ)], spider_gamma (r + 2) CentreStatus.outgoing [(1, SpiderLegEnd.inward), (r, φ)], spider_rho (r - 1) SpiderLegEnd.inward φ ^^^ spider_gamma (r + 2) CentreStatus.incoming [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward)], spider_rho (r - 1) SpiderLegEnd.outward φ ^^^ spider_gamma (r + 2) CentreStatus.outgoing [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward)]] ++ (List.range (r - 2)).flatMap (fun i => [ spider_rho (r - 2 - i) SpiderLegEnd.inward φ ^^^ spider_gamma (r + 2) CentreStatus.none [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward), (i + 1, SpiderLegEnd.inward)], spider_rho (r - 2 - i) SpiderLegEnd.outward φ ^^^ spider_gamma (r + 2) CentreStatus.none [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward), (i + 1, SpiderLegEnd.outward)]]) ++ [ spider_rho 0 φ φ ^^^ spider_gamma (r + 2) CentreStatus.none [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.outward), (r - 1, φ)]]