Skip to content

v2.0.0: The Pólya–Vinogradov inequality with log log q for all but q^ε characters

Choose a tag to compare

@github-actions github-actions released this 26 Oct 16:45
· 16 commits to main since this release
7ee1037

Deep Bhattacharjee and Ushashi Bhattacharya, The Pólya–Vinogradov inequality with log log q for all but q^ε characters. Final revision, single column, 26 pages.

For every ε > 0 there is a constant C_ε such that, for every modulus q ≥ 3, at most q^ε of
the primitive characters χ modulo q have M(χ) > C_ε √q log log q, where M(χ) is the largest
modulus of a partial sum of χ; in the same way at most q^ε of the nonprincipal characters have
|L'/L(1, χ)| > C_ε log log q. The proof is a transfer theorem for a single character (a
zero-free rectangle for the twists of χ by the characters of small moduli gives the bound),
proved by a contour shift, the circle method and a weak Montgomery–Vaughan bound from Selberg's
sieve, and a count of the exceptional characters by a zero-density theorem, which is proved in
full in Appendix A with explicit constants. Every statement is proved by hand from Chebyshev's
bounds, except Theorem 1.5, the bound for every character, which rests on the zero-free
half-plane Re s > 7/8 of OpenAI's preprint; that Lean 4 proof is compiled from source and
checked by the Lean kernel in this repository, with a Lean proof of Theorem 1.5 from it.

The results were first made public on 15 October 2026 as release v1.0.0 of this repository;
an earlier and incomplete version of the paper appeared on Hexagon as hexagon:2610.00256.

Files: the paper (PolyaVinogradovLogLog_final2.pdf), its LaTeX source with the figures
(PolyaVinogradovLogLog_final2-tex.zip) and the arXiv tarball
(PolyaVinogradovLogLog_final2-arxiv.tar.gz).

Contact: d.bhattacharjee@erl-forschung.de, itsdeep@live.com; for this repository egspl@proton.me.