HEXAGONbeta

The Pólya–Vinogradov inequality with log log q for every character

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

Let χ\chi be a primitive Dirichlet character modulo q≥3q\ge3 and let M(χ)M(\chi) be the largest modulus of a partial sum ∑n≤xχ(n)\sum_{n\le x}\chi(n). The P\'olya--Vinogradov inequality bounds M(χ)M(\chi) by a constant times qlog⁡q\sqrt q\log q. Paley showed that qlog⁡log⁡q\sqrt q\log\log q is the most that can be hoped for, and Montgomery and Vaughan proved that this is the truth if the generalised Riemann hypothesis holds. Without any hypothesis we prove that M(χ)≤Cqlog⁡log⁡qM(\chi)\le C\sqrt q\log\log q for every primitive character χ\chi to every modulus q≥3q\ge3, with an absolute constant CC, and that ∣L′/L(1,χ)∣≤Clog⁡log⁡q|L'/L(1,\chi)|\le C\log\log q for every nonprincipal character. We also prove, from the elementary bounds of Chebyshev alone, that for every ε>0\varepsilon>0 there is a constant CεC_\varepsilon such that at most qεq^{\varepsilon} of the primitive characters modulo qq have M(χ)>Cεqlog⁡log⁡qM(\chi)>C_\varepsilon\sqrt q\log\log q, and at most qεq^{\varepsilon} of the nonprincipal characters have ∣L′/L(1,χ)∣>Cεlog⁡log⁡q|L'/L(1,\chi)|>C_\varepsilon\log\log q. The proof has two parts. The first is a transfer theorem for a single character: if θ<1\theta<1 is fixed and the LL-functions of the twists χψ\chi\psi of χ\chi by the characters ψ\psi of the moduli up to (log⁡q)16(\log q)^{16} have no zero in the rectangle ℜs>θ\Re s>\theta, ∣ℑs∣≤5q2|\Im s|\le5q^2, then M(χ)≤Cθqlog⁡log⁡qM(\chi)\le C_\theta\sqrt q\log\log q. It is proved by a contour shift for Riesz means of prime sums, a dissection of the circle into major and minor arcs, and a weak form of the Montgomery--Vaughan bound for exponential sums with multiplicative coefficients, which we prove with Selberg's sieve as the only arithmetic input. The second part counts the characters that fail the hypothesis of the transfer theorem by a zero-density theorem in the manner of Ingham and Montgomery, which bounds the number of zeros of all LL-functions to a modulus in such a rectangle by a power of the modulus that tends to zero as θ\theta tends to one. The same transfer theorem shows that a zero-free half-plane ℜs>θ\Re s>\theta for all Dirichlet LL-functions gives the bound for every character, and such a half-plane exists: OpenAI has proved that every Dirichlet LL-function, and every finite-order Hecke LL-function over Q(−3)\mathbb Q(\sqrt{-3}), has no zero with ℜs>11/12\Re s>11/12, by a mean square of twisted M\"obius sums over the Eisenstein integers, two Poisson summations, the transformation of Kubota's cubic theta function and the quadratic large sieve. Their proof is reproduced in full in a second appendix, with credit to them, so that the paper is complete in itself: the zero-density theorem is proved in the first appendix with explicit constants, and every statement of the paper is proved in the text.

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.
AI provenance filesAI-PROVENANCE-HEXAGON.md · 2 KB

Tools used

OpenAI
ChatGPTVersion GPT SOL 6.1 Ultra

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 versionSupersededOct 21, 2026
  3. v3Submitted by Deep BhattacharjeeSubmitted as a new versionCurrentOct 26, 2026