cycle_power_dyadic_model_dvd_of_no_island
theoremverified
A periodic optimally counted tight dyadic class model with proper class labels, exact dyadic edges and full ordinary coverage has period divisible by its radius, provided every class is the union of an initial and terminal interval. The no-island shape assumption is explicit and remains the structural bottleneck.
Statement
theorem cycle_power_dyadic_model_dvd_of_no_island (m n : ℕ) (hm : 2 ≤ m) (hn : 0 < n) (x : ℤ → ℕ → Bool) (ell : ℤ → Fin (m+1)) (hperiod : ∀ p a, x (p+(n : ℤ)) a = x p a) (hell : ∀ p, ell (p+(n : ℤ)) = ell p) (htight : ∀ p, cycle_power_dyadic_class_weight m (x p) = (range (2^m)).sum (fun a => (x p a).toNat)) (hcount : ∀ v : ℤ, (range (2^m)).sum (fun a => (x (v-(a : ℤ)) a).toNat) = m+1) (hexact : ∀ j < m, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^m-2^j)).toNat) = 1) (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^m → ∀ v : ℤ, ∃ a : ℕ, a < 2^m-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true) (hsep : ∀ (v : ℤ) (a b : ℕ), a < 2^m → b < 2^m → a ≠ b → x (v-(a : ℤ)) a = true → x (v-(b : ℤ)) b = true → ell (v-(a : ℤ)) ≠ ell (v-(b : ℤ))) (hshape : ∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < 2^m → x p a = false → x p b = true → x p c = true) : 2^m ∣ n
- Source
- Conditional assembly for OP-205 / RT-1 following arXiv:2610.15635 Section 3. This combines the uniform no-island endpoint-overlap theorem, label-period divisibility, and the central-occurrence argument; no actual-cover shape classification or main covering-number theorem is claimed.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- cycle_power_dyadic_model_dvd_of_endpoint_overlapA periodic optimal dyadic class model whose old active classes intersect the next endpoint class has period divisible by the dyadic…
- cycle_power_dyadic_endpoint_overlap_of_no_islandConjectured local uniform geometry: if all tight dyadic classes are unions of an initial and terminal interval, with arbitrary unequal…
- cycle_power_dyadic_class_weightThe weighted number of pairs in a dyadic arc: the endpoint pair has weight two, and distances 2^m-2^j for 1≤j<m have weight one.
- Used by 1
- simple_graph_equivalence_covering_number_cycle_power_dyadic_of_class_shapeUnder the numerical hypotheses of OP-205, the equivalence covering number is m+2 PROVIDED that every tight, exactly dyadically covered,…
Lean source view module on GitHub
open Finset theorem cycle_power_dyadic_model_dvd_of_no_island (m n : ℕ) (hm : 2 ≤ m) (hn : 0 < n) (x : ℤ → ℕ → Bool) (ell : ℤ → Fin (m+1)) (hperiod : ∀ p a, x (p+(n : ℤ)) a = x p a) (hell : ∀ p, ell (p+(n : ℤ)) = ell p) (htight : ∀ p, cycle_power_dyadic_class_weight m (x p) = (range (2^m)).sum (fun a => (x p a).toNat)) (hcount : ∀ v : ℤ, (range (2^m)).sum (fun a => (x (v-(a : ℤ)) a).toNat) = m+1) (hexact : ∀ j < m, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^m-2^j)).toNat) = 1) (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^m → ∀ v : ℤ, ∃ a : ℕ, a < 2^m-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true) (hsep : ∀ (v : ℤ) (a b : ℕ), a < 2^m → b < 2^m → a ≠ b → x (v-(a : ℤ)) a = true → x (v-(b : ℤ)) b = true → ell (v-(a : ℤ)) ≠ ell (v-(b : ℤ))) (hshape : ∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < 2^m → x p a = false → x p b = true → x p c = true) : 2^m ∣ n := by apply cycle_power_dyadic_model_dvd_of_endpoint_overlap m n hm hn x ell hperiod hell htight hcount hexact hcover hsep exact cycle_power_dyadic_endpoint_overlap_of_no_island m (by omega) x htight hexact hcover hshape