Refinements for primes in short arithmetic progressions
Pith reviewed 2026-05-22 00:43 UTC · model grok-4.3
The pith
Under the Generalized Density Hypothesis, the prime number theorem holds for arithmetic progressions in all intervals of length roughly sqrt(x) times exp(log x to the 2/3) and almost all intervals of length exp(log x to the 2/3).
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Given a zero-free region and an averaged zero-density estimate over all Dirichlet L-functions modulo q, the error terms of the prime number theorem in all and almost all short arithmetic progressions can be refined. For example, if the Generalized Density Hypothesis is assumed, then for any arithmetic progression modulo q ≤ log^ℓ x with ℓ > 0 and any ε > 0, the prime number theorem holds in all intervals (x − √x exp(log^{2/3+ε} x), x] and almost all intervals (x − exp(log^{2/3+ε} x), x] as x → ∞. This refines the classic intervals (x − x^{1/2+ε}, x] and (x − x^ε, x] for any ε > 0.
What carries the argument
Averaged zero-density estimates for the family of Dirichlet L-functions modulo q, combined with a zero-free region, to bound the remainder in the prime counting function inside short intervals.
Load-bearing premise
The existence of a zero-free region together with an averaged zero-density estimate for the Dirichlet L-functions modulo q.
What would settle it
A concrete modulus q ≤ log^ℓ x and an interval of the claimed length in which the number of primes in a given residue class differs from the main term by more than the error bound permitted under the Generalized Density Hypothesis.
read the original abstract
Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example, if we assume the Generalized Density Hypothesis, then for any arithmetic progression modulo $q\leq \log^{\ell} x$ with $\ell>0$ and any $\varepsilon>0$, the prime number theorem holds in all intervals $(x-\sqrt{x}\exp(\log^{\frac{2}{3}+\varepsilon} x),x]$ and almost all intervals $(x-\exp(\log^{\frac{2}{3}+\varepsilon} x),x]$ as $x\rightarrow\infty$. This refines the classic intervals $(x-x^{1/2+\varepsilon},x]$ and $(x-x^\varepsilon,x]$ for any $\varepsilon>0$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript assumes a zero-free region and an averaged zero-density estimate over Dirichlet L-functions modulo q. Under these hypotheses, it refines the error terms in the prime number theorem for primes in arithmetic progressions with modulus q ≤ log^ℓ x. In particular, assuming the Generalized Density Hypothesis, the prime number theorem holds in all intervals (x − √x exp(log^{2/3+ε} x), x] and in almost all intervals (x − exp(log^{2/3+ε} x), x] for any ε > 0. This improves upon the classical intervals of length x^{1/2+ε} and x^ε respectively.
Significance. If the stated hypotheses hold, the work yields sharper conditional bounds on the distribution of primes in short arithmetic progressions with small moduli, obtained via standard contour integration and zero-density arguments. The averaged estimates permit a uniform treatment across all q up to a polylogarithmic range, which is a modest but useful technical improvement over pointwise estimates. The results are explicitly conditional and do not claim unconditional progress.
minor comments (3)
- The precise statement of the assumed zero-free region (e.g., the width in terms of q and t) should be displayed explicitly in the introduction or §2 rather than left implicit in the abstract.
- Notation for the averaged zero-density estimate (presumably something like an integral over |ρ| ≤ T of N(σ, T, q) or similar) should be introduced with a numbered display equation before it is invoked in the main theorems.
- The transition from the general hypotheses to the specific GDH case in the example could include a short remark clarifying which parameters in the zero-density estimate are optimized under GDH.
Simulated Author's Rebuttal
We thank the referee for their positive assessment and for recommending minor revision. The report correctly captures the conditional nature of our results and the improvements obtained via averaged zero-density estimates under the Generalized Density Hypothesis.
Circularity Check
No significant circularity detected
full rationale
The paper conditions all results on external hypotheses (zero-free region, averaged zero-density estimates over Dirichlet L-functions modulo q, and the Generalized Density Hypothesis) and derives the refined short-interval PNT statements via standard contour integration and zero-density arguments. No equation or step reduces by construction to a fitted parameter, self-defined quantity, or load-bearing self-citation; the q ≤ log^ℓ x restriction is handled uniformly under the stated averaged estimates. The derivation is therefore self-contained against its explicit inputs.
Axiom & Free-Parameter Ledger
axioms (3)
- domain assumption Generalized Density Hypothesis
- domain assumption Existence of a zero-free region for Dirichlet L-functions
- domain assumption Averaged zero-density estimate over Dirichlet L-functions modulo q
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Assume Conditions 1.1 & 1.2 with η0 < 1/A. ... |Δϑ(x, y, q, a)| ≪ |y|/x B(x, q) + |y|τ(x^{1−1/A})^{1−τ} q log² qx (g(q,x)/(q² log qx))τ
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Forward citations
Cited by 2 Pith papers
-
Binomial coefficients with divisors avoiding an interval
Authors establish the Erdős-Graham conjecture for large k and provide GRH-conditional counterexamples for small k using sieves and exponential sums.
-
On the Goldbach problem with restricted primes
Proves asymptotic for the number of ternary Goldbach representations of large odd N with one prime bounded by U = N^{4/49} exp(log^{2/3+ε}N) unconditionally or log^{4+ε}N under GRH.
Reference graph
Works this paper leans on
-
[1]
B. Chen, Large value estimates for Dirichlet polynomials, and the density of zeros of Dirichlet's L-functions, arXiv: 2507.08296v1
-
[2]
M. Cully-Hugill, D. R. Johnston, On the error term in the explicit formula of Riemann-von Mangoldt II, arXiv: 2402.04272v2
-
[3]
Gallagher, A large sieve density estimate near =1 , Invent
P.X. Gallagher, A large sieve density estimate near =1 , Invent. Math. 11 (1970), 329–-339
work page 1970
-
[4]
L. Guth, J. Maynard, New large value estimates for Dirichlet polynomials, arXiv:2405.20552
work page internal anchor Pith review Pith/arXiv arXiv
-
[5]
D. A. Goldston, C. Y. Yildirim, Primes in short segments of arithmetic progressions, Can. J. Math., 50 (1998), 563--580
work page 1998
-
[6]
Hoheisel, Primzahlprobleme in der analysis, Sitz
G. Hoheisel, Primzahlprobleme in der analysis, Sitz. Preuss. Akad. Wiss. 33 (1930), 580--588
work page 1930
-
[7]
Huxley, Large values of Dirichlet polynomials, III, Acta Arithmetica, 26 (1975), 435--444
M. Huxley, Large values of Dirichlet polynomials, III, Acta Arithmetica, 26 (1975), 435--444
work page 1975
-
[8]
A. E. Ingham, The distribution of prime numbers, Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1990. Reprint of the 1932 original, With a foreword by R. C. Vaughan
work page 1990
-
[9]
A. E. Ingham, On the difference between consecutive primes, Quart. J. Math. 8 (1937), 255--266
work page 1937
-
[10]
D. R. Johnston, A. Yang, Some explicit estimates for the error term in the prime number theorem, Journal of Mathematical Analysis and Applications, 527 (2023)
work page 2023
-
[11]
Khale, An explicit Vinogradov-Korobov zero-free region for Dirichlet L-functions, Quart
T. Khale, An explicit Vinogradov-Korobov zero-free region for Dirichlet L-functions, Quart. J. Math., 75 (2024), 299–-332
work page 2024
-
[12]
N. M. Korobov, Estimates of trigonometric sums and their applications, Uspehi Mat. Nauk, 13 (1958), 185–-192. (Russian)
work page 1958
-
[13]
Koukoulopoulos, Primes in short arithmetic progressions, Int
D. Koukoulopoulos, Primes in short arithmetic progressions, Int. J. Number Theory, 11 (2015), 1499--1521
work page 2015
-
[14]
H. L. Montgomery, R. C. Vaughan, Multiplicative Number Theory I: Classical Theory, Cambridge University Press (2006)
work page 2006
-
[15]
Prachar, Generalisation of a theorem of A
K. Prachar, Generalisation of a theorem of A. Selberg on primes in short intervals, Topics in Number Theory, Colloquia Mathematica Societatis Janos Bolyai, Debrecen (1974), 267–-280
work page 1974
-
[16]
A. Selberg, On the normal density of primes in small intervals and the difference between consecutive primes, Arch. Math. Naturvid. 47 (1943), 87--105
work page 1943
-
[17]
Starichkova, A note on zero-density approaches for the difference between consecutive primes
V. Starichkova, A note on zero-density approaches for the difference between consecutive primes. J. Number Theory, 278 (2025), 245--266
work page 2025
-
[18]
B. Saffari, R. C. Vaughan, On the fractional parts of x/n and related sequences. II, Annales de l'institute Fourier, 27 (1977), 1--30
work page 1977
-
[19]
I. M. Vinogradov, A new estimate for (1 + it) , Izv. Akad. Nauk SSSR, Ser. Mat., 22 (1958), 161--164. (Russian)
work page 1958
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.