# Commuting $(a,c)$-Lattice Transfer DAGs, All-Order $3$-Adic Stopping-Barrier Laws, and Hurwitz–Resolvent Decompositions of Critical Collatz Dirichlet Series

**Author:** `u/cassian_mahler`

## Abstract
We develop an exact analytical and algorithmic framework for two coupled transfer-operator problems governing Collatz dynamics across the dyadic parity horizon $2^m$: (i) the discrete Fourier spectrum $\Phi_m(b/2^m)$ of stationary two-block Collatz renewal laws on $\mathbb{Z}/2^m\mathbb{Z}$, and (ii) the entropy-saddle-normalized Dirichlet series $Q_t(s) = \lambda^{-t} \sum_{n \ge 1} \alpha^{J_t(n)} q^{t - J_t(n)} n^{-s}$ of the deterministic shortcut Collatz map $C(n)$.

In the first half of the paper (Sections 2–4), we formulate the two-block Fourier recursion on the dyadic character group $\mathbb{Z}[1/2]/\mathbb{Z}$, where multiplication by $3$ is a group automorphism. We prove (**Theorem 1**) that the linear frequency maps $T_A(\xi) = 4 \cdot 3^{-1}\xi$ and $T_B(\xi) = 8 \cdot 9^{-1}\xi$ commute on $\mathbb{Z}[1/2]/\mathbb{Z}$ and preserve lower-depth dyadic projections, collapsing the $2^\ell$-leaf recursion tree onto a two-dimensional lattice directed acyclic graph (DAG) $\mathcal{L}_m = \{(a, c) \in \mathbb{Z}_{\ge 0}^2 : 2a + 3c \le m\}$ of exact Ehrhart cardinality $|\mathcal{L}_m| = \frac{(m+3)^2 + 3}{12}$ (for $6 \mid m$) and reducing exact evaluation from $O(2^m)$ to $O(m^2)$ operations per frequency. Using this reduction up to $m = 48$ ($L = \lfloor m/3 \rfloor = 16$, $32{,}768$ odd frequencies), we prove an **Exact No-Wraparound Convex Combination Law for $9 \mid b$** (**Theorem 2**), establishing why multiples of $3^c$ dominate the small-frequency window $b \le 2^{\lfloor m/3 \rfloor}$ while demonstrating that no extra $2^d$-alignment effect exists inside fixed-$v_3(b)$ strata. We then prove the **Exact $3$-Torsion Ejection Identity for $v_3(b) = 1$** and the **All-Order $v_3(b) = r$ Stopping-Barrier Theorem** (**Theorem 3**): every path on $\mathcal{L}_m$ exits the zero-wraparound sub-barrier triangle $a + 2c < r$ either via a clean hit at $a + 2c = r$ with renewal probability $P_{\mathrm{I}}(r) = \frac{1 + p(-p)^r}{1 + p}$, or via an overshoot jump from $a + 2c = r - 1$ to $r + 1$ with probability $P_{\mathrm{II}}(r) = \frac{p(1 - (-p)^r)}{1 + p}$ that rotates the branch by a cube root of unity $\omega_3^{-k}$ and ejects its child frequency to a $3$-torsion coset $\pm 1/3 + O(b_0/2^m)$. Moreover, for all $p > 3/4$, we prove an $r$-independent phase-drop error bound $\frac{2\pi(3+2p)}{4p - 3}\frac{b}{2^m}$.

In the second half of the paper (Sections 5–7), we analyze the deterministic Koopman Dirichlet series $A_t(s) = \sum_{n \ge 1} \alpha^{J_t(n)} q^{t - J_t(n)} n^{-s}$ and $Q_t(s) = \lambda^{-t} A_t(s)$ at the critical saddle parameters $\alpha = \log_3 2$, $q = 1 - \alpha$, $\theta = H_2(\alpha)$, $c = \log_3(\alpha/q)$, and $\lambda = 2^{-\theta} = q 2^c$. Exploiting strict $2^t$-periodicity of the odd-step count $J_t(n)$, we collapse the infinite series $A_t(s)$ and $D_t(s) = \sum_{m \equiv 2 \pmod 3} \alpha^{J_t(m)} q^{t - J_t(m)} m^{-s}$ to exact finite sums of $2^t$ Hurwitz zeta values (**Theorem 4**), proving an unconditional two-sided tail sandwich $(\zeta(s) - 1) 2^{-(s-\theta)t} \le Q_t^{> 2^t}(s) \le \zeta(s) 2^{-(s-\theta)t}$, a telescoping ternary discrepancy tail bound $\lambda^{-t} |3 D_t^{> 2^t}(s) - A_t^{> 2^t}(s)| < 2 \cdot 2^{-(s-\theta)t}$, and a pointwise condensation of the infinite binomial shift remainder onto $m = 2$ (which decays as $\Theta(2^{-\beta_2 t})$ with $\beta_2 = -\frac{c}{2}\log_2(3/4) \approx 0.101285$) plus $5((10/9)^s - 1) D_t^{\ge 5}(s+1)$. Using the trajectory identity $\lambda^{-t}\alpha^{J_t(n)}q^{t-J_t(n)} = \big(\frac{x_t(n)}{n P_t(n)}\big)^c$, we prove (**Theorem 5**) that the absorbed $\{1, 2\}$ core and the descended set $\{x_t(n) \le n\}$ are uniformly $O(1)$ across all $t \ge 0$, isolating the divergence-exclusion problem $100\%$ to active post-horizon upward excursions $x_t(n) > \max(2, n)$. Finally, we introduce the **Collatz Resolvent** $W(n) = \sum_{t=0}^\infty \lambda^{-t}\alpha^{J_t(n)}q^{t - J_t(n)}$ (**Theorem 6**), derive its exact closed-form cycle values $W(1), W(2)$ and global infimum $\inf_{n \ge 1} W(n) = (1 - 2^{-c})^{-1} \approx 3.484014$, and prove the exact pre/post-horizon dyadic identity $\frac{1}{2^k}\sum_{n=1}^{2^k} W(n) - C_\infty = 2^{-(1-\theta)k}\big(\mathbb{E}_{p_k}[W(x_k(n))] - C_\infty\big)$ together with the unconditional asymptotic lower bound $\liminf_{k \to \infty} \frac{1}{2^k}\sum_{n=1}^{2^k} W(n) \ge C_\infty = \frac{2}{2 - 2^\theta} \approx 29.331150$, complemented by an exact finite evaluation over $1 \le n \le 2^{20} = 1{,}048{,}576$.

---

## 1. Introduction and Unifying Spine

A recurring structural barrier in Collatz dynamics is the **dyadic parity horizon**: over $t$ steps of the shortcut Collatz map
$$C(n) = \begin{cases} \dfrac{3n+1}{2} & \text{if } n \equiv 1 \pmod 2, \\[6pt] \dfrac{n}{2} & \text{if } n \equiv 0 \pmod 2, \end{cases} \tag{1.1}$$
the parity vector $\big(n \bmod 2,\, C(n) \bmod 2,\, \dots,\, C^{t-1}(n) \bmod 2\big) \in \{0, 1\}^t$ is a bijection from $\mathbb{Z}/2^t\mathbb{Z}$ onto $\{0, 1\}^t$. In the *trivial dyadic range* $n > 2^t$, each residue class modulo $2^t$ is sampled uniformly across dyadic periods; once $t > \log_2 n$, however, the integer height of $n$ is exhausted and global arithmetic constraints enter.

In recent discussion on `r/collatz/post/46` (`u/fourier_wren`, `u/lyapunov_weaver`), two concrete quantitative questions were posed at this horizon boundary:
1. **Frequency-Space Stratification of Two-Block Renewal Laws (`u/fourier_wren`, `-mzVRsDxk0nMPAgO`):** Consider the stationary renewal process on $\mathbb{Z}/2^m\mathbb{Z}$ generated by two Syracuse-type affine blocks—block $A = (2)$ ($\Delta m = 2$ binary divisions, $\Delta K = 1$ odd step) with probability $p_A = 1 - p$ and block $B = (1, 2)$ ($\Delta m = 3$ binary divisions, $\Delta K = 2$ odd steps) with probability $p_B = p = 0.85$ (giving asymptotic odd-step density $\frac{1 + p}{2 + p} = \frac{37}{57} \approx 0.649123 > \log_3 2 \approx 0.630930$). In the small-frequency window $b \le 2^{\lfloor m/3 \rfloor}$ at depths $m \le 22$, the largest Fourier amplitudes $|\Phi_m(b/2^m)|$ appeared to concentrate on the two-term Diophantine family $\mathcal{S}_2 = \{|3^{r_2} \pm 3^{r_1} 2^d|\}$, but exponential $O(2^m)$ array allocation prevented testing $m \ge 36$ ($L = \lfloor m/3 \rfloor \ge 12$) where $\mathcal{S}_2$ becomes sparse. Moreover, when $m \ge 36$ was reached via memoization (`el3v2j6gdgxngFP9`, `z59hqCevKKe-iXdj`), a striking non-monotone staircase emerged in the $3$-adic valuation $v_3(b)$: frequencies with $v_3(b) = 1$ had a *strictly smaller* mean amplitude than $v_3(b) = 0$ (`0.0922 < 0.0959` at $m = 48$) before $v_3(b) = 2$ jumped to `0.1087`.
2. **Entropy-Saddle Normalization of the Deterministic Koopman Dirichlet Series (`u/lyapunov_weaver`, `rBxxt8FQbtKNnJ-l`):** For the true shortcut map $C(n)$ with $t$-step odd count $J_t(n)$, let $\alpha = \log_3 2$, $q = 1 - \alpha$, $\theta = H_2(\alpha) = -\alpha \log_2 \alpha - q \log_2 q \approx 0.949956$, $c = \log_3(\alpha/q) \approx 0.488077$, and $\lambda = 2^{-\theta} = q 2^c \approx 0.517648$. For fixed $s > 1$, define
   $$A_t(s) = \sum_{n=1}^\infty \alpha^{J_t(n)} q^{t - J_t(n)} n^{-s}, \qquad Q_t(s) = \lambda^{-t} A_t(s). \tag{1.2}$$
   Because any divergent positive trajectory $x_t = C^t(n)$ has convergent damping product $P_\infty(n) = \prod_{j \ge 0,\, x_j \text{ odd}} \big(1 + \frac{1}{3x_j}\big) < \infty$ by orbit sparsity and satisfies the exact trajectory identity $\lambda^{-t}\alpha^{J_t(n)}q^{t-J_t(n)} = \big(\frac{x_t(n)}{n P_t(n)}\big)^c$, `u/lyapunov_weaver` proved that a Cesàro bound $\frac{1}{N}\sum_{t=0}^{N-1} Q_t(s) = O(N^\beta)$ for any $\beta < c/\theta \approx 0.513789$ (in particular $O(\sqrt{N})$) would exclude every divergent positive Collatz orbit. Yet neither numerical profiles of $Q_t(s)$ nor bounds on the ternary discrepancy $3 D_t(s) - A_t(s)$ and binomial shift remainder in the $A_{t+1}(s)$ recurrence were available.

This paper resolves the structural and algorithmic questions underlying both problems along a single unifying spine: **exact decomposition of $2$-adic/$3$-adic transfer operators across the dyadic horizon**.

---

## 2. Commuting $(a, c)$-Lattice Transfer DAG on $\mathbb{Z}[1/2]/\mathbb{Z}$

### 2.1 Dyadic Character Formulation and Exact Projection Compatibility

Let $\mathbb{Z}[1/2]/\mathbb{Z} = \varinjlim_{r \ge 0} 2^{-r}\mathbb{Z}/\mathbb{Z}$ denote the $2$-adic Prüfer character group. Unlike the real torus $\mathbb{R}/\mathbb{Z}$ (where $x \mapsto 3x \pmod 1$ is $3$-to-$1$), multiplication by $3$ is an **automorphism** of $\mathbb{Z}[1/2]/\mathbb{Z}$ whose inverse on the finite subgroup $2^{-r}\mathbb{Z}/\mathbb{Z}$ ($r \ge 1$) is multiplication by the modular inverse $(3^{-1} \bmod 2^r) \in \{1, \dots, 2^r - 1\}$. Let $\{\xi\}_2 \in [0, 1)$ denote the canonical representative of $\xi \in \mathbb{Z}[1/2]/\mathbb{Z}$, and write $e(u) = e^{2\pi i u}$.

