Consecutive primes in short intervals (Q2234369): Difference between revisions

Let \(p_i\) be the \(i\)-th prime. In this paper, the author proves the following result: Theorem. There exist two absolute positive constants \(c\) and \(C\) such that for any \(0<\varepsilon <1\), if \(x,y\) are real numbers and \(a,q\) are coprime integers with \[c_0(\varepsilon)\le y\le \log x,\quad 1\le m\le c\varepsilon \log y, \quad 1\le q\le y^{1-\varepsilon },\] then the number of \(p_n\) with \(\frac x2 <p_n\le x\) such that \(p_{n+m}-p_n\le y\) and \( p_n\equiv \cdots \equiv p_{n+m}\equiv a\pmod q\) does not exceed \[\pi (x) \left( \frac{y}{2q\log x} \right)^{\exp (Cm)},\] where \(c_0(\varepsilon)\) is a positive constant depending only on \(\varepsilon \). This extends an earlier result of \textit{J. Maynard} [Compos. Math. 152, No. 7, 1517--1554 (2016; Zbl 1382.11074)]. The author also gives the following corollary. Corollary. There is a positive constant \(C\) such that if \(m\) is a positive integer and \(x,y\) are two real numbers with \(\exp (Cm) \le y\le \log x \), then \[\# \left\{ \frac x2 <p_n\le x : p_{n+m}-p_n\le y\right\} \ge \pi (x) \left( \frac{y}{2q\log x} \right)^{\exp (Cm)}.\] This paper contains the considerable details of related basic notations and results. The proof of the above theorem is an application of Maynard's Proposition 6.1 [loc. cit.].