The P\'olya--Vinogradov inequality with log⁡log⁡q\log\log q

A mix of human-written and AI-generated textHuman understanding: some partsmath.NT — Number Theorymath.CA — Classical Analysis and ODEs

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya ↗

Version 2 / Oct 16, 2026 / CC BY 4.0

Abstract

We prove that every primitive Dirichlet character χ\chi modulo q≥3q\ge3 has character sums ∑n≤xχ(n)\sum_{n\le x}\chi(n) of size at most Cqlog⁡log⁡qC\sqrt q\log\log q, with an absolute constant CC. Montgomery and Vaughan proved this bound under the generalised Riemann hypothesis, and Paley showed that it is optimal. The only input from outside the paper is the zero-free half-plane ℜs>7/8\Re s>7/8 for Dirichlet LL-functions. On the major arcs this half-plane gives a power saving for twisted prime sums; on the minor arcs we prove a weak form of the Montgomery--Vaughan bound for exponential sums with multiplicative coefficients, with Selberg's sieve as the only arithmetic input. The same half-plane gives ∣L′/L(1,χ)∣≪log⁡log⁡q|L'/L(1,\chi)|\ll\log\log q for every nonprincipal χ\chi and, for every prime qq, the two-sided bound −Clog⁡qlog⁡log⁡q≤γq≤Clog⁡q-C\log q\log\log q\le\gamma_q\le C\log q for the Euler--Kronecker constant of the cyclotomic field Q(ζq)\mathbb Q(\zeta_q).

Provenance statement

The proofs, the Lean 4 formalisation, the checking programs and the text were drafted with Claude (Anthropic) through Claude Code under the direction of Deep Bhattacharjee, who ran the computations and the Lean build. Every proof is formalised in Lean 4 (Lean 4.34.1, Mathlib v4.34.1) and compiled together with the unchanged Lean sources of OpenAI's zero-free half-plane Re s > 7/8; the main theorems depend only on propext, Classical.choice and Quot.sound, with no sorry. The half-plane is OpenAI's unrefereed preprint of 30 September 2026 and is the one result used without proof. Release v1.1.2: https://github.com/creelie/Breakthrough-problems-3/releases/tag/v1.1.2. Both authors approved the final version.

Tools used

Anthropic
Claude CodeVersion Opus 5.5 Ultracode

References

  1. A. I. Badzyan, The Euler--Kronecker constant , Math. Notes 87 (2010), 31--42. doi:10.1134/S0001434610010050 (https://doi.org/10.1134/S0001434610010050)DOI
  2. D. Bhattacharjee and U. Bhattacharya, The Pólya--Vinogradov inequality with log⁡log⁡q\log\log q: Lean 4 formalisation and verification code , GitHub release v1.1.2, 2026, .
  3. H. Davenport, Multiplicative Number Theory , 3rd ed., revised by H. L. Montgomery, Grad. Texts in Math. 74, Springer, New York, 2000. doi:10.1007/978-1-4757-5927-3 (https://doi.org/10.1007/978-1-4757-5927-3)DOI
  4. K. Ford, F. Luca and P. Moree, Values of the Euler ϕ\phi-function not divisible by a given odd prime, and the distribution of Euler--Kronecker constants for cyclotomic fields , Math. Comp. 83 (2014), 1447--1476. doi:10.1090/S0025-5718-2013-02749-4 (https://doi.org/10.1090/S0025-5718-2013-02749-4)DOI
  5. A. Granville and K. Soundararajan, Large character sums: pretentious characters and the Pólya--Vinogradov theorem , J. Amer. Math. Soc. 20 (2007), 357--384. doi:10.1090/S0894-0347-06-00536-4 (https://doi.org/10.1090/S0894-0347-06-00536-4)DOI
  6. H. Halberstam and H.-E. Richert, Sieve Methods , London Math. Soc. Monographs 4, Academic Press, London, 1974.
  7. Y. Ihara, On the Euler--Kronecker constants of global fields and primes with small norms , in: Algebraic Geometry and Number Theory, Progr. Math. 253, Birkhäuser, Boston, 2006, 407--451. doi:10.1007/978-0-8176-4532-8_5 (https://doi.org/10.1007/978-0-8176-4532-8_5)DOI
  8. Y. Ihara, V. K. Murty and M. Shimura, On the logarithmic derivatives of Dirichlet LL-functions at s=1s=1 , Acta Arith. 137 (2009), 253--276. doi:10.4064/aa137-3-6 (https://doi.org/10.4064/aa137-3-6)DOI
  9. H. L. Montgomery and R. C. Vaughan, Exponential sums with multiplicative coefficients , Invent. Math. 43 (1977), 69--82. doi:10.1007/BF01390204 (https://doi.org/10.1007/BF01390204)DOI
  10. P. Moree, Irregular behaviour of class numbers and Euler--Kronecker constants of cyclotomic fields: the log log log devil at play , in: Irregularities in the Distribution of Prime Numbers, Springer, Cham, 2018, 143--163. doi:10.1007/978-3-319-92777-0_8 (https://doi.org/10.1007/978-3-319-92777-0_8)DOI
Show all 13 referencesShow fewer references
  1. OpenAI, The quasi-Riemann hypothesis: a zero-free half-plane ℜs>7/8\Re s>7/8 , preprint (not refereed), 30 September 2026, with a Lean 4 formalisation, repository https://github.com/openai/mathlink
  2. R. E. A. C. Paley, A theorem on characters , J. London Math. Soc. s1-7 (1932), 28--32. doi:10.1112/jlms/s1-7.1.28 (https://doi.org/10.1112/jlms/s1-7.1.28)DOI
  3. L. C. Washington, Introduction to Cyclotomic Fields , 2nd ed., Grad. Texts in Math. 83, Springer, New York, 1997. doi:10.1007/978-1-4612-1934-7 (https://doi.org/10.1007/978-1-4612-1934-7)DOI

Version history

  1. v1Submitted by Deep BhattacharjeeInitial depositSupersededOct 15, 2026
  2. v2Submitted by Deep BhattacharjeeSubmitted as a new versionCurrentOct 21, 2026