\documentclass{amsart} \usepackage[utf8]{inputenc} \usepackage{amsmath,amssymb,amsthm} \usepackage{booktabs} \usepackage[hyphens]{url} \usepackage{verbatim} \sloppy \setlength{\emergencystretch}{6em} % Unicode declarations for pdflatex \DeclareUnicodeCharacter{2115}{\ensuremath{\mathbb{N}}} \DeclareUnicodeCharacter{211D}{\ensuremath{\mathbb{R}}} \DeclareUnicodeCharacter{2200}{\ensuremath{\forall}} \DeclareUnicodeCharacter{2203}{\ensuremath{\exists}} \DeclareUnicodeCharacter{2264}{\ensuremath{\le}} \DeclareUnicodeCharacter{2265}{\ensuremath{\ge}} \DeclareUnicodeCharacter{221A}{\ensuremath{\sqrt{}}} \DeclareUnicodeCharacter{03C0}{\ensuremath{\pi}} \DeclareUnicodeCharacter{03B3}{\ensuremath{\gamma}} \DeclareUnicodeCharacter{03B9}{\ensuremath{\iota}} \DeclareUnicodeCharacter{230A}{\ensuremath{\lfloor}} \DeclareUnicodeCharacter{230B}{\ensuremath{\rfloor}} \DeclareUnicodeCharacter{208A}{\ensuremath{_+}} \DeclareUnicodeCharacter{2227}{\ensuremath{\wedge}} \DeclareUnicodeCharacter{21A6}{\ensuremath{\mapsto}} \DeclareUnicodeCharacter{2192}{\ensuremath{\to}} \newtheorem{theorem}{Theorem}[section] \newtheorem{thmx}{Theorem} \renewcommand{\thethmx}{\Alph{thmx}} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \title[An explicit prime gap under the Riemann hypothesis]{An explicit prime gap under the Riemann hypothesis with an elementary prime power window and an updated zero count} \author{Steve Hubbard} \address{Independent Researcher} \begin{document} \begin{abstract} Dudek proved that if the Riemann hypothesis is true, then for every real $x \ge 2$ there is a prime in the interval $(x - (4/\pi)\sqrt{x}\log x, x]$. We give a proof of this statement in which each cited input is stated explicitly or replaced. With $h = (2/\pi)\sqrt{x}\log x$, the prime power contribution $\psi - \theta$ is needed only across the window $(x - h, x + h]$, and there it is bounded by an elementary count of squares and higher powers, without the Riemann hypothesis and without the bounds of Rosser and Schoenfeld. The sum over the nontrivial zeros is bounded from the explicit zero count of Hasanalizade, Shen and Wong for $T \ge 70$, by trading slack between the head and the tail of the sum at the split point $T = 2x/h$. The range $2 \le x < 67001$ is settled by a short table of prime gaps. The Riemann hypothesis is open and this note makes no progress on it. \end{abstract} \maketitle \section{Introduction} We cite A.~W.~Dudek, \emph{On the Riemann hypothesis and the difference between primes} \cite{Dudek}, by its journal version: all theorem, lemma, equation and page numbers of \cite{Dudek} below are those of Int.\ J.\ Number Theory 11 (2015), 771--778. The main result of \cite{Dudek} is the following. \begin{thmx}[Dudek {\cite[Theorem~1.2, p.~772]{Dudek}}]\label{thm:dudek} Suppose the Riemann hypothesis is true. Then there is a prime in the interval \[ \left(x - \frac{4}{\pi}\sqrt{x}\log x,\, x\right] \] for all $x \ge 2$. \end{thmx} This improves the constant $8/5$ of Ramar\'e and Saouter \cite[Theorem 1]{RaSa} to $4/\pi$. Later work went further: Dudek, Greni\'e and Molteni \cite[Theorem 1.1]{DGM} proved a prime in a symmetric interval of total length $(1 + 4/\log x)\sqrt{x}\log x$, and Carneiro, Milinovich and Soundararajan \cite[Theorem 5]{CMS} proved, under the Riemann hypothesis, that for $x \ge 4$ there is a prime in $[x, x + (22/25)\sqrt{x}\log x]$. Theorem~\ref{thm:dudek} is therefore not the best known constant. In \cite{Dudek}, Theorem~1.1, p.~771, which Dudek quotes from Cram\'er, gives a constant $c > 0$ with $\pi(x + c\sqrt{x}\log x) - \pi(x) > \sqrt{x}$ for all $x \ge 2$, and Theorem~1.3, p.~772, gives a prime in $(x - (1 + \varepsilon)\sqrt{x}\log x, x]$ for all sufficiently large $x$. This note gives a proof of Theorem~\ref{thm:dudek} that follows Dudek's argument and states every explicit input. Write \[ h(x) = \frac{2}{\pi}\sqrt{x}\log x, \qquad H(x) = 2h(x) = \frac{4}{\pi}\sqrt{x}\log x. \] \begin{theorem}\label{thm:main} Suppose the Riemann hypothesis is true. Then for every real $x \ge 2$ there is a prime $p$ with $x - H(x) < p \le x$. The proof uses, besides the Riemann hypothesis, only the explicit zero count \eqref{eq:hsw} of Hasanalizade, Shen and Wong \cite[Corollary~1.2]{HSW}, and the form of \cite[Lemma~2.1]{Dudek} stated in Section~\ref{sec:rest}. \end{theorem} The mathematical content of this note is two observations. The proof uses $\psi - \theta$ only across a short window, where the prime power mass is $O(\log^2 x)$ by counting (Section~\ref{sec:window}). The zero sum can be closed with a zero count whose constant is too large for separate head and tail bounds, by trading slack at the split point (Section~\ref{sec:zeros}). Neither is claimed as new. Section~\ref{sec:verif} describes the verification of these results and where the code is. \subsection*{Outline of Dudek's proof} Section 2 of \cite{Dudek} uses the weight $w(n) = 1 - |n - x|/h$ on the open interval $(x - h, x + h)$ together with \[ \psi_1(x) = \sum_{n \le x} (x - n)\Lambda(n) = \int_2^x \psi(t)\,dt, \] see \cite[p.~773]{Dudek}. The argument has five steps. \begin{enumerate} \item \textbf{Explicit formula for $\psi_1$, \cite[Lemma~2.1, p.~773]{Dudek}.} For $x > 0$, $x$ not an integer, \[ \psi_1(x) = \frac{x^2}{2} - \sum_{\rho} \frac{x^{\rho+1}}{\rho(\rho+1)} - x \log(2\pi) + \varepsilon(x), \qquad |\varepsilon(x)| < \frac{12}{5}, \] display (2.2), where $\rho$ runs over the nontrivial zeros of the Riemann zeta function. The proof bounds a sum over zeros by $2^{3/2}\sum_\rho 1/|\rho|^2$ and quotes the value of this sum from Davenport \cite{Da}. \item \textbf{Weighted prime-power sum, \cite[Lemma~2.2, p.~774]{Dudek}.} For $x > 0$ and $h > 0$, \[ \sum_{x - h < n < x + h} \Lambda(n) w(n) = h - \frac{1}{h} \Sigma + \varepsilon(h), \qquad |\varepsilon(h)| < \frac{48}{5h}, \] where \[ \Sigma = \sum_{\rho} \frac{(x+h)^{\rho+1} - 2x^{\rho+1} + (x-h)^{\rho+1}}{\rho(\rho+1)}. \] \item \textbf{Splitting the sum over zeros.} Writing $\rho = 1/2 + i\gamma$, the sum $\Sigma$ is split at $|\gamma| = \alpha x / h$. For the head, \cite[(2.4), p.~775]{Dudek} uses the zero count \[ N(T) < \frac{T \log T}{2\pi} \qquad \text{for } T > 15. \] This bound follows from Corollary~1 of Trudgian \cite{Tr}, which states that for $T \ge e$ \[ \left| N(T) - \frac{T}{2\pi}\log\frac{T}{2\pi e} - \frac{7}{8} \right| \le 0.112 \log T + 0.278 \log\log T + 2.510 + \frac{0.2}{T}, \] and which gives $N(T) < T\log T/(2\pi)$ for all $T \ge 8.55$. For the tail, \cite[p.~775]{Dudek} uses Lemma~1 (ii) of Skewes \cite{Sk}. \item \textbf{Passing from $\Lambda$ to primes.} Dudek uses Theorem 14 and equation (5.5) of Rosser and Schoenfeld \cite{RS}, \cite[p.~775]{Dudek}: \[ 0.98\sqrt{x} < \psi(x) - \theta(x) < 1.11\sqrt{x} + 3x^{1/3} \qquad \text{for } x \ge 121. \] \item \textbf{Positivity and the threshold.} With $\alpha = 2$ and $h = h(x)$, the first display of \cite[p.~776]{Dudek} states that $\sum_{x - h < p \le x + h} \log p$ exceeds \begin{align*} \operatorname{rhs}(x) &= h - \frac{2}{\pi}\left(\frac{x}{\sqrt{x-h}} + \frac{(x+h)^{3/2}}{x}\right)\log\left(\frac{2x}{h}\right) \\ &\quad - 1.11\sqrt{x+h} - 3(x+h)^{1/3} + 0.98\sqrt{x-h} - \frac{48}{5h}, \end{align*} which is positive for all $x \ge 65000$. Replacing $x + h$ by $x$ gives Theorem~\ref{thm:dudek} for \[ x \ge 65000 + \frac{2}{\pi}\sqrt{65000}\log 65000 \approx 66798.7, \] at the end of Section 2.2 of \cite{Dudek}, p.~776. The remaining values of $x$ were checked there by a Mathematica computation. \end{enumerate} Table~\ref{tab:comparison} lists how the inputs of the printed proof are used here. Four cited inputs are replaced: the zero count of \cite{Tr}, the bound of \cite{RS}, the tail bound of \cite{Sk} and the value from \cite{Da}. The zero count of \cite{HSW} is a choice of input; this note does not examine whether the input of \cite{Tr} also suffices for the argument below. \begin{table}[ht] \centering \caption{Inputs of the printed proof of \cite{Dudek} and of the proof given here.} \label{tab:comparison} {\small \begin{tabular}{@{}p{0.22\textwidth}p{0.34\textwidth}p{0.36\textwidth}@{}} \toprule Component & Printed proof \cite{Dudek} & This note \\ \midrule Zero hypothesis & Riemann hypothesis & Riemann hypothesis \\ Zero count & \cite[Corollary 1]{Tr}, as (2.4), $T > 15$ & \cite[Corollary 1.2]{HSW}, as \eqref{eq:hsw}, $T \ge 70$ \\ Prime power step & \cite{RS}, for $x \ge 121$ & Proposition~\ref{prop:window}, by counting \\ $\psi_1$ error bound & $|\varepsilon(x)| < 12/5$ & $|\varepsilon(y)| \le 2.393$, all $y > 0$ \\ Sum $\sum_\rho 1/|\rho|^2$ & Value from Davenport \cite{Da} & Not used \\ Tail of $\sum 1/\gamma^2$ & Lemma 1 (ii) of Skewes \cite{Sk} & From \eqref{eq:hsw}, step 2 of Section~\ref{sec:zeros} \\ Large range & $x \ge 65000$, $X \gtrsim 66798.7$ & $x \ge 65000$, $X \ge 66799$ \\ Small range & Mathematica, no table printed & Table~\ref{tab:gaps}, $2 \le x < 67001$ \\ \bottomrule \end{tabular} } \end{table} \section{The prime power window}\label{sec:window} The proof of Theorem~\ref{thm:dudek} uses the difference $\psi - \theta$ only through its increment across the window $(x - h, x + h]$. The two-sided bound of Rosser and Schoenfeld \cite{RS} implies the following window bound, which is therefore all that Dudek's argument requires; we prove it directly. \begin{proposition}\label{prop:window} For every real $x \ge 65000$, with $h = h(x) = (2/\pi)\sqrt{x}\log x$, \[ \bigl(\psi(x+h) - \theta(x+h)\bigr) - \bigl(\psi(x-h) - \theta(x-h)\bigr) < 1.11\sqrt{x+h} + 3(x+h)^{1/3} - 0.98\sqrt{x-h}. \] \end{proposition} The proof goes through the following bound on the mass of the window. \begin{lemma}\label{lem:mass} Let $1 \le a \le b$ be real numbers with $b^{1/3} < a^{1/3} + 1$. Then \[ \bigl(\psi(b) - \theta(b)\bigr) - \bigl(\psi(a) - \theta(a)\bigr) \le \frac{\log b}{2}\bigl(\sqrt{b} - \sqrt{a} + 1\bigr) + \frac{(\log b)^2}{3\log 2}. \] \end{lemma} \begin{proof} Since $\psi(y) = \sum_{n \le y} \Lambda(n)$ and $\theta(y) = \sum_{p \le y} \log p$, the difference $\psi(y) - \theta(y)$ is the sum of $\Lambda(n)$ over non-prime integers $n \le y$. Consequently, the left side of the lemma is precisely the von Mangoldt mass of the prime powers $p^k$ with $k \ge 2$ lying in the interval $(a, b]$. First, the non-prime von Mangoldt mass over a natural-number interval $(A, B]$ with $A \le B$ satisfies \[ \sum_{\substack{A < n \le B \\ n \text{ not prime}}} \Lambda(n) \le \sum_{2 \le k \le \log_2 B} \frac{\log B}{k} \cdot \#\{m \in \mathbb{N} : A < m^k \le B\}. \] Indeed, every non-prime $n \in (A, B]$ with $\Lambda(n) \ne 0$ is of the form $n = p^k$ for a prime $p$ and an integer $k \ge 2$ satisfying $k \le \log_2 B$. For such $n$, its von Mangoldt weight satisfies \[ \Lambda(n) = \log p = \frac{\log(p^k)}{k} \le \frac{\log B}{k}, \] and for each fixed exponent $k$, the map $n \mapsto p$ is injective. Second, for real numbers $0 \le a \le b$, the number of $k$-th powers in the integer interval $(\lfloor a \rfloor, \lfloor b \rfloor]$ satisfies \[ \#\{m \in \mathbb{N} : \lfloor a \rfloor < m^k \le \lfloor b \rfloor\} \le b^{1/k} - a^{1/k} + 1. \] Applying these two bounds separates the prime powers in $(a, b]$ into squares, $k = 2$, and higher powers, $3 \le k \le \log_2 b$: \begin{itemize} \item For $k = 2$, there are at most $\sqrt{b} - \sqrt{a} + 1$ squares in $(a, b]$, each carrying weight $\log p \le \frac{1}{2}\log b$. \item For each $3 \le k \le \log_2 b$, the bound $b^{1/k} < a^{1/k} + 1$ follows from the case $k = 3$, since $b^{1/k} - a^{1/k}$ decreases as $k$ increases when $b \ge a \ge 1$; so there is at most one $k$-th power in $(a, b]$, carrying weight $\log p \le \frac{1}{k}\log b \le \frac{1}{3}\log b$. \end{itemize} There are at most $\log b/\log 2$ exponents $k$, which gives the last term. \end{proof} \begin{proof}[Proof of Proposition \ref{prop:window}] Let $h = h(x)$, $a = x - h$, $b = x + h$, $u = x^{1/6}$, $L = \log x$ and $M = \log b$. For all $x \ge 65000$, \[ u \ge 6.34, \qquad L \le 1.5u + 2.32, \qquad L \ge 11, \qquad h \le 0.63662\,u^3 L. \] These give $h \le x/10$, so $0.9x \le a$ and $b \le 1.1x$. Hence $\sqrt{a} \ge 0.948\,u^3$, and $(\sqrt{b} - \sqrt{a})(\sqrt{b} + \sqrt{a}) = 2h$ gives $\sqrt{b} - \sqrt{a} \le 0.6716\,L$. Also $a^{1/3} \ge 0.965\,u^2$ gives $b < (a^{1/3} + 1)^3$, so Lemma \ref{lem:mass} applies. Further $L \le M \le L + 0.1 \le 1.5u + 2.42$. Since $\sqrt{a} \le u^3 \le \sqrt{b}$ and $u^2 \le b^{1/3}$, the target satisfies \[ 1.11\sqrt{b} + 3b^{1/3} - 0.98\sqrt{a} \ge 0.13\,u^3 + 3u^2. \] By Lemma \ref{lem:mass} and $3\log 2 \ge 2.0794$, the window mass is at most \[ \frac{M}{2}(0.6716\,M + 1) + \frac{M^2}{2.0794} \le 0.8168\,M^2 + 0.5\,M. \] Substituting $M \le 1.5u + 2.42$, the proof closes with the polynomial inequality \[ 0.8168\,(1.5u + 2.42)^2 + 0.5\,(1.5u + 2.42) < 0.13\,u^3 + 3u^2 \qquad \text{for } u \ge 6.34. \] Indeed the left side is at most $1.8378\,u^2 + 6.681\,u + 5.994$, so the difference of the two sides is at least $0.13\,u^3 + 1.1622\,u^2 - 6.681\,u - 5.994$, which exceeds $31$ at $u = 6.34$ and is increasing for $u \ge 2$. \end{proof} \section{The zero sum from the Hasanalizade, Shen and Wong count}\label{sec:zeros} Let $N(T)$ be the number of zeros $\rho = \beta + i\gamma$ of the Riemann zeta function with $0 < \beta < 1$ and $0 < \gamma \le T$, counted with multiplicity. Hasanalizade, Shen and Wong \cite[Corollary~1.2, p.~221, display (1.5)]{HSW} prove that for $T \ge e$ \[ |N(T) - M(T)| \le R(T), \] where \[ M(T) = \frac{T}{2\pi}\log\left(\frac{T}{2\pi e}\right), \qquad R(T) = 0.1038 \log T + 0.2573 \log\log T + 9.3675. \] By the symmetry of the zeros, it follows that for $70 \le T \le t$ \begin{equation}\label{eq:hsw} \begin{aligned} \#\{\rho : |\gamma| \le T\} &\le 2\bigl(M(T) + R(T)\bigr) + \tfrac{7}{2}, \\ \#\{\rho : T < |\gamma| \le t\} &\le 2\bigl(M(t) + R(t)\bigr) - 2\bigl(M(T) - R(T)\bigr) + \tfrac{7}{2}, \end{aligned} \end{equation} with multiplicity. The constant $7/2$ is not needed; keeping it makes the constants below match those of Section~\ref{sec:verif}. Only \eqref{eq:hsw} is used below. \begin{proposition}\label{prop:sigma} Let $(\gamma_i)$ be any family of real numbers satisfying \eqref{eq:hsw} in place of the ordinates of the zeros, and let $\Sigma$ be the sum of \cite[Lemma~2.2]{Dudek} over $\rho_i = 1/2 + i\gamma_i$. For every $x \ge 65000$, with $h = h(x)$, \[ |\Sigma| \le \left(\frac{2xh}{\pi\sqrt{x-h}} + \frac{4h(x+h)^{3/2}}{2\pi x}\right)\log\left(\frac{2x}{h}\right). \] \end{proposition} This proposition takes no Riemann hypothesis. The hypothesis enters only when the family $(\gamma_i)$ is taken to be the ordinates of the nontrivial zeros, so that $\rho_i = 1/2 + i\gamma_i$ are the zeros themselves. The bound has the same form as \cite[(2.5) and p.~776, $\alpha = 2$]{Dudek}. The route differs. From \eqref{eq:hsw}, with its constant $9.3675$, the separate head and tail estimates that would give this form do not both hold near $T = 70$: the tail inequality \[ \sum_{|\gamma| > T} \frac{1}{\gamma^2} \le \frac{\log T}{\pi T} \] needs about $T \ge 170$, while at the split point $T = 2x/h$ with $x \ge 65000$ we only know $T \ge 70$. \begin{proof}[Proof of Proposition~\ref{prop:sigma}] Keep the split at $T = 2x/h$ and trade slack between head and tail in four steps. \begin{enumerate} \item \textbf{Head slack.} For all $T \ge 70$, the first inequality of \eqref{eq:hsw} implies \[ \#\{|\gamma| \le T\} \le \frac{T \log T}{\pi} - \bigl(0.89\,T - 22.25 - 0.502 \log T\bigr), \] so the head count has a positive slack of about $0.89\,T$ below the main term $(T \log T)/\pi$. Indeed, \[ 2M(T) = \frac{T \log T}{\pi} - \frac{\log(2\pi) + 1}{\pi}\,T, \qquad \frac{\log(2\pi) + 1}{\pi} \ge 0.89, \] and for $T \ge 70$ one has $R(T) \le 0.251 \log T + 9.375$, so $2R(T) + 7/2 \le 0.502 \log T + 22.25$. Write $S(T) = 0.89\,T - 22.25 - 0.502 \log T$ for this slack. \item \textbf{Tail with excess.} For $T \ge 70$, partial summation against the second inequality of \eqref{eq:hsw} gives \[ \sum_{|\gamma| > T} \frac{1}{\gamma^2} \le \frac{\log T}{\pi T} + \frac{E(T)}{T^2}, \qquad E(T) = 1.004 \log T + 41.26 - 0.25\,T, \] and the excess $E(T)$ is positive until about $T = 187$. For $T \ge 70$ one has $S(T) \ge 0$ and $1.1\,E(T) \le S(T)$. \item \textbf{Comparison of head and tail weights.} Let \[ a = h^2(x-h)^{-1/2} \qquad \text{and} \qquad B = 4(x+h)^{3/2} \] denote the head weight and tail weight, respectively. If $35h \le x$, which is equivalent to $T = 2x/h \ge 70$, then \[ B \le 1.1\,a\,T^2. \] \item \textbf{Combined split bound.} Let $D_i$ denote the second-difference term \[ D_i = \frac{(x+h)^{\rho_i+1} - 2x^{\rho_i+1} + (x-h)^{\rho_i+1}}{\rho_i(\rho_i+1)} \] for the $i$-th zero. Each head term has $\|D_i\| \le a$, by the integral representation of \cite[p.~774]{Dudek}, and each tail term has $\|D_i\| \le B/\gamma_i^2$, as in \cite[p.~775]{Dudek}. The head count and the tail bound give \[ \sum_{i} \|D_i\| \le \left(\frac{T \log T}{\pi} - S(T)\right) a + B\left(\frac{\log T}{\pi T} + \frac{E(T)}{T^2}\right). \] Using $B \le 1.1\,a\,T^2$ and $1.1\,E(T) \le S(T)$, the excess from the tail sum is absorbed into the slack of the head count, which yields \[ \sum_{i} \|D_i\| \le \frac{T \log T}{\pi}\,a + \frac{B \log T}{\pi T}. \] Since $|\Sigma| \le \sum_i \|D_i\|$, substituting $T = 2x/h$, $a = h^2(x-h)^{-1/2}$, and $B = 4(x+h)^{3/2}$, this upper bound equals the right side of Proposition~\ref{prop:sigma}. \end{enumerate} \end{proof} \section{Completion of the proof}\label{sec:rest} \begin{itemize} \item \textbf{Lemmas 2.1 and 2.2 of \cite{Dudek}.} We use Lemma 2.1 of \cite{Dudek} in the form \[ \left|\psi_1(y) - \left(\frac{y^2}{2} - Z(y) - y \log(2\pi)\right)\right| \le 2.393 \qquad (y > 0), \] where $Z(y)$ is the zero sum for $y > 1$, integer $y$ allowed. The bound is below the printed $12/5 = 2.4$, and its proof does not use the value of $\sum_\rho 1/|\rho|^2$; it is part of the checked development of Section~\ref{sec:verif}. For $y \le 1$ only the identity is needed, and the proof below uses $Z$ only for $y > 1$. Lemma 2.2 of \cite{Dudek} follows by taking the second difference across $x - h, x, x + h$, with error at most $48/(5h)$; we use it for $h < x$, which holds for $x \ge 65000$. \item \textbf{Primes in the window for $x \ge 65000$.} Let $h = h(x)$. Since $35 h \le x$, the split point $T = 2x/h$ is at least $70$. As $0 \le w \le 1$ and $\Lambda \ge 0$, Lemma 2.2 of \cite{Dudek} and Proposition~\ref{prop:sigma} give \[ \psi(x+h) - \psi(x-h) > h - \frac{2}{\pi}\left(\frac{x}{\sqrt{x-h}} + \frac{(x+h)^{3/2}}{x}\right)\log\left(\frac{2x}{h}\right) - \frac{48}{5h}, \] and subtracting the bound of Proposition~\ref{prop:window} gives $\sum_{x - h < p \le x + h} \log p > \operatorname{rhs}(x)$. By the monotonicity argument of \cite[p.~776]{Dudek}, made explicit by elementary bounds on each term, $\operatorname{rhs}(x) > 0$ for every real $x \ge 65000$, so there is a prime in $(x - h, x + h]$. \item \textbf{Large range.} Let $X \ge 66799$. The map $x \mapsto x + h(x)$ is continuous and increasing, and $65000 + h(65000) \le 66799$, so there is $x \ge 65000$ with $x + h(x) = X$. A prime $p$ in $(x - h(x), x + h(x)]$ satisfies $p \le X$ and $p > X - 2h(x) = X - H(x) \ge X - H(X)$, as $H$ is increasing. \item \textbf{Small range.} For every integer $n$ with $2 \le n \le 67000$ there is a prime $p \le n$ with $n - p < g$, where $g$ is the gap of the row of Table~\ref{tab:gaps} that contains $n$; the largest values of $n - p$ in the six rows are $0, 1, 1, 3, 13, 71$. Let $x$ be real with $2 \le x < 67001$, put $n = \lfloor x \rfloor$, and take this prime $p$. Then $p \le n \le x$, and since $n - p \le g - 1$ and $x < n + 1$, \[ x - p < n + 1 - p \le g. \] If the row of $n$ starts at $t$, then $g \le H(t) \le H(x)$ because $t \le x$ and $H$ is increasing, so $x - H(x) < p \le x$. This uses no Riemann hypothesis. \end{itemize} Since $[2, 67001)$ and $[66799, \infty)$ overlap, Theorem~\ref{thm:main} follows. \begin{table}[ht] \centering \caption{Prime gap data for $2 \le x < 67001$. Each integer $n$ in a row has a prime $p \le n$ with $n - p < g$.} \label{tab:gaps} {\small \begin{tabular}{@{}rrr@{}} \toprule Integers $n$ & Gap $g$ & $H(t)$ at the first $n = t$, about \\ \midrule $2$ & $1$ & $1.25$ \\ $3$ to $4$ & $2$ & $2.42$ \\ $5$ to $6$ & $2$ & $4.58$ \\ $7$ to $22$ & $4$ & $6.56$ \\ $23$ to $199$ & $14$ & $19.15$ \\ $200$ to $67000$ & $72$ & $95.40$ \\ \bottomrule \end{tabular} } \end{table} \subsection*{Cited inputs} Table \ref{tab:inputs} lists every cited input of the printed proof and of the proof here, with the page of the source that was read. \begin{table}[ht] \centering \caption{Cited inputs: source and page, printed statement, and use.} \label{tab:inputs} {\footnotesize \begin{tabular}{@{}p{0.17\textwidth}p{0.16\textwidth}p{0.36\textwidth}p{0.21\textwidth}@{}} \toprule Input & Page & Printed statement & Use \\ \midrule Corollary 1.2 of \cite{HSW} & p.\ 221, display 1.5 & $|N(T) - \frac{T}{2\pi}\log\frac{T}{2\pi e}| \le 0.1038 \log T + 0.2573 \log\log T + 9.3675$ for $T \ge e$ & Used for $T \ge 70$, as \eqref{eq:hsw} \\ Corollary 1 of \cite{Tr} & Section 1; used in \cite{Dudek}, p.\ 775 & $|N(T) - \frac{T}{2\pi}\log\frac{T}{2\pi e} - \frac{7}{8}| \le 0.112 \log T + 0.278 \log\log T + 2.510 + 0.2/T$ for $T \ge e$, giving $N(T) < T \log T/(2\pi)$ for $T \ge 8.55$ & Replaced by \eqref{eq:hsw} \\ Theorem 14 and (5.5) of \cite{RS} & pp.\ 71, 77; used in \cite{Dudek}, p.\ 775 & $0.98\sqrt{x} < \psi(x) - \theta(x)$ for $x \ge 121$; $\psi(x) - \theta(x) < 1.11\sqrt{x} + 3x^{1/3}$ for $x > 0$ & Replaced by Proposition~\ref{prop:window} \\ Lemma 1 (ii) of \cite{Sk} & p.\ 50; used in \cite{Dudek}, p.\ 775 & $\sum_{\gamma \ge T} 1/\gamma^2 < \log T/(2\pi T)$ for $T \ge \gamma_1$ & Replaced, from \eqref{eq:hsw} \\ Value of $\sum_\rho 1/|\rho|^2$, \cite{Da} & pp.\ 81--82; used in \cite{Dudek}, p.\ 773 & $\gamma + 2 - \log 4\pi$ under the Riemann hypothesis & Not used \\ \bottomrule \end{tabular} } \end{table} \section{Verification}\label{sec:verif} The main results of this note are checked in Lean 4 with Mathlib \cite{Mathlib}, version \texttt{v4.35.0-rc3}, in the repository \url{https://github.com/sthubbar/goldbach-lean}, directory \texttt{entries/dudek2014}, commit \texttt{da5cf9edad7896290771dfcab8feee2906399e3d} \cite{Repo}, registered as Palomar entry \texttt{PALOMAR-2026-11-01-000028}, version 1 \cite{Palomar}. Theorem~\ref{thm:main} is \begin{center} {\footnotesize \texttt{LeanLab.PNTPort.ExplicitPsi1.Trivial.theorem2\_of\_RH\_hsw},} \end{center} which proves \texttt{PrimeInDudekInterval x} for all real $x \ge 2$, with \texttt{dudekH} the function $H$. It takes two hypotheses, neither declared as an axiom. The first, \texttt{RiemannHypothesis}, is the Riemann hypothesis as stated in Mathlib. The second, \texttt{HSWN70 gZ}, is \eqref{eq:hsw} for the ordinates of the nontrivial zeros counted with multiplicity, written with main term $M + 7/8$ and remainder $R + 7/8$; it is taken from Corollary~1.2 of Hasanalizade, Shen and Wong \cite{HSW} and is not proved in Lean, and the step from that corollary to \eqref{eq:hsw} is argued by hand in Section~\ref{sec:zeros}. Proposition~\ref{prop:window}, Lemma~\ref{lem:mass}, Proposition~\ref{prop:sigma}, the form of Lemma~2.1 of \cite{Dudek} with $2.393$, the positivity of $\operatorname{rhs}$ and the small range are \texttt{window\_holds}, \texttt{mass\_le}, \texttt{sigmaBd\_of\_hsw}, \texttt{lemma4\_Zpatch}, \texttt{rhs\_pos} and \texttt{small\_range}; the last evaluates Table~\ref{tab:gaps} in the kernel. Under the same two hypotheses the repository also proves Theorem~1.1 of \cite{Dudek} with $c = 10^8$ and Theorem~1.3 of \cite{Dudek}, as \texttt{theorem1\_of\_RH\_hsw} and \texttt{theorem3\_of\_RH\_hsw}; their proofs are not given in this note. Code availability. In \texttt{entries/dudek2014}, run \texttt{lake exe cache get}, \texttt{lake build} and \texttt{lake comparator --config=comparator-dudek2014.json}; the comparator checks against \texttt{ChallengeDudek2014.lean}. The axioms used are \texttt{propext}, \texttt{Quot.sound} and \texttt{Classical.choice}, with no \texttt{sorry}. Sixteen files under \texttt{LeanLab/PNTPort/StrongPNT} are from \texttt{PrimeNumberTheoremAnd} \cite{PNT}, commit \texttt{c39a751132c88b6e8080b74c74023fd95b3d8be0}, Apache-2.0, credited to its contributors. \medskip \noindent Steve Hubbard designed the research program and directed this work. AI tools, Claude and Gemini, were used to write the Lean code and draft the text. The author takes full responsibility for the content. \begin{thebibliography}{9} \bibitem[Dudek]{Dudek} A.~W.~Dudek, \emph{On the Riemann hypothesis and the difference between primes}, Int.\ J.\ Number Theory 11 (2015), no.\ 3, 771--778, doi:10.1142/S1793042115500426; preprint arXiv:1402.6417. \bibitem[HSW]{HSW} E.~Hasanalizade, Q.~Shen and P.-J.~Wong, \emph{Counting zeros of the Riemann zeta function}, J.\ Number Theory 235 (2022), 219--241, arXiv:2107.06506. \bibitem[CMS]{CMS} E.~Carneiro, M.~B.~Milinovich and K.~Soundararajan, \emph{Fourier optimization and prime gaps}, arXiv:1708.04122v2, first posted 2017, doi:10.4171/CMH/467. \bibitem[Da]{Da} H.~Davenport, \emph{Multiplicative Number Theory}, Springer, 1980. \bibitem[DGM]{DGM} A.~W.~Dudek, L.~Greni\'e and G.~Molteni, \emph{Primes in explicit short intervals on RH}, Int.\ J.\ Number Theory 12 (2016), no.\ 5, 1391--1407, arXiv:1503.05403. \bibitem[Sk]{Sk} S.~Skewes, \emph{On the difference $\pi(x) - \operatorname{li}(x)$ II}, Proc.\ London Math.\ Soc.\ (3) 5 (1955), 48--70. \bibitem[RS]{RS} J.~B.~Rosser and L.~Schoenfeld, \emph{Approximate formulas for some functions of prime numbers}, Illinois J.\ Math.\ 6, 1962, no.\ 1, 64--94. \bibitem[RaSa]{RaSa} O.~Ramar\'e and Y.~Saouter, \emph{Short effective intervals containing primes}, J.\ Number Theory 98, 2003, no.\ 1, 10--33. \bibitem[Tr]{Tr} T.~S.~Trudgian, \emph{An improved upper bound for the argument of the Riemann zeta-function on the critical line II}, J.\ Number Theory 134 (2014), 280--292, doi:10.1016/j.jnt.2013.07.017. \bibitem[Palomar]{Palomar} Palomar registry, entry \texttt{PALOMAR-2026-11-01-000028}, version 1, \url{https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-01-000028&version=1}. \bibitem[Repo]{Repo} S.~Hubbard, \texttt{goldbach-lean} repository, directory \texttt{entries/dudek2014}, commit \texttt{da5cf9edad7896290771dfcab8feee2906399e3d}, \url{https://github.com/sthubbar/goldbach-lean}. \bibitem[PNT]{PNT} \texttt{PrimeNumberTheoremAnd}, \url{https://github.com/AlexKontorovich/PrimeNumberTheoremAnd}, commit \texttt{c39a751132c88b6e8080b74c74023fd95b3d8be0}. \bibitem[Mathlib]{Mathlib} The mathlib Community, \emph{The Lean mathematical library}, \url{https://github.com/leanprover-community/mathlib4}, version \texttt{v4.35.0-rc3}. \end{thebibliography} \end{document}