AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_outer_projection_model

theoremverified

Every valid direct outer projection preserves tight dyadic weight, exact dyadic edges and full ordinary coverage. No scalar active-count or colour preservation is asserted.

Statement

theorem cycle_power_dyadic_outer_projection_model
    (M r : ℕ) (hr : r ≤ M) (x : ℤ → ℕ → Bool)
    (htight : ∀ p, cycle_power_dyadic_class_weight (M+1) (x p) =
      (range (2^(M+1))).sum (fun a => (x p a).toNat))
    (hexact : ∀ j < M+1, ∀ v : ℤ, (range (2^j)).sum (fun a =>
      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(M+1)-2^j)).toNat) = 1)
    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(M+1) → ∀ v : ℤ,
      ∃ c : ℕ, c < 2^(M+1)-d ∧ x (v-(c : ℤ)) c = true ∧
        x (v-(c : ℤ)) (c+d) = true) :
    (∀ p, cycle_power_dyadic_class_weight (r+1) (cycle_power_dyadic_outer_projection (M+1) r (x p)) =
      (range (2^(r+1))).sum (fun a => (cycle_power_dyadic_outer_projection (M+1) r (x p) a).toNat)) ∧
    (∀ j < r+1, ∀ v : ℤ, (range (2^j)).sum (fun a =>
      (cycle_power_dyadic_outer_projection (M+1) r (x (v-(a : ℤ))) a &&
        cycle_power_dyadic_outer_projection (M+1) r (x (v-(a : ℤ))) (a+2^(r+1)-2^j)).toNat) = 1) ∧
    (∀ d : ℕ, 1 ≤ d → d < 2^(r+1) → ∀ v : ℤ,
      ∃ c : ℕ, c < 2^(r+1)-d ∧
        cycle_power_dyadic_outer_projection (M+1) r (x (v-(c : ℤ))) c = true ∧
        cycle_power_dyadic_outer_projection (M+1) r (x (v-(c : ℤ))) (c+d) = true)
Source
Uniform structural reduction for OP-205 / RT-1 following arXiv:2610.15635 Section 3. The all-scale shell fullness conditions are explicit hypotheses when used; they have not been derived from optimal active counts. No graph covering value or research advance is claimed.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
Used by 2

The proof, explained

The proof proceeds by induction on M, generalizing over the target scale r and the family of configurations x. When r = M + 1 (including the base case M = 0), the outer projection from level M + 1 to r is the identity operator, so the properties hold trivially from the hypotheses. When r ≤ M in the inductive step, one-step dyadic pruning reduces the configuration family from scale M + 2 to scale M + 1 while preserving tight weights, exact edges, and coverage. The induction hypothesis then applies to the pruned family, and the result follows because outer projection to scale r commutes with dyadic pruning.

  1. The theorem holds in the base case M = 0.

    We induct on M, generalizing over r and the configuration x. In the base case M = 0, the assumption r ≤ M forces r = 0 by linear arithmetic. When r = 0 and M = 0, the projection cycle_power_dyadic_outer_projection (0+1) 0 is the identity on configurations by cycle_power_dyadic_outer_projection_self. Substituting this identity, the three projected goals reduce to the original hypotheses htight, hexact, and hcover, which are assembled with And.intro.

    lines 21–25

    uses cycle_power_dyadic_outer_projection_self, And.intro

      induction M generalizing r x with
      | zero =>
        have he : r=0 := by omega
        subst r
        simpa only [cycle_power_dyadic_outer_projection_self] using And.intro htight (And.intro hexact hcover)
  2. In the inductive step, the theorem holds in the boundary case r = M + 1.

    In the step from M to M + 1, we case-split on whether r = M + 1. When r = M + 1, the projection cycle_power_dyadic_outer_projection (M+2) (M+1) is again the identity operator by cycle_power_dyadic_outer_projection_self, so the goal reduces directly to the hypotheses htight, hexact, and hcover.

    lines 26–29

    uses cycle_power_dyadic_outer_projection_self, And.intro

      | succ M ih =>
        by_cases he : r=M+1
        · subst r
          simpa only [cycle_power_dyadic_outer_projection_self] using And.intro htight (And.intro hexact hcover)
  3. When r ≤ M, the one-step pruned configuration y at scale M + 1 inherits tight weights, exact edges, and coverage.

    In the remaining case r ≤ M, we prune the configuration at level M by setting y(p) = cycle_power_dyadic_b_lift M (x p). The pruned configuration y inherits tight dyadic class weights from cycle_power_dyadic_tight_class_prune, exact dyadic edges from cycle_power_dyadic_prune_exact, and full coverage from cycle_power_dyadic_prune_cover.

    lines 30–33

    uses cycle_power_dyadic_tight_class_prune, cycle_power_dyadic_prune_exact, cycle_power_dyadic_prune_cover

        · let y : ℤ → ℕ → Bool := fun p => cycle_power_dyadic_b_lift M (x p)
          have hty := fun p => cycle_power_dyadic_tight_class_prune M (x p) (htight p)
          have hey := cycle_power_dyadic_prune_exact M x hexact
          have hcy := cycle_power_dyadic_prune_cover M x htight hcover
  4. The induction hypothesis applies to y and rewrites to the required properties for x.

    Since r ≤ M, we invoke the induction hypothesis ih on r and the pruned family y, which establishes the three properties for the outer projection of y from scale M + 1 to r. By cycle_power_dyadic_outer_projection_comp_prune, projecting y from scale M + 1 to r is identical to directly projecting x from scale M + 2 to r. Rewriting by this identity completes the inductive step.

    lines 34–38

    uses cycle_power_dyadic_outer_projection_comp_prune

          have hs := ih r (by omega) y hty hey hcy
          have hpr (p : ℤ) : cycle_power_dyadic_outer_projection (M+1) r (y p) =
              cycle_power_dyadic_outer_projection (M+2) r (x p) :=
            cycle_power_dyadic_outer_projection_comp_prune M r (by omega) (x p)
          simpa only [hpr] using hs
