cycle_power_dyadic_count_free_nonperiodic_shape_counterexample
There exists a genuinely nonperiodic tight radius-eight integer class system with exact dyadic edge ownership and coverage of every ordinary distance, but a selected island occurs at root zero and vertex-1 has five active classes. Thus dropping BOTH optimal original counts and periodicity permits islands. This does not refute the periodic count-free conjecture or OP-205.
Statement
theorem cycle_power_dyadic_count_free_nonperiodic_shape_counterexample : ∃ x : ℤ → ℕ → Bool, (∀ p, cycle_power_dyadic_class_weight 3 (x p) = (range 8).sum (fun a => (x p a).toNat)) ∧ (∀ j < 3, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8-2^j)).toNat) = 1) ∧ (∀ d : ℕ, 1 ≤ d → d < 8 → ∀ v : ℤ, ∃ a : ℕ, a < 8-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true) ∧ x 0 1 = false ∧ x 0 3 = true ∧ x 0 5 = false ∧ (range 8).sum (fun a => (x (-1-(a : ℤ)) a).toNat) = 5 ∧ (¬∃ n : ℕ, 0 < n ∧ ∀ (p : ℤ) (a : ℕ), x (p+(n : ℤ)) a = x p a)
- Source
- OP-205 / RT-1 structural-hypothesis audit following arXiv:2610.15635. A compact five-exception version of the previously computed nonperiodic domain wall6554 was independently audited in experiment7315. This formal countermodel addresses a stronger auxiliary statement without counts or periodicity; it is not a graph cover, a periodic model, an OP-205 refutation, or a research advance.
- Verified
- 28 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- 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.
- cycle_power_dyadic_domain_wallAn explicit radius-eight Boolean rooted-profile system on the integers: a two-periodic left tail and a four-periodic right tail, with…
- cycle_power_dyadic_domain_wall_tightEvery rooted profile in the explicit count-free nonperiodic radius-eight model is tight in the dyadic class-weight inequality.
- cycle_power_dyadic_domain_wall_exactEvery dyadic long-distance edge has exactly one root owner in the explicit radius-eight model, at every integer vertex.
- cycle_power_dyadic_domain_wall_coverEvery edge of every positive distance below eight is covered by the explicit integer rooted-profile model.
- cycle_power_dyadic_domain_wall_not_periodicThe explicit integer rooted-profile model has no positive natural period.
The proof, explained
The existence of the counterexample is established by providing an explicit witness, the domain-wall configuration cycle_power_dyadic_domain_wall. Previously proved lemmas guarantee that this configuration is tight, satisfies exact dyadic edge ownership, covers all distances up to 7, and is nonperiodic. The remaining finite conditions—the specific island bits at root 0 and having five active classes at vertex -1—are verified by direct computation.
The domain-wall configuration satisfies all conditions of the theorem: it is tight, satisfies exact dyadic edge ownership, covers every distance 1 ≤ d < 8, has the specified island and active class count, and is not periodic. automation
We witness the existential with the domain-wall configuration cycle_power_dyadic_domain_wall. The general properties—tightness, exact dyadic edge ownership, distance coverage, and nonperiodicity—are supplied by previously proved lemmas. The four remaining concrete conditions on values at root 0 and the class count at vertex -1 are verified by direct finite computation using decide.
uses
cycle_power_dyadic_domain_wall,cycle_power_dyadic_domain_wall_tight,cycle_power_dyadic_domain_wall_exact,cycle_power_dyadic_domain_wall_cover,cycle_power_dyadic_domain_wall_not_periodicrefine ⟨cycle_power_dyadic_domain_wall, cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact, cycle_power_dyadic_domain_wall_cover, ?_, ?_, ?_, ?_, cycle_power_dyadic_domain_wall_not_periodic⟩ <;> decide
cycle_power_dyadic_domain_wall- the explicit domain-wall configuration x : ℤ → ℕ → Bool
cycle_power_dyadic_domain_wall_cover- the dyadic domain-wall configuration covers every distance d from 1 to 7 at every vertex v
cycle_power_dyadic_domain_wall_exact- the dyadic domain-wall configuration satisfies exact dyadic edge ownership for every scale j < 3 and vertex v
cycle_power_dyadic_domain_wall_not_periodic- the dyadic domain-wall configuration is not periodic with any positive period
cycle_power_dyadic_domain_wall_tight- the dyadic domain-wall configuration satisfies tightness (class weight equals active class count) at every position p
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 2000000set_option maxRecDepth 10000theorem cycle_power_dyadic_count_free_nonperiodic_shape_counterexample : ∃ x : ℤ → ℕ → Bool, (∀ p, cycle_power_dyadic_class_weight 3 (x p) = (range 8).sum (fun a => (x p a).toNat)) ∧ (∀ j < 3, ∀ v : ℤ, (range (2^j)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8-2^j)).toNat) = 1) ∧ (∀ d : ℕ, 1 ≤ d → d < 8 → ∀ v : ℤ, ∃ a : ℕ, a < 8-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true) ∧ x 0 1 = false ∧ x 0 3 = true ∧ x 0 5 = false ∧ (range 8).sum (fun a => (x (-1-(a : ℤ)) a).toNat) = 5 ∧ (¬∃ n : ℕ, 0 < n ∧ ∀ (p : ℤ) (a : ℕ), x (p+(n : ℤ)) a = x p a) := by refine ⟨cycle_power_dyadic_domain_wall, cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact, cycle_power_dyadic_domain_wall_cover, ?_, ?_, ?_, ?_, cycle_power_dyadic_domain_wall_not_periodic⟩ <;> decide