Work

A note on the smooth-number exponents and the additive windows in "When the sieve works"

Year: 2026
Type: preprint
Abstract: We check four technical points in "When the sieve works" by A. Granville, D. Koukoulopoulos and K. Matomäki (Duke Math. J. 164 (2015), 1935–1969; arXiv:1205.0413v2). (i) In the proof of Proposition 2.6 the bound actually obtained in (2.7) is x^(-1/5+o(1)), not x^(-1/3), and (2.8) gives x^(-1/10+o(1)), not x^(-1/6); with the optimal parameter the method yields the proposition with x^(-1/8+ε), and its qualitative conclusion is unchanged. (ii) Lemma 8.5, stated without proof, is false as printed (explicit counterexample: u=1, v=4, w=1, T=(0.6,0.7)), probably because of a misprint; we prove two corrected versions, one of which is exactly what Proposition 8.4 needs. (iii) The proof that Hypothesis P implies Hypothesis A can produce primes outside the required range; removing at most two elements repairs it. (iv) An inequality in the proof of Proposition 8.1 fails as σ→1, but the proposition holds as stated. No main result is affected. The record includes the note (PDF and LaTeX), a Python verification script, its output, and the figure.
Author: Chen, Ruqing
Language: English
Open Access status: green
OpenAlex ID: W7235399385
Cites:
Cited by:
Related to: 10