AFTD Auto-Formalizing Theoretical Domains

spider_blocked_free_leg_opts

def

The contribution of the free leg (1,free) alone to the raw option list of (in;{(r,β),(1,free)}): the unique cut j = 1 with direction δ (never skipped, since φ = free) gives ρ(0;δ,free) xor the one-leg sub-state (update_centre in δ;{(r,β)}).

Statement

def spider_blocked_free_leg_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…
  • 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…
  • spider_update_centreThe function spider_update_centre updates centre status s given leg transition delta: if delta is inward, none maps to incoming, incoming…
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 the cut of the free leg (1,free) in (in;{(r,β),(1,free)}). -/
def spider_blocked_free_leg_opts (r : ℕ) (beta : SpiderLegEnd) : List ℕ := [SpiderLegEnd.inward, SpiderLegEnd.outward].filterMap (fun delta =>
    some (spider_rho 0 delta SpiderLegEnd.free ^^^
      spider_gamma (r + 1) (spider_update_centre CentreStatus.incoming delta) [(r, beta)]))
See it in the graphDiscuss this resultChallenge it