\documentclass[11pt,reqno,a4paper]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern,amssymb,microtype} \usepackage[margin=28mm,top=24mm,bottom=26mm]{geometry} \usepackage[hidelinks]{hyperref} \pdfmapfile{=lm.map} \pdfmapfile{+symbols.map} \hypersetup{pdftitle={Balanced semiprimes in short intervals under the Riemann hypothesis}, pdfauthor={Adam Henriksson},pdfsubject={Balanced semiprimes and the least-prime-factor sum in short intervals}} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \setlength{\emergencystretch}{1.5em} \raggedbottom \title[Balanced semiprimes in short intervals]{Balanced semiprimes in short intervals\\under the Riemann hypothesis} \author{Adam Henriksson} \date{21 November 2026} \begin{document} \begin{abstract} Assuming the Riemann hypothesis, we show that for every real $x\ge 9.6\cdot10^{37}$ the open interval of length $384\sqrt{x}(\log x)^2$ above $x$ contains at least $(14/3)\sqrt{x}$ distinct products of two primes of size comparable to $\sqrt{x}$. Their contribution to the sum of the least prime factor divided by the integer is at least $14/9$. For every fixed $C>0$, we also prove that the composite sum in an interval of length $C\sqrt{x}(\log x)^2$ is bounded above unconditionally and bounded away from zero under the Riemann hypothesis. We present a computer-assisted proof, verified in Lean~4, that the mean-square estimate of Chirre and Hagen implies the explicit count and weight bounds. The results have not been independently reviewed. \end{abstract} \maketitle \section{Introduction} Let $P^-(n)$ be the least prime factor of an integer $n\ge2$. Erd\H{o}s and Graham \cite[p.~92]{EG} ask whether the sum of $P^-(n)/n$ in an interval of length $C\sqrt{x}(\log x)^2$ above $x$ is bounded away from zero for some $C>0$ and all sufficiently large $x$. The interval sum in their text runs over all integers, although the preceding sum excludes primes. Tao \cite{Tao} notes that this distinction matters. A prime contributes~$1$ by itself, and under the Riemann hypothesis Cramér's prime-gap bound supplies a prime in every sufficiently large interval of this length \cite{Cramer,Dudek}. This implication for the all-integer sum is already recorded in \cite{GptErdos}. For the composite-only interpretation, Tao \cite{Tao} points to products $pq$ in which both primes have size $x^{1/2}(\log x)^{O(1)}$, and Zhang \cite[\S1.1]{Zhang} records this observation. We count products in a narrower range, with both primes within fixed multiples of $\sqrt{x}$. If $q1$ and $C>0$, write \[ H_C(x)=C\sqrt{x}(\log x)^2,\qquad \mu_C(x)=\sum_{\substack{x\le n\le x+H_C(x)\\ n\ \mathrm{composite}}} \frac{P^-(n)}{n}. \] All logarithms are natural. \begin{theorem}\label{th:explicit} Assume RH. For every real $x\ge9.6\cdot10^{37}$, at least $(14/3)\sqrt{x}$ distinct integers in $(x,x+H_{384}(x))$ have the form $pq$, where $p,q$ are primes and \[ \sqrt{x}/20$ the bounds take the following form. \begin{theorem}\label{th:every} There is an absolute constant $K$ such that, for each fixed $C>0$, we have $\mu_C(x)\le K(1+C)$ for all sufficiently large $x$ depending on $C$. Under RH, for each fixed $C>0$ there are constants $c_C>0$ and $x_C$ such that $\mu_C(x)\ge c_C$ for every real $x\ge x_C$. \end{theorem} Zeraoulia \cite[Proposition~4]{Zer} states a lower bound for intervals of length $C\sqrt{x}(\log x)^B$, with $B>2$, under a lower bound for the number of primes in each factor interval of length $(\log Y)^B$. At exponent~$2$, Zhang \cite[Hypothesis~1.5 and Theorem~1.7]{Zhang} obtains two-sided bounds from uniform upper and lower estimates for prime counts in short intervals. Our proof keeps $x$ fixed and varies the two intervals in which the factors are sought. An estimate for the mean square of the prime-counting error then suffices. \section{The explicit semiprime count} Write $\theta(y)=\sum_{p\le y}\log p$, with $p$ running over primes, and let $\pi(y)$ be the number of primes up to $y$. For $Y\ge1$ and $\delta>0$ put \[ J_\theta(Y,\delta)=\int_1^Y \big(\theta((1+\delta)v)-\theta(v)-\delta v\big)^2\,dv. \] Chirre and Hagen \cite[Theorem~3]{CH} prove under RH that \begin{equation}\label{eq:chirre} J_\theta(Y,\delta)\le 2.5571\,\delta Y^2\log^2(2.0001/\delta) \qquad (Y\ge10^{13},\quad 0<\delta\le10^{-13}). \end{equation} They apply this estimate to sums of two primes. For products, the two intervals start at $t$ and $x/t$. The point of the proof is to find many $t$ for which both intervals contain enough primes. \begin{proof}[Proof of Theorem~\ref{th:explicit}] Put $N=\sqrt{x}$, $L=\log N$ and $\delta=512L^2/N$. We first check the range of \eqref{eq:chirre}. Set $B=9797\cdot10^{15}$. Since $B^2<9.6\cdot10^{37}$, we have $N\ge B$. The rational inequalities \[ B^{15}< (1359/500)^{656},\qquad 1359/500<\sum_{j=0}^{6}1/j!e^2$, so \[ 0<\delta\le \frac{512(\log B)^2}{B} < \frac{512(656/15)^2}{B}<10^{-13}. \] Both $2N$ and $2N/3$ exceed $10^{13}$. Also $2.0001<512L^2=\delta N$, so $0<\log(2.0001/\delta)\le L$. The only two estimates we need are therefore \begin{equation}\label{eq:two} J_\theta(Y,\delta)\le 3\delta Y^2L^2,\qquad Y=2N,\;2N/3. \end{equation} Let $I=[3N/2,2N]$ and $J=[N/2,2N/3]$. The map $t\mapsto x/t$ takes $I$ onto $J$. Put $u=1+\delta$. In each interval call $v$ exceptional if $\theta(uv)-\theta(v)<\delta v/2$, and denote the two exceptional sets by $B_I$ and $B_J$. The absolute error $|\theta(uv)-\theta(v)-\delta v|$ is at least $3\delta N/4$ on $B_I$ and at least $\delta N/4$ on $B_J$. Writing $|E|$ for Lebesgue measure, we obtain from \eqref{eq:two} \[ |B_I|\le\frac{3\delta(2N)^2L^2}{(3\delta N/4)^2}=\frac N{24}, \qquad |B_J|\le\frac{3\delta(2N/3)^2L^2}{(\delta N/4)^2}=\frac N{24}. \] For $v\in J$ the inverse map has derivative of absolute value $x/v^2\le4$. Thus at most $4|B_J|$ of $I$, in measure, maps into $B_J$. The set $G$ of $t\in I$ for which neither $t$ nor $x/t$ is exceptional satisfies \begin{equation}\label{eq:good} |G|\ge N/2-|B_I|-4|B_J|\ge 7N/24. \end{equation} Let $A(v)=\pi(uv)-\pi(v)$. For $t\in G$ and $v=t$ or $v=x/t$, the primes counted by $A(v)$ are below $3N$. Hence $A(v)\log(3N)\ge\theta(uv)-\theta(v)\ge\delta v/2$. Using $t(x/t)=N^2$ and $\log(3N)\le2L$ gives \begin{equation}\label{eq:incidence} \int_I A(t)A(x/t)\,dt\ \ge\ |G|\frac{\delta^2N^2}{4\log^2(3N)} \ \ge\ \frac{7N}{24}\,\frac{\delta^2N^2}{16L^2}. \end{equation} For a fixed pair $(p,q)$, the conditions $tbS$. \end{proof} \begin{proof}[Proof of the lower bound in Theorem~\ref{th:every}] Given $C>0$, fix $r\ge\max(2,192/(bC))$. Write $N=\sqrt{x}$, $L=\log N$ and set \[ S=N/(2r),\qquad T=rN,\qquad \eta=CL^2/N,\qquad h=\eta S. \] Since $r$ is fixed and $h=CL^2/(2r)$, all sufficiently large $N$ satisfy $2\log S\le h\le S/4$. For $S\le s\le2S$, the second interval starts at $v=x/s\in[T,2T]$, since $x=2ST$. Apply \eqref{eq:chirre} at $Y=2T$ and $\delta=\eta$. We have $0<\eta\le10^{-13}$, $Y\ge10^{13}$ and $0<\log(2.0001/\eta)\le L$. The set of $v\in[T,2T]$ where $\theta((1+\eta)v)-\theta(v)<\eta v/2$ has measure at most \[ 3\eta(2T)^2 L^2/(\eta T/2)^2=48L^2/\eta. \] Under $s=x/v$ this set has preimage of measure at most \[ \frac{x}{T^2}\frac{48L^2}{\eta}=\frac{96S}{Cr}\le\frac{bS}{2}. \] Lemma~\ref{lem:supply} gives a set of measure at least $bS$ on which $A_h(s)\ge h/(4\log S)$. After removing this preimage, a set of measure at least $bS/2$ remains. For each such $s$ there are at least $h/(4L)$ primes $q\in(s,s+h]$ and at least $\eta T/(4L)$ primes $p\in(v,(1+\eta)v]$, since $\log S\le L$ and $\log(3T)\le2L$. A fixed pair $(q,p)$ can occur only for $q-h\le sx+H$. Every remaining composite thus has exactly two prime factors, counted with multiplicity. Write it as $pq$ with $yv$ and $q\le(1+d)x/p<(1+d)^2v$. For $d\le1$ this interval lies in $[S/2,2S]$ and its length is $dp/(1+d)\ge dS/2$. This also covers $p=q$ and products at either endpoint. On this range the first prime interval has length at most $2dS$. The variable $v$ lies in $[T/4,2T]$, its prime interval has length at most $6dT$, and $|dt/dv|\le16S/T$. Since $S\ge N/(CL)$ and $S\le2N$, we have $dS\ge4L$ and $dT\ge2CL^2$. Split the two ranges into intervals $[U,2U]$ starting at $S/2,S$ and $T/4,T/2,T$, respectively. The bounds on $S$ imply $L/2\le\log U\le2L$ uniformly for large $x$ depending on $C$. We may take $d\le1/96$ and $3CL\ge1$. Then $2dS$ lies between $4L$ and $S/8$, and $6dT$ between $4L$ and $T/16$. On every dyadic interval the respective fixed length thus lies in $[2\log U,U/4]$. Lemma~\ref{lem:supply} and the inverse derivative bound give \[ \int_{S/2}^{2S}A(t)^2\,dt\ll S(dS)^2/L^2,\qquad \int_{S/2}^{2S} B\!\left(\frac{x}{(1+d)t}\right)^2dt\ll S(dT)^2/L^2. \] If $M_S$ is the number of pairs in this band, the interval of length at least $dS/2$ found above gives \[ \frac{dS}{2}\,M_S \le\int_{S/2}^{2S} A(t)B\!\left(\frac{x}{(1+d)t}\right)\,dt \ll \frac{S(dS)(dT)}{L^2} \] by Cauchy--Schwarz. It follows that $M_S\ll dST/L^2=4CN$. Each product has weight $1/q=p/(pq)\le 2S/x$. The values of $S$ form a geometric progression with sum at most $4N$, so these bands contribute $O(C)$ in all. Together with the $O(1)$ from $p\le y$, this proves the upper bound. \end{proof} \appendix \input{supplement} \section*{Use of AI tools} The research, the programs and a draft of this paper were developed with the assistance of AI models. The main AI contributions to the proof came from GPT-6.2 Astra. The author is responsible for the content. \begin{thebibliography}{10} \bibitem{BLZ} D. Bazzanella, A. Languasco and A. Zaccagnini, \href{https://doi.org/10.1090/S0002-9947-09-05009-0}{Prime numbers in logarithmic intervals}, \emph{Trans. Amer. Math. Soc.} \textbf{362} (2010), 2667--2684. \bibitem{CH} A. Chirre and M. V. Hagen, \href{https://doi.org/10.1007/s40993-026-00767-6}{On Goldbach numbers in short intervals}, \emph{Res. Number Theory} \textbf{12} (2026), article 82. \bibitem{CD} M. Cully-Hugill and A. W. Dudek, \href{https://doi.org/10.1017/S1446788723000113}{An explicit mean-value estimate for the prime number theorem in intervals}, \emph{J. Aust. Math. Soc.} \textbf{117} (2024), 1--15. \bibitem{Cramer} H. Cramér, Some theorems concerning prime numbers, \emph{Ark. Mat. Astron. Fys.} \textbf{15} (1920), no.~5, 1--33. \bibitem{Dudek} A. W. Dudek, \href{https://doi.org/10.1142/S1793042115500426}{On the Riemann hypothesis and the difference between primes}, \emph{Int. J. Number Theory} \textbf{11} (2015), 771--778. \bibitem{EG} P. Erd\H{o}s and R. L. Graham, \href{https://mathweb.ucsd.edu/~ronspubs/80_11_number_theory.pdf\#page=88}{\emph{Old and New Problems and Results in Combinatorial Number Theory}}, Monographies de L'Enseignement Math\'ematique, vol.~28, Geneva, 1980. \bibitem{GptErdos} \texttt{gpt-erdos} project, Problem 462, \href{https://github.com/neelsomani/gpt-erdos/blob/7f6338357daa156aae565b6d8d43f8fe8532f07f/data/solutions/462/candidate_solution.md}{\texttt{candidate\_solution.md}}, revision \texttt{7f63383}. \bibitem{LeanLab} S. Hubbard, \href{https://github.com/sthubbar/lean-lab-preprints/blob/74c2d1ab2c2716ff50d5ace219ce45eab05adb51/LeanLab/ChirreHagen2025/ThetaPsi.lean}{LeanLab source for the comparison of $\theta$ and $\psi$}, \texttt{ThetaPsi.lean}, revision \texttt{74c2d1a}, 2026. \bibitem{Tao} T. Tao, \href{https://www.erdosproblems.com/forum/thread/462}{Comment on Erd\H{o}s Problem 462}, 28 September 2025. \bibitem{Zer} R. Zeraoulia, \href{https://www.researchgate.net/publication/400404179_Toward_Erdos-Graham_Problem_462_composite-only_exact_rough-number_and_semiprime_decompositions_averaged_progress_and_uniformity_frameworks}{Toward Erd\H{o}s--Graham Problem 462 (composite-only): exact rough-number and semiprime decompositions, averaged progress, and quantitative necessary conditions}, preprint, 3 February 2026. \bibitem{Zhang} X. Zhang, \href{https://arxiv.org/abs/2608.24930v2}{On the sum of least prime factors in short intervals}, arXiv:2608.24930v2, 2026. \bibitem{GMP} L. Grenié, G. Molteni and A. Perelli, \href{https://doi.org/10.1112/S0025579316000310}{Primes and prime ideals in short intervals}, \emph{Mathematika} \textbf{63} (2017), 364--371. \end{thebibliography} \end{document}