AFTD Auto-Formalizing Theoretical Domains

cycle_power_sixteen_block_outer_quarters_of_upper_vertical

theoremverified

Conditional on upper-half vertical exclusion for every Geometry model at the same h with exact8h ownership, a given such model has BOTH monotone outer quarters. The vertical-exclusion core is explicitly assumed.

Statement

theorem cycle_power_sixteen_block_outer_quarters_of_upper_vertical
    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)
    (hexact4 : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>
      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8*h)).toNat) = 1)
    (hcore : ∀ (y : ℤ → ℕ → Bool), CyclePowerSixteenBlock.Geometry h y →
      (∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>
        (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1) →
      ∀ p t, h ≤ t → t < 2*h → y p (2*h+t) = true → y p t = true) :
    ∀ p : ℤ,
      (∀ a b : ℕ, a ≤ b → b < 4*h → x p b = true → x p a = true) ∧
      (∀ a b : ℕ, 12*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true)
Source
Uniform structural route for OP-205 / RT-1, following arXiv:2610.15635. These are helper reductions, not a proof of the open covering value and not a research advance. The upper-vertical core remains an explicit unproved hypothesis.
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
Used by 1

The proof, explained

The proof establishes monotonicity on both outer quarters of the block by combining a vertical exclusion argument with reflection symmetry. First, vertical exclusion on the upper half $[h, 2h)$ is extended to the entire interval $[0, 2h)$ using the geometry axioms for the lower half $[0, h)$, which implies downward monotonicity on the left quarter $[0, 4h)$ via `cycle_power_sixteen_block_left_quarter_of_no_vertical`. Next, reflecting the model across the full block of length $16h$ produces another geometry model that satisfies the exact sum condition and is therefore downward monotone on its own left quarter. Finally, translating this left-quarter monotonicity of the reflected model back to the original configuration yields upward monotonicity on the right quarter $[12h, 16h)$.

  1. Any geometry model $y$ satisfying the exact $8h$-sum condition has no vertical steps on $[0, 2h)$: if $a < 2h$ and $y(p, 2h+a) = \text{true}$, then $y(p, a) = \text{true}$.

    Given $p$, $a < 2h$, and $y(p, 2h+a) = \text{true}$, we split into cases on whether $a < h$. In the lower case $a < h$, the geometry axiom `childZ` implies $y(p, 14h+a) = \text{true}$, which commutes via `Nat.add_comm` to $y(p, a+14h) = \text{true}$; then `parent7` implies $y(p, a) = \text{true}$. In the upper case $h \le a < 2h$, linear arithmetic confirms $h \le a$, so the core vertical-exclusion hypothesis `hcore` applies directly to give $y(p, a) = \text{true}$.

    lines 15–22

    uses Nat.add_comm

      have nov (y : ℤ → ℕ → Bool) (N : CyclePowerSixteenBlock.Geometry h y)
          (he : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>
            (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1) :
          ∀ p a, a < 2*h → y p (2*h+a) = true → y p a = true := by
        intro p a ha hc
        by_cases hal : a < h
        · exact (N.parent7 p a ha).1 hal (by simpa only [Nat.add_comm] using N.childZ p a ha hc)
        · exact hcore y N he p a (by omega) ha hc
  2. The configuration $x$ is downward monotone on the left quarter: for any $p$, if $a \le b < 4h$ and $x(p, b) = \text{true}$, then $x(p, a) = \text{true}$.

    Applying `cycle_power_sixteen_block_left_quarter_of_no_vertical` to $x$, its geometry model $M$, and the vertical exclusion property established in the previous step specialized to $x$ and `hexact4`, we obtain downward monotonicity on $[0, 4h)$.

    line 23

    uses cycle_power_sixteen_block_left_quarter_of_no_vertical

      have left := cycle_power_sixteen_block_left_quarter_of_no_vertical h x M (nov x M hexact4)
  3. The reflected configuration $y$ is a geometry model satisfying the exact $8h$-sum condition, and is therefore downward monotone on the left quarter $[0, 4h)$.

    We define $y$ by reflecting $x$ across the full block of length $16h$ using `cycle_power_rooted_reflect`. By `cycle_power_sixteen_block_geometry_reflect`, $y$ is a geometry model. Rewriting $a + 16h - 8h = a + 8h$ allows us to apply `cycle_power_rooted_reflect_exact` with $D = 16h$ and $L = 8h$, showing that $y$ also satisfies the exact $8h$-sum condition. Applying the general vertical exclusion to $y$ and invoking `cycle_power_sixteen_block_left_quarter_of_no_vertical` yields downward monotonicity of $y$ on $[0, 4h)$.

    lines 24–33

    uses cycle_power_sixteen_block_geometry_reflect, cycle_power_rooted_reflect_exact, cycle_power_sixteen_block_left_quarter_of_no_vertical

      let y := cycle_power_rooted_reflect (16*h) x
      have N : CyclePowerSixteenBlock.Geometry h y := cycle_power_sixteen_block_geometry_reflect h x M
      have hexact4' : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>
          (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-8*h)).toNat) = 1 := by
        simpa only [show ∀ a : ℕ, a+16*h-8*h=a+8*h by omega] using hexact4
      have ey : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>
          (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1 := by
        simpa only [show ∀ a : ℕ, a+16*h-8*h=a+8*h by omega] using
          cycle_power_rooted_reflect_exact (16*h) (8*h) (by have := M.pos; omega) (by omega) x hexact4'
      have right := cycle_power_sixteen_block_left_quarter_of_no_vertical h y N (nov y N ey)
  4. For any position $p$, the left-quarter monotonicity holds, reducing the remaining goal to upward monotonicity on the right quarter $[12h, 16h)$.

    Fixing an arbitrary coordinate $p$, the left-quarter monotonicity established earlier directly discharges the first conjunct, leaving the right quarter $[12h, 16h)$ as the remaining goal.

    lines 34–35

      intro p
      refine ⟨left p,?_⟩
  5. The configuration $x$ is upward monotone on the right quarter: if $12h \le a \le b < 16h$ and $x(p, a) = \text{true}$, then $x(p, b) = \text{true}$.

    Assume $12h \le a \le b < 16h$ and $x(p, a) = \text{true}$. Under the reflection coordinate $r = -p - (16h - 1)$, the index $a$ reflects to $16h - 1 - a$ and $b$ reflects to $16h - 1 - b$. The inequalities on $a$ and $b$ transform to $16h - 1 - b \le 16h - 1 - a < 4h$. By definition of $y$, the assumption $x(p, a) = \text{true}$ translates to $y(r, 16h - 1 - a) = \text{true}$. Applying the left-quarter downward monotonicity of $y$ gives $y(r, 16h - 1 - b) = \text{true}$, which unfolds and simplifies back to $x(p, b) = \text{true}$.

    lines 36–43

      intro a b ha hab hb hx
      let r := -p-((16*h-1 : ℕ) : ℤ)
      have hy : y r (16*h-1-a) = true := by
        dsimp [y,cycle_power_rooted_reflect,r]
        convert hx using 1 <;> congr 1 <;> have := M.pos <;> omega
      have hz := right r (16*h-1-b) (16*h-1-a) (by omega) (by omega) hy
      dsimp [y,cycle_power_rooted_reflect,r] at hz
      convert hz using 1 <;> congr 1 <;> have := M.pos <;> omega
Nat.add_comm
Addition of natural numbers is commutative: $n + m = m + n$.
cycle_power_sixteen_block_left_quarter_of_no_vertical
In a block geometry model of scale $h$, if there is no vertical step from $2h+a$ to $a$ for any $a < 2h$, then the configuration is downward monotone on the first quarter $[0, 4h)$: whenever $a \le b < 4h$ and the state at $b$ is true, the state at $a$ is also true.
cycle_power_sixteen_block_geometry_reflect
The rooted reflection of length $16h$ of a geometry model with parameter $h$ is also a geometry model with parameter $h$.
cycle_power_rooted_reflect_exact
If a configuration satisfies the exact sum condition of window length $L$ with offset $D - L$, then its rooted reflection of length $D$ satisfies the same exact sum condition.

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

set_option maxHeartbeats 2000000set_option maxRecDepth 10000theorem cycle_power_sixteen_block_outer_quarters_of_upper_vertical    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)    (hexact4 : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8*h)).toNat) = 1)    (hcore : ∀ (y : ℤ → ℕ → Bool), CyclePowerSixteenBlock.Geometry h y →      (∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>        (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1) →      ∀ p t, h ≤ t → t < 2*h → y p (2*h+t) = true → y p t = true) :    ∀ p : ℤ,      (∀ a b : ℕ, a ≤ b → b < 4*h → x p b = true → x p a = true) ∧      (∀ a b : ℕ, 12*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true) := by  have nov (y : ℤ → ℕ → Bool) (N : CyclePowerSixteenBlock.Geometry h y)      (he : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>        (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1) :      ∀ p a, a < 2*h → y p (2*h+a) = true → y p a = true := by    intro p a ha hc    by_cases hal : a < h    · exact (N.parent7 p a ha).1 hal (by simpa only [Nat.add_comm] using N.childZ p a ha hc)    · exact hcore y N he p a (by omega) ha hc  have left := cycle_power_sixteen_block_left_quarter_of_no_vertical h x M (nov x M hexact4)  let y := cycle_power_rooted_reflect (16*h) x  have N : CyclePowerSixteenBlock.Geometry h y := cycle_power_sixteen_block_geometry_reflect h x M  have hexact4' : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-8*h)).toNat) = 1 := by    simpa only [show ∀ a : ℕ, a+16*h-8*h=a+8*h by omega] using hexact4  have ey : ∀ v : ℤ, (Finset.range (8*h)).sum (fun a =>      (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+8*h)).toNat) = 1 := by    simpa only [show ∀ a : ℕ, a+16*h-8*h=a+8*h by omega] using      cycle_power_rooted_reflect_exact (16*h) (8*h) (by have := M.pos; omega) (by omega) x hexact4'  have right := cycle_power_sixteen_block_left_quarter_of_no_vertical h y N (nov y N ey)  intro p  refine ⟨left p,?_⟩  intro a b ha hab hb hx  let r := -p-((16*h-1 : ℕ) : ℤ)  have hy : y r (16*h-1-a) = true := by    dsimp [y,cycle_power_rooted_reflect,r]    convert hx using 1 <;> congr 1 <;> have := M.pos <;> omega  have hz := right r (16*h-1-b) (16*h-1-a) (by omega) (by omega) hy  dsimp [y,cycle_power_rooted_reflect,r] at hz  convert hz using 1 <;> congr 1 <;> have := M.pos <;> omega
See it in the graphDiscuss this resultChallenge it