cycle_power_dyadic_neighbour_pair_count
def
The finite neighbour pair sum. For ranks j strictly below m, it counts selected pairs at distance 2^m minus 2^j minus one in the dyadic arc.
Statement
def cycle_power_dyadic_neighbour_pair_count (m j : ℕ) (b : ℕ → Bool) : ℕ- Source
- Uniform helpers for OP-205 / RT-1 following arXiv:2610.15635, Section 3. The neighbour-weight induction and central occurrence are class-model helpers; they do not prove the unresolved covering number. No research advance is claimed.
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 5
- cycle_power_dyadic_neighbour_pair_count_prune_topAt the boundary rank of middle-quarter pruning, the neighbour pair count changes by exactly four boundary bits.
- cycle_power_dyadic_central_position_existsIn a periodic tight dyadic class model with exact dyadic coverage and coverage at all lower neighbour distances, some class uses one of…
- cycle_power_dyadic_neighbour_pair_count_prune_lowDeleting the middle two quarters preserves each strictly smaller neighbour pair count.
- cycle_power_dyadic_neighbour_weight_boundA tight rooted dyadic class satisfies a uniform weighted bound for the ordinary distances one below the dyadic long distances, with a…
- cycle_power_dyadic_neighbour_pair_count_top_boundThe largest neighbour pair count of a tight rooted class is controlled by its middle-quarter leaves and the two central bits.
Lean source view module on GitHub
open Finset def cycle_power_dyadic_neighbour_pair_count (m j : ℕ) (b : ℕ → Bool) : ℕ := (range (2 ^ j + 1)).sum (fun a => (b a && b (a + 2 ^ m - 2 ^ j - 1)).toNat)