cycle_power_eight_block_active_root_separation
Under the explicit third parent, monotone outer eighths and exact distance15h ownership, distinct roots selecting an A/Z overlap are separated by at least h.
Statement
theorem cycle_power_eight_block_active_root_separation (h : ℕ) (hh : 0 < h) (x : ℤ → ℕ → Bool) (hparent7 : ∀ 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)) (houter : ∀ p : ℤ, (∀ a b : ℕ, a ≤ b → b < 2*h → x p b = true → x p a = true) ∧ (∀ a b : ℕ, 14*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true)) (h15 : ∀ v : ℤ, (range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1) (p : ℤ) (r t u : ℕ) (hr : 0 < r) (ht : t < 2*h) (hu : u < 2*h) (hpA : x p t = true) (hpB : x p (14*h+t) = true) (hrA : x (p+(r : ℤ)) u = true) (hrB : x (p+(r : ℤ)) (14*h+u) = true) : h ≤ 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 2
- cycle_power_eight_block_active_retained_halvesUnder the explicit seven-eighth parent and monotone outer eighths, a root selecting A_t and Z_t retains every first-h and last-h offset.
- cycle_power_exact_pair_uniqueAn exact Boolean long-edge count of one gives a unique owning rooted class.
- Used by 2
- cycle_power_sixteen_block_no_vertical_overlapFor any positive h and Boolean rooted model of radius16h satisfying the explicit Geometry hypotheses (selected endpoints, three parent…
- cycle_power_dyadic_outer_eighth_active_root_separationIn a tight model of radius2^(k+4) with monotone outer eighths and exact rank k ownership, two active seven-eighth roots are separated by…
The proof, explained
The theorem is proved by contradiction: assuming r < h, both roots p and p + r activate their full first and eighth blocks of length h. Along the diagonal line v = p + r, the active pair for root p is located at index r, while the active pair for root p + r is located at index 0. The uniqueness of exact pairs at distance 15h along any diagonal line then forces r = 0, directly contradicting the assumption that r > 0.
Assume for contradiction that r < h.
We proceed by contradiction: assuming ¬(h ≤ r), linear arithmetic implies r < h.
by_contra hnBoth root p and root p + r have active pairs at distance 15h for every index a < h.
Applying cycle_power_eight_block_active_retained_halves to the root p (which has active positions t and 14h + t with t < 2h) shows that for every a < h, x(p, a) = true and x(p, 15h + a) = true. Applying the same lemma to the shifted root p + r (which has active positions u and 14h + u with u < 2h) yields x(p + r, a) = true and x(p + r, 15h + a) = true for all a < h.
uses
cycle_power_eight_block_active_retained_halveshave hpr := cycle_power_eight_block_active_retained_halves h x hparent7 houter p t ht hpA hpB have hrr := cycle_power_eight_block_active_retained_halves h x hparent7 houter (p+(r : ℤ)) u hu hrA hrB
The exact pair hypothesis h15 can be written with offset 16h - h.
For any diagonal v, the arithmetic simplification a + 16h - h = a + 15h allows rewriting the sum in h15 into the exact form required by cycle_power_exact_pair_unique with D = 16h and R = h.
have h15' : ∀ v : ℤ, (range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-h)).toNat) = 1 := by intro v have hi (a : ℕ) : a+16*h-h=a+15*h := by omega simpa only [hi] using h15 v
The offset r must be 0.
We apply cycle_power_exact_pair_unique along the diagonal line v = p + r with parameters D = 16h and R = h. Root p corresponds to index a = r: it satisfies (p + r) - r = p, with x(p, r) = true and x(p, 15h + r) = true (since r < h). Root p + r corresponds to index b = 0: it satisfies (p + r) - 0 = p + r, with x(p + r, 0) = true and x(p + r, 15h) = true (since 0 < h). Uniqueness of the active pair on line v forces r = 0.
uses
cycle_power_exact_pair_unique,add_sub_cancel_right,Nat.cast_zero,sub_zerohave he := cycle_power_exact_pair_unique (16*h) h x h15' (p+(r : ℤ)) r 0 (by omega) hh (by simpa using (hpr r (by omega)).1) (by simpa only [add_sub_cancel_right,show r+16*h-h=15*h+r by omega] using (hpr r (by omega)).2) (by simpa using (hrr 0 hh).1) (by simpa only [Nat.cast_zero,sub_zero,show 0+16*h-h=15*h+0 by omega] using (hrr 0 hh).2)
Contradiction reached.
The conclusion r = 0 contradicts the initial hypothesis hr that 0 < r.
omega
cycle_power_eight_block_active_retained_halves- Under parent conditions and outer eighths monotonicity, if a root p satisfies x(p, t) = true and x(p, 14h + t) = true for some t < 2h, then for every a < h, both x(p, a) = true and x(p, 15h + a) = true.
cycle_power_exact_pair_unique- If along every diagonal line v, exactly one index a < R has both x(v - a, a) = true and x(v - a, a + D - R) = true, then any two such active indices along the same line v must be identical.
add_sub_cancel_right- In an additive group, (a + b) - b = a.
Nat.cast_zero- The natural number 0 coerced into a ring or additive monoid is 0.
sub_zero- Subtracting 0 leaves an element unchanged: a - 0 = 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem cycle_power_eight_block_active_root_separation (h : ℕ) (hh : 0 < h) (x : ℤ → ℕ → Bool) (hparent7 : ∀ 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)) (houter : ∀ p : ℤ, (∀ a b : ℕ, a ≤ b → b < 2*h → x p b = true → x p a = true) ∧ (∀ a b : ℕ, 14*h ≤ a → a ≤ b → b < 16*h → x p a = true → x p b = true)) (h15 : ∀ v : ℤ, (range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1) (p : ℤ) (r t u : ℕ) (hr : 0 < r) (ht : t < 2*h) (hu : u < 2*h) (hpA : x p t = true) (hpB : x p (14*h+t) = true) (hrA : x (p+(r : ℤ)) u = true) (hrB : x (p+(r : ℤ)) (14*h+u) = true) : h ≤ r := by by_contra hn have hpr := cycle_power_eight_block_active_retained_halves h x hparent7 houter p t ht hpA hpB have hrr := cycle_power_eight_block_active_retained_halves h x hparent7 houter (p+(r : ℤ)) u hu hrA hrB have h15' : ∀ v : ℤ, (range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-h)).toNat) = 1 := by intro v have hi (a : ℕ) : a+16*h-h=a+15*h := by omega simpa only [hi] using h15 v have he := cycle_power_exact_pair_unique (16*h) h x h15' (p+(r : ℤ)) r 0 (by omega) hh (by simpa using (hpr r (by omega)).1) (by simpa only [add_sub_cancel_right,show r+16*h-h=15*h+r by omega] using (hpr r (by omega)).2) (by simpa using (hrr 0 hh).1) (by simpa only [Nat.cast_zero,sub_zero,show 0+16*h-h=15*h+0 by omega] using (hrr 0 hh).2) omega