AFTD Auto-Formalizing Theoretical Domains

cycle_power_eight_block_vertical_defect_upper_half

theoremverified

For q=2h, the additional third dyadic parent matching forces any vertical C_t-without-A_t defect to satisfy h<=t. The parent hypotheses are explicit.

Statement

theorem cycle_power_eight_block_vertical_defect_upper_half
    (h : ℕ) (x : ℤ → ℕ → Bool)
    (hparent6 : ∀ p a, a < 4*h →
      (a < 2*h → x p (a+12*h) = true → x p a = true) ∧
      (2*h ≤ a → x p a = true → x p (a+12*h) = true))
    (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))
    (p : ℤ) (t : ℕ) (ht : t < 2*h)
    (hchild : x p (2*h+t) = true) (hmiss : x p t = false) : h ≤ t
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

The proof proceeds by contradiction: assuming $t < h$, we show that $x(p, t)$ must be true, contradicting the assumption that $x(p, t) = \text{false}$. Since $t < h$ guarantees $2h \le 2h + t < 4h$, the forward implication of the parent matching hypothesis `hparent6` applied at $2h + t$ propagates the true value at $2h + t$ to $x(p, t + 14h) = \text{true}$. Then, because $t < h$, the backward implication of the parent matching hypothesis `hparent7` applied at $t$ pulls this truth value back to force $x(p, t) = \text{true}$.

  1. Assume for contradiction that $t < h$.

    We proceed by contradiction: assuming the negation of $h \le t$, linear arithmetic (`omega`) yields $t < h$.

    lines 15–16

      by_contra hn
      have ht' : t < h := by omega
  2. $x(p, t + 14h) = \text{true}$.

    We apply the forward clause of hypothesis `hparent6` at index $a = 2h + t$. The bounds $2h \le 2h + t < 4h$ follow from $t < 2h$. Because $x(p, 2h + t) = \text{true}$ by `hchild`, this clause gives $x(p, (2h + t) + 12h) = \text{true}$. Since $(2h + t) + 12h = t + 14h$, we obtain $x(p, t + 14h) = \text{true}$.

    lines 17–19

      have hB : x p (t+14*h) = true := by
        have hc := (hparent6 p (2*h+t) (by omega)).2 (by omega) hchild
        convert hc using 1 <;> congr 1 <;> omega
  3. A contradiction is reached with the defect assumption that $x(p, t) = \text{false}$.

    We apply the backward clause of hypothesis `hparent7` at index $a = t$, which is valid since $t < 2h$ and $t < h$. Applied to $x(p, t + 14h) = \text{true}$, it deduces that $x(p, t) = \text{true}$. Substituting the hypothesis `hmiss` ($x(p, t) = \text{false}$) results in $\text{false} = \text{true}$, an immediate contradiction.

    lines 20–22

      have hA := (hparent7 p t ht).1 ht' hB
      rw [hmiss] at hA
      contradiction

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_vertical_defect_upper_half    (h : ℕ) (x : ℤ → ℕ → Bool)    (hparent6 : ∀ p a, a < 4*h →      (a < 2*h → x p (a+12*h) = true → x p a = true) ∧      (2*h ≤ a → x p a = true → x p (a+12*h) = true))    (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))    (p : ℤ) (t : ℕ) (ht : t < 2*h)    (hchild : x p (2*h+t) = true) (hmiss : x p t = false) : h ≤ t := by  by_contra hn  have ht' : t < h := by omega  have hB : x p (t+14*h) = true := by    have hc := (hparent6 p (2*h+t) (by omega)).2 (by omega) hchild    convert hc using 1 <;> congr 1 <;> omega  have hA := (hparent7 p t ht).1 ht' hB  rw [hmiss] at hA  contradiction
See it in the graphDiscuss this resultChallenge it