AFTD Auto-Formalizing Theoretical Domains

cycle_power_sixteen_block_left_quarter_of_no_vertical

theoremverified

Under the Geometry hypotheses and the global no-vertical condition C_t implies A_t, every first quarter of length4h is a selected initial segment. No right-quarter or count-preservation conclusion is asserted.

Statement

theorem cycle_power_sixteen_block_left_quarter_of_no_vertical
    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)
    (nov : ∀ p a, a < 2*h → x p (2*h+a) = true → x p a = true) :
    ∀ (p : ℤ) (a b : ℕ), a ≤ b → b < 4*h → x p b = true → x p a = true
Source
Uniform structural reduction for OP-205 / RT-1 following arXiv:2610.15635. The main covering theorem and vertical-defect exclusion remain open. Experiments8048/8049 suggested the two ordinary distances; the proof is uniform in h and uses Lean only. No advance flag.
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
Used by 2

The proof, explained

To show that the configuration is downwards-closed on the first quarter [0, 4h), the proof splits on the location of b. If b < 2h, the result follows immediately from monotonicity on the first eighth [0, 2h). If b ≥ 2h, b is represented as 2h + t with t < 2h: then if a < 2h, the active cell at 2h + t forces the entire first eighth to be true; while if a ≥ 2h, monotonicity within the second eighth [2h, 4h) concludes the proof.

  1. If b < 2h, then x(p, a) = true.

    Fix a position p ∈ ℤ and indices a ≤ b < 4h with x(p, b) = true. We split into cases on whether b < 2h. When b < 2h, both a and b lie in the first eighth [0, 2h), so lower monotonicity (M.lowMono) from the geometry hypothesis immediately yields x(p, a) = true.

    lines 9–11

    uses M.lowMono

      intro p a b hab hb hx
      by_cases hbq : b < 2*h
      · exact M.lowMono p a b hab hbq hx
  2. When b ≥ 2h, setting t = b - 2h gives t < 2h and x(p, 2h + t) = true.

    In the remaining case where b ≥ 2h, we decompose b into the offset t = b - 2h in the second eighth [2h, 4h). Because b < 4h, we have t < 2h. Moreover, 2h + t = b, so x(p, 2h + t) = x(p, b) = true.

    lines 12–14

      · let t := b-2*h
        have ht : t < 2*h := by dsimp [t]; omega
        have hc : x p (2*h+t) = true := by convert hx using 1 <;> congr 1 <;> dsimp [t] <;> omega
  3. If a < 2h, then x(p, a) = true.

    We split into subcases on whether a < 2h. If a < 2h, the fact that an active cell exists at offset t in the second eighth (x(p, 2h + t) = true) forces the entire prefix [0, 2h) to be true, by cycle_power_sixteen_block_child_forces_full_prefix. Since a < 2h, it follows that x(p, a) = true.

    lines 15–16

    uses cycle_power_sixteen_block_child_forces_full_prefix

        by_cases haq : a < 2*h
        · exact cycle_power_sixteen_block_child_forces_full_prefix h x M nov p t ht hc a haq
  4. If a ≥ 2h, then x(p, a) = true.

    If instead a ≥ 2h, then both a and b fall into the second eighth [2h, 4h). The offset u = a - 2h satisfies u ≤ t < 2h since a ≤ b. By monotonicity within the second eighth (cycle_power_sixteen_block_second_eighth_monotone), x(p, 2h + u) = true. Because 2h + u = a, this establishes x(p, a) = true.

    lines 17–19

    uses cycle_power_sixteen_block_second_eighth_monotone

        · have hu : a-2*h ≤ t := by dsimp [t]; omega
          have hh := cycle_power_sixteen_block_second_eighth_monotone h x M nov p (a-2*h) t hu ht hc
          convert hh using 1 <;> congr 1 <;> omega
M.lowMono
If a ≤ b < 2h and x(p, b) = true, then x(p, a) = true; that is, the configuration is downwards-closed on the first eighth [0, 2h).
cycle_power_sixteen_block_child_forces_full_prefix
If t < 2h and x(p, 2h + t) = true, then for all s < 2h, x(p, s) = true; that is, an active cell in the second eighth forces the entire first eighth to be true.
cycle_power_sixteen_block_second_eighth_monotone
If u ≤ t < 2h and x(p, 2h + t) = true, then x(p, 2h + u) = true; that is, the configuration is downwards-closed within the second eighth [2h, 4h).

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_sixteen_block_left_quarter_of_no_vertical    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)    (nov : ∀ p a, a < 2*h → x p (2*h+a) = true → x p a = true) :    ∀ (p : ℤ) (a b : ℕ), a ≤ b → b < 4*h → x p b = true → x p a = true := by  intro p a b hab hb hx  by_cases hbq : b < 2*h  · exact M.lowMono p a b hab hbq hx  · let t := b-2*h    have ht : t < 2*h := by dsimp [t]; omega    have hc : x p (2*h+t) = true := by convert hx using 1 <;> congr 1 <;> dsimp [t] <;> omega    by_cases haq : a < 2*h    · exact cycle_power_sixteen_block_child_forces_full_prefix h x M nov p t ht hc a haq    · have hu : a-2*h ≤ t := by dsimp [t]; omega      have hh := cycle_power_sixteen_block_second_eighth_monotone h x M nov p (a-2*h) t hu ht hc      convert hh using 1 <;> congr 1 <;> omega
See it in the graphDiscuss this resultChallenge it