\section{The M\"obius side: the exact anchor and its square-root refinement}\label{ms:sec:intro} Two facts frame this paper. The first is an identity, valid for every real $x\ge1$: \begin{equation}\label{ms:eq:anchor} \sum_{d\le x}\mu(d)\Bigl\lfloor\frac xd\Bigr\rfloor=\sum_{n\le x}\sum_{d\mid n}\mu(d)=1 . \end{equation} The summands have size $x/d$; the sum is always exactly $1$. This is the M\"obius orthogonality $\sum_{d\mid n}\mu(d)=[n=1]$ in its rawest form, and it is the engine of Legendre's sieve. The second fact is that the Riemann hypothesis is the square-root refinement of \eqref{ms:eq:anchor}. Writing $\{y\}=y-\lfloor y\rfloor$, \begin{equation}\label{ms:eq:Phi} \Phi(x)=\sum_{d\le x}\mu(d)\Bigl\{\frac xd\Bigr\}=x\sum_{d\le x}\frac{\mu(d)}d-1, \end{equation} and RH is equivalent to $\sum_{d\le x}\mu(d)/d\ll x^{-1/2+\varepsilon}$, that is, to \begin{equation}\label{ms:eq:rh} \Phi(x)\ll x^{1/2+\varepsilon} \end{equation} (see \cite[\S14.25--14.27]{T}; the equivalent statements for $M(x)=\sum_{d\le x}\mu(d)$ and for $\sum\mu(d)/d$ are classical, and Franel and Landau \cite{FL} recast them as the equidistribution of the Farey fractions). The prime number theorem gives only $\Phi(x)\ll x\exp(-c(\log x)^{3/5-\varepsilon})$. So the question ``how far is RH?''\ has, in this language, a concrete form: \emph{how is the cancellation in \eqref{ms:eq:Phi} organized, which parts of it can be proved, and exactly which part cannot?} This paper answers the first two questions with theorems and measurements, and the third with a precise statement of the obstruction. The contributions, in order of appearance: \begin{enumerate} \item the $z$-smooth part of $\Phi$ is bounded, by an elementary complete-sieve argument, and the measurements locate the mass of the problem at the divisors $d\asymp x$ (Section~\ref{ms:sec:scales}); \item the long-run variance of the truncated sum obeys an exact, positive-definite identity, diagonalized by Jordan's totient \eqref{ms:eq:diag}; it identifies every constant observed in the data and shows that the gcd structure of $\mu$ cancels $46\%$ of the diagonal variance (Section~\ref{ms:sec:variance}); a decomposition of $\widetilde\Phi_D$ into orthogonal \emph{primitive sawtooths}, one per squarefree conductor, re-proves the identity and becomes the main tool of the paper (Proposition~\ref{ms:prop:primitive}); \item the distribution of $\widetilde\Phi_D$ is empirically Gaussian, out to $4.5$ standard deviations (Section~\ref{ms:sec:gauss}); \item the Gaussian defect of the fourth moment has an exact anatomy (Section~\ref{ms:sec:r4}): it splits into an intra-orbit part, computed exactly --- with the closed law $\varepsilon_4(p)=-(1-p^{-4})/120$ at prime conductors --- and a cross-orbit term $X(D)$. We prove that the conductor-$1$ orbit decouples completely (the classes carrying an integer frequency cancel identically in $X$) and that $X(p)=X(p-1)$ at every prime $p$, so the cross term moves only at composite squarefree conductors; the proofs are real-space identities needing no regularization, confirmed in exact rational arithmetic. Splitting $X$ into four sectors by conductor multiplicities, we prove the $(3,1)$ and $(2,2)$ sectors are $O(D\log^4D)$ unconditionally, prove the exact jump law of the $(2,2)$ sector at the conductors $2p$ (Theorem~\ref{ms:thm:2pjump}), prove a parity sieve that annihilates every sector term using an odd number of frequency slots of even conductor (Lemma~\ref{ms:lem:parity}), and prove $X_{211}\ll D^{3/2+o(1)}$ --- the first unconditional bound on a sector with three distinct conductors (Proposition~\ref{ms:prop:x211}). All four sectors are then computed to $D=800$ (Section~\ref{ms:sec:scale}): the conjectured object stays below $0.44$ in absolute value, and the growth of its absolute-value majorant indicates that, if the trend persists, the quadruple sector cannot be bounded by absolute values alone, locating exactly what kind of cancellation Conjecture~\ref{ms:conj:r4} still needs; \item a precise statement of why none of this reaches the Riemann hypothesis (Section~\ref{ms:sec:wall}, placed with the other walls in Part~V). \end{enumerate} The data reach $x=2\cdot10^7$ for the full sum, $D=3\cdot10^4$ for distributions, $10^8$ samples for the fourth moment, and exact computations over the full period $\mathrm{lcm}(1,\dots,D)$ for $D\le18$. Everything is reproducible from the ancillary code. Part~I carries the complementary, one-sided form of RH that motivates this part: there, RH is the statement that a weighted mean of the prime-counting error stays below the explicit constant $-\bigl(1+\frac\gamma2-\frac12\log4\pi\bigr)$ for ever; here we study the M\"obius side of the same coin. We do not prove the Riemann hypothesis, and no statement below should be read as progress towards it beyond what it literally says. Throughout, $B_1(y)=\{y\}-\frac12$ is the sawtooth, $\mu^2(k)=1$ marks squarefree $k$, $J_2(k)=k^2\prod_{p\mid k}(1-p^{-2})$ is Jordan's totient, and \[ \widetilde\Phi_D(x)=\sum_{d\le D}\mu(d)B_1\Bigl(\frac xd\Bigr),\qquad m_k(Y)=\sum_{\substack{m\le Y\\(m,k)=1}}\frac{\mu(m)}m \] are the truncated sawtooth sum and the restricted Mertens sums; $\Phi_D(x)=\sum_{d\le D}\mu(d)\{x/d\}$ is the plain truncation of \eqref{ms:eq:Phi}. ``Long-run'' averages, written $\langle\,\cdot\,\rangle=\lim_{T\to\infty}\frac1T\int_0^T(\cdot)\,dx$, exist because $\widetilde\Phi_D$ is periodic with period $\mathrm{lcm}(1,\dots,D)$. One convention is used silently throughout: every conditionally convergent sum over frequencies is a \emph{symmetric} (principal-value) limit, $\lim_{U\to\infty}\sum_{0<|n|\le U}$. This is the convergence in which $B_1(y)=\sum_{n\ne0}e(ny)/(-2\pi in)$ holds at every non-integer $y$, and all the moment computations below inherit it. \section{The smooth part is tame, and the mass sits at the large divisors}\label{ms:sec:scales} \begin{lemma}[the $z$-smooth part is bounded]\label{ms:lem:legendre} Fix $z\ge2$ and let $P(z)=\prod_{p\le z}p$. The contribution to $\Phi(x)$ of the $d$ free of prime factors $>z$ is \[ S_z(x)=\sum_{d\mid P(z)}\mu(d)\Bigl\{\frac xd\Bigr\}=x\prod_{p\le z}\Bigl(1-\frac1p\Bigr)-\#\{n\le x:(n,P(z))=1\}\qquad(x\ge P(z)), \] a periodic function of $x$ with period $P(z)$, mean $0$, and $|S_z(x)|\le2^{\pi(z)-1}$. \end{lemma} \begin{proof} A squarefree $z$-smooth $d$ divides $P(z)$, and for $x\ge P(z)$ all divisors of $P(z)$ are $\le x$, so the sum is finite and complete; the displayed identity is \eqref{ms:eq:anchor} relativized to $P(z)$ (Legendre's formula). Periodicity is that of each $\{x/d\}$; the mean of $\{x/d\}$ over a period is $\frac12$ and $\sum_{d\mid P(z)}\mu(d)=0$ for $z\ge2$; the bound is $\frac12\cdot\#\{d\mid P(z)\}$. \end{proof} Numerically $\max|S_z|=1.37,\ 3.03,\ 5.46$ for $z=7,13,19$ on $x\le2\cdot10^7$ (Figure~\ref{ms:fig:scales}(d)), far below the trivial bound. Whatever is hard in \eqref{ms:eq:rh}, it is not the smooth divisors. \begin{lemma}[the pairing $d\leftrightarrow pd$]\label{ms:lem:pairing} For any function $g$ and any prime $p$, \[ \sum_{d\le x}\mu(d)g(d)=\sum_{\substack{d\le x,\ p\nmid d}}\mu(d)\bigl[g(d)-g(pd)\,\mathbf1_{pd\le x}\bigr]. \] \end{lemma} \begin{proof} A squarefree $d$ is either coprime to $p$ or equals $pd'$ with $p\nmid d'$, and $\mu(pd')=-\mu(d')$. \end{proof} Iterating over primes turns the M\"obius sum into difference operators $(\mathrm I-T_p)$ applied to the kernel: the Euler product in operator form. Its statistical signature is visible in the data. Splitting $\Phi(x)$ into octaves $d\in[2^j,2^{j+1})$, over $120$ samples of $x$ near $2\cdot10^7$: \emph{(i)} every octave shows square-root cancellation with the same constant, $\mathrm{sd}_j\approx0.22\sqrt{2^j}$ for all $j\le22$ (the constant is identified in Remark~\ref{ms:rem:constants} below as $1/\sqrt{2\pi^2}=0.2251$); \emph{(ii)} the octaves are not independent: $\mathrm{Var}(\Phi)=0.40\sum_j\mathrm{Var}(\text{octave }j)$, with neighbouring octaves anticorrelated by as much as $-0.56$ --- the pairing of Lemma~\ref{ms:lem:pairing} seen as statistics; \emph{(iii)} truncations $\Phi_D(x)$ stay negligible until $D\approx x/30$: the mass sits at $d\asymp x$, the type~II range, where $\{x/d\}=x/d-k$ on $(\frac x{k+1},\frac xk]$ is piecewise smooth and each block reduces exactly to short Mertens sums, \[ \sum_{\frac x{k+1}1$ the function $x\mapsto\sigma_q(x/q)$ is constant on every interval $(j,j+1)$, $j\in\mathbb Z$. Consequently, for any function $g$ of integer period that is constant on unit intervals --- in particular any polynomial in such $\sigma$'s, with any conductors $>1$ --- \[ \widehat g(k)=0\quad\text{for every integer }k\ne0, \qquad \bigl\langle B_1(x)^m\,g(x)\bigr\rangle=\bigl\langle B_1^m\bigr\rangle\,\langle g\rangle\quad(m\ge0). \] \end{lemma} \begin{proof} $\sigma_q(x/q)=\sum_{t\mid q}(\mu(t)/t)B_1(tx/q)$ jumps only where $tx/q\in\mathbb Z$, i.e.\ at multiples of the integer $q/t$, and its slope is $\frac1q\sum_{t\mid q}\mu(t)=0$ for $q>1$. If $g$ has period $L$ and value $g_j$ on $(j,j+1)$, then $\widehat g(k)=\frac1L\sum_{j1$ be distinct squarefree conductors with multiplicities $e_1,\dots,e_k\ge1$. If $\sum_{i:\,2\mid q_i}e_i$ is odd, then \[ \bigl\langle\sigma_{q_1}^{e_1}\cdots\sigma_{q_k}^{e_k}\bigr\rangle=0 . \] \end{lemma} \begin{proof} If no $q_i$ is even the count is zero and there is nothing to prove; otherwise $L=\operatorname{lcm}(q_1,\dots,q_k)$ is squarefree and even, so $2\parallel L$. Split the product into two blocks, one factor against the rest. Both blocks are bounded periodic step functions, so Parseval applies with absolute convergence (Cauchy--Schwarz), and the coefficient of each block at a frequency $\xi$ is an absolutely convergent sum over the solutions of $\sum u_{ij}/q_i=\xi$ with every $u_{ij}$ coprime to its $q_i$ (Proposition~\ref{ms:prop:primitive}: each $\sigma_{q_i}$ is supported on the reduced fractions of denominator exactly $q_i$). The two blocks pair at opposite frequencies, so every nonzero contribution to the mean comes from a \emph{resonance} \[ \sum_{i=1}^{k}\sum_{j=1}^{e_i}\frac{u_{ij}}{q_i}=0,\qquad(u_{ij},q_i)=1 . \] Multiply by $L$ and reduce modulo $2$. For even $q_i$ the cofactor $L/q_i$ is odd and so is $u_{ij}$: the term contributes $1$. For odd $q_i$ the cofactor $L/q_i$ is even: the term contributes $0$. The left side is therefore $\equiv\sum_{i:2\mid q_i}e_i\pmod2$, odd by hypothesis, while the right side is $0$. No resonance exists, and the mean vanishes. \end{proof} The sieve is the $2$-adic mechanism of parts (iii)--(iv) of Lemma~\ref{ms:lem:supp}, promoted from supports to full means: the prime $2$ is the only prime with a single unit, so a resonance must use an \emph{even} number of frequency slots of even conductor. Applied to the sectors it halves the problem: \begin{corollary}[sector parities]\label{ms:cor:parity} In Proposition~\ref{ms:prop:sectors}: every $(3,1)$ term with $q$ even and $r$ odd vanishes, so by Lemma~\ref{ms:lem:supp}(i) the $(3,1)$ sector is supported on $r\mid q$ with $2\mid r$ whenever $2\mid q$; every $(2,1,1)$ term with $r\not\equiv s\pmod 2$ vanishes; every $(1,1,1,1)$ term with an odd number of even conductors vanishes. The $(2,2)$ sector is untouched, its multiplicities being even. \end{corollary} \begin{proof} Count the even slots: $3[2\mid q]+[2\mid r]$ is odd exactly when $q$ and $r$ have opposite parity --- the case $q$ odd, $r$ even is already void by Lemma~\ref{ms:lem:supp}(i), since then $r\nmid q$, leaving $2\mid q$, $2\nmid r$; $2[2\mid q]+[2\mid r]+[2\mid s]$ is odd exactly when $r\not\equiv s\pmod2$; $\sum_i[2\mid q_i]$ odd is the stated condition. \end{proof} The corollary is sharp in every clause: $\langle\sigma_6^3\sigma_3\rangle=0$ while $\langle\sigma_6^3\sigma_2\rangle=-\frac1{432}$; the means $\langle\sigma_q^2\sigma_r\sigma_s\rangle$ with $r\not\equiv s$ vanish identically while the all-odd $\langle\sigma_{15}^2\sigma_{21}\sigma_{35}\rangle=\frac{74}{55125}$ and $\langle\sigma_5^2\sigma_3\sigma_{15}\rangle=\frac2{1125}$ do not; and the \emph{first} admissible quadruple, $\{2,6,10,15\}$ at $D=15$, carries three even conductors and dies, $\langle\sigma_2\sigma_6\sigma_{10}\sigma_{15}\rangle=0$, while $\langle\sigma_2\sigma_6\sigma_{10}\sigma_{30}\rangle=-\frac1{1200}$ lives with four. Across the complete term lists to $D=800$ (ancillary \texttt{xsectors.py}), no multiset violating the parity condition carries a nonzero mean. The sieve also re-proves, in one line, the two vanishings of Proposition~\ref{ms:prop:ladder} --- $\langle\sigma_p\sigma_{2p}^3\rangle$ and $\langle\sigma_2\sigma_p\sigma_{2p}^2\rangle$ each use three even slots --- and several entries of the kill list in Theorem~\ref{ms:thm:2pjump}. \begin{lemma}[the coefficient bound]\label{ms:lem:coef} For squarefree $q>1$ and $0\ne\xi\in\frac1q\mathbb Z$, the Fourier coefficient of $\sigma_q^2$ at $\xi$ equals $-\widetilde T_q(q\xi)/(4\pi^2)$, where, with absolute convergence, \[ \widetilde T_q(N)=\sum_{\substack{u+u'=N\\ (uu',q)=1}}\frac1{uu'} =\frac{2\pi}{Nq}\sum_{a\in R_q(N)}\cot\frac{\pi a}q, \qquad R_q(N)=\{a\bmod q:\ (a(N-a),q)=1\}, \] and $|\widetilde T_q(N)|\le 4(1+\log q)/|N|$. \end{lemma} \begin{proof} The coefficient is the convolution of the coefficients of $\sigma_q$, and $\sum_u1/(|u||N-u|)<\infty$. The involution $u\mapsto N-u$ preserves the index set and swaps the partial fractions $\frac1{uu'}=\frac1N(\frac1u+\frac1{u'})$, so $\widetilde T_q(N)=\frac2N\lim_U\sum_{|u|\le U}1/u$ over the set (the involution maps the window $|u|\le U$ to $|u-N|\le U$, at a cost $O(N/U)\to0$), which is $\frac2N\sum_{a\in R_q(N)}\frac\pi q\cot\frac{\pi a}q$ by $\sum_{u\equiv a\,(q)}\frac1u=\frac\pi q\cot\frac{\pi a}q$. The bound follows from $\cot x\le1/x$ on $(0,\pi/2)$: $\sum_{a=1}^{q-1}|\cot\frac{\pi a}q|\le\frac{2q}\pi(1+\log q)$. \end{proof} \begin{theorem}[two sectors are tame]\label{ms:thm:tame} Unconditionally, \[ |X_{31}(D)|\ll D(\log D)(\log\log D)^{6}, \qquad |X_{22}(D)|\ll D(\log D)^{2}(\log\log D)^{4}. \] Hence $X(D)=X_{211}(D)+X_{1111}(D)+O(D\log^4D)$: the sectors with at most two distinct conductors obey the conjectured bound up to logarithmic factors, and Conjecture~\ref{ms:conj:r4} reduces, up to those factors, to the sectors with at least three distinct conductors. \end{theorem} \begin{proof} For $X_{31}$: by Lemma~\ref{ms:lem:supp}(i) the sum has $\ll\sum_{q\le D}d(q)\ll D\log D$ terms, each at most $|c_q|^3|c_r|\cdot\|\sigma_q\|_\infty^2(\langle\sigma_q^2\rangle\langle\sigma_r^2\rangle)^{1/2}\ll(\log\log D)^{6}$ by $\|\sigma_q\|_\infty\le\frac12\prod_{p\mid q}(1+p^{-1})$ and $|c_q|\le q/\varphi(q)$. For $X_{22}$: by Lemmas~\ref{ms:lem:supp} and~\ref{ms:lem:coef}, for $g=(q,r)>2$, \[ |\operatorname{Cov}(\sigma_q^2,\sigma_r^2)|\le\sum_{0\ne\xi\in\frac1g\mathbb Z}\frac{4(1+\log q)}{4\pi^2 q|\xi|}\cdot\frac{4(1+\log r)}{4\pi^2 r|\xi|} =\frac{2\zeta(2)}{\pi^4}\,\frac{g^2(1+\log q)(1+\log r)}{qr}, \] and summing $g^2/(qr)$ over $q=gq_1,r=gr_1\le D$ gives $\sum_{g\le D}\bigl(\sum_{n\le D/g}1/n\bigr)^2\ll D$, so the weighted total is $\ll D(\log D)^2(\log\log D)^4$. \end{proof} The same spectral method reaches into the $(2,1,1)$ sector. The key is the analogue of Lemma~\ref{ms:lem:coef} for a \emph{pair} of distinct conductors. \begin{lemma}[the pair-coefficient bound]\label{ms:lem:paircoef} Let $r\ne s$ be squarefree conductors $>1$, $g=(r,s)$, $r_1=r/g$, $s_1=s/g$. The Fourier coefficients of $\sigma_r(x/r)\,\sigma_s(x/s)$ are supported on the $\xi$ whose reduced denominator is divisible by $r_1s_1$ and divides $gr_1s_1$; at any $\xi\ne0$ with $rs\,\xi\in\mathbb Z$ the coefficient equals $-W_{r,s}(\xi)/(4\pi^2)$, where \[ W_{r,s}(\xi)=\sum_{\substack{u/r+v/s=\xi\\ (u,r)=(v,s)=1}}\frac1{uv} \qquad\text{(absolutely convergent),}\qquad |W_{r,s}(\xi)|\le\frac{2(1+\log rs)(r+s)}{rs\,|\xi|}. \] \end{lemma} \begin{proof} The coefficient at $\xi$ is the convolution $\sum_{u/r+v/s=\xi}\frac1{2\pi iu}\cdot\frac1{2\pi iv}$, and the sum converges absolutely because $v=(rs\xi-us)/r$ grows linearly in $u$. The support: for a prime $p\mid r_1$ we have $p\nmid us$ and $p\,\|\,r$, so $p$ survives at full power in the reduced denominator of $u/r+v/s$, and symmetrically for $s_1$; all denominators divide $\operatorname{lcm}(r,s)=gr_1s_1$. For the bound, put $N=rs\,\xi=us+vr\in\mathbb Z\setminus\{0\}$ and use the partial fractions $\frac1{uv}=\frac1N\bigl(\frac ru+\frac sv\bigr)$. The solution set is a union of residue classes modulo $rs$ in $u$ (the congruence $us\equiv N\ (\mathrm{mod}\ r)$, the condition $(u,r)=1$, and the condition $(v,s)=1$ are all determined by $u\bmod rs$), and $v$ runs over a union of classes modulo $rs$ as well. Evaluating each half in symmetric windows --- the window $|u|\le U$ transports to a window in $v$ centred at $N/r$, at a recentring cost $O(N/(Us))\to0$ --- the classical $\sum_{u\equiv a\,(M)}\frac1u=\frac\pi M\cot\frac{\pi a}M$ and $\sum_{a=1}^{M-1}|\cot\frac{\pi a}M|\le\frac{2M}\pi(1+\log M)$ give $|\sum'1/u|,\ |\sum'1/v|\le2(1+\log rs)$, hence $|W|\le2(1+\log rs)(r+s)/|N|$. \end{proof} \begin{proposition}[the $(2,1,1)$ sector is $O(D^{3/2+o(1)})$]\label{ms:prop:x211} Unconditionally, \[ |X_{211}(D)|\ \ll\ D^{3/2}\,(\log D)^{7/2}\,(\log\log D)^{O(1)} . \] \end{proposition} \begin{proof} A term $(q;rg}r_1^{-3/2}D\le4D/\sqrt g$.) \end{proof} This is far from the conjectured $O(D)$, but it is the first unconditional bound on a sector with three distinct conductors, and the proof shows exactly where the loss occurs: the absolute values surrender the sign of the cotangent sums in $W_{r,s}$. The data below suggest the truth is very much smaller. The remaining structure is best seen in the data. In exact arithmetic (ancillary \texttt{sectors.py}): \begin{center} \begin{tabular}{lcccccc} \toprule $D$ & $6$ & $10$ & $14$ & $15$ & $21$ & $22$\\ \midrule $X_{31}$ & $+0.00617$ & $+0.00712$ & $+0.00636$ & $+0.00810$ & $+0.00840$ & $+0.00727$\\ $X_{22}$ & $-0.00309$ & $-0.00429$ & $-0.00491$ & $-0.00045$ & $-0.00059$ & $-0.00084$\\ $X_{211}$ & $-0.00617$ & $-0.00712$ & $-0.00636$ & $+0.01077$ & $+0.01521$ & $+0.01465$\\ $X_{1111}$ & $0$ & $0$ & $0$ & $-0.00826$ & $-0.02155$ & $-0.02156$\\ \midrule $X$ & $-0.00309$ & $-0.00429$ & $-0.00491$ & $+0.01015$ & $+0.00147$ & $-0.00048$\\ \bottomrule \end{tabular} \end{center} Two striking facts: $X_{31}+X_{211}=0$ \emph{exactly} for all $D\le14$, so that below $D=15$ the cross term \emph{is} the $(2,2)$ sector; and the refuted $2p$ law lives entirely in $X_{22}$. Both have proofs. \begin{proposition}[the $2p$ ladder]\label{ms:prop:ladder} For every odd prime $p$, \[ \operatorname{Cov}(\sigma_p^2,\sigma_{2p}^2)=-\frac{p^2-1}{48\,p^4},\qquad \langle\sigma_2\sigma_p^2\sigma_{2p}\rangle=\frac{p^2-1}{96\,p^3},\qquad \langle\sigma_2\sigma_{2p}^3\rangle=-\frac{p^2-1}{128\,p^3}, \] \[ \langle\sigma_p\sigma_{2p}^3\rangle=\langle\sigma_2\sigma_p\sigma_{2p}^2\rangle=0, \qquad\text{and in particular}\qquad 4\langle\sigma_2\sigma_{2p}^3\rangle+3\langle\sigma_2\sigma_p^2\sigma_{2p}\rangle=0 . \] Consequently the joint $(3,1)+(2,1,1)$ contribution of the cluster $\{2,p,2p\}$ equals \[ 12\,c_2c_{2p}\,\langle\sigma_2\sigma_p^2\sigma_{2p}\rangle\Bigl(c_p^2-\frac{c_{2p}^2}4\Bigr), \] which vanishes --- for \emph{any} value of $c_2$ --- whenever $m_p(D/p)=\frac12\,m_{2p}(D/2p)$. \end{proposition} \begin{proof}[Proof of Proposition~\ref{ms:prop:ladder}] On $(j,j+1)$, $0\le j<2p$, the three functions take the explicit values \[ \sigma_p=v_j=\frac{2(j\bmod p)+1-p}{2p},\qquad \sigma_2=-\frac{(-1)^j}4,\qquad \sigma_{2p}=w_j=\frac{2j+1-2p}{4p}+\frac{(-1)^j}{4p}-\frac{v_j}2 \] (the last from $B_1(t\,\frac{2j+1}{4p})$, $t\mid2p$). Each identity is a sum over $j$ of a polynomial in $j,(-1)^j,v_j$, \emph{defined by these formulas for every odd $p$}; splitting $j$ by the Chinese remainder pair $(j\bmod2,\,j\bmod p)$ and applying Faulhaber's formulas, each side, cleared of its fixed power of $p$, becomes a polynomial in $p$ of degree at most $24$. The identities hold in exact arithmetic at the twenty-nine odd values $3\le p\le59$ (ancillary \texttt{ladder.py}, which also checks the value formulas against the true $\sigma_p,\sigma_{2p}$), hence identically in $p$; specializing to odd primes gives the statement. \end{proof} \begin{lemma}[double-ladder orthogonality]\label{ms:lem:dladder} For distinct odd primes $r\ne p$, \[ \langle\sigma_r\sigma_{2r}\sigma_p\sigma_{2p}\rangle=0 . \] \end{lemma} \begin{proof} On $(j,j+1)$ write $\varepsilon=(-1)^j$ and $\rho=j\bmod r$. From $j\bmod 2r=\rho+r\,\frac{1-\varepsilon(-1)^\rho}2$, the value formula of Proposition~\ref{ms:prop:ladder} splits as $\sigma_{2r}=A_r(\rho)+\varepsilon B_r(\rho)$ with $B_r(\rho)=\frac1{4r}-\frac{(-1)^\rho}4$, and $\sigma_r=v_r(\rho)$. As $j$ runs over $2rp$ consecutive integers the triple $(\varepsilon,\,j\bmod r,\,j\bmod p)$ is uniform on the product (Chinese remainders), so averaging the product $v_r(A_r+\varepsilon B_r)\,v_p(A_p+\varepsilon B_p)$ kills the $\varepsilon$-odd part and factorizes the rest over the two independent residues: \[ \langle\sigma_r\sigma_{2r}\sigma_p\sigma_{2p}\rangle =\overline{v_rA_r}\;\overline{v_pA_p}+\overline{v_rB_r}\;\overline{v_pB_p}. \] Both one-prime means vanish: $\overline{v_rA_r}=\langle\sigma_r\sigma_{2r}\rangle=0$ by orthogonality, and $\overline{v_rB_r}=\frac1{4r}\overline{v_r}-\frac1{4r}\sum_{\rho