AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_domain_wall_right

theoremverified

For roots at least4, the explicit domain-wall profile equals its four-periodic right tail.

Statement

theorem cycle_power_dyadic_domain_wall_right
    (p : ℤ) (hp : 4 ≤ p) (a : ℕ) :
    cycle_power_dyadic_domain_wall p a =
      (if p % 4 = 1 then 195 else if p % 4 = 3 then 255 else 129 : ℕ).testBit 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 1
  • 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…
Used by 5

The proof, explained

The definition of `cycle_power_dyadic_domain_wall p a` checks several special cases for $p \in \{-3, -1, 0, 1, 3\}$ and $p < 0$ before falling back to a four-periodic expression based on $p \pmod 4$. Since $p \ge 4$, linear integer arithmetic shows that none of these initial guard conditions hold. Unfolding the definition and simplifying away the false branches leaves exactly the claimed right tail formula.

  1. $p ≠ -3$, $p ≠ -1$, $p ≠ 0$, $p ≠ 1$, $p ≠ 3$, and $\neg(p < 0)$

    From the hypothesis $p ≥ 4$, elementary linear integer arithmetic (via `omega`) proves that $p$ cannot equal any of the exceptional values $-3, -1, 0, 1, 3$, nor can it be negative.

    lines 9–14

      have hA : p ≠ -3 := by omega
      have hB : p ≠ -1 := by omega
      have hC : p ≠ 0 := by omega
      have hD : p ≠ 1 := by omega
      have hE : p ≠ 3 := by omega
      have hN : ¬p < 0 := by omega
  2. `cycle_power_dyadic_domain_wall p a = (if p % 4 = 1 then 195 else if p % 4 = 3 then 255 else 129 : ℕ).testBit a`

    Unfolding the definition of `cycle_power_dyadic_domain_wall` reveals a chain of if-then-else branches. Using `if_neg` alongside the six inequalities established above discards each branch guarded by $p = -3, -1, 0, 1, 3$ and $p < 0$, reducing the expression to the final conditional based on $p \pmod 4$, which matches the right-hand side.

    lines 15–16

    uses if_neg

      simp only [cycle_power_dyadic_domain_wall, if_neg hA, if_neg hB,
        if_neg hC, if_neg hD, if_neg hE, if_neg hN]
if_neg
If a condition c is false (¬c), an if-then-else expression `if c then t else e` evaluates to the else branch e.

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

open Finsetset_option maxHeartbeats 2000000set_option maxRecDepth 10000theorem cycle_power_dyadic_domain_wall_right    (p : ℤ) (hp : 4 ≤ p) (a : ℕ) :    cycle_power_dyadic_domain_wall p a =      (if p % 4 = 1 then 195 else if p % 4 = 3 then 255 else 129 : ℕ).testBit a := by  have hA : p ≠ -3 := by omega  have hB : p ≠ -1 := by omega  have hC : p ≠ 0 := by omega  have hD : p ≠ 1 := by omega  have hE : p ≠ 3 := by omega  have hN : ¬p < 0 := by omega  simp only [cycle_power_dyadic_domain_wall, if_neg hA, if_neg hB,    if_neg hC, if_neg hD, if_neg hE, if_neg hN]
See it in the graphDiscuss this resultChallenge it