cycle_power_dyadic_domain_wall_not_periodic
The explicit integer rooted-profile model has no positive natural period.
Statement
theorem cycle_power_dyadic_domain_wall_not_periodic :
¬∃ n : ℕ, 0 < n ∧ ∀ (p : ℤ) (a : ℕ),
cycle_power_dyadic_domain_wall (p+(n : ℤ)) a = cycle_power_dyadic_domain_wall 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
Quot.soundpropext- Built on 2
- 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_rightFor roots at least4, the explicit domain-wall profile equals its four-periodic right tail.
- Used by 1
- cycle_power_dyadic_count_free_nonperiodic_shape_counterexampleThere exists a genuinely nonperiodic tight radius-eight integer class system with exact dyadic edge ownership and coverage of every…
The proof, explained
The proof proceeds by contradiction, supposing there exists a positive integer period n. Restricting attention to bit index 3, periodicity implies that 4n is also a period, so the profile at position 4n must equal the profile at position 0. However, evaluating the explicit definition shows that bit 3 is false at position 4n (since 4n ≥ 4 and 4n ≡ 0 mod 4) but true at position 0. This gives false = true, which is impossible.
If a positive period n exists, then bit 3 of the profile must take the same value at position 4n as at position 0.
Assume for contradiction that there exists a positive period n. Specializing to the bit slice at index a = 3, the profile is periodic with period n. Because any integer multiple of a period is also a period, 4n is a period as well. Evaluating this periodicity at p = 0 yields that the value at 0 + 4n equals the value at 0.
rintro ⟨n, hn, hp⟩ have hper : Function.Periodic (fun p : ℤ => cycle_power_dyadic_domain_wall p 3) (n : ℤ) := fun p => hp p 3 have hh := hper.int_mul 4 0
At position 4n, bit 3 of the profile is false.
Since n > 0, we have n ≥ 1, which implies 4n ≥ 4 and 4n ≡ 0 (mod 4) by linear integer arithmetic. For any position p ≥ 4, cycle_power_dyadic_domain_wall_right computes the profile from p mod 4. Since 4n mod 4 = 0, this evaluates to the 3rd bit of 129 (129 = 2⁷ + 1), which is false by direct bit calculation.
uses
cycle_power_dyadic_domain_wall_righthave hnZ : (1 : ℤ) ≤ (n : ℤ) := by omega have hmod : (4*(n : ℤ)) % 4 = 0 := by omega have hval : cycle_power_dyadic_domain_wall (4*(n : ℤ)) 3 = false := by rw [cycle_power_dyadic_domain_wall_right (4*(n : ℤ)) (by omega) 3, hmod] decide
The periodicity equality reduces to false = cycle_power_dyadic_domain_wall 0 3.
Rewriting 0 + 4n as 4n using zero_add and substituting the value false at position 4n, the periodicity equality at p = 0 simplifies to false = cycle_power_dyadic_domain_wall 0 3.
uses
zero_addchange cycle_power_dyadic_domain_wall (0+4*(n : ℤ)) 3 = cycle_power_dyadic_domain_wall 0 3 at hh simp only [zero_add, hval] at hh
Bit 3 of the profile at position 0 is true, completing the contradiction.
Evaluating the profile definition directly at position 0 gives the 3rd bit of 153 (153 = 2⁷ + 2⁴ + 2³ + 1), which is true. Substituting this into the simplified periodicity equality gives false = true, an immediate contradiction.
have hzero : cycle_power_dyadic_domain_wall 0 3 = true := by decide rw [hzero] at hh contradiction
cycle_power_dyadic_domain_wall_right- For any integer position p ≥ 4 and bit index a, the profile value at (p, a) is given by the a-th bit of 195 if p ≡ 1 (mod 4), of 255 if p ≡ 3 (mod 4), and of 129 otherwise.
zero_add- In any additive structure with a zero element, 0 + a = a.
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_domain_wall_not_periodic : ¬∃ n : ℕ, 0 < n ∧ ∀ (p : ℤ) (a : ℕ), cycle_power_dyadic_domain_wall (p+(n : ℤ)) a = cycle_power_dyadic_domain_wall p a := by rintro ⟨n, hn, hp⟩ have hper : Function.Periodic (fun p : ℤ => cycle_power_dyadic_domain_wall p 3) (n : ℤ) := fun p => hp p 3 have hh := hper.int_mul 4 0 have hnZ : (1 : ℤ) ≤ (n : ℤ) := by omega have hmod : (4*(n : ℤ)) % 4 = 0 := by omega have hval : cycle_power_dyadic_domain_wall (4*(n : ℤ)) 3 = false := by rw [cycle_power_dyadic_domain_wall_right (4*(n : ℤ)) (by omega) 3, hmod] decide change cycle_power_dyadic_domain_wall (0+4*(n : ℤ)) 3 = cycle_power_dyadic_domain_wall 0 3 at hh simp only [zero_add, hval] at hh have hzero : cycle_power_dyadic_domain_wall 0 3 = true := by decide rw [hzero] at hh contradiction