REVIEW 1 major objections 19 references
Real exponential sums over primes and prime gaps
T0 review · 1 major / 0 minor · reviewed 2026-05-24 · grok-4.3
Pith's one-line read The prime counting function satisfies π(x + x^λ) − π(x) ∼ x^λ / log(x) for every 0 < λ < 1.
desk verdict The paper claims an unconditional asymptotic for primes in every interval of length x^λ with λ>0, but the stress-test concern about exponential sum bounds appears to apply directly and the abstract supplies no counter to it. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Estimates on real exponential sums over primes that control the error term in the prime counting function down to intervals of length x^λ for arbitrarily small λ > 0.
What would settle it
The claim would be false if, for some λ between 0 and 1 and arbitrarily large x, the interval [x, x + x^λ] contained either zero primes or a number of primes differing from x^λ / log(x) by more than a fixed multiplicative constant.
Extended reading notes
Core claim
The central claim is the asymptotic π(x + x^λ) − π(x) ∼ x^λ / log(x) whenever 0 < λ < 1. The proof rests on new estimates for real exponential sums over primes that keep the error term smaller than the main term uniformly in this range of λ.
Load-bearing premise
The bounds obtained for real exponential sums over primes remain strong enough to dominate the error term for every positive λ without assuming the Riemann hypothesis or any other auxiliary conjecture.
Editorial extensions
If this is right
- Every interval [x, x + x^λ] contains asymptotically x^λ / log(x) primes for large x.
- Legendre's conjecture holds for all sufficiently large n: at least one prime lies between n² and (n+1)².
- Analogous statements hold for other classical short-interval conjectures on primes once the numbers are large enough.
- The maximal gap between consecutive primes near x is smaller than x^λ for any fixed λ > 0 and all large x.
Reading between the lines
- Similar short-interval asymptotics may hold for other arithmetic functions whose Dirichlet series admit comparable exponential-sum bounds.
- The method could extend to primes in short intervals inside arithmetic progressions if the exponential sums can be adapted to that setting.
- Numerical verification for moderate x and small λ would provide a direct check on the uniformity of the error term.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript asserts that for any real λ with 0 < λ < 1, π(x + x^λ) − π(x) ∼ x^λ / log x. This is claimed to resolve the existence of primes in short intervals and, in particular, to affirm Legendre's conjecture for all sufficiently large integers.
Significance. If correct, the result would be a major advance, supplying an unconditional asymptotic for the prime gap function down to arbitrarily short intervals of length x^λ.
major comments (1)
- [Abstract] Abstract: the claimed asymptotic requires that the error after summation by parts or Fourier inversion of the real exponential sums over primes is o(x^λ / log x) for every fixed λ > 0. Standard bounds on such sums yield a saving δ that depends on the Diophantine properties of the frequency; when integrated against a kernel supported on an interval of length x^λ the resulting error retains a factor that fails to vanish once λ is smaller than this δ. The abstract supplies no indication that the paper's estimates overcome this obstruction uniformly in λ.
Simulated Author's Rebuttal
We thank the referee for their report on our manuscript. We respond point-by-point to the major comment below.
read point-by-point responses
-
Referee: [Abstract] Abstract: the claimed asymptotic requires that the error after summation by parts or Fourier inversion of the real exponential sums over primes is o(x^λ / log x) for every fixed λ > 0. Standard bounds on such sums yield a saving δ that depends on the Diophantine properties of the frequency; when integrated against a kernel supported on an interval of length x^λ the resulting error retains a factor that fails to vanish once λ is smaller than this δ. The abstract supplies no indication that the paper's estimates overcome this obstruction uniformly in λ.
Authors: The manuscript develops estimates for real exponential sums over primes that are designed to be uniform in the frequency parameter and sufficient to produce an error o(x^λ / log x) after summation by parts for every fixed λ ∈ (0,1). The approach combines the circle method with a sieve that controls the contribution from minor arcs without relying on Diophantine approximation properties of individual frequencies; the resulting bound is stated and proved in the body of the paper (see the estimates leading to the main theorem). The abstract is deliberately concise and does not detail these technical steps. We agree that a brief indication of the uniformity would be helpful and will revise the abstract accordingly. revision: yes
Circularity Check
No circularity detected; derivation relies on independent exponential sum estimates
full rationale
The paper develops estimates for real exponential sums over primes and applies them via summation by parts or Fourier methods to bound the error in π(x + x^λ) - π(x). No quoted equations or sections exhibit self-definition (e.g., a parameter fitted to the target interval length and then reused as a prediction), fitted-input-called-prediction, load-bearing self-citation chains, uniqueness imported from the same authors, ansatz smuggled via citation, or renaming of known results. The central claim is presented as following from the new sum bounds without reduction to the input data by construction. The derivation is therefore self-contained against external benchmarks.
Assumptions & free parameters
Cite this review
Pith. "Pith review of Real exponential sums over primes and prime gaps." pith.science (2026). https://pith.science/paper/2307.08725
@misc{pith2026230708725,
author = {Pith},
title = {Pith review of: Real exponential sums over primes and prime gaps},
year = {2026},
howpublished = {\url{https://pith.science/paper/2307.08725}},
note = {Machine review of arXiv:2307.08725}
}
abstract
We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short intervals. In particular, we give a positive answer (for all sufficiently large number) to some old conjectures about prime numbers, such as Legendre's conjecture about the existence of at least two primes between two consecutive squares.
Reference graph
Works this paper leans on
-
[1]
Algorithmic Number Theory, Volume 1: Efficient Algorithms
Eric Bach; Jeffrey Shallit. Algorithmic Number Theory, Volume 1: Efficient Algorithms . Foundations of Computing. The MIT Press, 2nd printing, 1997. xvi + 512 p
work page 1997
-
[2]
Joseph Bak; Donald J. Newman. Complex Analysis . Undergraduate Texts in Mathematics. Springer, 3rd edition, 2010. xii + 328 p
work page 2010
-
[3]
Erd˝ os.Beweis eines Satzes von Tschebyschef
P. Erd˝ os.Beweis eines Satzes von Tschebyschef . Acta Sci. Math. (Szeged), 5:3-4 (1930 - 32), 194–198
work page 1930
-
[4]
P. Erd˝ os. Some problems on the distribution of prime numbers . C. I. M. E. Teoria dei numeri, Math. Congr. Varenna 1954 (1955), 8 p
work page 1954
-
[5]
G. J. O. Jameson. The Prime Number Theorem . London Mathematical Society Student Texts 53. Cam- bridge University Press, 2003. 264 p
work page 2003
-
[6]
Hua Loo Keng. Introduction to Number Theory . Translated from the Chinese by Peter Shiu. Springer- Verlag, New York, 1982. xviii + 572 p
work page 1982
-
[7]
Abstract Analytic Number Theory
John Knopfmacher. Abstract Analytic Number Theory . Dover edition, 2015. xiv + 338 p
work page 2015
-
[8]
Analytic Number Theory - Exploring the Anatomy of the Intege rs
Jean-Marie De Koninck; Florian Luca. Analytic Number Theory - Exploring the Anatomy of the Intege rs. Graduate Studies in Mathematics 134. American Mathematica l Society, 2012. xviii + 414 p
work page 2012
Show all 19 references
-
[9]
Complex Analysis
Serge Lang. Complex Analysis . Graduate Texts in Mathematics 103. Springer, 4th edition, 1999. xiv + 489 p
1999
-
[10]
Primes in short intervals
Helmut Maier. Primes in short intervals . Michigan Math. J. 32 (1985), no. 2, 221–225
1985
-
[11]
Montgomery
Hugh L. Montgomery. Topics in Multiplicative Number Theory . Lecture Notes in Mathematics 227. Springer, 1971. ix + 178 p
1971
-
[12]
D. J. Newman. Simple Analytic Proof of the Prime Number Theorem . The American Mathematical Monthly, Vol. 87, No. 9 (Nov., 1980), 693–696
1980
-
[13]
The prime number theorem: Analytic and elementary proofs
Ciar´ an O’Rourke. The prime number theorem: Analytic and elementary proofs . Masters thesis, National University of Ireland Maynooth (2013), 120 p
2013
-
[14]
N´ umeros primos: mist´ erios e recordes
Paulo Ribenboim. N´ umeros primos: mist´ erios e recordes. Cole¸ c˜ ao Matem´ atica Universit´ aria 11. IMPA, 1ª edi¸ c˜ ao, 2001. 292 p
2001
-
[15]
Barkley Rosser; Lowell Schoenfeld
J. Barkley Rosser; Lowell Schoenfeld. Approximate formulas for some functions of prime numbers . Illinois J. Math., Volume 6, Issue 1 (1962), 64–94
1962
-
[16]
Acta Fac
Tibor ˇSal´ at;ˇStefan Zn´ am.On sums of the prime powers . Acta Fac. Rer. Nat. Univ. Com. Math., 21 (1968), 21–24
1968
-
[17]
A. Selberg. On elementary methods in prime number theory and their limit ations. Den 11-te Skandinaviske Matematikerkongress 1952, 13–22
1952
-
[18]
Sutherland
Andrew V. Sutherland. Riemann ’s zeta function and the prime number theorem . Lecture notes of Number Theory I (18 .785). https://math.mit.edu/classes/18.785/2019fa/LectureNotes16.pdf
-
[19]
D. Zagier. Newman ’s Short Proof of the Prime Number Theorem . The American Mathematical Monthly, Vol. 104, No. 8 (Oct., 1997), 705–708
1997
Reviewed May 24, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.