Smooth integers in multiplicative cosets at a squared-logarithmic cutoff

Let χ be a nonprincipal character modulo a prime p and assume the Riemann hypothesis for L(s,χ). Fix 0 < a < 1 and put y = η(log p)2 with η > 𝒞(1)−2, the Fourier extremal constant of Carneiro, Milinovich, Quesada-Herrera and Ramos. The character sum over y-smooth integers up to x is O(Ψ(x,y) e−bu) uniformly in χ and pa ≤ x ≤ p, where u = log x/log y and b = b(a,η) > 0. Under Dirichlet GRH, every coset of every subgroup of index m ≤ ebu/2 therefore receives its expected share of y-smooth integers, with relative error O(e−bu/2). In particular η = 0.77 is admissible, and the certified bound 𝒞(1)−2 < 0.760777412 (doi:10.5281/zenodo.24408857) allows every η ≥ 0.7608. The ordinary character sum satisfies the same bound for every fixed η > 2/e2 under RH for L(s,χ). Applied to quadratic characters, the theorem forces a nonresidue below y, so admissibility of some η < 𝒞(1)−2 would improve the known bound for the least quadratic nonresidue; the argument does not show that 𝒞(1)−2 is the best possible threshold. The proof translates the Carneiro–Milinovich–Quesada-Herrera–Ramos explicit-formula test function to the scale y, which forces a positive proportion of primes near y to have χ(ℓ)ℓ−it bounded away from 1, and transfers this to smooth integers through the Euler product at the saddle point. For comparison, the closest earlier uniform estimate (Dong–Zhao–Zhou, arXiv:2611.11389) needs a cutoff of order (log q)2(log log q)C with C > 6. Companion repository: https://github.com/novalis78/smooth-character-cosets, with the LaTeX source, the quadratic predecessor note, working notes, a citation check of all eleven cited results, Lean 4 proofs of the coset counting identity and of the remark tying the cutoff to the least quadratic nonresidue, and rational and interval certificates for the numerical thresholds. OpenAI Codex assisted with the literature search, the derivations and the preparation of the note, and produced the Lean proofs and certificates. Anthropic's Claude checked the arguments and the cited statements before deposit.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24421919
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Smooth integers in multiplicative cosets at a squared-logarithmic cutoff

Lennart Lopin
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Smooth integers in multiplicative cosets at a squared-logarithmic cutoff

Lennart Lopin
preprint en

Abstract

Let χ be a nonprincipal character modulo a prime p and assume the Riemann hypothesis for L(s,χ). Fix 0 < a < 1 and put y = η(log p)2 with η > 𝒞(1)−2, the Fourier extremal constant of Carneiro, Milinovich, Quesada-Herrera and Ramos. The character sum over y-smooth integers up to x is O(Ψ(x,y) e−bu) uniformly in χ and pa ≤ x ≤ p, where u = log x/log y and b = b(a,η) > 0. Under Dirichlet GRH, every coset of every subgroup of index m ≤ ebu/2 therefore receives its expected share of y-smooth integers, with relative error O(e−bu/2). In particular η = 0.77 is admissible, and the certified bound 𝒞(1)−2 < 0.760777412 (doi:10.5281/zenodo.24408857) allows every η ≥ 0.7608. The ordinary character sum satisfies the same bound for every fixed η > 2/e2 under RH for L(s,χ). Applied to quadratic characters, the theorem forces a nonresidue below y, so admissibility of some η < 𝒞(1)−2 would improve the known bound for the least quadratic nonresidue; the argument does not show that 𝒞(1)−2 is the best possible threshold. The proof translates the Carneiro–Milinovich–Quesada-Herrera–Ramos explicit-formula test function to the scale y, which forces a positive proportion of primes near y to have χ(ℓ)ℓ−it bounded away from 1, and transfers this to smooth integers through the Euler product at the saddle point. For comparison, the closest earlier uniform estimate (Dong–Zhao–Zhou, arXiv:2611.11389) needs a cutoff of order (log q)2(log log q)C with C > 6. Companion repository: https://github.com/novalis78/smooth-character-cosets, with the LaTeX source, the quadratic predecessor note, working notes, a citation check of all eleven cited results, Lean 4 proofs of the coset counting identity and of the remark tying the cutoff to the least quadratic nonresidue, and rational and interval certificates for the numerical thresholds. OpenAI Codex assisted with the literature search, the derivations and the preparation of the note, and produced the Lean proofs and certificates. Anthropic's Claude checked the arguments and the cited statements before deposit.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon