AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_domain_wall_tight

theoremverified

Every rooted profile in the explicit count-free nonperiodic radius-eight model is tight in the dyadic class-weight inequality.

Statement

theorem cycle_power_dyadic_domain_wall_tight (p : ℤ) :
    cycle_power_dyadic_class_weight 3 (cycle_power_dyadic_domain_wall p) =
      (range 8).sum (fun a => (cycle_power_dyadic_domain_wall p a).toNat)
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 4
Used by 2

The proof, explained

The equality is proved by partitioning the integer position p into three regimes: the left tail p ≤ -4, the right tail p ≥ 4, and the finite central interval -3 ≤ p ≤ 3. In both infinite tails, the domain wall profile is periodic modulo 4 (or modulo 2), reducing each tail to checking the four remainder classes r = p % 4 ∈ {0, 1, 2, 3}. For each of these remainder classes as well as each of the seven remaining central integers, both sides of the identity reduce to concrete numerical evaluations, which are verified by direct finite computation.

  1. The equality holds for all p ≤ -4.

    We assume p ≤ -4 and set r = p % 4, which satisfies 0 ≤ r < 4 and p ≡ r mod 2 by linear integer arithmetic (`omega`). Lemma `cycle_power_dyadic_domain_wall_left` shows that the profile at p depends only on p mod 2, so it equals the bit sequence of 129 when r is even and 243 when r is odd. Rewriting with this characterization reduces the goal to the four cases r ∈ {0, 1, 2, 3}; for each value of r, both sides evaluate to explicit constants, which Lean verifies by direct computation (`decide`).

    lines 8–19

    uses cycle_power_dyadic_domain_wall_left

      by_cases hL : p ≤ -4
      · generalize hr : p % 4 = r
        have hr0 : 0 ≤ r := by omega
        have hr4 : r < 4 := by omega
        have hx : cycle_power_dyadic_domain_wall p =
            fun a => (if r % 2 = 0 then 129 else 243 : ℕ).testBit a := by
          funext a
          rw [cycle_power_dyadic_domain_wall_left p hL a]
          have he : p % 2 = r % 2 := by omega
          rw [he]
        rw [hx]
        interval_cases r <;> decide
  2. The equality holds for all p ≥ 4.

    In the remaining case p > -4, we assume 4 ≤ p and set r = p % 4, so 0 ≤ r < 4. By lemma `cycle_power_dyadic_domain_wall_right`, the profile at p is determined by r: it corresponds to the bits of 195 if r = 1, 255 if r = 3, and 129 otherwise. Substituting this representation reduces the claim to the four possible values r ∈ {0, 1, 2, 3}, each of which is verified by direct computational evaluation (`decide`).

    lines 20–29

    uses cycle_power_dyadic_domain_wall_right

      · by_cases hR : 4 ≤ p
        · generalize hr : p % 4 = r
          have hr0 : 0 ≤ r := by omega
          have hr4 : r < 4 := by omega
          have hx : cycle_power_dyadic_domain_wall p =
              fun a => (if r = 1 then 195 else if r = 3 then 255 else 129 : ℕ).testBit a := by
            funext a
            rw [cycle_power_dyadic_domain_wall_right p hR a, hr]
          rw [hx]
          interval_cases r <;> decide
  3. The equality holds for the central range -3 ≤ p ≤ 3, completing the proof.

    Having excluded p ≤ -4 and p ≥ 4, linear integer arithmetic (`omega`) deduces that -3 ≤ p ≤ 3. Performing an exhaustive case analysis over these seven integers (`interval_cases`), the definition of the domain wall profile unfolds for each p ∈ {-3, -2, -1, 0, 1, 2, 3} into an explicit 8-bit word, and the equality between its class weight and its Hamming weight is closed in every case by direct computation (`decide`).

    lines 30–32

        · have hlo : -3 ≤ p := by omega
          have hhi : p ≤ 3 := by omega
          interval_cases p <;> decide
cycle_power_dyadic_domain_wall_left
For any integer p ≤ -4 and bit position a, the a-th bit of the domain wall profile at p is the a-th bit of 129 if p is even, and of 243 if p is odd.
cycle_power_dyadic_domain_wall_right
For any integer p ≥ 4 and bit position a, the a-th bit of the domain wall profile at p is the a-th bit of 195 if p ≡ 1 mod 4, 255 if p ≡ 3 mod 4, and 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

open Finsetset_option maxHeartbeats 2000000set_option maxRecDepth 10000theorem cycle_power_dyadic_domain_wall_tight (p : ℤ) :    cycle_power_dyadic_class_weight 3 (cycle_power_dyadic_domain_wall p) =      (range 8).sum (fun a => (cycle_power_dyadic_domain_wall p a).toNat) := by  by_cases hL : p ≤ -4  · generalize hr : p % 4 = r    have hr0 : 0 ≤ r := by omega    have hr4 : r < 4 := by omega    have hx : cycle_power_dyadic_domain_wall p =        fun a => (if r % 2 = 0 then 129 else 243 : ℕ).testBit a := by      funext a      rw [cycle_power_dyadic_domain_wall_left p hL a]      have he : p % 2 = r % 2 := by omega      rw [he]    rw [hx]    interval_cases r <;> decide  · by_cases hR : 4 ≤ p    · generalize hr : p % 4 = r      have hr0 : 0 ≤ r := by omega      have hr4 : r < 4 := by omega      have hx : cycle_power_dyadic_domain_wall p =          fun a => (if r = 1 then 195 else if r = 3 then 255 else 129 : ℕ).testBit a := by        funext a        rw [cycle_power_dyadic_domain_wall_right p hR a, hr]      rw [hx]      interval_cases r <;> decide    · have hlo : -3 ≤ p := by omega      have hhi : p ≤ 3 := by omega      interval_cases p <;> decide
See it in the graphDiscuss this resultChallenge it