AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_left_defect_reaches_upper_vertical

theoremverified

In any tight dyadic rooted model of radius2^(k+4) with all-rank exactness, full ordinary coverage and monotone outer eighths, every first-quarter prefix defect a<=b<2^(k+2) forces some upper-half vertical defect: at a root r some2^k<=t<2^(k+1) has offset2^(k+1)+t selected but t missing. This is a structural reduction; it does not exclude that defect or settle OP-205.

Statement

theorem cycle_power_dyadic_left_defect_reaches_upper_vertical
    (k : ℕ) (x : ℤ → ℕ → Bool)
    (htight : ∀ p, cycle_power_dyadic_class_weight (k+4) (x p) =
      (range (2^(k+4))).sum (fun a => (x p a).toNat))
    (hexact : ∀ j < k+4, ∀ v : ℤ, (range (2^j)).sum (fun a =>
      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^j)).toNat) = 1)
    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(k+4) → ∀ v : ℤ,
      ∃ a : ℕ, a < 2^(k+4)-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true)
    (houter : ∀ p : ℤ,
      (∀ a b : ℕ, a ≤ b → b < 2^(k+1) → x p b = true → x p a = true) ∧
      (∀ a b : ℕ, 7*2^(k+1) ≤ a → a ≤ b → b < 2^(k+4) → x p a = true → x p b = true))
    (p : ℤ) (a b : ℕ) (hab : a ≤ b) (hb : b < 2^(k+2))
    (hm : x p a = false) (hs : x p b = true) :
    ∃ (r : ℤ) (t : ℕ), 2^k ≤ t ∧ t < 2^(k+1) ∧ x r (2^(k+1)+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

The proof, explained

The proof reduces the dyadic defect propagation problem to a 16-block geometric framework with block size h = 2^k. Using the dyadic hypotheses at radius 2^(k+4) = 16 * 2^k, it constructs a 16-block geometry via cycle_power_dyadic_sixteen_block_geometry. It then applies cycle_power_sixteen_block_left_defect_reaches_upper_vertical to transfer the prefix defect to an upper-vertical defect, and rewrites 2 * 2^k back to 2^(k+1) to conclude.

  1. The configuration x forms a 16-block geometry with block size h = 2^k.

    We invoke cycle_power_dyadic_sixteen_block_geometry to package the dyadic hypotheses (tightness, exactness, coverage, and outer monotonicity) at radius 2^(k+4) into a 16-block geometric structure M with block size 2^k.

    line 19

    uses cycle_power_dyadic_sixteen_block_geometry

      have M := cycle_power_dyadic_sixteen_block_geometry k x htight hexact hcover houter
  2. 2^(k+1) = 2 * 2^k and 2^(k+2) = 4 * 2^k.

    Using the exponent successor lemma pow_succ and linear arithmetic (omega), we express the dyadic powers 2^(k+1) and 2^(k+2) as multiples 2 * 2^k and 4 * 2^k of the fundamental block size 2^k.

    lines 20–21

    uses pow_succ

      have h1 : 2^(k+1)=2*(2^k) := by rw [pow_succ]; omega
      have h2 : 2^(k+2)=4*(2^k) := by rw [show k+2=(k+1)+1 by omega,pow_succ,h1]; omega
  3. There exist a row r and an offset t with 2^k ≤ t < 2 * 2^k such that x(r, 2 * 2^k + t) = true and x(r, t) = false.

    We apply the 16-block theorem cycle_power_sixteen_block_left_defect_reaches_upper_vertical with block size h = 2^k and geometry M to the assumed first-quarter defect on row p. The precondition b < 4 * 2^k is discharged by linear arithmetic (omega) from the assumption b < 2^(k+2) and h2.

    lines 22–23

    uses cycle_power_sixteen_block_left_defect_reaches_upper_vertical

      have ans := cycle_power_sixteen_block_left_defect_reaches_upper_vertical (2^k) x M p a b hab
        (by omega) hm hs
  4. There exist a row r and an offset t with 2^k ≤ t < 2^(k+1) such that x(r, 2^(k+1) + t) = true and x(r, t) = false.

    Rewriting the term 2 * 2^k to 2^(k+1) using h1 in the existential statement ans completes the proof.

    line 24

      simpa only [h1] using ans
cycle_power_sixteen_block_left_defect_reaches_upper_vertical
In a 16-block geometry with block size h, any prefix defect a ≤ b < 4h on row p with x(p, a) = false and x(p, b) = true implies the existence of a row r and offset h ≤ t < 2h such that x(r, 2h + t) = true and x(r, t) = false.
cycle_power_dyadic_sixteen_block_geometry
Under the dyadic conditions of tightness, exactness, coverage, and outer monotonicity at radius 2^(k+4), the system forms a 16-block geometry with block size h = 2^k.
pow_succ
For any element a of a monoid and natural exponent n, a^(n+1) = a^n * a.

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_dyadic_left_defect_reaches_upper_vertical    (k : ℕ) (x : ℤ → ℕ → Bool)    (htight : ∀ p, cycle_power_dyadic_class_weight (k+4) (x p) =      (range (2^(k+4))).sum (fun a => (x p a).toNat))    (hexact : ∀ j < k+4, ∀ v : ℤ, (range (2^j)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^j)).toNat) = 1)    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(k+4) → ∀ v : ℤ,      ∃ a : ℕ, a < 2^(k+4)-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true)    (houter : ∀ p : ℤ,      (∀ a b : ℕ, a ≤ b → b < 2^(k+1) → x p b = true → x p a = true) ∧      (∀ a b : ℕ, 7*2^(k+1) ≤ a → a ≤ b → b < 2^(k+4) → x p a = true → x p b = true))    (p : ℤ) (a b : ℕ) (hab : a ≤ b) (hb : b < 2^(k+2))    (hm : x p a = false) (hs : x p b = true) :    ∃ (r : ℤ) (t : ℕ), 2^k ≤ t ∧ t < 2^(k+1) ∧ x r (2^(k+1)+t) = true ∧ x r t = false := by  have M := cycle_power_dyadic_sixteen_block_geometry k x htight hexact hcover houter  have h1 : 2^(k+1)=2*(2^k) := by rw [pow_succ]; omega  have h2 : 2^(k+2)=4*(2^k) := by rw [show k+2=(k+1)+1 by omega,pow_succ,h1]; omega  have ans := cycle_power_sixteen_block_left_defect_reaches_upper_vertical (2^k) x M p a b hab    (by omega) hm hs  simpa only [h1] using ans
See it in the graphDiscuss this resultChallenge it