AFTD Auto-Formalizing Theoretical Domains

spider_blocked_outgoing_one_inward

theoremverified

For the mirror configuration (out;{(1,inward)}), the blocked family at level r equals r xor 1 for every r ≥ 1 and both far ends φ.

Statement

theorem spider_blocked_outgoing_one_inward (r : ℕ) (hr : 1 ≤ r) (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) :
    spider_gamma (r + 2) CentreStatus.outgoing [(1, SpiderLegEnd.inward), (r, φ)] = r ^^^ 1
Source
step towards spider_blocked_none_one_inward_one_outward
Verified
20 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
  • spider_gamma_reversalFor every fuel, centre status s and leg list L, the value of the spider state (s;L) equals the value of the state obtained by exchanging…
  • spider_blocked_incoming_one_outwardFor the configuration κ₂ = (in;{(1,outward)}), the blocked family V^φ_κ₂(r) equals r xor 1 for every r ≥ 1 and both φ.
  • spider_reverse_leg_endThe reversal of a spider leg end: free is fixed, inward and outward are exchanged.
  • spider_reverse_centre_statusThe reversal of a centre status: none and free are fixed, incoming and outgoing are exchanged.
  • 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_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
Used by 2

The proof, explained

The theorem is proved by applying the reversal symmetry of the spider game to reduce the outgoing configuration to an equivalent incoming configuration. Under reversal, the outgoing centre becomes incoming, the first leg (1, inward) becomes (1, outward), and the second leg becomes (r, rev(φ)). The result then follows directly from the dual theorem spider_blocked_incoming_one_outward, after verifying by case analysis that reversing a non-free leg end produces another non-free leg end.

  1. By reversal symmetry, the Grundy value of the outgoing configuration equals that of an incoming configuration with reversed leg orientations: legs (1, spider_reverse_leg_end inward) and (r, spider_reverse_leg_end φ).

    Rewriting with `spider_gamma_reversal` asserts that inverting both the centre status and every leg end orientation preserves the Grundy value. Simplifying the reversed centre status transforms `outgoing` into `incoming`, and evaluating `List.map` across the two-element list applies `spider_reverse_leg_end` to each leg end.

    lines 4–5

    uses spider_gamma_reversal, spider_reverse_centre_status, List.map_cons, List.map_nil

      rw [spider_gamma_reversal]
      simp only [spider_reverse_centre_status, List.map_cons, List.map_nil]
  2. The configuration evaluates to r ⊕ 1.

    Since `spider_reverse_leg_end inward` is definitionally `outward`, the configuration matches the known dual theorem `spider_blocked_incoming_one_outward` for incoming centres with leg end `spider_reverse_leg_end φ`. The side condition that this reversed leg end is not `free` is verified by case analysis on φ: φ cannot be `free` by hypothesis hφ, and if φ is `inward` or `outward`, its reversal is `outward` or `inward`, neither of which is `free`.

    line 6

    uses spider_blocked_incoming_one_outward, spider_reverse_leg_end

      exact spider_blocked_incoming_one_outward r hr (spider_reverse_leg_end φ) (by cases φ <;> simp_all [spider_reverse_leg_end])
spider_gamma_reversal
Reversing the centre status and the orientation of every leg end preserves the Grundy value γ of a spider game configuration.
spider_reverse_centre_status
The function mapping `outgoing` to `incoming`, `incoming` to `outgoing`, and leaving other centre statuses unchanged.
List.map_cons
Mapping a function over a non-empty list applies it to the head and recurses on the tail.
List.map_nil
Mapping a function over the empty list yields the empty list.
spider_blocked_incoming_one_outward
For an incoming centre with legs (1, outward) and (r, φ) where r ≥ 1 and φ ≠ free, the Grundy value γ at level r + 2 is r ⊕ 1.
spider_reverse_leg_end
The function mapping `inward` to `outward`, `outward` to `inward`, and fixing `free`.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The reversal of the κ₂ blocked family (out;{(1,inward)}) equals r xor 1. -/theorem spider_blocked_outgoing_one_inward (r : ℕ) (hr : 1 ≤ r) (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) :    spider_gamma (r + 2) CentreStatus.outgoing [(1, SpiderLegEnd.inward), (r, φ)] = r ^^^ 1 := by  rw [spider_gamma_reversal]  simp only [spider_reverse_centre_status, List.map_cons, List.map_nil]  exact spider_blocked_incoming_one_outward r hr (spider_reverse_leg_end φ) (by cases φ <;> simp_all [spider_reverse_leg_end])
See it in the graphDiscuss this resultChallenge it