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

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.

Authors

Publication Details

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

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

Ruqing Chen
6 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

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

Ruqing Chen
preprint en

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.

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