cycle_power_dyadic_class_weight
def
The 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.
Statement
def cycle_power_dyadic_class_weight (m : ℕ) (b : ℕ → Bool) : ℕ- Source
- Uniform route for OP-205 and RT-1, arXiv:2610.15635 Section 3. Existing k=3,7,15 weight certificates suggest this dyadic tree. The sparse distance graph is obtained recursively by attaching one leaf to every vertex; tight classes are connected subtrees containing the distinguished endpoint edge.
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 107
- cycle_power_dyadic_tight_class_pruneDeleting a tight dyadic class's middle two quarters and compressing the remaining outer quarters preserves equality between its dyadic…
- cycle_power_dyadic_prune_single_distance_coverDeleting and compressing the middle quarters preserves coverage at one fixed distance d below the new radius, using only original coverage…
- cycle_power_dyadic_count_free_boundary_endpoint_counterexampleThere exists a radius-eight Boolean integer class model with tight classes, exact dyadic ownership, full ordinary distance coverage, and…
- cycle_power_dyadic_no_island_half_owner_orderIn a tight dyadic full-coverage class model with explicit no-island shapes, the root owning the next half-radius edge is at least the root…
- cycle_power_dyadic_no_island_cornerConditional uniform strong corner law for every cut of every dyadic radius in a tight two-interval full-cover model with exact dyadic…
- cycle_power_dyadic_tight_class_inner_imp_oneFor m ≥ 2 and a tight dyadic class b : ℕ → Bool at exponent m (class weight equal to class size) with b 1 = b (2^m - 2) and b (2i) = b…
- cycle_power_dyadic_defective_half_modelA dyadic half model with a Boolean defect: lower ranks have unique owners, top-rank ownership and the active count each lose one at a…
- cycle_power_dyadic_class_no_island_iff_end_shell_fullnessIn any tight exact full-coverage dyadic class model, two-end-interval/no-island shape is equivalent to this explicit condition on the…
- cycle_power_dyadic_no_island_of_alternating_pairedUniform induction step for the no-island class shape. Let m ≥ 1 and suppose every tight, exactly dyadically covered, fully ordinarily…
- cycle_power_dyadic_class_weight_eq_of_sum_eqIf the total sum of dyadic class weights over all residues equals the total sum of active counts, then pointwise equality holds for every…
- cycle_power_dyadic_overlap_reaches_upper_verticalIn any tight dyadic rooted model of radius2^(k+4) with all-rank exactness, full ordinary coverage and monotone outer eighths, any overlap…
- cycle_power_dyadic_weighted_threshold_weight_geCommon-threshold coupling of any finite natural-weighted mixture of dyadic profiles cannot decrease total dyadic class weight.
- cycle_power_four_zero_phase_corrected_count_periodicIn every exponent-two zero-phase defective half model, the lower-half active count plus the defect is two-periodic.
- 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_class_weight_dilateDuplicating each membership bit of a dyadic class doubles its dyadic class weight, when the original radius is at least two.
- cycle_power_dyadic_no_island_of_middle_full_pruneIn a tight exact full ordinary-cover dyadic integer model, current-scale middle-bit fullness alone implies that every class has no…
- cycle_power_dyadic_rank_count_balanceAt every nontrivial dyadic tree rank, exact long-edge coverage is a two-term occupancy balance L_j(v)+R_j(v+D-2^j)=1, uniformly in the…
- cycle_power_dyadic_two_distance_periodic_defect_counterexampleThere is a period-one exponent-four tight defective profile with exact lower dyadic ownership, the defective top-owner and active-count…
- cycle_power_dyadic_class_weight_parity_splitFor any Boolean class b and m >= 1, with D = 2^(m+1): the dyadic class weight of b at exponent m+1, plus [b_0 and b_(D-2)] plus [b_1 and…
- cycle_power_dyadic_model_dvd_of_no_islandA periodic optimally counted tight dyadic class model with proper class labels, exact dyadic edges and full ordinary coverage has period…
- cycle_power_dyadic_boundary_pairing_of_terminal_eight_lower_boundFor any dyadic radius at least eight, a periodic tight Boolean class model with exact dyadic-edge coverage and all ordinary coverage has…
- cycle_power_dyadic_gap_side_treeBetween two full roots at distance g at most the radius, the compressed sides of every interior tight class satisfy the tree identity:…
- cycle_power_dyadic_weighted_threshold_tightFor positive dyadic exponent, every common-threshold profile below total mixture mass is tight when all original profiles of the…
- cycle_power_dyadic_fold_struct_stepInduction step through the fold. If every model at exponent t (t ≥ 2) has alternating bit 1 and endpoint-only classes without bit 1, then…
- cycle_power_dyadic_fold_modelThe fold of a tight dyadic class model. If x is a tight, exactly dyadically covered, fully covered integer Boolean class model at exponent…
- cycle_power_dyadic_half_monotone_of_full_class_coverA tight exact full ordinary-cover dyadic integer model with a full class covering every vertex is monotone toward the endpoints separately…
- simple_graph_equivalence_covering_number_cycle_power_fifteen_of_not_dvdFor every even n ≥ 3825 = 15²·17 not divisible by 16, the equivalence covering number of the 15th power of the n-cycle is 6 = 2 + ⌈log₂…
- cycle_power_dyadic_outer_quarter_monotone_of_sixteen_block_coreConditional on upper-vertical exclusion only at dyadic block sizes h=2^j, every tight all-rank-exact fully ordinarily covered dyadic model…
- cycle_power_dyadic_no_island_middle_cornerConditional uniform corner law for every cut strictly between one quarter and one half of the dyadic radius, under tight two-interval…
- cycle_power_dyadic_zmod_model_tight_of_countsFor a positive exponent m, nonzero natural period n, and Boolean profiles indexed by ZMod n, exact dyadic edge-owner sums of one and…
- cycle_power_dyadic_prune_range_counterexampleThere is a period-12 tight radius-16 class model with exact dyadic long-edge coverage and full ordinary coverage, whose original active…
- cycle_power_dyadic_crossed_no_island_models_eqPairing conjecture for coupled no-island models. Let m ≥ 1 and let y, z : ℤ → ℕ → Bool be two integer Boolean class models at exponent m,…
- cycle_power_dyadic_sparse_defect_weightThe dyadic class weight of the sparse defect support is t for every t≥4.
- 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_model_dvd_of_endpoint_overlapA periodic optimal dyadic class model whose old active classes intersect the next endpoint class has period divisible by the dyadic…
- cycle_power_dyadic_outer_eighth_owner_orderIn a tight exact fully ordinarily covered dyadic model of radius2^(k+3), monotone outer eighths imply that roots owning consecutive edges…
- cycle_power_dyadic_full_gap_sides_convexIn a tight exact full ordinary-coverage dyadic model, all compressed sides between full roots zero and g are intervals when g lies between…
- cycle_power_dyadic_full_gap_class_no_islandIn a tight exact full ordinary-coverage dyadic model, every class rooted strictly between full roots zero and g has no selected island…
- simple_graph_cycle_power_dyadic_cover_class_modelEvery optimal dyadic cycle-power equivalence cover admits a faithful periodic integer class model with the original rooted classes and…
- cycle_power_dyadic_no_island_no_long_prefixConditional shape-model half-width theorem: a class with an initial selected interval extending strictly beyond half the radius cannot…
- cycle_power_dyadic_outer_eighth_cornerIn a tight exact fully ordinarily covered dyadic model of radius2^(k+3), suppose all outer eighths are monotone. For every root p and…
- cycle_power_dyadic_no_island_power_cornerConditional uniform dyadic corner law: in tight two-interval class profiles with exact dyadic edges and one ordinary-neighbour family, a…
- cycle_power_dyadic_sixteen_block_geometryEvery tight dyadic rooted model of radius2^(k+4), with all-rank exactness, full ordinary coverage and monotone outer eighths, satisfies…
- cycle_power_eight_corrected_count_upper_windowIn every zero-phase defective half model of exponent three, the corrected lower count at v is at least its value at v+4.
- cycle_power_sixteen_block_vertical_average_barrierEight tight radius16 dyadic profiles with positive integer weights totaling60 satisfy optimal mean size5, all exact dyadic pair averages,…
- cycle_power_dyadic_full_prune_fractional_counterexampleSeventeen genuine tight radius-64 dyadic rooted profiles with positive integer multiplicities totaling1192 have expected size7, exact…
- cycle_power_eight_period_six_model_without_counts_validThe explicit period-six model has endpoints, tight weights, exact dyadic edge coverage and full ordinary edge coverage, yet has a boundary…
- simple_graph_equivalence_covering_number_cycle_power_two_pow_even_not_dvd_of_fold_countConditional reduction of OP-205 to a single count identity plus a middle-bit lemma: if for every t ≥ 4 every model at exponent t+1 has…
- cycle_power_eight_corrected_count_lower_windowIn every zero-phase defective half model of exponent three, the corrected lower count at v is at most its value at v+4.
- cycle_power_dyadic_rank_right_drop_boundCoverage one step above a dyadic long distance bounds the drop in right-block occupancy by the old boundary-pair bit, after accounting for…
- cycle_power_dyadic_no_island_of_outer_projection_fullnessA tight exact full-coverage model has no-island class shape if every selected middle bit at EVERY direct outer projection level forces the…
- 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.
- cycle_power_four_zero_phase_half_no_defectsEvery exponent-two zero-phase defective half model has no defects.
- cycle_power_dyadic_class_weight_leFor every power-of-two arc length, the dyadic weighted number of selected pairs is at most the number of selected positions.
- cycle_power_dyadic_endpoint_overlap_of_no_islandConjectured local uniform geometry: if all tight dyadic classes are unions of an initial and terminal interval, with arbitrary unequal…
- simple_graph_equivalence_covering_number_cycle_power_two_pow_even_not_dvd_of_alternating_endpointConditional reduction of OP-205 to alternation and endpoint-only classes: if for every m ≥ 5 every tight, exactly dyadically covered,…
- cycle_power_dyadic_fold_periodicity_distance_one_counterexampleThere is an exponent-three tight zero-phase dyadic profile with exact lower-rank owners, the defective top-owner and active-count…
- cycle_power_dyadic_prune_count_of_lower_boundIn a finite periodic tight dyadic class model with original count t+1, a pointwise lower bound t on the pruned active counts implies exact…
- cycle_power_dyadic_half_monotone_count_barrierThere exists a3-periodic radius4 Boolean class model with tight class weights, all exact dyadic edge equations, all ordinary edge…
- cycle_power_dyadic_prune_count_iff_right_half_periodUnder the dyadic pruning balance hypotheses, preservation of active count t is equivalent to half-radius periodicity of right-half…
- simple_graph_equivalence_covering_number_cycle_power_dyadic_of_class_shapeUnder the numerical hypotheses of OP-205, the equivalence covering number is m+2 PROVIDED that every tight, exactly dyadically covered,…
- simple_graph_cycle_power_dyadic_cover_class_spanningEvery label class of an optimal m+1-layer cover at dyadic bandwidth is spanned by an endpoint-distance pair: each vertex lies in a class…
- cycle_power_dyadic_tight_class_spanningA nonempty subset attaining equality in the uniform dyadic weight bound contains both endpoints of its arc.
- cycle_power_dyadic_tight_class_middle_parentEquality in the uniform dyadic class weight bound forces each selected middle-quarter position to have its matched outer-quarter parent…
- cycle_power_dyadic_periodic_count_variation_counterexampleFinite period16 radius8 counterexample to recovering pointwise optimal scalar counts from periodic tightness and exact/ordinary coverage:…
- cycle_power_dyadic_coloured_no_full_class_counterexampleA period-448 integer radius-eight model with four real class colours has tight classes, constant active count four, every dyadic edge…
- cycle_power_dyadic_class_weight_congrThe dyadic class weight cycle_power_dyadic_class_weight m b depends only on the values b i for i < 2^m: if b i = b' i for every i < 2^m,…
- cycle_power_dyadic_hierarchy_half_monotone_of_middle_full_pruneA compatible hierarchy of tight exact full-coverage dyadic models has monotone endpoint halves at every level, provided every selected…
- cycle_power_dyadic_half_owner_order_of_middle_full_pruneIf selected middle bits force full prunes and the retained outer quarters are monotone toward the endpoints, then coverage only at the…
- cycle_power_dyadic_no_island_of_end_shell_fullnessIn a tight exact full-coverage model, class no-island shape follows from the explicit shell condition: selecting either offset a or its…
- cycle_power_dyadic_no_island_of_alternating_endpointInduction step without pairing. If every model at exponent m (m ≥ 2) has no island, then every tight, exactly dyadically covered, fully…
- cycle_power_dyadic_class_no_island_of_full_class_coverA positive-exponent integer dyadic rooted-class model with tight weights, exact dyadic pair ownership, all ordinary distance coverage, and…
- cycle_power_dyadic_class_weight_reflectThe dyadic class weight is invariant under reversing the offset interval.
- cycle_power_dyadic_no_island_middle_imp_full_pruneIf a tight dyadic two-interval class contains any middle-quarter vertex, deleting the middle two quarters leaves a full smaller class.…
- cycle_power_dyadic_outer_quarter_monotone_of_eight_block_extensionAssuming the local eight-block extension predicate at every positive block size, every tight exact fully ordinarily covered dyadic model…
- not_cycle_power_dyadic_tight_type_sequence_boundary_pairingThe proposed uniform layer-free boundary-pairing statement allowing m=2 is false: every class can have the constant type {0,1,3}. This…
- cycle_power_dyadic_no_island_rank_owner_orderUnder no-island class shape, tightness, exact dyadic edges and full ordinary coverage, the unique owner roots of consecutive edges are…
- cycle_power_dyadic_alternating_half_modelHalf models. In a tight, exactly dyadically covered, fully covered integer Boolean class model at exponent m+1 (m ≥ 2) with m+2 active…
- cycle_power_dyadic_outer_eighth_active_root_separationIn a tight model of radius2^(k+4) with monotone outer eighths and exact rank k ownership, two active seven-eighth roots are separated by…
- cycle_power_dyadic_reflect_defective_half_modelReflecting a defective half model reverses its defect function and changes its top-owner phase from shift to half-span minus shift.
- cycle_power_dyadic_left_defect_reaches_upper_verticalIn any tight dyadic rooted model of radius2^(k+4) with all-rank exactness, full ordinary coverage and monotone outer eighths, every…
- cycle_power_dyadic_model_dvd_of_label_periodA finite-period tight dyadic class model with proper labels, exact dyadic edges, neighbour coverage, and full-radius label period has…
- cycle_power_dyadic_defective_fold_model_of_corrected_periodicityFor any zero-phase defective dyadic model of exponent t+1, if the lower-half active count plus the defect is 2^t-periodic, folding each…
- cycle_power_dyadic_outer_projection_modelEvery valid direct outer projection preserves tight dyadic weight, exact dyadic edges and full ordinary coverage. No scalar active-count…
- cycle_power_dyadic_whole_class_fractional_counterexampleFive genuine tight radius-eight class shapes, with positive integer multiplicities totaling twelve, satisfy all dyadic exact-edge and…
- cycle_power_dyadic_half_monotone_of_middle_full_pruneOne uniform induction step: if all middle marks have full prunes and both retained outer quarters are monotone toward their endpoints,…
- cycle_power_dyadic_int_weight_le_cardFor a finite integer set of diameter at most 2^m-1, weight its endpoint-distance pairs by two and its other dyadic long-distance pairs by…
- cycle_power_fifteen_model_no_islandThe no-island class shape at exponent m = 4 (bandwidth 15), in the exact form the conditional theorem…
- cycle_power_dyadic_prune_coverDeleting each tight dyadic class's middle two quarters and compressing its outer quarters preserves coverage of all distances smaller than…
- cycle_power_dyadic_tight_class_internal_neighbourEvery selected nonendpoint offset of a tight dyadic class has a selected incident dyadic edge at some positive rank below its exponent.
- simple_graph_cycle_power_dyadic_class_model_tight_weightsEvery rooted dyadic class of an optimal cover is tight: the dyadic class weight of the arc equals its cardinality.
- cycle_power_dyadic_periodic_model_tight_of_countsFor a positive exponent m, nonzero natural period n, and periodic Boolean profiles indexed by the integers, exact dyadic edge-owner sums…
- cycle_power_dyadic_two_full_roots_overlap_emptyIn a tight exact dyadic model, an interior class between full roots zero and g, with g at most the radius, cannot select a vertex in the…
- cycle_power_dyadic_tight_two_interval_half_width_counterexampleA single tight rooted class with two end intervals can have a nonfull interval wider than half the radius. At radius eight the class is…
- cycle_power_dyadic_alternating_paired_of_pairingFor m ≥ 2, a tight, exactly dyadically covered integer Boolean class model x : ℤ → ℕ → Bool at exponent m with x p 1 = x p (2^m - 2) for…
- cycle_power_dyadic_class_weight_as_tree_edgesFor a positive-exponent dyadic profile containing both endpoints, its weighted class count is one plus its unweighted number of selected…
- cycle_power_dyadic_alternating_half_tightIn a tight, exactly dyadically covered model at exponent m+1 (m >= 1) with alternating bit 1, for every class with bit 1 both its even…
- cycle_power_dyadic_end_shell_fullness_of_no_islandConversely, no-island shape in a tight exact full-coverage dyadic model forces both complete dyadic end blocks whenever either next-shell…
- cycle_power_dyadic_domain_wall_tightEvery rooted profile in the explicit count-free nonperiodic radius-eight model is tight in the dyadic class-weight inequality.
- cycle_power_dyadic_no_island_of_alternating_halvesAlignment conjecture. In a tight, exactly dyadically covered, fully covered integer Boolean class model at exponent m+1 (m ≥ 2) with m+2…
- cycle_power_dyadic_count_free_nonperiodic_shape_counterexampleThere exists a genuinely nonperiodic tight radius-eight integer class system with exact dyadic edge ownership and coverage of every…
- cycle_power_fifteen_model_alternating_endpointAt exponent 4 (bandwidth 15) every tight, exactly dyadically covered, fully covered integer Boolean class model with five active classes…
- cycle_power_dyadic_half_monotone_of_middle_full_and_pruned_monoCurrent middle-bit fullness and monotonicity of both halves of the pruned model imply monotonicity of both original halves, in a tight…
- simple_graph_equivalence_covering_number_cycle_power_two_pow_even_not_dvd_of_alternating_pairedConditional resolution of OP-205: if, for every m ≥ 5, every tight, exactly dyadically covered, fully ordinarily covered integer Boolean…
- cycle_power_dyadic_prune_count_balanceTight dyadic classes with constant active count t+1 and exact half-distance coverage satisfy the exact pruning balance…
- cycle_power_dyadic_tight_class_parentEquality in the dyadic class weight bound forces all rooted-tree parent implications at every smaller dyadic scale, uniformly in the arc…
- cycle_power_dyadic_only_coloured_cover_counterexampleAt radius eight and period twenty, four real class colours can coexist with tight classes, constant active count four, exact coverage of…
Lean source view module on GitHub
def cycle_power_dyadic_class_weight (m : ℕ) (b : ℕ → Bool) : ℕ := 2 * (b 0 && b (2 ^ m - 1)).toNat + (Finset.range m).sum (fun j => if j = 0 then 0 else (Finset.range (2 ^ j)).sum (fun i => (b i && b (i + 2 ^ m - 2 ^ j)).toNat))