cycle_power_dyadic_coloured_no_full_class_counterexample
A period-448 integer radius-eight model with four real class colours has tight classes, constant active count four, every dyadic edge covered exactly once, full ordinary coverage and same-colour disjointness, but every class has size at most six and misses offset four. An optimal-model fullness assumption is therefore false.
Statement
theorem cycle_power_dyadic_coloured_no_full_class_counterexample : ∃ (x : ℤ → ℕ → Bool) (ell : ℤ → ℕ), (∀ p a, x (p + 448) a = x p a) ∧ (∀ p, ell (p + 448) = ell p) ∧ (∀ p, ell p < 4) ∧ (∀ p, x p 0 = true ∧ x p 7 = true ∧ x p 4 = false) ∧ (∀ p, cycle_power_dyadic_class_weight 3 (x p) = (range 8).sum (fun a => (x p a).toNat)) ∧ (∀ p, (range 8).sum (fun a => (x p a).toNat) ≤ 6) ∧ (∀ v : ℤ, (range 8).sum (fun a => (x (v - (a : ℤ)) a).toNat) = 4) ∧ (∀ j < 3, ∀ v : ℤ, (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 ∈ range (8 - d), x (v - (a : ℤ)) a = true ∧ x (v - (a : ℤ)) (a + d) = true) ∧ (∀ (v : ℤ) (a b : Fin 8), a ≠ b → x (v - ((a : ℕ) : ℤ)) a = true → x (v - ((b : ℕ) : ℤ)) b = true → ell (v - ((a : ℕ) : ℤ)) ≠ ell (v - ((b : ℕ) : ℤ)))
- Source
- Counterexample to the proposed full-interval-class/peeling shortcut in OP-205 / RT-1, experiment6410, following arXiv:2610.15635. The eight-row pattern is pulled back to integers with period448, which is in the original large-size range at bandwidth seven. Since eight divides448, this is not a counterexample to the main conjecture. The theorem is explicitly about the coloured class model; no new 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 counterexample is constructed by pulling back an 8-periodic finite model on ℤ/8ℤ to the integers ℤ. The helper lemma cycle_power_dyadic_coloured_no_full_class_finite provides an explicit configuration and 4-colouring on ℤ/8ℤ satisfying all required properties, verified by exhaustive computation (decide). All local conditions—including constant degree four, exact dyadic coverage, distance coverage, and same-colour disjointness—depend only on coordinates modulo 8 and therefore lift directly to ℤ. Periodicity with period 448 holds because 448 is a multiple of 8.
An explicit finite model with the required properties exists on ℤ/8ℤ. automation
We define a boolean pattern b on ℤ/8ℤ whose active offsets alternate between {0, 7} for even coordinates and {0, 1, 2, 3, 6, 7} for odd coordinates, and an explicit 4-colouring ell given by a table of eight values. The conjunction of all required conditions—colour bound, endpoints at 0 and 7, missing offset 4, dyadic weight equality, size at most 6, constant active degree 4, exact dyadic coverage, full ordinary coverage, and same-colour disjointness—is a bounded decidable proposition on a finite domain, which Lean verifies automatically by exhaustive evaluation (decide).
let b : ZMod 8 → ℕ → Bool := fun p a => decide (a ∈ if p.val % 2 = 0 then ({0, 7} : Finset ℕ) else {0, 1, 2, 3, 6, 7}) let ell : ZMod 8 → ℕ := fun p => match p.val with | 0 => 0 | 1 => 2 | 2 => 3 | 3 => 0 | 4 => 1 | 5 => 3 | 6 => 2 | _ => 1 refine ⟨b, ell, ?_⟩ decide
The finite model on ℤ/8ℤ provides candidate periodic configurations on ℤ.
We invoke cycle_power_dyadic_coloured_no_full_class_finite to obtain the pattern b : ZMod 8 → ℕ → Bool and colouring ell : ZMod 8 → ℕ together with their verified properties. We then define the integer configuration x(p, a) := b(p mod 8, a) and colouring ell(p) := ell(p mod 8) by pulling back along the canonical projection ℤ → ℤ/8ℤ, leaving ten subgoals to verify.
uses
cycle_power_dyadic_coloured_no_full_class_finiteobtain ⟨b, ell, hbnd, he, hw, hsize, hcount, hexact, hcover, hcol⟩ := cycle_power_dyadic_coloured_no_full_class_finite refine ⟨fun p a => b (p : ZMod 8) a, fun p => ell (p : ZMod 8), ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩
Both the configuration x and the colouring ell are periodic with period 448.
For any integer p, the shifted coordinate p + 448 projects in ℤ/8ℤ to (p mod 8) + (448 mod 8). Since 448 = 56 × 8 ≡ 0 (mod 8), the cast of 448 vanishes, simplifying ↑(p + 448) to ↑p. Hence x(p + 448, a) = x(p, a) and ell(p + 448) = ell(p).
uses
Int.cast_add,Int.cast_ofNat,add_zero· intro p a simp only [Int.cast_add, Int.cast_ofNat] have hz : (448 : ZMod 8) = 0 := by decide rw [hz, add_zero] · intro p simp only [Int.cast_add, Int.cast_ofNat] have hz : (448 : ZMod 8) = 0 := by decide rw [hz, add_zero]
Each class satisfies the colour bound (< 4), boundary and hole conditions, dyadic weight equality, and the size bound (≤ 6).
Each of these four conditions concerns a single class at integer coordinate p, which is defined as b(p mod 8). Evaluating the corresponding properties of the finite model (hbnd, he, hw, and hsize) at p mod 8 immediately establishes each claim.
· intro p; exact hbnd (p : ZMod 8) · intro p; exact he (p : ZMod 8) · intro p; exact hw (p : ZMod 8) · intro p; exact hsize (p : ZMod 8)
Every integer vertex has constant active count four.
The active count at vertex v ∈ ℤ is the sum of x(v - a, a) for a from 0 to 7. Because casting preserves subtraction (Int.cast_sub) and natural number offsets (Int.cast_natCast), the argument (v - a) mod 8 matches (v mod 8) - a in ℤ/8ℤ. The sum therefore equals the vertex degree in the finite model, which is 4 by hcount.
uses
Int.cast_sub,Int.cast_natCast· intro v simpa only [Int.cast_sub, Int.cast_natCast] using hcount (v : ZMod 8)
Every dyadic edge is covered exactly once at every vertex.
For any dyadic scale index j < 3, we package j and its bound into Fin 3 and evaluate the finite model's exact dyadic coverage property hexact at v mod 8. Ring homomorphism simplification maps the integer sum directly onto the finite sum, yielding 1.
uses
Int.cast_sub,Int.cast_natCast· intro j hj v simpa only [Int.cast_sub, Int.cast_natCast] using hexact ⟨j, hj⟩ (v : ZMod 8)
Every distance 1 ≤ d < 8 is covered at every vertex.
For any distance 1 ≤ d < 8, linear arithmetic shows d - 1 < 7 and (d - 1) + 1 = d. The finite coverage hypothesis hcover at distance d - 1 and vertex v mod 8 provides an offset a < 8 - d covering both v and v + d. Pushing the hypotheses back to ℤ via ring cast simplifications yields the required active endpoints for the integer class at v - a.
uses
Int.cast_sub,Int.cast_natCast· intro d hd hd8 v have hlt : d - 1 < 7 := by omega have heq : d - 1 + 1 = d := by omega obtain ⟨a, ha, h1, h2⟩ := hcover ⟨d - 1, hlt⟩ (v : ZMod 8) simp only [heq] at ha h1 h2 exact ⟨a, ha, by simpa only [Int.cast_sub, Int.cast_natCast] using h1, by simpa only [Int.cast_sub, Int.cast_natCast] using h2⟩
Distinct classes active at the same vertex receive different colours.
Given distinct offsets a ≠ b' in Fin 8 that are active at vertex v, their activity conditions reduce modulo 8 to activity in the finite model. By the finite model's disjointness property hcol, their colours ell((v - a) mod 8) and ell((v - b') mod 8) are distinct, meaning ell(v - a) ≠ ell(v - b') in ℤ.
uses
Int.cast_sub,Int.cast_natCast· intro v a b' hab ha hb simpa only [Int.cast_sub, Int.cast_natCast] using hcol (v : ZMod 8) a b' hab (by simpa only [Int.cast_sub, Int.cast_natCast] using ha) (by simpa only [Int.cast_sub, Int.cast_natCast] using hb)
cycle_power_dyadic_coloured_no_full_class_finite- There exists an 8-periodic boolean configuration and 4-colouring on ℤ/8ℤ satisfying the 4-colour bound, endpoints at 0 and 7 with a hole at 4, dyadic weight equality, size bound at most 6, constant active count 4, exact dyadic coverage, full ordinary coverage, and same-colour disjointness.
Int.cast_add- The canonical homomorphism from ℤ into an additive group preserves addition: ↑(m + n) = ↑m + ↑n.
Int.cast_ofNat- The canonical homomorphism from ℤ into a ring preserves numeral literals: ↑n = n.
add_zero- Adding zero on the right leaves an element unchanged: a + 0 = a.
Int.cast_sub- The canonical homomorphism from ℤ into an additive group preserves subtraction: ↑(m - n) = ↑m - ↑n.
Int.cast_natCast- Casting a natural number to a ring via the integers coincides with casting it directly: ↑(↑n) = ↑n.
- The theorem statement specifies period 448 on ℤ, but the underlying model factors through ℤ/8ℤ and therefore has period 8 (since 448 = 56 × 8).
- The finite model on ℤ/8ℤ is established by exhaustive computational verification (decide), which evaluates all cases directly rather than exhibiting paper proofs.
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_coloured_no_full_class_finite : ∃ (b : ZMod 8 → ℕ → Bool) (ell : ZMod 8 → ℕ), (∀ p, ell p < 4) ∧ (∀ p, b p 0 = true ∧ b p 7 = true ∧ b p 4 = false) ∧ (∀ p, cycle_power_dyadic_class_weight 3 (b p) = (range 8).sum (fun a => (b p a).toNat)) ∧ (∀ p, (range 8).sum (fun a => (b p a).toNat) ≤ 6) ∧ (∀ v : ZMod 8, (range 8).sum (fun a => (b (v - (a : ZMod 8)) a).toNat) = 4) ∧ (∀ (j : Fin 3) (v : ZMod 8), (range (2 ^ (j : ℕ))).sum (fun a => (b (v - (a : ZMod 8)) a && b (v - (a : ZMod 8)) (a + 8 - 2 ^ (j : ℕ))).toNat) = 1) ∧ (∀ (d : Fin 7) (v : ZMod 8), ∃ a ∈ range (8 - ((d : ℕ) + 1)), b (v - (a : ZMod 8)) a = true ∧ b (v - (a : ZMod 8)) (a + ((d : ℕ) + 1)) = true) ∧ (∀ (v : ZMod 8) (a b' : Fin 8), a ≠ b' → b (v - ((a : ℕ) : ZMod 8)) a = true → b (v - ((b' : ℕ) : ZMod 8)) b' = true → ell (v - ((a : ℕ) : ZMod 8)) ≠ ell (v - ((b' : ℕ) : ZMod 8))) := by let b : ZMod 8 → ℕ → Bool := fun p a => decide (a ∈ if p.val % 2 = 0 then ({0, 7} : Finset ℕ) else {0, 1, 2, 3, 6, 7}) let ell : ZMod 8 → ℕ := fun p => match p.val with | 0 => 0 | 1 => 2 | 2 => 3 | 3 => 0 | 4 => 1 | 5 => 3 | 6 => 2 | _ => 1 refine ⟨b, ell, ?_⟩ decidetheorem cycle_power_dyadic_coloured_no_full_class_counterexample : ∃ (x : ℤ → ℕ → Bool) (ell : ℤ → ℕ), (∀ p a, x (p + 448) a = x p a) ∧ (∀ p, ell (p + 448) = ell p) ∧ (∀ p, ell p < 4) ∧ (∀ p, x p 0 = true ∧ x p 7 = true ∧ x p 4 = false) ∧ (∀ p, cycle_power_dyadic_class_weight 3 (x p) = (range 8).sum (fun a => (x p a).toNat)) ∧ (∀ p, (range 8).sum (fun a => (x p a).toNat) ≤ 6) ∧ (∀ v : ℤ, (range 8).sum (fun a => (x (v - (a : ℤ)) a).toNat) = 4) ∧ (∀ j < 3, ∀ v : ℤ, (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 ∈ range (8 - d), x (v - (a : ℤ)) a = true ∧ x (v - (a : ℤ)) (a + d) = true) ∧ (∀ (v : ℤ) (a b : Fin 8), a ≠ b → x (v - ((a : ℕ) : ℤ)) a = true → x (v - ((b : ℕ) : ℤ)) b = true → ell (v - ((a : ℕ) : ℤ)) ≠ ell (v - ((b : ℕ) : ℤ))) := by obtain ⟨b, ell, hbnd, he, hw, hsize, hcount, hexact, hcover, hcol⟩ := cycle_power_dyadic_coloured_no_full_class_finite refine ⟨fun p a => b (p : ZMod 8) a, fun p => ell (p : ZMod 8), ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩ · intro p a simp only [Int.cast_add, Int.cast_ofNat] have hz : (448 : ZMod 8) = 0 := by decide rw [hz, add_zero] · intro p simp only [Int.cast_add, Int.cast_ofNat] have hz : (448 : ZMod 8) = 0 := by decide rw [hz, add_zero] · intro p; exact hbnd (p : ZMod 8) · intro p; exact he (p : ZMod 8) · intro p; exact hw (p : ZMod 8) · intro p; exact hsize (p : ZMod 8) · intro v simpa only [Int.cast_sub, Int.cast_natCast] using hcount (v : ZMod 8) · intro j hj v simpa only [Int.cast_sub, Int.cast_natCast] using hexact ⟨j, hj⟩ (v : ZMod 8) · intro d hd hd8 v have hlt : d - 1 < 7 := by omega have heq : d - 1 + 1 = d := by omega obtain ⟨a, ha, h1, h2⟩ := hcover ⟨d - 1, hlt⟩ (v : ZMod 8) simp only [heq] at ha h1 h2 exact ⟨a, ha, by simpa only [Int.cast_sub, Int.cast_natCast] using h1, by simpa only [Int.cast_sub, Int.cast_natCast] using h2⟩ · intro v a b' hab ha hb simpa only [Int.cast_sub, Int.cast_natCast] using hcol (v : ZMod 8) a b' hab (by simpa only [Int.cast_sub, Int.cast_natCast] using ha) (by simpa only [Int.cast_sub, Int.cast_natCast] using hb)