\documentclass[11pt]{amsart} \usepackage[margin=1.1in]{geometry} \usepackage{amsmath,amssymb,amsthm,booktabs,mathtools} \usepackage[expansion=false]{microtype} \usepackage[colorlinks=true,linkcolor=blue!50!black,citecolor=blue!50!black,urlcolor=blue!50!black]{hyperref} \usepackage{xcolor} \newtheorem{theorem}{Theorem} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \emergencystretch=2em \newcommand{\eps}{\varepsilon} \newcommand{\sm}{\sigma_{-1}} \title[The second-order term in Ramanujan's bound for $\sigma(n)/n$]{The exact second-order term in Ramanujan's bound for $\sigma(n)/n$} \author{Jacob Crim} \date{5 November 2026} \begin{document} \begin{abstract} Let $\sigma(n)$ be the sum of the divisors of $n$, and assume the Riemann hypothesis. Ramanujan showed that \[ \sigma(n)/n\le e^\gamma\bigl(\log\log n-2(\sqrt2-1)/\sqrt{\log n}+S_1(\log n)+O(1/(\sqrt{\log n}\,\log\log n))\bigr), \] where $S_1$ is a sum over the zeros of $\zeta$. Nicolas recently made this effective. He placed the coefficient of $1/(\sqrt{\log n}\log\log n)$ in $[0.9567,\,3.789]$ at colossally abundant numbers, and asked for its exact asymptotic value. We show that this coefficient is \[ \kappa+W_2(\log n),\qquad \kappa=\sqrt2\,(2+\log2)-2=1.80868\ldots, \] where $W_2(x)=-\sum_\rho x^{i\Im\rho}/(1-\rho)^2$ oscillates in $[-\beta,\beta]$ with $\beta=2+\gamma-\log4\pi$. In particular the rescaled residual studied numerically by Leshchiner, Musin and Thompson does not converge, and it exceeds $3/2$ at every colossally abundant number with parameter $\xi\ge4.4\cdot10^{15}$; this answers their Questions~3 and~4 (the second in the negative). The next coefficient is the constant $c_0=8-\sqrt2\,(8+4\log2+\tfrac34\log^22)=-7.7443\ldots$, up to an oscillation of amplitude at most $0.0066$. We also prove explicit two-sided bounds for the remainder at every colossally abundant number above Nicolas's threshold $N^{(0)}$, which has $\log N^{(0)}\approx10^9$. The proof is computer-assisted: rigorous interval arithmetic covers every real parameter $\xi\in[10^9,e^{300}]$, and an analytic argument covers $\xi>e^{300}$. Corollaries: \begin{itemize} \item $\sigma(n)/n\le e^\gamma(\log\log n-0.699/\sqrt{\log n})$ for all $n\ge N^{(0)}$; \item Ramanujan's $\limsup$ is approached from above, at every colossally abundant number with $\xi\ge10^9$; \item an explicit window for the $\liminf$; \item the analogue for odd integers, refining a criterion of Washington and Yang. \end{itemize} The proof reads colossally abundant numbers as ground states of a free gas of prime modes. In that picture the constant $\kappa$ separates into a deficit term, a shell-energy term and a prime-square term. Every enclosure is checked against exact values computed from a sieve to $10^{10}$. \end{abstract} \maketitle \section{Introduction and main results} \subsection{Background} Gronwall proved that $\limsup\sigma(n)/(n\log\log n)=e^\gamma$. Robin~\cite{Rob84} proved that the Riemann hypothesis (RH) is equivalent to \[ \sigma(n)5040). \] Long before, in the part of \emph{Highly composite numbers} that was suppressed in 1915 and published in 1997~\cite{Ram97}, Ramanujan had shown under RH that \begin{equation}\label{eq:ram} \frac{\sigma(n)}{n}\le e^\gamma\Bigl(\log\log n-\frac{2(\sqrt2-1)}{\sqrt{\log n}}+S_1(\log n)+\frac{O(1)}{\sqrt{\log n}\,\log\log n}\Bigr), \qquad S_1(x)=\sum_\rho\frac{x^{\rho-1}}{\rho(1-\rho)} . \end{equation} Nicolas~\cite[Thm.~1.1]{Nic22} made \eqref{eq:ram} effective. Write $L=\log n$ and $\lambda=\log\log n$. Under RH he proved that, for all $n\ge2$, \[ \frac{\sigma(n)}n\le e^\gamma\Bigl(\lambda-\tfrac{2(\sqrt2-1)}{\sqrt L}+S_1(L)+\tfrac{3.789}{\sqrt L\,\lambda}+\tfrac{0.026\,\lambda}{L^{2/3}}\Bigr). \] He also proved a matching lower bound, with $0.9567$ and $-0.48$ in place of $3.789$ and $0.026$, at every colossally abundant number $N\ge N^{(0)}$~\cite[Prop.~5.1]{Nic22}. As the first open question of~\cite[\S7]{Nic22} he asks for the exact asymptotic coefficient of $1/(\sqrt L\lambda)$ in~\eqref{eq:ram}, remarking that this probably requires a sharper estimate of $\prod_{p\le x}(1-1/p)$; Lemma~\ref{lem:prim} below supplies it. \subsection{Notation} Let $\rho=\frac12+i\gamma_\rho$ run over the nontrivial zeros of $\zeta$; RH is assumed throughout. Put \[ \beta=\sum_\rho\frac1{\rho(1-\rho)}=2+\gamma-\log4\pi=0.046191\ldots, \] \[ W(x)=\sum_\rho\frac{x^{i\gamma_\rho}}{\rho(1-\rho)},\qquad W_2(x)=-\sum_\rho\frac{x^{i\gamma_\rho}}{(1-\rho)^2}. \] Under RH, $\rho(1-\rho)=|\rho|^2=|1-\rho|^2$, so $|W(x)|,|W_2(x)|\le\beta$. Colossally abundant (CA) numbers are parametrized as follows. For real $x>1$ and $k\ge1$ put \[ F(x,k)=\frac{\log\bigl(1+1/(x+x^2+\cdots+x^k)\bigr)}{\log x}. \] For real $\xi>1$ let $\eps=F(\xi,1)$, let $\xi_k=\xi_k(\xi)$ be the root of $F(\xi_k,k)=\eps$ (so $\xi_1=\xi$), and set \[ N(\xi)=\prod_{k\ge1}\prod_{p\le\xi_k}p . \] This is Nicolas's parametrization~\cite[Def.~4.3]{Nic22}: his $\xi(N)$, defined by $F(\xi,1)=\eps_i$ for the largest parameter $\eps_i$ of $N$, is one admissible value. Every CA number is $N(\xi)$ for some real $\xi$ in $[P,P')$, where $P$ is its largest prime factor and $P'$ the next prime (see Remark~\ref{rem:ties} for the boundary case). All statements below hold for every such $\xi$. Write $t=\log\xi$ and $s=1/t$. Following Nicolas, define $\alpha(n)$ by \[ \frac{\sigma(n)}n=e^\gamma\Bigl(\log\log n-\frac{\alpha(n)}{\sqrt{\log n}}\Bigr), \] and set \[ c_\sigma(n)=-e^\gamma\alpha(n)=\Bigl(\frac{\sigma(n)}n-e^\gamma\log\log n\Bigr)\sqrt{\log n}. \] \subsection{The answer to Nicolas's question} \begin{theorem}\label{thm:main} Assume RH. As $N\to\infty$ through colossally abundant numbers, \[ \frac{c_\sigma(N)}{e^\gamma}=2-2\sqrt2+W(\xi)+\frac{\kappa+W_2(\xi)}{\log\xi}+O\Bigl(\frac1{\log^2\xi}\Bigr), \qquad\kappa=\sqrt2\,(2+\log2)-2 . \] Equivalently, with $L=\log N$ and $\lambda=\log\log N$, \[ \frac{\sigma(N)}N=e^\gamma\Bigl(\lambda-\frac{2(\sqrt2-1)}{\sqrt L}+S_1(L)+\frac{\kappa+W_2(L)}{\sqrt L\,\lambda}+O\Bigl(\frac1{\sqrt L\,\lambda^2}\Bigr)\Bigr). \] More precisely, the $O(\log^{-2}\xi)$ term equals $(c_0+\omega(\xi))/\log^2\xi+O(\log^{-3}\xi)$, where \[ c_0=8-\sqrt2\bigl(8+4\log2+\tfrac34\log^22\bigr)=-7.74433\ldots,\qquad|\omega(\xi)|\le2\beta/\gamma_1<0.0066, \] with $\gamma_1=14.1347\ldots$ the ordinate of the first zero. \end{theorem} The coefficient Nicolas asks for is therefore $\kappa+W_2(\log N)+o(1)$. It oscillates in $[\kappa-\beta,\kappa+\beta]=[1.7625,\,1.8549]$, well inside his window $[0.9567,3.789]$. Three contributions add up to $\kappa$: \begin{itemize} \item the second-order term of Mertens' product at primorials, which gives $-2$ (prime squares); \item the saturation deficit of the doubly occupied primes, which gives $\sqrt2(2+\tfrac12\log2)$; \item the shift of $\log N$ caused by the squared primes, which gives $\tfrac12\sqrt2\log2$. \end{itemize} Robin already isolated the combination $\sqrt2(\log2+2)=3.808$ in the remark following his Lemma~6~\cite{Rob84}. The zeros enter at this order only through $W_2$. At the next order, $c_0$ is the sum of $8$ (prime squares) and $-\sqrt2(8+4\log2+\tfrac34\log^22)$ (deficit and energy of the second shell; the shell parameter $v$ of Lemma~\ref{lem:shells} enters both with opposite signs and cancels exactly). The zeros contribute only $\omega$, which is bounded by $2\sum_\rho|1-\rho|^{-3}$. \subsection{Relation to the numerical study of Leshchiner, Musin and Thompson}\label{sec:LMT} In~\cite{LMT26}, Leshchiner, Musin and Thompson study the same quantity numerically. Their notation is \[ T(n)=-c_\sigma(n),\qquad R(n)=e^\gamma\bigl(2\sqrt2-2-W(\log n)\bigr),\qquad Q(n)=e^{-\gamma}\bigl(R(n)-T(n)\bigr)\log\log n . \] By Theorem~\ref{thm:main}, along CA numbers, with $u=\log\log N$, \begin{equation}\label{eq:Q} Q(N)=\kappa+W_2(\log N)+\tfrac32\bigl(1-3^{1/3}\bigr)\,u\,e^{-u/6}+\frac{c_0+\omega}{u}+O(u^{-2}). \end{equation} In their computed range $14\lesssim u\lesssim25$, $Q$ rises from about $0.36$ to about $1.25$, and they ask whether it converges (their Question~3), whether $Q\le3/2$ eventually (Question~4), and what the higher-order coefficients are (Question~6). Under RH: \begin{enumerate} \item \emph{$Q$ does not converge.} The function $W_2$ is a non-constant almost periodic function of $\log\log N$, and every real $\xi$ is a CA parameter. Hence $\limsup Q=\kappa+\limsup W_2$ and $\liminf Q=\kappa+\liminf W_2$, and both lie in $[\kappa-\beta,\kappa+\beta]=[1.7625,\,1.8549]$. \item \emph{$Q\le3/2$ fails eventually.} By Theorem~\ref{thm:explicit}, $Q(N)>3/2$ for every CA number with $\xi\ge4.4\cdot10^{15}$. The certified lower bound is $>1.501$ on every cell beyond that point and $>1.73$ for $t\ge300$. Replacing $W(\xi),W_2(\xi)$ by $W(\log N),W_2(\log N)$ changes $Q$ by less than $10^{-4}$ there. \item \emph{The coefficients.} Constant coefficients do not suffice at first order: $A_1$ must be replaced by $\kappa+W_2(e^u)$. At second order the coefficient is the constant $c_0=-7.744$, up to an oscillation of size at most $0.0066$. \item \emph{The observed drift.} The term $\frac32(1-3^{1/3})ue^{-u/6}$ is $o(u^{-r})$ for every $r$, but it dominates for $u\lesssim40$ and explains the drift. With the value $t^2\mathcal E\approx-6.5$ observed in Section~\ref{sec:num}, \eqref{eq:Q} gives $Q\approx0.44$ at $u=14$ and $Q\approx1.29$ at $u=25$. This agrees with their curves, within their truncation error and sampling. \end{enumerate} Their Conjecture~1 asks that $\liminf T=c_1$ and $\limsup T=c_2$ along CA numbers. The first equality follows from Theorem~\ref{thm:main}: Dirichlet's simultaneous approximation makes $W(\xi)$ approach $\beta$ for arbitrarily large real $\xi$. The second is equivalent to $\liminf W=-\beta$, which is open~\cite{Nic12}. \subsection{Explicit form} \begin{theorem}[computer-assisted]\label{thm:explicit} Assume RH, and let $N=N(\xi)$ with real $\xi\ge10^9$. This includes every CA number $N\ge N^{(0)}$, i.e.\ with largest prime factor $\ge10^9+7$. Then \[ \frac{c_\sigma(N)}{e^\gamma}=2-2\sqrt2+W(\xi)+\frac{\kappa+W_2(\xi)}{t}+\tfrac32\bigl(1-3^{1/3}\bigr)\xi^{-1/6}+\mathcal E, \qquad -21.28\,t^{-2}\le\mathcal E\le 6.18\,t^{-2}. \] The window shrinks as $\xi$ grows. For $\xi\ge10^{100}$ it is $[-7.87,\,-7.42]\,t^{-2}$, and for $t\ge300$ it is $[-7.87,\,-7.46]\,t^{-2}$. In the form of Nicolas's question, \begin{equation}\label{eq:Lform} \frac{0.30}{t}\le\frac{c_\sigma(N)}{e^\gamma}-\bigl(2-2\sqrt2+W(\xi)\bigr)\le\frac{1.855}{t}\qquad(\xi\ge10^9). \end{equation} \end{theorem} The term $\xi^{-1/6}$, which comes from prime cubes and the triply occupied shell, is $o(t^{-2})$. We keep it because at $\xi=10^9$ it equals $0.021$, against $1/t^2=0.0023$. The width of the window at $\xi=10^9$ is due almost entirely to the unconditional error terms of the prime number theorem at the second and fourth shells ($\xi_2\approx4.5\cdot10^4$, $\xi_4\approx250$); these decay like $\xi^{-1/4}t^2$. \begin{remark}[how Theorem~\ref{thm:explicit} is proved]\label{rem:status} The proof has three parts. \begin{enumerate} \item The quantity $t^2\mathcal E$ is written exactly as a sum of 18 terms; see~\eqref{eq:decomp} in Appendix~\ref{app:enc}. Each term is enclosed by an explicit closed-form inequality. These inequalities involve elementary functions, $E_1$, and the parameters of Lemmas~\ref{lem:shells} and~\ref{lem:cert}. \item The two terms of size $O(1)$ in $t^2\mathcal E$ are rational functions of $s=1/t$ with interval coefficients. Their exact cancellation at orders $s^0$ and $s^{1}$ is verified symbolically. \item The remaining terms are evaluated in ball arithmetic (Arb) on a covering of $t\in[\log10^9,300]$ by 30\,798 closed cells. A cell is an interval of $t$, not a grid point, so no monotonicity between grid points is needed. For $t\ge300$ the $O(1)$ terms $U_1+M_1+U_6$ are evaluated on $200$ subintervals covering $s\in[0,1/300]$. Every other term is bounded by an explicit majorant built only from the crude shell bounds of Lemma~\ref{lem:shells} (Appendix~\ref{app:ver}, item~4). These majorants total at most $5t^2e^{-t/6}+10t^6e^{-t/4}$, which is decreasing for $t\ge24$ and below $10^{-15}$ at $t=300$. \end{enumerate} Appendix~\ref{app:ver} gives the details, and the code is in the ancillary files. Every enclosure was also compared with exact values at 101 CA numbers in $[10^9,10^{10}]$, with no violation. \end{remark} \subsection{Corollaries} \begin{corollary}\label{cor:approach} Assume RH. \begin{enumerate} \item \emph{Approach from above.} Since $\kappa>\beta$, for all sufficiently large CA numbers \[ c_\sigma(N)/e^\gamma>2-2\sqrt2+W(\xi). \] By Theorem~\ref{thm:explicit} this holds for every CA number with $\xi\ge10^9$. Along any sequence with $W(\xi)\to\beta$, the limit $\limsup c_\sigma=e^\gamma(2-2\sqrt2+\beta)=-1.3932\ldots$ (Ramanujan, Nicolas--Robin) is approached from above. \item \emph{A sharper Robin margin.} For every integer $n\ge N^{(0)}$, $\alpha(n)\ge0.699$; that is, \[ \frac{\sigma(n)}n\le e^\gamma\Bigl(\log\log n-\frac{0.699}{\sqrt{\log n}}\Bigr). \] This improves Nicolas's $\alpha(n)\ge0.582$~\cite[Cor.~1.2]{Nic22} in this range. \item \emph{The $\liminf$.} We have $\liminf_{N\ \mathrm{CA}}c_\sigma(N)=e^\gamma\bigl(2-2\sqrt2+\liminf W\bigr)$. Hence, using $\liminf W\le-0.00499$~\cite{Nic12}, \[ -1.5578\ \le\ \liminf_{N\ \mathrm{CA}}c_\sigma(N)\ \le\ -1.4844 . \] \end{enumerate} \end{corollary} \begin{corollary}[odd integers]\label{cor:odd} Assume RH. Let $M$ be the odd part of a CA number $N=N(\xi)$ with $\xi\ge10^9$, and put \[ c_{\rm odd}(M)=\bigl(\sigma(M)/M-\tfrac{e^\gamma}2\log\log M\bigr)\sqrt{\log M}. \] Then \[ 0<\frac{c_{\rm odd}(M)}{e^\gamma/2}-\frac{c_\sigma(N)}{e^\gamma}\le\frac{t+\log t+0.37}{\sqrt\xi}. \] The constant $0.37$ is sharp to within $0.004$: the supremum of $\log\kappa+1/(2\kappa)$ over the admissible range is $0.3665$, and the observed maximum on $[10^9,10^{10}]$ is $0.3655$. Hence Theorem~\ref{thm:main} holds for the odd ground states $M$ with $e^\gamma$ replaced by $e^\gamma/2$. Theorem~\ref{thm:explicit} also holds for them, with its upper constants increased by $t^2(t+\log t+0.37)/\sqrt\xi$. This amount is decreasing in $\xi$ and is at most $0.33$ for $\xi\ge10^9$. This refines Washington and Yang's criterion~\cite{WY}: RH holds if and only if $\sigma(m)<\frac{e^\gamma}2m\log\log m$ for all large odd $m$. \end{corollary} \subsection{The ground-state reading} The proofs are organized around one observation, which goes back in substance to Ramanujan~\cite{Ram15} and Alaoglu--Erd\H os~\cite{AE44}. A CA number of parameter $\eps$ is a \emph{ground state} of \[ H_\eps(n)=\eps\log n-\log\frac{\sigma(n)}n=\sum_p\sum_{a=1}^{a_p}\bigl(\eps-\eta(p,a)\bigr)\log p, \] where $p^{a_p}\,\|\,n$ and \[ \eta(p,a)=F(p,a)=\frac{\log\bigl(1+1/(p+\cdots+p^a)\bigr)}{\log p}. \] This is a free gas of bosonic modes labelled by primes, with quanta of energy $\log p$ and decreasing ``efficiencies'' $\eta(p,a)$. The ground state fills every quantum with $\eta\ge\eps$. The result is a Fermi sea of singly occupied primes $p\le\xi$, together with shells: the primes $p\le\xi_k$ have exponent $\ge k$, and $\xi_k\approx(k\xi)^{1/k}$. In this language: \begin{itemize} \item the reduction of Robin's criterion to CA numbers (Robin's Proposition~1; \cite[Lemma~4.15]{Nic22}) is the exact equivalence of the canonical and microcanonical ensembles for a concave target; \item Ramanujan's minimization arguments in~\cite{Ram15} is the corresponding Legendre transform for $d(n)$; \item the finite-size correction splits into a fermionic part (the primorial, i.e.\ Mertens' product) and a bosonic part (the shells). \end{itemize} The leading constant $2-2\sqrt2$ is $2$ from prime squares in the explicit formula, minus $\sqrt2$ of reward lost by the doubly occupied shell (its \emph{saturation deficit}), minus $\sqrt2$ of extra energy carried by that shell. Theorem~\ref{thm:main} is the next order of the same bookkeeping. Stationarity of the ground state ($\eta=\eps$ at every shell edge) also makes the prime-number-theorem error \emph{at} a shell edge cancel between deficit and shell energy at first order. This is used in the explicit proof (term $M_5$ in Appendix~\ref{app:enc}). The shell structure also explains why $\sigma$ and $d$ behave differently. For $d(n)$ the second shell sits at $X^{\log(3/2)/\log2}$, far above the RH scale $\sqrt X$, so the shells dominate the zeros (cf.~\cite{Ram15}). For $\sigma$ the second shell $\xi_2\approx\sqrt{2\xi}$ sits exactly at the RH scale, so shells and zeros enter at the same order. \section{Structure of colossally abundant numbers} Since $F(\cdot,k)$ is decreasing and $\eps=F(\xi,1)$ is decreasing in $\xi$, each $\xi_k(\xi)$ is increasing in $\xi$, and $\xi_{k+1}<\xi_k$. With $a_p=k$ for $\xi_{k+1}1$, $\xi^{1/k}\le\xi_k\le(k\xi)^{1/k}$. For every real $\xi\ge10^9$, \[ \xi_2=\sqrt{2\xi}\Bigl(1-\frac{\log2}{2t}+\frac{v}{t^2}\Bigr)\qquad\text{with}\qquad 0.47\le v\le0.55 . \] As $\xi\to\infty$, $v\to(\log2+\frac34\log^22)/2=0.52674$, in agreement with the coefficient $a/2+3a^2/8$ ($a=\log2$) in Nicolas's expansion~\cite[(4.27)]{Nic22}. The true value at $\xi=10^9$ is $v=0.48105$. The crude bounds are~\cite[(4.26)]{Nic22}; we include the short proof for completeness. \end{lemma} \begin{proof} \emph{Crude bounds.} Put $z=\xi^{1/k}$ and $S=z+\cdots+z^k\le k\xi$. Then $(1+1/S)^k\ge1+k/S\ge1+1/\xi$, so $F(z,k)\ge\eps$ and $\xi_k\ge z$. Now put $z=(k\xi)^{1/k}$, so $S\ge k\xi$. Then $F(z,k)\le k/(S(t+\log k))\le1/(\xi(t+\log k))\le1/((\xi+\frac12)t)\le\eps$; the third inequality is $t/2\le\xi\log k$. Hence $\xi_k\le z$. \emph{Second shell.} Write $z=\sqrt{2\xi}(1+w)$ with $w=-\frac{\log2}2s+vs^2$. Using $\log(1+y)\le y$ and $\log(1+1/\xi)\ge1/(\xi+\frac12)$, a sufficient condition for $\xi_2\le z$ is $(z+z^2)\log z\ge(\xi+\frac12)t$. With $\log(1+w)\ge w/(1+w)$ this follows from \[ P_{\rm up}(s):=(1+w)^2(1+s\log2)+2ws(1+w)-1\ \ge\ \tfrac12e^{-1/s}. \] Using $\log(1+y)\ge y/(1+y/2)$ and $\log(1+1/\xi)\le1/\xi$, a sufficient condition for $\xi_2\ge z$ is $(z^2+z+\frac12)\log z\le\xi t$. With $\log(1+w)\le w$ this follows from \[ P_{\rm lo}(s):=1-(1+w)^2(1+s\log2+2ws)\ \ge\ \delta\,(1+s\log2+2ws), \] where \[ \delta=\tfrac12\bigl(\sqrt2(1+w)e^{-1/(2s)}+\tfrac12e^{-1/s}\bigr). \] Both $P_{\rm up}$ and $P_{\rm lo}$ are polynomials in $s$ that vanish to second order at $s=0$, with \[ P_{\rm up}/s^2\to2v-\log2-\tfrac34\log^22\qquad\text{and}\qquad P_{\rm lo}/s^2\to-2v+\log2+\tfrac34\log^22 . \] We checked the two inequalities after division by $s^2$, with $v=0.55$ and $v=0.47$ respectively, in ball arithmetic on $4000$ cells covering $s\in(0,1/\log10^9]$. The right-hand sides divided by $s^2$ are increasing in $s$, so on each cell they were bounded by their value at the right endpoint. The minimal margins are $0.0465$ and $0.0184$. \end{proof} \begin{remark} A previous draft claimed $v\ge0.48$ with margin $0.0022$. The value $v(10^9)=0.48105$ shows that $0.48$ is true. However, the sufficient inequality above has margin below $3\cdot10^{-5}$ at $\xi=10^9$ when $v=0.48$, so it does not certify that value. We therefore use $0.47$. Because $v$ cancels at leading order in $t^2\mathcal E$, this costs nothing visible. \end{remark} \section{Proof of Theorem~\ref{thm:main}} Write $U=\sqrt\xi\,t$, and put \[ u=-\log f(\xi),\quad f(x)=e^\gamma\log\theta(x)\prod_{p\le x}(1-1/p);\qquad A=-\Lambda . \] By~\eqref{eq:exact}, \begin{equation}\label{eq:assembly} \frac{c_\sigma(N)}{e^\gamma}=\sqrt{\log N}\,\Bigl[\log\theta(\xi)\bigl(e^{u-A}-1\bigr)-\log\Bigl(1+\frac{R}{\theta(\xi)}\Bigr)\Bigr]. \end{equation} \subsection*{The primorial piece} \begin{lemma}\label{lem:prim} Under RH, \[ U\,u=2+W(\xi)+\frac{W_2(\xi)-2}{t}+\tfrac32\,\xi^{-1/6}+\frac{8+\omega_u(\xi)}{t^2}+O(t^{-3}),\qquad|\omega_u|\le\frac{2\beta}{\gamma_1}. \] \end{lemma} \begin{proof} Start from Stieltjes integration of $\sum_{p\le x}1/p$ against $\theta$ and Mertens' identity $B=\gamma+\sum_p(\log(1-1/p)+1/p)$. With $E(s)=\theta(s)-s$ and $w(s)=(1+\log s)/(s^2\log^2s)$ this gives the exact identity \[ \log f(x)=K(x)+\mathrm{Br}(x)+T(x),\qquad K(x)=\int_x^\infty E(s)\,w(s)\,ds, \] \[ \mathrm{Br}(x)=\log\log\theta(x)-\log\log x-\frac{E(x)}{x\log x},\qquad T(x)=-\sum_{p>x}\Bigl(\log\bigl(1-\tfrac1p\bigr)+\tfrac1p\Bigr). \] Under RH, $\mathrm{Br}=O(\log^3x/x)$ and $00$ for $1\le y\le10^{19}$. These bounds are unconditional. \item A direct computation over the primes below $1423$, in the ancillary file \texttt{cconst.py}, gives $\sup_{00$. \item Lemma~\ref{lem:shells}, the crude shell bounds, and certified roots for $\xi_3,\dots,\xi_6$ at cell endpoints (Lemma~\ref{lem:cert}). \item $\sum_\rho|\rho|^{-2}=\beta$ and $|\rho|\ge\gamma_1>14.1347$. \end{itemize} Nicolas~\cite[(2.2)]{Nic22} quotes Büthe's lower bound as $\theta(x)>x-1.94\sqrt x$ for $14270$. \emph{(2)} At CA numbers with $\xi\ge10^9$, Theorem~\ref{thm:explicit} with $W,W_2\le\beta$ gives, on every cell, \[ c_\sigma/e^\gamma\le2-2\sqrt2+\beta+\frac{\kappa+\beta}{t}+\tfrac32(1-3^{1/3})\xi^{-1/6}+\max_{\rm cell}\mathcal E\le-0.699 . \] The maximum over all cells of the middle expression is $-0.69933$. Since $t\mapsto e^\gamma(\log t-a/\sqrt t)$ is increasing and concave, Nicolas's interpolation lemma~\cite[Lemma~6.1]{Nic22} extends $\alpha\ge0.699$ from consecutive CA numbers to every $n$ between them. \emph{(3)} The leading term in Theorem~\ref{thm:main} (Robin, Nicolas) gives $c_\sigma/e^\gamma=2-2\sqrt2+W(\xi)+o(1)$. Every prime is the parameter $\xi$ of some CA number, and $W$ varies by $o(1)$ between consecutive primes. Hence the $\liminf$ equals $e^\gamma(2-2\sqrt2+\liminf W)$. Then use $-\beta\le\liminf W\le-0.00499$~\cite{Nic12}. \qed \subsection{Proof of Corollary~\ref{cor:odd}} Let $a=v_2(N)$, $L=\log N$, $L'=\log M=L-a\log2$, and $X=\sigma(N)/(Ne^\gamma)=\log L+c_\sigma/(e^\gamma\sqrt L)$. Since $\sigma(M)/M=(\sigma(N)/N)/(2(1-2^{-a-1}))$, \[ \frac{c_{\rm odd}(M)}{e^\gamma/2}-\frac{c_\sigma(N)}{e^\gamma} =\frac{c_\sigma}{e^\gamma}\Bigl(\sqrt{\tfrac{L'}L}-1\Bigr)+\sqrt{L'}\,\log\frac{L}{L'}+X\sqrt{L'}\,\frac{2^{-a-1}}{1-2^{-a-1}} . \] All three terms are positive, because $c_\sigma<0$; this proves the left inequality. A previous draft bounded the third term by $\lambda/\xi$, which is wrong: that term is of size $(0.69$--$1.39)/\sqrt\xi$. For the right inequality, write $2^a=\kappa_a\xi t$. From $\xi_a\ge2$, i.e.\ $F(2,a)\ge\eps$, together with $\log(1+y)\le y$ and $\eps\ge1/((\xi+\frac12)t)$, we get $\kappa_a\le(1+\xi^{-1})/(2\log2)$. From $\xi_{a+1}<2$, together with $\log(1+y)\ge y/(1+y/2)$ and $\eps\le1/(\xi t)$, we get $\kappa_a>1/(4\log2)$. Then: \begin{itemize} \item the second term is $\le a\log2/(\sqrt L(1-a\log2/L))$; \item the first term is $\le0.9\,a\log2/L$, using $|c_\sigma/e^\gamma|\le0.9$ and $1-\sqrt{1-y}\le y$; \item the third term is $\le\log L\,\sqrt L/(2\kappa_a\xi t)\,(1+2^{-a})$. \end{itemize} Now use $a\log 2=t+\log t+\log\kappa_a$, $L/\xi\in[1-2.06\,\xi^{-1/2},\,1+1.5\,\xi^{-1/2}]$ (from $C$ and $R\le1.42\sqrt\xi$), and $|\log L-t|\le2\xi^{-1/2}$. At $\xi=10^9$ these corrections total $\le1.5\cdot10^{-3}$, they decrease with $\xi$, and the factor $(1+1/\xi)$ in $\kappa_a$ adds $<10^{-8}$. We obtain \[ \sqrt\xi\Bigl(\frac{c_{\rm odd}}{e^\gamma/2}-\frac{c_\sigma}{e^\gamma}\Bigr)\le t+\log t+\max_{\kappa\in[1/(4\log2),\,1/(2\log2)]}\Bigl(\log\kappa+\frac1{2\kappa}\Bigr)+0.003 . \] The function $\log\kappa+1/(2\kappa)$ is convex, and it takes the same value $\log2-\log(2\log2)=0.36651$ at both endpoints. This gives the stated bound. \qed \section{Numerical verification}\label{sec:num} We ran a segmented sieve up to $10^{10}$. Accumulators were held in binary128, and the sieve outputs $\theta$, $\sum\log(1-1/p)$ and $\sum\log(1-p^{-2})$ at $401$ log-spaced points. It reproduces $\pi(10^{10})=455\,052\,511$ and $\theta(10^{10})=9\,999\,939\,830.66$. At each point $\xi$ we built $N(\xi)$ exactly from the shell rule. $W$ and $W_2$ were summed over the first $1942$ zeros. The truncation error of each is at most $\tau=\beta-\sum_{n\le1942}2/(\frac14+\gamma_n^2)\le9.1\cdot10^{-4}$; this uses only that the list of zeros is complete. \begin{center}\footnotesize\setlength{\tabcolsep}{4pt} \begin{tabular}{rcccccc} \toprule $\xi$ & $t^2\mathcal E$ (exact) & enclosure & $\sum U_i$ (exact) & enclosure & $\sum M_i$ (exact) & enclosure\\ \midrule $1.00\times10^{9}$ & $-6.579$ & $[-21.26,\,6.16]$ & $6.698$ & $[2.44,\,13.29]$ & $-13.280$ & $[-23.69,\,-7.14]$\\ $3.16\times10^{9}$ & $-6.459$ & $[-17.82,\,3.48]$ & $6.724$ & $[3.21,\,11.74]$ & $-13.184$ & $[-21.03,\,-8.27]$\\ $1.00\times10^{10}$ & $-6.526$ & $[-15.23,\,1.37]$ & $6.579$ & $[3.84,\,10.55]$ & $-13.106$ & $[-19.06,\,-9.18]$\\ \bottomrule \end{tabular} \end{center} At all 101 checkpoints each exact value lies inside its enclosure; the exact $t^2\mathcal E$ ranges over $[-6.71,-6.44]$. The exact values are near the centre of the enclosures; the width at $10^9$ comes from the unconditional range $-C\sqrt y\le E(y)<0$ at $y\approx\xi_2$ and $y\approx\xi_4$ (terms $U_3$, $U_5$, $M_2$, $M_6$, $M_7$). Using the explicit formula for $E$ inside these integrals, as is done for $K$, would shrink the window further. For odd ground states the offset $\sqrt\xi\,(c_{\rm odd}/(e^\gamma/2)-c_\sigma/e^\gamma)-(t+\log t)$ has maximum $0.3655$ over the checkpoints, against the proved $0.37$. \section{Remarks} \begin{enumerate} \item The same method applies to Ramanujan's $\sigma_{-s}$, $0Y$, where $\mathcal S(y)=\log^2y/(8\pi)$. Also $w(s)=(1+\log s)/(s^2\log^2s)$, $Q(z)=ze^zE_1(z)$, and $J_b$ is as in~\eqref{eq:J}. Put \[ \mathrm{Sch}_{b,k}(X_0)=\int_{X_0}^\infty s^b\frac{(\log s/k)^2}{8\pi}w(s)\,ds=\frac{X_0^{b-1}}{8\pi k^2}\Bigl[\frac{\log X_0}{1-b}+\frac1{(1-b)^2}+\frac1{1-b}\Bigr]. \] This bounds the contribution of Schoenfeld's range $s^{1/k}>Y$; it is used with $X_0=\max(\xi,Y^k)$. \subsection*{Exact decomposition} Let $\xi_2=\sqrt{2\xi}(1+w)$ with $w=-\frac{\log2}{2}s+vs^2$ (Lemma~\ref{lem:shells}). Let $\nu_3=\xi_3/(3\xi)^{1/3}$, $L_k=\log\xi_k$, $R_4=\sum_{k\ge4}\theta(\xi_k)$, $R_0=\xi_2+\xi_3+R_4$, $E_2=E(\xi_2)$, $E_3=E(\xi_3)$, and $g_m(s)=s^{-m}/\log s$. With $u$, $A$, $R$ as in~\eqref{eq:assembly}, write $1+d=\sqrt{\log N}\log\theta(\xi)/U$ and $Y_*=W+W_2/t+UG-UA$, where $UG:=Uu-W-W_2/t$. Put $y_*=Y_*/U$ and $q=e^{y_*}-1-y_*$. Then~\eqref{eq:assembly} is the identity \[ \frac{c_\sigma}{e^\gamma}=(1+d)\,Y_*+U(1+d)\,q-B,\qquad B=\sqrt{\log N}\log\bigl(1+R/\theta(\xi)\bigr), \] and \begin{equation}\label{eq:decomp} t^2\mathcal E=\sum_{i=1}^9U_i+\sum_{i=1}^7M_i+A_1+A_2 . \end{equation} The terms are listed below, each with its enclosure; all are exact identities or inequalities, and $\kappa_n$ denotes an unknown number in $[0,1]$. \medskip\noindent\textbf{Primorial piece} ($t^2(UG-2+2s-\frac32\xi^{-1/6})=\sum U_i$). \begin{enumerate} \item[$U_1$] $=t^2\bigl(Q(t/2)-1+2s\bigr)=\sum_{k=2}^{7}(-1)^kk!\,2^ks^{k-2}+\kappa_8\,8!\,2^8s^6$, a polynomial in $s$. \item[$U_2$] $=\tfrac12t^2e^{-t/6}\bigl(Q(2t/3)-1\bigr)$, with $Q$ given by six terms of its enveloping series. \item[$U_3$] $=t^2U\!\int_\xi^\infty E(\sqrt s)w\in\bigl[-Ct^2UJ_{1/4}-t^2U\mathrm{Sch}_{1/4,2},\ t^2U\mathrm{Sch}_{1/4,2}\bigr]$; the $C$-part is present only if $\xi\xi_2}p^{-4}/(1-\xi_2^{-2})$ and $A_{3x}\le\sum_{p>\xi_3}p^{-6}/(1-\xi_3^{-3})$, with $\sum_{p>y}p^{-m}\le(1+10^{-7})y^{1-m}\bigl(\frac m{(m-1)\log y}+\frac1{(m-1)\log^2y}\bigr)$; \item $A_{4+}$ consists of the prime sums~\eqref{eq:PS} over $(\xi_{k+1},\xi_k]$ with exponent $k+1$, for $k=3,\dots,7$; their upper bounds are multiplied by $1/(1-\xi_{k+1}^{-(k+1)})$, using $-\log(1-y)\le y/(1-y)$. To these are added the primes $p\le\xi_8$; \item for those small primes, stationarity ($p>\xi_{a_p+1}$, i.e.\ $F(p,a_p+1)<\eps$) and $-\log(1-p^{-a-1})\le\frac{p}{p-1}F(p,a+1)\log p\cdot(1-p^{-a-1})^{-1}$ give loss $\le\frac{64}{63}\,\eps\,p\log p/(p-1)$. Since $\sum_{p\le x}\log p/(p-1)<\log x+0.76$, their total is $\le\frac{64}{63}\eps(\theta(\xi_8)+\log\xi_8+0.76)$. The factor $\frac{64}{63}$ is conservative. \end{itemize} \end{enumerate} \medskip\noindent\textbf{Assembly.} \begin{enumerate} \item[$A_1$] $=t^2dY_*$, with $1+d=\sqrt{1+e+R/\xi}\,(1+\log(1+e)/t)$ and $|W|,|W_2|\le\beta$ inside $Y_*$. \item[$A_2$] $=t^2U(1+d)q\in\bigl[0,\ t^2U(1+d)\,y_*^2e^{|y_*|}/2\bigr]$. \end{enumerate} \section{Verification}\label{app:ver} \begin{enumerate} \item \texttt{symbolic.py} (sympy, exact arithmetic) checks the following, and exports $U_1$, $P_2$ and the polynomials of Lemma~\ref{lem:shells} with exact coefficients in $\mathbb Q(\log2,\sqrt2)$: \begin{itemize} \item the numerator of $P_2$ vanishes at orders $s^0$ and $s^1$; \item $M_1(0)=-\sqrt2(8+4\log2+\frac34\log^22)$, independently of $v$; \item $U_1(0)=8$. \end{itemize} \item \texttt{lemma\_shell2.py} proves Lemma~\ref{lem:shells}; \texttt{cconst.py} computes $C$. \item \texttt{engine.py} (python-flint/Arb, 160-bit balls) evaluates~\eqref{eq:decomp} on a closed cell $t\in[t_a,t_b]$. Every function is applied to balls, so the result encloses all values on the cell. The cell widths $\Delta t$ grow from $4\cdot10^{-4}$ at $t=\log10^9$ to $0.05$; \texttt{cover.py} covers $[\log10^9,300]$ with 30\,798 cells. \item \texttt{tail2.py} evaluates $U_1+M_1+U_6$ on $200$ subintervals covering $s\in[0,1/300]$, giving $[-7.865,-7.469]$. For $t\ge300$ we have $\xi>Y^6$, so only Schoenfeld's bound and the crude shell bounds $\xi^{1/k}\le\xi_k\le(k\xi)^{1/k}$ are needed. From the formulas of Appendix~\ref{app:enc} these give: \begin{itemize} \item $|U_2|\le\frac34te^{-t/6}$; \item $|U_3|,|U_4|\le t^4e^{-t/4}/50$; \item $|U_5|\le t^6e^{-t/4}$; \item $|U_7|+|U_8|+|U_9|+|M_3|+|M_4|+|A_1|+|A_2|\le t^6e^{-t/2}$; \item $|M_2|\le4t^2e^{-t/6}+3t^3e^{-t/4}+t^4e^{-t/2}$, using $\nu_3\in[3^{-1/3},1]$, $D_3\ge1$, $Q\le1$ and $R_4\le2t(4\xi)^{1/4}$; \item $|M_5|+|M_6|+|M_7|\le3t^4e^{-t/4}$. \end{itemize} These sum to at most $5t^2e^{-t/6}+10t^6e^{-t/4}$, which is decreasing for $t\ge24$ and $<10^{-15}$ at $t=300$. As a consistency check, \texttt{tail.py} evaluates the engine on point cells at $t=300,600,\dots,4800$; it finds sums $\le10^{-19}$, at the level of rounding. \item \texttt{validate.py} compares every group of terms with exact values from the sieve, and \texttt{oddcheck.py} checks Corollary~\ref{cor:odd}. \item The covering was run with a frozen \texttt{engine.py} (SHA-256 \texttt{5f56e4db\ldots f371d53f}). An independent check by a separate AI instance, working only from this appendix and the code, re-derived the decomposition~\eqref{eq:decomp} by hand. The referee checked it numerically to $10^{-52}$ at $11$ sieve checkpoints, checked each enclosure term by term against exact values, and compared \texttt{engine.py} with this appendix line by line; the corrections it raised are incorporated in this version. This is not a substitute for human refereeing. \end{enumerate} \subsection*{Data and code} All files named above, together with the sieve (\texttt{sieve\_build.py}, which writes and compiles the C source), a file list with reproduction steps (\texttt{manifest.yaml}), the per-cell output (\texttt{cells.csv}, one row per cell with its $t$-interval and enclosures, rounded outward) and the validation output, are included as ancillary files (directory \texttt{anc/}). \subsection*{Use of AI} This paper was produced with substantial assistance from Claude, an AI model by Anthropic. Claude drafted the text, derived the explicit enclosures, wrote and ran the verification code (the sieve, the zero computation, the interval-arithmetic covering and the symbolic checks), and carried out the literature checks. An independent check of Appendix~\ref{app:enc} and of \texttt{engine.py} was performed by a separate instance of the same model working only from the written appendix and the code; its findings are incorporated. No human referee has checked the proofs. The contributor takes responsibility for the submission. All code, the per-cell output and the validation logs are in the ancillary files, so that every computational claim can be re-run. \begin{thebibliography}{99} \bibitem{AE44} L.~Alaoglu and P.~Erd\H{o}s, \emph{On highly composite and similar numbers}, Trans.\ Amer.\ Math.\ Soc.\ 56 (1944), 448--469. \bibitem{Bu16} J.~B\"uthe, \emph{An analytic method for bounding $\psi(x)$}, Math.\ Comp.\ 87 (2018), 1991--2009; see also \emph{Estimating $\pi(x)$ and related functions under partial RH assumptions}, Math.\ Comp.\ 85 (2016), 2483--2498. \bibitem{Lang66} S.~Lang, \emph{Introduction to Transcendental Numbers}, Addison--Wesley, 1966, Ch.~II. \bibitem{LMT26} D.~R.~Leshchiner, O.~R.~Musin and J.~Thompson, \emph{CA2 numbers and the Riemann hypothesis: a numerical investigation of Ramanujan's inequalities}, arXiv:2610.39120 (2026). \bibitem{Nic12} J.-L.~Nicolas, \emph{Small values of the Euler function and the Riemann hypothesis}, Acta Arith.\ 155 (2012), 311--321. \bibitem{Nic22} J.-L.~Nicolas, \emph{The sum of divisors function and the Riemann hypothesis}, Ramanujan J.\ 58 (2022), 1113--1157. \bibitem{Ram15} S.~Ramanujan, \emph{Highly composite numbers}, Proc.\ London Math.\ Soc.\ (2) 14 (1915), 347--409. \bibitem{Ram97} S.~Ramanujan, \emph{Highly composite numbers}, annotated and with a foreword by J.-L.~Nicolas and G.~Robin, Ramanujan J.\ 1 (1997), 119--153. \bibitem{Rob84} G.~Robin, \emph{Grandes valeurs de la fonction somme des diviseurs et hypoth\`ese de Riemann}, J.\ Math.\ Pures Appl.\ 63 (1984), 187--213. \bibitem{Sch76} L.~Schoenfeld, \emph{Sharper bounds for the Chebyshev functions $\theta(x)$ and $\psi(x)$. II}, Math.\ Comp.\ 30 (1976), 337--360. \bibitem{WY} L.~C.~Washington and A.~Yang, \emph{Analogues of the Robin--Lagarias criteria for the Riemann hypothesis}, arXiv:2008.04787. \end{thebibliography} \end{document}