betaFeedback

WorksMathematics

Smooth Numbers in Arithmetic Progressions with Uniformity in the Residue Class

Abstract

We improve the level of distribution of smooth numbers in arithmetic progressions to x5/8−ϵx^{5/8-\epsilon}, with uniformity in the residue class. In particular, for every ϵ,A>0\epsilon,A>0 and integer k≥1k\geq1, there exist δ,C>0\delta,C>0 such that ∑q≤x5/8−ϵ(q,a1a2)=1τk(q)sup⁡0≤z≤x∣Ψ(z,y;a1a2‾,q)−1ϕ(q)Ψq(z;y)∣≪ϵ,A,kΨ(x;y)(log⁡x)A, \sum_{\substack{q\leq x^{5/8-\epsilon}\\(q,a_1a_2)=1}}\tau_k(q)\sup_{0\leq z\leq x} \Biggl|\Psi(z,y;a_1\overline{a_2},q) -\frac{1}{\phi(q)}\Psi_q(z;y)\Biggr| \ll_{\epsilon,A,k}\frac{\Psi(x;y)}{(\log x)^A}, uniformly for x≥2x\geq2, (log⁡x)C≤y≤x1/C(\log x)^C\leq y\leq x^{1/C}, and a1,a2∈Z∖{0}a_1,a_2\in\Z\setminus\{0\} satisfying ∣a1∣≤x1+δ,∣a2∣≤xδ,(a1,a2)=1. |a_1|\leq x^{1+\delta},\qquad |a_2|\leq x^\delta,\qquad (a_1,a_2)=1. Here Ψ(z;y)\Psi(z;y) counts the yy-smooth integers up to zz, Ψq(z;y)\Psi_q(z;y) counts those coprime to qq, and Ψ(z,y;a,q)\Psi(z,y;a,q) counts those congruent to aa modulo qq; τk\tau_k is the kk-fold divisor function. The proof combines dispersion with second and fourth spectral moments.

Introduction

Let P+(n)P^{+}(n) denote the largest prime factor of a positive integer nn, with P+(1)=1P^{+}(1)=1. We call nn yy-smooth if P+(n)≤yP^{+}(n)\le y. For x≥0x\ge0, y≥2y\ge2, q∈Z>0q\in\mathbb{Z}_{>0} and a∈Za\in\mathbb{Z}, write

Ψ(x;y):=∣{n∈Z>0:n≤x, P+(n)≤y}∣,\Psi(x;y):=\left|\{n\in\mathbb{Z}_{>0}:n\le x,\ P^{+}(n)\le y\}\right|,
Ψq(x;y):=∣{n∈Z>0:n≤x, P+(n)≤y, (n,q)=1}∣,\Psi_q(x;y):=\left|\{n\in\mathbb{Z}_{>0}:n\le x,\ P^{+}(n)\le y,\ (n,q)=1\}\right|,
Ψ(x,y;a,q):=∣{n∈Z>0:n≤x, P+(n)≤y, n≡a(modq)}∣.\Psi(x,y;a,q):=\left|\{n\in\mathbb{Z}_{>0}:n\le x,\ P^{+}(n)\le y,\ n\equiv a\pmod q\}\right|.

For (a,q)=1(a,q)=1, the expected count in the class a(modq)a\pmod q is Ψq(x;y)/φ(q)\Psi_q(x;y)/\varphi(q), where φ\varphi is Euler’s totient function. We study the discrepancy from this count, averaged over the moduli, while allowing the residue class and the summation endpoint to vary.

Our main result gives exponent of distribution 5/85/8, uniformly in residue classes of the form a1a2‾(modq)a_1\overline{a_2}\pmod q. Here a2‾\overline{a_2} denotes the inverse of a2a_2 modulo qq, and τk(q)\tau_k(q) is the number of ordered factorisations of qq into kk positive integers.

Theorem 1. For any ε\varepsilon, A>0A>0 and integer k≥1k\ge1, there exist δ,C>0\delta,C>0 such that the following holds. Let x≥2x\ge2 and a1,a2∈Z∖{0}a_1,a_2\in\mathbb{Z}\setminus\{0\} satisfy

∣a1∣≤x1+δ,∣a2∣≤xδ,(a1,a2)=1.|a_1|\le x^{1+\delta},\qquad|a_2|\le x^\delta,\qquad(a_1,a_2)=1.

Uniformly for (log⁡x)C≤y≤x1/C(\log x)^C\le y\le x^{1/C}, we have

