AFTD Auto-Formalizing Theoretical Domains

cycle_power_eight_block_extension_at_one

theoremverified

The eight-block extension predicate holds at block size one.

Statement

theorem cycle_power_eight_block_extension_at_one :
    cycle_power_eight_block_extension_at 1
Source
Uniform local structural route for OP-205 / RT-1, following arXiv:2610.15635. The Boolean eight-block extension remains conjectured; the induction result keeps it as an explicit hypothesis. Finite guarded computations are evidence only, and no graph covering value or research advance is claimed.
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

The proof, explained

The predicate `cycle_power_eight_block_extension_at 1` requires showing two monotonicity properties: downward propagation on the interval $[0, 2)$ and upward propagation on $[6, 8)$. At block size $q = 1$, all intermediate hypotheses involving shifts and sums are unneeded, and the result follows solely from the boundary conditions $x(p, 0) = \text{true}$ and $x(p, 7) = \text{true}$. In each interval, the relevant index is either at the boundary (discharged by the boundary hypothesis) or uniquely forced by linear arithmetic to equal the other index, making the implication trivial.

  1. The proof reduces to establishing downward propagation on $\{0, 1\}$ and upward propagation on $\{6, 7\}$.

    We introduce the configuration $x$, the boundary hypothesis $he$ (which states that $x(p, 0) = \text{true}$ and $x(p, 8 \cdot 1 - 1) = \text{true}$ for all $p$), discard the five unused hypotheses, fix $p \in \mathbb{Z}$, and split the goal into the two conjuncts of the conclusion.

    lines 7–8

      intro x he _ _ _ _ _ p
      constructor
  2. If $a \le b < 2$ and $x(p, b) = \text{true}$, then $x(p, a) = \text{true}$.

    Assuming $a \le b < 2$ and $x(p, b) = \text{true}$, we split on whether $a = 0$. If $a = 0$, $x(p, 0) = \text{true}$ is given directly by the first part of the boundary hypothesis $he$. If $a \ne 0$, the constraints $0 < a \le b < 2$ leave only $a = b = 1$, which `omega` solves to deduce $a = b$; substituting $a = b$ transforms the goal into the assumption $x(p, b) = \text{true}$.

    lines 9–13

      · intro a b hab hb hx
        by_cases ha : a=0
        · subst a; exact (he p).1
        · have h : a=b := by omega
          rwa [h]
  3. If $6 \le a \le b < 8$ and $x(p, a) = \text{true}$, then $x(p, b) = \text{true}$.

    Assuming $6 \le a \le b < 8$ and $x(p, a) = \text{true}$, we split on whether $b = 7$. If $b = 7$, the second part of $he$ asserts $x(p, 8 \cdot 1 - 1) = \text{true}$, which simplifies to $x(p, 7) = \text{true}$. If $b \ne 7$, the constraints $6 \le a \le b < 8$ and $b \ne 7$ force $a = b = 6$ by linear arithmetic (`omega`); substituting $b = a$ completes the proof using the assumption $x(p, a) = \text{true}$.

    lines 14–19

      · intro a b ha hab hb hx
        by_cases hlast : b=7
        · subst b
          simpa using (he p).2
        · have h : a=b := by omega
          rwa [← h]

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

open Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem cycle_power_eight_block_extension_at_one :    cycle_power_eight_block_extension_at 1 := by  intro x he _ _ _ _ _ p  constructor  · intro a b hab hb hx    by_cases ha : a=0    · subst a; exact (he p).1    · have h : a=b := by omega      rwa [h]  · intro a b ha hab hb hx    by_cases hlast : b=7    · subst b      simpa using (he p).2    · have h : a=b := by omega      rwa [← h]
See it in the graphDiscuss this resultChallenge it