AFTD Auto-Formalizing Theoretical Domains

cycle_power_eight_block_active_retained_halves

theoremverified

Under the explicit seven-eighth parent and monotone outer eighths, a root selecting A_t and Z_t retains every first-h and last-h offset.

Statement

theorem cycle_power_eight_block_active_retained_halves
    (h : ℕ) (x : ℤ → ℕ → Bool)
    (hparent7 : ∀ p a, a < 2*h →
      (a < h → x p (a+14*h) = true → x p a = true) ∧
      (h ≤ a → x p a = true → x p (a+14*h) = true))
    (houter : ∀ p : ℤ,
      (∀ a b : ℕ, a ≤ b → b < 2*h → x p b = true → x p a = true) ∧
      (∀ a b : ℕ, 14*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true))
    (p : ℤ) (t : ℕ) (ht : t < 2*h)
    (hA : x p t = true) (hB : x p (14*h+t) = true) :
    ∀ a < h, x p a = true ∧ x p (15*h+a) = true
Source
Supporting uniform structural route for OP-205 / RT-1 following arXiv:2610.15635. No unconditional shape theorem or main covering result is claimed. No advance flag.
Verified
28 Oct 2026
Axioms
Quot.soundpropext
Used by 2

The proof, explained

To show that every offset $a < h$ retains activity at both $a$ and $15h + a$, we first establish an auxiliary property: by upward monotonicity on $[14h, 16h)$, the assumed activity at $14h + t$ propagates forward to all offsets $b + 14h$ with $t \le b < 2h$. For the first half $x(p, a)$, if $a \le t$, activity propagates downward from $t$ by monotonicity on $[0, 2h)$; if $a > t$, the auxiliary property gives activity at $a + 14h$, which the parent relation transfers down to $a$. For the second half $x(p, 15h + a) = x(p, (h + a) + 14h)$, if $t \le h + a$, activity follows immediately from the auxiliary property; if $h + a < t$, downward monotonicity gives activity at $h + a$, which the parent relation transfers up to $(h + a) + 14h$.

  1. Fix an arbitrary offset $a < h$.

    We introduce the arbitrary offset $a$ and the assumption $a < h$, reducing the goal to showing $x(p, a) = \text{true} \wedge x(p, 15h + a) = \text{true}$.

    line 16

      intro a ha
  2. For any offset $b$ with $t \le b < 2h$, the shifted offset is active: $x(p, b + 14h) = \text{true}$.

    We establish an auxiliary property `hb`. Because $t < 2h$ and $t \le b < 2h$, linear arithmetic verifies the bounds $14h \le 14h + t \le b + 14h < 16h$. By upward monotonicity of $x(p, \cdot)$ on the upper interval $[14h, 16h)$ (the second clause of `houter`) starting from the hypothesis `hB` that $x(p, 14h + t) = \text{true}$ (using `Nat.add_comm` to commute the addition), we conclude $x(p, b + 14h) = \text{true}$.

    lines 17–19

    uses Nat.add_comm

      have hb (b : ℕ) (hab : t ≤ b) (hb : b < 2*h) : x p (b+14*h) = true := by
        apply (houter p).2 (14*h+t) (b+14*h) (by omega) (by omega) (by omega)
        simpa only [Nat.add_comm t (14*h)] using hB
  3. The first conjunct holds: $x(p, a) = \text{true}$.

    We split the goal into two conjuncts with `constructor` and address the first by case analysis on whether $a \le t$: - If $a \le t$, then since $t < 2h$ and $x(p, t) = \text{true}$ (`hA`), downward monotonicity on the lower interval $[0, 2h)$ (the first clause of `houter`) immediately implies $x(p, a) = \text{true}$. - If $a > t$, then $t \le a < 2h$ (since $a < h < 2h$), so our auxiliary property `hb` gives $x(p, a + 14h) = \text{true}$. Because $a < h$, the first clause of the parent condition `hparent7` transfers activity back down to $a$, giving $x(p, a) = \text{true}$.

    lines 20–23

      constructor
      · by_cases hat : a ≤ t
        · exact (houter p).1 a t hat ht hA
        · exact (hparent7 p a (by omega)).1 ha (hb a (by omega) (by omega))
  4. The second conjunct holds: $x(p, 15h + a) = \text{true}$.

    For the second conjunct, we first rewrite the index $15h + a$ as $(h + a) + 14h$ using linear arithmetic. We then branch on whether $t \le h + a$: - If $t \le h + a$, then since $a < h$ we have $h + a < 2h$. The auxiliary property `hb` applied at $b = h + a$ directly yields $x(p, (h + a) + 14h) = \text{true}$. - If $h + a < t$, then since $t < 2h$, downward monotonicity on $[0, 2h)$ gives $x(p, h + a) = \text{true}$ from $x(p, t) = \text{true}$ (`hA`). Because $h \le h + a < 2h$, the second clause of `hparent7` transfers this activity forward by $14h$, showing $x(p, (h + a) + 14h) = \text{true}$.

    lines 24–29

      · have hi : 15*h+a=(h+a)+14*h := by omega
        rw [hi]
        by_cases hta : t ≤ h+a
        · exact hb (h+a) hta (by omega)
        · exact (hparent7 p (h+a) (by omega)).2 (by omega)
            ((houter p).1 (h+a) t (by omega) ht hA)
Nat.add_comm
Addition of natural numbers is commutative: $n + m = m + n$ for all $n, m \in \mathbb{N}$.

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_active_retained_halves    (h : ℕ) (x : ℤ → ℕ → Bool)    (hparent7 : ∀ p a, a < 2*h →      (a < h → x p (a+14*h) = true → x p a = true) ∧      (h ≤ a → x p a = true → x p (a+14*h) = true))    (houter : ∀ p : ℤ,      (∀ a b : ℕ, a ≤ b → b < 2*h → x p b = true → x p a = true) ∧      (∀ a b : ℕ, 14*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true))    (p : ℤ) (t : ℕ) (ht : t < 2*h)    (hA : x p t = true) (hB : x p (14*h+t) = true) :    ∀ a < h, x p a = true ∧ x p (15*h+a) = true := by  intro a ha  have hb (b : ℕ) (hab : t ≤ b) (hb : b < 2*h) : x p (b+14*h) = true := by    apply (houter p).2 (14*h+t) (b+14*h) (by omega) (by omega) (by omega)    simpa only [Nat.add_comm t (14*h)] using hB  constructor  · by_cases hat : a ≤ t    · exact (houter p).1 a t hat ht hA    · exact (hparent7 p a (by omega)).1 ha (hb a (by omega) (by omega))  · have hi : 15*h+a=(h+a)+14*h := by omega    rw [hi]    by_cases hta : t ≤ h+a    · exact hb (h+a) hta (by omega)    · exact (hparent7 p (h+a) (by omega)).2 (by omega)        ((houter p).1 (h+a) t (by omega) ht hA)
See it in the graphDiscuss this resultChallenge it