CoChat

The prime number theorem for primes in arithmetic progressions at large values

Open access
Lee, Ethan Simpson · 2023 · The Quarterly Journal of Mathematics

The 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

Crossref · 10.1093/qmath/haad031

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

1 Valid · 0 Not valid · 16 Not checked · 54 Own results and interpretations

42 more claims

Create a free account to see all 71 claims and to verify the 6 references still open.

See all claims — free account
  • It may state two separate claims as one. 16
  • Probably not a substantial claim. 10
  • The quote only partly states this claim. 2

Create a free account to see these claims.

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.

1 of 1

Citations

Cites

Show all 30 references

Cited by

See all 4

Metadata

Authors
Lee, E. S.
Affiliations
University of Bristol (GB)
Corresponding author
Lee, Ethan Simpson
Venue
The Quarterly Journal of Mathematics
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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The prime number theorem for primes in arithmetic progressions at large values. https://app.cochat.ai/papers/10.1093/qmath/haad031
The paper
Lee, E. S. (2023). The prime number theorem for primes in arithmetic progressions at large values. The Quarterly Journal of Mathematics. https://doi.org/10.1093/qmath/haad031

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.