\documentclass[11pt,leqno]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage[letterpaper,textwidth=6in,textheight=9in,centering]{geometry} \usepackage{amsmath,amssymb,mathtools} \usepackage{mathrsfs} \usepackage{microtype} \usepackage{xcolor} \usepackage{hyperref} \hypersetup{colorlinks=true,linkcolor=blue!55!black,citecolor=blue!55!black, urlcolor=blue!55!black,pdftitle={Two smooth summands for every large integer}, pdfauthor={Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer}} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \numberwithin{equation}{section} \newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\R}{\mathbb R} \newcommand{\C}{\mathbb C} \newcommand{\E}{\mathbb E} \newcommand{\PP}{\mathcal P} \newcommand{\SSS}{\mathcal S} \newcommand{\BB}{\mathcal B} \newcommand{\ind}{\mathbf 1} \newcommand{\ee}[1]{e\!\left(#1\right)} \newcommand{\norm}[1]{\left\lVert#1\right\rVert} \newcommand{\abs}[1]{\left\lvert#1\right\rvert} \newcommand{\ip}[2]{\left\langle#1,#2\right\rangle} \newcommand{\lcmop}{\operatorname{lcm}} \DeclareMathOperator{\Var}{Var} \allowdisplaybreaks[2] \setlength{\emergencystretch}{1.5em} \title[Two smooth summands]{Two smooth summands for every large integer} \author[W. Howe, G. Huffman, J. Kohlmeyer, and L. Kruer]{Will Howe, Grant Huffman, Jensen Kohlmeyer, and Liam Kruer} \date{November 13, 2026} \subjclass[2020]{11N25, 11P32} \keywords{Smooth numbers, additive representations, Dirichlet $L$-functions, dilation graphs} \thanks{All authors contributed equally.} \thanks{\raggedright Electronic addresses. \mbox{\href{mailto:howew@purdue.edu}{\texttt{howew@purdue.edu}} (W.~Howe)}, \mbox{\href{mailto:huffma97@purdue.edu}{\texttt{huffma97@purdue.edu}} (G.~Huffman)}, \mbox{\href{mailto:jenwin@purdue.edu}{\texttt{jenwin@purdue.edu}} (J.~Kohlmeyer)}, and \mbox{\href{mailto:kruerl@purdue.edu}{\texttt{kruerl@purdue.edu}} (L.~Kruer)}.} \begin{document} \begin{abstract} For every $\varepsilon>0$, every sufficiently large integer $N$ is a sum of two positive integers all of whose prime factors are at most $N^\varepsilon$. We prove this smooth-summand conjecture of Erd\H{o}s using weighted dilation graphs, a uniform character-energy estimate and a positive marked principal term. \end{abstract} \maketitle \section{The smooth-summand theorem}\label{sec:main-statement} Erd\H{o}s asked whether every sufficiently large integer is a sum of two positive integers whose prime factors are smaller than any prescribed fixed power of that integer \cite[p.~272]{erdos}. We prove the following form of this conjecture. \begin{theorem}\label{thm:main} For every $\varepsilon>0$ there is an integer $N_0(\varepsilon)$ such that every integer $N\ge N_0(\varepsilon)$ admits positive integers $a,b$ with \[ N=a+b,\qquad p\mid ab\Longrightarrow p\le N^\varepsilon \quad\text{for every prime }p. \] \end{theorem} For every fixed $\alpha>0$, applying the theorem with $\varepsilon=1/(2\alpha)$ gives the strict bound $p1$. This is the original formulation. The threshold formulation in \cite[p.~55]{erdos82} and the uniform formulation in \cite[Problem~59]{green} are equivalent by absorbing the finitely many initial targets into the smoothness threshold. The proof uses the uniform Dirichlet zero-free half-plane theorem of OpenAI \cite{qrh} and the weighted-dilation methods developed in \cite{graphs}. The reflected shift in the argument is the target $-N$. The prime-sum estimates, graph moment estimate and character-energy estimates below retain uniformity in this shift and in the corresponding moduli. Throughout, a threshold may depend on fixed parameters chosen earlier in the argument. Every assertion of uniformity specifies the data allowed to vary after that threshold. We write $L=\log N$ when the target $N$ is fixed. \section{Reduction to rough targets}\label{sec:rough-reduction} For a positive integer $a>1$, let $P^+(a)$ denote its largest prime factor, and put $P^+(1)=1$. A positive integer is $y$-smooth if all its prime divisors are at most $y$, and is $y$-rough if all its prime divisors are greater than $y$. The integer $1$ satisfies both conditions. \begin{lemma}\label{lem:smooth-target-split} Let $y\ge1$. Every $y$-smooth integer $N\ge2$ is a sum of two positive $y$-smooth integers. \end{lemma} \begin{proof} Choose a prime divisor $p$ of $N$ and write $a=N/p$. Then \[ N=a+(p-1)a. \] Both summands are positive. Every prime divisor of $a$ divides $N$, and every prime divisor of $p-1$ is at most $p-10$, every sufficiently large integer $N$ is the sum of two positive $N^\varepsilon$-smooth integers. \end{lemma} \begin{proof} Fix $\varepsilon>0$ and set \[ \eta=\min\{\varepsilon/2,1/8\}. \] Then $0<\eta<1/4$ and $\eta\le\varepsilon$. Take $N\ge2$ sufficiently large that $N^\eta\ge R_0(\eta)$. Separate the prime factors of $N$ at $N^\eta$, with multiplicity, by writing \[ d=\prod_{p\le N^\eta}p^{v_p(N)},\qquad r=N/d. \] Here $d$ is $N^\eta$-smooth, while every prime divisor of $r$ exceeds $N^\eta$. If $r=1$, then $N=d$ is $N^\eta$-smooth and Lemma~\ref{lem:smooth-target-split} gives the required representation. If $r>1$, choose a prime divisor $p$ of $r$. We have \[ r\ge p>N^\eta\ge R_0(\eta). \] Moreover, $r\le N$, so each prime divisor of $r$ exceeds $N^\eta\ge r^\eta$. The hypothesis therefore gives positive integers $u,v$ with $r=u+v$ and $P^+(uv)\le r^\eta$. Consequently \[ N=du+dv. \] Every prime divisor of either summand divides $d$, $u$, or $v$, and is therefore at most $N^\eta\le N^\varepsilon$. This proves the claim. \end{proof} \section{Prime-sum estimates} \label{ai:section} Write $e(t)=\exp(2\pi i t)$. Dirichlet characters are extended to all integers by zero on the nonunits of their modulus. The principal character modulo $q$ is denoted by $\chi_0$. Every prime sum below contains all primes in its displayed interval, with the lower endpoint excluded and the upper endpoint included. All absolute constants may be increased from one occurrence to the next. \subsection{The classical prime number theorem with a smooth weight} Let $\Lambda$ be the von Mangoldt function, and put \[ \psi(x)=\sum_{n\le x}\Lambda(n),\qquad \vartheta(x)=\sum_{p\le x}\log p. \] The classical prime number theorem gives absolute constants $C,c>0$ such that, for sufficiently large $x$, \begin{equation}\label{ai:strong-pnt} |\psi(x)-x|\le Cx\exp(-c\sqrt{\log x}). \end{equation} We use this form of the theorem from \cite{davenport}. The same estimate holds with $\vartheta$ in place of $\psi$. Indeed, Chebyshev's upper bound $\vartheta(t)\ll t$ gives \[ 0\le\psi(x)-\vartheta(x) =\sum_{k\ge2}\vartheta(x^{1/k})\ll\sqrt x. \] Here the terms with $k\ge3$ are $O(x^{1/3}\log(2x))$, which are $O(\sqrt x)$, and $\sqrt x\le x\exp(-c\sqrt{\log x})$ once $x$ is sufficiently large. Thus, after increasing $C$, \begin{equation}\label{ai:theta-error} |\vartheta(x)-x|\le Cx\exp(-c\sqrt{\log x}). \end{equation} \begin{lemma}[Weighted prime replacement]\label{ai:weighted-pnt} There are absolute constants $C,c>0$ and $a_0\ge e$ such that the following holds. Let $a_0\le a\le b$, let $W\colon[a,b]\to\C$ be continuously differentiable, and suppose $M\ge0$ and $|W(t)|\le M$ on $[a,b]$. Then \begin{align} \left|\sum_{a1$, use the normalization \[ L(s,\chi)=\sum_{n\ge1}\frac{\chi(n)}{n^s}. \] The following zero-free theorem is due to OpenAI. \begin{theorem}[OpenAI, \cite{qrh}, Theorem 1.1]\label{ai:zero-free} For every positive modulus $q$ and every Dirichlet character $\chi$ modulo $q$, the continued function $L(s,\chi)$ has no zero in $\operatorname{Re}s>7/8$. For the principal character its pole at $s=1$ is excluded from this assertion. \end{theorem} For a nonprincipal character put \[ \mathcal H(q,\tau)=1+\log\bigl((q+2)(|\tau|+3)\bigr). \] \begin{lemma}[Logarithmic derivative]\label{ai:log-derivative} Uniformly over all positive moduli, nonprincipal characters, and complex $s$ with $22/25\le\operatorname{Re}s\le2$, \begin{equation}\label{ai:log-derivative-bound} \left|\frac{L'}{L}(s,\chi)\right| \ll\mathcal H(q,\operatorname{Im}s). \end{equation} \end{lemma} \begin{proof} The character sum over one complete period is zero. Hence $A_\chi(x)=\sum_{n\le x}\chi(n)$ satisfies $|A_\chi(x)|\le q+1$. Partial summation, followed by analytic continuation from $\operatorname{Re}s>1$, gives \[ L(s,\chi)=s\int_1^\infty A_\chi(t)t^{-s-1}\,dt \qquad(\operatorname{Re}s>0). \] In particular, \begin{equation}\label{ai:L-growth} |L(s,\chi)|\le2(q+1)|s| \qquad(\operatorname{Re}s\ge1/2). \end{equation} Fix $t\in\R$ and center a disk at $z_t=2+it$. Let \[ R_0=\frac98-\frac2{1600},\qquad R_1=\frac98-\frac3{1600},\qquad R_2=\frac98-\frac8{1600}=\frac{28}{25}. \] The disk of radius $R_0$ lies in the half-plane in Theorem~\ref{ai:zero-free}. It therefore has a holomorphic logarithm $G$ of $L(s,\chi)$. Normalize it at $z_t$ using the absolutely convergent Euler logarithm \[ G(z_t)=\sum_p\sum_{k\ge1}\frac{\chi(p)^k}{k p^{kz_t}}. \] Its absolute value is bounded by $\log\zeta(2)$, independently of $q,t$. On the disk of radius $R_1$, \eqref{ai:L-growth} gives \[ \operatorname{Re}G(s)=\log|L(s,\chi)| \le\log\bigl(4(q+2)(|t|+3)\bigr). \] Borel--Carath\'eodory on concentric intermediate disks and Cauchy's estimate for the derivative now give \[ |G'(s)|\ll 1+\log\bigl((q+2)(|t|+3)\bigr) \qquad(|s-z_t|\le R_2). \] All radius gaps are positive absolute constants. The real segment $22/25\le\operatorname{Re}s\le2$, $\operatorname{Im}s=t$, lies in this last disk, and $G'=L'/L$. This proves the lemma. \end{proof} \subsection{Twisted prime sums} \begin{lemma}[Smoothed and sharp twisted sums]\label{ai:twisted-prefix} Let $q\ge1$, $\chi\ne\chi_0$ modulo $q$, and $\tau\in\R$. For $x\ge1$, \begin{equation}\label{ai:triangular-bound} \left|\sum_{n\le x}\Lambda(n)\chi(n)n^{i\tau} \left(1-\frac nx\right)\right| \ll\mathcal H(q,\tau)x^{63/64}. \end{equation} For $x\ge2$, \begin{equation}\label{ai:prime-log-bound} \left|\sum_{p\le x}\chi(p)p^{i\tau}\log p\right| \ll\mathcal H(q,\tau)x^{255/256}. \end{equation} Both constants are absolute. \end{lemma} \begin{proof} Write $a_n=\Lambda(n)\chi(n)n^{i\tau}$ and $T(x)=\sum_{n\le x}a_n(1-n/x)$. For $\operatorname{Re}s>1$ the logarithmic derivative of the Euler product gives \[ \sum_{n\ge1}\frac{a_n}{n^s} =-\frac{L'}{L}(s-i\tau,\chi). \] The triangular Perron kernel gives the absolutely convergent identity \begin{equation}\label{ai:triangular-perron} T(x)=\frac1{2\pi i}\int_{3/2-i\infty}^{3/2+i\infty} -\frac{L'}{L}(s-i\tau,\chi) \frac{x^s}{s(s+1)}\,ds. \end{equation} Indeed, the inverse integral for a single term is $(1-n/x)_+$. Its value at $n=x$ is zero. Absolute convergence of the Dirichlet series on the line $\operatorname{Re}s=3/2$ justifies termwise integration. Move the line in \eqref{ai:triangular-perron} to $\sigma_0=63/64$. Theorem~\ref{ai:zero-free} and $\chi\ne\chi_0$ make the integrand holomorphic throughout the intervening strip. Lemma~\ref{ai:log-derivative} and \[ \mathcal H(q,t-\tau) \le\mathcal H(q,\tau)+\log(1+|t|) \] give the uniform majorant \[ \left|-\frac{L'}{L}(\sigma+it-i\tau,\chi) \frac{x^{\sigma+it}}{(\sigma+it)(\sigma+1+it)}\right| \ll x^{3/2}\frac{\mathcal H(q,\tau)+\log(1+|t|)}{1+t^2} \quad(\sigma_0\le\sigma\le3/2). \] The horizontal integrals tend to zero and both vertical integrals converge absolutely. On the new line, replace $x^{3/2}$ in this majorant by $x^{63/64}$. Its integral is $O(\mathcal H(q,\tau)x^{63/64})$, proving \eqref{ai:triangular-bound}. To remove the triangular weight, set $h=\lceil x^{127/128}\rceil$. The exact identity \[ \frac{(x+h)T(x+h)-xT(x)}h =\sum_{n\le x}a_n+ \sum_{x0$ such that, for every positive integer $q$, every nonprincipal character $\chi$ modulo $q$, every $\tau\in\R$, and all real $2\le a\le b$, \begin{equation}\label{ai:reciprocal-bound} \left|\sum_{a0$. For all sufficiently large $L$, uniformly for \[ q\le e^{2L},\qquad |\tau|\le e^{3L},\qquad e^{L^\kappa}\le a\le b,\qquad \chi\ne\chi_0\pmod q, \] one has \begin{equation}\label{ai:exponential-prime-saving} \left|\sum_{a0$, the bound in \eqref{ai:reciprocal-bound} is at most $L^{-A}$ when $q\le L^{D_1}$, $|\tau|\le L^{D_2}$ and $a\ge e^{L^\kappa}$, once the threshold in $L$ is increased. \end{corollary} \begin{proof} For $L\ge1$ in the stated range, $\mathcal H(q,\tau)\le C(1+L)$. Hence \[ C\mathcal H(q,\tau)a^{-1/256} \le C'(1+L)\exp(-L^\kappa/256) \le\exp(-L^\kappa/512) \] for sufficiently large $L$. This proves \eqref{ai:exponential-prime-saving} uniformly in both endpoints. Put $B(t)=\sum_{a0$, $R>0$, $j\in\Z$, and $2\le a_g\le b_g$. Freezing positive prime labels with product $R$ in a logarithmic cell restricts the remaining prime to the interval \[ \left(\max\{a_g,e^{(j-1)h}/R\}, \min\{b_g,e^{jh}/R\}\right]. \] If this interval is empty, its sum is zero. Otherwise its lower endpoint is at least $a_g$, so Lemma~\ref{lem:twisted-primes} gives the bound with $a_g^{-1/256}$. Its constant and threshold are uniform in $j$ and $R$. For two distinct primitive characters of conductor at most $Q_0$, their quotient on the least common multiple of the conductors is nonprincipal and has modulus at most $Q_0^2$. Thus the last assertion of Corollary~\ref{ai:twisted-ranges} supplies the off-diagonal cell estimates when $Q_0$ is bounded by a fixed power of $L$. The large-modulus estimates \eqref{ai:exponential-prime-saving}--\eqref{ai:ordinary-prime-saving} also give the uniform input for the reciprocal character energy in Section~\ref{ce:section}. \section{The invariant center and principal cancellation} \label{pc:section} Throughout this section, $0<\varepsilon<1/4$ and $0Q}p^{v_p(n)},\qquad n=n^\flat n^\sharp. \] Thus $n^\flat$ is $Q$-smooth and every prime divisor of $n^\sharp$ exceeds $Q$. We use the convention $P^+(1)=1$. Write \[ h_0(n)=\ind_{n=n^\sharp},\qquad f_y(n)=\ind_{P^+(n)\le y},\qquad b_0(a)=\mu(a)\ind_{P^+(a)\le Q}. \] The function $b_0$ is supported on the divisors of the product of the primes at most $Q$. In particular, \begin{equation}\label{pc:sieve-identities} h_0(n)=\sum_{a\mid n}b_0(a),\qquad D_Q=\sum_{a\ge1}\frac{b_0(a)}a. \end{equation} \subsection{Rough integers and reciprocal tails} \begin{lemma}\label{pc:rough-count} For every fixed $A>0$, \begin{equation}\label{pc:smooth-tail} \sum_{\substack{a>D_*\\P^+(a)\le Q}}\frac1a\ll_A L^{-A}. \end{equation} If $R_Q(x)=\sum_{1\le n\le x}h_0(n)$, then, for $x\ge0$, \begin{equation}\label{pc:rough-discrepancy} |R_Q(x)-D_Qx| \le \lceil D_*\rceil+1+ x\sum_{\substack{a>D_*\\P^+(a)\le Q}}\frac1a. \end{equation} Consequently, for every fixed $\alpha>0$ and $A>0$, \begin{equation}\label{pc:relative-discrepancy} \sup_{0\le x\le X}|R_Q(x)-D_Qx|\ll_{A,\alpha} XL^{-A} \qquad\bigl(X\ge e^{\alpha L}\bigr). \end{equation} Furthermore, \begin{equation}\label{pc:harmonic-rough} H_Q(X):=\sum_{1\le m\le X}\frac{h_0(m)}m =D_Q\log X+O\bigl(L^{d_0}(\log L)^2\bigr) \qquad(1\le X\le e^{2L}). \end{equation} \end{lemma} \begin{proof} Set $\delta=1/\log Q=L^{-d_0}$. Rankin's inequality gives \[ \sum_{\substack{a>D_*\\P^+(a)\le Q}}\frac1a \le D_*^{-\delta}\prod_{p\le Q}(1-p^{-1+\delta})^{-1}. \] The shifted product is $O(\log Q)$. To see this, compare its logarithm with that of $\prod_{p\le Q}(1-p^{-1})^{-1}$. The terms of degree one are bounded by \[ \sum_{p\le Q}\frac{p^\delta-1}{p} \le e\delta\sum_{p\le Q}\frac{\log p}{p}\ll1, \] since $0\le\delta\log p\le1$. For large $N$, $\delta\le1/4$, and the terms of degree at least two are bounded by a convergent series, uniformly in $Q$. Mertens' formula therefore proves the assertion about the product. As $D_*^{-\delta}=\exp(- (\log L)^2)$, this proves \eqref{pc:smooth-tail}. We also obtain \begin{equation}\label{pc:euler-mass} D_Q^{-1}\asymp\log Q=L^{d_0},\qquad \sum_{P^+(a)\le Q}\frac1a=D_Q^{-1}. \end{equation} For an integer $j\ge0$, \eqref{pc:sieve-identities} gives \[ R_Q(j)-D_Qj =\sum_{a\ge1}b_0(a)\bigl(\lfloor j/a\rfloor-j/a\bigr). \] For $a\le D_*$ bound each rounding error by one. There are at most $\lceil D_*\rceil$ such positive integers. For $a>D_*$ use $|\lfloor j/a\rfloor-j/a|\le j/a$, and then enlarge the absolute coefficient sum to the sum over all $Q$-smooth integers. Replacing $j$ by $\lfloor x\rfloor$ costs at most $D_Q\le1$. This proves \eqref{pc:rough-discrepancy}. Since $\log D_*=o(L)$, the quantity $D_*+2$ is smaller than $e^{\alpha L}L^{-A}$ for every fixed $\alpha,A>0$ and sufficiently large $N$. Increasing the accuracy in \eqref{pc:smooth-tail} proves \eqref{pc:relative-discrepancy}. Partial summation gives, for $X\ge1$, \[ H_Q(X)=\frac{R_Q(X)}X+\int_1^X\frac{R_Q(t)}{t^2}\,dt. \] Here $0\le R_Q(t)\le t$ and $00). \end{equation} Indeed, set $t_k=u-\sum_{j0$ define \begin{equation}\label{pc:exact-density} g_0(x)=D_Q+ \sum_{k\ge1}\frac{(-1)^k}{k!\log y} \sum_{m\ge1}\frac{h_0(m)}m A_k\!\left(\frac{\log(x/m)}{\log y}\right). \end{equation} Both sums are locally finite. A nonzero summand requires $y^km\le x$. Thus $g_0$ is right-continuous at every positive point, with the value in \eqref{pc:A-one} retained when $x=my$. \begin{lemma}\label{pc:model-properties} Uniformly on $e^{L/2}\le x\le e^{2L}$, \begin{equation}\label{pc:dickman-approximation} \frac{g_0(x)}{D_Q} =\rho\!\left(\frac{\log x}{\log y}\right) +O_{\varepsilon,d_0}\bigl(L^{2d_0-1}(\log L)^2\bigr), \end{equation} where $\rho$ is the Dickman function. Moreover, \begin{equation}\label{pc:model-variation} \Var_{[e^{L/2},e^{2L}]}(g_0/D_Q)\ll_{\varepsilon,d_0}1. \end{equation} For sufficiently large $N$, $g_0(x)/D_Q$ lies in $[0,1]$ throughout this interval. \end{lemma} \begin{proof} Put $\ell=\log y$ and $U=2/\varepsilon$, and choose a fixed integer $K>U$. The bounded-variation norms of $A_1,\ldots,A_K$ on $(-\infty,U]$ are constants depending only on $\varepsilon$. Write $E_Q=C L^{d_0}(\log L)^2$, increasing $C$ so that $E_Q\ge1$ and the error in \eqref{pc:harmonic-rough} is at most $E_Q$. Apply Stieltjes partial summation to the harmonic cumulative function $H_Q(t)$ and the kernel $A_k(u-\log t/\ell)$, where $u=\log x/\ell\le U$. Its support in $t\ge1$ is bounded by $x$, and its supremum and variation are bounded in terms of $\varepsilon$. Replacing $H_Q(t)$ by $D_Q\log t$ therefore gives \begin{equation}\label{pc:harmonic-kernel} \sum_{m\ge1}\frac{h_0(m)}m A_k\!\left(u-\frac{\log m}{\ell}\right) =D_Q\int_1^\infty A_k\!\left(u-\frac{\log t}{\ell}\right)\frac{dt}{t} +O_\varepsilon(E_Q) =D_Q\ell I_k(u)+O_\varepsilon(E_Q). \end{equation} For continuous bounded-variation kernels the error bound follows directly by integrating the discrepancy in \eqref{pc:harmonic-rough}. For $k=1$, put $Y=x/y$ and $s(t)=(u-\log t/\ell)^{-1}$ on $[1,Y]$. The sum terminates at $Y$, with that endpoint included. Writing $E(t)=H_Q(t)-D_Q\log t$, ordinary partial summation gives its error as \[ E(Y)s(Y)-\int_1^Y E(t)s'(t)\,dt. \] Here $s(Y)=1$, $s$ is increasing, and $\int_1^Y s'(t)\,dt\le1$, so the error is at most $2E_Q$. This calculation retains the displayed value of $A_1$ at an integer endpoint. In the range under consideration $Y>1$. Substitution into \eqref{pc:exact-density} gives \[ \frac{g_0(x)}{D_Q} =\sum_{k\ge0}\frac{(-1)^k}{k!}I_k(u) +O_\varepsilon\!\left(\frac{E_Q}{D_Q\ell}\right). \] Denote the finite sum by $\sigma(u)$. It is one on $[0,1]$, and \eqref{pc:simplex-recurrence} gives \[ u\sigma'(u) =\sum_{k\ge1}\frac{(-1)^k}{(k-1)!}I_{k-1}(u-1) =-\sigma(u-1)\qquad(u>1). \] Successive integration on the intervals $[j,j+1]$ identifies $\sigma$ with the Dickman function $\rho$. Together with \eqref{pc:euler-mass}, this proves \eqref{pc:dickman-approximation}. For the variation assertion, use the finite expression in \eqref{pc:exact-density} on the whole interval under consideration. The variation of each composition of $A_k$ with $\log(x/m)/\ell$ is at most the variation of $A_k$ on $(-\infty,U]$. All coefficients in the absolute variation bound are nonnegative. Consequently, \[ \Var_{[e^{L/2},e^{2L}]}(g_0/D_Q) \le \frac{H_Q(e^{2L})}{D_Q\ell} \sum_{k=1}^{K}\frac{\Var_{(-\infty,U]}A_k}{k!} \ll_\varepsilon 1+\frac{E_Q}{D_Q\ell} \ll_{\varepsilon,d_0}1. \] Finally, $u\in[1/(2\varepsilon),2/\varepsilon]$, a fixed compact subinterval of $(1,\infty)$. The Dickman function is continuous, positive and strictly below one on this interval. Its delay equation gives $u\rho(u)=\int_{u-1}^{u}\rho(t)\,dt$ for $u>1$. The two sides agree at $u=1$ and have equal derivatives for $u>1$. A first zero would contradict this identity, since $\rho=1$ on $[0,1]$ and the integral at that zero would be positive. The delay equation then shows that $\rho$ is strictly decreasing on $(1,\infty)$. Since $2d_0-1<0$, the error in \eqref{pc:dickman-approximation} tends to zero. The final assertion follows. \end{proof} Define the bounded extension \begin{equation}\label{pc:model-extension} \mathcal M(x)= \begin{cases} g_0(x)/D_Q,& e^{L/2}\le x\le e^{2L},\\ \rho(1/\varepsilon),&\text{otherwise}, \end{cases} \qquad F(n)=f_y(n^\sharp)-\mathcal M(n^\sharp)\quad(n\ge1). \end{equation} For large $N$, $|F(n)|\le1$. Unique smooth--rough factorization gives \begin{equation}\label{pc:invariance} F(an)=F(n)\qquad\bigl(a\text{ is }Q\text{-smooth},\ n\ge1\bigr). \end{equation} Also $f_y(n^\sharp)=f_y(n)$ once $Q\le y$. \subsection{Right-continuous Stieltjes comparison} \begin{lemma}\label{pc:stieltjes} Let $X>0$, and let $v\colon\R\to\C$ be right-continuous, of bounded variation, and compactly supported in $(0,X)$. Then \begin{equation}\label{pc:stieltjes-bound} \begin{gathered} \left|\sum_{1\le n\le X}h_0(n)v(n)-D_Q\int_0^Xv(x)\,dx\right| \le \Delta_Q(X)\bigl(2\|v\|_\infty+\Var_{\R}v\bigr),\\ \Delta_Q(X)=\sup_{0\le x\le X}|R_Q(x)-D_Qx|. \end{gathered} \end{equation} The sum uses the specified right-continuous values of $v$ at all atoms. \end{lemma} \begin{proof} Define \[ \begin{gathered} R_{Q,X}(t)=\sum_{1\le n\le X}h_0(n)\ind_{n\le t},\qquad c_X(t)=\max(0,\min(X,t)),\\ E(t)=R_{Q,X}(t)-D_Qc_X(t). \end{gathered} \] The function $E$ is right-continuous and of bounded variation on $\R$. It vanishes below zero, is constant above $X$, and satisfies $\sup_{t\in\R}|E(t)|\le\Delta_Q(X)$. Its Stieltjes measure is \[ dE=\sum_{1\le n\le X}h_0(n)\delta_n -D_Q\ind_{(0,X)}(t)\,dt. \] For two right-continuous bounded-variation functions, the product rule on a closed interval gives \begin{equation}\label{pc:right-ibp} \int_{[a,b]}v(t)\,dE(t) =v(b)E(b)-v(a-)E(a-)-\int_{[a,b]}E(t-)\,dv(t). \end{equation} At a jump, the identity is $\Delta(vE)=v\,\Delta E+E_-\,\Delta v$, which verifies the one-sided conventions in \eqref{pc:right-ibp}. Both endpoint terms are included. The left limits of $E$ have modulus at most $\Delta_Q(X)$ as well. Taking absolute values in \eqref{pc:right-ibp} proves \eqref{pc:stieltjes-bound}. For the stated support one can choose endpoints where both boundary values of $v$ vanish. The atomic integral is exactly the sum of $h_0(n)v(n)$, including every threshold atom. \end{proof} Fix a support constant $C\ge1$. We use complex $C^1$ test functions on $\R$ satisfying \begin{equation}\label{pc:test-bounds} \operatorname{supp}w\subset[Z/C,CZ],\qquad \|w\|_\infty\le L^B,\qquad \int_{\R}|w'(x)|\,dx\le L^B, \end{equation} where $B\ge0$ is fixed. In particular $\Var_{\R}w\le L^B$. All such tests are allowed to depend on $N$ and $Z$. \begin{lemma}\label{pc:model-test} For every fixed $A>0$ and $B\ge0$, uniformly over \eqref{pc:test-bounds} and \begin{equation}\label{pc:inner-band} e^{5L/8}\le Z\le e^{11L/8}, \end{equation} one has \begin{equation}\label{pc:model-test-equation} \sum_{n\ge1}h_0(n)\mathcal M(n)w(n) =\int_0^\infty g_0(x)w(x)\,dx+O_{A,B,C,\varepsilon,d_0}(ZL^{-A}). \end{equation} \end{lemma} \begin{proof} For large $N$, $[Z/C,CZ]$ lies strictly inside $[e^{L/2},e^{2L}]$. Extend $g_0/D_Q$ from this latter interval by its left endpoint value on the left and its right endpoint value on the right. Call the resulting function $\widetilde{\mathcal M}$. It is right-continuous, bounded by one in modulus, and has uniformly bounded total variation by Lemma~\ref{pc:model-properties}. The function $v=\widetilde{\mathcal M}w$ is right-continuous and satisfies \[ \|v\|_\infty\le L^B,\qquad \Var_{\R}v\le \|w\|_\infty\Var_{\R}\widetilde{\mathcal M} +\|\widetilde{\mathcal M}\|_\infty\Var_{\R}w \ll_{\varepsilon,d_0}L^B. \] It agrees with $\mathcal M w$ everywhere. Take $X=\lceil2CZ\rceil$. Then $X\asymp_C Z$, the support of $v$ lies inside $(0,X)$, and $X\ge e^{L/2}$ for large $N$. Apply Lemma~\ref{pc:stieltjes} and \eqref{pc:relative-discrepancy}, choosing its accuracy after $A$ and $B$. On the support of $w$ the identity $D_Q\mathcal M=g_0$ is exact, giving \eqref{pc:model-test-equation}. \end{proof} \subsection{The uncentered prime expansion} \begin{lemma}\label{pc:uncentered-test} Under \eqref{pc:test-bounds} and \eqref{pc:inner-band}, for every fixed $A>0$, \begin{equation}\label{pc:uncentered-test-equation} \sum_{n\ge1}h_0(n)f_y(n)w(n) =\int_0^\infty g_0(x)w(x)\,dx+O_{A,B,C,\varepsilon,d_0}(ZL^{-A}). \end{equation} \end{lemma} \begin{proof} Put $X=\lceil2CZ\rceil$ and fix an integer $K>2/\varepsilon$. For large $N$, $y\le X\le e^{2L}$ and $Q\le y$. An integer at most $X$ has at most $K$ distinct prime divisors greater than $y$. Finite inclusion--exclusion therefore gives \begin{equation}\label{pc:prime-ie} \sum_n h_0(n)f_y(n)w(n) =\sum_{k=0}^{K}\frac{(-1)^k}{k!} \sum_{\substack{y0$ is absolute. To obtain this form, write $E_\pi(t)=\pi(t)-\int_2^t ds/\log s$. The prime number theorem gives $E_\pi(t)\ll t\exp(-c\sqrt{\log t})$ for $t\ge2$, and partial summation gives the exact identity \[ \sum_{ay}w(mp_1\cdots p_k) \prod_{j=1}^k\frac{dp_j}{\log p_j} =\frac1{m\ell}\int_0^\infty A_k\!\left(\frac{\log(x/m)}\ell\right)w(x)\,dx. \end{equation} The boundary hyperplanes have zero Lebesgue measure. The factor $1/k!$ continues to come from the ordered inclusion--exclusion expansion in \eqref{pc:prime-ie}. Every contributing residual satisfies $m\le X$. All $k$ and $m$ sums meeting the compact support are therefore finite, so they may be interchanged with the final integral. The term $k=0$ is $D_Q\int w+O_A(XL^{-A})$ by Lemma~\ref{pc:stieltjes}, applied to $v=w$. Combining these facts with \eqref{pc:exact-density} proves \eqref{pc:uncentered-test-equation}. \end{proof} Subtracting Lemma~\ref{pc:model-test} from Lemma~\ref{pc:uncentered-test} gives the following rough-integer estimate. \begin{corollary}\label{pc:rough-cancellation} For every fixed $A>0$, uniformly under \eqref{pc:test-bounds} and \eqref{pc:inner-band}, \begin{equation}\label{pc:rough-cancellation-equation} \sum_{n\ge1}h_0(n)F(n)w(n)\ll_{A,B,C,\varepsilon,d_0} ZL^{-A}. \end{equation} \end{corollary} \subsection{Arbitrary smooth-part coefficients} \begin{theorem}\label{pc:principal-cancellation} Let $A>0$, $B\ge0$ and $C\ge1$ be fixed. Suppose that $b$ is any complex function on the positive $Q$-smooth integers with $|b(a)|\le L^B$. Uniformly for tests satisfying \eqref{pc:test-bounds} and scales \begin{equation}\label{pc:outer-band} e^{3L/4}\le Z\le e^{5L/4}, \end{equation} one has \begin{equation}\label{pc:weighted-cancellation} \sum_{n\ge1}F(n)b(n^\flat)w(n) \ll_{A,B,C,\varepsilon,d_0} ZL^{-A}. \end{equation} The function $b$ and the test $w$ may depend arbitrarily on $N$, $Z$ and additional parameters subject to the stated uniform bounds. \end{theorem} \begin{proof} Unique smooth--rough factorization and \eqref{pc:invariance} give the exact identity \begin{equation}\label{pc:small-part-identity} \sum_{n\ge1}F(n)b(n^\flat)w(n) =\sum_{\substack{a\ge1\\P^+(a)\le Q}}b(a) \sum_{m\ge1}h_0(m)F(m)w(am). \end{equation} For $a\le D_*$, the test $w_a(t)=w(at)$ has support in $[(Z/a)/C,C(Z/a)]$, and \[ \|w_a\|_\infty\le L^B,\qquad \int_{\R}|w_a'(t)|\,dt=\int_{\R}|w'(x)|\,dx\le L^B. \] Since $\log D_*=o(L)$, for large $N$ the outer band \eqref{pc:outer-band} and $1\le a\le D_*$ imply \[ e^{5L/8}\le Z/a\le e^{11L/8}. \] Apply Corollary~\ref{pc:rough-cancellation} with accuracy $A_0>A+B+d_0+1$, retaining the same $Q,y,L$ and center. The contribution of $a\le D_*$ to \eqref{pc:small-part-identity} is at most \[ \ll ZL^{B-A_0} \sum_{P^+(a)\le Q}\frac1a \ll ZL^{B+d_0-A_0}\ll ZL^{-A}. \] For $a>D_*$, use $|F|\le1$, $|w|\le L^B$, and the exact bound $\#\{m\ge1:am\le CZ\}=\lfloor CZ/a\rfloor\le CZ/a$. The remaining contribution is at most \[ CZL^{2B}\sum_{\substack{a>D_*\\P^+(a)\le Q}}\frac1a \ll_A ZL^{-A} \] by \eqref{pc:smooth-tail}, with its accuracy chosen after $A$ and $B$. This proves \eqref{pc:weighted-cancellation}. \end{proof} \subsection{The external target-unit restriction} \begin{lemma}\label{pc:nonunit-count} Let $M$ and $N$ be positive integers, and suppose that every prime divisor of $N$ exceeds $P>0$. Then \begin{equation}\label{pc:initial-nonunit-count} \#\{1\le n\le M:(n,N)>1\} \le\sum_{p\mid N}\lfloor M/p\rfloor \le \omega(N)M/P, \end{equation} where $\omega(N)$ counts distinct prime factors. For a finite set $S\subset [a,b]\cap\N$, with $0\le a\le b$, and $|c_n|\le H$ on $S$, one also has \begin{equation}\label{pc:nonunit-square-mass} \sum_{\substack{n\in S\\(n,N)>1}}|c_n|^2 \le H^2\omega(N)\left(\frac{b-a}{P}+1\right). \end{equation} The latter estimate also holds when every prime divisor of $N$ is at least $P$. \end{lemma} \begin{proof} Every nonunit has a common prime divisor with $N$. The union bound over these distinct primes gives the first inequality in \eqref{pc:initial-nonunit-count}. The count for one prime is exactly $\lfloor M/p\rfloor$. For the interval version, any two consecutive multiples of $p$ are separated by at least $p$. If there are $j$ such multiples in $[a,b]$, then $(j-1)p\le b-a$. Summing this count over $p\mid N$ and multiplying by $H^2$ proves \eqref{pc:nonunit-square-mass}. \end{proof} \begin{theorem}\label{pc:principal-unit-cancellation} In addition to the hypotheses of Theorem~\ref{pc:principal-cancellation}, fix $\eta>0$ and $D\ge0$, and let $r$ be a positive integer such that \[ P^-(N)>N^\eta,\qquad 1\le r\le L^D. \] Here $P^-(N)$ denotes the least prime factor of $N$. Then, for every fixed $A>0$, \begin{equation}\label{pc:unit-cancellation} \sum_{\substack{n\ge1\\(n,Nr)=1}}F(n)b(n^\flat)w(n) \ll_{A,B,C,D,\varepsilon,d_0,\eta} ZL^{-A}, \end{equation} uniformly in $r$, $b$, $w$ and the outer scale band \eqref{pc:outer-band}. \end{theorem} \begin{proof} For large $N$, $L^D\le Q$, so $r$ is $Q$-smooth and $(r,n^\sharp)=1$. Therefore \[ (n,r)=1\quad\Longleftrightarrow\quad(n^\flat,r)=1. \] The coefficient $b_r(a)=b(a)\ind_{(a,r)=1}$ has the same bound as $b$. Theorem~\ref{pc:principal-cancellation} applied to $b_r$ estimates the sum restricted by $(n,r)=1$. The hypothesis on the least prime factor gives $\omega(N)<1/\eta$, by comparing the product of the distinct prime divisors with $N$. Take $M=\lceil2CZ\rceil\le3CZ$, which contains the support of the sum. Lemma~\ref{pc:nonunit-count} shows that imposing $(n,N)=1$ changes this sum in modulus by at most \[ L^{2B}\#\{1\le n\le M:(n,N)>1\} \le \frac{3C}{\eta}ZL^{2B}N^{-\eta} \ll_{A,B,C,\eta}ZL^{-A}. \] Increasing the accuracy used for the first sum proves \eqref{pc:unit-cancellation}. \end{proof} \begin{corollary}\label{pc:oscillatory-tests} Let $\psi\in C_c^1((0,\infty);\C)$ and $\eta>0$ be fixed. For fixed nonnegative $B,E,D$ and every fixed $A>0$, suppose that $P^-(N)>N^\eta$, that $r$ is a positive integer with $r\le L^D$, and that $Z$ lies in \eqref{pc:outer-band}. Then \[ \sum_{\substack{n\ge1\\(n,Nr)=1}} F(n)b(n^\flat)\psi(n/Z)\ee{\beta n}n^{i\zeta} \ll_{A,B,E,D,\psi,\varepsilon,d_0,\eta} ZL^{-A}, \] uniformly for $|b(a)|\le L^E$ and real $\beta,\zeta$ satisfying $|\beta|\le L^B/Z$ and $|\zeta|\le L^B$. \end{corollary} \begin{proof} Choose a fixed $C\ge1$ such that $\operatorname{supp}\psi\subset[1/C,C]$. Put $w(x)=\psi(x/Z)\ee{\beta x}x^{i\zeta}$ for $x>0$ and $w(x)=0$ for $x\le0$. The cutoff vanishes near zero, so this function is $C^1$ on $\R$. Its supremum is at most $\|\psi\|_\infty$, and differentiation on its positive support gives \[ \int_{\R}|w'(x)|\,dx \le \int_0^\infty|\psi'(t)|\,dt +2\pi|\beta|Z\int_0^\infty|\psi(t)|\,dt +|\zeta|\int_0^\infty\frac{|\psi(t)|}{t}\,dt. \] Thus both test bounds are at most $L^{B+1}$ for sufficiently large $N$. Use Theorem~\ref{pc:principal-unit-cancellation} with common exponent $\max(E,B+1)$. \end{proof} \begin{corollary}\label{pc:totient-normalization} Fix $\eta>0$. Under $P^-(N)>N^\eta$, for sufficiently large $N$ and every positive integer $r$, \[ \frac{N}{\varphi(N)}\le2,\qquad \frac{Nr}{\varphi(Nr)}\le2r. \] In particular the second ratio is at most $2L^D$ for $r\le L^D$. \end{corollary} \begin{proof} Applying \eqref{pc:initial-nonunit-count} with $M=N$ gives $N-\varphi(N)\le\eta^{-1}N^{1-\eta}$, and hence $\varphi(N)\ge N/2$ for large $N$. The Euler product gives \[ \frac{Nr}{\varphi(Nr)} \le \frac{N}{\varphi(N)}\frac{r}{\varphi(r)} \le2r, \] since $\varphi(r)\ge1$. \end{proof} \section{Constructed dilation graphs and their moments}\label{sec:graph-moment} The weighted-dilation and residual-kernel methods used here come from \cite{graphs}. In this section \[ q=\frac1{256},\qquad \ell=1,\qquad (a,b,c,d)=\left(\frac{27}{100},\frac{36}{100}, \frac{39}{100},\frac{46}{100}\right). \] The parameter \(L\) tends to infinity. Write \(T=\log L\). For \(\alpha<\beta\), put \[ \begin{gathered} s_{\alpha,\beta}=\lfloor(\beta-\alpha)T\rfloor,\qquad x_{\alpha,j}=\exp\!\bigl(\exp(\alpha T+j)\bigr),\\ \PP_{\alpha,j}=(x_{\alpha,j},x_{\alpha,j+1}]\cap\mathbb P \quad(0\le j0\), and \(z_0\ge0\). The exponents \(q_*,h_*,x_*\) can be chosen before \(J\) so that the following holds for all sufficiently large \(L\). For nonempty \(A\subseteq I_1\), \(B\subseteq I_2\), let \(\mathbf X_A,\mathbf X_B,\mathbf D_A,\mathbf D_B\) be independent tuples with their original product laws. Write \(X_A=P_A(\mathbf X_A)\), \(X_B=P_B(\mathbf X_B)\), \(D_A=P_A(\mathbf D_A)\), and \(D_B=P_B(\mathbf D_B)\). For arbitrary tests \(f\) and \(g\) on the full selected tuple spaces of \(B\) and \(A\), every \(\alpha\in\R\), and \(|\zeta|\le L^{z_0}\), \begin{align} \Bigl|\E\overline{f(\mathbf X_B)}g(\mathbf X_A) \bigl\{&(X_AX_B)^{i\zeta}e(\alpha X_AX_B) \notag\\ &-\mathcal K_A(D_A,X_A)\mathcal K_B(D_B,X_B) (D_AD_B)^{i\zeta}e(\alpha D_AD_B)\bigr\}\Bigr| \le L^{-A_0}\norm f_2\norm g_2. \label{eq:gm-cell-comparison} \end{align} The tests may depend on every coordinate of the indicated tuples. \end{lemma} \begin{proof} Write \(v_-=1/2\), \(C_0=7/100\), and \[ \kappa=C_0\{\log(m!)+m\log\max(1,v_-^{-1})\}. \] Unique factorization gives \begin{equation}\label{eq:gm-product-atoms} \Pr(P_A=n)\le \frac{L^\kappa}{n}. \end{equation} Indeed, within a group the number of orderings of a prescribed multiset is at most \(m!\), and the reciprocal product contributes exactly \(1/n\). The normalizing factors cost at most \(\max(1,v_-^{-1})^m\) per group. Disjoint prime groups identify the group of each factor. Consequently, for a test \(f\) supported on \(U\le P_A<2U\), \begin{equation}\label{eq:gm-fibre-energy} \sum_n\left|\E\bigl(f\ind_{P_A=n}\bigr)\right|^2 \le \frac{L^\kappa}{U}\norm f_2^2. \end{equation} This is Cauchy--Schwarz separately on each product fibre. We record the character estimate used in the cells. If \(\chi\ne\chi'\) are primitive of conductor at most \(Q_0\), their quotient on a common modulus is nonprincipal. Freeze all selected labels except a prime \(p\), and call the product of the frozen labels \(R_0\). The condition \(j(pR_0)=j\) cuts out the prime interval \[ \left(\max\{a_g,e^{(j-1)h}/R_0\}, \min\{b_g,e^{jh}/R_0\}\right]. \] Partial summation in the reciprocal-prime form of Lemma~\ref{lem:twisted-primes} shows that, for every fixed \(D_0>0\), the unnormalized off-diagonal cell Gram entry is at most \(\rho_0=L^{-D_0}\), uniformly in the cell and in the frozen labels. All the relevant moduli are bounded by a fixed power of \(L\). For large \(L\), the group primes are coprime to these moduli, so each diagonal Gram entry is exactly \(\nu_{A,j}\). There are at most \(Q_0^2\) characters in \(\mathcal C(Q_0)\). On a cell of mass at least \(\xi\), the normalized Gram matrix therefore has norm at most \(1+Q_0^2\rho_0/\xi\). Choose \(D_0\) so that \(Q_0^2\rho_0\le\xi\). The integral operator with kernel \(\mathcal K_A\) has norm at most \(2\). Its transpose has the same bound. Distinct cells are orthogonal. Directly from the definition, \begin{align} |\mathcal K_A(D,X)|&\le Q_0^2\xi^{-1},& \E_D|\mathcal K_A(D,X)|&\le Q_0^2, \label{eq:gm-cell-size}\\ \left|\E_D\mathcal K_A(D,X)\chi(D)-\chi(X)\right| &\le Q_0^2\xi^{-1}\rho_0 \label{eq:gm-cell-reproduction} \end{align} on a retained cell. The last estimate also holds for a character modulo \(r\le Q_0\), by passing to its primitive inducer. The selected products have at most \(O_m(L^{d+1})\) dyadic ranges. Fix ranges \(X_A\asymp U\), \(X_B\asymp V\), and a parameter \(S_0=L^{s_*}\). Dirichlet approximation gives \[ \alpha=a_0/r+\beta,\qquad (a_0,r)=1,\qquad r\le UV/S_0,\qquad |\beta|\le r^{-2},\qquad |\beta|UV\le2S_0/r. \] For \(r>Q_0\), the elementary bilinear geometric-sum estimate, together with \eqref{eq:gm-fibre-energy}, bounds the contribution by \[ C_mL^\kappa \left(\frac1V+\frac1r+ \frac{1+\log(2r)}U+ \frac{r(1+\log(2r))}{UV}\right)^{1/2} \norm f_2\norm g_2. \] To obtain this estimate, apply Cauchy--Schwarz in one integer variable and sum its geometric progression. Split the difference variable into intervals of length at most \(r/2\). The frequencies in each interval are \(1/(2r)\)-separated, and their contribution is \(O(U+r\log(2r))\). For the term containing the two cell kernels, move each kernel onto its test first. Their operator norms are at most \(2\), and matched cells enlarge a dyadic support by at most a fixed factor when \(h\le\log2\). Formula \eqref{eq:gm-fibre-energy} then gives the same bound. For \(r\le Q_0\), expand \(e(a_0n/r)\) on the units modulo \(r\) in multiplicative characters. Parseval bounds the sum of the absolute values of its coefficients by \(\sqrt{\phi(r)}\le\sqrt{Q_0}\). Discarded cells have total probability at most \[ C_m L^{d+2+h_*}\xi. \] Cauchy--Schwarz bounds their contribution by the square root of this quantity times \(\norm f_2\norm g_2\). On retained cells the two logarithmic products change by at most \(2h\). Replacing the phase at the free product by its value at the test product costs at most \[ 2h\bigl(L^{z_0}+16\pi S_0\bigr)Q_0^4. \] This follows by differentiating \(\exp(i\zeta u)e(\beta e^u)\) and using \eqref{eq:gm-cell-size}. Formula \eqref{eq:gm-cell-reproduction} then gives a further error at most \[ 3\sqrt{Q_0}\,Q_0^2\xi^{-1}\rho_0. \] These pointwise errors pair with the tests at cost \(\norm f_2\norm g_2\). For clarity, all choices can be made successively. Put \(D=A_0+2(d+1)+1\), and choose \[ q_*=2(D+\kappa+2),\qquad s_*=d+2+q_*, \] \[ h_*=z_0+s_*+4(q_*+1)+D+4,\qquad x_*=d+2+h_*+2D+4. \] Choose \(D_0>x_*+3(q_*+1)+D+4\). The minor-arc bound, the discarded-cell bound, the phase error and the reproduction error are \(O_m(L^{-D})\) on each pair of dyads. The margins absorb their fixed constants. Summing the \(O_m(L^{2(d+1)})\) pairs proves \eqref{eq:gm-cell-comparison}. \end{proof} \begin{theorem}[Residual ideal estimate]\label{thm:gm-ideal} For every \(D>0\), there are \(m\ge1\) and positive \(q_*,h_*,x_*,C_1\), all independent of \(J\), with the following property. For every fixed \(J\ge m\), the coefficients \eqref{eq:gm-signed-coefficient} satisfy, for sufficiently large \(L\), \begin{equation}\label{eq:gm-ideal-bound} \sup_{\Theta\in\R}\norm{\mathcal T_\zeta(\Theta)} \le L^{-D}\qquad (|\zeta|\le L^2), \qquad \sum_\nu\norm{c_\nu}_\infty\le L^{C_1}. \end{equation} One may take \[ C_1=\frac{7m}{100}\log2+4(q_*+1)+2x_*+1. \] The partition and coefficient family are fixed before \(\zeta\) and \(\Theta\). \end{theorem} \begin{proof} Let \(E_i\) average coordinate \(i\), and let \(E_{\rm tail}\) average slot \(M\) in every group. For a symmetric vector \(F\), write \(F'=E_{\rm tail}F\), and define \(H'\) similarly. Put \[ \Pi_j=\prod_{i\in I_j}(1-E_i),\qquad j=1,2. \] In a group, consider the \(m\) probe coordinates together with its tail coordinate. The \(m+1\) projections \[ E_i\prod_{j\ne i}(1-E_j) \] are pairwise orthogonal. Symmetry makes the squared norms of their images of \(F\) equal. Applying this observation successively in the disjoint groups gives \begin{equation}\label{eq:gm-endpoint-projection} \norm{\Pi_1F'}_2\le(m+1)^{-|\BB_1|/2}\norm F_2,\qquad \norm{\Pi_2H'}_2\le(m+1)^{-|\BB_2|/2}\norm H_2. \end{equation} The remaining tail averages are commuting contractions. Let \(\mathcal R(F',H')\) be the raw pairing, including its multiplicative and additive phases. Its norm is at most one. In the pairing for \((A,B)\), the source coordinates in \(A\) occur only in \(F'\), and the target coordinates in \(B\) occur only in \(H'\). Integrating them replaces the tests by \(E_AF'\) and \(E_BH'\). Fix the shared first-\(J\) labels outside \(A\cup B\), whose product is \(C\). The remaining source, target and free tuples have precisely the product laws in Lemma~\ref{lem:gm-cell-comparison}. Apply that lemma with \(\alpha=\Theta C\), and multiply by \(C^{i\zeta}\). Cauchy--Schwarz in the fixed shared labels gives an error at most \(L^{-A_0}\norm F_2\norm H_2\). This identification uses the full arrays. A label alphabet can equivalently be embedded in the ambient coordinate alphabet by extending every test by zero. The weighted inner product is preserved by this extension, as is integration in each coordinate. Inverse slot permutations preserve the product measure. Thus averaging the two endpoint permutations gives exactly the orthogonal projection \(S\) at each end of the stated ideal row operator. The commuting-projection identities \[ \sum_{\varnothing\ne A\subseteq I_1}(-1)^{|A|}E_A=\Pi_1-1, \qquad \sum_{\varnothing\ne B\subseteq I_2}(-1)^{|B|}E_B=\Pi_2-1 \] now give \begin{align*} \mathcal R(F',H') -\sum_{A,B\ne\varnothing}(-1)^{|A|+|B|} \mathcal R(E_AF',E_BH') =\mathcal R(\Pi_1F',H') +\mathcal R((1-\Pi_1)F',\Pi_2H'). \end{align*} Since \(1-\Pi_1\) is an orthogonal projection, the norm of the constructed residual operator is at most \[ (m+1)^{-|\BB_1|/2}+(m+1)^{-|\BB_2|/2} +2^{ms_B}L^{-A_0}. \] For sufficiently large \(L\), each block has at least \((7/600)\log L\) groups. Choose \(m\) so that \((7/1200)\log(m+1)>D+2\), and then choose \(A_0>D+(7m/100)\log2+2\). Lemma~\ref{lem:gm-cell-comparison} supplies its remaining parameters with \(z_0=2\). The displayed norm is at most \(L^{-D}\) after increasing the threshold. Finally, \eqref{eq:gm-cell-size} and the number of selected subsets give \[ \sum_\nu\norm{c_\nu}_\infty \le1+2^{ms_B}Q_0^4\xi^{-2} \le L^{(7m/100)\log2+4(q_*+1)+2x_*+1}. \] Every choice made here precedes \(J\). \end{proof} \subsection{Finite memory estimates} We give the quantitative estimates used to pass from the ideal operator to physical moments. From now on set \[ R=\lceil L^{13/25}\rceil,\qquad n=2R, \] and define \[ d_j=\ind_{j0\), and a real coefficient \(b(p)\ge0\), define \begin{equation}\label{eq:gm-slot-store-kernel} S_{\alpha,b}((a,s),(a',t)) =\nu(a')\alpha^{Z_g(s)} \left(\ind_{t=s}+b(a)\ind_{t=s+[e(a)]}\right). \end{equation} Both memories in this formula belong to the cutoff space. Thus a store that would exceed the cutoff contributes zero. On a complete array, this kernel also contains the indicator that every other active slot is fixed. The term \(t=s\) drops the old active label. The term \(t=s+[e(a)]\) stores that label at residue zero. The new active label \(a'\) has weight \(\nu(a')\) in either case. The elementary factorial identity \begin{equation}\label{eq:gm-factorial-balance} \pi_g(s+[u])\bigl(s(u)+1\bigr)=\nu(u)\pi_g(s) \end{equation} determines the reverse kernel. With the one-slot mass \(\nu(a)\pi_g(s)\), formula \eqref{eq:gm-weighted-adjoint-kernel} gives \begin{align} S_{\alpha,b}^*((a,s),(a',t)) ={}&\nu(a')\alpha^{Z_g(s)}\ind_{t=s} \notag\\ &+b(a')s(e(a'))\alpha^{Z_g(t)} \ind_{s=t+[e(a')]}. \label{eq:gm-slot-retrieval-kernel} \end{align} Indeed, the drop terms on the two sides of weighted adjointness are both \(\nu(a)\nu(a')\pi_g(s)\alpha^{Z_g(s)}\). For a store term, \eqref{eq:gm-factorial-balance} replaces \(\nu(a')\pi_g(t)\) by \(\pi_g(s)s(e(a'))\), giving the second term of \eqref{eq:gm-slot-retrieval-kernel}. The masses of all the other active slots cancel. This proves the formula on the full array space as well. Thus retrieval either samples a fresh active label with weight \(\nu(a')\), or removes one pending zero-residue copy of the target label with weight \(b(a')s(e(a'))\). The latter multiplicity is evaluated in the memory immediately before that removal. This description includes repeated numerical labels and arbitrary pending multiplicities. \subsubsection{A block with one damping factor} Let \(i_1,\ldots,i_t\) be the unshared slots of one group in their original increasing order. They are distinct. Let \(S_{i,\alpha,b}\) denote the full-array version of \eqref{eq:gm-slot-store-kernel}, and let \[ (D_\lambda f)(\mathbf a,s)=\lambda^{Z_g(s)}f(\mathbf a,s). \] The source block in an edge is exactly \begin{equation}\label{eq:gm-once-damped-store-block} \mathcal S_{\varrho,\mathbf b} =D_{\varrho}S_{i_1,1,b_1}\cdots S_{i_t,1,b_t}, \qquad \varrho=\tfrac12. \end{equation} It applies one factor \(\varrho^{Z_g(s)}\), evaluated in the source memory. Its adjoint is \begin{equation}\label{eq:gm-once-damped-retrieval-block} \mathcal S_{\varrho,\mathbf b}^{*} =S_{i_t,1,b_t}^{*}\cdots S_{i_1,1,b_1}^{*}D_{\varrho}. \end{equation} The target slots are therefore processed in decreasing original order, and the damping factor is evaluated in the final pending memory. Both formulas retain the cutoff after each individual store or removal. Here is the exact distribution of the single damping factor used in the estimates. For \(0<\vartheta<1\) and an integer \(r\ge0\), the two alternatives in \eqref{eq:gm-slot-store-kernel} give \begin{equation}\label{eq:gm-damping-intertwining} S_{i,\vartheta,b\vartheta^{-r}}D_{\vartheta^r} =D_{\vartheta^{r+1}}S_{i,1,b}. \end{equation} For a drop, \(Z_g(t)=Z_g(s)\). For a store, \(Z_g(t)=Z_g(s)+1\), and the additional \(\vartheta^r\) is canceled by \(\vartheta^{-r}\). Multiplying \eqref{eq:gm-damping-intertwining} for the successive slots yields \begin{equation}\label{eq:gm-distributed-damping} \prod_{j=1}^{t}S_{i_j,\vartheta, b_j\vartheta^{-(t-j)}} =D_{\vartheta^t}\prod_{j=1}^{t}S_{i_j,1,b_j}. \end{equation} Products of operators here and below are ordered from left to right in increasing \(j\), as in the row action of the chronological kernel. If \(t\le T_0\) and \(\varrho\le\vartheta^{T_0}\), then \(0<\varrho/\vartheta^t\le1\). Hence \eqref{eq:gm-once-damped-store-block} equals the left side of \eqref{eq:gm-distributed-damping} preceded by the diagonal contraction \(D_{\varrho/\vartheta^t}\). The one-slot estimates follow directly from \eqref{eq:gm-slot-store-kernel} and \eqref{eq:gm-slot-retrieval-kernel}. Use the positive weight \(w(s)=v^{|s|}\), with \(v=16\). For \(b=1\), the weighted row sum is at most \(N_g(1+v)w(s)\). The weighted column sum, divided by the target mass and \(w(t)\), is at most \[ N_g\vartheta^{Z_g(t)} +\frac{Z_g(t)\vartheta^{Z_g(t)-1}}v \le N_g+\frac1{v(1-\vartheta)}. \] The removal term is zero when \(Z_g(t)=0\). For a positive integer \(k\), its bound follows from \[ k\vartheta^{k-1}\le\sum_{j=0}^{k-1}\vartheta^j \le\frac1{1-\vartheta}. \] If \(0\le b\le A\) and \(A\ge1\), both estimates acquire a factor at most \(A\), by termwise comparison with the kernel for \(b=1\). These estimates are independent of the number of other active slots and of the cutoff. Take \(T_0=m+1\), \(\vartheta=1-1/(2T_0)\), and \(\Lambda=\max_p b_p^{-1}\), with the notation of the complete-edge estimate below. Then \(1\le N_g\le\Lambda\) and \(\vartheta^{T_0}\ge1/2=\varrho\). Indeed, \(\nu_g(p)=b_p^{-1}\mu_g(p)\), and Bernoulli's inequality gives \((1-1/(2T_0))^{T_0}\ge1-T_0/(2T_0)=1/2\). If \(0\le b_j\le2\), each compensating coefficient in \eqref{eq:gm-distributed-damping} is at most \(2\vartheta^{-T_0}\). The source block has weighted row and column bounds \(R_0^t\) and \(C_0^t\), where \begin{equation}\label{eq:gm-store-block-schur-constants} R_0=2\vartheta^{-T_0}\Lambda(1+16),\qquad C_0=2\vartheta^{-T_0} \left(\Lambda+\frac1{16(1-\vartheta)}\right). \end{equation} Its weighted adjoint has row bound \(C_0^t\) and column bound \(R_0^t\). \subsubsection{Translation and the auxiliary-label normalization} Fix an integer displacement \(\delta\). Translation acts on each particle by \[ T_\delta(p,r)=(p,r+\delta\bmod p),\qquad (U_\delta f)(\mathbf a,s)=f(\mathbf a,T_\delta s). \] This map preserves \(|s|\) and \(\pi(s)\), since the particle weight depends only on its prime. It therefore preserves the weighted norm and the weight \(16^{|s|}\). For one group define the normalized memory edge by \begin{equation}\label{eq:gm-store-translate-retrieve} \mathcal E_g =N_g^{-t}\mathcal S_{\varrho,\mathbf b_s} U_\delta\mathcal S_{\varrho,\mathbf b_r}^{*}. \end{equation} Since \(U_\delta^*=U_{-\delta}\), this definition gives the exact identity \begin{equation}\label{eq:gm-memory-edge-adjoint} \mathcal E_g(\mathbf b_s,\mathbf b_r,\delta)^* =\mathcal E_g(\mathbf b_r,\mathbf b_s,-\delta). \end{equation} The factor \(N_g^{-t}\) has an exact finite-sum origin. In the source block each selected slot is replaced by an auxiliary active label of weight \(\nu_g\). These auxiliary labels range over the full product alphabet. The physical distinctness restrictions are applied at the original source and final target of the edge. The retrieval kernel \eqref{eq:gm-slot-retrieval-kernel} is independent of its input active label. Thus the auxiliary label at each selected slot is summed freely, giving \[ \sum_{d_1,\ldots,d_t\in\PP_g}\prod_{j=1}^{t}\nu_g(d_j) =N_g^t. \] This cancels the prefactor in \eqref{eq:gm-store-translate-retrieve}. The distinctness of \(i_1,\ldots,i_t\) ensures that every source store reads its original active label. The memory cutoff depends only on the store mask and the source memory. The final coefficient depends on the final target array and memory. Both therefore remain fixed during the auxiliary-label sums. This proves the cancellation with an arbitrary coefficient on the complete final state. More explicitly, choose a store mask \(\epsilon\in\{0,1\}^{t}\) and put \[ s_\epsilon=s+\sum_{j=1}^{t}\epsilon_j[e(a_{i_j})]. \] This choice contributes \(\prod_{j:\epsilon_j=1}b_{s,j}(a_{i_j})\), subject to \(|s_\epsilon|\le B_0\). Start the reverse retrieval at \(u_t=T_\delta s_\epsilon\). For \(j=t,t-1,\ldots,1\), fix the target label \(a'_{i_j}\) and choose a fresh flag \(f_j\). Set \begin{equation}\label{eq:gm-retrieval-trace-weight} \begin{array}{c|c|c} f_j & u_{j-1} & q_j\\ \hline 1 & u_j & \nu_g(a'_{i_j})\\[2pt] 0 & u_j-[e(a'_{i_j})] &b_{r,j}(a'_{i_j})u_j(e(a'_{i_j})). \end{array} \end{equation} Removal of an unavailable copy gives zero weight. The terminal memory is \(u_0\). The edge kernel is exactly \begin{align} \mathcal E_g((\mathbf a,s),(\mathbf a',s')) ={}&\ind_{a_i=a'_i\ (i\notin\{i_1,\ldots,i_t\})} \varrho^{Z_g(s)+Z_g(s')} \notag\\ &\quad\times \sum_{\epsilon\in\{0,1\}^{t}} \ind_{|s_\epsilon|\le B_0} \left(\prod_{j:\epsilon_j=1}b_{s,j}(a_{i_j})\right) \sum_{\mathbf f\in\{0,1\}^{t}} \ind_{u_0=s'}\prod_{j=1}^{t}q_j. \label{eq:gm-exact-edge-traces} \end{align} Expanding the source kernels, using \eqref{eq:gm-slot-retrieval-kernel} in reverse order, and summing the auxiliary active labels proves \eqref{eq:gm-exact-edge-traces}. All sums are finite, so this calculation also applies after multiplication by arbitrary complex endpoint coefficients. For several big groups use the product of these kernels with the single total cutoff \(\sum_g|s_g|\le B_0\). Equivalently, insert the corresponding coordinate projection before the source block, at its output, and after the retrieval block. During source storage the total memory size is nondecreasing, so its largest value is the fully stored value. Translation preserves this value and every retrieval decreases it or leaves it fixed. Thus the cutoff in the multigroup version of \eqref{eq:gm-exact-edge-traces} is exactly \begin{equation}\label{eq:gm-full-store-cutoff} \left|s+\sum_{g\in\BB}\sum_{j=1}^{t_g} \epsilon_{g,j}[e_g(a_{g,i_j})]\right|\le B_0. \end{equation} This also enforces every intermediate source-store cutoff, even when a later retrieval would lower the memory size. The weighted row and column estimates compose through translation. Since \(N_g^{-t_g}\le1\), \eqref{eq:gm-store-block-schur-constants} gives a common bound \((R_0C_0)^{t_g}\) for both sums in group \(g\). Restricting the positive memory kernels to the total-cutoff states preserves these bounds. Their product over the big groups is at most \[ \left[ \max\left\{1,(2\vartheta^{-T_0})^2 \Lambda(1+16) \left(\Lambda+\frac1{16(1-\vartheta)}\right)\right\} \right]^{T_0s_B}=C_{\rm mem}. \] This proves the stated memory constant with one source damping factor and one final retrieval damping factor per edge. \subsubsection{The original mixed edge} Fix an original choice consisting of a pattern \(\nu\), its full ordered free tuple \(\mathbf r\), and the independent source and target slot permutations \(\sigma,\tau\). Write \(\mathbf a=\mathbf p^{\sigma}\), \(\mathbf a'=\mathbf p'^{\tau}\), \(D=D_\nu(\mathbf a,\mathbf r)\), and let \(D_B\) be its big part. For the forward edge, \(\delta=kD\). The exact store and retrieval coefficients in a big group are \begin{equation}\label{eq:gm-physical-store-retrieval-coefficients} b_{s,g,j}(p)=\ind_{p\nmid D_B},\qquad b_{r,g,j}(p)=V_g^{-1}\ind_{p\nmid D_B}. \end{equation} They satisfy \(0\le b_s\le1\) and \(0\le b_r\le2\). The dilation uses only shared source slots and free labels. Consequently \(D\), \(D_B\), and the translation are fixed while the unshared slots are processed. Because the prime groups are disjoint and \(p\nmid k\), \(p\nmid D_B\) implies \(\delta\ne0\pmod p\). A newly stored particle \((p,0)\) therefore becomes \((p,\delta)\) with nonzero residue. This proves directly that it contributes zero to every zero-residue retrieval in the same edge. On an endpoint satisfying the original distinct-label, shared-label and free-label guards, each unshared source or target prime is coprime to \(D_B\). The coefficients in \eqref{eq:gm-physical-store-retrieval-coefficients} then give a source-store factor \(1\), a fresh-target weight \(m_p/V_g\), and a retrieval weight \(V_g^{-1}\) for each available pending copy. Let \(\Pi=\prod_g\operatorname{Sym}([M])\), and evaluate \(\mathcal I_\nu\) using the displayed label and integer conditions in \eqref{eq:gm-physical-kernel}. For this fixed forward choice, the scalar multiplying the memory kernel is \begin{align} \kappa_{\nu,\sigma,\tau,\mathbf r}(x,y) ={}&\frac{d_{q,S}(x_S)d_{q,S}(y_S)}{|\Pi|^2} \left(\prod_{g\in\SSS}V_g^{-t_{\nu,g}}\right) \left(\prod_g\prod_{i\in C_{\nu,g}}\mu_g(r_{g,i})\right) \notag\\ &\quad\times c_\nu(\mathbf a_B,\mathbf a'_B,\mathbf r_B) D^{i\zeta}e(\theta kD)\, \mathcal I_\nu(x^{\sigma},y^{\tau},\mathbf r). \label{eq:gm-original-mixed-scalar} \end{align} Here \(d_{q,S}\) denotes the damping from the small groups, and the guard includes the exact integer equation \(\operatorname{position}(y)=\operatorname{position}(x)+kD\). The complete forward mixed edge is the finite sum of \eqref{eq:gm-original-mixed-scalar} times the multigroup kernel \eqref{eq:gm-exact-edge-traces}, over precisely these original choices. Shared labels are fixed by the kernel. Restricting its endpoint arrays imposes the original distinct-label conditions. The full free tuple and both independent permutation averages remain in this formula. Every changed big target slot already contributes its inverse group mass through its fresh weight \(\nu_g=m_p/V_g\) or its retrieval coefficient \(V_g^{-1}\). This accounts for the big target normalization removed in \eqref{eq:gm-original-mixed-scalar}. Similarly, the initial active product in \eqref{eq:gm-mixed-factorial-mass} supplies the tilted initial factors. Expanding the finite sums establishes this identity before taking absolute values of any signed pattern coefficient. For a reversed edge the scalar is the complex conjugate of the forward scalar with the endpoints interchanged. The memory translation becomes \(T_{-\delta}\), the source and target permutations interchange, and the store and retrieval coefficient families interchange. Formula \eqref{eq:gm-weighted-adjoint-kernel} then proves the exact weighted adjoint identity on the mixed state space. In particular, the reverse row estimate is the required mass-weighted column estimate for the forward edge. Finally, the placement of the two damping factors agrees with the ghost coefficients. At a zero-residue visit, \[ \varrho^2 A_j(p,0)=1-\eta_j,\qquad \varrho D_j(p,0)=-\eta_j,\qquad \varrho C_j(p,0)\nu_g(p)=-\eta_jm_p. \] A retained pending copy receives the factors from the adjacent incoming and outgoing edges. A destroyed copy receives the incoming factor, and a newborn copy receives the outgoing factor. Off zero, every such damping factor is one. These identities recover the corresponding lifespan terms with the initial and terminal pending memories empty. For use below, let \(E\) denote one complete edge on this weighted memory space, including the small physical labels, both endpoint permutations, the original free-array sum and its coefficients. Let \(E(\beta_s,\beta_r)\) display its store and retrieval factors. Write \[ C=E(0,0),\qquad P=E(\beta_s,\beta_r)-E(\beta_s,0),\qquad S_1=E(\beta_s,0)-E(0,0). \] These are classes of traces on the same space, and \(E=C+P+S_1\). Define \[ \Lambda=\max_{p\in\bigcup_{g\in\BB}\PP_g}b_p^{-1},\quad K=\sum_\nu\norm{c_\nu}_\infty,\quad t=(m+1)s_B, \] \[ C_{\rm cond}=\prod_{g\in\SSS}\frac1{(1-q)V_g},\qquad C_{\rm row}=\prod_{g\in\SSS}\frac1{(1-\sqrt q)V_g}. \] Put \(T_0=m+1\), \(\vartheta=1-1/(2T_0)\), and \[ \mathfrak C(\Lambda,\vartheta) =\left[ \max\left\{1,\, (2\vartheta^{-T_0})^2 \Lambda(1+16) \left(\Lambda+\frac1{16(1-\vartheta)}\right)\right\} \right]^{T_0},\qquad C_{\rm mem}=\mathfrak C(\Lambda,\vartheta)^{s_B}. \] \begin{lemma}[Complete-edge estimate]\label{lem:gm-complete-edge} Suppose \(\norm{\mathcal T_\zeta(\Theta)}\le\epsilon\) for every \(\Theta\in\R\), and \(p\nmid k\) for every big prime. For the actual two-scale groups, sufficiently large \(L\) gives \begin{align} \norm E\le{}& C_{\rm cond}\left\{\epsilon+K(\Lambda^t-1) +K\Lambda^t b_{\rm col}\right\} +4K C_{\rm row} C_{\rm mem} \sqrt{\frac{B_0}{(J+1)^{s_S}}}, \label{eq:gm-complete-edge}\\ b_{\rm col}={}&\frac{2m(J+m+2)s_B}{P_*}. \end{align} The estimate holds for both orientations and for every finite position window. \end{lemma} \begin{proof} \medskip\noindent\emph{The weighted completion map.} We describe the clean edge in the notation of Lemma~\ref{lem:gm-complete-edge}. Here \(M=J+1\), the fresh law is \(\nu_g(p)=\mu_g(p)b_p^{-1}\), and the memory cutoff is \(B_0\). Let \[ \mathcal A_B=\prod_{g\in\BB}\PP_g^M,\qquad w_B(\mathbf a)=\prod_{g\in\BB}\prod_{i=1}^M\nu_g(a_{g,i}), \] and let \(\mathcal A_B^{\rm inj}\) be the subset on which the entries in each group are distinct. A memory \(\mathfrak m\) is a multiset of pairs \((p,r)\), with \(p\) in a big group and \(r\in\Z/p\Z\), whose cardinality is at most \(B_0\). Write \[ \pi(\mathfrak m)= \prod_{g\in\BB}\prod_{p\in\PP_g}\prod_{r\bmod p} \frac{\nu_g(p)^{\mathfrak m(p,r)}}{\mathfrak m(p,r)!}, \qquad Z(\mathfrak m)=\sum_{g\in\BB}\sum_{p\in\PP_g}\mathfrak m(p,0). \] The small physical space \(\mathcal V_S\) consists of \(u=(z,\mathbf p_S)\), where \(z\in\mathcal W\), all the labels divide \(z\), and the \(M\) labels in each small group are distinct. Put \[ \tau_S=\prod_{g\in\SSS}V_g^{-M},\qquad \alpha_S=\prod_{g\in\SSS}V_g^{-1},\qquad d_S(u)=q^{(\omega_S(z)-Ms_S)/2}. \] Thus the joint state space and its mass are \[ \mathcal X=\mathcal V_S\times\mathcal A_B^{\rm inj}\times\mathcal M_{B_0}, \qquad m_X(u,\mathbf a,\mathfrak m)=\tau_S w_B(\mathbf a)\pi(\mathfrak m). \] All inner products below are conjugate-linear in the first variable. In particular, \[ \langle f,g\rangle_X= \sum_{u,\mathbf a,\mathfrak m} \tau_S w_B(\mathbf a)\pi(\mathfrak m) \overline{f(u,\mathbf a,\mathfrak m)}g(u,\mathbf a,\mathfrak m). \] Record the first \(J\) small labels by \[ \mathbf d(u)=(p_{g,i})_{g\in\SSS,\ 1\le i\le J},\qquad \Xi=\prod_{g\in\SSS}\PP_g^J,\qquad d(\mathbf d)=\prod_{g\in\SSS}\prod_{i=1}^Jd_{g,i}. \] The ambient prefix space \(\Xi\) contains every ordered tuple. We choose an exact position circle before defining the target space. Let \(\Delta\) be the finite set of all integers \(\pm kD_\nu(\mathbf p,\mathbf r)\), with \(\nu\) ranging over the complete pattern family and \(\mathbf p,\mathbf r\) over their full ordered label spaces. Set \[ N=1+\max_{z,z'\in\mathcal W,\ \delta\in\Delta\cup\{0\}} |z'-z-\delta|, \] where the maximum of an empty set is zero. For every relevant edge, \begin{equation}\label{eq:gm-completion-no-alias} z'=z+\delta\pmod N\quad\Longleftrightarrow\quad z'=z+\delta. \end{equation} Indeed, the difference is divisible by \(N\) and has absolute value less than \(N\). The case \(\delta=0\) also proves that \(\iota\colon\mathcal W\to\Z/N\Z\), \(z\mapsto z\bmod N\), is injective. The set \(\Delta\) includes the arrays introduced by zero extension and both endpoint permutation averages. The completion target is \[ \mathcal T=\Xi\times\Z/N\Z\times\mathcal A_B\times\mathcal M_{B_0}, \qquad m_T(\mathbf d,\bar z,\mathbf a,\mathfrak m)=w_B(\mathbf a)\pi(\mathfrak m). \] Prefix and position carry counting measure. Define \begin{equation}\label{eq:gm-completion-map} (\mathcal Jf)(\mathbf d,\bar z,\mathbf a,\mathfrak m)= \sqrt{\tau_S\alpha_S} \sum_{\substack{u\in\mathcal V_S\colon\ \mathbf d(u)=\mathbf d\\ \iota(z(u))=\bar z}} d_S(u)f(u,\mathbf a,\mathfrak m) \end{equation} when \(\mathbf a\in\mathcal A_B^{\rm inj}\), and give it value zero for other \(\mathbf a\). Empty fibres also have value zero. This formula keeps the small-label divisibility and distinctness conditions inside the summation. The weighted adjoint is \begin{equation}\label{eq:gm-completion-adjoint} (\mathcal J^*F)(u,\mathbf a,\mathfrak m)= \sqrt{\frac{\alpha_S}{\tau_S}}\,d_S(u) F(\mathbf d(u),\iota(z(u)),\mathbf a,\mathfrak m). \end{equation} Indeed, direct expansion gives \[ \sum_{t\in\mathcal T}m_T(t)\overline{(\mathcal Jf)(t)}F(t) =\sum_{x\in\mathcal X}m_X(x)\overline{f(x)} \sqrt{\frac{\alpha_S}{\tau_S}}d_S(u)F(\operatorname{tag}x), \] since \(m_X=\tau_Sm_T\) on the fibre of the displayed tag. In particular, if \(U(t,t')\) is a row kernel on \(\mathcal T\), then \begin{equation}\label{eq:gm-completion-kernel} (\mathcal J^*U\mathcal J)(x,x')= \alpha_S d_S(u)d_S(u')\,U(\operatorname{tag}x,\operatorname{tag}x'). \end{equation} Thus the two completion factors give exactly the original small target normalization and the two small endpoint damping factors. For a fixed \((\mathbf d,\bar z)\), the position \(z\) is unique if the fibre is nonempty. Put \(n_g=\omega_{\PP_g}(z)-J\). There are \(n_g\) choices for the final label in group \(g\), and, for an admissible prefix, consequently \[ \sum_{u\text{ in the fibre}}d_S(u)^2 =\prod_{g\in\SSS}n_gq^{n_g-1}. \] For \(n\ge1\), \[ nq^{n-1}\le\sum_{r=0}^{n-1}q^r\le\frac1{1-q}. \] If one of the required choices is absent, the fibre contributes zero. It follows that \begin{equation}\label{eq:gm-completion-fibre} \alpha_S\sum_{u\text{ in the fibre}}d_S(u)^2 \le\prod_{g\in\SSS}\frac1{(1-q)V_g}=C_{\rm cond}. \end{equation} Cauchy--Schwarz in each fibre, followed by summation with the unchanged weights \(w_B(\mathbf a)\pi(\mathfrak m)\), now gives \begin{equation}\label{eq:gm-completion-energy} \|\mathcal Jf\|_T^2\le C_{\rm cond}\|f\|_X^2, \qquad \|\mathcal J\|^2\le C_{\rm cond}. \end{equation} \medskip\noindent\emph{The exact clean kernel on the completion space.} Let \(\Pi_B\) and \(\Pi_S\) be the products of the slot-permutation groups over the big and small groups, and put \(\Pi_G=\Pi_S\times\Pi_B\). For an array \(\mathbf a\), write \(\mathbf a^\sigma_{g,i}=a_{g,\sigma_g(i)}\). The independent big endpoint averages remain inside the following kernel. Fix \(\mathbf d\in\Xi\), and write \(d=d(\mathbf d)\). For a pattern \(\nu\), put \[ w_\nu(\mathbf r)=\prod_{g\in\BB}\prod_{i\in C_{\nu,g}}\mu_g(r_{g,i}), \qquad \nu_{U_\nu}(\mathbf b)= \prod_{g\in\BB}\prod_{i\in U_{\nu,g}}\nu_g(b_{g,i}). \] Let \(G_\nu(\mathbf a,\mathbf b,\mathbf r)\) be the indicator that all shared big coordinates agree and that every free label differs from every source and target label in its group. It imposes the original free-label exclusions and allows free labels to repeat one another. Let \(T_h\) translate a position by \(h\bmod N\) and each residue of a pending particle \((p,r)\) by \(h\bmod p\), with multiplicities preserved. Define the row kernel \begin{align} U_{\mathbf d}\bigl((\bar z,\mathfrak m,\mathbf a), (\bar z',\mathfrak m',\mathbf b)\bigr) ={}&\frac1{|\Pi_B|^2} \sum_{\sigma,\tau\in\Pi_B}\sum_\nu\sum_{\mathbf r} w_\nu(\mathbf r)\nu_{U_\nu}(\mathbf b^\tau) G_\nu(\mathbf a^\sigma,\mathbf b^\tau,\mathbf r)\notag\\ &\quad\cdot c_\nu(\mathbf a^\sigma,\mathbf b^\tau,\mathbf r) (dD)^{i\zeta}e(\theta kdD) \ind_{(\bar z',\mathfrak m')=T_{kdD}(\bar z,\mathfrak m)}. \label{eq:gm-completion-core} \end{align} Here \(D=D_{\nu,B}(\mathbf a^\sigma,\mathbf r)\) in each summand. The full operator \(U\) is the direct sum of these kernels over \(\mathbf d\). Its mass on each component is \(w_B(\mathbf a)\pi(\mathfrak m)\), with counting measure in \(\bar z\). Let \(P_S\) average the small-label slot permutations on \(\mathcal X\), and let \((D_\varrho f)(x)=\varrho^{Z(\mathfrak m)}f(x)\). Both are contractions for the displayed mass. The exact clean identity is \begin{equation}\label{eq:gm-clean-exact-completion} C=D_\varrho P_S\mathcal J^*U\mathcal J P_S D_\varrho. \end{equation} To check it, expand the two factors \(P_S\), the two factors in \eqref{eq:gm-completion-kernel}, and the kernel \eqref{eq:gm-completion-core}. Equality of the prefix indices is the small shared-coordinate condition. The full dilation equals \(d(\mathbf d)D_{\nu,B}\), since small groups have empty replacement sets. Their free-label spaces are singletons and contribute weight one. The big target factor is precisely the ordered fresh law \(\nu_{U_\nu}\). The two factors from \(D_\varrho\) are the original pending-zero damping factors. Formula~\eqref{eq:gm-completion-no-alias} recovers the integer position equation from the torus equation. Finally, \(|\Pi_S|^{-2}|\Pi_B|^{-2}=|\Pi_G|^{-2}\), so every original endpoint permutation and its normalization is present. The all-fresh trace leaves the pending cardinality unchanged. Hence its intermediate cutoff is the same \(B_0\) throughout this identity. \medskip\noindent\emph{An explicit isometric Fourier lift.} Choose a positive integer \(N_1\) divisible by \(N\) and by every big prime, for example \(N_1=N\prod_{g\in\BB}\prod_{p\in\PP_g}p\). Put \(A_{N_1}=\Z/N_1\Z\) and \(Y=(\Z/N\Z)\times\mathcal M_{B_0}\). Then \(T_a\), \(a\in A_{N_1}\), is a well-defined action on \(Y\), and \begin{equation}\label{eq:gm-action-mass} T_{a+b}=T_bT_a,\qquad \pi(T_a\mathfrak m)=\pi(\mathfrak m). \end{equation} The second equality follows by permuting the residue classes of each fixed prime. The numerator and the multiplicity factorials are both preserved. Let \(\mathcal H_\nu=L^2(\mathcal A_B,w_B)\), and regard a function on \(Y\times\mathcal A_B\) as a function on \(Y\) with values in \(\mathcal H_\nu\). The orbit lift is \[ (\mathcal L F)(a,y)=F(T_a y),\qquad a\in A_{N_1}. \] Give \(A_{N_1}\) the probability measure \(N_1^{-1}\) and \(Y\) the mass \(\pi(y)=\pi(\mathfrak m)\). Direct reindexing gives \begin{equation}\label{eq:gm-orbit-isometry} \frac1{N_1}\sum_{a\in A_{N_1}}\sum_{y\in Y}\pi(y) \|F(T_a y)\|_{\mathcal H_\nu}^2 =\sum_{y\in Y}\pi(y)\|F(y)\|_{\mathcal H_\nu}^2. \end{equation} For an \(\mathcal H_\nu\)-valued function \(F\) on \(A_{N_1}\), use \[ \widehat F(\chi)=\frac1{N_1}\sum_{a\in A_{N_1}}\overline{\chi(a)}F(a). \] For \(a,b\in A_{N_1}\), the geometric sum gives \[ \sum_{j=0}^{N_1-1} e\!\left(\frac{j(a-b)}{N_1}\right) =N_1\ind_{a=b}. \] Expanding squared norms and using this identity gives \begin{equation}\label{eq:gm-normalized-parseval} \sum_\chi\|\widehat F(\chi)\|_{\mathcal H_\nu}^2 =\frac1{N_1}\sum_a\|F(a)\|_{\mathcal H_\nu}^2, \qquad \widehat{F(\cdot+h)}(\chi)=\chi(h)\widehat F(\chi). \end{equation} These formulas apply to every orbit, with its actual stabilizer and multiplicity, because the calculation sums over all \(a\in A_{N_1}\). Slice the complete signed, independently averaged big-label kernel by its integer dilation \(D\). Denote by \(B_D\) the row operator whose kernel is \begin{align*} B_D(\mathbf a,\mathbf b) =\frac1{|\Pi_B|^2}\sum_{\sigma,\tau\in\Pi_B}\sum_\nu\sum_{\mathbf r} &w_\nu(\mathbf r)\nu_{U_\nu}(\mathbf b^\tau) G_\nu(\mathbf a^\sigma,\mathbf b^\tau,\mathbf r)\, c_\nu(\mathbf a^\sigma,\mathbf b^\tau,\mathbf r)\,D^{i\zeta}\\ &\hspace{25mm}\cdot\ind_{D_{\nu,B}(\mathbf a^\sigma,\mathbf r)=D}. \end{align*} Only finitely many positive \(D\) occur. Formula \eqref{eq:gm-completion-core} becomes the operator identity \[ (U_{\mathbf d}F)(y) =\sum_D d^{i\zeta}e(\theta kdD)B_D F(T_{kdD}y). \] Applying \(\mathcal L\), relation~\eqref{eq:gm-action-mass} changes the argument to \(a+kdD\). The Fourier block at a character \(\chi(a)=e(ja/N_1)\) is therefore exactly \begin{align} \mathcal B_{\mathbf d,\chi} &=d^{i\zeta}\sum_D e(\theta kdD)\chi(kdD)B_D\notag\\ &=d^{i\zeta}\, \widetilde{\mathcal T}^{\rm allow}_\zeta \!\left(kd\left(\theta+\frac j{N_1}\right)\right). \label{eq:gm-exact-fourier-block} \end{align} Here \(\widetilde{\mathcal T}^{\rm allow}\) is the literal ideal row operation with fresh law \(\nu_g\), the original free exclusions, and both endpoint averages. All pattern terms have already been summed in this block. The scalar \(d^{i\zeta}\) has modulus one. The Fourier components of a physical test are \begin{equation}\label{eq:gm-explicit-J-components} \mathcal J_{\mathbf d,\chi,y}f =\frac1{N_1}\sum_{a\in A_{N_1}}\overline{\chi(a)} (\mathcal J P_S D_\varrho f)(\mathbf d,T_a y,\cdot) \quad\hbox{in }\mathcal H_\nu. \end{equation} Equations~\eqref{eq:gm-clean-exact-completion}-- \eqref{eq:gm-exact-fourier-block} give the exact pairing \begin{equation}\label{eq:gm-clean-fourier-pairing} \langle f,Cg\rangle_X =\sum_{\mathbf d\in\Xi}\sum_\chi\sum_{y\in Y}\pi(y) \left\langle \mathcal J_{\mathbf d,\chi,y}f, \mathcal B_{\mathbf d,\chi} \mathcal J_{\mathbf d,\chi,y}g\right\rangle_{\mathcal H_\nu}. \end{equation} Moreover, the exact isometry and Parseval identities give \begin{equation}\label{eq:gm-J-components-energy} \sum_{\mathbf d,\chi,y}\pi(y) \|\mathcal J_{\mathbf d,\chi,y}f\|_{\mathcal H_\nu}^2 =\|\mathcal J P_S D_\varrho f\|_T^2 \le C_{\rm cond}\|f\|_X^2. \end{equation} This is the normalization used at both ends of the pairing. \medskip\noindent\emph{The tilted law and the original free exclusions.} Put \(r_g(p)=b_p^{-1}\), and \(r(\mathbf a)=\prod_{g,i}r_g(a_{g,i})\). The map \[ (\mathcal V F)(\mathbf a)=\sqrt{r(\mathbf a)}F(\mathbf a) \] is an isometry from \(\mathcal H_\nu\) to the harmonic space \(\mathcal H_B\), and commutes with every slot permutation. On the shared-coordinate support, conjugation by \(\mathcal V\) changes a pattern's harmonic row kernel by the multiplier \begin{align*} \sqrt{\frac{r(\mathbf a)}{r(\mathbf b)}} \prod_{g\in\BB}\prod_{i\in U_{\nu,g}}r_g(b_{g,i}) &=\sqrt{\prod_{g\in\BB}\prod_{i\in U_{\nu,g}} r_g(a_{g,i})r_g(b_{g,i})}. \end{align*} The shared-coordinate factors cancel exactly. The multiplier lies in \([1,\Lambda^t]\), with \(t=(m+1)s_B\), so its difference from one has weighted row and reversed-column bounds at most \(K(\Lambda^t-1)\). For the exclusion error, fix a source array. A free draw in group \(g\) can coincide with one of its \(M\) source coordinates or one of the \(t_{\nu,g}\) newly integrated target coordinates. The remaining target coordinates are copied source coordinates. Under the harmonic laws, each of these events has probability at most \(\kappa_g=\max_{p\in\PP_g}\mu_g(p)\). The union bound gives \[ b_{\rm col}\ge \max_\nu\sum_{g\in\BB}|C_{\nu,g}|(M+t_{\nu,g})\kappa_g. \] The same calculation with source and target interchanged gives the reversed-column estimate. The tilt multiplier adds a factor at most \(\Lambda^t\). Weighted Schur estimates therefore show, uniformly in \(\Theta\), \begin{equation}\label{eq:gm-tilted-allowed-comparison} \left\|\mathcal V\widetilde{\mathcal T}^{\rm allow}_\zeta(\Theta) \mathcal V^{-1}-\mathcal T_\zeta(\Theta)\right\| \le K(\Lambda^t-1)+K\Lambda^t b_{\rm col}. \end{equation} Consequently, the ideal estimate and \eqref{eq:gm-clean-fourier-pairing}--\eqref{eq:gm-J-components-energy} give \[ \|C\|\le C_{\rm cond} \{\epsilon+K(\Lambda^t-1)+K\Lambda^t b_{\rm col}\}. \] The opposite orientation is the adjoint for the original mass. For a row kernel on \(\mathcal X\), that adjoint has coefficient \[ K^*(x,y)=\frac{m_X(y)}{m_X(x)}\overline{K(y,x)}. \] On the shared-coordinate support one has the exact active-mass identities \[ w_B(\mathbf a)\nu_{U_\nu}(\mathbf b) =w_B(\mathbf b)\nu_{U_\nu}(\mathbf a),\qquad D_{\nu,B}(\mathbf a,\mathbf r) =D_{\nu,B}(\mathbf b,\mathbf r). \] The first follows by separating the shared and unshared factors in \(w_B\). The second follows because every source label occurring in \(D_{\nu,B}\) is shared. The free-exclusion indicator is symmetric in the two endpoint arrays. Slot permutations preserve \(w_B\), and \(\pi(T_h\mathfrak m)=\pi(\mathfrak m)\). These equalities verify the weighted-adjoint formula term by term, including the original free law. Swapping endpoints conjugates the coefficient and phase, interchanges the two independent endpoint averages, and changes \(T_h\) to \(T_{-h}\). Thus the reverse Fourier block is explicitly \[ \mathcal B^-_{\mathbf d,\chi} =d^{-i\zeta}\sum_D e(-\theta kdD)\overline{\chi(kdD)}B_D^* =(\mathcal B^+_{\mathbf d,\chi})^*. \] It has the same norm, and the same completion and Parseval estimates therefore give the identical clean bound in both orientations. For \(P\), freeze the pattern, the free labels, the big part of the source permutation, and the entire target permutation. The remaining small source permutations choose one omitted slot in each small group, uniformly among \((J+1)^{s_S}\) choices. Let \(U\) be the product of the omitted primes, and let \(S_S\) be the product of all small source labels. A pending particle \((p,z)\), eligible at big dilation \(D_B\), can reach residue zero only if \[ zU+(\pm k)D_BS_S=0\pmod p. \] The second term is nonzero. Every omission product is below \(p\), since \[ U\le\exp(s_SL^{36/100})<\exp(L^{39/100})\le p. \] Unique factorization and the distinct small labels make these omission products distinct. Each eligible pending particle therefore permits at most one omission choice. A multiset of size at most \(B_0\) permits at most \(B_0\) choices. Newly stored particles have nonzero translated residue and supply no additional promotion choices. The positive full edge and its zero-retrieval version each have the row and reversed column bounds just computed. Their difference costs a factor \(2\). Averaging the source-supported kernels gives a row bound multiplied by \(B_0/(J+1)^{s_S}\), while preserving the column bound. Schur's test gives \[ \norm P\le2K C_{\rm row}C_{\rm mem} \sqrt{B_0/(J+1)^{s_S}}. \] The mass-weighted adjoint swaps store and retrieval factors and reverses the edge orientation. Applying the same argument to it gives the identical bound for \(S_1\). Adding the three bounds proves \eqref{eq:gm-complete-edge}. \end{proof} For fixed \(m,C_1\), \eqref{eq:gm-tilt-bounds} gives \(\Lambda^t-1=L^{O(1)}e^{-L^{39/100}}\) and the same type of bound for \(b_{\rm col}\). Also \[ C_{\rm cond},C_{\rm row}\le L^{1/5},\qquad C_{\rm mem}\le L^{C_m},\qquad C_m=\frac7{100}(m+1)\log\bigl(68(m+17)\bigr). \] The last bound follows by substituting \(\vartheta^{m+1}\ge1/2\) and \(\Lambda\le2\) in the Schur constant. If \(B_0=\lceil L^2\rceil\), the final term in \eqref{eq:gm-complete-edge} is at most \[ 4\sqrt2\,L^{C_1+1/5+C_m+1-(9/400)\log(J+1)}. \] Consequently, for every prescribed \(G>0\), a sufficiently large fixed \(J\), chosen after \(m,C_1,G\), gives \begin{equation}\label{eq:gm-good-edge} \norm E\le L^{-G} \quad\hbox{if}\quad \sup_\Theta\norm{\mathcal T_\zeta(\Theta)} \le L^{-(G+3)}. \end{equation} For example it suffices to require \[ \frac9{400}\log(J+1) \ge G+\max(C_1,0)+\frac15+C_m+4. \] The constants governing the powers of \(L\) have already been fixed. \subsection{The signed expansion and its boundary mass} Use \(B_0=\lceil L^2\rceil\), and let \[ \mathcal I=(\BB\times\{1,\ldots,M\}) \sqcup(\{0,\ldots,n-1\}\times\BB\times\{1,\ldots,M\}) \sqcup(\{0,\ldots,n\}\times\{0,\ldots,B_0-1\}). \] The three parts label initial births, fresh edge births in original slots, and ordered fresh ghost births. A history follows the order \[ G_0,E_0,G_1,E_1,\ldots,E_{n-1},G_n. \] It records each full edge choice and its store mask, both endpoint permutations, the original free tuple, the complete target labels and every fresh or retrieval choice. Each ghost records all retention counts and its ordered fresh batch. Stored, retained and retrieved occurrences preserve their earlier birth. The corresponding addresses record precisely the fresh occurrences. Assign a distinct symbol \(\bot_a\) to every unused address \(a\). For a history \(h\), let \(\widehat p_h(a)\) be its performed tagged prime, or \(\bot_a\) when unused. Define \[ \Delta_\sigma(h)= \prod_{a\in\mathcal I} \ind_{\widehat p_h(\sigma a)=\widehat p_h(a)},\qquad r(\sigma)=|\mathcal I|-\#\{\text{cycles of }\sigma\}. \] The cycle count includes the fixed points. The determinant identity gives \begin{equation}\label{eq:gm-determinant} \sum_{\sigma\in\operatorname{Sym}(\mathcal I)} \operatorname{sgn}(\sigma)\Delta_\sigma(h) =\ind_{\text{all performed birth primes are distinct}}. \end{equation} Indeed, the matrix with entries \(\ind_{\widehat p_h(a)=\widehat p_h(b)}\) is the identity when all values are distinct, and has two equal rows otherwise. The unused symbols contribute identity rows. Let \[ Q_S=\prod_{g\in\SSS}\prod_{p\in\PP_g}p,\qquad \tau_S=\prod_{g\in\SSS}V_g^{-M}. \] For each \(z\in[0,Q_S)\cap\Z\), let \(W_\sigma(z)\) be the sum of the original history weights multiplied by \(\Delta_\sigma\), with initial coefficient \[ L_z(x)=\ind_{\operatorname{position}(x)=z} \ind_{\mathrm{pending}(x)=\varnothing} \prod_{p\text{ initially active}}\frac{m_p}{V_{g(p)}} \] and terminal coefficient \[ R_z(x)=\ind_{\operatorname{position}(x)=z} \ind_{\mathrm{pending}(x)=\varnothing}. \] The terminal active labels and the terminal set of previously used primes are summed freely. Each \(W_\sigma(z)\) retains the operational zero guards and the factor \(\Delta_\sigma\). Global distinctness of performed births is supplied by \eqref{eq:gm-determinant} after the signed sum. Write \begin{equation}\label{eq:gm-normalized-rank} w_\sigma=\beta\frac{\tau_S}{Q_S} \sum_{0\le z1}(C\setminus\{a_C\}),\qquad \operatorname{piv}(a)=a_C\quad(a\in C\setminus\{a_C\}). \] Then \begin{equation}\label{eq:gm-hr-dependent-count} |\mathcal D_\sigma|=\sum_C(|C|-1)=r(\sigma),\qquad \operatorname{piv}(a)1/2=\varrho\). At an unprescribed target slot, the exact two alternatives, applied to a nonnegative future function \(F\), are \begin{equation}\label{eq:gm-hr-slot-action} \sum_{p\in\PP_g}\left\{ \nu_g(p)F(S,\mathcal R[a\mapsto p]) +\beta_r(p)S(p,0) F(S-[(p,0)],\mathcal R)\right\}. \end{equation} Terms with \(S(p,0)=0\) in the second summand are zero. The multiplicity \(S(p,0)\) is the original retrieval multiplicity. At a prescribed slot, the sum consists of the fresh term with the value in \eqref{eq:gm-hr-record-test}. The fresh part of \eqref{eq:gm-hr-slot-action}, with future weight \(\Phi_{k+1}\), is at most \(2\Phi_k(S)\). Each one-slot application has \(0\le k0\), take \(G=E+9\), and put \begin{equation}\label{eq:gm-rank-threshold} r_0=\left\lceil \frac{2(C_h+E+5)(n+1)\log L}{L^{39/100}}\right\rceil . \end{equation} For large \(L\), \[ |\mathcal I|^2\frac{64}{P_*} \le256L^8e^{-L^{39/100}} \le e^{-L^{39/100}/2}\le\frac12. \] The geometric sum and \eqref{eq:gm-high-rank} therefore give \[ \sum_{r(\sigma)\ge r_0}|w_\sigma| \le4L^{C_h(n+1)} e^{-r_0L^{39/100}/2} \le L^{-En}. \] For \(r0\) gives \begin{align} \left|\sum_{z\in[X,2X)\cap\Z} \ip{u_z}{(\mathcal A_k^{\zeta,\theta} (\mathcal A_k^{\zeta,\theta})^*)^Ru_z} -X\mathfrak m_n\right|&\le XL^{-En}, \label{eq:gm-crt-error}\\ |\mathfrak m_n-\mathfrak p_n|&\le L^{-En}. \label{eq:gm-peak-error} \end{align} For \eqref{eq:gm-crt-error}, fix all path choices. The active congruences have modulus with logarithm \(O_J(nT L^{46/100})=o(L)\). Only compatible active congruences contribute. Factor out their deterministic damping factors. The remaining independent-residue mean is at least \(q_{\rm act}^{-1}\exp(-C nT)\), where \(q_{\rm act}\) is the active modulus. Each remaining prime has hit probability at most \((n+1)/p=o(1)\), and the sum of these probabilities is \(O(nT)\). Expand the remaining damping products by two adjacent Bonferroni truncations at order \(C_E nT\). Their gap is bounded by the corresponding exponential-series tail, since the total reciprocal-prime intensity is \(O(nT)\). Increasing \(C_E\) gives relative error \(L^{-En}\). Every retained term is a CRT condition with modulus and total number of terms \(\exp(O_E(nT L^{46/100}))=\exp(o(L))\). Counting such a condition in an interval of length \(X\) has absolute error at most one. The resulting normalized error is \(\exp(-3L/4+o(L))\). The absolute row majorants sum the path choices at cost \(L^{O(n)}\), which this error absorbs. Coprimality makes multiplication by \(k\) bijective in every prime residue space. The buffer \eqref{eq:gm-period-buffer} supplies the stated position window for all these paths. For \eqref{eq:gm-peak-error}, apply the positive doubled row estimates with the weight \(16^{|\mathrm{pending}|}\). The visit factors satisfy \(1-\eta_j\le1/16\). A history exceeding \(B_0\) particles has at least \(B_0+1-nMs\) excess births after its possible edge stores. Since every group prime is at most \(U\), the doubled absolute edge row is bounded by \[ L^{C_1}(2048U^4)^{Ms}. \] The ordered ghost factorials bound the remaining birth sums by \(\exp(192s)\) per visit. With the same boundary calculation \eqref{eq:gm-boundary} and \(S_0\le2\), the total discarded normalized mass is therefore at most \[ 2\cdot2^{-B_0-1+nMs} \exp\!\bigl(192(n+1)s\bigr) \left\{L^{C_1}(2048U^4)^{Ms}\right\}^{n}. \] In particular it is bounded by \[ 2^{-B_0-1+nMs}\exp\!\bigl(O_{m,C_1,J}(nLT)\bigr). \] Since \(B_0\asymp L^2\), \(nLT=O(L^{38/25}\log L)=o(L^2)\), and \(nMs=O_J(L^{13/25}\log L)\), this bound is at most \(L^{-En}\) for every fixed \(E\). \begin{theorem}[Physical moment transference]\label{thm:gm-transference} Fix \(A>0\), \(m\ge1\) and \(C_1\ge0\). There is \(J_0\ge m\) such that for every fixed \(J\ge J_0\), and then for all sufficiently large \(L\), the following holds. Let a finite pattern family satisfy \[ C_{\nu,g}=\varnothing\ (g\in\SSS),\qquad |C_{\nu,g}|\le m\ (g\in\BB),\qquad \sum_\nu\norm{c_\nu}_\infty\le L^{C_1}. \] If \[ \sup_{\Theta\in\R}\norm{\mathcal T_\zeta(\Theta)} \le L^{-(A+13)}, \] then, with \(\mathcal W\) as in \eqref{eq:gm-window}, for every \(\theta\in\R\), every integer \(k\) satisfying \[ |k|\le\lfloor e^L\rfloor,\qquad p\nmid k\quad(p\in\textstyle\bigcup_g\PP_g), \] and every natural \(X\) with \(e^{3L/4}\le X\le e^{5L/4}\), \begin{equation}\label{eq:gm-physical-moment} \sum_{z\in[X,2X)\cap\Z} \ip{u_z}{(\mathcal A_k^{\zeta,\theta} (\mathcal A_k^{\zeta,\theta})^*)^Ru_z} \le X\bigl(L^{-A}\bigr)^{2R}. \end{equation} \end{theorem} \begin{proof} Take \(E=A+1\) and \(G=E+9=A+10\). Choose \(J_0\) by \eqref{eq:gm-good-edge}, using ideal precision \(G+3=A+13\). Lemma~\ref{lem:gm-rank-bounds} and \eqref{eq:gm-rank-threshold} give \eqref{eq:gm-signed-peak-bound}. Combining \eqref{eq:gm-crt-error}, \eqref{eq:gm-peak-error} and \eqref{eq:gm-signed-peak-bound} bounds the left side of \eqref{eq:gm-physical-moment} by \(4XL^{-(A+1)n}\). Since \(n=2R\ge2\) and \(L\ge4\), this is at most \(XL^{-An}\). The alternating path expansion here closes the integer position. Its initial and terminal label arrays are summed independently. Expanding the row action of \((\mathcal A_k^{\zeta,\theta} (\mathcal A_k^{\zeta,\theta})^*)^R\) gives exactly these paths, with the initial vertex mass \(\tau\) once. This proves that the quantity just bounded is the displayed physical root moment. \end{proof} \begin{theorem}[The constructed physical moment]\label{thm:gm-constructed-moment} For every \(A>0\), there exist \(m\ge1\) and positive \(q_*,h_*,x_*,C_1\), followed by an integer \(J_0\ge m\), with the following property. For every fixed \(J\ge J_0\) and all sufficiently large \(L\), there is a partition \(\BB=\BB_1\sqcup\BB_2\) and the actual coefficient family \eqref{eq:gm-signed-coefficient} such that \eqref{eq:gm-physical-moment} holds simultaneously for \[ |\zeta|\le L^2,\quad \theta\in\R,\quad |k|\le\lfloor e^L\rfloor,\quad p\nmid k\ (p\in\textstyle\bigcup_g\PP_g),\quad e^{3L/4}\le X\le e^{5L/4},\quad X\in\N. \] The family is chosen before \(\zeta,\theta,k,X\). \end{theorem} \begin{proof} Apply Theorem~\ref{thm:gm-ideal} with \(D=A+13\). Its \(m,q_*,h_*,x_*,C_1\) are fixed before \(J\). Choose \(J_0\) large enough for Theorem~\ref{thm:gm-transference} and for \(J_0\ge m\). For each fixed \(J\ge J_0\), choose the threshold in \(L\) after these fixed parameters. The partition and the coefficients then satisfy the complete ideal estimate for all the displayed frequencies. Theorem~\ref{thm:gm-transference} gives the conclusion. \end{proof} For an integer \(N>1\), the substitution \(L=\log N\) gives \(\lfloor e^L\rfloor=N\). Hence \(k=-N\) is included whenever the group primes are coprime to \(N\). The residue changes and the position buffer used above apply to this value of \(k\), with the same family and the same moment bound. \section{Reciprocal character energy} \label{ce:section} In this section the exponent of the center cutoff from Section~\ref{pc:section} is denoted by $d_0$. Thus \[ L=\log N,\qquad Q=\exp(L^{d_0}),\qquad y=\exp(\varepsilon L), \qquad 0<\varepsilon<\tfrac14,\quad 00$ are fixed. All powers of $L$ below have fixed exponents. Every auxiliary finite set and every coefficient array may depend on $L$. Write $F(n)$ for the invariant center of Section~\ref{pc:section}. For sufficiently large $N$ it satisfies \begin{equation}\label{ce:center} |F(n)|\le1,\qquad F(vw)=F(v) \quad\text{if every prime divisor of $w$ is at most $Q$}. \end{equation} The other marked groups are disjoint from $\PP_0$ and contain only primes at most $Q$. Their coupled coefficient is denoted by $O(n)$. With damping $0\le\vartheta\le1/2$, at most $T$ marks in each group, group masses at least $1/2$, at most $2\log L$ groups, and label coefficients of absolute value at most $L^E$, the factorial marked-weight bound gives \begin{equation}\label{ce:other-cap} |O(n)|\le L^{C_0},\qquad C_0=E+2\log(T!4^T). \end{equation} Indeed, the contribution of a group with $m\le T$ marks is at most \[ \frac{m!}{(1-\vartheta)^m V_g^m}\le T!4^T. \] Summing the coupled label coefficients once and multiplying these group bounds proves \eqref{ce:other-cap}. Both $C_0$ and $T$ are independent of the number of prime groups. \subsection{Supported parts and the reduced modulus} Define \[ u_r(n)=\prod_{p\mid r}p^{v_p(n)}. \] Every positive integer has the unique factorization $n=uv$ in which $u=u_r(n)$ and $(v,r)=1$. If $(n,N)=1$ and $(N,r)=1$, this becomes $(v,Nr)=1$. Put \begin{equation}\label{ce:quotient} g=(u,r),\qquad q=N\frac r g,\qquad qg=Nr. \end{equation} For $u$ supported on the primes dividing $r$, the integer $u/g$ is coprime to $q$. Its residue $\upsilon$ is therefore a unit modulo $q$. For every integer $m$ and every $h$ modulo $qg$, \begin{equation}\label{ce:phase-quotient} e\!\left(\frac{umh}{qg}\right) =e\!\left(\frac{\upsilon mh}{q}\right). \end{equation} The expression on the right depends only on $h\bmod q$, so a sum of its squared absolute value over $h\bmod qg$ is exactly $g$ times the corresponding sum over $h\bmod q$. For completeness, the coprimality assertion follows prime by prime. A prime dividing both $u/g$ and $r/g$ would occur in $u$ and $r$ to exponents both exceeding their minimum, which is impossible. Also $(u,N)=1$, since every prime divisor of $u$ divides $r$ and $(N,r)=1$. \subsection{The selected-prime arrays} Let $\psi\in C_c^\infty((0,\infty))$ have support in $[1/2,2]$ and $|\psi|\le1$. We use the reciprocal physical weight \begin{equation}\label{ce:physical-weight} W_{\beta,\zeta}(n)= \frac1n\psi(n/Z)e(\beta n)n^{i\zeta}\qquad(n\ge1). \end{equation} It satisfies $|W_{\beta,\zeta}(n)|\le2/Z$. Set $H_0=\lfloor8Z\rfloor$ and use the clipped dyadic intervals \[ a_j=\max(a,2^j),\qquad b_j=\min(b,2^{j+1}),\qquad \PP_j=(a_j,b_j]\cap\mathbb P\quad(0\le jr$, and their upper bound $Q$ is smaller than $e^{\eta L}$. Consequently they are also coprime to $u$. Suppose that $u$ is $Q$-smooth and that the residual scales satisfy \begin{equation}\label{ce:scale-band} e^{3L/4}\le\frac Z{up}\le e^{5L/4} \qquad(p\in\PP_0). \end{equation} The common residual coefficient is \[ R_u(v)=\vartheta^{\omega_{\PP_0}(v)}O(uv), \qquad |R_u(v)|\le L^{C_0}. \] It depends on the $Q$-smooth part of $v$. For a Dirichlet character $\chi$ modulo $q$, define \begin{equation}\label{ce:character-slice} S_{u,j}(\chi)=\frac1V\sum_{p\in\PP_j}\sum_{v\in\mathcal V_j} F(v)R_u(v)\, \frac{\psi(upv/Z)}{upv}\,e(\beta upv)(upv)^{i\zeta} \chi(p)\chi(v). \end{equation} The denominator $V$ in every slice is the mass of the complete group $\PP_0$. \subsection{Exact additive and multiplicative energy} Define the corresponding additive polynomial on $\mathbb Z/qg\mathbb Z$ by \[ A_u(h)=\frac1V\sum_{j7/8$, with the principal pole at $s=1$ excluded. The modulus is unrestricted. The logarithmic derivative and a smoothed Perron integral in this fixed half-plane give the following uniform prime estimate. For $q\le e^{2L}$, $|\tau|\le e^{3L}$, and $a_j\ge e^{L^\kappa}$, \begin{equation}\label{ce:prime-saving} \left|\sum_{p\in\PP_j}\chi(p)p^{i\tau}\right| \ll a_j\exp(-L^\kappa/512) \qquad(\chi\ne\chi_0). \end{equation} One way to obtain this form is first to prove \[ \left|\sum_{aB_0+1$ and split the integral at $|t|=L^{D_0}$. On the central interval, $|\zeta+2\pi t|\le e^{3L}$ for sufficiently large $L$. For every integer $k\ge2$, compact support and differentiation give \[ \int_{|t|>T}|\widehat\Phi_w(t)|\,dt \ll_k (1+|w|)^k T^{1-k},\qquad \int_{\R}|\widehat\Phi_w(t)|\,dt\ll(1+|w|)^2. \] Thus the tail has any prescribed negative power of $L$ after $k$ is chosen sufficiently large. In the tail estimate use $|\sum_{p\in\PP_j}\chi(p)p^{i\tau}|\le2a_j$ and \eqref{ce:interval-orthogonality}. The same cancellation of the physical length factors applies. Minkowski's inequality in the finite character space, followed by the displayed Fourier bounds, proves \begin{equation}\label{ce:nonprincipal} \frac{gq}{\varphi(q)} \sum_{\chi\ne\chi_0} \left|\sum_{j0). \end{equation} The choices of $D_0$, $k$, and the threshold for $L$ precede all finite coefficient and residue data. \subsection{The principal character and the total residue bound} For $p\in\PP_j$ put $Z_p=Z/(up)$. The principal summand in \eqref{ce:character-slice} can be written as \[ \frac{(up)^{i\zeta}}Z \sum_{\substack{v\ge1\\(v,Nr)=1}} F(v)R_u(v)\widetilde\psi(v/Z_p)e(\beta upv)v^{i\zeta}. \] The positive unit indices at which the cutoff is nonzero lie in $\mathcal V_j$, as proved above. The principal cancellation theorem of Section~\ref{pc:section} applies with scale $Z_p$. Its test has bounded support and polynomially bounded amplitude and variation, uniformly in $p$, by \eqref{ce:scale-band} and the fixed bounds on $\beta Z$ and $\zeta$. Its smooth-part coefficient is $R_u$, whose bound is \eqref{ce:other-cap}. Increasing the accuracy in that theorem yields, for every $A_0>0$, a bound $L^{-A_0}/(up)$ for the absolute value of the last display. Consequently \begin{equation}\label{ce:principal} |S_{u,j}(\chi_0)| \ll_{A_0}\frac{L^{-A_0}}u \frac1V\sum_{p\in\PP_j}\frac1p \le\frac{L^{-A_0}}u. \end{equation} Since $(N,r)=1$, the roughness of $N$ gives \[ \frac q{\varphi(q)} \le\frac N{\varphi(N)}\,\frac{r/g}{\varphi(r/g)} \le2r\le2L^D \] for sufficiently large $N$. Combining \eqref{ce:principal}, $K\le L^{K_0}$, and \eqref{ce:nonprincipal} in the exact identity \eqref{ce:exact-energy}, with $A_0$ chosen after the desired accuracy, proves the local estimate \begin{equation}\label{ce:total-residue} \boxed{\displaystyle \sum_{h\bmod Nr}|A_u(h)|^2\ll_A\frac{(u,r)}{u^2}L^{-A}.} \end{equation} All powers lost in the principal and nonprincipal estimates are fixed before $L$ tends to infinity. \subsection{Aggregation and the deleted parts} Let $U>0$ and suppose that the smoothness of $u$, \eqref{ce:square-height}, and \eqref{ce:scale-band} hold uniformly for every supported part $u\le U$ retained in the physical sum. Sum over these supported parts. By the triangle inequality in $\ell^2(\mathbb Z/Nr\mathbb Z)$, \begin{equation}\label{ce:outer-energy} \left(\sum_{h\bmod Nr}\left|\sum_u A_u(h)\right|^2\right)^{1/2} \ll_A L^{-A/2}\sum_{\substack{u\ge1\\p\mid u\Rightarrow p\mid r}} \frac{\sqrt{(u,r)}}u. \end{equation} The last sum has a convergent Euler product. If $p^a\parallel r$, its local factor is \[ \sum_{k=0}^{a}p^{-k/2}+ p^{a/2}\sum_{k>a}p^{-k}\le p^{2a}. \] For $p\ge3$ this follows by extending the first geometric sum to infinity and comparing with $p^2$. For $p=2,a=1$ the factor is $1+\sqrt2<4$, and for $a\ge2$ it is bounded by $1/(1-2^{-1/2})<16\le2^{2a}$. Thus the product is at most $r^2$, and \begin{equation}\label{ce:retained-residue} \sum_{h\bmod Nr}\left|\sum_u A_u(h)\right|^2\ll_A r^4L^{-A}. \end{equation} The discarded terms are controlled in physical coefficient space. Fix $M\ge0$ and $C\in\R$, independently of $L$. For a coefficient sequence $c_n$ supported on $1\le n\le H_0$ with $|c_n|\le M L^C/Z$, Parseval gives \begin{align} \int_{\R/\Z}\left|\sum_{\substack{n\le H_0\\(n,N)>1}} c_ne(n\theta)\right|^2d\theta &\le\frac{M^2L^{2C}}{Z^2} H_0\sum_{p\mid N}\frac1p\ll_A Z^{-1}L^{-A}, \label{ce:nonunit-delete}\\ \int_{\R/\Z}\left|\sum_{\substack{n\le H_0\\u_r(n)>U}} c_ne(n\theta)\right|^2d\theta &\le\frac{M^2L^{2C}}{Z^2}H_0U^{-1/2}r^2. \label{ce:large-delete} \end{align} For the first estimate use $\sum_{p\mid N}p^{-1}\le \omega(N)e^{-\eta L}$. For the second, Rankin's inequality and the same supported-factor decomposition give \[ \#\{n\le H_0:u_r(n)>U\} \le H_0\sum_{\substack{u>U\\p\mid u\Rightarrow p\mid r}}\frac1u \le H_0U^{-1/2}\prod_{p\mid r}(1-p^{-1/2})^{-1} \le H_0U^{-1/2}r^2. \] Taking $U=\exp(L^c/4)$ with fixed $c>0$ makes \eqref{ce:large-delete} at most $Z^{-1}L^{-A}$ for every fixed $A$, after its threshold is increased. These estimates are uniform in the phases of the original coefficients. \subsection{Returning to the original selected mark} The selected first-order weight is \[ w_0(n)=\frac{\omega_{\PP_0}(n) \vartheta^{\omega_{\PP_0}(n)-1}}{V}, \] with the value zero when $\omega_{\PP_0}(n)=0$. The original endpoint coefficient is \[ c_n=F(n)w_0(n)O(n)W_{0,\zeta}(n). \] Expanding the mark, and then using the invariance of $F$, gives \[ c_n=\frac{W_{0,\zeta}(n)}V \sum_{\substack{p\in\PP_0\\p\mid n}} F(n/p)\vartheta^{\omega_{\PP_0}(n)-1}O(n). \] If $p^2\nmid n$, disjointness of the other prime groups gives $O(n)=O(n/p)$, and $\omega_{\PP_0}(n)-1=\omega_{\PP_0}(n/p)$. Replacing the residual factor by $\vartheta^{\omega_{\PP_0}(n/p)}O(n/p)$ therefore changes only the terms with $p^2\mid n$. The resulting common coefficient is the one used in \eqref{ce:character-slice}. This replacement is valid with every retained mask inside the energy. Here is a direct quantitative bound. Write the selected-prime average with probability weights $1/(Vp)$, and consider its fixed-$p$ error. Its absolute value is at most $4pL^{C_0}/Z$, it is supported on multiples of $p^2$, and $(p^2,Nr)=1$. Among these multiples, each residue modulo $Nr$ occurs at most $1+H_0/(p^2Nr)$ times. By \eqref{ce:square-height}, this is at most $2H_0/(p^2Nr)$. Cauchy--Schwarz in each residue and then additive orthogonality give a fixed-$p$ residue energy at most \[ \frac{32H_0^2L^{2C_0}}{p^2Z^2} \le\frac{2048L^{2C_0}}{p^2}. \] Jensen's inequality for the probability weights $1/(Vp)$ bounds the energy of the full replacement by \begin{equation}\label{ce:replacement} \frac{4096L^{2C_0}}{P_{\min}^2},\qquad P_{\min}=\min\PP_0\ge e^{L^\kappa}. \end{equation} The argument also applies after an additive modulation and after multiplication by any mask of absolute value at most one. Thus \eqref{ce:replacement} has arbitrary logarithmic saving. The elementary inequality $|z+w|^2\le2|z|^2+2|w|^2$, together with \eqref{ce:retained-residue} at a higher accuracy, transfers the retained residue estimate to the original marked endpoint. Finally, $w_0(n)\le4$ follows from $V\ge1/2$ and $0\le\vartheta\le1/2$, so $|c_n|\le8L^{C_0}/Z$. The deletion estimates \eqref{ce:nonunit-delete} and \eqref{ce:large-delete} consequently apply to this original endpoint. Let $\mathfrak M_r$ be the union of the neighborhoods of radius $\Delta_r$ about the rationals with denominator $Nr$. For the retained coefficient, integrating the complete residue estimate over $|\beta|\le\Delta_r$ bounds its energy on $\mathfrak M_r$ by $4\Delta_r E_r$, where $E_r$ is the uniform residue-energy bound. Write $c_{\mathrm{ret},r}$, $c_{\mathrm{bad}}$, and $c_{\mathrm{large},r}$ for the three coefficients in the exact decomposition $c=c_{\mathrm{ret},r}+c_{\mathrm{bad}}+ c_{\mathrm{large},r}$. Subadditivity over denominator sets and the three-term square inequality give \[ \int_{\bigcup_{r\le R}\mathfrak M_r}|\widehat c(\theta)|^2\,d\theta \le 12\sum_{r\le R}\Delta_r E_r +3R E_{\mathrm{bad}}+3\sum_{r\le R}E_{\mathrm{large},r}. \] Here each deleted term is restricted to the whole set $\mathfrak M_r$ before its integral is bounded by its full-circle energy. This uses no multiplicity factor from the individual rational neighborhoods. With $R$ and $Z\Delta_r$ bounded by fixed powers of $L$, increasing the local accuracies proves an upper bound $Z^{-1}L^{-A}$ for every prescribed $A>0$. \section{The comparison terms and the centered correlation} \label{ca:section} Throughout this section, $L=\log N$, the integer $N$ is $N^\varepsilon$-rough, and $0<\varepsilon<1/4$ is fixed. We use the groups and the signed family of Section~\ref{sec:graph-moment}. Write $\vartheta=1/256$ for the damping parameter, $Q=\exp(L^{.49})$ for the smoothness threshold, and \[ Q_0=\lceil L^{q_*}\rceil,\qquad h=L^{-h_*},\qquad \xi=L^{-x_*} \] for the parameters of the product-cell kernels. The function $F_0$ is the real invariant center of Section~\ref{pc:section}. In particular, $|F_0|\le1$ and $F_0(dn)=F_0(n)$ for every positive integer $n$ and every positive $Q$-smooth integer $d$. All prime labels below have their original probability weights $\mu_g(p)=1/(V_gp)$. Every sum over free labels includes repeated primes. The injectivity condition on an active endpoint is retained until the explicit restriction estimate below. We extend a function on positive integers to the negative endpoint by putting $\widetilde H(-n)=H(n)$ for $n>0$ and $\widetilde H(n)=0$ for $n\ge0$. \subsection{A common target and the reciprocal normalization} Let $X=2Y$ be an even positive integer and put \[ T_X=[-6X,-1]\cap\Z. \] We take a real smooth function $\psi$, supported in $(1/2,2)$, with $|\psi|\le1$. The soft source is $F_0(x)\psi(x/X)$ for $x>0$. Its two hard source intervals are $[Y,2Y)$ and $[X,2X)$, and both use the target $T_X$. If $x>0$, $\chi(x/(x-y))\ne0$, and $\operatorname{supp}\chi\subset[1/4,3/4]$, then $y<0$ and $|y|\le3x$. Consequently $x<2X$ implies $y\in T_X$. Thus the projection to $T_X$ may be inserted into every cutoff pairing on this soft source. This projection is kept in the ensuing frequency integrals. For a hard source scale $Y$ it has radius $12Y$, and for scale $X$ it has radius $6X$. For a single pattern $\nu$, write $\mathcal R_{\nu,X}(\zeta)$ for its normalized physical pairing, with step $-N$, additive parameter zero, source \[ d_\vartheta(x)\frac{X}{x}F(x), \qquad F(x)=F_0(x)\psi(x/X)(x/N)^{i\zeta}, \] and target $d_\vartheta(y)\ind_{T_X}(y)\widetilde H(y)$. The pairing is divided by $X$. Inner products are conjugate-linear in the first variable. The definitions also apply to a hard source restriction of $F$. For $\zeta=-2\pi t$ this is the frequency that occurs in the Mellin formula below. Fix a comparison pattern $\nu=(A,B)$. In group $g$, put \[ s_g=|S_{\nu,g}|,\qquad c_g=|C_{\nu,g}|,\qquad t_g=1+c_g=M-s_g. \] A shared tuple $\mathbf s$ has product $D$ and probability \begin{equation}\label{ca:shared-law} D=\prod_{g,i\in S_{\nu,g}}s_{g,i},\qquad \mu_{\rm sh}(\mathbf s) =\prod_{g,i\in S_{\nu,g}}\frac1{V_gs_{g,i}} =\frac{\sigma_\nu}{D},\qquad \sigma_\nu=\prod_gV_g^{-s_g}. \end{equation} The empty tuple has product and probability one. The two free tuples $\alpha,\beta$ occupy $A,B$, have their product laws $\mu_A,\mu_B$, and have products $a=a(\alpha)$ and $b=b(\beta)$. These two tuples exhaust the replaced coordinates. Therefore the edge equations are exactly \begin{equation}\label{ca:residual-edge} x=Dn,\qquad y=D(n-Nab). \end{equation} For an integer $n\ne0$, let $\Lambda_\nu(n)$ be the finite set of ordered lists which choose, in each group $g$, $t_g$ distinct primes dividing $|n|$. For a function $E$ of those lists, define \begin{equation}\label{ca:marked-endpoint} \mathcal G_E(n)= \sum_{\lambda\in\Lambda_\nu(n)} E(\lambda)\prod_g\frac{\vartheta^{\omega_g(n)-t_g}}{V_g^{t_g}}. \end{equation} An empty list sum is zero. Equivalently, one can sum over the fixed finite space of all ordered distinct prime lists and insert the condition that every label divides $|n|$. This equivalence will permit us to take the complete endpoint sum before a square norm. Here is the normalization in the change of variables. Suppose the shared labels are distinct and are coprime to both residual endpoints. The number of group-$g$ prime factors of $Dn$ is $s_g+\omega_g(n)$, and the corresponding statement holds at $D(n-Nab)$. The two damping factors from the test vectors and the two from the edge give \[ \vartheta^{\sum_g(\omega_g(n)-t_g)} \vartheta^{\sum_g(\omega_g(n-Nab)-t_g)}. \] The mass and the edge normalization satisfy \begin{equation}\label{ca:normalization} \prod_g V_g^{-M}V_g^{-t_g} =\sigma_\nu\prod_gV_g^{-2t_g}. \end{equation} The reciprocal source then gives the exact identity \begin{equation}\label{ca:reciprocal} \frac1X\sigma_\nu\frac{X}{Dn} =\frac{\mu_{\rm sh}(\mathbf s)}n. \end{equation} In particular, the residual source carries $1/n$. The physical endpoint lists decompose uniquely into their prescribed shared coordinates and their residual ordered lists. Conversely, these data reconstruct the two physical endpoint lists whenever the shared labels are distinct, are coprime to the residual endpoints, and the free labels avoid both endpoint lists. These are precisely the good-label conditions in this reindexing. The coefficient in \eqref{eq:gm-signed-coefficient} becomes \begin{equation}\label{ca:coefficient-dictionary} -(-1)^{|A|+|B|} \mathcal K_A\bigl(a,P_A(\lambda_{\rm target})\bigr) \mathcal K_B\bigl(b,P_B(\lambda_{\rm source})\bigr). \end{equation} The first kernel is evaluated at the target list, and the second at the source list. The remaining phase is $(Dab)^{i\zeta}$. These identities apply to the endpoint-permutation averages as well. Changing variables by a slot permutation preserves the physical vertex set, its mass, and both endpoint functions, which depend only on the integer position. Hence each permuted pairing equals its unpermuted counterpart. \subsection{Removing the finite restrictions} We record bounds that apply to a hard source $[X,2X)$, then add the two hard pieces of a soft source. Set \[ \mathcal E_\nu= \prod_g\frac{t_g!}{(1-\vartheta)^{t_g}V_g^{t_g}},\qquad S_\nu=\sum_gs_g,\qquad C_\nu=\sum_gc_g. \] The total absolute residual list weight at either endpoint is at most $\mathcal E_\nu$. Indeed, \[ (w)_t\vartheta^{w-t} =t!\binom wt\vartheta^{w-t} \le\frac{t!}{(1-\vartheta)^t} \quad(w\ge t), \] by the binomial theorem. Here $(w)_t=w(w-1)\cdots(w-t+1)$. Let $P$ be a common lower bound for the primes and $D_{\max}$ an upper bound for every shared product. Suppose the two kernel factors are bounded by $M_A,M_B$ and the two position functions by $B_F,B_H$. Before division by $X$, the difference between the retained residual sum and the unrestricted residual sum has absolute value at most \begin{align} &\mathcal E_\nu^2 B_FM_AM_BB_H \left\{(C_\nu+2S_\nu) \left(\frac{2X}{P}+D_{\max}\right) +2X\sum_g\frac{s_g^2+s_gc_g}{PV_g}\right\}. \label{ca:finite-restrictions} \end{align} The unrestricted sum includes every shared tuple with the law \eqref{ca:shared-law}, and every free tuple with its original law. To see the terms in \eqref{ca:finite-restrictions}, fix the shared and free tuples. A forbidden incidence at either residual endpoint imposes one congruence modulo a prime $p\ge P$ on an interval of length at most $2X/D$. Its number of solutions is at most $2X/(Dp)+1$. The absolute summand, after the reciprocal is bounded on the hard source, is at most $D B_FM_AM_BB_H\mathcal E_\nu^2$. Thus one such incidence contributes at most the common factor times $(2X/P+D)$. There are at most $C_\nu+2S_\nu$ incidences of this kind. A coincidence between prescribed labels has probability at most \[ \sum_{p\in\PP_g}\mu_g(p)^2 \le\frac1{PV_g}. \] Summing over the possible shared--shared and shared--free pairs gives the last term of \eqref{ca:finite-restrictions}. A union bound is valid when several of the incidences occur simultaneously. There is also the part of the physical pairing in which a shared prime divides a residual endpoint. Its normalized absolute value is \begin{equation}\label{ca:overlap-bound} \ll M_AM_B B_FB_H\,T_\nu\sqrt{\Delta_\nu}, \qquad \Delta_\nu= \sum_g\frac{s_g}{V_g}\sum_{p\in\PP_g}\frac1{p^2} \le\frac{S_\nu}{P}, \end{equation} where $T_\nu$ is the physical row bound for this pattern. For completeness, the squared mass of the source restricted to these incidences is at most a fixed multiple of $B_F^2X\Delta_\nu$. This follows by counting the multiples of the shared label once in the shared harmonic average and once in the position sum. The same assertion holds for the target. Apply Cauchy--Schwarz to the source-incidence and target-incidence parts separately, use the row bound for the edge, and add them. The unrestricted source and target squared masses are bounded by fixed multiples of $X$, which proves \eqref{ca:overlap-bound}. For the actual family, $t_g\le m+1$, $V_g\ge1/2$ and $|G|\le2\log L$. Thus $\mathcal E_\nu$ and $T_\nu$ are bounded by fixed powers of $L$. Also $M_A,M_B\le Q_0^2/\xi$, $S_\nu\le2J\log L$, $C_\nu\le m|\BB|$, and, for every fixed $J$, \begin{equation}\label{ca:product-bounds} P\ge\exp(L^{.27}),\qquad 1\le D\le D_{\max}\le\exp(L^{.60}) \end{equation} eventually. Divide \eqref{ca:finite-restrictions} by $X$, and use $X\ge\exp(.75L)$. Together with \eqref{ca:overlap-bound}, this gives \begin{equation}\label{ca:restriction-saving} |\mathcal R_{\nu,X}-\mathcal U_{\nu,X}| \le C_J L^{C_*} \left\{\exp\bigl(-\tfrac12L^{.27}\bigr) +\exp(L^{.60}-.75L)\right\}. \end{equation} Here $\mathcal U_{\nu,X}$ is the normalized unrestricted expression, $C_*$ depends only on the fixed construction parameters, and $C_J$ may depend on $J$. In particular the error is $O(L^{-A})$ for every fixed $A$. For the raw branch the same reindex uses empty selected sets and auxiliary kernel factors $-1$ and $1$. Their product with $-(-1)^0$ is the raw coefficient one. Thus the same conclusion holds for that branch. Both estimates hold uniformly in $\zeta$. \subsection{Finite features and complete endpoint sums} For a nonempty selected set $C$, let $\mathscr F_C$ consist of the pairs $(j,\chi)$ such that $j$ is an occupied original product cell and $\chi\in\mathcal C(Q_0)$. Define \begin{align} u_{C,j,\chi}(v)&=\ind_{j(v)=j}\overline{\chi(v)},\notag\\ v_{C,j,\chi}(v)&= \ind_{j(v)=j}\ind_{\nu_{C,j}\ge\xi}\nu_{C,j}^{-1}\chi(v). \label{ca:features} \end{align} Terms with $\nu_{C,j}=0$ are zero. Then \begin{equation}\label{ca:feature-expansion} \mathcal K_C(d,v)=\sum_{\lambda\in\mathscr F_C} u_{C,\lambda}(d)v_{C,\lambda}(v),\qquad |u_{C,\lambda}|\le1,\quad |v_{C,\lambda}|\le\xi^{-1}. \end{equation} This is a finite identity obtained directly from \eqref{eq:gm-cell-kernel}. For $\lambda\in\mathscr F_A$ and $\rho\in\mathscr F_B$, form the complete endpoints \[ G_{A,\lambda}(n)=\mathcal G_{v_{A,\lambda}\circ P_A}(n), \qquad G_{B,\rho}(n)=\mathcal G_{v_{B,\rho}\circ P_B}(n). \] Fix a shared tuple, put $Z=X/D$, and set \begin{align} f_{\rho,D}(n)&= \frac{\overline{F(Dn)}}n G_{B,\rho}(n),\notag\\ g_{\lambda,D}(r)&= G_{A,\lambda}(r)\ind_{T_X}(Dr)\widetilde H(Dr). \label{ca:complete-endpoints} \end{align} The source is supported in $(Z/2,2Z)$, and the target in $[-6Z,0)$. For a pair of features define \begin{align} \mathcal C_{D,\lambda,\rho} =\sum_{\alpha,\beta}\mu_A(\alpha)\mu_B(\beta) a^{i\zeta}u_{A,\lambda}(a) b^{i\zeta}u_{B,\rho}(b) \sum_n f_{\rho,D}(n)g_{\lambda,D}(n-Nab). \label{ca:product-correlation} \end{align} The coefficient dictionary, the two finite feature expansions, and \eqref{ca:reciprocal} give \begin{equation}\label{ca:unrestricted-identity} \mathcal U_{\nu,X}(\zeta) =-(-1)^{|A|+|B|} \sum_{\mathbf s}\mu_{\rm sh}(\mathbf s)D^{i\zeta} \sum_{\lambda\in\mathscr F_A,\,\rho\in\mathscr F_B} \mathcal C_{D,\lambda,\rho}. \end{equation} All rearrangements here are finite. In particular, $G_{A,\lambda}$ and $G_{B,\rho}$ include every residual label before any analytic estimate is applied. We will use their full square masses. Put \[ C_m=(m+1)!4^{m+1},\qquad B_2=2x_*+2\log C_m+1. \] For any endpoint feature $E$ with $|E|\le\xi^{-1}$, let $W_\nu(n)$ be the endpoint sum \eqref{ca:marked-endpoint} with $E=1$. The binomial bound gives $W_\nu(n)\le C_m^{|G|}$ and $|\mathcal G_E(n)|\le\xi^{-1}W_\nu(n)$. Moreover, for $T\ge1$, \begin{equation}\label{ca:marked-first-moment} \sum_{0<|n|\le T}W_\nu(n)\le2T. \end{equation} Indeed, after fixing a distinct list with product $d$, its multiples contribute at most $2T/d$, and its damping is at most one. Summing $1/d$ over the lists gives at most $\prod_gV_g^{t_g}$, cancelling the normalizing denominator. Consequently \[ \sum_{0<|n|\le T}|\mathcal G_E(n)|^2 \le2T\xi^{-2}C_m^{|G|}. \] Since $1/n\le2/Z$ on the source, this proves, for sufficiently large $L$, \begin{equation}\label{ca:endpoint-energies} \sum_n|f_{\rho,D}(n)|^2\le Z^{-1}L^{B_2},\qquad \sum_r|g_{\lambda,D}(r)|^2\le ZL^{B_2}. \end{equation} For example, bounding the positive source height by $3Z$ gives $24\xi^{-2}C_m^{|G|}/Z$, and bounding the target height by $7Z$ gives $14\xi^{-2}C_m^{|G|}Z$. The extra power in $B_2$ absorbs these constants. Choose one group $\PP_0$ in the low block. It is untouched by every comparison pattern, so $t_0=1$, and neither endpoint feature depends on its label. The complete source factors as \begin{equation}\label{ca:selected-low-group} G_{B,\rho}(n)=w_0(n)O_\rho(n),\qquad w_0(n)=\frac{\omega_{\PP_0}(n) \vartheta^{\omega_{\PP_0}(n)-1}}{V_0}. \end{equation} The coefficient $O_\rho$ keeps all the remaining group sums together. It depends only on the $Q$-smooth part of $n$ and is bounded by a fixed power of $L$. By the invariance of $F_0$, the source in \eqref{ca:complete-endpoints} is, up to a constant of modulus one, \begin{equation}\label{ca:arithmetic-source} F_0(n)w_0(n)O_\rho(n)\frac{\psi(n/Z)}n n^{i\tau}, \qquad |\tau|\le L^2. \end{equation} The selected-prime expansion in Section~\ref{ce:section} therefore has dilation one. All other marked factors remain in $O_\rho$. \subsection{The product dyads and their major and minor arcs} Partition the free product values into intervals $[U,2U)$ and $[V,2V)$, where $U,V$ are powers of two. Every summand of \eqref{ca:product-correlation} in such a pair has $n\in(Z/2,2Z)$ and $n-Nab\in[-6Z,0)$. Hence a nonzero product dyad satisfies \begin{equation}\label{ca:product-dyad-geometry} \frac Z8.07\log(m!2^m)$. This argument includes products with repeated prime factors. Restriction to a product dyad gives atom bounds $L^{C_a}/U$ and $L^{C_a}/V$, and total masses at most one. Fix a desired minor-arc exponent $B>0$ and put \begin{equation}\label{ca:major-parameters} \Gamma=2C_a+2B+8,\qquad R_0=\lceil L^\Gamma\rceil, \qquad S=L^{d_f+\Gamma},\qquad \Delta_r=\frac{S}{NrUV}\quad(1\le r\le R_0). \end{equation} Let $\mathfrak M$ be the union, on $\R/\Z$, of the arcs of radius $\Delta_r$ around every rational with denominator $Nr$, for $1\le r\le R_0$. The free-label multiplier of the dyad is \[ M(\theta)=\sum_{\alpha,\beta}\mu_A(\alpha)\mu_B(\beta) a^{i\zeta}u_{A,\lambda}(a)b^{i\zeta}u_{B,\rho}(b) e(-Nab\theta), \] where the two sums are restricted to their dyads. Its absolute value is at most one everywhere. \begin{lemma}\label{ca:minor-multiplier} For sufficiently large $L$, $|M(\theta)|\le L^{-B}$ on $\mathfrak M^c$, uniformly in both endpoint features and $\zeta$. \end{lemma} \begin{proof} Put $T=UV/S$, which tends to infinity. Dirichlet approximation gives coprime integers $a_0,r$, with $1\le r\le T$, such that \[ |N\theta-a_0/r|\le\frac1{rT},\qquad |N\theta-a_0/r|\le\frac1{r^2}. \] If $r\le R_0$, division by $N$ puts $\theta$ in the arc of radius $S/(NrUV)$ about $a_0/(Nr)$. Hence $r>R_0$ on the minor arcs. We recall the elementary weighted bilinear bound in this normalization. For product distributions of mass at most one, supported in $[U,2U)$ and $[V,2V)$, with atoms at most $K/U$ and $K/V$, and for unit coefficients, a reduced approximation $|\alpha-a_0/r|\le r^{-2}$ gives \begin{equation}\label{ca:bilinear-bound} \left|\sum_{a,b}c_ad_b e(\alpha ab)\right| \le4K\left\{\frac1V+\frac1r+ \frac{1+\log(2r)}U+ \frac{r(1+\log(2r))}{UV}\right\}^{1/2}. \end{equation} One obtains this by Cauchy--Schwarz in the $a$ variable. Expanding the square in $b$, the geometric sum in $a$ is bounded by $\min(2U,\|\alpha(b-b')\|^{-1})$. Sorting the differences modulo $r$ and summing the reciprocal distances $j/r$ gives the last three terms in braces. The diagonal gives $1/V$. The atom bounds supply the two factors of $K$ before the square root. The same proof first groups the original tuples by product, so it applies to our distributions. Apply \eqref{ca:bilinear-bound} with $\alpha=-N\theta$ and $K=L^{C_a}$. The two terms involving $1/U$ or $1/V$ are smaller than every fixed negative power of $L$. The other terms are bounded by $L^{-\Gamma}$, since $r>R_0$, $r\le UV/S$, and $1+\log(2r)\le L^{d_f}$. The margin eight in $\Gamma$ absorbs the constant and proves the claim. \end{proof} \begin{lemma}\label{ca:major-energy} For every fixed $A_1>0$, the complete source in \eqref{ca:arithmetic-source} satisfies \begin{equation}\label{ca:major-energy-bound} \int_{\mathfrak M}|\widehat f_{\rho,D}(\theta)|^2\,d\theta \le Z^{-1}L^{-A_1} \end{equation} for sufficiently large $L$, uniformly in the shared tuple, the two features, the retained product dyad, and $|\zeta|\le L^2$. \end{lemma} \begin{proof} We verify the parameters for the complete selected-mark estimate in Section~\ref{ce:section}. The chosen low group has \[ V_0\ge\tfrac12,\qquad \exp(L^{.27})\le p\le\exp(L^{.36})\quad(p\in\PP_0). \] All its primes are coprime to $Nr$, since $N$ is $N^\varepsilon$-rough and $r\le R_0$ is bounded by a fixed power of $L$. Keep the canonical $r$-supported part $u$ only when $u\le U_0=\exp(L^{.39}/4)$. With $H_0=\lfloor8Z\rfloor$, we have \begin{equation}\label{ca:height-check} p^2uNr\le H_0. \end{equation} Indeed $NUV<8Z$ by \eqref{ca:product-dyad-geometry}, whereas $p^2ur/(UV)$ tends to zero uniformly. The sharper lower bound $UV\ge\tfrac14\exp(2L^{.39})$ bounds its logarithm by $2L^{.36}-\tfrac74L^{.39}+O(\log L)$, which tends to minus infinity. Thus the left side of \eqref{ca:height-check} is eventually at most $4Z$, and its integrality gives the displayed inequality. Likewise $Z/(up)\in[\exp(.75L),\exp(1.25L)]$ eventually, after using the interior physical scale and \eqref{ca:product-bounds}. Delete the $N$-nonunits and the terms whose $r$-supported part exceeds $U_0$. Their full-circle energies are $Z^{-1}L^{-A'}$ for every fixed $A'$, by \eqref{ce:nonunit-delete} and \eqref{ce:large-delete}. The coefficient cap required there follows from \eqref{ca:selected-low-group}. These deletions occur in the complete source coefficient. For a retained $u$, write the positive source integer as $upv$, with $(v,Nr)=1$, and set $g=(u,r)$ and $q_r=N(r/g)$. Since $(N,r)=1$, the integer $u/g$ is a unit modulo $q_r$, and \[ e\left(\frac{upva_0}{Nr}\right) =e\left(\frac{(u/g)pva_0}{q_r}\right). \] Every residue modulo $q_r$ occurs $g$ times as $a_0$ runs modulo $Nr$. The exact character identity \eqref{ce:exact-energy} therefore has the factor $gq_r/\varphi(q_r)$. The principal character is bounded by Theorem~\ref{pc:principal-unit-cancellation} and Corollary~\ref{pc:oscillatory-tests}, with dilation one. The remaining coefficient is the entire $O_\rho$. For a nonprincipal character, use the dyadic prime slices and the reciprocal Mellin identity \eqref{ce:mellin}. Its external factor is $1/Z$. The original $V_0$ normalizes every slice. Corollary~\ref{ai:twisted-ranges} applies because $q_r\le e^{2L}$ and the truncated frequencies are at most $e^{3L}$. The fixed smooth profile has arbitrarily rapid Fourier-tail decay. The residual orthogonality estimate \eqref{ce:interval-orthogonality} controls that tail with the same quotient factor. It follows from \eqref{ce:total-residue} that the complete residue energy for this $u$ is at most $(u,r)u^{-2}L^{-A'}$ for any prescribed $A'$. Minkowski and \eqref{ce:outer-energy} give the full retained energy at most $r^4L^{-A'}$. The selected-prime square replacement is valid with both deletion masks inside its coefficient, by \eqref{ce:replacement} and \eqref{ca:height-check}. Finally, \eqref{ca:product-dyad-geometry} and \eqref{ca:major-parameters} give $Z\Delta_r\le8S/r$. Thus both $R_0$ and $Z\Delta_r$ have fixed polynomial bounds. The major-set cover and the three-part deletion inequality at the end of Section~\ref{ce:section}, with $A'$ increased, prove \eqref{ca:major-energy-bound}. This accounts for the full residue multiplicity, the totient factor, and every prime slice. \end{proof} For finite sequences use the Fourier convention $\widehat f(\theta)=\sum_nf(n)e(n\theta)$. Finite orthogonality gives the exact identity \begin{equation}\label{ca:fourier-comparison} \mathcal C_{D,\lambda,\rho}^{U,V} =\int_{\R/\Z}\widehat f_{\rho,D}(\theta) \widehat g_{\lambda,D}(-\theta)M(\theta)\,d\theta. \end{equation} The superscript denotes restriction to the two free product dyads. Apply Cauchy--Schwarz on $\mathfrak M$ and $\mathfrak M^c$, using $|M|\le1$ on the former and Lemma~\ref{ca:minor-multiplier} on the latter. Parseval and \eqref{ca:endpoint-energies} yield \begin{equation}\label{ca:one-feature-bound} |\mathcal C_{D,\lambda,\rho}^{U,V}| \le L^{(B_2-A_1)/2}+L^{B_2-B}. \end{equation} Both exponents can be made arbitrarily negative after the kernel parameters have been fixed. \subsection{Summing every feature and every comparison pattern} For a selected product, $\log a\le C_m'\log L\,L^{.46}$. It follows that the number of occupied product dyads is at most $L^{1.46}$. The number of occupied logarithmic cells is at most $C_m'\log L\,L^{.46}/h+2$. Since $|\mathcal C(Q_0)|\le Q_0^2$, eventually \begin{equation}\label{ca:feature-count} |\mathscr F_C|\le L^{h_*+2q_*+.46+4}. \end{equation} These counts are for the full product spaces. The mass threshold $\xi$ only removes terms from the endpoint features. Put \[ C_{\rm sum}=2m\log2+ 2(h_*+2q_*+.46+4)+2(1.46)+1. \] The number of nonraw patterns is at most $2^{m|\BB|}\le L^{2m\log2}$. Thus the product of this count, both feature counts, and both dyad counts is at most $L^{C_{\rm sum}-1}$. Given $A>0$, choose $B\ge B_2+A+C_{\rm sum}+3$ and $A_1\ge B_2+2(A+C_{\rm sum}+3)$ in \eqref{ca:one-feature-bound}. Sum it over all features and all retained product dyads. Then average over the shared law, whose mass is exactly one. The phase $D^{i\zeta}$ and the sign in \eqref{ca:unrestricted-identity} have modulus one. This proves \begin{equation}\label{ca:all-comparisons} \sum_{\nu\ne0}|\mathcal U_{\nu,X}(\zeta)|\le L^{-A-1} \end{equation} eventually. Adding \eqref{ca:restriction-saving} for the two hard source pieces and all patterns gives \begin{equation}\label{ca:physical-comparisons} \sum_{\nu\ne0}|\mathcal R_{\nu,X}(\zeta)|\le L^{-A} \qquad(|\zeta|\le L^2). \end{equation} All choices in this summation occur after $m,q_*,h_*,x_*$ and $J$. They change the arithmetic precision and its threshold. The graph family and its frequency range stay fixed. \subsection{Using the full physical moment} We spell out the moment-to-pairing step with the common target. Let a finite weighted graph have integer positions, and suppose every edge has displacement $kd$ with $k\ne0$ and $|d|\le\mathcal B$. For its position roots $u_n$, let $T_R=\sum_{n\in I}\langle u_n,(AA^*)^Ru_n\rangle$. If $f=\sum_{n\in I}a_nu_n$ and $|a_n|\le1$, then \begin{equation}\label{ca:lattice-pairing} |\langle f,Ag\rangle| \le\sqrt3\,(\mathcal B+2)^{1/(2R)} \|g\|\,\|f\|^{1-1/R}T_R^{1/(2R)}. \end{equation} To prove this, partition each residue class modulo $|k|$ into successive blocks of $b=\lceil\mathcal B\rceil$ positions. Write $f_j$ for the source in a block and restrict $g$ to that block and its two neighbors. Every coordinate of $g$ belongs to at most three such neighborhoods. Spectral H\"older for the positive operator $AA^*$ gives \[ \|A^*f_j\|\le\|f_j\|^{1-1/R} \langle f_j,(AA^*)^Rf_j\rangle^{1/(2R)}. \] Cauchy--Schwarz in the at most $b$ roots of a block bounds its last quadratic form by $b$ times the sum of its individual root moments. H\"older in the blocks, with exponents $2$, $2R/(R-1)$ and $2R$, now proves \eqref{ca:lattice-pairing}. Orthogonality of the position fibers gives $\sum_j\|f_j\|^2=\|f\|^2$, and the three-neighborhood overlap gives the factor $\sqrt3$. Apply this to a hard source $[Z_0,2Z_0)$ of the actual physical graph. The root coefficient is $d_\vartheta(n)(Z_0/n)F(n)$, of modulus at most one on the physical vertices. Counting the ordered endpoint labels by their products gives source and common-target squared masses at most $24Z_0$. Thus both norms are at most $5\sqrt{Z_0}$. The constructed moment theorem gives $T_R\le Z_0(L^{-E})^{2R}$. Substitution into \eqref{ca:lattice-pairing}, followed by division by $Z_0$, yields \begin{equation}\label{ca:hard-physical-response} |\mathcal R_{{\rm full},Z_0}(\zeta)| \le25\sqrt3\,(\mathcal B+2)^{1/(2R)}L^{-E}. \end{equation} Here $R=\lceil L^{.52}\rceil$ and $\log\mathcal B=O_J(L^{.46}\log L)$, so the middle factor is at most two eventually. The powers of $Z_0$ cancel exactly. For the soft source, add the estimates at $Z_0=Y$ and $Z_0=X$, using $T_X$ in both. The identities $Y^{-1}(Y/x)=X^{-1}(X/x)=1/x$ show that their sum is the original normalized soft pairing. In particular, \begin{equation}\label{ca:soft-full-response} |\mathcal R_{{\rm full},X}(\zeta)|\le100\sqrt3 L^{-E} \qquad(|\zeta|\le L^2). \end{equation} The source cutoff in the arithmetic argument is still $\psi(x/X)$. The two hard restrictions have been summed before \eqref{ca:arithmetic-source} is used. Choose $E=30$ before invoking Theorem~\ref{thm:gm-constructed-moment}. That theorem chooses the kernel parameters and then a lower bound for $J$. Fix $J$ afterward. Equation~\eqref{ca:soft-full-response} is then at most $L^{-27}$ eventually. Put $C=2m\log2$, and choose the arithmetic precision so that every comparison term is at most $L^{-(27+C)}$. There are at most $L^C$ such terms, so their sum is at most $L^{-27}$. Choose each of the two hard raw restriction errors at precision $L^{-27}$ as well. The full graph is the sum of its raw and comparison branches. Hence the normalized unrestricted raw expression satisfies \begin{equation}\label{ca:raw-low-frequency} |\mathcal U_{0,X}(-2\pi t)|\le4L^{-27}\le L^{-26} \qquad(|t|\le L) \end{equation} for sufficiently large $L$. The fixed choice $|t|\le L$ is valid because $2\pi L\le L^2$ eventually. \subsection{Mellin inversion and the global dyadic sum} Put \begin{equation}\label{ca:one-mark} W(n)=\prod_g\frac{\omega_g(n)\vartheta^{\omega_g(n)-1}}{V_g} \quad(n\ge1), \end{equation} where a factor with $\omega_g(n)=0$ is zero. The raw branch has no free labels and has $t_g=1$ in every group. Its unrestricted expression therefore simplifies to \begin{align} \mathcal U_{0,X}(-2\pi t) =\sum_{\mathbf s}\mu_{\rm sh}(\mathbf s) \sum_{n\ge1}&\frac{W(n)W(|n-N|)}n F_0(n) \psi(Dn/X)\ind_{T_X}(D(n-N))\notag\\ &\quad\cdot\widetilde H(D(n-N))e\bigl(t\log(n/N)\bigr). \label{ca:raw-frequency-identity} \end{align} The value at $n=N$ is zero. In obtaining this identity, the shared factor $D^{-2\pi it}$ multiplies the conjugated source phase $(Dn/N)^{2\pi it}$, giving $(n/N)^{2\pi it}$. Let $\chi$ be a fixed real smooth function supported in $(1/4,3/4)$, and put \begin{equation}\label{ca:mellin-profile} \Phi(u)=e^u\chi(e^u),\qquad \widehat\Phi(t)=\int_\R\Phi(u)e(-tu)\,du. \end{equation} This is a smooth compactly supported function on $\R$. Fourier inversion gives \[ \int_\R\widehat\Phi(t)e\bigl(t\log(n/N)\bigr)\,dt =\frac nN\chi(n/N). \] Multiplying \eqref{ca:raw-frequency-identity} by $\widehat\Phi(t)$ and integrating is legitimate because its sums are finite. On the support of the resulting expression, $N/4L}|\widehat\Phi(t)|\,dt \le L^{-K}\int_\R |t|^K|\widehat\Phi(t)|\,dt. \] The last integral is finite. Therefore the tail in \eqref{ca:raw-mellin} is smaller than any prescribed negative power of $L$ after choosing $K$. This choice follows the fixed kernel and $J$. Only its constant and the final threshold depend on $K$. The low-frequency bound \eqref{ca:raw-low-frequency} is $L^{-26}$. Its integral against $|\widehat\Phi|$, and the tail just estimated, give \begin{equation}\label{ca:one-soft-dyad} \left|\int_\R\widehat\Phi(t) \mathcal U_{0,X}(-2\pi t)\,dt\right| \le L^{-24} \end{equation} for every active soft source scale. Choose $\psi$ to be a smooth dyadic partition. More explicitly, let $\eta$ be smooth, equal to one on $(-\infty,1]$, equal to zero on $[2,\infty)$, and valued in $[0,1]$, and set $\psi(v)=\eta(v)-\eta(2v)$. For $2\le x\le2^K$, \begin{equation}\label{ca:dyadic-partition} \sum_{j=1}^K\psi(x/2^j) =\eta(x/2^K)-\eta(x)=1. \end{equation} Take $K=1+\lceil2L/\log2\rceil$ and $X_j=2^j$. Every shared product satisfies $D\le\exp(L^{.60})\le\exp(L/20)$ eventually. On the support of $\chi(n/N)$ this puts $Dn$ in $[2,e^{2L}]$ eventually, so \eqref{ca:dyadic-partition} applies. If the $j$th summand is nonzero, \[ \frac N8K}e_j((\delta_p)_p) &\le e^{-K}\prod_{p\in\mathcal P'}(1+e\delta_p)\\ &\le\exp\!\left(-K+e\sum_{p\in\mathcal P'}\delta_p\right) \le L^{-22}. \end{align*} For large $L$, every $\delta_p\le1/2$. The inequality $\log(1-t)\ge-2t$ for $0\le t\le1/2$ gives \begin{equation}\label{pos:tuple-mean-lower} \mu\ge\exp\!\left(-2\sum_{p\in\mathcal P'}\delta_p\right) \ge L^{-12}. \end{equation} Also \[ \log A\le2sL^{46/100}\le4L^{46/100}\log L, \qquad |\mathcal P'|\le e^{L^{46/100}}, \] so \eqref{pos:crt-boundary-error} gives $B_K\le\exp(O(L^{46/100}\log L))$. The lower truncation therefore bounds \eqref{pos:marked-tuple-sum} from below by \[ \frac{|I|}{A}(\mu-L^{-22})-B_K. \] Since $|I|\ge e^{L/2}/2$, it follows uniformly in the marked primes, the target residue and the interval that \[ L^{-22}\le\frac\mu4, \qquad B_K\le\frac{|I|\mu}{4A} \] for all sufficiently large $L$. The lower Bonferroni bound, the mean tail estimate and these two inequalities prove \eqref{pos:tuple-half-mean}. Sum \eqref{pos:tuple-half-mean} over the marked choices with their original coefficient $\prod_gV_g^{-2}$. The mean factors across groups. Its factor for a group $g$ is \begin{equation}\label{pos:group-mean} \beta_g=\sum_{\substack{p,r\in\PP_g\\p\ne r}} \mu_g(p)\mu_g(r) \prod_{\ell\in\PP_g\setminus\{p,r\}} \left(1-\frac{2(1-q)}\ell\right). \end{equation} The same logarithmic inequality shows that the product in this sum is at least $e^{-4V_g}$. Moreover, \[ \sum_{\substack{p,r\in\PP_g\\p\ne r}}\mu_g(p)\mu_g(r) =1-\sum_{p\in\PP_g}\mu_g(p)^2 \ge1-\frac1{V_g\min\PP_g}\ge\frac12 \] eventually. Hence $\beta_g\ge\tfrac12e^{-4V_g}$, and therefore \begin{equation}\label{pos:interval-half-model} \sum_{n\in I}W(n)W(N-n) \ge\frac{|I|}{2}\prod_g\beta_g \ge |I|\,2^{-(s+1)}\exp\!\left(-4\sum_gV_g\right). \end{equation} Here the reciprocal factor $A^{-1}$ in the CRT mean has supplied one factor $p^{-1}$ for each marked prime. In combination with $V_g^{-2}$, these are exactly the harmonic probabilities in \eqref{pos:group-mean}. Finally, $\sum_gV_g\le3s/2$, $s\le2\log L$ and $L\ge e$ give \[ 2^{-(s+1)}\exp\!\left(-4\sum_gV_g\right) \ge e^{-7s-1}\ge e^{-14\log L-1}\ge L^{-15}. \] This proves \eqref{pos:interval-bound}. \end{proof} Let $\chi$ be the fixed smooth cutoff used in the comparison section. We use \begin{equation}\label{pos:cutoff-properties} \begin{gathered} 0\le\chi\le1,\qquad \chi(1-t)=\chi(t),\\ \chi(t)=0\quad(t\notin(1/4,3/4)),\qquad \chi(t)=1\quad(1/3\le t\le2/3). \end{gathered} \end{equation} \begin{lemma}\label{pos:marked-pair-mass} For every sufficiently large $N$ that is $N^\varepsilon$-rough, \begin{equation}\label{pos:marked-pair-lower} \sum_{00. \end{equation} Since $Q\le y$ for large $N$, this $F_0$ is the centered function $F$ in \eqref{pc:model-extension}. \begin{lemma}\label{pos:model-positive} For sufficiently large $N$, \[ c_\varepsilon\le\mathcal M(x)\le1\qquad(x>0), \qquad c_\varepsilon\le m(n)\le1\qquad(n\ge1). \] Both $f_y$ and $m$ are invariant under multiplication by a positive $Q$-smooth integer. \end{lemma} \begin{proof} For $e^{L/2}\le x\le e^{2L}$, Lemma~\ref{pc:model-properties} gives \[ \mathcal M(x) =\rho\!\left(\frac{\log x}{\varepsilon L}\right) +O_\varepsilon\bigl(L^{-1/50}(\log L)^2\bigr). \] The argument of $\rho$ is at most $2/\varepsilon$, and $\rho$ is nonincreasing. The error is eventually at most $\rho(2/\varepsilon)/2$, so $\mathcal M(x)\ge c_\varepsilon$. The upper bound on this interval is also part of Lemma~\ref{pc:model-properties}. Outside the interval, $\mathcal M(x)=\rho(1/\varepsilon)$, which belongs to $[\rho(2/\varepsilon),1]$. This proves both displayed bounds. If $D$ is $Q$-smooth, then $(Dn)^\sharp=n^\sharp$, so $m(Dn)=m(n)$. Since every prime factor of $D$ is at most $Q\le y$, the integer $Dn$ is $y$-smooth exactly when $n$ is $y$-smooth. Thus $f_y(Dn)=f_y(n)$ as well. \end{proof} For real functions $F,G$ on the positive integers, write \begin{equation}\label{pos:correlation} \mathcal C_N(F,G)=\frac1N\sum_{00$ is fixed and $L^{-7}\longrightarrow0$, \[ 2L^{-22}<\frac{c_\varepsilon^2}{4}L^{-15} \] for all sufficiently large $N$. Combining \eqref{pos:baseline-lower}, \eqref{pos:two-errors} and \eqref{pos:decomposition} yields \begin{equation}\label{pos:positive-correlation} \mathcal C_N(f_y,f_y)>0. \end{equation} Every summand in this last correlation is nonnegative. Hence some integer $n$ with $07/8$}, preprint, September 30, 2026. \href{https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf}{Electronic manuscript}. \bibitem{graphs} OpenAI, \emph{Weighted dilation graphs, smooth shifted primes and totient fibers}, preprint, September 24, 2026. \href{https://github.com/openai/math/blob/4eaee87548250b2682affda7d05d947c05554bae/preprints/Weighted-Dilation-Graphs-Smooth-Shifted-Primes-and-Totient-Fibers-September-24-2026/paper.pdf}{Electronic manuscript}. \end{thebibliography} \end{document}