cycle_power_dyadic_domain_wall_boundary_pairing
The existing radius-eight domain-wall Boolean class model has equal bits at offsets 1 and 6 at every integer root.
Statement
theorem cycle_power_dyadic_domain_wall_boundary_pairing (p : ℤ) :
cycle_power_dyadic_domain_wall p 1 = cycle_power_dyadic_domain_wall p 6- Source
- Structural obstruction for research thread RT-1 and OP-205, arXiv:2610.15635.
- Verified
- 04 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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_leftFor roots at most-4, the explicit domain-wall profile equals its two-periodic left tail.
- 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_boundary_endpoint_counterexampleThere exists a radius-eight Boolean integer class model with tight classes, exact dyadic ownership, full ordinary distance coverage, and…
The proof, explained
The proof partitions the integers into three regimes: the left asymptotic region p ≤ -4, the right asymptotic region p ≥ 4, and the finite central interval -3 ≤ p ≤ 3. In both asymptotic regions, specialized reduction lemmas replace the function with explicit byte constants whose 1st and 6th bits are shown to match by direct evaluation. The remaining seven values of p between -3 and 3 are then checked individually by exhaustive case analysis and computation.
The pairing identity holds for all integers p ≤ -4.
We first consider the case where p ≤ -4. The lemma cycle_power_dyadic_domain_wall_left simplifies the values at offsets 1 and 6 to the corresponding bits of 129 (when p is even) or 243 (when p is odd). Splitting on whether p is even or odd, direct bit evaluation via decide confirms that both bits are 0 for 129 and both bits are 1 for 243, proving the identity in this region.
uses
cycle_power_dyadic_domain_wall_leftby_cases hL : p ≤ -4 · rw [cycle_power_dyadic_domain_wall_left p hL 1, cycle_power_dyadic_domain_wall_left p hL 6] split <;> decide
The pairing identity holds for all integers p ≥ 4.
Assuming p > -4, we next consider the case p ≥ 4. The lemma cycle_power_dyadic_domain_wall_right reduces the bit values at offsets 1 and 6 to those of 195 (if p ≡ 1 mod 4), 255 (if p ≡ 3 mod 4), or 129 (otherwise). Splitting across these modular cases and evaluating via decide confirms equality in every case (the bits are both 1 for 195 and 255, and both 0 for 129).
uses
cycle_power_dyadic_domain_wall_right· by_cases hR : 4 ≤ p · rw [cycle_power_dyadic_domain_wall_right p hR 1, cycle_power_dyadic_domain_wall_right p hR 6] split <;> (try split) <;> decide
Any remaining integer p satisfies -3 ≤ p ≤ 3.
With the cases p ≤ -4 and p ≥ 4 ruled out, linear integer arithmetic (via omega) deduces the bounds -3 ≤ p and p ≤ 3.
· have hlo : -3 ≤ p := by omega have hhi : p ≤ 3 := by omega
The pairing identity holds for each integer in {-3, -2, -1, 0, 1, 2, 3}.
Given the bounds -3 ≤ p ≤ 3, interval_cases enumerates the seven remaining integer values {-3, -2, -1, 0, 1, 2, 3}. For each specific value, decide evaluates the definition of cycle_power_dyadic_domain_wall directly to verify that the bits at offsets 1 and 6 are equal.
interval_cases p <;> decide
cycle_power_dyadic_domain_wall_left- For any integer p ≤ -4 and bit index a, cycle_power_dyadic_domain_wall p a is the a-th bit of 129 if p is even, or of 243 if p is odd.
cycle_power_dyadic_domain_wall_right- For any integer p ≥ 4 and bit index a, cycle_power_dyadic_domain_wall p a is the a-th bit of 195 if p ≡ 1 (mod 4), 255 if p ≡ 3 (mod 4), or 129 otherwise.
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.
theorem cycle_power_dyadic_domain_wall_boundary_pairing (p : ℤ) : cycle_power_dyadic_domain_wall p 1 = cycle_power_dyadic_domain_wall p 6 := by by_cases hL : p ≤ -4 · rw [cycle_power_dyadic_domain_wall_left p hL 1, cycle_power_dyadic_domain_wall_left p hL 6] split <;> decide · by_cases hR : 4 ≤ p · rw [cycle_power_dyadic_domain_wall_right p hR 1, cycle_power_dyadic_domain_wall_right p hR 6] split <;> (try split) <;> decide · have hlo : -3 ≤ p := by omega have hhi : p ≤ 3 := by omega interval_cases p <;> decide