AFTD Auto-Formalizing Theoretical Domains

spider_blocked_optionvals

def

The explicit options list of the state (in;{(r,β),(1,free)}) at fuel r + 2 after substituting the inductive closed forms: for each cut j = 1,…,r-1 of the blocked leg both end conditions contribute rho(r-j;δ,β) xor spider_blocked_val δ (j-1); the end cut j = r contributes only δ = β, namely spider_blocked_val β (r-1); and cutting the free leg of length 1 contributes spider_rho r outward β and spider_rho_star r β, in that order.

Statement

def spider_blocked_optionvals (r : ℕ) (beta : SpiderLegEnd) : List ℕ
Source
step towards spider_two_leg_blocked_incoming_val
Verified
19 Oct 2026
Axioms
none listed
Built on 4
  • spider_blocked_valThe conjectured closed form of the blocked two-leg family at incoming centre: for end condition inward it is m - 1 when m % 4 = 3 and m +…
  • 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_rho_starThe function spider_rho_star takes h : ℕ and phi : SpiderLegEnd, returning h % 2 if phi = free, and h otherwise.
  • 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_blocked_optionvals_lt_memFor r ≥ 2 and β inward or outward, every k below spider_blocked_val β r occurs in the explicit options list of (in;{(r,β),(1,free)}).
  • spider_blocked_optionvals_not_memFor r ≥ 1 and β inward or outward, the closed-form value spider_blocked_val β r does not occur in the explicit options list of…
  • spider_blocked_optionvals_low_memFor r ≥ 2, β inward or outward, and k + 2 ≤ r, the number k occurs in the explicit options list of (in;{(r,β),(1,free)}).
  • spider_blocked_optionvals_top_memFor r ≥ 1 and β inward or outward, r is in the explicit options list; moreover r-1 is in it when β = inward and r % 4 ≠ 3, and when β =…
  • spider_blocked_optionvals_leFor r ≥ 2 and β ≠ free, every element of the explicit options list of (in;{(r,β),(1,free)}) is at most r.

Lean source view module on GitHub

/-- Explicit option list of (in;{(r,β),(1,free)}) after substituting the closed forms, in the order the recursion generates it. -/
def spider_blocked_optionvals (r : ℕ) (beta : SpiderLegEnd) : List ℕ := (List.range (r - 1)).flatMap (fun idx =>
    let j := idx + 1
    [SpiderLegEnd.inward, SpiderLegEnd.outward].map
      (fun delta => spider_rho (r - j) delta beta ^^^ spider_blocked_val delta (j - 1)))
  ++ [spider_rho 0 beta beta ^^^ spider_blocked_val beta (r - 1)]
  ++ [spider_rho r SpiderLegEnd.outward beta, spider_rho_star r beta]
See it in the graphDiscuss this resultChallenge it