cycle_power_dyadic_full_prune_root_separation
theoremverified
Two roots whose pruned classes are full must be separated by at least one quarter of the original radius.
Statement
theorem cycle_power_dyadic_full_prune_root_separation (k : ℕ) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (range (2^k)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+2)-2^k)).toNat) = 1) (p : ℤ) (r : ℕ) (hr : 0 < r) (hp : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k (x p) i = true) (hs : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k (x (p+(r : ℤ))) i = true) : 2^k ≤ r
- Source
- Uniform conditional structural lemmas for OP-205 / RT-1 following arXiv:2610.15635 Section 3. The class no-island hypothesis remains explicit; its derivation from an actual optimal covering model is unresolved. No graph covering value or research advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- cycle_power_exact_pair_uniqueAn exact Boolean long-edge count of one gives a unique owning rooted class.
- cycle_power_dyadic_full_prune_outerFullness after middle-quarter pruning means that both outer quarters of the original class are entirely selected.
- cycle_power_dyadic_class_weight_leFor every power-of-two arc length, the dyadic weighted number of selected pairs is at most the number of selected positions.
- Used by 4
- cycle_power_dyadic_no_island_half_owner_orderIn a tight dyadic full-coverage class model with explicit no-island shapes, the root owning the next half-radius edge is at least the root…
- cycle_power_dyadic_no_island_middle_cornerConditional uniform corner law for every cut strictly between one quarter and one half of the dyadic radius, under tight two-interval…
- cycle_power_dyadic_half_owner_order_of_middle_full_pruneIf selected middle bits force full prunes and the retained outer quarters are monotone toward the endpoints, then coverage only at the…
- cycle_power_dyadic_half_monotone_of_middle_full_pruneOne uniform induction step: if all middle marks have full prunes and both retained outer quarters are monotone toward their endpoints,…
Lean source view module on GitHub
open Finset theorem cycle_power_dyadic_full_prune_root_separation (k : ℕ) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (range (2^k)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+2)-2^k)).toNat) = 1) (p : ℤ) (r : ℕ) (hr : 0 < r) (hp : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k (x p) i = true) (hs : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k (x (p+(r : ℤ))) i = true) : 2^k ≤ r := by by_contra hne have hH : 2^(k+1)=2*2^k := by rw [pow_succ]; omega have hD : 2^(k+2)=4*2^k := by rw [show k+2=(k+1)+1 by omega,pow_succ,hH]; omega have ho := cycle_power_dyadic_full_prune_outer k (x p) hp have hs' := cycle_power_dyadic_full_prune_outer k (x (p+(r : ℤ))) hs have he0 : r+2^(k+2)-2^k=r+3*2^k := by omega have he1 : 0+2^(k+2)-2^k=3*2^k := by omega have hd := cycle_power_exact_pair_unique (2^(k+2)) (2^k) x hexact (p+(r : ℤ)) r 0 (by omega) (Nat.two_pow_pos _) (by simpa using ho.1 r (by omega)) (by simpa only [add_sub_cancel_right,he0] using ho.2 (r+3*2^k) (by omega) (by omega)) (by simpa using hs'.1 0 (Nat.two_pow_pos _)) (by simpa only [Nat.cast_zero,sub_zero,he1] using hs'.2 (3*2^k) (by omega) (by omega)) omega