Limitations to the equi-distribution of primes. I (Q1119691): Difference between revisions

The paper considers the distribution of primes in arithmetic progressions. The Bombieri-Vinogradov theorem shows that, for any fixed integer \(a\neq 0\) and any fixed \(A>0\) one has \[ \sum_{q<Q;(q,a)=1}| \psi (x;q,a)-x/\phi (q)| \ll x(\log x)^{-A} \] with \(Q=x^{1/2}(\log x)^{-B}\), for some \(B=B(A)\). \textit{P. D. T. A. Elliott} and \textit{H. Halberstam} [Symp. Math. IV, Roma 1968/69, 59-72 (1970; Zbl 0238.10030)] asked whether \(Q=x(\log x)^{-B}\) might be admissable, and \textit{H. L. Montgomery} [Topics in multiplicative number theory (Lect. Notes Math. 227) (1971; Zbl 0216.03501)] made the still stronger conjecture that \[ \psi (x;q,a)-x/\phi (q)\quad \ll \quad (x/q)^{1/2+\epsilon} \log x, \] uniformly for \((a,q)=1\) and \(q<x\). The present paper disproves these conjectures, but leaves open the possibility that \(Q=x^{1-\epsilon}\) is admissable. Specifically, it is shown that for any fixed \(B>0\) there are arbitrarily large a and x for which \[ \sum_{q<x(\log x)^{-B};(q,a)=1}| \psi (x;q,a)-x/\phi (q)| \quad \gg \quad x. \] The proof is based on the method of \textit{H. Maier} [Mich. Math. J. 32, 221-225 (1985; Zbl 0569.10023)], who showed that for fixed \(B>0\) one has \[ \psi (x+\log^ B x)-\psi (x)=\log^ B x+\Omega_{\pm}(\log^ B x). \] This was done by choosing x so that the ``Fundamental Lemma'' of sieve theory gives a higher (or lower) than average a priori probability for the occurrence of primes in the relevant interval. In the present paper a modification of the method is used to handle short arithmetic progressions.