AFTD Auto-Formalizing Theoretical Domains

cycle_power_sixteen_block_overlap_reaches_upper_vertical

theoremverified

Under the explicit Geometry hypotheses, every overlap A_t,C_t selected and A_s missing with t<s<2h forces some upper-half vertical defect: at another integer root r some h<=a<2h selects C_a but misses A_a.

Statement

theorem cycle_power_sixteen_block_overlap_reaches_upper_vertical
    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)
    (p : ℤ) (t s : ℕ) (hts : t < s) (hsq : s < 2*h)
    (hA : x p t = true) (hC : x p (2*h+t) = true) (hm : x p s = false) :
    ∃ (r : ℤ) (a : ℕ), h ≤ a ∧ a < 2*h ∧ x r (2*h+a) = true ∧ x r a = 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 2
Used by 1

The proof, explained

The proof proceeds by contradiction. Assuming no upper-half vertical defect exists (no h ≤ a < 2*h with x r (2*h+a) = true and x r a = false), any vertical defect below 2*h would have to occur in the lower half (a < h). However, the vertical defect localization theorem cycle_power_eight_block_vertical_defect_upper_half forces any defect below 2*h to satisfy h ≤ a, so no vertical defect can exist anywhere below 2*h. This complete absence of vertical defect contradicts cycle_power_sixteen_block_no_vertical_overlap, which rules out an overlap at t and an unset bit at s with t < s < 2*h.

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

    We proceed by contradiction, assuming that there is no root r and index a with h ≤ a < 2*h such that x r (2*h+a) = true and x r a = false.

    line 10

      by_contra hn
  2. Every index a < 2*h without exception satisfies x r (2*h+a) = true → x r a = true for every root r.

    To establish this property (named nov), fix r and a < 2*h and assume x r (2*h+a) = true. If x r a were not true, it would be false by Bool.eq_false_iff.mpr. Applying cycle_power_eight_block_vertical_defect_upper_half with the parent conditions from M shows that any such defect must satisfy h ≤ a. Together with a < 2*h, this produces an upper-half defect, contradicting the negation hypothesis 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. A contradiction is obtained, completing the proof.

    By cycle_power_sixteen_block_no_vertical_overlap, having no vertical defect below 2*h (the property nov) is incompatible with having an overlap at t and a missing bit at s for t < s < 2*h. Supplying the given hypotheses hA, hC, and hm produces False.

    line 17

    uses cycle_power_sixteen_block_no_vertical_overlap

      exact cycle_power_sixteen_block_no_vertical_overlap h x M nov p t s hts hsq hA hC hm
Bool.eq_false_iff.mpr
A Boolean value that is not true must equal false.
cycle_power_eight_block_vertical_defect_upper_half
Under parent 6 and parent 7 conditions, any vertical defect at index t < 2*h (where the shifted coordinate 2*h+t is true but t is false) must fall in the upper half, h ≤ t.
cycle_power_sixteen_block_no_vertical_overlap
Under the sixteen-block geometry hypotheses, if there is no vertical defect below 2*h, then it is impossible to have an overlap at index t (both t and 2*h+t selected) and a missing entry at index s with t < s < 2*h.

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_overlap_reaches_upper_vertical    (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x)    (p : ℤ) (t s : ℕ) (hts : t < s) (hsq : s < 2*h)    (hA : x p t = true) (hC : x p (2*h+t) = true) (hm : x p s = false) :    ∃ (r : ℤ) (a : ℕ), h ≤ a ∧ a < 2*h ∧ x r (2*h+a) = true ∧ x r a = 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⟩  exact cycle_power_sixteen_block_no_vertical_overlap h x M nov p t s hts hsq hA hC hm
See it in the graphDiscuss this resultChallenge it