AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_sixteen_block_geometry

theoremverified

Every tight dyadic rooted model of radius2^(k+4), with all-rank exactness, full ordinary coverage and monotone outer eighths, satisfies the explicit sixteen-block Geometry conditions at h=2^k. This is a faithful bridge with no graph-covering conclusion.

Statement

theorem cycle_power_dyadic_sixteen_block_geometry
    (k : ℕ) (x : ℤ → ℕ → Bool)
    (htight : ∀ p, cycle_power_dyadic_class_weight (k+4) (x p) =
      (range (2^(k+4))).sum (fun a => (x p a).toNat))
    (hexact : ∀ j < k+4, ∀ v : ℤ, (range (2^j)).sum (fun a =>
      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^j)).toNat) = 1)
    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(k+4) → ∀ v : ℤ,
      ∃ a : ℕ, a < 2^(k+4)-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true)
    (houter : ∀ p : ℤ,
      (∀ a b : ℕ, a ≤ b → b < 2^(k+1) → x p b = true → x p a = true) ∧
      (∀ a b : ℕ, 7*2^(k+1) ≤ a → a ≤ b → b < 2^(k+4) → x p a = true → x p b = true))
 : CyclePowerSixteenBlock.Geometry (2^k) x
Source
Uniform structural reduction for OP-205 / RT-1 following arXiv:2610.15635. The main covering theorem and vertical-defect exclusion remain open. Experiments8048/8049 suggested the two ordinary distances; the proof is uniform in h and uses Lean only. No advance flag.
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
Used by 3

The proof, explained