And.intro
Given a proof of a proposition a and a proof of a proposition b, constructs a proof of their conjunction a ∧ b.
cycle_power_dyadic_outer_projection_comp_prune
For r ≤ M, projecting the pruned configuration cycle_power_dyadic_b_lift M b from scale M + 1 to scale r yields the same result as directly projecting b from scale M + 2 to scale r.
cycle_power_dyadic_outer_projection_self
The direct outer projection of a configuration from scale r + 1 to scale r is the identity.
cycle_power_dyadic_prune_cover
If a configuration family has tight dyadic class weights and full coverage at scale k + 2, its pruned version cycle_power_dyadic_b_lift k satisfies full coverage at scale k + 1.
cycle_power_dyadic_prune_exact
If a configuration family has exact dyadic edges at scale k + 2, its pruned version cycle_power_dyadic_b_lift k has exact dyadic edges at scale k + 1.
cycle_power_dyadic_tight_class_prune
If a configuration at scale k + 2 has tight dyadic class weight, then its pruned version cycle_power_dyadic_b_lift k b has tight dyadic class weight at scale k + 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

open Finsettheorem cycle_power_dyadic_outer_projection_model    (M r : ℕ) (hr : r ≤ M) (x : ℤ → ℕ → Bool)    (htight : ∀ p, cycle_power_dyadic_class_weight (M+1) (x p) =      (range (2^(M+1))).sum (fun a => (x p a).toNat))    (hexact : ∀ j < M+1, ∀ v : ℤ, (range (2^j)).sum (fun a =>      (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+2^(M+1)-2^j)).toNat) = 1)    (hcover : ∀ d : ℕ, 1 ≤ d → d < 2^(M+1) → ∀ v : ℤ,      ∃ c : ℕ, c < 2^(M+1)-d ∧ x (v-(c : ℤ)) c = true ∧        x (v-(c : ℤ)) (c+d) = true) :    (∀ p, cycle_power_dyadic_class_weight (r+1) (cycle_power_dyadic_outer_projection (M+1) r (x p)) =      (range (2^(r+1))).sum (fun a => (cycle_power_dyadic_outer_projection (M+1) r (x p) a).toNat)) ∧    (∀ j < r+1, ∀ v : ℤ, (range (2^j)).sum (fun a =>      (cycle_power_dyadic_outer_projection (M+1) r (x (v-(a : ℤ))) a &&        cycle_power_dyadic_outer_projection (M+1) r (x (v-(a : ℤ))) (a+2^(r+1)-2^j)).toNat) = 1) ∧    (∀ d : ℕ, 1 ≤ d → d < 2^(r+1) → ∀ v : ℤ,      ∃ c : ℕ, c < 2^(r+1)-d ∧        cycle_power_dyadic_outer_projection (M+1) r (x (v-(c : ℤ))) c = true ∧        cycle_power_dyadic_outer_projection (M+1) r (x (v-(c : ℤ))) (c+d) = true) := by  induction M generalizing r x with  | zero =>    have he : r=0 := by omega    subst r    simpa only [cycle_power_dyadic_outer_projection_self] using And.intro htight (And.intro hexact hcover)  | succ M ih =>    by_cases he : r=M+1    · subst r      simpa only [cycle_power_dyadic_outer_projection_self] using And.intro htight (And.intro hexact hcover)    · let y : ℤ → ℕ → Bool := fun p => cycle_power_dyadic_b_lift M (x p)      have hty := fun p => cycle_power_dyadic_tight_class_prune M (x p) (htight p)      have hey := cycle_power_dyadic_prune_exact M x hexact      have hcy := cycle_power_dyadic_prune_cover M x htight hcover      have hs := ih r (by omega) y hty hey hcy      have hpr (p : ℤ) : cycle_power_dyadic_outer_projection (M+1) r (y p) =          cycle_power_dyadic_outer_projection (M+2) r (x p) :=        cycle_power_dyadic_outer_projection_comp_prune M r (by omega) (x p)      simpa only [hpr] using hs
See it in the graphDiscuss this resultChallenge it