∑q≤x5/8−ε(q,a1a2)=1τk(q)sup⁡0≤z≤x∣Ψ(z,y;a1a2‾,q)−1φ(q)Ψq(z;y)∣≪ε,A,kΨ(x;y)(log⁡x)A.\sum_{\substack{q\le x^{5/8-\varepsilon}\\(q,a_1a_2)=1}}\tau_k(q)\sup_{0\le z\le x}\left|\Psi(z,y;a_1\overline{a_2},q)-\frac{1}{\varphi(q)}\Psi_q(z;y)\right|\ll_{\varepsilon,A,k}\frac{\Psi(x;y)}{(\log x)^A}.

Section 2 outlines the argument. The convolution estimate used in the proof is stated in § 3. We deduce Theorem 1 in § 4 and prove the convolution estimate in § 5, using spectral moments and Kloosterman sums.

AI Usage

This manuscript was largely generated using ChatGPT/Codex, including much of the mathematical argumentation, exposition, and LaTeX code. It builds on an earlier draft by the author concerning Balog’s additive-representation problem, which used the exponent of distribution 153/256153/256. The spectral-moment strategy was suggested by ChatGPT in response to the author’s prompts. The author takes responsibility for the final manuscript.

Acknowledgements

The author thanks Kaisa Matomäki for her encouragement throughout this project and for providing a ChatGPT subscription. The author was supported by the Research Council of Finland (grant numbers 346307, 364214, and 370133) and by the University of Turku Graduate School’s Exactus fellowship while working on this project.

Notation

The letter pp, with or without subscripts, is reserved for primes; sums and products indexed by pp are therefore over primes. All logarithms are natural. We write Z>0\mathbb{Z}_{>0} for the positive integers, (a,b)(a,b) for the greatest common divisor, and [a,b][a,b] for the least common multiple of aa and bb; the same conventions apply to more than two integers. Divisors in sums and products are positive unless otherwise specified. For a summation variable, n∼Nn \sim N means N<n≤2NN<n\le2N. We write 1E1_E for the indicator of a condition EE.

We use Landau’s notation F=O(G)F=O(G) and Vinogradov’s notation F≪GF\ll G or G≫FG\gg F to mean ∣F∣≤CG|F|\le CG for some constant C>0C>0, with G≥0G\ge0. Subscripts indicate permitted dependence of the implied constant, as in OεO_\varepsilon or ≪ε\ll_\varepsilon, and constants may change from line to line. For positive quantities, F≍GF\asymp G means F≪G≪FF\ll G\ll F. In a specified limit, F=o(G)F=o(G) means F/G→0F/G\to0. In particular, F(x)≪xo(1)F(x)\ll x^{o(1)} means F(x)≪εxεF(x)\ll_\varepsilon x^\varepsilon for every ε>0\varepsilon>0.

We write μ\mu for the Möbius function and τ=τ2\tau=\tau_2 for the divisor function. The radical is rad⁡(n)=∏p∣np\operatorname{rad}(n)=\prod_{p\mid n}p, and d∣n∞d\mid n^\infty means that every prime factor of dd divides nn. A star on a residue sum restricts it to reduced residues; a star on a character sum restricts it to primitive characters. Overbars on complex coefficients denote complex conjugation; overbars on integers in modular expressions denote multiplicative inverses modulo the indicated modulus.

For a bounded function FF, write ∥F∥∞=sup⁡u∣F(u)∣\|F\|_\infty=\sup_u|F(u)|. We use JνJ_\nu for the Bessel function of the first kind and KνK_\nu for the modified Bessel function of the second kind. The spectral notation is introduced in § 5 and Appendix § 6 as needed.

Outline

We explain the exponent 5/85/8 and the uniformity in the residue class, following the order of the overview in [13], § 2. Throughout this sketch, estimates are understood up to factors xo(1)x^{o(1)}, and we suppress smooth weights and divisor sums. To keep the notation simple, take a2=1a_2=1 and a1=aa_1=a with 1≤a≤x1\le a\le x. Coprimality conditions needed for multiplicative inverses are understood. The full proof treats both signs and restores the small powers of xx needed for the stated residue range.

Reduction to exponential sums

The factorisation of smooth numbers allows us to choose three factor lengths MM, NN, LL with MNL=xMNL=x. After treating characters of small conductor separately, we have to bound

∑r∼R(r,a)=1∣∑m∼M∑n∼N∑ℓ∼LαmβnγℓED(mnℓa‾;r)∣.\sum_{\substack{r\sim R\\(r,a)=1}}\left|\sum_{m\sim M}\sum_{n\sim N}\sum_{\ell\sim L}\alpha_m\beta_n\gamma_\ell\mathcal{E}_D(mn\ell\overline{a};r)\right|.

