cycle_power_dyadic_whole_class_fractional_counterexample
Five genuine tight radius-eight class shapes, with positive integer multiplicities totaling twelve, satisfy all dyadic exact-edge and ordinary coverage conditions in expectation and have expected class size four, yet boundary mismatch has total weight four. Thus exact single-class shape distributions alone do not force pairing.
Statement
theorem cycle_power_dyadic_whole_class_fractional_counterexample : ∃ (b : Fin 5 → ℕ → Bool) (w : Fin 5 → ℕ), (∑ i, w i) = 12 ∧ (∀ i, b i 0 = true ∧ b i 7 = true) ∧ (∀ i, cycle_power_dyadic_class_weight 3 (b i) = (range 8).sum (fun a => (b i a).toNat)) ∧ (∑ i, w i * (range 8).sum (fun a => (b i a).toNat)) = 48 ∧ (∀ j : Fin 3, (∑ i, w i * (range (2 ^ (j : ℕ))).sum (fun a => (b i a && b i (a + 8 - 2 ^ (j : ℕ))).toNat)) = 12) ∧ (∀ d : Fin 7, 12 ≤ ∑ i, w i * (range (8 - ((d : ℕ) + 1))).sum (fun a => (b i a && b i (a + ((d : ℕ) + 1))).toNat)) ∧ (∑ i, w i * (Bool.xor (b i 1) (b i 6)).toNat) = 4
- Source
- Exact fractional witness for the local-configuration relaxation in OP-205 / RT-1, experiment6403, following arXiv:2610.15635. This is an integrality barrier for a proposed proof route, not a Boolean model, an equivalence cover, or a counterexample to the main conjecture. No research advance 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 proof is constructive: it exhibits an explicit counterexample consisting of five radius-eight class shapes on {0, …, 7} with integer multiplicities (4, 2, 2, 3, 1) summing to 12. After instantiating the existential witnesses, all seven required conditions—including tightness, exact dyadic coverage, ordinary coverage bounds, and a nonzero boundary mismatch weight of 4—are verified mechanically by the `decide` tactic via finite computation.
It suffices to show that the explicit family of five shapes b with multiplicities w satisfies the seven stated conditions.
We define five radius-8 shapes on {0, …, 7}—namely b₀ = {0, 7}, b₁ = {0, 1, 7}, b₂ = {0, 1, 4, 7}, b₃ = {0, 1, 2, 5, 6, 7}, and b₄ = {0, …, 7}—and assign them positive integer multiplicities w = (4, 2, 2, 3, 1). Supplying b and w as explicit witnesses for the existential quantifier reduces the theorem to the conjunction of the seven properties.
let b : Fin 5 → ℕ → Bool := fun i a => decide (a ∈ match i.val with | 0 => ({0, 7} : Finset ℕ) | 1 => {0, 1, 7} | 2 => {0, 1, 4, 7} | 3 => {0, 1, 2, 5, 6, 7} | _ => range 8) let w : Fin 5 → ℕ := fun i => match i.val with | 0 => 4 | 1 => 2 | 2 => 2 | 3 => 3 | _ => 1 refine ⟨b, w, ?_⟩
The chosen shapes and weights satisfy all seven conditions. automation
The goal is a conjunction of purely finite arithmetic and boolean statements: the weights sum to 12; both endpoints 0 and 7 are occupied in every shape; each shape's dyadic class weight equals its size; the weighted total class size is 48; dyadic boundary edge coverage is exactly 12 at scales 2ʲ for j ∈ {0, 1, 2}; ordinary linear edge coverage is at least 12 for every distance d ∈ {1, …, 7}; and the boundary mismatch weight between index 1 and index 6 is exactly 4. Because all domains and ranges are finite, the `decide` tactic evaluates all conditions directly by computation.
decide
- The entire verification of the seven conditions on line 32 is delegated to the `decide` tactic, which evaluates all finite sums and bounded checks computationally rather than by symbolic steps.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finsetset_option maxHeartbeats 4000000set_option maxRecDepth 10000theorem cycle_power_dyadic_whole_class_fractional_counterexample : ∃ (b : Fin 5 → ℕ → Bool) (w : Fin 5 → ℕ), (∑ i, w i) = 12 ∧ (∀ i, b i 0 = true ∧ b i 7 = true) ∧ (∀ i, cycle_power_dyadic_class_weight 3 (b i) = (range 8).sum (fun a => (b i a).toNat)) ∧ (∑ i, w i * (range 8).sum (fun a => (b i a).toNat)) = 48 ∧ (∀ j : Fin 3, (∑ i, w i * (range (2 ^ (j : ℕ))).sum (fun a => (b i a && b i (a + 8 - 2 ^ (j : ℕ))).toNat)) = 12) ∧ (∀ d : Fin 7, 12 ≤ ∑ i, w i * (range (8 - ((d : ℕ) + 1))).sum (fun a => (b i a && b i (a + ((d : ℕ) + 1))).toNat)) ∧ (∑ i, w i * (Bool.xor (b i 1) (b i 6)).toNat) = 4 := by let b : Fin 5 → ℕ → Bool := fun i a => decide (a ∈ match i.val with | 0 => ({0, 7} : Finset ℕ) | 1 => {0, 1, 7} | 2 => {0, 1, 4, 7} | 3 => {0, 1, 2, 5, 6, 7} | _ => range 8) let w : Fin 5 → ℕ := fun i => match i.val with | 0 => 4 | 1 => 2 | 2 => 2 | 3 => 3 | _ => 1 refine ⟨b, w, ?_⟩ decide