AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_defective_half_model

def

A dyadic half model with a Boolean defect: lower ranks have unique owners, top-rank ownership and the active count each lose one at a defect, with an explicit phase shift; every other distance is covered.

Statement

def cycle_power_dyadic_defective_half_model (t : ℕ) (y : ℤ → ℕ → Bool) (e : ℤ → Bool) (shift : ℤ) : Prop
Source
Defective half-model bookkeeping for research thread RT-1; two parity phases are distinguished explicitly.
Verified
09 Nov 2026
Axioms
none listed
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.
Used by 9

Lean source view module on GitHub

def cycle_power_dyadic_defective_half_model (t : ℕ) (y : ℤ → ℕ → Bool) (e : ℤ → Bool) (shift : ℤ) : Prop := (∀ p, cycle_power_dyadic_class_weight t (y p) = (Finset.range (2^t)).sum (fun a => (y p a).toNat)) ∧
    (∀ j, j + 1 < t → ∀ v : ℤ, (Finset.range (2^j)).sum (fun a =>
      (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+2^t-2^j)).toNat) = 1) ∧
    (∀ v : ℤ, (Finset.range (2^(t-1))).sum (fun a =>
      (y (v-(a : ℤ)) a && y (v-(a : ℤ)) (a+2^t-2^(t-1))).toNat) + (e (v+shift)).toNat = 1) ∧
    (∀ d : ℕ, 1 ≤ d → d < 2^t → d ≠ 2^(t-1) → ∀ v : ℤ,
      ∃ a : ℕ, a < 2^t-d ∧ y (v-(a : ℤ)) a = true ∧ y (v-(a : ℤ)) (a+d) = true) ∧
    (∀ v : ℤ, (Finset.range (2^t)).sum (fun a => (y (v-(a : ℤ)) a).toNat) + (e v).toNat = t+1)
See it in the graphDiscuss this resultChallenge it