where ED\mathcal{E}_D is the character remainder defined in § 3. We seek a saving over its natural size xx, with RR as large as possible. The limiting choice of lengths is

M=L=xR,N=R2x,K=NL=R.(1)M=L=\frac{x}{R},\qquad N=\frac{R^2}{x},\qquad K=NL=R. \tag*{(1)}

These lengths indicate the exponent; they will be adjusted slightly at the end of the outline.

Linnik’s dispersion method begins with Cauchy–Schwarz in r,mr,m. Opening the square introduces two copies of nℓn\ell. Poisson summation in mm produces a frequency of length

H≍RM=N.H\asymp\frac{R}{M}=N.

The zero frequency combines with the other dispersion main terms. In the nonzero frequencies, write one of the products as k≍Kk\asymp K and pass from rr to the complementary divisor

t=nℓ−kr,∣t∣≪KR≈1.t=\frac{n\ell-k}{r},\qquad|t|\ll\frac{K}{R}\approx1.

Reciprocity and a further application of Cauchy–Schwarz lead to sums of the form

K=∑n,n′∼Nαn,n′∑h,h′∼Hn′h≠nh′∑k≍Kk≍Le(a(n′h−nh′)nn′ℓk),e(u)=e2πiu.(2)\mathcal{K}=\sum_{n,n'\sim N}\alpha_{n,n'}\sum_{\substack{h,h'\sim H\\n'h\ne nh'}}\sum_{\substack{k\asymp K\\k\asymp L}}e\left(\frac{a(n'h-nh')nn'\ell}{k}\right),\qquad e(u)=e^{2\pi iu}. \tag*{(2)}

References

  1. [1]E. Assing, V. Blomer, and J. Li. Uniform Titchmarsh divisor problems. Adv. Math. 393 (2021), 108076. doi:10.1016/j.aim.2021.108076.DOI
  2. [2]E. Assing and A. Corbett. Voronoi summation via switching cusps. Preprint (2019), arXiv:1904.02025v1 [math.NT]. https://arxiv.org/abs/1904.02025v1.
  3. [3]V. Blomer and R. Khan. Twisted moments of L-functions and spectral reciprocity. Preprint (2018), arXiv:1706.01245v2 [math.NT]. https://arxiv.org/abs/1706.01245v2.
  4. [4]P. Deligne. La conjecture de Weil. I. Publ. Math. Inst. Hautes Études Sci. 43 (1974), 273–307.DOI
  5. [5]S. Drapeau. Théorèmes de type Fourny-Iwaniec pour les entiers friables. Compos. Math. 151 (2015), no. 5, 828–862.DOI
  6. [6]S. Drapeau. Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method. Preprint (2016), arXiv:1504.05549v4 [math.NT]. https://arxiv.org/abs/1504.05549v4.
  7. [7]A. J. Harper. Bombieri–Vinogradov and Barban–Davenport–Halberstam type theorems for smooth numbers. Preprint (2012), arXiv:1208.5992v1 [math.NT]. https://arxiv.org/abs/1208.5992v1.
  8. [8]A. Hildebrand and G. Tenenbaum. On integers free of large prime factors. Trans. Amer. Math. Soc. 296 (1986), no. 1, 265–290.DOI
  9. [9]J. Hoffstein and P. Lockhart. Coefficients of Maass forms and the Siegel zero. Ann. of Math. 140 (1994), no. 1, 161–176.DOI
  10. [10]H. H. Kim. Functoriality for the exterior square of GL4 and the symmetric fourth of GL2. J. Amer. Math. Soc. 16 (2003), 139–183. With Appendix 1 by D. Ramakrishnan and Appendix 2 by H. H. Kim and P. Sarnak.
  11. [11]J. D. Lichtman. Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier. Preprint (2023), arXiv:2309.08522v1 [math.NT]. https://arxiv.org/abs/2309.08522v1.
  12. [12]A. Pascadi. Large sieve inequalities for exceptional Maass forms and the greatest prime factor of n^2 + 1. Forum Math. Pi 14 (2026), e8. doi:10.1017/fmp.2026.10025.DOI
  13. [13]A. Pascadi. On the exponents of distribution of primes and smooth numbers. Preprint (2025), arXiv:2505.00653v2 [math.NT]. https://arxiv.org/abs/2505.00653v2.
  14. [14]D. Ramakrishnan and L. Yang. A constant for twist equivalence of cusp forms on GL(n). Preprint (2020), arXiv:1906.01047v3 [math.NT]. https://arxiv.org/abs/1906.01047v3.

Paper details

vlnc:W_fcnhyk7m
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI ChatGPT, OpenAI Codex

View statement
Looking for related papers…
Contents