cycle_power_sixteen_block_vertical_average_barrier
Eight tight radius16 dyadic profiles with positive integer weights totaling60 satisfy optimal mean size5, all exact dyadic pair averages, every ordinary pair-coverage average, and monotone outer eighths; the weighted upper-vertical defect at offsets1/3 nevertheless has mass8. Thus zero upper-vertical density does not follow from these single-class average constraints.
Statement
theorem cycle_power_sixteen_block_vertical_average_barrier : ∃ (b : Fin 8 → ℕ → Bool) (w : Fin 8 → ℕ), (∑ i, w i) = 60 ∧ (∀ i, 0 < w i) ∧ (∀ i, b i 0 = true ∧ b i 15 = true) ∧ (∀ i, cycle_power_dyadic_class_weight 4 (b i) = (Finset.range 16).sum (fun a => (b i a).toNat)) ∧ (∀ i, (∀ a c : Fin 2, a ≤ c → b i c = true → b i a = true) ∧ (∀ a c : Fin 16, 14 ≤ (a : ℕ) → a ≤ c → b i a = true → b i c = true)) ∧ (∑ i, w i * (Finset.range 16).sum (fun a => (b i a).toNat)) = 300 ∧ (∀ j : Fin 4, (∑ i, w i * (Finset.range (2^(j : ℕ))).sum (fun a => (b i a && b i (a+16-2^(j : ℕ))).toNat)) = 60) ∧ (∀ d : Fin 15, 60 ≤ ∑ i, w i * (Finset.range (16-((d : ℕ)+1))).sum (fun a => (b i a && b i (a+((d : ℕ)+1))).toNat)) ∧ (∑ i, w i * (b i 3 && !(b i 1)).toNat) = 8
- Source
- Uniform-route audit for OP-205 / RT-1, following arXiv:2610.15635. Experiment8260 finds this independent-class mixture. This refutes only the averaged zero-vertical-density shortcut, not an integer rooted model or graph covering claim.
- Verified
- 29 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 theorem is proved by exhibiting an explicit finite counterexample. Eight 16-bit profiles are defined via bitmasks alongside eight positive integer weights summing to 60. All nine constraints—including boundary tightness, dyadic class weights, monotonicity on the outer eighths, dyadic and pair-coverage averages, and the non-zero defect mass of 8—are then verified by direct finite computation.
To establish existence, it suffices to show that the explicit candidate profiles b and weights w satisfy the nine required conditions.
We exhibit an explicit witness family: eight 16-bit binary profiles b₀, …, b₇ defined by the bit patterns of the integers 32769, 32777, 49155, 49161, 57351, 57735, 64575, and 65151, along with the positive integer weights w = (24, 4, 12, 4, 1, 5, 5, 5). Instantiating the existential quantifiers with these explicit witnesses leaves nine concrete claims to be verified.
let masks : Fin 8 → ℕ := ![32769,32777,49155,49161,57351,57735,64575,65151] let b : Fin 8 → ℕ → Bool := fun i a => (masks i).testBit a let w : Fin 8 → ℕ := ![24,4,12,4,1,5,5,5] refine ⟨b,w,?_,?_,?_,?_,?_,?_,?_,?_,?_⟩
All nine properties hold for the chosen profiles b and weights w. automation
Each of the nine conditions—the weight sum of 60, strict positivity, boundary tightness, dyadic class weights, outer-eighths monotonicity, optimal mean size of 5 (total 300), dyadic pair averages, pair-coverage lower bounds, and the defect mass of 8—consists solely of bounded sums, bitwise operations, and inequalities over finite domains (Fin 8, Fin 16, Fin 4, Fin 15). Lean's `decide` tactic checks every condition by direct finite evaluation.
all_goals decide
- The verification of all nine conditions is performed automatically by Lean's kernel evaluator via `decide` by exhaustive computation over the small finite domains, rather than through symbolic lemma-based deduction.
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.
theorem cycle_power_sixteen_block_vertical_average_barrier : ∃ (b : Fin 8 → ℕ → Bool) (w : Fin 8 → ℕ), (∑ i, w i) = 60 ∧ (∀ i, 0 < w i) ∧ (∀ i, b i 0 = true ∧ b i 15 = true) ∧ (∀ i, cycle_power_dyadic_class_weight 4 (b i) = (Finset.range 16).sum (fun a => (b i a).toNat)) ∧ (∀ i, (∀ a c : Fin 2, a ≤ c → b i c = true → b i a = true) ∧ (∀ a c : Fin 16, 14 ≤ (a : ℕ) → a ≤ c → b i a = true → b i c = true)) ∧ (∑ i, w i * (Finset.range 16).sum (fun a => (b i a).toNat)) = 300 ∧ (∀ j : Fin 4, (∑ i, w i * (Finset.range (2^(j : ℕ))).sum (fun a => (b i a && b i (a+16-2^(j : ℕ))).toNat)) = 60) ∧ (∀ d : Fin 15, 60 ≤ ∑ i, w i * (Finset.range (16-((d : ℕ)+1))).sum (fun a => (b i a && b i (a+((d : ℕ)+1))).toNat)) ∧ (∑ i, w i * (b i 3 && !(b i 1)).toNat) = 8 := by let masks : Fin 8 → ℕ := ![32769,32777,49155,49161,57351,57735,64575,65151] let b : Fin 8 → ℕ → Bool := fun i a => (masks i).testBit a let w : Fin 8 → ℕ := ![24,4,12,4,1,5,5,5] refine ⟨b,w,?_,?_,?_,?_,?_,?_,?_,?_,?_⟩ all_goals decide