Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Theorem 5 — improved large sieve for sifted sequences


Assume the supporting compact and Johnsen condition. Let N≥1N\geq1 be an integer and let φ1,…,φN\varphi_1,\ldots,\varphi_N be complex numbers, extended by zero outside [1,N][1,N], supported by K\mathcal K up to level QQ. For 1≤Q0≤Q1\leq Q_0\leq Q,

∑q≤Q0 ∑amodq(a,q)=1∣∑n=1Nφne(na/q)∣2≤G1(Q0)G1(Q/Q0)(N+Q2)∑n=1N∣φn∣2.\sum_{q\leq Q_0}\ \sum_{\substack{a\bmod q\\(a,q)=1}} \left|\sum_{n=1}^N\varphi_n e(na/q)\right|^2 \leq \frac{G_1(Q_0)}{G_1(Q/Q_0)}(N+Q^2) \sum_{n=1}^N|\varphi_n|^2.

The Fourier sum stops at Q0Q_0, but the support condition must hold through QQ. The denominator is G1(Q/Q0)G_1(Q/Q_0), not G1(Q)G_1(Q), and the quadratic cost uses QQ, not Q0Q_0.

The proof on p. 571 compares the nonnegative decomposition in Theorem 4 at the two levels. Lemma 1 bounds the coefficient ratio by G1(Q0)/G1(Q/Q0)G_1(Q_0)/G_1(Q/Q_0); the ordinary large sieve bounds the energy at level QQ by (N+Q2)∑n∣φn∣2(N+Q^2)\sum_n|\varphi_n|^2.

For an application to Problem 12(iii), the residue-support system, its uniform lifting, both G-function estimates and the enlarged quadratic cost remain separate requirements. The theorem itself gives no bound for a property-P set's joint divisor exclusions.

Source and reading. Theorem 5 and its proof, printed p. 571 of Ramaré–Ruzsa (2001). The statement and parameter dependence were checked against the scan. The short proof and its cited interfaces were read; no independent proof audit of the large-sieve input or the complete paper is asserted.