cycle_power_dyadic_sparse_defect_support
def
For exponent t, the sparse constant defect support consists of 0, 2^(t−2)−1, and 2^t−2^j for all j<t−2.
Statement
def cycle_power_dyadic_sparse_defect_support (t : ℕ) : Finset ℕ- Source
- RT-1 and OP-205, arXiv:2610.15635. The sparse constant family was identified in experiment 22695; it is a weakened-coverage obstruction, not a full graph-cover model.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 7
- cycle_power_dyadic_sparse_defect_two_covered_distancesFor each t≥4, the support covers distances 1 and 3·2^(t−2)−1.
- cycle_power_dyadic_sparse_defect_weightThe dyadic class weight of the sparse defect support is t for every t≥4.
- cycle_power_dyadic_sparse_defect_family_missing_distanceFor every t≥4, no two support points differ by 2^(t−2)−2.
- cycle_power_dyadic_sparse_defect_support_cardFor each t≥4, the sparse defect support contains exactly t points.
- cycle_power_dyadic_sparse_defect_top_rankAt t≥4, the sparse support has no pair at the top dyadic distance 2^(t−1).
- cycle_power_dyadic_sparse_defect_penultimate_rankAt t≥4, there is exactly one support pair at distance 2^t−2^(t−2).
- cycle_power_dyadic_sparse_defect_lower_rankFor t≥4 and j<t−2, the unique support pair at dyadic distance 2^t−2^j has first coordinate 0.
Lean source view module on GitHub
def cycle_power_dyadic_sparse_defect_support (t : ℕ) : Finset ℕ := let q := 2^(t-2) ({0, q-1} : Finset ℕ) ∪ (Finset.range (t-2)).image (fun j => 2^t - 2^j)