AFTD Auto-Formalizing Theoretical Domains

cycle_power_sixteen_block_left_defect_reaches_upper_vertical

theoremverified

Under the Geometry hypotheses, every first-quarter prefix defect (a<=b<4h, position a missing and b selected) forces an upper-half vertical defect at some integer root.

Statement

theorem cycle_power_sixteen_block_left_defect_reaches_upper_vertical
    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)
    (p : ℤ) (a b : ℕ) (hab : a ≤ b) (hb : b < 4*h)
    (hm : x p a = false) (hs : x p b = true) :
    ∃ (r : ℤ) (t : ℕ), h ≤ t ∧ t < 2*h ∧ x r (2*h+t) = true ∧ x r t = false
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 1

The proof, explained

The theorem is proved by contradiction: suppose no upper-half vertical defect exists anywhere. By cycle_power_eight_block_vertical_defect_upper_half, any vertical defect with index below 2h is forced to lie in the upper half [h, 2h), so this assumption implies that no vertical defect can occur anywhere below 2h. By cycle_power_sixteen_block_left_quarter_of_no_vertical, the complete absence of vertical defects below 2h ensures that truth is prefix-closed in the first quarter [0, 4h). Thus x(p, b) = true forces x(p, a) = true for a ≤ b < 4h, directly contradicting the hypothesis that x(p, a) = false.

  1. It suffices to derive a contradiction from the assumption that no upper-half vertical defect exists.

    We begin a proof by contradiction by assuming the negation of the theorem's conclusion: that there exist no root r and index t with h ≤ t < 2h such that x(r, 2h+t) = true and x(r, t) = false (hypothesis hn).

    line 10

      by_contra hn
  2. Under this assumption, no vertical defect can occur at any index below 2h.

    We show that for any root r and index a < 2h, if x(r, 2h+a) = true, then x(r, a) = true (named nov). Assuming for contradiction that x(r, a) ≠ true, Bool.eq_false_iff.mpr yields x(r, a) = false. Lemma cycle_power_eight_block_vertical_defect_upper_half then forces this defect to lie in the upper half, giving h ≤ a. But then (r, a) satisfies h ≤ a < 2h with x(r, 2h+a) = true and x(r, a) = false, which is an upper-half vertical defect, directly contradicting hn.

    lines 11–16

    uses Bool.eq_false_iff.mpr, cycle_power_eight_block_vertical_defect_upper_half

      have nov : ∀ r a, a < 2*h → x r (2*h+a) = true → x r a = true := by
        intro r a ha hc
        by_contra hne
        have hm : x r a = false := Bool.eq_false_iff.mpr hne
        have hah := cycle_power_eight_block_vertical_defect_upper_half h x M.parent6 M.parent7 r a ha hc hm
        exact hn ⟨r,a,hah,ha,hc,hm⟩
  3. The absence of vertical defects contradicts the existence of the prefix defect at p.

    By cycle_power_sixteen_block_left_quarter_of_no_vertical, when there are no vertical defects below 2h, truth in the first quarter is prefix-closed: for any a ≤ b < 4h, x(p, b) = true implies x(p, a) = true. Applying this to the hypotheses a ≤ b, b < 4h, and x(p, b) = true yields x(p, a) = true. Rewriting the hypothesis x(p, a) = false into this deduction produces false = true, an immediate contradiction that concludes the proof.

    lines 17–19

    uses cycle_power_sixteen_block_left_quarter_of_no_vertical

      have hh := cycle_power_sixteen_block_left_quarter_of_no_vertical h x M nov p a b hab hb hs
      rw [hm] at hh
      contradiction
Bool.eq_false_iff.mpr
A boolean value that is not equal to true is equal to false.
cycle_power_eight_block_vertical_defect_upper_half
Under the geometric hypotheses for the eight-block configuration, any vertical defect at index t < 2h (meaning x(p, 2h+t) is true while x(p, t) is false) must lie in the upper half of the range, so h ≤ t.
cycle_power_sixteen_block_left_quarter_of_no_vertical
Under the geometric hypotheses for the sixteen-block configuration, if there are no vertical defects below 2h, then truth is prefix-closed in the first quarter: for any a ≤ b < 4h, if x(p, b) is true then x(p, a) is true.

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_defect_reaches_upper_vertical    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)    (p : ℤ) (a b : ℕ) (hab : a ≤ b) (hb : b < 4*h)    (hm : x p a = false) (hs : x p b = true) :    ∃ (r : ℤ) (t : ℕ), h ≤ t ∧ t < 2*h ∧ x r (2*h+t) = true ∧ x r t = false := by  by_contra hn  have nov : ∀ r a, a < 2*h → x r (2*h+a) = true → x r a = true := by    intro r a ha hc    by_contra hne    have hm : x r a = false := Bool.eq_false_iff.mpr hne    have hah := cycle_power_eight_block_vertical_defect_upper_half h x M.parent6 M.parent7 r a ha hc hm    exact hn ⟨r,a,hah,ha,hc,hm⟩  have hh := cycle_power_sixteen_block_left_quarter_of_no_vertical h x M nov p a b hab hb hs  rw [hm] at hh  contradiction
See it in the graphDiscuss this resultChallenge it