AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_domain_wall_cover

theoremverified

Every edge of every positive distance below eight is covered by the explicit integer rooted-profile model.

Statement

theorem cycle_power_dyadic_domain_wall_cover
    (d : ℕ) (hd : 1 ≤ d) (hd8 : d < 8) (v : ℤ) :
    ∃ a : ℕ, a < 8-d ∧ cycle_power_dyadic_domain_wall (v-(a : ℤ)) a = true ∧
      cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) = true
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 2
Used by 2

The proof, explained

The theorem is proved by contradiction. An auxiliary lemma (`cycle_power_dyadic_domain_wall_cover_sum`) establishes that the sum of the boolean indicators over all candidate offsets a ∈ {0, ..., 7 - d} is at least 1. Assuming no valid offset exists, every term in the sum must vanish, which implies by `sum_eq_zero` that the total sum is 0. The linear arithmetic solver `omega` then derives a contradiction between the positive lower bound and the zero sum.

  1. The sum of the conjunction indicators over all offsets a < 8 - d is at least 1.

    Applying the helper theorem `cycle_power_dyadic_domain_wall_cover_sum` to the distance d (with 1 ≤ d < 8) and vertex v establishes the lower bound 1 ≤ ∑ a ∈ range (8 - d), (...).toNat.

    lines 9–10

    uses cycle_power_dyadic_domain_wall_cover_sum

      classical
      have hpos := cycle_power_dyadic_domain_wall_cover_sum d hd hd8 v
  2. It suffices to derive a contradiction assuming that no offset a < 8 - d satisfies both domain wall conditions.

    We assume the negation of the existential statement for contradiction (`by_contra hno`), bringing the hypothesis ¬∃ a < 8 - d, ... into scope with goal False.

    line 11

      by_contra hno
  3. Under the contradiction hypothesis, the sum of the conjunction indicators over a < 8 - d equals 0.

    By `sum_eq_zero`, a finite sum is zero if each term is zero. For any a in Finset.range (8 - d) (so a < 8 - d by `mem_range.mp`), if both domain wall conditions were true, a would witness the existential statement and contradict `hno`. Thus, the two conditions cannot both be true (`hnot`). Performing a case split on both boolean values shows that their conjunction evaluates to false in all consistent cases, so each summand is 0.

    lines 12–22

    uses sum_eq_zero, mem_range.mp

      have hzero : (range (8-d)).sum (fun a =>
          (cycle_power_dyadic_domain_wall (v-(a : ℤ)) a &&
            cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d)).toNat) = 0 := by
        apply sum_eq_zero
        intro a ha
        have hnot : ¬(cycle_power_dyadic_domain_wall (v-(a : ℤ)) a = true ∧
            cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) = true) := by
          rintro ⟨h0, h1⟩
          exact hno ⟨a, mem_range.mp ha, h0, h1⟩
        cases h0 : cycle_power_dyadic_domain_wall (v-(a : ℤ)) a <;>
          cases h1 : cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) <;> simp_all
  4. A contradiction is reached, completing the proof.

    Linear integer arithmetic (`omega`) detects the contradiction between the lower bound that the sum is at least 1 (`hpos`) and the deduction that the sum equals 0 (`hzero`).

    line 23

      omega
cycle_power_dyadic_domain_wall_cover_sum
For any distance 1 ≤ d < 8 and integer v, the sum over a ∈ {0, ..., 7 - d} of the indicator that both domain wall conditions hold at a and a + d is at least 1.
mem_range.mp
If a natural number belongs to Finset.range n, then it is strictly less than n.
sum_eq_zero
A finite sum of elements in an additive commutative monoid is zero if every term in the sum is zero.

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_cover    (d : ℕ) (hd : 1 ≤ d) (hd8 : d < 8) (v : ℤ) :    ∃ a : ℕ, a < 8-d ∧ cycle_power_dyadic_domain_wall (v-(a : ℤ)) a = true ∧      cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) = true := by  classical  have hpos := cycle_power_dyadic_domain_wall_cover_sum d hd hd8 v  by_contra hno  have hzero : (range (8-d)).sum (fun a =>      (cycle_power_dyadic_domain_wall (v-(a : ℤ)) a &&        cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d)).toNat) = 0 := by    apply sum_eq_zero    intro a ha    have hnot : ¬(cycle_power_dyadic_domain_wall (v-(a : ℤ)) a = true ∧        cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) = true) := by      rintro ⟨h0, h1⟩      exact hno ⟨a, mem_range.mp ha, h0, h1⟩    cases h0 : cycle_power_dyadic_domain_wall (v-(a : ℤ)) a <;>      cases h1 : cycle_power_dyadic_domain_wall (v-(a : ℤ)) (a+d) <;> simp_all  omega
See it in the graphDiscuss this resultChallenge it