cycle_power_dyadic_full_prune_outer
theoremverified
Fullness after middle-quarter pruning means that both outer quarters of the original class are entirely selected.
Statement
theorem cycle_power_dyadic_full_prune_outer
(k : ℕ) (b : ℕ → Bool)
(hfull : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k b i = true) :
(∀ i < 2^k, b i = true) ∧
(∀ i, 3*2^k ≤ i → i < 2^(k+2) → b i = true)- 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
Quot.soundpropext- Built on 1
- 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 5
- 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_full_prune_root_separationTwo roots whose pruned classes are full must be separated by at least one quarter of the original radius.
- 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_no_island_no_long_prefixConditional shape-model half-width theorem: a class with an initial selected interval extending strictly beyond half the radius cannot…
- 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_outer (k : ℕ) (b : ℕ → Bool) (hfull : ∀ i < 2^(k+1), cycle_power_dyadic_b_lift k b i = true) : (∀ i < 2^k, b i = true) ∧ (∀ i, 3*2^k ≤ i → i < 2^(k+2) → b i = true) := by 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 constructor · intro i hi have hh := hfull i (by omega) dsimp [cycle_power_dyadic_b_lift] at hh rwa [if_pos hi] at hh · intro i hi0 hi1 have hh := hfull (i-2^(k+1)) (by omega) dsimp [cycle_power_dyadic_b_lift] at hh rw [if_neg (by omega)] at hh have he : i-2^(k+1)+2^(k+1)=i := by omega rwa [he] at hh