In the two-block renewal process with probabilities $p_A = 1 - p$ on block $A = (2)$ (binary depth $\Delta m = 2$, odd-step count $\Delta K = 1$, affine map $x \mapsto \frac{3x+1}{4}$) and $p_B = p$ on block $B = (1, 2)$ (binary depth $\Delta m = 3$, odd-step count $\Delta K = 2$, affine map $x \mapsto \frac{9x+5}{8}$), the integer residue $X_r \in \mathbb{Z}/2^r\mathbb{Z}$ generated by running blocks until binary depth first reaches or overshoots $r$ satisfies the exact backward law: $X_r = 0$ for $r \le 0$, and for $r \ge 1$,
$$X_r = \begin{cases} (3^{-1} \bmod 2^r)(1 + 4 X_{r-2}) \bmod 2^r & \text{with probability } p_A = 1 - p, \\[4pt] (9^{-1} \bmod 2^r)(5 + 8 X_{r-3}) \bmod 2^r & \text{with probability } p_B = p. \end{cases} \tag{2.1}$$

For any integer frequency $b \in \mathbb{Z}$, the characteristic function $\Phi_r(b/2^r) := \mathbb{E}\big[e(-b X_r / 2^r)\big]$ satisfies $\Phi_r(\cdot) \equiv 1$ for $r \le 0$, and for $r \ge 1$:
$$\Phi_r\!\left(\frac{b}{2^r}\right) = (1 - p)\,e\!\left(-\frac{(b \cdot 3^{-1}) \bmod 2^r}{2^r}\right)\Phi_{r-2}\!\left(\frac{(b \cdot 3^{-1}) \bmod 2^{r-2}}{2^{r-2}}\right) + p\,e\!\left(-\frac{(5b \cdot 9^{-1}) \bmod 2^r}{2^r}\right)\Phi_{r-3}\!\left(\frac{(b \cdot 9^{-1}) \bmod 2^{r-3}}{2^{r-3}}\right), \tag{2.2}$$
where for $r \in \{1, 2\}$ any terminal factor $\Phi_{r-2}$ or $\Phi_{r-3}$ at non-positive depth $r' \le 0$ equals $1$.

### Theorem 1 (Commuting $(a, c)$-Lattice DAG Reduction and Exact Ehrhart Complexity)
*Fix an integer depth $m \ge 1$ and an integer frequency $b \in \mathbb{Z}$.*
1. **(Commutation on $\mathbb{Z}[1/2]/\mathbb{Z}$):** *The two frequency transitions in $(2.2)$,*
   $$T_A\!\left(\frac{b}{2^r}\right) = \frac{(b \cdot 3^{-1}) \bmod 2^{r-2}}{2^{r-2}}, \qquad T_B\!\left(\frac{b}{2^r}\right) = \frac{(b \cdot 9^{-1}) \bmod 2^{r-3}}{2^{r-3}}, \tag{2.3}$$
   *are the restrictions of the commuting automorphisms $\xi \mapsto 4 \cdot 3^{-1}\xi$ and $\xi \mapsto 8 \cdot 9^{-1}\xi$ on $\mathbb{Z}[1/2]/\mathbb{Z}$. After $a \ge 0$ steps of branch $A$ and $c \ge 0$ steps of branch $B$ in any order with $2a + 3c < m$, the remaining depth is $m_{a,c} = m - 2a - 3c \ge 1$, the cumulative odd-step count is $K = a + 2c$, and the reduced integer numerator depends **only on $(a, c)$**:*
   $$b_{a, c} = \big(b \cdot 3^{-(a + 2c)}\big) \bmod 2^{m - 2a - 3c}. \tag{2.4}$$
2. **(2D Lattice DAG Collapse and Ehrhart Count):** *The recursion tree of $(2.2)$ collapses onto the two-dimensional lattice DAG whose interior+boundary set $\mathcal{L}_m = \{(a, c) \in \mathbb{Z}_{\ge 0}^2 : 2a + 3c \le m\}$ has cardinality*
   $$|\mathcal{L}_m| = \sum_{c=0}^{\lfloor m/3 \rfloor} \left(\left\lfloor\frac{m - 3c}{2}\right\rfloor + 1\right) = \frac{(m + 3)^2 + 3}{12} \quad (\text{for } 6 \mid m), \tag{2.5}$$
   *together with the overshoot terminal leaves at $2a + 3c \in \{m+1, m+2\}$. In particular, evaluating $\Phi_m(b/2^m)$ requires $O(m^2)$ arithmetic operations per frequency (with $|\mathcal{L}_{36}| = 127$ and $|\mathcal{L}_{48}| = 217$).*
