AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_outer_eighth_active_root_separation

theoremverified

In a tight model of radius2^(k+4) with monotone outer eighths and exact rank k ownership, two active seven-eighth roots are separated by at least2^k. No counts, periodicity or other ordinary-coverage hypotheses are needed.

Statement

theorem cycle_power_dyadic_outer_eighth_active_root_separation
    (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 : ∀ v : ℤ, (range (2^k)).sum (fun a =>
      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^k)).toNat) = 1)
    (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 : ℤ) (r t u : ℕ) (hr : 0 < r) (ht : t < 2^(k+1)) (hu : u < 2^(k+1))
    (hpA : x p t = true) (hpB : x p (7*2^(k+1)+t) = true)
    (hrA : x (p+(r : ℤ)) u = true) (hrB : x (p+(r : ℤ)) (7*2^(k+1)+u) = true) :
    2^k ≤ r
Source
Supporting uniform structural route for OP-205 / RT-1 following arXiv:2610.15635. No unconditional shape theorem or main covering result is claimed. No advance flag.
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

The proof, explained

The proof reduces the dyadic active root separation theorem at scale k + 4 to the general 16-block root separation theorem with block size h = 2^k. Under this scaling, the outer eighths have width 2h = 2^(k+1) and the total domain has width 16h = 2^(k+4). Tightness of the dyadic class weight supplies the required outer-eighth parent implication via cycle_power_dyadic_tight_class_parent, and exact rank ownership provides the required rank-15h coverage, enabling cycle_power_eight_block_active_root_separation to conclude that 2^k ≤ r.

  1. With h = 2^k, the outer-eighth scale is 2^(k+1) = 2h and the full scale is 2^(k+4) = 16h.

    We introduce h = 2^k. Using the power identities 2^(k+1) = 2^k * 2 (by pow_succ) and 2^(k+4) = 2^k * 2^4 = 16 * 2^k (by pow_add), elementary arithmetic confirms that 2^(k+1) = 2h and 2^(k+4) = 16h.

    lines 18–20

    uses pow_succ, pow_add

      let h := 2^k
      have hH : 2^(k+1)=2*h := by dsimp [h]; rw [pow_succ]; omega
      have hD : 2^(k+4)=16*h := by rw [show k+4=k+4 by rfl,pow_add]; norm_num; dsimp [h]; omega
  2. For any phase p and index a < 2h, truth at a + 14h implies truth at a when a < h, and truth at a implies truth at a + 14h when h ≤ a.

    We specialize cycle_power_dyadic_tight_class_parent to total scale m = k + 4 and intermediate scale j = k + 1. The tightness condition htight ensures that for every index a < 2^(k+1) = 2h, the parent relation transfers truth between a and a + 2^(k+4) - 2^(k+1). Since 2^(k+4) - 2^(k+1) = 16h - 2h = 14h and the threshold is 2^(k+1-1) = 2^k = h, this yields the desired outer-eighth parent implication hp7.

    lines 21–28

    uses cycle_power_dyadic_tight_class_parent

      have hp7 : ∀ p a, a < 2*h →
          (a < h → x p (a+14*h) = true → x p a = true) ∧
          (h ≤ a → x p a = true → x p (a+14*h) = true) := by
        intro p a ha
        have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+1) (by omega) (by omega) (x p) (htight p)
          a (by omega)
        have hi : a+2^(k+4)-2^(k+1)=a+14*h := by omega
        simpa only [show k+1-1=k by omega,hi] using hp
  3. For every integer diagonal v, the sum over a ∈ [0, h) of the indicator for x(v - a, a) ∧ x(v - a, a + 15h) equals 1.

    The exact rank ownership hypothesis hexact has second index a + 2^(k+4) - 2^k. Since 2^(k+4) - 2^k = 16h - h = 15h and the summation range is [0, 2^k) = [0, h), rewriting this algebraic shift immediately converts hexact into the required rank-15h coverage condition he.

    lines 29–33

      have he : ∀ v : ℤ, (range h).sum (fun a =>
          (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1 := by
        intro v
        have hi (a : ℕ) : a+2^(k+4)-2^k=a+15*h := by dsimp [h] at *; omega
        simpa only [hi] using hexact v
  4. 2^k ≤ r.

    We apply cycle_power_eight_block_active_root_separation with block size h = 2^k. The block size is positive by Nat.two_pow_pos. The monotonicity of the outer eighths in houter translates via 2^(k+1) = 2h, 7 * 2^(k+1) = 14h, and 2^(k+4) = 16h. Together with the parent implication hp7 and the rank-15h coverage he, all hypotheses are met for the two active roots at phases p and p + r, concluding that 2^k = h ≤ r.

    lines 34–38

    uses cycle_power_eight_block_active_root_separation, Nat.two_pow_pos

      apply cycle_power_eight_block_active_root_separation h (Nat.two_pow_pos k) x hp7
        (by simpa only [hH,hD,show 7*(2*h)=14*h by omega] using houter) he p r t u hr
        (by omega) (by omega) hpA _ hrA _
      · simpa only [hH,show 7*(2*h)=14*h by omega] using hpB
      · simpa only [hH,show 7*(2*h)=14*h by omega] using hrB
pow_succ
For any base in a monoid and natural number n, raising to the (n+1)-th power equals the n-th power multiplied by the base.
pow_add
For any base in a monoid and natural numbers m and n, raising to the (m+n)-th power equals the product of the m-th and n-th powers.
cycle_power_dyadic_tight_class_parent
In a dyadic model of scale m whose class weight equals its sum, for any intermediate scale 1 ≤ j < m and index a < 2^j, truth at a + 2^m - 2^j implies truth at a if a < 2^(j-1), and truth at a implies truth at a + 2^m - 2^j if a ≥ 2^(j-1).
Nat.two_pow_pos
For every natural number w, the power 2^w is strictly positive.
cycle_power_eight_block_active_root_separation
In a 16-block configuration with block size h > 0, outer-eighth parent implications, monotone outer eighths, and exact coverage on diagonal rank 15h, any two active roots in the first eighth at distinct phases are separated by at least 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_dyadic_outer_eighth_active_root_separation    (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 : ∀ v : ℤ, (range (2^k)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^k)).toNat) = 1)    (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 : ℤ) (r t u : ℕ) (hr : 0 < r) (ht : t < 2^(k+1)) (hu : u < 2^(k+1))    (hpA : x p t = true) (hpB : x p (7*2^(k+1)+t) = true)    (hrA : x (p+(r : ℤ)) u = true) (hrB : x (p+(r : ℤ)) (7*2^(k+1)+u) = true) :    2^k ≤ r := by  let h := 2^k  have hH : 2^(k+1)=2*h := by dsimp [h]; rw [pow_succ]; omega  have hD : 2^(k+4)=16*h := by rw [show k+4=k+4 by rfl,pow_add]; norm_num; dsimp [h]; omega  have hp7 : ∀ p a, a < 2*h →      (a < h → x p (a+14*h) = true → x p a = true) ∧      (h ≤ a → x p a = true → x p (a+14*h) = true) := by    intro p a ha    have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+1) (by omega) (by omega) (x p) (htight p)      a (by omega)    have hi : a+2^(k+4)-2^(k+1)=a+14*h := by omega    simpa only [show k+1-1=k by omega,hi] using hp  have he : ∀ v : ℤ, (range h).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1 := by    intro v    have hi (a : ℕ) : a+2^(k+4)-2^k=a+15*h := by dsimp [h] at *; omega    simpa only [hi] using hexact v  apply cycle_power_eight_block_active_root_separation h (Nat.two_pow_pos k) x hp7    (by simpa only [hH,hD,show 7*(2*h)=14*h by omega] using houter) he p r t u hr    (by omega) (by omega) hpA _ hrA _  · simpa only [hH,show 7*(2*h)=14*h by omega] using hpB  · simpa only [hH,show 7*(2*h)=14*h by omega] using hrB
See it in the graphDiscuss this resultChallenge it