AFTD Auto-Formalizing Theoretical Domains

cycle_power_dyadic_outer_projection_self

theoremverified

At its original radius, direct outer projection is the identity on every offset.

Statement

theorem cycle_power_dyadic_outer_projection_self (r : ℕ) (b : ℕ → Bool) :
    cycle_power_dyadic_outer_projection (r+1) r b = b
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 1
  • cycle_power_dyadic_outer_projectionProject a radius-2^m Boolean class to its first and last 2^r offsets, compressing them to a radius-2^(r+1) profile. The intended range is…
Used by 2

The proof, explained

To prove that the dyadic outer projection with scale $r + 1$ and radius $r$ is the identity on any bit sequence $b$, we apply function extensionality to consider an arbitrary offset $a$. Unfolding the definition of the projection, the parameter substitution $m = r + 1$ causes the offset term $2^{r+1} - 2^{r+1}$ to vanish, so both branches of the conditional yield $b(a)$. The expression simplifies to $b(a)$, confirming that the projection leaves $b$ unchanged.

  1. It suffices to show that the projection equals $b(a)$ for an arbitrary offset $a \in \mathbb{N}$.

    By function extensionality, two functions from $\mathbb{N}$ to $\text{Bool}$ are identical if they agree on all inputs $a \in \mathbb{N}$.

    line 5

      funext a
  2. The projection evaluates to $b(a)$ for every offset $a$, concluding the proof. automation

    Unfolding the definition of `cycle_power_dyadic_outer_projection` at scale $m = r + 1$, the function is defined by the conditional $\text{if } a < 2^r \text{ then } b(a) \text{ else } b(a + 2^{r+1} - 2^{r+1})$. Since $2^{r+1} - 2^{r+1} = 0$, the second branch simplifies to $b(a)$, making both branches equal to $b(a)$. The conditional thus simplifies to $b(a)$ regardless of whether $a < 2^r$, closing the goal.

    line 6

    uses cycle_power_dyadic_outer_projection

      simp [cycle_power_dyadic_outer_projection]
cycle_power_dyadic_outer_projection
The dyadic outer projection function: given parameters $m, r \in \mathbb{N}$, a bit sequence $b : \mathbb{N} \to \text{Bool}$, and an offset $a \in \mathbb{N}$, it returns $b(a)$ if $a < 2^r$ and $b(a + 2^m - 2^{r+1})$ otherwise.

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_self (r : ℕ) (b : ℕ → Bool) :    cycle_power_dyadic_outer_projection (r+1) r b = b := by  funext a  simp [cycle_power_dyadic_outer_projection]
See it in the graphDiscuss this resultChallenge it