AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_count_free_boundary_endpoint_counterexample

theoremverified

There exists a radius-eight Boolean integer class model with tight classes, exact dyadic ownership, full ordinary distance coverage, and equal boundary bits at offsets 1 and 6 at every root, but whose class at root zero selects offset 3 while omitting offset 1. This drops pointwise optimal counts and periodicity and does not refute OP-205.

Statement

theorem cycle_power_dyadic_count_free_boundary_endpoint_counterexample :
    ∃ x : ℤ → ℕ → Bool,
      (∀ p, cycle_power_dyadic_class_weight 3 (x p) =
        (Finset.range 8).sum (fun a => (x p a).toNat)) ∧
      (∀ j < 3, ∀ v : ℤ, (Finset.range (2^j)).sum (fun a =>
        (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8-2^j)).toNat) = 1) ∧
      (∀ d : ℕ, 1 ≤ d → d < 8 → ∀ v : ℤ,
        ∃ a : ℕ, a < 8-d ∧ x (v-(a : ℤ)) a = true ∧
          x (v-(a : ℤ)) (a+d) = true) ∧
      (∀ p : ℤ, x p 1 = x p 6) ∧
      x 0 1 = false ∧ x 0 3 = true
Source
Structural obstruction for research thread RT-1 and OP-205, arXiv:2610.15635.
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6

The proof, explained

The theorem is proved by exhibiting an explicit domain-wall model, cycle_power_dyadic_domain_wall. The global structural properties—tightness, exact dyadic ownership, distance coverage, and boundary pairing—are supplied by existing theorems, while the specific boundary and endpoint values at root 0 are checked by direct boolean computation.

  1. The explicit construction cycle_power_dyadic_domain_wall satisfies all six conditions of the counterexample.

    We instantiate the existential quantifier with the domain-wall model cycle_power_dyadic_domain_wall. The first four conjuncts—tightness of the class weights, exact dyadic ownership at scales j < 3, full distance coverage for all 1 ≤ d < 8, and boundary pairing between offsets 1 and 6—are provided by the pre-established theorems cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact, cycle_power_dyadic_domain_wall_cover, and cycle_power_dyadic_domain_wall_boundary_pairing. The remaining two conjuncts, stating that the root 0 configuration omits offset 1 and selects offset 3, are verified by direct boolean evaluation (decide), since the root 0 byte is 153 (binary 10011001), whose bit 1 is false and bit 3 is true.

    lines 12–14

    uses cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact, cycle_power_dyadic_domain_wall_cover, cycle_power_dyadic_domain_wall_boundary_pairing

      refine ⟨cycle_power_dyadic_domain_wall,
        cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact,
        cycle_power_dyadic_domain_wall_cover, cycle_power_dyadic_domain_wall_boundary_pairing, ?_, ?_⟩ <;> decide
cycle_power_dyadic_domain_wall_tight
For every root p, the dyadic class weight at scale 3 equals the sum of the bits in the 8-bit block at p.
cycle_power_dyadic_domain_wall_exact
For every dyadic scale j < 3 and root v, the sum of pairings at distance 8 - 2^j over offsets a < 2^j is exactly 1.
cycle_power_dyadic_domain_wall_cover
For every distance 1 ≤ d < 8 and root v, there exists an offset a < 8 - d such that both bits at a and a + d are true.
cycle_power_dyadic_domain_wall_boundary_pairing
For every root p, the bit at offset 1 equals the bit at offset 6.

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

theorem cycle_power_dyadic_count_free_boundary_endpoint_counterexample :    ∃ x : ℤ → ℕ → Bool,      (∀ p, cycle_power_dyadic_class_weight 3 (x p) =        (Finset.range 8).sum (fun a => (x p a).toNat)) ∧      (∀ j < 3, ∀ v : ℤ, (Finset.range (2^j)).sum (fun a =>        (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+8-2^j)).toNat) = 1) ∧      (∀ d : ℕ, 1 ≤ d → d < 8 → ∀ v : ℤ,        ∃ a : ℕ, a < 8-d ∧ x (v-(a : ℤ)) a = true ∧          x (v-(a : ℤ)) (a+d) = true) ∧      (∀ p : ℤ, x p 1 = x p 6) ∧      x 0 1 = false ∧ x 0 3 = true := by  refine ⟨cycle_power_dyadic_domain_wall,    cycle_power_dyadic_domain_wall_tight, cycle_power_dyadic_domain_wall_exact,    cycle_power_dyadic_domain_wall_cover, cycle_power_dyadic_domain_wall_boundary_pairing, ?_, ?_⟩ <;> decide
See it in the graphDiscuss this resultChallenge it