cycle_power_dyadic_class_no_island_iff_end_shell_fullness
In any tight exact full-coverage dyadic class model, two-end-interval/no-island shape is equivalent to this explicit condition on the original profile at every scale: selecting either member of a reflected dyadic shell fills both smaller end blocks. Neither side is derived here from optimal counts.
Statement
theorem cycle_power_dyadic_class_no_island_iff_end_shell_fullness (M : ℕ) (x : ℤ → ℕ → Bool) (htight : ∀ p, cycle_power_dyadic_class_weight (M+1) (x p) = (range (2^(M+1))).sum (fun a => (x p a).toNat)) (hexact : ∀ j < M+1, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(M+1)-2^j)).toNat) = 1) (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(M+1) → ∀ v : ℤ, ∃ c : ℕ, c < 2^(M+1)-d ∧ x (v-(c : ℤ)) c = true ∧ x (v-(c : ℤ)) (c+d) = true) : (∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < 2^(M+1) → x p a = false → x p b = true → x p c = true) ↔ (∀ r < M, ∀ (p : ℤ) (a : ℕ), 2^r ≤ a → a < 2^(r+1) → (x p a = true ∨ x p (2^(M+1)-1-a) = true) → ∀ i < 2^r, x p i = true ∧ x p (2^(M+1)-1-i) = true)
- Source
- Uniform structural characterization for OP-205 / RT-1 following arXiv:2610.15635 Section 3. This combines the checked direct-projection reduction and the converse middle-fullness argument; it does not settle optimal-count shape or the original graph covering number.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- cycle_power_dyadic_end_shell_fullness_of_no_islandConversely, no-island shape in a tight exact full-coverage dyadic model forces both complete dyadic end blocks whenever either next-shell…
- cycle_power_dyadic_no_island_of_end_shell_fullnessIn a tight exact full-coverage model, class no-island shape follows from the explicit shell condition: selecting either offset a or its…
- 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.
The proof, explained
The proof establishes the logical equivalence by splitting it into forward and reverse implications, each of which has been established previously as a separate theorem. In the forward direction, assuming the no-island shape condition, end-shell fullness is deduced via cycle_power_dyadic_end_shell_fullness_of_no_island. In the reverse direction, assuming end-shell fullness, the no-island shape condition is deduced via cycle_power_dyadic_no_island_of_end_shell_fullness under the same model hypotheses of tightness, exactness, and coverage.
The no-island condition implies end-shell fullness across all dyadic scales.
To establish the equivalence, we split the if-and-only-if statement into two implications and first prove the forward direction. Assuming the no-island condition hs (that no false value precedes a true value which then precedes another false value), the lemma cycle_power_dyadic_end_shell_fullness_of_no_island deduces that choosing any element of a reflected dyadic shell forces both smaller end blocks to be full, using the model hypotheses of tightness (htight), exactness (hexact), and coverage (hcover).
uses
cycle_power_dyadic_end_shell_fullness_of_no_islandconstructor · intro hs exact cycle_power_dyadic_end_shell_fullness_of_no_island M x htight hexact hcover hs
Conversely, end-shell fullness implies the no-island condition.
In the reverse direction, assuming the end-shell fullness hypothesis hs, the lemma cycle_power_dyadic_no_island_of_end_shell_fullness deduces that the configuration profile satisfies the no-island condition, again relying on the tightness, exactness, and coverage hypotheses.
uses
cycle_power_dyadic_no_island_of_end_shell_fullness· intro hs exact cycle_power_dyadic_no_island_of_end_shell_fullness M x htight hexact hcover hs
cycle_power_dyadic_end_shell_fullness_of_no_island- In a tight, exact, and fully covering dyadic class model, if the configuration satisfies the no-island condition (for any p and any a < b < c < 2^(M+1), x(p, a) = false and x(p, b) = true implies x(p, c) = true), then it satisfies end-shell fullness: for any scale r < M, p ∈ ℤ, and a ∈ [2^r, 2^(r+1)), having either x(p, a) = true or x(p, 2^(M+1)-1-a) = true implies x(p, i) = true and x(p, 2^(M+1)-1-i) = true for all i < 2^r.
cycle_power_dyadic_no_island_of_end_shell_fullness- In a tight, exact, and fully covering dyadic class model, if the configuration satisfies end-shell fullness (for any scale r < M, p ∈ ℤ, and a ∈ [2^r, 2^(r+1)), having either x(p, a) = true or x(p, 2^(M+1)-1-a) = true implies x(p, i) = true and x(p, 2^(M+1)-1-i) = true for all i < 2^r), then it satisfies the no-island condition: for all p and a < b < c < 2^(M+1), x(p, a) = false and x(p, b) = true implies x(p, c) = true.
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 Finsettheorem cycle_power_dyadic_class_no_island_iff_end_shell_fullness (M : ℕ) (x : ℤ → ℕ → Bool) (htight : ∀ p, cycle_power_dyadic_class_weight (M+1) (x p) = (range (2^(M+1))).sum (fun a => (x p a).toNat)) (hexact : ∀ j < M+1, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(M+1)-2^j)).toNat) = 1) (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(M+1) → ∀ v : ℤ, ∃ c : ℕ, c < 2^(M+1)-d ∧ x (v-(c : ℤ)) c = true ∧ x (v-(c : ℤ)) (c+d) = true) : (∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < 2^(M+1) → x p a = false → x p b = true → x p c = true) ↔ (∀ r < M, ∀ (p : ℤ) (a : ℕ), 2^r ≤ a → a < 2^(r+1) → (x p a = true ∨ x p (2^(M+1)-1-a) = true) → ∀ i < 2^r, x p i = true ∧ x p (2^(M+1)-1-i) = true) := by constructor · intro hs exact cycle_power_dyadic_end_shell_fullness_of_no_island M x htight hexact hcover hs · intro hs exact cycle_power_dyadic_no_island_of_end_shell_fullness M x htight hexact hcover hs