spider_none_one_inward_one_outward_opts
def
The explicit closed-form option list of the state (none;{(1,inward),(1,outward),(r,φ)}) after substituting the sub-state values: the two short-leg options (each r xor 1), the two j = 1 options of the long leg (the pair {0,1} given by spider_rho (r-1) delta φ), the block of options from the cuts j = 2..r-1 of the long leg (rho(r-j) xor (j-1), reindexed with i = j-2), and the last cut j = r, which contributes r-1.
Statement
def spider_none_one_inward_one_outward_opts (r : ℕ) (φ : SpiderLegEnd) : List ℕ- Source
- step towards spider_blocked_none_one_inward_one_outward
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Built on 2
- 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…
- 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 5
- spider_none_one_inward_one_outward_opts_mexFor r ≥ 2 and φ ≠ free, the mex of the explicit option list of the κ₁ configuration equals r.
- spider_none_one_inward_one_outward_opts_all_lt_memFor r ≥ 2 and φ ≠ free, every k < r is a member of the closed-form option list of the κ₁ family.
- spider_none_one_inward_one_outward_opts_not_memFor r ≥ 2 and φ ≠ free, the level r is not a member of the closed-form option list of the κ₁ family.
- 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 φ.
Lean source view module on GitHub
/-- The closed-form option list of the κ₁ blocked family after substituting all sub-state values. -/ def spider_none_one_inward_one_outward_opts (r : ℕ) (φ : SpiderLegEnd) : List ℕ := [r ^^^ 1, r ^^^ 1, spider_rho (r - 1) SpiderLegEnd.inward φ, spider_rho (r - 1) SpiderLegEnd.outward φ] ++ (List.range (r - 2)).flatMap (fun i => [spider_rho (r - 2 - i) SpiderLegEnd.inward φ ^^^ (i + 1), spider_rho (r - 2 - i) SpiderLegEnd.outward φ ^^^ (i + 1)]) ++ [r - 1]