AFTD Auto-Formalizing Theoretical Domains

spider_blocked_leg0_opts

def

The contribution of the blocked leg (r,β) alone to the raw option list of (in;{(r,β),(1,free)}): for each cut j₀ = 0,…,r-1 of that leg, both directions δ, skipping the prohibited end cut j = r with δ ≠ β; cuts with j ≥ 2 give ρ(r-j;δ,β) xor the two-leg sub-state (in;{(j-1,δ),(1,free)}), the j = 1 cut gives ρ(r-1;δ,β) xor the one-leg sub-state (update_centre in δ;{(1,free)}).

Statement

def spider_blocked_leg0_opts (r : ℕ) (beta : SpiderLegEnd) : List ℕ
Source
step towards op211_three_legged_spider_eventual_parity
Verified
08 Nov 2026
Axioms
none listed
Built on 5
  • 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…
  • spider_update_centreThe function spider_update_centre updates centre status s given leg transition delta: if delta is inward, none maps to incoming, incoming…
  • CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
  • 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…
Used by 1
  • spider_blocked_raw_opts_splitThe raw option list of (in;{(r,β),(1,free)}) decomposes as spider_blocked_leg0_opts r β ++ spider_blocked_free_leg_opts r β: the zipIdx…

Lean source view module on GitHub

/-- Options generated by cuts of the blocked leg (r,β) in (in;{(r,β),(1,free)}). -/
def spider_blocked_leg0_opts (r : ℕ) (beta : SpiderLegEnd) : List ℕ := (List.range r).flatMap (fun j_zero =>
    [SpiderLegEnd.inward, SpiderLegEnd.outward].filterMap (fun delta =>
      if j_zero + 1 == r ∧ beta ≠ SpiderLegEnd.free ∧ delta ≠ beta then none
      else
        let d := spider_rho (r - (j_zero + 1)) delta beta
        if j_zero + 1 ≥ 2 then
          some (d ^^^ spider_gamma (r + 1) CentreStatus.incoming [(j_zero, delta), (1, SpiderLegEnd.free)])
        else
          some (d ^^^ spider_gamma (r + 1)
            (spider_update_centre CentreStatus.incoming delta) [(1, SpiderLegEnd.free)])))
See it in the graphDiscuss this resultChallenge it