AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_overlap_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, any overlap A_t,C_t selected and A_s missing for t<s<2^(k+1) forces an upper-half vertical defect at some root:2^k<=a<2^(k+1), C_a selected and A_a missing.

Statement

theorem cycle_power_dyadic_overlap_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 : ℤ) (t s : ℕ) (hts : t < s) (hsq : s < 2^(k+1))
    (hA : x p t = true) (hC : x p (2^(k+1)+t) = true) (hm : x p s = false) :
    ∃ (r : ℤ) (a : ℕ), 2^k ≤ a ∧ a < 2^(k+1) ∧
      x r (2^(k+1)+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 3

The proof, explained

The theorem reduces the problem on a dyadic model of radius 2^(k+4) to an abstract sixteen-block geometry with block size h = 2^k. The dyadic assumptions (tightness, exactness, coverage, and outer monotonicity) are first converted into a sixteen-block geometry structure using `cycle_power_dyadic_sixteen_block_geometry`. Applying the general sixteen-block theorem `cycle_power_sixteen_block_overlap_reaches_upper_vertical` with block size 2^k and simplifying the powers of two yields the required vertical defect.

  1. The boolean configuration x satisfies the sixteen-block geometry axioms with block size h = 2^k.

    The dyadic hypotheses—class tightness (htight), all-rank exactness (hexact), coverage (hcover), and monotone outer eighths (houter)—are assembled via `cycle_power_dyadic_sixteen_block_geometry` into a 16-block geometry M with block parameter 2^k.

    line 20

    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).

    Expanding the exponent using `pow_succ` writes 2^(k+1) as (2^k) * 2, after which linear arithmetic commutes the factors.

    line 21

    uses pow_succ

      have h1 : 2^(k+1)=2*(2^k) := by rw [pow_succ]; omega
  3. There exist a root r and index a with 2^k ≤ a < 2 * (2^k) such that x r (2 * (2^k) + a) = true and x r a = false.

    We apply the vertical defect theorem for 16-block geometries (`cycle_power_sixteen_block_overlap_reaches_upper_vertical`) with block size 2^k. The bound s < 2 * (2^k) follows by linear arithmetic from s < 2^(k+1), and the overlap condition at index 2 * (2^k) + t matches hC after rewriting by 2^(k+1) = 2 * (2^k).

    lines 22–23

    uses cycle_power_sixteen_block_overlap_reaches_upper_vertical

      have ans := cycle_power_sixteen_block_overlap_reaches_upper_vertical (2^k) x M p t s hts (by omega)
        hA (by simpa only [h1] using hC) hm
  4. There exist a root r and index a with 2^k ≤ a < 2^(k+1) such that x r (2^(k+1) + a) = true and x r a = false.

    Rewriting 2 * (2^k) back to 2^(k+1) in the previous result yields the desired upper-half vertical defect.

    line 24

      simpa only [h1] using ans
cycle_power_dyadic_sixteen_block_geometry
A tight dyadic model of radius 2^(k+4) with all-rank exactness, full coverage, and monotone outer eighths induces a sixteen-block geometry with block size 2^k.
cycle_power_sixteen_block_overlap_reaches_upper_vertical
In any sixteen-block geometry with block size h, if a root has an overlap at t < 2*h (both t and 2*h+t are true) and a missing element at s with t < s < 2*h, then there exists a root r and index h ≤ a < 2*h such that 2*h+a is true and a is false.
pow_succ
For any base a and exponent n in a monoid, 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_overlap_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 : ℤ) (t s : ℕ) (hts : t < s) (hsq : s < 2^(k+1))    (hA : x p t = true) (hC : x p (2^(k+1)+t) = true) (hm : x p s = false) :    ∃ (r : ℤ) (a : ℕ), 2^k ≤ a ∧ a < 2^(k+1) ∧      x r (2^(k+1)+a) = true ∧ x r a = 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 ans := cycle_power_sixteen_block_overlap_reaches_upper_vertical (2^k) x M p t s hts (by omega)    hA (by simpa only [h1] using hC) hm  simpa only [h1] using ans
See it in the graphDiscuss this resultChallenge it