AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_domain_wall_left

theoremverified

For roots at most-4, the explicit domain-wall profile equals its two-periodic left tail.

Statement

theorem cycle_power_dyadic_domain_wall_left
    (p : ℤ) (hp : p ≤ -4) (a : ℕ) :
    cycle_power_dyadic_domain_wall p a =
      (if p % 2 = 0 then 129 else 243 : ℕ).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 4

The proof, explained

The theorem shows that for roots p ≤ -4, the profile `cycle_power_dyadic_domain_wall p a` simplifies to testing bit a of 129 (when p is even) or 243 (when p is odd). The proof first uses linear integer arithmetic to verify that p < 0 and that p cannot equal any of the exceptional values -3, -1, 0, 1, or 3. Unfolding the definition of `cycle_power_dyadic_domain_wall` and evaluating the conditionals with these facts eliminates the exception branches and isolates the negative-tail formula.

  1. The root parameter p is strictly negative and is distinct from each of the boundary values -3, -1, 0, 1, and 3.

    Because p ≤ -4 by hypothesis, linear integer arithmetic (`omega`) directly rules out p = -3, p = -1, p = 0, p = 1, and p = 3, while also establishing that p < 0.

    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` equals the a-th bit of 129 if p is even, and of 243 if p is odd.

    Unfolding the piecewise definition of `cycle_power_dyadic_domain_wall`, we encounter nested conditionals testing whether p is -3, -1, 0, 1, or 3, followed by a check whether p < 0. Simplifying using the negated conditions (`if_neg`) discards the exceptional branches, and applying the condition p < 0 (`if_pos`) selects the branch (if p % 2 = 0 then 129 else 243).testBit a, which matches the target expression.

    lines 15–16

    uses if_neg, if_pos

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

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_left    (p : ℤ) (hp : p ≤ -4) (a : ℕ) :    cycle_power_dyadic_domain_wall p a =      (if p % 2 = 0 then 129 else 243 : ℕ).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_pos hN]
See it in the graphDiscuss this resultChallenge it