AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_tight_two_interval_half_width_counterexample

theoremverified

A single tight rooted class with two end intervals can have a nonfull interval wider than half the radius. At radius eight the class is {0,1,3,4,5,6,7}, with a suffix of width five and a missing position two.

Statement

theorem cycle_power_dyadic_tight_two_interval_half_width_counterexample :
    ∃ b : ℕ → Bool,
      b 0 = true ∧ b 7 = true ∧ b 2 = false ∧ b 3 = true ∧
      cycle_power_dyadic_class_weight 3 b = 7 ∧
      (range 8).sum (fun a => (b a).toNat) = 7 ∧
      (∀ (a c d : Fin 8), a < c → c < d →
        b a = false → b c = true → b d = true)
Source
Route audit for OP-205 / RT-1 following arXiv:2610.15635. Experiment 6491 refutes a proposed SINGLE-CLASS normalization, not a graph covering theorem or the full local-model normalization. No research advance is claimed.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • cycle_power_dyadic_class_weightThe weighted number of pairs in a dyadic arc: the endpoint pair has weight two, and distances 2^m-2^j for 1≤j<m have weight one.

The proof, explained

The existence of the counterexample is established by exhibiting an explicit indicator function b : ℕ → Bool representing the subset {0, 1, 3, 4, 5, 6, 7} of {0, ..., 7}. Because all conditions—the boundary values, the dyadic class weight, the total element count, and the two-interval condition over the finite domain Fin 8—are decidable, the proof concludes by direct computational evaluation.

  1. It suffices to verify the required conditions for the indicator function b(a) that is true when a < 2 or 3 ≤ a < 8.

    We provide an explicit witness b: ℕ → Bool corresponding to the set {0, 1, 3, 4, 5, 6, 7}. This reduces the existential claim to verifying the seven conjuncts for this specific function.

    line 10

      refine ⟨fun a => decide (a < 2 ∨ (3 ≤ a ∧ a < 8)), ?_⟩
  2. The explicit indicator function satisfies all seven conditions. automation

    Each conjunct is a finite, computable statement: the boundary values b(0) = true, b(7) = true, b(2) = false, b(3) = true; the dyadic class weight equaling 7; the sum over range 8 equaling 7; and the two-interval condition for all triples a < c < d in Fin 8. The `decide` tactic evaluates this finite proposition by direct computation and closes the goal.

    line 11

      decide

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 Finsettheorem cycle_power_dyadic_tight_two_interval_half_width_counterexample :    ∃ b : ℕ → Bool,      b 0 = true ∧ b 7 = true ∧ b 2 = false ∧ b 3 = true ∧      cycle_power_dyadic_class_weight 3 b = 7 ∧      (range 8).sum (fun a => (b a).toNat) = 7 ∧      (∀ (a c d : Fin 8), a < c → c < d →        b a = false → b c = true → b d = true) := by  refine ⟨fun a => decide (a < 2 ∨ (3 ≤ a ∧ a < 8)), ?_⟩  decide
See it in the graphDiscuss this resultChallenge it