AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_sparse_defect_weight

theoremverified

The dyadic class weight of the sparse defect support is t for every t≥4.

Statement

theorem cycle_power_dyadic_sparse_defect_weight (t : ℕ) (ht : 4 ≤ t) :
  cycle_power_dyadic_class_weight t (fun a => decide (a ∈ cycle_power_dyadic_sparse_defect_support t)) = t
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
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

The proof, explained

The dyadic class weight of a subset S at scale t is defined as 2 * [0 ∈ S ∧ 2^t - 1 ∈ S] plus the sum over 1 ≤ j < t of the rank correlation counts R(j). For the sparse defect support S, both boundary elements 0 and 2^t - 1 belong to S, contributing 2 * 1 = 2. The rank sum decomposes into t - 3 lower ranks (each equal to 1), the penultimate rank (equal to 1), and the top rank (equal to 0), totaling (t - 3) + 1 + 0 = t - 2. Adding the boundary contribution 2 and the rank sum t - 2 gives the total weight t.

  1. Define the sparse defect support S and the rank correlation counts R(j).

    Under classical logic, let S denote the sparse defect support Finset for parameter t, and define R(j) as the number of matching pairs (a, a + 2^t - 2^j) with both elements in S and a < 2^j.

    lines 3–6

      classical
      let S := cycle_power_dyadic_sparse_defect_support t
      let R : ℕ → ℕ := fun j => (Finset.range (2^j)).sum (fun a =>
        (decide (a ∈ S) && decide (a + 2^t - 2^j ∈ S)).toNat)
  2. 0 ∈ S.

    By the definition of the sparse defect support S, 0 is an element of its first constituent Finset {0, 2^(t-2) - 1}.

    line 7

      have hzero : 0 ∈ S := by simp [S, cycle_power_dyadic_sparse_defect_support]
  3. 2^t - 1 ∈ S.

    The support S contains the image of r ↦ 2^t - 2^r for r < t - 2. Since t ≥ 4, r = 0 is in this range, which yields 2^t - 2^0 = 2^t - 1 ∈ S.

    lines 8–12

    uses Finset.mem_union_right, Finset.mem_image.mpr, Finset.mem_range.mpr

      have hlast : 2^t-1 ∈ S := by
        change 2^t-1 ∈ ({0,2^(t-2)-1} : Finset ℕ) ∪ (Finset.range (t-2)).image (fun r => 2^t-2^r)
        apply Finset.mem_union_right
        refine Finset.mem_image.mpr ⟨0, Finset.mem_range.mpr (by omega), ?_⟩
        simp
  4. The sum of the rank terms for 0 ≤ j < t - 2 is t - 3.

    For j = 0 the summand is defined to be 0. For each 1 ≤ j < t - 2, we have j + 2 < t, so cycle_power_dyadic_sparse_defect_lower_rank gives R(j) = 1. Peeling off the j = 0 term with Finset.sum_range_succ' leaves t - 3 terms of value 1, summing to t - 3.

    lines 13–25

    uses Finset.sum_congr, if_neg, cycle_power_dyadic_sparse_defect_lower_rank, Finset.mem_range.mp, Finset.sum_range_succ'

      have hbase : (∑ j ∈ Finset.range (t-2), if j=0 then 0 else R j) = t-3 := by
        have heq : (∑ j ∈ Finset.range (t-2), if j=0 then 0 else R j) =
            ∑ j ∈ Finset.range (t-2), if j=0 then 0 else 1 := by
          apply Finset.sum_congr rfl
          intro j hj
          by_cases h : j=0
          · simp [h]
          · simp only [if_neg h]
            exact cycle_power_dyadic_sparse_defect_lower_rank t j ht (by have := Finset.mem_range.mp hj; omega)
        rw [heq]
        have hn : t-2=(t-3)+1 := by omega
        rw [hn, Finset.sum_range_succ']
        simp
  5. At the penultimate rank, R(t - 2) = 1.

    This is the statement of the penultimate rank evaluation lemma, cycle_power_dyadic_sparse_defect_penultimate_rank.

    line 26

    uses cycle_power_dyadic_sparse_defect_penultimate_rank

      have hpen : R (t-2) = 1 := cycle_power_dyadic_sparse_defect_penultimate_rank t ht
  6. At the top rank, R(t - 1) = 0.

    Because (t - 2) + 1 = t - 1, this rank is the top rank, whose correlation count vanishes by cycle_power_dyadic_sparse_defect_top_rank.

    lines 27–29

    uses cycle_power_dyadic_sparse_defect_top_rank

      have htop : R ((t-2)+1) = 0 := by
        have h : (t-2)+1=t-1 := by omega
        simpa [R,h] using cycle_power_dyadic_sparse_defect_top_rank t ht
  7. The sum of all rank terms for 0 ≤ j < t is t - 2.

    Decomposing the range t as (t - 2) + 1 + 1 using Finset.sum_range_succ isolates the two top terms at indices t - 2 and t - 1. Since t ≥ 4, neither index is zero. Substituting the base sum t - 3, R(t - 2) = 1, and R(t - 1) = 0 gives (t - 3) + 1 + 0 = t - 2.

    lines 30–36

    uses Finset.sum_range_succ, if_neg

      have hne1 : t-2 ≠ 0 := by omega
      have hne2 : (t-2)+1 ≠ 0 := by omega
      have ht' : t=(t-2)+1+1 := by omega
      have htotal : (∑ j ∈ Finset.range t, if j=0 then 0 else R j) = t-2 := by
        conv_lhs => rw [ht', Finset.sum_range_succ, Finset.sum_range_succ]
        simp only [if_neg hne1, if_neg hne2, hbase, hpen, htop]
        omega
  8. The dyadic class weight of the sparse defect support is t.

    Unfolding the definition of cycle_power_dyadic_class_weight, the weight is 2 * [0 ∈ S ∧ 2^t - 1 ∈ S] + ∑_{j < t, j ≠ 0} R(j). Substituting 0 ∈ S and 2^t - 1 ∈ S makes the boundary term 2 * 1 = 2, and adding the rank sum t - 2 yields 2 + (t - 2) = t.

    lines 37–40

    uses decide_true, Bool.true_and, Bool.toNat_true

      change 2 * (decide (0 ∈ S) && decide (2^t-1 ∈ S)).toNat +
        (∑ j ∈ Finset.range t, if j=0 then 0 else R j) = t
      simp only [hzero, hlast, decide_true, Bool.true_and, Bool.toNat_true, htotal]
      omega
Finset.mem_union_right
An element belonging to the second set of a union belongs to the union.
Finset.mem_image.mpr
An element y is in the image f(s) if there exists some x ∈ s with f(x) = y.
Finset.mem_range.mpr
If an index is strictly less than n, it belongs to the range 0, ..., n - 1.
Finset.sum_congr
Two finite sums over the same set are equal if their summands agree at every element.
if_neg
An if-then-else expression evaluates to its else branch when the condition is false.
cycle_power_dyadic_sparse_defect_lower_rank
For any rank j satisfying j + 2 < t, the correlation count R(j) for the sparse defect support equals 1.
Finset.mem_range.mp
An element belonging to the range 0, ..., n - 1 is strictly less than n.
Finset.sum_range_succ'
A sum over 0, ..., n splits into the term at 0 and the remaining terms shifted to 0, ..., n - 1.
cycle_power_dyadic_sparse_defect_penultimate_rank
At the penultimate rank j = t - 2, the correlation count R(t - 2) for the sparse defect support equals 1.
cycle_power_dyadic_sparse_defect_top_rank
At the top rank j = t - 1, the correlation count R(t - 1) for the sparse defect support equals 0.
Finset.sum_range_succ
A sum over 0, ..., n splits into the sum over 0, ..., n - 1 plus the final term at index n.
decide_true
Deciding a proposition that is true yields the boolean true.
Bool.true_and
The boolean conjunction true && b simplifies to b.
Bool.toNat_true
The natural number conversion of the boolean true is 1.

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

theorem cycle_power_dyadic_sparse_defect_weight (t : ℕ) (ht : 4 ≤ t) :  cycle_power_dyadic_class_weight t (fun a => decide (a ∈ cycle_power_dyadic_sparse_defect_support t)) = t := by  classical  let S := cycle_power_dyadic_sparse_defect_support t  let R : ℕ → ℕ := fun j => (Finset.range (2^j)).sum (fun a =>    (decide (a ∈ S) && decide (a + 2^t - 2^j ∈ S)).toNat)  have hzero : 0 ∈ S := by simp [S, cycle_power_dyadic_sparse_defect_support]  have hlast : 2^t-1 ∈ S := by    change 2^t-1 ∈ ({0,2^(t-2)-1} : Finset ℕ) ∪ (Finset.range (t-2)).image (fun r => 2^t-2^r)    apply Finset.mem_union_right    refine Finset.mem_image.mpr ⟨0, Finset.mem_range.mpr (by omega), ?_⟩    simp  have hbase : (∑ j ∈ Finset.range (t-2), if j=0 then 0 else R j) = t-3 := by    have heq : (∑ j ∈ Finset.range (t-2), if j=0 then 0 else R j) =        ∑ j ∈ Finset.range (t-2), if j=0 then 0 else 1 := by      apply Finset.sum_congr rfl      intro j hj      by_cases h : j=0      · simp [h]      · simp only [if_neg h]        exact cycle_power_dyadic_sparse_defect_lower_rank t j ht (by have := Finset.mem_range.mp hj; omega)    rw [heq]    have hn : t-2=(t-3)+1 := by omega    rw [hn, Finset.sum_range_succ']    simp  have hpen : R (t-2) = 1 := cycle_power_dyadic_sparse_defect_penultimate_rank t ht  have htop : R ((t-2)+1) = 0 := by    have h : (t-2)+1=t-1 := by omega    simpa [R,h] using cycle_power_dyadic_sparse_defect_top_rank t ht  have hne1 : t-2 ≠ 0 := by omega  have hne2 : (t-2)+1 ≠ 0 := by omega  have ht' : t=(t-2)+1+1 := by omega  have htotal : (∑ j ∈ Finset.range t, if j=0 then 0 else R j) = t-2 := by    conv_lhs => rw [ht', Finset.sum_range_succ, Finset.sum_range_succ]    simp only [if_neg hne1, if_neg hne2, hbase, hpen, htop]    omega  change 2 * (decide (0 ∈ S) && decide (2^t-1 ∈ S)).toNat +    (∑ j ∈ Finset.range t, if j=0 then 0 else R j) = t  simp only [hzero, hlast, decide_true, Bool.true_and, Bool.toNat_true, htotal]  omega
See it in the graphDiscuss this resultChallenge it