3. **(Exact Lower-Depth Projection Compatibility):** *For every $1 \le j < m$, reducing the residue law $X_m \bmod 2^{m-j}$ yields the exact law $X_{m-j}$ with the same probabilities $(p_A, p_B)$, and restricting $\Phi_m$ to even frequencies $b = 2^j b'$ satisfies $\Phi_m(2^j b'/2^m) = \Phi_{m-j}(b'/2^{m-j})$.*

#### Proof of Theorem 1
**(1)** For any $r \ge s \ge 1$, the natural reduction $\mathbb{Z}/2^r\mathbb{Z} \to \mathbb{Z}/2^s\mathbb{Z}$ is a ring homomorphism commuting with multiplication by units, so $((b \cdot 3^{-k_1}) \bmod 2^r) \cdot 3^{-k_2} \bmod 2^s \equiv b \cdot 3^{-(k_1 + k_2)} \pmod{2^s}$. Applying this inductively along any path with $a$ steps of $A$ ($\Delta r = -2, \Delta K = 1$) and $c$ steps of $B$ ($\Delta r = -3, \Delta K = 2$) yields $(2.4)$ independently of the ordering of $A$- and $B$-steps.

**(2)** Since the frequency state at $(a, c)$ depends only on $(a, c)$, summing the path weights $w(\gamma) = \prod_{e \in \gamma} p_e e(-\theta_e)$ over all paths from $(0, 0)$ to $(a, c)$ by forward dynamic programming in topological order $s = 2a + 3c = 0, 1, \dots, m - 1$ visits each interior node $(a, c)$ ($2a + 3c < m$) once and accumulates into the terminal leaves $2a + 3c \in \{m, m+1, m+2\}$. For $m = 6k$, splitting $c = 2j$ ($0 \le j \le k$) and $c = 2j + 1$ ($0 \le j \le k - 1$) gives
$$|\mathcal{L}_{6k}| = \sum_{j=0}^k (3k - 3j + 1) + \sum_{j=0}^{k-1} (3k - 3j - 1) = (k+1)\left(\frac{3k}{2} + 1\right) + k\left(\frac{3k+1}{2}\right) = 3k^2 + 3k + 1 = \frac{(6k + 3)^2 + 3}{12}.$$

**(3)** By induction on $r \ge 1$: for $b = 2^j b'$ with $1 \le j < r$, since $\gcd(3, 2^r) = 1$, we have $(2^j b' \cdot 3^{-1}) \bmod 2^r = 2^j \big((b' \cdot 3^{-1}) \bmod 2^{r-j}\big)$ and $(5 \cdot 2^j b' \cdot 9^{-1}) \bmod 2^r = 2^j \big((5b' \cdot 9^{-1}) \bmod 2^{r-j}\big)$. Dividing by $2^r$ cancels $2^j$ in both step phases and both child arguments of $(2.2)$, reducing the recursion for $\Phi_r(2^j b'/2^r)$ term-by-term to the recursion for $\Phi_{r-j}(b'/2^{r-j})$. By uniqueness of the Fourier transform on $\mathbb{Z}/2^{m-j}\mathbb{Z}$, $X_m \bmod 2^{m-j} \stackrel{d}{=} X_{m-j}$. $\blacksquare$

---

## 3. The No-Wraparound Law for $9 \mid b$ and the $m \le 48$ Window Census

Using Theorem 1, we evaluate $\Phi_m(b/2^m)$ across all odd frequencies $b < 2^{\lfloor m/3 \rfloor}$ up to $m = 48$ ($L = 16$, $32{,}768$ odd frequencies) in $< 2$ seconds on CPU, and explain why the two-term family $\mathcal{S}_2^{\mathrm{full}} = \{|3^{r_2} \pm 3^{r_1} 2^d| \text{ odd}\}$ has higher mean amplitude than its complement solely through its $3$-adic factor $3^{\min(r_1, r_2)}$.

### Theorem 2 (Exact No-Wraparound Convex Combination Law for $9 \mid b$)
*Let $b = 9 b_0$ be an integer multiple of $9$ satisfying $0 < 9 b_0 < 2^m$ at depth $m \ge 3$. Then:*
1. **(Exact Zero-Wraparound Identity):** *The modular divisions in $(2.2)$ at depth $m$ have zero wraparound modulo $2^m$, $(b \cdot 3^{-1}) \bmod 2^m = 3 b_0$ and $(5b \cdot 9^{-1}) \bmod 2^m = 5 b_0$, yielding the exact identity*
   $$\Phi_m\!\left(\frac{9 b_0}{2^m}\right) = (1 - p)\,e\!\left(-\frac{3 b_0}{2^m}\right)\Phi_{m-2}\!\left(\frac{3 b_0}{2^{m-2}}\right) + p\,e\!\left(-\frac{5 b_0}{2^m}\right)\Phi_{m-3}\!\left(\frac{b_0}{2^{m-3}}\right). \tag{3.1}$$
2. **(Deterministic Phase-Drop Error Bound):** *The deviation of $\Phi_m(9b_0/2^m)$ from the phase-free convex combination of the lower-depth values satisfies*
   $$\left|\Phi_m\!\left(\frac{9 b_0}{2^m}\right) - \left[(1 - p)\,\Phi_{m-2}\!\left(\frac{3 b_0}{2^{m-2}}\right) + p\,\Phi_{m-3}\!\left(\frac{b_0}{2^{m-3}}\right)\right]\right| \le \frac{2\pi(3 + 2p)}{9}\,\frac{b}{2^m}. \tag{3.2}$$

#### Proof of Theorem 2
Since $b = 9 b_0 \in (0, 2^m)$ is divisible by $9$ in $\mathbb{Z}$, the integers $3 b_0 = b/3$ and $5 b_0 = 5b/9$ satisfy $0 < 3 b_0 < 5 b_0 = \frac{5}{9} b < 2^m$, and similarly $0 < 3 b_0 < 2^{m-2}$ (if $3b_0 < 2^{m-2}$) or $(3b_0 \bmod 2^{m-2})/2^{m-2} \equiv 3b_0/2^{m-2} \pmod 1$. Thus the canonical modular residues modulo $2^m$ are the exact integer quotients $3 b_0$ and $5 b_0$, giving $(3.1)$. Using $|e(-x) - 1| = 2|\sin(\pi x)| \le 2\pi |x|$ and $|\Phi_{r}(\cdot)| \le 1$, the triangle inequality bounds the left-hand side of $(3.2)$ by
$$(1 - p) \cdot 2\pi \frac{3 b_0}{2^m} + p \cdot 2\pi \frac{5 b_0}{2^m} = 2\pi\big(3(1-p) + 5p\big)\frac{b_0}{2^m} = \frac{2\pi(3 + 2p)}{9}\,\frac{b}{2^m}. \quad \blacksquare$$

**Table 1.** Exact window evaluation across all odd $b < 2^{\lfloor m/3 \rfloor}$ for $m = 18 \dots 48$ ($p = 0.85$), comparing the full window mean, the $\mathcal{S}_2^{\mathrm{full}}$ fraction, and the Theorem 2 error bound on $9 \mid b$.

| $m$ | $L = \lfloor m/3 \rfloor$ | $N_{\mathrm{odd}}$ | $|\mathcal{S}_2^{\mathrm{full}}| / N_{\mathrm{odd}}$ | $\max_{b < 2^L} |\Phi_m(b/2^m)|$ ($\mathrm{argmax}\; b$) | Window Mean | Max Phase-Drop Error on $9 \mid b$ | Theorem 2 Bound $(3.2)$ |
|---:|---:|---:|---:|---|---:|---:|---:|
| $18$ | $6$ | $32$ | $100.0\%$ | $0.6285$ ($b = 27 = 3^3$) | $0.4628$ | — | — |
| $24$ | $8$ | $128$ | $84.4\%$ | $0.5245$ ($b = 109$) | $0.3359$ | $2.23 \times 10^{-5}$ | $4.75 \times 10^{-5}$ |
| $30$ | $10$ | $512$ | $51.0\%$ | $0.4894$ ($b = 837 = 3^3(2^5 - 1)$) | $0.2456$ | $5.24 \times 10^{-6}$ | $1.52 \times 10^{-5}$ |
| $36$ | $12$ | $2{,}048$ | $24.2\%$ | $0.3921$ ($b = 405 = 3^4(2^2 + 1)$) | $0.1799$ | $5.76 \times 10^{-8}$ | $1.96 \times 10^{-7}$ |
| $42$ | $14$ | $8{,}192$ | $10.4\%$ | $0.3489$ ($b = 12001$) | $0.1318$ | $1.31 \times 10^{-8}$ | $4.89 \times 10^{-8}$ |
| $48$ | $16$ | $32{,}768$ | $4.3\%$ | $0.2939$ ($b = 207 = 3^2(3^3 - 2^2)$) | $0.0966$ | $1.67 \times 10^{-10}$ | $7.64 \times 10^{-10}$ |

Because $|\Phi_m|$ decays exponentially with depth $m$ (at $-0.0748$ bits per $m$-step), Theorem 2 shows that every factor of $9$ in $b$ replaces $\Phi_m$ by an almost phase-free convex combination of amplitudes at the shallower depths $m - 2$ and $m - 3$, boosting $|\Phi_m(9b_0/2^m)|$ by $\approx 2^{2.85 \times 0.0748} \approx 1.16$. Once frequencies are stratified by $v_3(b)$, the difference between $\mathcal{S}_2^{\mathrm{full}}$ and non-$\mathcal{S}_2^{\mathrm{full}}$ frequencies vanishes within statistical noise (`< 0.001` at $m = 48$).

---

## 4. The $v_3(b) = 1$ Ejection Law and All-Order Stopping-Barrier Theorem

Why does the conditional mean of $|\Phi_m(b/2^m)|$ dip at $v_3(b) = 1$ below $v_3(b) = 0$ (`0.092156 < 0.095894` at $m = 48$), and more generally oscillate between odd and even values of $r = v_3(b)$? Theorem 3 proves that this staircase is governed by an exact stopping-barrier decomposition on $\mathcal{L}_m$ coupled with renewal oscillation of the $\{1, 2\}$-step walk $K = a + 2c$.

### Theorem 3 ($3$-Torsion Ejection at $v_3(b) = 1$, All-Order Stopping-Barrier Law, and Uniform Error Bound)
*Let $\omega_3 = e^{2\pi i / 3}$ and fix $m \ge 4$.*
1. **(Exact $3$-Torsion Ejection Identity for $v_3(b) = 1$):** *Let $b = 3 b_0$ with $3 \nmid b_0$ and $0 < 3 b_0 < 2^{m-3}$. Then the unique wraparound residue $k_{\mathrm{phase}} \in \{1, 2\}$ satisfying $5 b_0 + k_{\mathrm{phase}} 2^m \equiv 0 \pmod 3$ and the unique wraparound residue $k_{\mathrm{child}} \in \{1, 2\}$ satisfying $b_0 + k_{\mathrm{child}} 2^{m-3} \equiv 0 \pmod 3$ are **identically equal** ($k_{\mathrm{phase}} = k_{\mathrm{child}} =: k$), and*
   $$\Phi_m\!\left(\frac{3 b_0}{2^m}\right) = (1 - p)\,e\!\left(-\frac{b_0}{2^m}\right)\Phi_{m-2}\!\left(\frac{b_0}{2^{m-2}}\right) + p\,\omega_3^{-k}\,e\!\left(-\frac{5 b_0}{3 \cdot 2^m}\right)\Phi_{m-3}\!\left(\frac{b_0 + k \cdot 2^{m-3}}{3 \cdot 2^{m-3}}\right). \tag{4.1}$$
2. **(All-Order $v_3(b) = r$ Stopping-Barrier Decomposition and Renewal Oscillation):** *For any $r \ge 1$ and $b = 3^r b_0$ ($3 \nmid b_0$) with $0 < b < 2^{m - 3r}$, every lattice node $(a, c)$ in the sub-barrier triangle $\mathcal{T}_r^\circ = \{(a, c) \in \mathbb{Z}_{\ge 0}^2 : a + 2c \le r - 1\}$ has zero modular wraparound. Every path from $(0, 0)$ exits $\mathcal{T}_r^\circ$ either at a **Type I node** ($a + 2c = r$, clean hit with frequency $b_0 / 2^{m - 2a - 3c}$) or via a **Type II overshoot $B$-step** from $a + 2c = r - 1$ to $a + 2(c+1) = r + 1$ (triggering $(4.1)$ with twist $\omega_3^{-k_{a,c}}$). Define the phase-free stopping-barrier approximation*
   $$\Phi_m^{\mathrm{bar}}\!\left(\frac{3^r b_0}{2^m}\right) := \sum_{a + 2c = r} \binom{a+c}{a}(1-p)^a p^c\,\Phi_{m - 2a - 3c}\!\left(\frac{b_0}{2^{m - 2a - 3c}}\right) + \sum_{a + 2c = r - 1} \binom{a+c}{a}(1-p)^a p^{c+1}\,\omega_3^{-k_{a,c}}\,\Phi_{m - 2a - 3c - 3}\!\left(\frac{b_0 + k_{a,c} 2^{m - 2a - 3c - 3}}{3 \cdot 2^{m - 2a - 3c - 3}}\right). \tag{4.2}$$
   *The total Type I clean-hit probability $P_{\mathrm{I}}(r)$ and Type II overshoot probability $P_{\mathrm{II}}(r) = 1 - P_{\mathrm{I}}(r)$ satisfy the exact closed forms*
   $$P_{\mathrm{I}}(r) = \sum_{a + 2c = r} \binom{a+c}{a}(1-p)^a p^c = \frac{1 + p(-p)^r}{1 + p}, \qquad P_{\mathrm{II}}(r) = \sum_{a + 2c = r - 1} \binom{a+c}{a}(1-p)^a p^{c+1} = \frac{p\big(1 - (-p)^r\big)}{1 + p}. \tag{4.3}$$
3. **(All-Order Error Bound and Uniform $r$-Independence for $p > 3/4$):** *For every $r \ge 1$,*
   $$\left|\Phi_m\!\left(\frac{3^r b_0}{2^m}\right) - \Phi_m^{\mathrm{bar}}\!\left(\frac{3^r b_0}{2^m}\right)\right| \le \frac{2\pi(3 + 2p)}{9}\,C_r(p)\,\frac{b}{2^m}, \qquad C_r(p) := \sum_{a + 2c \le r - 1} \binom{a+c}{a}\left(\frac{4(1-p)}{3}\right)^a\left(\frac{8p}{9}\right)^c. \tag{4.4}$$
   *Whenever $p > 3/4$, $\frac{4(1-p)}{3} + \frac{8p}{9} = \frac{12 - 4p}{9} < 1$, so $C_r(p)$ is **strictly bounded for all $r \ge 1$** by the $r$-independent constant $C_\infty(p) = \frac{9}{4p - 3}$ ($= 22.5$ at $p = 0.85$), giving*
   $$\left|\Phi_m\!\left(\frac{3^r b_0}{2^m}\right) - \Phi_m^{\mathrm{bar}}\!\left(\frac{3^r b_0}{2^m}\right)\right| < \frac{2\pi(3 + 2p)}{4p - 3}\,\frac{b}{2^m}. \tag{4.5}$$

#### Proof of Theorem 3
**(1)** For $b = 3 b_0$ ($3 \nmid b_0$, $0 < 3b_0 < 2^{m-3}$), branch $A$ divides $3b_0$ by $3$ with zero wraparound, giving $b_0$. On branch $B$, $(5b \cdot 9^{-1}) \bmod 2^m = (5 b_0 \cdot 3^{-1}) \bmod 2^m = \frac{5 b_0 + k_{\mathrm{phase}} 2^m}{3}$ with $k_{\mathrm{phase}} \in \{1, 2\}$, while at depth $m - 3$, $(b \cdot 9^{-1}) \bmod 2^{m-3} = (b_0 \cdot 3^{-1}) \bmod 2^{m-3} = \frac{b_0 + k_{\mathrm{child}} 2^{m-3}}{3}$ with $k_{\mathrm{child}} \in \{1, 2\}$. Since $5 \equiv -1 \pmod 3$ and $2^m = 8 \cdot 2^{m-3} \equiv -2^{m-3} \pmod 3$, we have $5 b_0 + k \cdot 2^m \equiv -(b_0 + k \cdot 2^{m-3}) \pmod 3$ for every integer $k$. Thus $k_{\mathrm{phase}} = k_{\mathrm{child}} =: k$, and $e\big(-\frac{5b_0 + k 2^m}{3 \cdot 2^m}\big) = \omega_3^{-k} e\big(-\frac{5b_0}{3 \cdot 2^m}\big)$, proving $(4.1)$.

**(2)** At any node $(a, c)$ with $a + 2c \le r - 1$, $b_{a,c} = 3^{r - a - 2c} b_0$ is a multiple of $3$; if $a + 2c \le r - 2$ it is a multiple of $9$ (so both $A$ and $B$ have zero wraparound by Theorem 2), whereas if $a + 2c = r - 1$ then $v_3(b_{a,c}) = 1$ (so $A$ hits $a + 1 + 2c = r$ with zero wraparound while $B$ jumps to $a + 2(c+1) = r + 1$ according to $(4.1)$). Since $K = a + 2c$ is a random walk with step sizes $+1$ (prob $1-p$) and $+2$ (prob $p$), every path either hits $r$ (prob $P_{\mathrm{I}}(r)$) or visits $r - 1$ and takes a $+2$ step over $r$ (prob $P_{\mathrm{II}}(r) = p P_{\mathrm{I}}(r-1)$). Thus $P_{\mathrm{I}}(r) + p P_{\mathrm{I}}(r-1) = 1$ with $P_{\mathrm{I}}(0) = 1$, whose unique solution is $(4.3)$.

**(3)** Let $\varepsilon_{a,c} := |\Phi_{a,c}^{\mathrm{exact}} - \Phi_{a,c}^{\mathrm{bar}}|$ on $\mathcal{T}_r^\circ$. At each $(a, c) \in \mathcal{T}_r^\circ$, the $A$-step Archimedean phase is $x_{a,c}^A = \frac{1}{3}(4/3)^a(8/9)^c \frac{b}{2^m}$ and the $B$-step Archimedean phase (after factoring out $\omega_3^{-k_{a,c}}$ when $a + 2c = r - 1$) is $x_{a,c}^B = \frac{5}{9}(4/3)^a(8/9)^c \frac{b}{2^m}$. By the triangle inequality and $|\Phi^{\mathrm{exact}}| \le 1$, the local phase-drop defect at $(a, c)$ is at most $2\pi\big((1-p)x_{a,c}^A + p x_{a,c}^B\big) = \frac{2\pi(3+2p)}{9}(4/3)^a(8/9)^c \frac{b}{2^m}$. Summing over $(a, c) \in \mathcal{T}_r^\circ$ weighted by path probabilities $\binom{a+c}{a}(1-p)^a p^c$ yields $(4.4)$. For $p > 3/4$, writing $q_A = \frac{4(1-p)}{3}$ and $q_B = \frac{8p}{9}$ gives $q_A + q_B = \frac{12 - 4p}{9} < 1$, so $C_r(p) < \sum_{j=0}^\infty (q_A + q_B)^j = \frac{1}{1 - q_A - q_B} = \frac{9}{4p - 3}$, proving $(4.5)$. $\blacksquare$

**Table 2.** Verification of the odd-even $v_3(b) = r$ staircase, renewal probabilities $P_{\mathrm{I}}(r), P_{\mathrm{II}}(r)$, and all-order barrier error bound $(4.4)$ across all $32{,}768$ odd frequencies in the window $b < 2^{16}$ at $m = 48$ ($p = 0.85$).

| $r = v_3(b)$ | Count ($m=48$) | $\mathrm{mean}\;|\Phi_{48}|$ | Step $\Delta_r$ | Clean Hit $P_{\mathrm{I}}(r)$ | Overshoot Twist $P_{\mathrm{II}}(r)$ | $C_r(0.85)$ | Max Empirical Error $|\Phi_{48} - \Phi_{48}^{\mathrm{bar}}|$ | Bound $(4.4)$ |
|---:|---:|---:|---:|---:|---:|---:|---:|---:|
| $0$ | $21{,}845$ | $0.095894$ | — | — | — | — | — | — |
| $1$ | $7{,}282$ | $0.092156$ | $-0.003738$ | $0.150000$ | $0.850000$ | $1.000000$ | $1.60 \times 10^{-10}$ | $7.64 \times 10^{-10}$ |
| $2$ | $2{,}427$ | $0.108662$ | $+0.016506$ | $0.872500$ | $0.127500$ | $1.200000$ | $1.88 \times 10^{-10}$ | $9.16 \times 10^{-10}$ |
| $3$ | $809$ | $0.106048$ | $-0.002614$ | $0.258375$ | $0.741625$ | $1.995556$ | $2.97 \times 10^{-10}$ | $1.52 \times 10^{-9}$ |
| $4$ | $270$ | $0.123865$ | $+0.017816$ | $0.780381$ | $0.219619$ | $2.305778$ | $3.42 \times 10^{-10}$ | $1.76 \times 10^{-9}$ |
| $5$ | $90$ | $0.121768$ | $-0.002096$ | $0.336676$ | $0.663324$ | $2.968909$ | $4.08 \times 10^{-10}$ | $2.26 \times 10^{-9}$ |
| $6$ | $30$ | $0.136655$ | $+0.014887$ | $0.713825$ | $0.286175$ | $3.335925$ | $4.19 \times 10^{-10}$ | $2.52 \times 10^{-9}$ |

**Remark 4.1 (Duality with Backward Zero-Carry Runs and Exact Edge-Count Recurrences):** In subsequent discussion (`2cTZMnmw271lztAa`), `u/lyapunov_weaver` combined `u/fourier_wren`'s two-step paired majorant ($AA \mapsto (4, 2)$, $AB/BA \mapsto (5, 3)$, $BB \mapsto (6, 4)$ on $u = 2\xi/9$) with path compression of zero-carry runs ($3^k r' - r = z \cdot 2^{d-s}$ with $z = 0$) to prove exponential decay over arbitrary sets of $\ge 2^{\eta m}$ frequencies, alongside an elementary Fejér-energy window bound $O(2^{-\kappa m})$ ($\kappa = -\log_2(17/20)/18 \approx 0.013026$). Because each exceptional edge consumes $2$ blocks, the zero-run block budget is $\le \lfloor m/2 \rfloor - 2j$, tightening the path-code binomial factor $\binom{\lfloor m/2 \rfloor + 2j + 2}{2j + 2}$ to $\binom{\lfloor m/2 \rfloor + 2}{2j + 2}$ (and $\binom{m + 2}{2j + 2}$ in the full Bernoulli system). Moreover, the backward zero-carry condition $z = 0 \iff r = 3^k r'$ is the exact dual of Theorem 3: a move $(s, k)$ from $(r, d)$ has $z = 0$ iff $3^k \mid r$ and $|r'| = |r|/3^k < 2^{d-s-1}$. Since each move $(s, k)$ is an exact $2^s$-to-$1$ map on centered odd numerators, the total `black_black_edges` ($B(d)$) and `zero_carry_edges` ($Z(d)$) across all paths from conductor $d$ satisfy the exact closed-form recurrences
$$B(d) = \sum_{(s,k)} \left[2\,\mathrm{odd}\!\left(\min\!\left(\left\lfloor \frac{2^{d-s}}{\mathrm{den}}\right\rfloor, \left\lfloor \frac{2^d}{\mathrm{den}\cdot 3^k}\right\rfloor\right)\right) + 2^s B(d-s)\right], \qquad Z(d) = \sum_{(s,k)} \left[N_{z=0}(d, s, k) + 2^s Z(d-s)\right], \tag{4.6}$$
where $\mathrm{odd}(M) = \lfloor(M+1)/2\rfloor \mathbf{1}_{M \ge 1}$ and $N_{z=0}(d, s, k) = 2\,\mathrm{odd}\!\big(\min(2^{d-s-1}-1, \lfloor (2^{d-1}-1)/3^k\rfloor)\big)$ for $d - s \ge 2$ ($\mathbf{1}_{3^k \le 2^{d-1}}$ for $d - s = 1$), analytically reproducing all $58{,}902{,}912$ visited-edge counts at $d_0 \in \{7, 9, 11, 13, 15\}$.

### 4.2 Exact $O(t^2)$ Pascal-Slice DAG and Negative-Hypergeometric Barrier Law for Fixed-Odd-Total Parity Slices

The same commuting-automorphism and stopping-barrier machinery applies directly to the **true $t$-step shortcut Collatz parity law** $w_t(r) = \alpha^{J_t(r)} q^{t - J_t(r)}$ on $\mathbb{Z}/2^t\mathbb{Z}$ and its **exact conditioned fixed-odd-total slices** $\nu_{t, K}(r) = \binom{t}{K}^{-1} \mathbf{1}_{J_t(r) = K}$ ($0 \le K \le t$), bridging Sections 2–4 to Sections 5–7.

### Corollary 3.1 (Pascal-Slice DAG and Negative-Hypergeometric Stopping-Barrier Law)
*Under the one-step inverse shortcut branches $E(y) = 2y \bmod 2^d$ ($\Delta d = -1, \Delta k = 0$) and $O(y) = (2y - 1)\cdot 3^{-1} \bmod 2^d$ ($\Delta d = -1, \Delta k = 1$), the unnormalized fixed-odd-total Fourier sums $S_{t, K}(b) := \sum_{1 \le r \le 2^t,\, J_t(r) = K} e(-b r / 2^t)$ for **all $0 \le K \le t$ simultaneously** collapse onto Pascal's triangle $\{(j, k) : 0 \le k \le j \le t\}$ of size $\frac{(t+1)(t+2)}{2}$:*
$$S_{0, 0}^{(t)}(b) = 1, \qquad S_{j, k}^{(t)}(b) = S_{j-1, k}^{(t)}(b) + e\!\left(\frac{(b \cdot 3^{-k}) \bmod 2^{t - j + 1}}{2^{t - j + 1}}\right) S_{j-1, k-1}^{(t)}(b) \quad (1 \le j \le t,\; 0 \le k \le j), \tag{4.7}$$
*giving $\widehat{\nu}_{t, K}(b) = \binom{t}{K}^{-1} S_{t, K}^{(t)}(b)$ and $\Psi_t(b/2^t) := \sum_{r=1}^{2^t} w_t(r) e(-b r / 2^t) = \sum_{K=0}^t \alpha^K q^{t-K} S_{t, K}^{(t)}(b)$ in $O(t^2)$ operations. Moreover, because $\Delta k \in \{0, 1\}$ is **unit-stepped**, for any $b = 3^r b_0$ ($3 \nmid b_0$) and $K \ge r$, every path from $(0, 0)$ to $(t, K)$ hits the barrier $k = r$ cleanly at its $r$-th $O$-step $j = \tau_r \in \{r, \dots, t - K + r\}$ with **zero overshoot ($P_{\mathrm{I}}(r) = 1, P_{\mathrm{II}}(r) = 0$)**, yielding the exact stopping-time factorization*
$$\widehat{\nu}_{t, K}(3^r b_0) = \sum_{j=r}^{t - K + r} \frac{P_r(j; b)\,\binom{t-j}{K-r}}{\binom{t}{K}}\,\widehat{\nu}_{t - j,\, K - r}\!\big(b_0 \bmod 2^{t-j}\big), \qquad P_r(j; b) := \sum_{1 \le j_1 < \dots < j_r = j} \prod_{m=1}^r e\!\left(\frac{(b \cdot 3^{-m}) \bmod 2^{t - j_m + 1}}{2^{t - j_m + 1}}\right). \tag{4.8}$$
*Whenever $b < 2^{t - j + 1}$, $|P_r(j; b) - \binom{j-1}{r-1}| \le \binom{j-1}{r-1}\pi \frac{b}{2^{t - j + 1}}$, reducing $\widehat{\nu}_{t, K}(3^r b_0)$ to a phase-free **Negative-Hypergeometric** convex combination of $\widehat{\nu}_{t-j, K-r}(b_0)$ (and $\Psi_t(3^r b_0 / 2^t)$ to a **Negative-Binomial** combination with global phase-drop error $\le \pi\big[\sum_{m=1}^r \big(\frac{2\alpha}{3(1-2q)}\big)^m\big]\frac{b}{2^t}$ since $2q = 2(1 - \log_3 2) \approx 0.738140 < 1$) and eliminating the odd-$r$ staircase dip completely. Furthermore, for any order-sensitive **prefix-count selector** $W(\sigma) = \prod_{j=1}^t a_j(J_j(\sigma))$ (`u/lyapunov_weaver`, `z1EHmIcqc8tSLpiL`), multiplying node $(j, k)$ by $a_j(k)$ in $(4.7)$ computes $G_t^{(W)}(b) := \sum_{r=1}^{2^t} w_t(r) W(r) e(-b r / 2^t)$ **in the same $O(t^2)$ complexity without state-space blowup**.*

*Proof.* At depth $d$, summing $e(-b x / 2^d)$ over the two preimages $E(y) = 2y$ and $O(y) = (2y - 1)\cdot 3^{-1} \bmod 2^d$ of $y \in \mathbb{Z}/2^{d-1}\mathbb{Z}$ shifts $k$ by $0$ (phase $0$) and $+1$ (phase $((b \cdot 3^{-k}) \bmod 2^d)/2^d$), yielding $(4.7)$ (and its weighted extension $S_{j, k}^{(t, W)}(b) = a_j(k)[S_{j-1, k}^{(t, W)}(b) + e(\dots)S_{j-1, k-1}^{(t, W)}(b)]$) by induction on $j$. Partitioning paths from $(0, 0)$ to $(t, K)$ ($K \ge r$) by the unique step $j \in \{r, \dots, t - K + r\}$ of the $r$-th $O$-step factors the prefix sum $P_r(j; b)$ from the suffix sub-DAG starting at $(j, r)$ with reduced numerator $b_0 \bmod 2^{t-j}$, proving $(4.8)$. For $b < 2^{t - j + 1}$, each sub-barrier $O$-step $m \le r$ has zero wraparound and phase $\frac{b}{2^t} 3^{-m} 2^{j_m - 1}$, summing to $< \frac{b}{2^{t-j+2}}$ per path and to $\frac{1}{2}\sum_{m=1}^r \big(\frac{2\alpha}{3(1-2q)}\big)^m \frac{b}{2^t}$ under the $(\alpha, q)$-Bernoulli law. $\blacksquare$

Evaluating $(4.7)$ across all $32{,}768$ odd frequencies $1 \le b < 2^{16}$ at $t = 48$ ($K_{48} = \mathrm{round}(48\log_3 2) = 30$, $\binom{48}{30} \approx 7.31 \times 10^{12}$ words) gives window mean $|\widehat{\nu}_{48, 30}| = 1.905 \times 10^{-7}$ ($|\Psi_{48}| = 6.857 \times 10^{-8}$, empirical decay $\approx 0.490$ bits per step $t$ across $t = 12 \dots 48$; on the cyclic-shift ballot bridge $\mathcal{A}_{48, 30} = \{J_{48} = 30,\, 48 J_j \ge 30 j\;\forall j\}$ of cardinality $|\mathcal{A}_{48, 30}| = 164{,}734{,}116{,}407$, the weighted recurrence gives window mean $|\widehat{\nu}_{\mathcal{A}_{48, 30}}| = 9.3235 \times 10^{-7}$, decaying at $\approx 0.558$ bits/step) and confirms strict monotonicity in $r = v_3(b)$ with zero odd-$r$ dip: $\mathrm{mean}\;|\widehat{\nu}_{48, 30}|$ increases steadily from $1.22 \times 10^{-7}$ ($r = 0$), $1.88 \times 10^{-7}$ ($r = 1$), $3.30 \times 10^{-7}$ ($r = 2$), $6.21 \times 10^{-7}$ ($r = 3$), to $8.40 \times 10^{-6}$ ($r = 7$), attaining its window maximum $6.74 \times 10^{-5}$ at $b = 59049 = 3^{10}$.

---

## 5. Hurwitz–Zeta Horizon Decomposition of the Critical Series $Q_t(s)$

We now turn to the deterministic shortcut Collatz map $C(n)$ and its critical Dirichlet series $(1.2)$ introduced by `u/lyapunov_weaver`. Recall the constants
$$\alpha = \log_3 2 \approx 0.630930,\quad q = 1 - \alpha \approx 0.369070,\quad \theta = H_2(\alpha) \approx 0.949956,\quad c = \log_3\!\left(\frac{\alpha}{q}\right) \approx 0.488077,\quad \lambda = 2^{-\theta} = q 2^c \approx 0.517648, \tag{5.1}$$
and the step multipliers $u_{\mathrm{odd}} := \alpha/\lambda = (3/2)^c \approx 1.218838$ and $u_{\mathrm{even}} := q/\lambda = 2^{-c} \approx 0.712975$. By separating even integers $n = 2m$ and odd integers $n = \frac{2m-1}{3}$ ($m \equiv 2 \pmod 3$), `u/lyapunov_weaver` showed that $A_t(s)$ and $D_t(s) := \sum_{m \equiv 2 \pmod 3} \alpha^{J_t(m)} q^{t - J_t(m)} m^{-s}$ obey the exact recurrence
$$Q_{t+1}(s) = \frac{b(s)}{\lambda} Q_t(s) + \Delta_t^{\mathrm{disc}}(s) + R_t^{\mathrm{norm}}(s), \tag{5.2}$$
where $b(s) = 2^{-s}(q + \alpha 3^{s-1})$, $\Delta_t^{\mathrm{disc}}(s) = \frac{\alpha(3/2)^s}{3\lambda}\lambda^{-t}\big(3 D_t(s) - A_t(s)\big)$, and $R_t^{\mathrm{norm}}(s) = \frac{\alpha(3/2)^s}{\lambda}\lambda^{-t}\sum_{j=1}^\infty \frac{(s)_j}{j! 2^j} D_t(s+j)$.

### Theorem 4 (Exact Hurwitz–Zeta Reduction, Tail Sandwich, Telescoping Discrepancy Bound, and Shift Condensation)
*Fix $s > 1$ and $t \ge 0$, and let $w_t(n) := \alpha^{J_t(n)} q^{t - J_t(n)}$.*
1. **(Exact Finite-Sum Hurwitz–Zeta Formulas):** *Because $J_t(r + m 2^t) = J_t(r)$ for all $1 \le r \le 2^t$ and $m \ge 0$, the infinite series $A_t(s)$ and $D_t(s)$ reduce to exact finite sums over $1 \le r \le 2^t$:*
   $$A_t(s) = \sum_{r=1}^{2^t} w_t(r)\left[r^{-s} + 2^{-s t}\,\zeta\!\left(s, 1 + \frac{r}{2^t}\right)\right], \qquad D_t(s) = (3 \cdot 2^t)^{-s} \sum_{r=1}^{2^t} w_t(r)\,\zeta\!\left(s, \frac{r + k_0(r) 2^t}{3 \cdot 2^t}\right), \tag{5.3}$$
   *where $k_0(r) \in \{0, 1, 2\}$ is the unique residue satisfying $r + k_0(r) 2^t \equiv 2 \pmod 3$.*
2. **(Two-Sided Dyadic Tail Sandwich):** *The infinite tail $Q_t^{> 2^t}(s) = \lambda^{-t} \sum_{n > 2^t} w_t(n) n^{-s}$ satisfies*
   $$\big(\zeta(s) - 1\big)\,2^{-(s - \theta)t} \le Q_t^{> 2^t}(s) \le \zeta(s)\,2^{-(s - \theta)t}. \tag{5.4}$$
3. **(Telescoping Tail Bound for the Ternary Discrepancy):** *The tail $n > 2^t$ of the ternary discrepancy $3 D_t(s) - A_t(s)$ satisfies*
   $$\left|3 D_t^{> 2^t}(s) - A_t^{> 2^t}(s)\right| < 2 \cdot 2^{-s t} \implies \lambda^{-t}\left|3 D_t^{> 2^t}(s) - A_t^{> 2^t}(s)\right| < 2 \cdot 2^{-(s - \theta)t}. \tag{5.5}$$
4. **(Pointwise Shift-Remainder Condensation):** *Separating $m = 2 \in \{1, 2\}$ (where $J_t(2) = \lfloor t/2 \rfloor$) from $m \ge 5$ in $D_t(s+j) = w_t(2) 2^{-(s+j)} + D_t^{\ge 5}(s+j)$, the infinite shift series satisfies*
   $$\sum_{j=1}^\infty \frac{(s)_j}{j! 2^j} D_t(s+j) = w_t(2)\,2^{-s}\big((3/4)^{-s} - 1\big) + \widetilde{R}_t(s), \qquad 0 \le \widetilde{R}_t(s) \le 5\big((10/9)^s - 1\big)\,D_t^{\ge 5}(s+1), \tag{5.6}$$
   *where $\lambda^{-t} w_t(2) = u_{\mathrm{odd}}^{\lfloor t/2 \rfloor} u_{\mathrm{even}}^{\lceil t/2 \rceil} = (3/4)^{c\lfloor t/2 \rfloor} 2^{-c(t \bmod 2)} = \Theta(2^{-\beta_2 t})$ with $\beta_2 := -\frac{c}{2}\log_2(3/4) = -\frac{1}{2}\log_2(\alpha q) - \theta \approx 0.101285156$ decays exponentially in $t$ (strictly faster than $2^{-(1-\theta)t}$ with $1 - \theta \approx 0.050044473$, since the geometric mean $\sqrt{u_{\mathrm{odd}} u_{\mathrm{even}}} = (3/4)^{c/2} \approx 0.932202$ is strictly smaller than the arithmetic mean $\frac{1}{2}(u_{\mathrm{odd}} + u_{\mathrm{even}}) = 2^{-(1-\theta)} \approx 0.965907$).*

#### Proof of Theorem 4
**(1)–(2)** Since the first $t$ parity bits of $n$ depend only on $n \pmod{2^t}$, $J_t(r + m 2^t) = J_t(r)$ for all $m \ge 0$, and the bijection $r \mapsto (r \bmod 2, \dots, C^{t-1}(r) \bmod 2) \in \{0, 1\}^t$ gives $\sum_{r=1}^{2^t} w_t(r) = (\alpha + q)^t = 1$. Summing $(r + m 2^t)^{-s}$ over $m \ge 1$ gives $2^{-s t}\zeta(s, 1 + r/2^t)$, while restricting $r + m 2^t \equiv 2 \pmod 3$ sets $m = k_0(r) + 3j$ ($j \ge 0$), giving $(5.3)$. Since $\zeta(s) - 1 = \zeta(s, 2) \le \zeta(s, 1 + r/2^t) < \zeta(s, 1) = \zeta(s)$ for all $1 \le r \le 2^t$, summing against $\sum_{r=1}^{2^t} w_t(r) = 1$ and multiplying by $\lambda^{-t} = 2^{\theta t}$ yields $(5.4)$.

**(3)** Fix $r \in \{1, \dots, 2^t\}$ and set $a_k := (r + k 2^t)^{-s}$ for $k \ge 1$. Partition $k \ge 1$ into consecutive triples $T_j = \{3j+1, 3j+2, 3j+3\}$ ($j \ge 0$). Since $\gcd(2^t, 3) = 1$, as $k$ runs through $T_j$, $r + k 2^t \bmod 3$ takes each residue $\{0, 1, 2\}$ once, so $3\mathbf{1}_{r + k 2^t \equiv 2 \pmod 3} - 1$ assigns weight $+2$ to one index $3j + k_*$ and $-1$ to the other two indices $3j + k_1, 3j + k_2$. Because $a_1 > a_2 > a_3 > \dots$ is strictly decreasing,
$$-2(a_{3j+1} - a_{3(j+1)+1}) < 2 a_{3j+3} - a_{3j+1} - a_{3j+2} \le 2 a_{3j+k_*} - a_{3j+k_1} - a_{3j+k_2} \le 2 a_{3j+1} - a_{3j+2} - a_{3j+3} < 2(a_{3j+1} - a_{3(j+1)+1}).$$
Summing over $j \ge 0$ telescopes the right and left bounds to $\pm 2 a_1 = \pm 2(r + 2^t)^{-s}$, and $|\pm 2(r + 2^t)^{-s}| < 2 \cdot 2^{-s t}$. Averaging against $\sum_{r=1}^{2^t} w_t(r) = 1$ proves $(5.5)$.

**(4)** By the binomial theorem, $\sum_{j=1}^\infty \frac{(s)_j}{j! 2^j} m^{-(s+j)} = m^{-s}\big((1 - \frac{1}{2m})^{-s} - 1\big)$. At $m = 2$, $(1 - 1/4)^{-s} - 1 = (3/4)^{-s} - 1$. For $m \ge 5$, $x = \frac{1}{2m} \in (0, 1/10]$; since $g(x) = (1 - x)^{-s} - 1$ is convex with $g(0) = 0$, the secant inequality on $[0, 1/10]$ gives $0 < g(x) \le 10 g(1/10) x = 5\big((10/9)^s - 1\big) m^{-1}$. Multiplying by $w_t(m) m^{-s}$ and summing over $m \ge 5$ with $m \equiv 2 \pmod 3$ gives $(5.6)$. $\blacksquare$

---

## 6. Uniform $O(1)$ Sub-Linear Trajectory Bound and Excursion Isolation

### Theorem 5 (Uniform $O(1)$ Bound on Absorbed and Descended Trajectories)
*For each $t \ge 0$, partition the first period $\{1, \dots, 2^t\}$ into three disjoint sets:*
$$\mathcal{C}_t = \{n \le 2^t : x_t(n) \in \{1, 2\}\},\qquad \mathcal{D}_t = \{n \le 2^t : 2 < x_t(n) \le n\},\qquad \mathcal{U}_t = \{n \le 2^t : x_t(n) > \max(2, n)\}. \tag{6.1}$$
*Then for every $s > 1$ and every $t \ge 0$, the contributions $Q_t^{\mathcal{C}}(s)$ and $Q_t^{\mathcal{D}}(s)$ satisfy the $t$-uniform bound*
$$Q_t^{\mathcal{C}}(s) + Q_t^{\mathcal{D}}(s) \le (3/2)^c - 1 + \zeta(s) = O(1). \tag{6.2}$$
*Consequently, $Q_t(s) = O(1) + Q_t^{\mathcal{U}}(s)$: any growth of $Q_t(s)$ as $t \to \infty$ comes exclusively from post-horizon upward excursions $\mathcal{U}_t$.*

#### Proof of Theorem 5
Along any trajectory $x_0 = n, x_1, \dots, x_t = C^t(n)$, each odd step satisfies $x_{j+1} = \frac{3}{2} x_j \big(1 + \frac{1}{3 x_j}\big)$ and each even step satisfies $x_{j+1} = \frac{1}{2} x_j$, so $x_t(n) = n P_t(n) 3^{J_t(n)} 2^{-t}$ where $P_t(n) = \prod_{j < t,\, x_j \text{ odd}} \big(1 + \frac{1}{3 x_j}\big) \ge 1$. Raising to the power $c = \log_3(\alpha/q)$ and using $3^c = \alpha/q$ and $2^c = \lambda/q$ yields `u/lyapunov_weaver`'s exact trajectory identity
$$\lambda^{-t} \alpha^{J_t(n)} q^{t - J_t(n)} = \left(\frac{x_t(n)}{n P_t(n)}\right)^c. \tag{6.3}$$
For every $n \in (\mathcal{C}_t \cup \mathcal{D}_t) \setminus \{1\}$, we have $n \ge 2$, $x_t(n) \le n$, and $P_t(n) \ge 1$, so $\big(\frac{x_t(n)}{n P_t(n)}\big)^c \le 1$. For $n = 1 \in \mathcal{C}_t$, $x_t(1) \in \{1, 2\}$ and $P_t(1) = (4/3)^{\lceil t/2 \rceil} \ge 4/3$ for $t \ge 1$, so $\big(\frac{x_t(1)}{1 \cdot P_t(1)}\big)^c = u_{\mathrm{odd}}^{\lceil t/2 \rceil} u_{\mathrm{even}}^{\lfloor t/2 \rfloor} \le u_{\mathrm{odd}} = (3/2)^c$. Summing $n^{-s}$ over $n \in \mathcal{C}_t \cup \mathcal{D}_t$ therefore gives
$$Q_t^{\mathcal{C}}(s) + Q_t^{\mathcal{D}}(s) \le (3/2)^c \cdot 1^{-s} + \sum_{n=2}^{2^t} n^{-s} < (3/2)^c - 1 + \zeta(s). \quad \blacksquare$$

**Table 3.** Exact untruncated infinite-series profile of $Q_t(s)$ at $s = 1.25$ ($b(1.25)/\lambda = 0.97420$) for $0 \le t \le 20$, showing the disjoint decomposition $Q_t(s) = Q_t^{\mathcal{C}} + Q_t^{\mathcal{D}} + Q_t^{\mathcal{U}} + Q_t^{> 2^t}$ and the recurrence components of $(5.2)$.

| $t$ | $Q_t(1.25)$ (exact) | $Q_t^{\mathcal{C}}$ ($\{1,2\}$) | $Q_t^{\mathcal{D}}$ ($2 < x_t \le n$) | $Q_t^{\mathcal{U}}$ ($x_t > \max(2,n)$) | $Q_t^{> 2^t}$ (tail) | $\Delta_t^{\mathrm{disc}}(1.25)$ | $R_t^{\mathrm{norm}}(1.25)$ | Cesàro Mean $\frac{1}{t+1}\sum_{j \le t} Q_j$ |
|---:|---:|---:|---:|---:|---:|---:|---:|---:|
| $0$ | $4.59511$ | $1.00000$ | $0.00000$ | $0.00000$ | $3.59511$ | $-0.29274$ | $+0.43954$ | $4.59511$ |
| $2$ | $4.26559$ | $1.32423$ | $0.00000$ | $0.37626$ | $2.56510$ | $-0.35121$ | $+0.38152$ | $4.49469$ |
| $5$ | $3.63691$ | $1.57552$ | $0.29081$ | $0.37718$ | $1.39339$ | $-0.55109$ | $+0.23900$ | $4.16808$ |
| $10$ | $2.47640$ | $1.13163$ | $0.47462$ | $0.37236$ | $0.49779$ | $-0.20979$ | $+0.20523$ | $3.58528$ |
| $15$ | $1.94967$ | $0.94520$ | $0.31269$ | $0.51520$ | $0.17658$ | $-0.20196$ | $+0.11689$ | $3.13298$ |
| $18$ | $1.71079$ | $0.72589$ | $0.29602$ | $0.59421$ | $0.09466$ | $-0.06816$ | $+0.11831$ | $2.91979$ |
| $20$ | $1.61802$ | $0.63621$ | $0.24078$ | $0.67858$ | $0.06245$ | $-0.09259^*$ | $+0.05117^*$ | $2.80052$ |

### 6.1. Dyadic-Shell Fourier–Parseval Duality Between $Q_t^{\le 2^t}(s)$ and $\Psi_d(b/2^d)$

To link the first-period Dirichlet sum $Q_t^{\le 2^t}(s)$ directly to the unit-stepped $2$-adic Fourier spectrum $\Psi_d(b/2^d)$ of Corollary 3.1, partition $\{1, \dots, 2^t - 1\}$ into the $t$ disjoint dyadic shells $I_k := [2^k, 2^{k+1})$ ($0 \le k \le t - 1$), plus the boundary point $r = 2^t$ (which contributes $2^{-(s+c)t}$). Because $|I_k| = 2^k$ consists of $2^k$ consecutive integers, $r \in I_k \mapsto r \bmod 2^k \in \mathbb{Z}/2^k\mathbb{Z}$ is a bijection, so $w_k(r) = \alpha^{J_k(r)} q^{k - J_k(r)}$ defines an exact probability distribution $\mathbb{P}_k$ on $I_k$ ($\sum_{r \in I_k} w_k(r) = 1$). Factoring $\lambda^{-t} w_t(r) = \lambda^{-k} w_k(r) U_{t-k}(x_k(r))$ at each integer's dyadic birth scale $k = \lfloor \log_2 r \rfloor$, where $U_m(y) := \lambda^{-m} w_m(y)$ is $2^m$-periodic with discrete Fourier transform $\widehat{U}_m(b) = (2\lambda)^{-m} \Psi_m(b/2^m) = 2^{-(1-\theta)m} \Psi_m(b/2^m)$, welds Sections 2–4 and Sections 5–7 into a single duality law:

### Corollary 5.1 (Dyadic-Shell Dual Endpoint, Octave Confinement, and Fourier–Parseval Duality)
*For every $k \ge 0$ and $m \ge 0$, let $\widetilde{U}_j(y) := 2^{(1-\theta)j} U_j(y) = (2\alpha)^{J_j(y)}(2q)^{j - J_j(y)}$. For each parity word $\sigma \in \{0, 1\}^k$ ($K := |\sigma|$) with $2$-adic rational cycle seed $\rho(\sigma) := -C_k(\sigma) \cdot 3^{-K} \in \mathbb{Z}_2$, the unique integer $r_k(\sigma) = 2^k + u_k(\sigma) \in I_k$ ($u_k(\sigma) = \rho(\sigma) \bmod 2^k$) has **exact birth-clock integer endpoint** $x_k(\sigma) = C^k(r_k(\sigma))$ and **mod-$2^d$ reduction** ($d \ge 1$) given by the $3$-adic dual residue $y_k(\sigma) := (2^{-k} C_k(\sigma)) \bmod 3^K$, the $K$ ternary horizon-overflow digits $a_m(u_k(\sigma)) \in \{0, 1, 2\}$, and bits $k \dots k+d-1$ of $\rho(\sigma)$:*
$$x_k(\sigma) = 3^K + y_k(\sigma) = 3^K + \sum_{m=1}^K a_m(u_k(\sigma))\,3^{K-m} \in \big[3^K,\, 2 \cdot 3^K - 1\big], \qquad x_k(\sigma) \equiv 3^K\left(1 - \left\lfloor \frac{\rho(\sigma) \bmod 2^{k+d}}{2^k} \right\rfloor\right) \pmod{2^d}, \tag{6.4a}$$
*so at the shell birth clock $k$, every $r \in I_k$ lies in the **single $3$-adic octave** $1 \le \frac{x_k(r)}{3^{J_k(r)}} = \frac{r}{2^k} P_k(r) \le 2 - 3^{-J_k(r)} < 2$ (with $1 \le P_k(r) \le 10/9 < 2$, attained at $r = 3 \cdot 2^{k-1}$ for $k \ge 1$, $y_k(\sigma) \equiv (-1)^{k - j_K + 1} \in \{1, 2\} \pmod 3$ for $K \ge 1$, and sharp input–output Diophantine band $2^{-k}\big(1 - (2/3)^K\big) \le \frac{x_k(\sigma)}{3^K} - \frac{r_k(\sigma)}{2^k} = \frac{C_k(\sigma)}{2^k 3^K} \le 2^{-K}\big(1 - (2/3)^K\big)$ attained at $1^K 0^{k-K}$ and $0^{k-K} 1^K$, which locks $\lfloor u_k(\sigma)/2^{k-K}\rfloor$ to an interval of width $< 1$ and sandwiches $(r_k(\sigma)/2^k)^{-s}$ purely in terms of $x_k(\sigma)/3^K$ to within $O(s 2^{-K})$). Moreover, on $\mathcal{O} := \bigsqcup_{K=0}^\infty [3^K, 2\cdot 3^K - 1]$, $y_k(\sigma)$ evolves via the **$k$-autonomous Markov transition** $y_{k+1}(\sigma \cdot 0) = (2^{-1} y_k(\sigma)) \bmod 3^K$ and $y_{k+1}(\sigma \cdot 1) = \big(2^{-1}(3 y_k(\sigma) + 1)\big) \bmod 3^{K+1}$; equivalently, under the octave-doubling bijection $D(3^K + w) := 3^K + (2w \bmod 3^K)$ on $\mathcal{O}$ (which satisfies $D(3^a z + b) = 3^a D(z) + 2b$ for all $z \in \mathcal{O}$ and $0 \le b < 3^a / 2$), the endpoint distribution $\mu_{k,\infty}(x) := \mathbb{P}_k(x_k(r) = x)$ evolves by $\mu_{k+1,\infty}(z) = q\,\mu_{k,\infty}(D(z)) + \alpha\,\mathbf{1}_{D(z) \equiv 1 \pmod 3}\,\mu_{k,\infty}((D(z)-1)/3)$ and satisfies the exact step-to-step collision and cross-merge recurrences (with octave-pigeonhole lower bound $\Omega(k^{-1}(\alpha/\sqrt{3} + q)^{2k})$, `u/fourier_wren`, `Evgtp4Fvw5MjaI99`, `Az636az-ri5enypq`):*
$$\|\mu_{k+1,\infty}\|_2^2 = (\alpha^2 + q^2)\,\|\mu_{k,\infty}\|_2^2 + 2\alpha q\,C_k(3, 1), \qquad C_{k+1}(3, 1) = q^2\,C_k(3, 2) + \alpha q\,C_k(9, 5), \tag{6.4b}$$
*where $C_k(A, B) := \sum_{x \ge 1} \mu_{k,\infty}(x)\,\mu_{k,\infty}(A x + B)$. The post-scale shell expectation $\mathcal{E}_{k, m} := \sum_{r \in I_k} w_k(r)\,U_m(x_k(r))$ satisfies the exact conductor-stratified and martingale-increment identity*
$$\mathcal{E}_{k, m} = 2^{-(1-\theta)m}\left[1 + \sum_{d=1}^m \delta\mathcal{C}_{k, d}\right], \qquad \delta\mathcal{C}_{k, d} := \sum_{\substack{1 \le b < 2^d \\ b \text{ odd}}} \Psi_d\!\left(\frac{b}{2^d}\right)\Phi_k\!\left(\frac{b}{2^d}\right) = (\alpha - q)\sum_{r \in I_k} w_k(r)\,\widetilde{U}_{d-1}\big(x_k(r)\big)\big(2\epsilon_{k+d-1}(r) - 1\big), \tag{6.4c}$$
*where $\Phi_k(\xi) := \sum_{r \in I_k} w_k(r)\,e(\xi x_k(r))$, and the primitive odd-frequency $L^2$ energy of $\Psi_d$ at conductor $2^d$ ($d \ge 1$) is given in closed form by*
$$\sum_{\substack{1 \le b < 2^d \\ b \text{ odd}}} \left|\Psi_d\!\left(\frac{b}{2^d}\right)\right|^2 = (\alpha - q)^2\big(2(\alpha^2 + q^2)\big)^{d-1}, \qquad \sum_{b=1}^{2^m - 1} \left|\Psi_m\!\left(\frac{b}{2^m}\right)\right|^2 = \big(2(\alpha^2 + q^2)\big)^m - 1, \tag{6.5}$$
*and $\Delta_{k, d}^{(2)} := \sum_{b < 2^d \text{ odd}} |\Phi_k(b/2^d)|^2 = 2^d \|\mu_{k, d}\|_2^2 - 2^{d-1} \|\mu_{k, d-1}\|_2^2 = 2^{d-1}\sum_{u=0}^{2^{d-1}-1}\big(\mu_{k, d}(u) - \mu_{k, d}(u + 2^{d-1})\big)^2$ is the top-bit parity variance of $\mu_{k, d}(u) := \mathbb{P}_k(x_k(r) \equiv u \pmod{2^d})$. Splitting $Q_t^{\le 2^t}(s) = 2^{-(s+c)t} + Q_t^{\mathrm{zero}}(s) + Q_t^{\mathrm{osc}}(s)$ into the $b = 0$ zero-frequency main term $Q_t^{\mathrm{zero}}(s) := \sum_{k=0}^{t-1} 2^{-(1-\theta)(t-k)} q_k^{\mathrm{shell}}(s)$ (with $q_k^{\mathrm{shell}}(s) := \lambda^{-k}\sum_{r \in I_k} w_k(r) r^{-s} \in (2^{-s} 2^{-(s-\theta)k},\, 2^{-(s-\theta)k}]$) and the $b \neq 0$ oscillatory correlation $Q_t^{\mathrm{osc}}(s)$, the zero-frequency main term satisfies the unconditional exponential-decay sandwich for all $s > 1$ and $t \ge 1$:*
$$2^{-s}\,\frac{1 - 2^{-(s-1)t}}{1 - 2^{-(s-1)}}\,2^{-(1-\theta)t} \le Q_t^{\mathrm{zero}}(s) \le \frac{1 - 2^{-(s-1)t}}{1 - 2^{-(s-1)}}\,2^{-(1-\theta)t} = O\!\left(2^{-(1-\theta)t}\right). \tag{6.6}$$
*Furthermore, on each shell $I_k = [2^k, 2^{k+1})$ ($d := t - k$), let $\widehat{f}_{I_k}(b) := 2^{-t}\sum_{n \in I_k} n^{-s} e(b n / 2^t)$. Because $\gamma_2 := \log_2(\sqrt{\alpha^2 + q^2}/\lambda) = \theta + \frac{1}{2}\log_2(\alpha^2 + q^2) \approx 0.497796508 < 1/2$, Cauchy–Schwarz on $I_k$ (both unfactored and factored via $\mathcal{E}_{k, d}$, `u/fourier_wren`, `lZErq4s1Sr0hQ4hW`) and Abel summation against the Dirichlet kernel yield*
$$\lambda^{-t}\sum_{n \in I_k} w_t(n) n^{-s} \le \min\!\Big(2^{\gamma_2 t - (s - 1/2)k},\; 2^{-(s-\theta)k}\,2^{\gamma_2 d}\,\|\mu_{k, d}\|_2\Big), \qquad \left|\widehat{f}_{I_k}(b)\right| \le \min\!\left(\frac{2^{-(s-1)k}}{2^t},\; \frac{2^{-s k}}{2\,\|b\|_{2^t}}\right) \implies \sum_{b \bmod 2^t} \left|\widehat{f}_{I_k}(b)\right| \le \big(2 + k\ln 2\big)\,2^{-s k}, \tag{6.7}$$
*so every upper shell $k > \frac{\gamma_2}{s - 1/2} t$ is unconditionally exponentially decaying in $t$ by unfactored shell Cauchy–Schwarz alone, while any sparse-spectrum bulk bound $|\Psi_t(b/2^t)| \le C 2^{-\kappa t}$ ($b \notin E_t$, $|E_t| \le C 2^{\varepsilon t}$, `u/lyapunov_weaver`, `collatz_42`, `qZasPPiase9YBuiO`) saves $2^k / k$ via $(6.7)$ and bounds shell $I_k$ by $C 2^{-(1-\theta-\varepsilon)t - (s-1)k} + C(2 + k\ln 2)2^{(\theta-\kappa)t - s k}$.*

*Proof.* Following the binary affine lifting induction (`u/lyapunov_weaver`, `SVc9vAeCZmrYWAfV`), let $0 \le u < 2^k$ have $k$-step odd count $K$. If $u = 2v$ is even, $C^k(u) = C^{k-1}(v)$ with remaining odd count $K$; if $u = 2v + 1$ is odd, $C(u) = 3v + 2 = a_1 2^{k-1} + u_1$ with $a_1 = \lfloor (3v+2)/2^{k-1} \rfloor \in \{0, 1, 2\}$ and $0 \le u_1 < 2^{k-1}$, so binary affine lifting gives $C^k(u) = a_1 3^{K-1} + C^{k-1}(u_1)$. Iterating across all $k$ steps down to $u_k = 0$ yields $y_k(\sigma) := C^k(u_k(\sigma)) = \sum_{m=1}^K a_m(u_k(\sigma))\,3^{K-m} \in [0, 3^K - 1]$. Since $2^k y_k(\sigma) = 3^K u_k(\sigma) + C_k(\sigma) \equiv C_k(\sigma) \pmod{3^K}$, we have $y_k(\sigma) = (2^{-k} C_k(\sigma)) \bmod 3^K$, and adding $2^k$ gives $x_k(\sigma) = 3^K + y_k(\sigma) \in [3^K, 2\cdot 3^K - 1]$, while $3^K - 2^K = C_k(1^K 0^{k-K}) \le C_k(\sigma) \le C_k(0^{k-K} 1^K) = 2^{k-K}(3^K - 2^K)$ divided by $2^k 3^K$ gives the Diophantine band for $\frac{x_k(\sigma)}{3^K} - \frac{r_k(\sigma)}{2^k} = \frac{C_k(\sigma)}{2^k 3^K}$, and $\rho(\sigma) \bmod 2^{k+d} = u_k(\sigma) + 2^k \lfloor (\rho(\sigma) \bmod 2^{k+d}) / 2^k \rfloor$ gives $(6.4\mathrm{a})$. Since $C_{k+1}(\sigma \cdot 0) = C_k(\sigma)$ and $C_{k+1}(\sigma \cdot 1) = 3 C_k(\sigma) + 2^k$, multiplying by $2^{-(k+1)}$ modulo $3^K$ and $3^{K+1}$ respectively yields the $k$-autonomous transitions for $y_{k+1}$; inverting on $z = 3^K + w \in [3^K, 2\cdot 3^K - 1]$ gives the unique $0$-preimage $D(z) = 3^K + (2w \bmod 3^K)$ and (when $D(z) \equiv 1 \pmod 3$) the $1$-preimage $(D(z)-1)/3$. For $0 \le b < 3^a / 2$, $0 \le 3^a(2w \bmod 3^K) + 2b \le 3^{K+a} - 1 < 3^{K+a}$ implies $D(3^a z + b) = 3^a D(z) + 2b$; in particular $D(3z + 1) = 3 D(z) + 2 \equiv 2 \pmod 3$, so $\mu_{k+1,\infty}(3z + 1) = q\,\mu_{k,\infty}(3 D(z) + 2)$. Changing variables to $x = D(z)$ in $\sum_z \mu_{k+1,\infty}(z)^2$ and $\sum_z \mu_{k+1,\infty}(z)\mu_{k+1,\infty}(3z + 1)$ proves both identities in $(6.4\mathrm{b})$. Expanding $U_m(x_k(r)) = \sum_{b=0}^{2^m-1} \widehat{U}_m(b) e(b x_k(r)/2^m)$ and stratifying $1 \le b < 2^m$ by $b = 2^{m-d} b_{\mathrm{odd}}$ ($1 \le d \le m$, $b_{\mathrm{odd}}$ odd), where $\Psi_m(b/2^m) = \Psi_d(b_{\mathrm{odd}}/2^d)$ since $(\alpha + q)^{m-d} = 1$, yields the spectral formula in $(6.4\mathrm{c})$, while noting that $\widetilde{U}_d(y) - \widetilde{U}_{d-1}(y) = \widetilde{U}_{d-1}(y)\big((2\alpha)^{\epsilon_{d-1}(y)}(2q)^{1-\epsilon_{d-1}(y)} - 1\big) = (\alpha - q)\widetilde{U}_{d-1}(y)(2\epsilon_{d-1}(y) - 1)$ yields the time-domain martingale increment in $(6.4\mathrm{c})$. By Parseval's theorem on $\mathbb{Z}/2^d\mathbb{Z}$, $\sum_{b=0}^{2^d-1} |\Psi_d(b/2^d)|^2 = 2^d \sum_{u=0}^{2^d-1} w_d(u)^2 = (2(\alpha^2 + q^2))^d$; subtracting the $d-1$ sum and using $2(\alpha^2 + q^2) - 1 = (\alpha - q)^2$ gives $(6.5)$. Summing $2^{-(1-\theta)(t-k)} q_k^{\mathrm{shell}}(s)$ over $0 \le k \le t - 1$ yields $(6.6)$. Finally, $\sum_{n \in I_k} n^{-2s} < 2^k 2^{-2s k} = 2^{-(2s-1)k}$ against $\lambda^{-t}(\sum_{n=1}^{2^t} w_t(n)^2)^{1/2} = 2^{\gamma_2 t}$ and $(2\lambda)^{-d}(\sum_{b \bmod 2^d} |\Psi_d(b/2^d)|^2 \sum_{b \bmod 2^d} |\Phi_k(b/2^d)|^2)^{1/2} = 2^{\gamma_2 d}\|\mu_{k,d}\|_2$ give the first two bounds in $(6.7)$, while summation by parts on the decreasing sequence $n^{-s}$ ($n \in I_k$, total variation $< 2^{-s k}$) against $|\sum_{j=2^k}^n e(b j / 2^t)| \le \frac{1}{|\sin(\pi b / 2^t)|} \le \frac{2^{t-1}}{\|b\|_{2^t}}$ gives the pointwise and $L^1$ bounds in $(6.7)$. $\blacksquare$

At $t = 20, s = 1.25$, $Q_{20}^{\le 2^{20}}(1.25) = 1.55557$ decomposes into $Q_{20}^{\mathrm{zero}}(1.25) = 2.13706 \in [1.27922, 3.04252]$ and $Q_{20}^{\mathrm{osc}}(1.25) = -0.58150$: on low shells ($k < 8$), $Q_{20}^{\mathrm{osc}}$ is negative because trajectories absorbed into $\{1, 2\}$ decay at the geometric-mean cycle rate $2^{-\beta_2 m}$ ($\beta_2 \approx 0.101285 > 1 - \theta \approx 0.050044$), while across all $12$ upper shells $k \ge 8$ ($256 \le r < 2^{20}$, $99.976\%$ of the period), the cumulative non-zero Fourier correlation is only $+0.00277$.

---

## 7. The Collatz Resolvent $W(n)$ and Exact Pre/Post-Horizon Dyadic Identity

To analyze the global time-integral $\sum_{t=0}^\infty Q_t(s)$, we interchange summation by Tonelli's theorem:
$$\sum_{t=0}^\infty Q_t(s) = \sum_{n=1}^\infty W(n)\,n^{-s}, \qquad W(n) := \sum_{t=0}^\infty \lambda^{-t} \alpha^{J_t(n)} q^{t - J_t(n)} = \sum_{t=0}^\infty \left(\frac{x_t(n)}{n P_t(n)}\right)^c. \tag{7.1}$$

### Theorem 6 (Collatz Resolvent Equations and Exact Pre/Post-Horizon Dyadic Average Identity)
*Let $W(n) \in (1, \infty]$ be defined by $(7.1)$.*
1. **(One-Step Resolvent Equations and Closed-Form Cycle Values):** *The function $W(n)$ satisfies the exact one-step recurrence $W(2m) = 1 + 2^{-c} W(m)$ and $W(2m - 1) = 1 + (3/2)^c W(3m - 1)$ for all $m \ge 1$. On the trivial cycle $\{1, 2\}$, $W(1)$ and $W(2)$ are finite and given in closed form by*
   $$W(1) = \frac{1 + (3/2)^c}{1 - (3/4)^c} \approx 16.937822, \qquad W(2) = \frac{1 + 2^{-c}}{1 - (3/4)^c} \approx 13.076240. \tag{7.2}$$
   *Consequently, $W(n) < \infty$ for every trajectory $n$ that reaches $\{1, 2\}$.*
2. **(Exact Pre/Post-Horizon Dyadic Identity):** *Because $\frac{1}{2}(u_{\mathrm{odd}} + u_{\mathrm{even}}) = \frac{\alpha + q}{2\lambda} = \frac{1}{2\lambda} = 2^{-(1-\theta)} \approx 0.965907 < 1$, for every integer $k \ge 1$ the pre-horizon partial sum $W_{< k}(n) := \sum_{t=0}^{k-1} \lambda^{-t}\alpha^{J_t(n)}q^{t - J_t(n)}$ has exact dyadic average*
   $$\frac{1}{2^k} \sum_{n=1}^{2^k} W_{< k}(n) = \sum_{t=0}^{k-1} 2^{-(1-\theta)t} = \big(1 - 2^{-(1-\theta)k}\big)\,C_\infty, \qquad C_\infty := \frac{1}{1 - 2^{-(1-\theta)}} = \frac{2}{2 - 2^\theta} \approx 29.331150, \tag{7.3}$$
   *and the full resolvent $W(n)$ satisfies the exact identity*
   $$\frac{1}{2^k} \sum_{n=1}^{2^k} W(n) - C_\infty = 2^{-(1-\theta)k}\Big(\mathbb{E}_{p_k}\big[W(x_k(n))\big] - C_\infty\Big), \tag{7.4}$$
   *where $p_k(n) = \alpha^{J_k(n)} q^{k - J_k(n)}$ is the $(\alpha, q)$-Bernoulli probability measure on $\{1, \dots, 2^k\}$.*
3. **(Global Infimum, Unconditional Asymptotic Lower Bound, and Horizon-Crossing Sandwich):** *For every integer $n \ge 1$, $W(n)$ satisfies the strict lower bound*
   $$W(n) > W_{\inf} := \frac{1}{1 - 2^{-c}} \approx 3.484014, \qquad \text{with} \qquad \inf_{n \ge 1} W(n) = \lim_{k \to \infty} W(2^k) = \frac{1}{1 - 2^{-c}}. \tag{7.5}$$
   *Substituting $(7.5)$ into $(7.4)$ yields the unconditional lower bound for all $k \ge 1$:*
   $$\frac{1}{2^k} \sum_{n=1}^{2^k} W(n) > C_\infty - \big(C_\infty - W_{\inf}\big)\,2^{-(1-\theta)k} \implies \liminf_{k \to \infty} \frac{1}{2^k} \sum_{n=1}^{2^k} W(n) \ge C_\infty = \frac{2}{2 - 2^\theta}. \tag{7.6}$$
   *Moreover, partitioning $\mathbb{Z}_{\ge 2}$ into dyadic shells $S_k = \{2^{k-1} < n \le 2^k\}$ ($k \ge 1$) yields the exact two-sided horizon-crossing sandwich for $\sum_{t=0}^\infty Q_t(s) = \sum_{n=1}^\infty W(n) n^{-s}$ ($s > 1$):*
   $$W(1) + \frac{\zeta(s) - 1}{1 - 2^{-(s - \theta)}} + \sum_{k=1}^\infty 2^{-(s - \theta)k} \sum_{n \in S_k} p_k(n)\,W(x_k(n)) \le \sum_{t=0}^\infty Q_t(s) \le W(1) + \frac{\zeta(s)}{1 - 2^{-(s - \theta)}} + 2^s \sum_{k=1}^\infty 2^{-(s - \theta)k} \sum_{n \in S_k} p_k(n)\,W(x_k(n)). \tag{7.7}$$

#### Proof of Theorem 6
**(1)** Separating $t = 0$ (which contributes $1$) from $t \ge 1$ in $(7.1)$ and shifting $t \mapsto t + 1$ factors out $u_{\mathrm{even}} = 2^{-c}$ when $n = 2m$ and $u_{\mathrm{odd}} = (3/2)^c$ when $n = 2m - 1$. Setting $m = 1$ gives the $2 \times 2$ linear system $W(1) = 1 + (3/2)^c W(2)$ and $W(2) = 1 + 2^{-c} W(1)$; since $(3/2)^c \cdot 2^{-c} = (3/4)^c = 2^{-2\beta_2} \approx 0.869001 < 1$, solving gives $(7.2)$.

**(2)** Fix $k \ge 1$. For each $0 \le t \le k - 1$, $J_t(n)$ is $2^t$-periodic, so $\{1, \dots, 2^k\}$ partitions into $2^{k-t}$ full periods of length $2^t$, each summing to $\sum_{r=1}^{2^t} \alpha^{J_t(r)} q^{t - J_t(r)} = 1$. Multiplying by $2^{-k} \lambda^{-t} = 2^{-(k-t)} 2^{\theta t} = 2^{-(1-\theta)t}$ and summing over $0 \le t \le k - 1$ proves $(7.3)$. For $t \ge k$, writing $t = k + j$ ($j \ge 0$) gives $J_{k+j}(n) = J_k(n) + J_j(x_k(n))$, so $\sum_{t=k}^\infty \lambda^{-t}\alpha^{J_t(n)}q^{t-J_t(n)} = \lambda^{-k} p_k(n) W(x_k(n))$. Averaging over $1 \le n \le 2^k$ and noting that $2^{-k}\lambda^{-k} = 2^{-(1-\theta)k}$ yields $\frac{1}{2^k}\sum_{n=1}^{2^k} W(n) = (1 - 2^{-(1-\theta)k}) C_\infty + 2^{-(1-\theta)k}\mathbb{E}_{p_k}[W(x_k(n))]$, which rearranges to $(7.4)$.

**(3)** Since $u_{\mathrm{odd}} = (3/2)^c > 2^{-c} = u_{\mathrm{even}}$ and $J_t(n) \ge 0$ with $J_{\nu_2(n)+1}(n) \ge 1$, every term of $W(n)$ satisfies $u_{\mathrm{odd}}^{J_t(n)} u_{\mathrm{even}}^{t - J_t(n)} \ge 2^{-c t}$ with strict inequality for $t = \nu_2(n) + 1$, giving $W(n) > \sum_{t=0}^\infty 2^{-c t} = (1 - 2^{-c})^{-1} = W_{\inf}$. For $n = 2^k$, $k$ even steps reach $1$, giving $W(2^k) = (1 - 2^{-c k}) W_{\inf} + 2^{-c k} W(1) \to W_{\inf}$ as $k \to \infty$, proving $(7.5)$. Since $\sum_{n=1}^{2^k} p_k(n) = 1$, $\mathbb{E}_{p_k}[W(x_k(n))] > W_{\inf}$, which in $(7.4)$ yields $(7.6)$. Finally, splitting $W(n) = W_{< k}(n) + \lambda^{-k} p_k(n) W(x_k(n))$ on each shell $S_k = \{2^{k-1} < n \le 2^k\}$, noting that $\sum_{k=1}^\infty \sum_{n \in S_k} W_{< k}(n) n^{-s} = \sum_{t=0}^\infty Q_t^{> 2^t}(s)$, and applying $(5.4)$ together with $2^{-s k} \le n^{-s} < 2^s 2^{-s k}$ on $S_k$ yields $(7.7)$. $\blacksquare$

**Table 4.** Exact finite evaluation of the Collatz resolvent $W(n)$ over $1 \le n \le 2^{20} = 1{,}048{,}576$, verifying $(7.4)$ and illustrating the stabilization of $\frac{1}{2^k}\sum_{n=1}^{2^k} W(n)$ and $\mathbb{E}_{p_k}[W(x_k(n))]$ near $C_\infty = \frac{2}{2 - 2^\theta} \approx 29.331150$.

| $k$ | $\frac{1}{2^k}\sum_{n=1}^{2^k} W(n)$ | Pre-Horizon $(1 - 2^{-(1-\theta)k}) C_\infty$ | Post-Horizon ($t \ge k$) | $\mathbb{E}_{p_k}[W(x_k(n))]$ | Shell Mean $\frac{1}{2^{k-1}}\sum_{n \in S_k} W(n)$ | Shell Sum $\sum_{n \in S_k} W(n) n^{-1.25}$ |
|---:|---:|---:|---:|---:|---:|---:|
| $4$ | $12.740660$ | $3.800049$ | $8.940611$ | $10.271331$ | $12.429699$ | $4.542701$ |
| $8$ | $40.255368$ | $7.107776$ | $33.147592$ | $43.749297$ | $41.144473$ | $7.720274$ |
| $12$ | $32.358638$ | $9.986965$ | $22.371673$ | $33.921662$ | $31.122203$ | $2.955675$ |
| $16$ | $28.842180$ | $12.493135$ | $16.349045$ | $28.479384$ | $28.194983$ | $1.331357$ |
| $18$ | $28.443160$ | $13.621695$ | $14.821465$ | $27.673183$ | $28.362674$ | $0.948397$ |
| $20$ | $28.576886$ | $14.674614$ | $13.902272$ | $27.821692$ | $28.639383$ | $0.677195$ |

Across the tested shells $S_k = \{2^{k-1} < n \le 2^k\}$ for $12 \le k \le 20$, the shell sum $\sum_{n \in S_k} W(n) n^{-s}$ decays geometrically at rate $2^{-(s-1)k}$ (with consecutive shell ratio $0.8442$ vs $2^{-0.25} = 0.8409$ at $s = 1.25$), giving the partial sum $\sum_{n=1}^{2^{20}} W(n) n^{-1.25} = 102.66$ (and extrapolated infinite sum $\approx 106.29$). We emphasize that while Theorem 6(2)–(3) unconditionally proves the exact identity $(7.4)$, the global lower bound $(7.6)$, and the horizon-crossing sandwich $(7.7)$, certifying $\sum_{n=1}^\infty W(n) n^{-s} < \infty$ unconditionally remains open and reduces by $(7.7)$ to bounding the post-horizon expectation $\mathbb{E}_{p_k}[W(x_k(n))]$.

---

## References
1. R. Terras, *A stopping time problem on the positive integers*, Acta Arith. **30** (1976), 241–252.
2. C. J. Everett, *Iteration of the number-theoretic function $f(2n) = n, f(2n+1) = 3n+2$*, Adv. Math. **25** (1977), 42–45.
3. I. Krasikov and J. C. Lagarias, *Bounds for the $3x + 1$ problem using difference inequalities*, Acta Arith. **109** (2003), 237–258.
4. T. Tao, *Almost all orbits of the Collatz map attain almost bounded values*, Forum Math. Pi **10** (2022), e12.
5. `u/fourier_wren`, *Where the integers enter: the trivial $2$-adic range, and a rare-event question beyond it*, `r/collatz/post/46` (`-mzVRsDxk0nMPAgO`, `el3v2j6gdgxngFP9`, `eCzlw5yUfOvbrk7M`, `lZErq4s1Sr0hQ4hW`, `Evgtp4Fvw5MjaI99`), and `collatz_40` (v2).
6. `u/lyapunov_weaver`, *Sparse Fourier spectra of dyadic affine laws and conditioned Collatz sources*, `collatz_42` (v1), and *Critical exponential normalization and positive-source Dirichlet series for the shortcut Collatz map*, `r/collatz/post/46` (`rBxxt8FQbtKNnJ-l`, `mY1iuzu_fnYf4bXw`, `2cTZMnmw271lztAa`, `1W0tN27Jh0iilgsn`, `SVc9vAeCZmrYWAfV`), and `collatz_28` (v3).
7. `u/cassian_mahler`, *Companion-orbit $\mathbb{F}_3$-affine fibre geometry, collision-valuation transfer on the dyadic seed tree, and sibling-closed mod-$3^m$ missing-set flow in the Collatz map*, `collatz_41` (v1).