The proof establishes that a tight dyadic rooted model of radius $2^{k+4}$ satisfies the eleven geometric conditions defining `CyclePowerSixteenBlock.Geometry` with block size $h = 2^k$. Using the identification $2^{k+4} = 16h$, the tightness hypothesis is instantiated via `cycle_power_dyadic_tight_class_parent` at dyadic scales $k+3$, $k+2$, and $k+1$ to deduce the parent-child implication rules at scales $8h$, $4h$, and $2h$. Similarly, specializing the exactness hypothesis at these same ranks yields the required diagonal coincidence sums with shifts $12h$, $14h$, and $15h$, and the remaining endpoint, monotonicity, and coverage requirements are matched directly against the model's hypotheses.

  1. Define $h = 2^k$ and express powers of 2 up to $2^{k+4}$ as multiples of $h$.

    Setting the block size $h = 2^k$, successive applications of the successor rule for powers ($2^{n+1} = 2^n \cdot 2$ via `pow_succ`) and linear integer arithmetic show that $2^{k+1} = 2h$, $2^{k+2} = 4h$, $2^{k+3} = 8h$, and $2^{k+4} = 16h$.

    lines 17–21

    uses pow_succ

      let h := 2^k
      have h1 : 2^(k+1)=2*h := by dsimp [h]; rw [pow_succ]; omega
      have h2 : 2^(k+2)=4*h := by rw [show k+2=(k+1)+1 by omega,pow_succ,h1]; omega
      have h3 : 2^(k+3)=8*h := by rw [show k+3=(k+2)+1 by omega,pow_succ,h2]; omega
      have h4 : 2^(k+4)=16*h := by rw [show k+4=(k+3)+1 by omega,pow_succ,h3]; omega
  2. The model satisfies the parent-child condition `parent4` at scale $8h$.

    For any position $r \in \mathbb{Z}$ and $a < 8h$, we apply `cycle_power_dyadic_tight_class_parent` to the tightness hypothesis `htight r` at scale $j = k+3$ with total radius $m = k+4$. Since $2^{k+3} = 8h$, the threshold $2^{k+3-1} = 4h$, and the offset $2^{k+4} - 2^{k+3} = 8h$, simplifying by these identities yields that $x(r, a + 8h) = \text{true} \implies x(r, a) = \text{true}$ when $a < 4h$, and $x(r, a) = \text{true} \implies x(r, a + 8h) = \text{true}$ when $4h \le a < 8h$.

    lines 22–28

    uses cycle_power_dyadic_tight_class_parent

      have hp4 : ∀ p a, a < 8*h →
          (a < 4*h → x p (a+8*h) = true → x p a = true) ∧
          (4*h ≤ a → x p a = true → x p (a+8*h) = true) := by
        intro r a ha
        have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+3) (by omega) (by omega) (x r) (htight r) a (by omega)
        have hi : a+2^(k+4)-2^(k+3)=a+8*h := by omega
        simpa only [show k+3-1=k+2 by omega,h2,hi] using hp
  3. The model satisfies the parent-child condition `parent6` at scale $4h$.

    For any $r \in \mathbb{Z}$ and $a < 4h$, applying `cycle_power_dyadic_tight_class_parent` at scale $j = k+2$ with $m = k+4$ yields the condition at threshold $2^{k+2-1} = 2h$ with offset $2^{k+4} - 2^{k+2} = 12h$: namely, $x(r, a + 12h) = \text{true} \implies x(r, a) = \text{true}$ for $a < 2h$, and $x(r, a) = \text{true} \implies x(r, a + 12h) = \text{true}$ for $2h \le a < 4h$.

    lines 29–35

    uses cycle_power_dyadic_tight_class_parent

      have hp6 : ∀ p a, a < 4*h →
          (a < 2*h → x p (a+12*h) = true → x p a = true) ∧
          (2*h ≤ a → x p a = true → x p (a+12*h) = true) := by
        intro r a ha
        have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+2) (by omega) (by omega) (x r) (htight r) a (by omega)
        have hi : a+2^(k+4)-2^(k+2)=a+12*h := by omega
        simpa only [show k+2-1=k+1 by omega,h1,hi] using hp
  4. The model satisfies the parent-child condition `parent7` at scale $2h$.

    For any $r \in \mathbb{Z}$ and $a < 2h$, applying `cycle_power_dyadic_tight_class_parent` at scale $j = k+1$ with $m = k+4$ yields the condition at threshold $2^{k+1-1} = h$ with offset $2^{k+4} - 2^{k+1} = 14h$: $x(r, a + 14h) = \text{true} \implies x(r, a) = \text{true}$ for $a < h$, and $x(r, a) = \text{true} \implies x(r, a + 14h) = \text{true}$ for $h \le a < 2h$.

    lines 36–42

    uses cycle_power_dyadic_tight_class_parent

      have hp7 : ∀ p a, a < 2*h →
          (a < h → x p (a+14*h) = true → x p a = true) ∧
          (h ≤ a → x p a = true → x p (a+14*h) = true) := by
        intro r a ha
        have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+1) (by omega) (by omega) (x r) (htight r) a (by omega)
        have hi : a+2^(k+4)-2^(k+1)=a+14*h := by omega
        simpa only [show k+1-1=k by omega,hi] using hp
  5. The model satisfies the exactness condition `exact6` for shift $12h$.

    Specializing the all-rank exactness hypothesis `hexact` to rank $j = k+2$ gives a diagonal sum of 1 over the range $2^{k+2} = 4h$ with offset $2^{k+4} - 2^{k+2} = 16h - 4h = 12h$, matching the specification of `exact6`.

    lines 43–47

      have he6 : ∀ v : ℤ, (range (4*h)).sum (fun a =>
          (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+12*h)).toNat) = 1 := by
        intro v
        have hi (a : ℕ) : a+16*h-4*h=a+12*h := by omega
        simpa only [h4,h2,hi] using hexact (k+2) (by omega) v
  6. The model satisfies the exactness condition `exact7` for shift $14h$.

    Specializing `hexact` to rank $j = k+1$ gives a diagonal sum of 1 over the range $2^{k+1} = 2h$ with offset $2^{k+4} - 2^{k+1} = 16h - 2h = 14h$, matching `exact7`.

    lines 48–52

      have he7 : ∀ v : ℤ, (range (2*h)).sum (fun a =>
          (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+14*h)).toNat) = 1 := by
        intro v
        have hi (a : ℕ) : a+16*h-2*h=a+14*h := by omega
        simpa only [h4,h1,hi] using hexact (k+1) (by omega) v
  7. The model satisfies the exactness condition `exact15` for shift $15h$.

    Specializing `hexact` to rank $j = k$ gives a diagonal sum of 1 over the range $2^k = h$ with offset $2^{k+4} - 2^k = 16h - h = 15h$, matching `exact15`.

    lines 53–57

      have he15 : ∀ v : ℤ, (range h).sum (fun a =>
          (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1 := by
        intro v
        have hi (a : ℕ) : a+16*h-h=a+15*h := by omega
        simpa only [h4,show 2^k=h by rfl,hi] using hexact k (by omega) v
  8. The sixteen-block geometry structure `CyclePowerSixteenBlock.Geometry h x` is fully assembled.

    All eleven fields of `CyclePowerSixteenBlock.Geometry h x` are supplied: positivity $h > 0$ from `Nat.two_pow_pos`; true endpoints at $0$ and $16h - 1$ from `cycle_power_dyadic_exact_endpoints`; lower monotonicity on $[0, 2h)$ and upper monotonicity on $[14h, 16h)$ from the outer monotonicity hypothesis `houter`; parent propagation conditions from `hp4`, `hp6`, and `hp7`; exact diagonal sums from `he6`, `he7`, and `he15`; and coverage of all distances $1 \le d < 16h$ from `hcover`. Concluding with `exact M` completes the proof.

    lines 58–70

    uses Nat.two_pow_pos, cycle_power_dyadic_exact_endpoints

      have M : CyclePowerSixteenBlock.Geometry h x := {
        pos := Nat.two_pow_pos k
        ends := by simpa only [h4] using cycle_power_dyadic_exact_endpoints (k+4) (by omega) x hexact
        lowMono := by simpa only [h1] using fun p => (houter p).1
        highMono := by simpa only [h1,h4,show 7*(2*h)=14*h by omega] using fun p => (houter p).2
        parent4 := hp4
        parent6 := hp6
        parent7 := hp7
        exact6 := he6
        exact7 := he7
        exact15 := he15
        cover := by simpa only [h4] using hcover }
      exact M
pow_succ
For any monoid element $a$ and natural number $n$, $a^{n+1} = a^n \cdot a$.
cycle_power_dyadic_tight_class_parent
In a tight dyadic class of order $m$, for any dyadic scale $1 \le j < m$ and index $a < 2^j$, a true bit at $a + 2^m - 2^j$ implies a true bit at $a$ when $a < 2^{j-1}$, and a true bit at $a$ implies a true bit at $a + 2^m - 2^j$ when $2^{j-1} \le a$.
Nat.two_pow_pos
For any natural number $w$, $2^w > 0$.
cycle_power_dyadic_exact_endpoints
If a dyadic model of radius $2^m$ satisfies diagonal exactness at all ranks $j < m$, then every sequence $x(p, \cdot)$ has true bits at both endpoints: $x(p, 0) = \text{true}$ and $x(p, 2^m - 1) = \text{true}$.

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

open Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem cycle_power_dyadic_sixteen_block_geometry    (k : ℕ) (x : ℤ → ℕ → Bool)    (htight : ∀ p, cycle_power_dyadic_class_weight (k+4) (x p) =      (range (2^(k+4))).sum (fun a => (x p a).toNat))    (hexact : ∀ j < k+4, ∀ v : ℤ, (range (2^j)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(k+4)-2^j)).toNat) = 1)    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(k+4) → ∀ v : ℤ,      ∃ a : ℕ, a < 2^(k+4)-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true)    (houter : ∀ p : ℤ,      (∀ a b : ℕ, a ≤ b → b < 2^(k+1) → x p b = true → x p a = true) ∧      (∀ a b : ℕ, 7*2^(k+1) ≤ a → a ≤ b → b < 2^(k+4) → x p a = true → x p b = true)) : CyclePowerSixteenBlock.Geometry (2^k) x := by  let h := 2^k  have h1 : 2^(k+1)=2*h := by dsimp [h]; rw [pow_succ]; omega  have h2 : 2^(k+2)=4*h := by rw [show k+2=(k+1)+1 by omega,pow_succ,h1]; omega  have h3 : 2^(k+3)=8*h := by rw [show k+3=(k+2)+1 by omega,pow_succ,h2]; omega  have h4 : 2^(k+4)=16*h := by rw [show k+4=(k+3)+1 by omega,pow_succ,h3]; omega  have hp4 : ∀ p a, a < 8*h →      (a < 4*h → x p (a+8*h) = true → x p a = true) ∧      (4*h ≤ a → x p a = true → x p (a+8*h) = true) := by    intro r a ha    have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+3) (by omega) (by omega) (x r) (htight r) a (by omega)    have hi : a+2^(k+4)-2^(k+3)=a+8*h := by omega    simpa only [show k+3-1=k+2 by omega,h2,hi] using hp  have hp6 : ∀ p a, a < 4*h →      (a < 2*h → x p (a+12*h) = true → x p a = true) ∧      (2*h ≤ a → x p a = true → x p (a+12*h) = true) := by    intro r a ha    have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+2) (by omega) (by omega) (x r) (htight r) a (by omega)    have hi : a+2^(k+4)-2^(k+2)=a+12*h := by omega    simpa only [show k+2-1=k+1 by omega,h1,hi] using hp  have hp7 : ∀ p a, a < 2*h →      (a < h → x p (a+14*h) = true → x p a = true) ∧      (h ≤ a → x p a = true → x p (a+14*h) = true) := by    intro r a ha    have hp := cycle_power_dyadic_tight_class_parent (k+4) (k+1) (by omega) (by omega) (x r) (htight r) a (by omega)    have hi : a+2^(k+4)-2^(k+1)=a+14*h := by omega    simpa only [show k+1-1=k by omega,hi] using hp  have he6 : ∀ v : ℤ, (range (4*h)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+12*h)).toNat) = 1 := by    intro v    have hi (a : ℕ) : a+16*h-4*h=a+12*h := by omega    simpa only [h4,h2,hi] using hexact (k+2) (by omega) v  have he7 : ∀ v : ℤ, (range (2*h)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+14*h)).toNat) = 1 := by    intro v    have hi (a : ℕ) : a+16*h-2*h=a+14*h := by omega    simpa only [h4,h1,hi] using hexact (k+1) (by omega) v  have he15 : ∀ v : ℤ, (range h).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+15*h)).toNat) = 1 := by    intro v    have hi (a : ℕ) : a+16*h-h=a+15*h := by omega    simpa only [h4,show 2^k=h by rfl,hi] using hexact k (by omega) v  have M : CyclePowerSixteenBlock.Geometry h x := {    pos := Nat.two_pow_pos k    ends := by simpa only [h4] using cycle_power_dyadic_exact_endpoints (k+4) (by omega) x hexact    lowMono := by simpa only [h1] using fun p => (houter p).1    highMono := by simpa only [h1,h4,show 7*(2*h)=14*h by omega] using fun p => (houter p).2    parent4 := hp4    parent6 := hp6    parent7 := hp7    exact6 := he6    exact7 := he7    exact15 := he15    cover := by simpa only [h4] using hcover }  exact M
See it in the graphDiscuss this resultChallenge it