The prime number theorem for primes in arithmetic progressions at large values
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index; 1 of the 21 sources its claims cite were checked for support.
Abstract
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet L-functions is true, we then establish explicit formulae for $\psi(x,\chi)$, $\theta(x,\chi)$ and an explicit version of the prime number theorem for primes in arithmetic progressions that hold for general moduli $q\geq 3$. Finally, we restrict our attention to $q\leq 10\,000$ and use an exact computation to refine these results.
Overview
CoChat Summary
TL;DR
Assuming RH and GRH, the paper proves explicit versions of the prime number theorem for short intervals and for primes in arithmetic progressions, including bounds for ψ(x,χ), θ(x,χ), and π(x;q,a) for general moduli q≥3. It also refines the arithmetic-progression bounds for q≤10,000 using an exact computation.
Key findings
- Under RH, Theorem 3.2 gives an explicit short-interval prime number theorem: for x≥x0≥e^10, |ψ(x+√x log x)−ψ(x)−√x log x| < k3(x0)√x log x − k4(x0). Table 4 lists constants, e.g. log x0=10 gives k3=1.67943 and k4=8.31357×10^3; log x0=500 gives k3=0.3355 and k4=1.67972×10^112.
- Under GRH, Theorems 4.2–4.3 and Corollary 4.4 give explicit bounds for ψ(x,χ) and θ(x,χ), and Corollary 1.1 gives an explicit prime number theorem for primes in arithmetic progressions for general q≥3, with constants a_i in Table 1.
- For q≤10,000, Corollary 1.2 refines the constants ã_i for x≥x0≥1.05×10^7 and removes the condition x0≥q. The refinement uses the exact computation max_{primitive χ (mod q)} ∑_{|γχ|≤200} 1/√(1/4+γχ^2) = ω := 21.664472…, achieved at q=9857 (prime).
- The paper states its results appear sharper than those of Ernvall-Hytönen and Palojärvi, and that the leading terms are marginally better than Grenié–Molteni’s (A6), with major improvements in the secondary terms.
Methods
- Conditional analytic number theory: assumes RH for short intervals and GRH for Dirichlet L-functions; proves explicit bounds for ψ(x,χ) via an explicit formula for ψ1(x,χ) and bounds for sums over nontrivial zeros using Lemmas 2.1–2.3 and zero-counting estimates.
- Relates ψ(x,χ) to Δ(x,χ) = (ψ1(x+√x log x,χ)−ψ1(x,χ))/(√x log x) using the short-interval prime number theorem, then bounds the zero sum; extends primitive non-principal characters to all non-principal characters.
- For q≤10,000, uses the exact computation (13) and numerical optimization (gp_minimize from Python’s skopt) to choose parameters κ_i in Theorem 3.2 and derive the refined constants in the tables.
Limitations
- Stated: the results are conditional on RH and GRH. Theorem 3.2’s broadest range is log x≥10, though the paper notes this could be broadened if desired. General upper bounds in Theorems 4.1–4.2 require x≥q; this is removed only for the q≤10,000 refinement.
- Stated: the q≤10,000 refinement relies on an exact computation and numerical optimization, and the constants depend on the chosen x0.
- Evident from the text: many constants are large or negative and vary substantially with x0; the refinement is restricted to q≤10,000, and the exact computation achieving ω=21.664472… at q=9857 is numerical.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
1 Valid · 0 Not valid · 16 Not checked · 54 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“although our results appear to be sharper.”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 1. Introduction
What the sources say
- Supportedcites [13] A.-M. Ernvall-Hytönen and N. Paloj ä rvi, Explicit bound for the number of primes in arithmetic progressions assuming the generalized Riemann hypothesis, Math. Comp. 91 no. 335 (2022), 1317-1365. 10.1090/mcom/3691. source
The citation is offered only to identify the work of Ernvall-Hytönen and Palojärvi as an explicit version of the prime number theorem for primes in arithmetic progressions; the comparative judgement 'our results appear to be sharper' is the citing authors' own conclusion and not attributed to this source. Our copy's Abstract and Introduction (Theorem 1, Corollary 2) state exactly that: a conditional (GRH) explicit bound for π(x; q, a) − li(x)/φ(q), with q ≥ 3, x ≥ q. The paper is indeed the source of that explicit estimate, so the identification is supported. (LLM, conf=0.90)
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It follows that |ψ(x, χ) -θ(x, χ)| √ x log x < c θ log 2 < 1.44270.(35)”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 4.4. Proof of Theorem 4.3
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Theorem 4.1 If χ modulo q ≥ 3 is primitive and non-principal, x ≥ x 0 ≥ max{e 10 , q}, and h = √ x log x, then there exist constants k 5 (x 0 ), k 6 (x 0 ) (which will be defined in the proof) such that”
- Also stated in: § 4. Bounds for twisted Chebyshev functions · plain
“| | | ψ 1 (x + h, χ) -ψ 1 (x, χ) h | | | < ( log x 8π + log q 2π + k 5 (x 0 )) √ x log x + k 6 (x 0 ) √ x + 1.777.”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 4. Bounds for twisted Chebyshev functions
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Also stated in: § 4. Bounds for twisted Chebyshev functions · plain
In the paper
“Use [7, Cor.2.1] in a similar way to how we used it in Section 4.5 to see |ψ(x; q, a) -θ(x; q, a)| ≤ 1.44270 √ x log x.”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 5. The prime number theorem for primes in arithmetic progressions
What the sources say
- Not matchedcites [7, Cor.2.1]
This doesn’t read as a citation we can look up.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Observation III: Finally, suppose q ≥ 3.If x ≥ x 0 ≥ max{e 10 , q}, then | | | ψ 1 (x + h, χ) -ψ 1 (x, χ) h | | | < ( log x 8π + log q 2π + ς 4 (x)) √ x log x + 1.777, (31”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 4.2. Proof of Theorem 4.1
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
42 more claims
Create a free account to see all 71 claims and to verify the 6 references still open.
- It may state two separate claims as one. 16
- Probably not a substantial claim. 10
- The quote only partly states this claim. 2
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 3. The prime number theorem in short intervals
“κ 2 > 0 such that κ 2 ≥ κ 1 κ 0”
§ THE PRIME NUMBER THEOREM FOR PRIMES IN ARITHMETIC PROGRESSIONS AT LARGE VALUES > 3. The prime number theorem in short intervals
“this choice follows from the requirement κ 0 κ 1 ≥ κ 2”
Citations
Cites
Lint, J. H. (2020) · Cited by 5,023
Introduction to Cyclotomic Fields
Washington, L. C. (1997) · Graduate texts in mathematics · doi:10.1007/978-1-4612-1934-7 · Cited by 2,010
Multiplicative Number Theory I
Montgomery, H. L., & Vaughan, R. C. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511618314 · Cited by 1,707
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
Rosser, J. B., & Schoenfeld, L. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0457373-7 · Cited by 386
Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II
Schoenfeld, L. (1976) · Mathematics of Computation · doi:10.1090/s0025-5718-1976-0457374-x · Cited by 369
Explicit Bounds for Some Functions of Prime Numbers
Rosser, B. (1941) · American Journal of Mathematics · doi:10.2307/2371291 · Cited by 238
On the difference π(x) - li(x)
Lehman, R. (1966) · Acta Arithmetica · doi:10.4064/aa-11-4-397-410 · Cited by 107
On the Difference π(x ) − lix (II)
Skewes, S. (1955) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-5.1.48 · Cited by 70
Versions effectives du théorème de Chebotarev sous l'hypothèse de Riemann généralisée
Oesterlé, J. (1979) · French digital mathematics library (Numdam) · Cited by 51
A note on Mertens' formula for arithmetic progressions
Languasco, A., & Zaccagnini, A. (2007) · Journal of Number Theory · doi:10.1016/j.jnt.2006.12.015 · Cited by 44
Cited by
On the constants in Mertens’ theorems for primes in arithmetic progressions
Keliher, D., & Lee, E. S. (2024) · De Gruyter eBooks · doi:10.1515/9783111395593-012 · Cited by 1
Self-citationOn the sum of a prime and a number that is not square-free
Lee, E. S., & O'Clarey, R. (2026) · Archiv der Mathematik · doi:10.1007/s00013-026-02275-6 · Cited by 1
Self-citationDistributions of left prime truncationsPreprint
Kuperberg, V., & Laĺın, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.08451 · Cited by 1
NEW EFFECTIVE RESULTS IN THE THEORY OF THE RIEMANN ZETA-FUNCTION
Simonič, A. (2023) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972723001132
Metadata
- Authors
- Lee, E. S.
- Affiliations
- University of Bristol (GB)
- Corresponding author
- Lee, Ethan Simpson
- ORCID
- Lee, Ethan Simpson
- Venue
- The Quarterly Journal of Mathematics
- Publisher
- Oxford University Press (OUP)
- Published
- 2023-08-10
- Volume
- 74
- Issue
- 4
- Pages
- 1505-1533
- ISSN
- 0033-5606 (ISSN-L)
- 1464-3847
- OpenAlex
- W4385719707
- Cited by
- 4
- References
- 25
- Citations by year
- 2026: 2 · 2024: 1 · 2023: 1
- FWCI
- 1.20
- Type
- journal article
- Language
- en
- Open access
- hybrid
- dx.doi.org
- Licence
- Locations
- The Quarterly Journal of Mathematics (publishedVersion, cc-by)
- Bristol Research (University of Bristol) (publishedVersion, cc-by)
- Explore Bristol Research (publishedVersion, cc-by)
- UWE Research Repository (UWE Bristol) (acceptedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Mathematics › Numerical Analysis › Mathematical Approximation and Integration
- Keywords
- prime number theorem, primes in arithmetic progressions, short intervals, Riemann hypothesis, generalized Riemann hypothesis, Dirichlet L-functions, explicit formula, prime counting function
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-11-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-11-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.