Primes with Beatty and Chebotarev conditions
Caleb Ji Joshua Kazdan Vaughan McDonald
math.NT


Probabilistic Approximate Logic 
 and its Implementation 

	in the Logical Imagination Engine
    
	Mark-Oliver Stehr1 Minyoung Kim 1 
 
	Carolyn L. Talcott1 Merrill Knapp1 Akos Vertes2 

    April 2019
=============================================================================================




    We study the prime numbers that lie in Beatty sequences of the form ⌊α n + β⌋ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence with α of finite type and a Chebotarev class of some Galois extension is precisely the product of the densities α^-1·|C|/|G|.  Moreover, we show that the primes in the intersection of these sets satisfy a Bombieri–Vinogradov type theorem.  This allows us to prove the existence of bounded gaps for such primes. As a final application, we prove a common generalization of the aforementioned bounded gaps result and the Green–Tao theorem.




§ INTRODUCTION AND STATEMENT OF RESULTS

Primes in a fixed arithmetic progression {a + qn}_n = 1^∞ constitute a key object of interest in classical analytic number theory. The prime number theorem for arithmetic progressions computes the density of such primes.  We will discuss two natural generalizations of arithmetic progressions, one via an algebraic property and the other via an analytic one, and study primes constrained simultaneously by these conditions.

One way to generalize arithmetic progressions is by replacing the common integer difference q and the constant term a with arbitrary real constants α and β respectively. We then consider the sequence {⌊α n + β⌋}, which is known as a Beatty sequence.
In an earlier paper, Banks and Shparlinski <cit.> examine the density of primes that lie in certain Beatty sequences.  Another way to generalize arithmetic progressions is to note that reducing a primeq is equivalent to taking its Chebotarev class in the cyclotomic field (ζ_q). Generalizing to any Galois extension L/, the Chebotarev density theorem computes the proportion of primes p not dividing Δ_L that are contained in a given Chebotarev class.  

This paper studies the  primes p that satisfy both conditions. Roughly speaking, our first theorem will show that within the primes, the property of lying in a Beatty sequence and the property of having a fixed Artin symbol in a Galois extension L/ are independent.  We first recall some relevant notions.
The natural density of a class of primes 𝒮⊂ℙ is given by 


    δ(S) lim_X→∞#{ p≤ X : p∈𝒮}#{ p≤ X : p∈ℙ},

where ℙ denotes the set of all primes.  Note that this limit does not exist for all sets 𝒮. Given a Galois extension L/ of degree d with Galois group G and a prime p ∤Δ_L, let the Artin symbol [L//p] be the conjugacy class of Frob_𝔭 for any prime 𝔭⊆O_L lying above (p).  
Let C⊂ G be a conjugacy class, and let _C be the set of primes p∤Δ_L such that [L//p]=C.





The Chebotarev density theorem states that

    δ(P_C)=|C||G|.








In essence, the probability a randomly chosen prime number has a fixed Artin symbol C is |C|/|G|. Throughout this paper, we call set of primes with Artin symbols in a fixed subset of conjugacy classes in a given Galois extension L/ a Chebotarev set. For the sake of this paper, however, all Chebotarev sets will contain primes with a fixed Artin symbol.

On the other hand, we also consider Beatty sequences of the form

    ℬ_α,β =  {⌊α n + β⌋: n ∈},
 
where α is an irrational number and β is an arbitrary real number. We will require conditions on the type τ of α, which is given by

    τ = sup{ρ : lim inf_ n→∞
     n∈ℕ n^ρ‖α n ‖=0},

where ‖·‖ denotes the distance to the nearest integer.  Our results concerning primes in Beatty sequences rely on the condition that α is of finite type.  Most real numbers of interest have finite type, including π, e, and every algebraic number.  Let _α, β be the set of primes appearing in the Beatty sequence ⌊α n + β⌋.
Banks and Shparlinski <cit.> proved that if α has finite type, then  

    δ(_α, β) = 1α,

consistent with the observation that such a Beatty sequence will contain roughly 1/α of all the natural numbers. In fact, they also proved that arithmetic progressions and Beatty sequences are independent: the density of primes in a fixed arithmetic progression and Beatty sequence is the product 1/φ(q)α.

We prove a common generalization of the results of Banks and Shparlinski and the Chebotarev density theorem. To be more precise, we wish to determine the density of the set 

    _C,α,β_α,β∩𝒫_C.




Let L/ be a finite Galois extension and C⊂ G=(L/) be a conjugacy class of its Galois group.  Suppose α is positive, irrational, and of finite type and β is any real number. Then the density of the set _C,α,β in the primes is

    δ(𝒫_C,α,β) = δ(_α, β) ·δ(𝒫_C) = 1/α·|C|/|G|.






The following example gives an explicit computational suggestion of our results.

 Consider the Beatty sequence B_π,0=⌊π n⌋ and let L be the splitting field of x^3-2 over . L/ is a Galois extension with Gal(L/) ≅ S_3 and discriminant Δ_L = -2^4· 3^7.  For g∈ S_3, let C_(g) denote the conjugacy class of g. Then every prime 2,3 has Artin symbol equal to one of C_(e), C_(12), C_(123), with densities 1/6, 1/2, 1/3, respectively. <ref> shows the densities of the intersections with ⌊π n ⌋ are 1/6 π, 1/2 π, 1/3 π respectively.   Table 1 lists the proportion of the first n primes (not including 2, 3) of the form ⌊π n⌋, with a certain conjugacy class of (K/), and with both of these properties. 
Define

    δ(S,X) = #{p ≤ X: p ∈ S}/#{p ≤ X}.





In order to obtain a bounded gaps theorem for sets of primes of the form 𝒫_C, α, β, we first need to prove an analogue of the Bombieri-Vinogradov theorem.  We adapt work of Kane <cit.> to prove such a Bombieri-Vinogradov statement for the primes _C,α,β.  

Fix a finite Galois extension L/, a conjugacy class of its Galois group C⊂ G, and (a,q) =1. Then define 

    π_C(X;q,a) := #{p ≤ X:p ∤Δ_L, [L//p] = C, p ≡ a  q }.
 If we further specify irrationals α, β, let 

    π_C,α, β(X;q,a) := #{p≤ X:p ∤Δ_L, [L//p] = C, p ≡ a  q, p ∈B_α,β}.
 For future convenience, also define π_C,α,β(X) :=#{ p≤ X: p∤Δ_L, [ L//p]=C , p ∈B_α,β}.
Then we have the following theorem.




Suppose L/ is a Galois extension with a conjugacy class C and α,β are real numbers with α irrational of finite type.
Then there exists some positive level of distribution θ__C,α,β > 0 (see (<ref>) for the exact formula) such that for any 0 < θ < θ__C,α,β we have 

    '∑_q≤ x^θmax_y ≤ x
    (a, q) = 1|π_C, α, β(y; q, a) - |C|αφ(q)|G|π(y)|≪_A x(log x)^A

for any A>0, where '∑ is a sum over q≤ x^θ such that K∩(ζ_q)=.



Building on the work of Goldston, Pintz, and Yildirim, <cit.>, Zhang <cit.> proved the existence of infinitely many pairs of primes whose difference is at most 70· 10^6 .  By developing a suitable k-dimensional analogue of the Selberg sieve, Maynard <cit.> used the Bombieri–Vinogradov theorem to reduce the upper bound on the gaps to just over 600, and additionally proved that 

    lim inf_n→∞(p_n+m-p_n) ≪ m^3e^4m.
 
(Tao independently developed the underlying sieve but came to slightly different conclusions.) 

Several authors have extended Maynard's work to study gaps between primes in special subsets, including Beatty sequences <cit.> and Chebotarev sets <cit.>.  We are interested in proving bounded gaps for primes lying in _C,α,β. That is there is a constant D such that there are infinitely many pairs of distinct primes q_1,q_2 in _C,a,b such that |q_1 - q_2| ≤ D. Using the method of Maynard–Tao <cit.> and its extension by Thorner <cit.> to Chebotarev primes,
the positive level of distribution proven to exist in Theorem <ref> gives us the following bounded gaps statement.


Let α be a positive real number with type τ<∞.  Let q_i be the i–th prime in P_C, α, β, where P_C, α, β was defined in (<ref>).  For any σ∈ C, let L^⟨σ⟩ be the fixed field of σ.  Then there exists an effective constant D>0 (depending only on τ and [L^⟨σ⟩: ]) such that


    lim inf_n→∞(q_n+m-q_n) ≤ mDΔ_Lexp(mDΔ_L).












As another application, we can combine this Maynard–Tao framework with Green–Tao theorem <cit.>.  Note that the original Green–Tao theorem automatically holds for all positive density subsets of the primes.  Using work of Pintz <cit.> and its extension to Chebotarev sets by <cit.>, our next result shows that we can find arbitrarily long arithmetic progressions within the primes in P_C,α,β that are within a given distance from other primes also in P_C, α, β.  

Let L/ be a finite Galois extension and B_α,β be a Beatty sequence with α irrational with finite type.
Let m be a positive integer and ℋ = {h_1,…, h_k} be an admissible set, and suppose that 

    k ≫exp(2α |G|Δ_Lm/|C|θφ(Δ_L)),

where there is an implied absolute constant. Then there is an (m+1)-element subset ℋ' ⊆ℋ such there exists arbitrarily long arithmetic progressions of primes in the set

    {n: n + h' ∈_C,α,β for all h' ∈H'}.



Section <ref> contains a proof of <ref>, which computes the natural density of 𝒫_C,α,β.  Section <ref> contains a proof of <ref>, ensuring that the primes in 𝒫_C,α,β have a positive level of distribution.  Our proof makes use of bounds for certain exponential sums, which we prove following Kane <cit.> in Section 5.  In Section 6, we use <ref> to prove <ref>, establishing an infinitude of bounded gaps between primes in 𝒫_C,α,β.  In Section 7, we prove <ref>, giving a common generalization of Theorem 1.3 and the work of Green and Tao.





 §.§ Acknowledgements

This research was conducted at the Emory University Mathematics Research Experience for Undergraduates, supported by the NSA (grant H98230-19-1-0013) and the NSF (grants 1849959, 1557960). We thank Harvard University, Stanford University, and the Asa Griggs Candler Fund for their support. The authors thank Professor Ken Ono and Jesse Thorner for their guidance and suggestions.



§ PRELIMINARIES




The proof of Theorem <ref> reduces to proving a version of the prime number theorem for primes lying in both a fixed Chebotarev class and a fixed Beatty sequence. We will prove a more precise statement by constraining these primes to an arithmetic progression {a+nq}.  Then, we will derive the explicit q-dependence in the error term. In Section 4 this q-effective error term will be crucial to the proof of our Bombieri–Vinogradov type theorem. 

First we introduce some notation. Given σ∈Gal(L/), denote by L^⟨σ⟩ = {a ∈ L: σ a = a}. Moreover, given a set X and a subset S ⊆ X, we denote the indicator function of S by _S.


Let L/ be a finite Galois extension and let C ⊂Gal(L/) be a conjugacy class.  For any σ∈ C, let d[L^⟨σ⟩: ].  Let κ = 10^-d/(125dτ) If (a,q) = 1, then we have

    ∑_ p≤ X  
     p≡ a  q_𝒫_C,α,β(p) log(p) = 1/α∑_p≤ X 
     p≡ a  q1_𝒫_C(p)log(p) + O_L,α, β(q^d+1X^1 - κ).



Note that the error term explicitly describes the q-dependence. This will be vital in our application to our Bombieri–Vinogradov type result, <ref>.

The proof of <ref>
relies on a condition placed on the exponential sums 
    ∑_p ≤ M 
     p≡ a  q__C(p)log(p)e(θ p),

where C is a fixed conjugacy class of the Galois group.  Using work of Kane <cit.>, we will show that the magnitude of this sum is O(x^1-), where >0. This will allow us to use techniques from Banks and Shparlinski <cit.> to prove Theorem <ref> in the following section.








 §.§ Exponential sums and the work of Kane
 
Kane <cit.> bounds the exponential sum that we require in his proof of a variant of Vinogradov's three primes theorem for Chebotarev classes. 

Suppose that L/ is a finite Galois extension with G = (L/), C a conjugacy class of G, and X a positive real number. Moreover, take a < q with (a,q) = (Δ_L,q) = 1. Adapting Kane, we define the generating function


    G_L, C, X,q,a(α) = ∑_p≤ X 
     p ≡ a  q__C(p)log(p)e(α p).



To explain our bounds, we first require the following definition:


We say that a real number α has a good approximation with denominator s if there exists a rational number of the form r/s with (r, s) = 1 satisfying |α - r/s| <1/s^2.


Our general bound, whose proof we defer to Section <ref>, is as follows:



Take L/ to be a finite Galois extension, relatively prime integers a, q, and C ⊆Gal(L/) a conjugacy class.  Pick some element σ∈ C and letf d:= [L^⟨σ⟩:]. Let α be an irrational number with rational approximation of denominator XB^-1 > s > B for some B > 0. Then we have

    G_L,C,X,q,a(α) = O(q^d+1X· E(X,B)),

where 

    E(X,B) = log^2(X)B^-10^-d/12 + log^2(X)X^-10^-d/60+log^2(X)X^-10^-d/10+log^2+d^2/2(X)B^-1/12.

In particular, for 0 < e_1 < e_2 < 1 and a denominator in the range s ∈ [X^e_1, X^e_2] we have G_L,C,X,q,a(α) = O_e_1,e_2(q^d+1X^1 - η) for some η > 0. 






























The first main result states that Beatty-compatible densities multiply in the expected way with Beatty sequences.


The for the sets of primes R_α, β:= S ∩ℬ_α,β,

    δ(R_α,β) =   δ(S)δ(ℬ_α,β)= δ(S)·1/α.








 §.§ Exponential sums for finite type α


The bounds we have introduced thus far depend on the denominator of a certain rational approximation. To get a uniform statement that does not depend on an approximation, we need to assume that α has finite type. The next bound is similar to that of <cit.>.



Let γ be a fixed irrational number of finite type τ > 0 and let C be a conjugacy class of the Galois group of a finite Galois extension L/. Then for all real numbers 0 <  < 1/4 τ, there exists a constant η such that

    |∑_p ≤ X
    
    p ≡ a  q__C(p)log(p)e(α k p)| = O_L,α,β(q^d+1X^1 - η),

for all integers 1 ≤ k ≤ X^ provided that X is sufficiently large. Moreover, we can explicitly take η = 10^-d/max(125τ,20d), where d=[L:L^⟨ c⟩] for any c ∈ C.








The condition that α has finite type τ means that for any fixed ρ > τ there is a constant c > 0 such that for s≥ 1, we have α s > cs^-ρ.
Fix such a constant ρ < 1/4.
Now take r/s to be the convergent in the continued fraction expansion of α k which has largest denominator d not exceeding X^1-, so that 

    |α k - r/s| ≤1/s· X^1 - .

We isolate 1/X^1 - to get
1/X^1-≥ |α k s - r| ≥α k s > c(ks)^-ρ. Since we are taking k ≤ X^ we can rearrange to obtain

    s    ≥ c^1/ρ k^-1(X^1-)^1/ρ≥ c^1/ρX^1/ρX^(-1 - 1/ρ)≥ X^1/(4ρ) > X^

for sufficiently large X. We plug in α  = γ k in <ref>, which yields for s ∈ [X^,X^1 - ] the bound

    ∑_p≤ X
    p ≡ a  q__C(p)log(p)e(α p) =  O(q^d+1X· E(X,X^)) = O(q^d+1X^1-η).

We now explicitly compute η.  Specifically, in <ref>, take = 1/5τ.  Then in the region q ∈ [X^1/(4 τ), X^1 - ] ⊆ [X^, X^1 - ], we have that by setting B = X^/2 that  G_L,C, X,q,a(α) is 

    O(q^d+1X(log^2(X)X^-10^-d/(120τ) + log^2(X)X^-10^-d/60+log^2(X)X^-10^-d/(10d)+log^2+d^2/2(X)X^-1/120τ))
    
    = O(q^d+1X(log^2(X)(X^-10^-d/(120τ) + X^-10^-d/(10d))))
    = O(q^d+1X^1-10^-d/b + δ)

for any small δ > 0 and b= max(10d, 120τ).
Therefore, taking η = 10^-d/max(20d, 125τ) yields an explicit bound.












































 §.§ Facts about irrational sequences

We begin with some preliminary definitions regarding irrational numbers. This presentation follows section 3 of <cit.>.  The first tool we will need is a bound on discrepancies.








Define 

    D_γ,δ(M)sup_I⊆ [0, 1)|V(, M)M - |||,

where V(, M) is the number of positive integers m≤ M such that {γ m + δ}∈ and the supremum is taken over all subintervals = (r_1, r_2) of the interval [0, 1).




Let γ be a fixed irrational number of finite type τ<∞.  Then for all δ∈ we have that

    D_γ, δ(M)≤ M^-1/τ+o(1)     (M→∞),

where the function implied by o(·) depends only on γ.


The key to analyzing Beatty sequences arises from the fact that they have cleanly stated indicator functions. This next elementary lemma allows us to rewrite the indicator function of a Beatty sequence in a tractable form.


Let α, β be in  with α > 1.  Then an integer m has the form m=⌊α n+β⌋ for some integer n if and only if

    0<{α^-1(m-β + 1)}≤α^-1.

The value of n is determined uniquely by m.





 §.§ Intersecting general sets of primes with Beatty sequences


One might ask if we can replace the Chebotarev condition with other sets of primes S.
Indeed, if the corresponding exponential sums are bounded by O(X^1 - κ) for some κ > 0, we could prove an analogous prime number theorem for primes that are both in S and a fixed Beatty sequence.


One also might ask whether the power-saving exponential sum bound can be replaced with a weaker bound, such as o(X/(log X)^A) for any A. It is likely that we could prove an analogous prime number theorem. However, these cases do not apply to Chebotarev sets, and making a general statement about such primes may be difficult. However, we will see in that a power-saving bound is essential for proving a Bombieri–Vinogradov type theorem.




Banks and Shparlinski also proved a prime number theorem for primes in the sequences 𝒞_n,α, β, q, a = q⌊α n + β⌋ + a, (a,q) = 1
. Their results show that the natural density of this set is δ( 𝒞_α, β, q, a)= 1/φ(q)α. One can easily modify our proofs in order to obtain prime number theorem and density statements for primes in T_α,β,q, a:= _C∩𝒞_α, β,q,a. The proofs of Bombieri–Vinogradov and bounded gaps will also be the same, since the error term will still be power-saving.




§ PROOFS OF THEOREM <REF> AND THEOREM <REF>

We now prove <ref>, which implies <ref>. Before proving this statement, we need to detail Vinogradov's theorem on the indicator function of a Beatty sequence.


Let γ∈ (0, 1) be a real number and let ψ(x) be the periodic function with period one for which 

    ψ(x) =  
    1    if  0<x≤γ; 
     
    0    if γ<x≤ 1.

For any Δ such that 

    0 < Δ < 1/8   and   Δ≤1/2min(γ, 1 - γ),

there is a real-valued function with the following properties

    
  * ψ_Δ(x) is periodic of period one;
    
  * 0 ≤ψ_Δ(x) ≤ 1 for all x ∈;
    
  * ψ_Δ(x) = ψ(x) if Δ≤ x ≤γ - Δ or γ + Δ≤ x ≤ 1 - Δ.
    
  * ψ_Δ(x) has a Fourier series
    
    ψ_Δ(x) = γ + ∑_k = 1^∞(g_ke(kx) + h_ke(-kx))

    with uniform bounds on the coefficients 
    
    max(|g_k|, |h_k|) ≤min(2/π k, 2/π^2k^2Δ) for all  k ≥ 1.



Combining this Fourier expansion with our bounds on exponential sums allows us to prove a version of the prime number theorem for primes in P_C, α, β.



Define 

    S_C,α,β, q,a(X) ∑_p ≤ X
     p≡ a  q__C(p)__α,β(p)log p.
 
Let γ = α^-1 and δ = α^-1(1 - β).
By Lemma <ref>, p = ⌊α n + β⌋ if and only if 0 < {γ p + δ}≤γ, which implies that

    S_C,α, β, q, a(X) = ∑_p ≤ X
     p≡ a  q__C(p)__α,β(p)log p
        = ∑_p ≤ X
     p≡ a  q__C(p)_(0,γ](γ p + δ)log p + O(1) 
       = ∑_p ≤ X
     p≡ a  q__C(p)ψ(γ p + δ)log p + O(1).


Then we can replace the the indicator function ψ with the Fourier expansion described in Theorem <ref> at a cost of

    S_C,α,β,q,a(X) = ∑_p≤ X 
     p≡ a  q__C(p)log(p)ψ_Δ(γ p + δ) + O(1 + 𝒱(ℐ,X)log X),

where we are taking 𝒱(ℐ,X) to be the set of integers m ≤ X with the prescribed fractional part lying inside

    ℐ = [0,Δ) ∪ (γ - Δ, γ + Δ) ∪ (1 - Δ, 1).


We have |ℐ| ≤ 4Δ, so by the definition of discrepancy and Lemma <ref> we have that 
 
    𝒱(ℐ,X) = O(Δ X + X^1/2-1/τ).


Now to get a handle on S_C,α, β, q,a, we use the Fourier expansion and get 

    ∑_p≤ X
     p≡ a  q__C(p)log(p)ψ_Δ(γ p + δ) = 
    γ∑_p≤ X 
     p≡ a  q__C(p)log(p)    + ∑_k = 1^∞ g_ke(δ k)∑_p≤ X
     p≡ a  q__C(p)log(p)e(γ k p)
       + ∑_k = 1^∞ h_ke(-δ k)∑_p≤ X
    p≡ a  q__C(p)log(p)e(-γ k p).


Now we are in a position to use the bounds on exponential sums we derived earlier. By <ref>, for 
1 ≤ k ≤ X^ where < 1/4τ we have 

    ∑_k ≤ X^g_ke(δ k)∑_p ≤ X
    p≡ a  q__C(p)log(p)e(γ k p) =O(q^d+1XE(X,X^)∑_k ≤ X^k^-1) = O(q^d+1Xlog(X^)E(X,X^)),

recalling the definition of E(X,B) from (<ref>). By <ref> there exists some η > 0 for which we may take E(M, M^)=M^η.  Similarly, we have 



    ∑_k ≤ M^h_ke(δ k)∑_p≤ X
    p≡ a  q__C(p)log(p)e(γ k p) = O(q^d+1Xlog(X^))E(X,X^)).

For the larger terms, we can use the trivial bound 

    |∑_p≤ X
    p≡ a  q__C(p)log(p)e(γ k m)| ≤∑_p≤ X
    p≡ a  qlog(p) = O(X),
 along with the bounds on the Fourier coefficients to get that

    ∑_k > X^g_ke(δ k)∑_ p≤ X
    p≡ a  q__C(p)log(p)e(γ k p) =O( X ∑_k > X^k^-2Δ^-1) =O( XX^Δ).

This yields

    ∑_p ≤ X
    p≡ a  qΛ(m)ψ_Δ(γ p + δ) = γ∑_p ≤ X
    p≡ a  q__Clog(p) +O(q^d+1Xlog(X^)E(X,X^) +XE(X,X^)Δ).

Thus we have

    S_C,α, β, q, a(X) = γ∑_p≤ X
    p≡ a  q__Clog(p)+O(Δ Xlog X + X^1/2-log X +q^d+1Xlog(X^)E(X,X^) +X^1-Δ),

where the constant implied by O(·) depends only on α and L.

Finally, we plug in E(X,X^) ≪ X^η and set Δ = min{X^-2η, 10/81, γ/2, 1-γ/2}, where we note that in our case 10η <.  This gives 

    S_C,α, β, q, a(X)
       = γ∑_p ≤ X
    p≡ a  q__C(p)log(p)+O(q^d+1(X^1+2η - log X + X^1/2-log X +X^1-ηlog X +X^1-2η))
       = 1/α∑_p≤ X
    p≡ a  q_(p)log(p) +  O(q^d+1
    X^1 - η)

where again the constant implied by O(·) depends only on α and L, which implies the desired result.
 

Note that if q^d+1X^1 - κ≫ X then this bound is trivial. Thus, in the theorem statement we require q < X^κ/(d + 1) - for any > 0 to ensure the error term is still power saving.

Recalling that the exponential sums yield an upper bound of M^1- η for η = 10^-d/max(125τ, 20 d), we note that for this error term we can choose the same power-saving η, which for convenience of writing we can take to be κ = 10^-d/(125dτ).

Finally, applying a standard partial summation argument to Theorem <ref> gives the following q-effective version of the prime number theorem.



For (q,Δ_L) = 1 we have the asymptotic

    π_C,α,β(X; q, a) = 1/απ_C(X;q,a) + O_L(q^d+1X^1 - κ),

where κ = 10^-d/(125dτ), q < X^κ/(d + 1)- for any > 0, and X > X_0(α,β, C, L) for a constant X_0.





§ A BOMBIERI–VINOGRADOV TYPE THEOREM


In this section we prove our analogue of the Bombieri–Vinogradov theorem.  There are two ingredients for this proof: a Bombieri–Vinogradov type theorem for Chebotarev classes and the q-effective version of the prime number theorem proven in the preceding section.  The first of these was done by Murty and Murty <cit.>.  We explain their result below.  

We note that Chebotarev classes in the cyclcotomic field (ζ_q) are equivalent to residue classes a q where (a,q)=1.
This point is precisely why we need a q-effective version of the prime number theorem; we need to explicitly extract the error term for the field L(ζ_q) in terms of the error term for L.

For Chebotarev classes,
Murty and Murty prove the following Bombieri–Vinogradov type theorem.

<cit.>

For Q=x^θ- with some θ≥min{2/|G|, 1/2} and any >0, we have 

    '∑_q≤ Qmax_y ≤ x
    (a, q) = 1|π_C(y, q, a) - |C|φ(q)|G|π(y)|=O_A( x(log x)^A),

where the sum is over q such that K∩(ζ_q)=.


Combining this statement with our q-effective prime number theorem, <ref> allows us to conclude our proof of <ref>. For τ the type of α and d the dimension of the fixed of an element σ∈ C, we will end up taking the following level of distribution:

    θ__C,α,β :=  1/125· 10^d· d(d+1)τ.











We have by Theorem <ref> that π_C, α, β(y, q, a) =  1/απ_C(y,q,a) + O_L(q^d + 2y^1 - κ) where we are taking κ = 10^-d/(125 d τ) where d is the dimension of the fixed field of an element σ∈ C. First set θ__C,α,β = min(κ/(d + 1) , θ_C) = κ/(d+1) where θ_C is the Chebotarev θ as in Theorem <ref>, and κ = κ_K(ζ_Q) as in <ref>. Then set θ = θ__C,α,β - for any > 0.  We take maxima and sum over moduli q ≤ Q := x^θ with K ∩[ζ_q] =. Then for some constant A_L depending only on L, we have by the triangle inequality that

    ∑_q≤ x^θ   max_y ≤ x
    (a, q) = 1|π_C, α, β(y; q, a) - |C|φ(q)|G|απ(y)| 
       = ∑_q≤ x^θmax_y ≤ x
    (a, q) = 1|1/απ_C(y; q, a) - |C|αφ(q)|G|π(y) + O_L(q^d+1y^1-κ)| 
       =1/α∑_q≤ x^θmax_y ≤ x
    (a, q) = 1|π_C(y; q, a) - |C|φ(q)|G|π(y)| +∑_q≤ x^θ|A_Lq^d+1x^1 - κ|
        
       =O_A( xα(log x)^A + x^κ - (d+1)O_L(x^1-κ))
       =O( x(log x)^A),

where we use <ref> and <ref> to bound each of the two terms term.




§ BOUNDING EXPONENTIAL SUMS WITH CHEBOTAREV CONDITIONS


We now turn our attention to proving <ref>, which bounds the magnitude of the sum G_L,C,X,q,a(α). By the discussion in the foregoing section, this problem reduces to placing a q-effective bound on the sum defined below.



Suppose that L/ is a finite Galois extension with G=Gal(L/), C a conjugacy class of G, χ a Dirichlet character with modulus q, and X a positive real number.  We define the function 

    G_L, C, X, χ(α) = ∑_p≤ X__C(p)log(p)e(α p)χ(p).



Then by orthogonality of Dirichlet characters, we have that

    G_L, C, X,q,a(α) = 1/φ(q)∑_χχ(a)G_L,C,X,χ(α),

so it suffices to bound G_L,C,X,χ for all χ of modulus q.  We can further use orthogonality of Hecke characters (see <cit.> for more on Hecke characters) to decompose these sums into certain functions F_K, ξ, X,χ. First, given a number field K/, we need the von Mangoldt function on integral ideals of 𝒪_K given by

    Λ_K(𝔞):= 
    logN𝔭   𝔞 = 𝔭^r, r ≥ 1
    
    0     otherwise.



If K/ is a number field, ξ a Grössencharacter of K, χ a Dirichlet character with modulus q, and X a positive number, define the function 

    F_K, ξ, X, χ(α) = ∑_N(𝔞)≤ XΛ_K(𝔞)ξ(𝔞)e(αN(𝔞))χ(N(𝔞)),

where the sum above is over ideals 𝔞 of L with norm at most X.

The purpose of switching from __C(𝔭)logN𝔭 to Λ_K(𝔞) is for a future application of Vaughan's identity in the proof of <ref>. The next proposition, which is a variant of  <cit.>, gives us an orthogonality statement for the F_K,C,X,χ.


Let L/ be a finite Galois extension and C a conjugacy class of G=(L/). Choose a representative σ∈ C and let K:= L^⟨σ⟩.  Then we have that 

    G_L, C, X,χ = |C||G|(∑_ξξ(c)F_K,ξ, X, χ(α)) + O(√(X)log X),

where the sum is over characters ξ of the subgroup ⟨ c⟩⊂ G, which can be thought of as (ray class) characters of L.



The proof is identical to that of <cit.>, with the key idea being that ideals with norm equal to a larger prime power contribute O(√(X)log X) to the sum. The only difference is that both sides of the equality are multiplied by a Dirichlet character. 


In his work, Kane proves a proposition concerning the value of F_K,ξ,X := F_K, ξ, X,χ_0 where χ_0 is the trivial character of modulus 1 (the identity). Our q-effective version of this proposition is very similar, except with an extra factor of q^d+1.












Let K be a degree d number field, ξ a Grössencharacter, and χ a Dirichlet character with modulus q. Let α be an irrational number with rational approximation of denominator s with XB^-1 > s > B for some B > 0. Then we have the estimate F_K,ξ,X,χ(α)=

    O(q^d+1X(log^2(X)B^-10^-d/12 + log^2(X)X^-10^-d/60+log^2(X)X^-10^-d/10+log^2+d^2/2(X)B^-1/12)),

where the asymptotic constant may depend on K and ξ, but not on X, s, q, B, or α.

In order to arrive at this result, we will need q-analogues of many results of Kane. We follow his argument, making the necessary adjustments where needed.



 §.§ q-effective versions of results of Kane

With Proposition <ref> as a goal, we cite and adapt several lemmas from Kane <cit.>.  The first needs no modification.



<cit.>
Let X, A, C be positive integers.  Let α be a real number with rational approximation of denominator s.  Suppose that for some B>2A, that XB^-1>s>B.  Then there exists a set S of natural numbers so that

    
  * Elements of S are of size at least Ω(BA^-1).
    
  * The sum of the reciprocals of the elements of S is O(A^2B^-1+X^-1A^4C).
    
  * For all positive integers n≤ C, either n is a multiple of some element of S or nα has a rational approximation with some denominator s' with XA^-1n^-1>s'>A.



The following two lemmas are versions of Lemmas 19 and 20 in <cit.>, twisted by a Dirichlet character.



Fix K a number field.  Let n be a positive integer, let χ be a Dirichlet character of modulus q, and let X and  be positive real numbers.  Then for any >0, we have that

    ∑_n|N(𝔞) 
    N(𝔞)<Xχ(N(𝔞))N(𝔞)   = O(log(X)n^n), 
    ∑_n|N(𝔞𝔟) 
    N(𝔞𝔟)<Xχ(N(𝔞𝔟))N(𝔞𝔟)   = O(log^2(X)n^n),

where the implied constant depends on K and , but nothing else. (The first sum above is over ideals 𝔞 such that n|N(𝔞) and N(𝔞)≤ X.  The second sum is over pairs of ideals 𝔞 and 𝔟, such that N(𝔞·𝔟) satisfies the same conditions.)


The statement of <cit.> is the same as the one we wish to prove except that χ is specialized to the trivial character; that is, the numerator is 1.  The magnitude of the left hand side is maximized when the trivial character is taken, so the result holds by Lemma 19 of <cit.>.




Pick a positive integer X.  Let [X]={1, 2, …, X}.  Let P be a rational polynomial with leading term cx^k for some integer c≠ 0, and let Q be an integral polynomial.  Let α be a real number with a rational approximation of denominator s.  Let χ be a Dirichlet character with modulus q.  Then 

    |∑_x∈ [X]e(α P(x))χ(Q(x))| =O( q^k|c|X(1s+qX+sq^kX^k)^10^-k),

where the implied constant depends only on k.


Call the sum in question S(α, χ). Since Q is an integral polynomial, we have that Q(nq + a) ≡ Q(a) q.
Thus, we can break up the sum in question in accordance with the residue class of x modulo q:

    |S(α, χ)| = |∑_x∈ [X]e(α P(x))χ(Q(x))| = |∑_a ∈ (/q)^×χ(Q(a))∑_x ≤⌊X - a/q⌋e(α P(qx + a)) |.

Now, upon applying Lemma 20 of Kane and noting that the leading coefficient of P(qx + a) is q^kc, we get that 

    S(α, χ)    ≤∑_a ∈ (/q)^×|χ(Q(a))∑_x ≤⌊X - a/q⌋e(α P(qx + a))| 
       =O_L( ∑_a ∈ (/q)^× |q^kc|·X - a/q(1/s + q/X- a + sq^k/(X - a)^k)^10^-k)
       =O_L( q^k |c| X (1/s + q/X + sq^k/X^k)^10^-k).



These lemma are vital for the main theoretical input of Kane, which is a geometry of numbers argument used to bound an exponential sum without a Von Mangoldt weighting. We now prove the q-analogue of this result.



Assume that K is a number field of degree d, ξ is a Grössencharacter of modulus 𝔪, and χ is a Dirichlet character of modulus q.  Then for any positive number X and a real number θ with a rational approximation of denominator s, we have the bound

    |∑_N(𝔞)≤ Xξ(𝔞)e(αN(𝔞))χ(N(𝔞))| = O_L,ξ(q^d+1X(1/s + 1/X^1/d + s/X)^10^-d/2).



 This proof follows much in the same way as <cit.>. We will recall the setup of that proof, and indicate where we make modifications. Kane's proof requires an application of Lemma 20 in his paper, for which we have the q-effective analogue <ref>. Our bound has the extra condition that the polynomial q(x) inside the character χ must be integral, not just rational. No other serious modifications are required. First, divide the sum into ray classes of modulus 𝔪. There are only finitely many such ray classes, so it suffices to prove our result for a single class. In other words, we bound the sum over 𝔞 in a given class. 

Fix an integral ideal representative 𝔞_0 of a ray class. Setting K_𝔪^1 be the elements of K that are congruent to 1𝔪, every integral ideal in the class of 𝔞_0 can be written as b𝔞_0 for some b∈ K_𝔪^1∩𝔞_0^-1. The representation is unique up to multiplication by an element in 𝒪_K^∗∩ K_𝔪^1. By the multiplicativity of  Grössencharacters, ξ(b𝔞_0)=ξ(b)ξ(𝔞_0).  Because ξ has modulus 𝔪 and b∈ K_𝔪^1, we can approximate ξ(b)=ψ(b) by a continuous character ψ: (K⊗)^∗→ℂ^∗, where ψ(𝒪_K^*∩ K_𝔪^1)=1. The multiplicativity of the norm implies that N_K/(b𝔞_0)=|N_K/(b)|N_K/(𝔞_0).

Kane then implements a geometry of numbers argument. First, note that T:= K_𝔪^1∩𝔞_0^-1 is a translate of a lattice in K⊗. Kane uses the fact that N_K/(b) is a degree d polynomial with rational coefficients in terms of a basis for this lattice.

For our situation, however, we want an integral polynomial. In fact, upon fixing a free basis for O_K, we have that N_K/ has integral coefficients on K (not on the lattice). Call this polynomial P(b) where b = (x_1,…, x_n) is in the chosen integral basis for K/. To make better sense of the norm applied to 𝔞_0b, we choose k such that 𝔞_0^k is trivial in the ray class group, and rewrite 
N_K/(𝔞_0b) = N_K/(g_k,b)/N_K/(𝔞_0^k-1) where we choose a generator (𝔞_0^kb) = (g_k,b) for the principal ideal.

The sum that we need to compute is over all of the b in the lattice with norm not exceeding X/N_K/(𝔞_0) in a fundamental domain of the action of 𝒪_K^∗∩ K_𝔪^1.  First take D to be a fundamental domain for the action of 𝒪_K^∗∩ K_𝔪^1 in (K ⊗)^∗. Then letting R := D · (0, (X/N_K/(𝔞_0))^1/d), the over the desired fundamental

    ξ(𝔞_0)/χ(N_K/(𝔞_0^k-1))∑_b∈ T∩ Rψ(b) e(α|P(b)|)χ(|P(g_k,b)|),

where we note P(b) is an integral polynomial on the fixed basis of 𝒪_K. Kane notes that P(b) will have a constant sign on connected components of R, since P extends to a continuous function on R.  Therefore, by restricting the sum to a single connected component of R, we can ignore the absolute value of P taken in the sum.

The main idea is to reduce (<ref>) to a sum in 1 dimension, which can be handled by Lemma <ref>. In this case, we want our summands to be of the form e(α p(x))χ(q(x)) for p ∈[x] with an integer leading term and q(x) ∈[x]. In order to do this, pick a vector v ∈ K, t + v ∈ T for all t ∈ T. Then P(b+vx) is one variable degree d polynomial in n whose rational leading coefficient does not depend on b. By replacing v with a positive integral multiple of itself, we can assume that the leading coefficient is a non-zero integer.
Moreover, first choosing an integral generator (v_k) = 𝔞_0^kv, we have that the polynomial inside the character χ is Q(b + vx) := P(𝔞_0^k(b + vx)) = P(g_k,b + v_kx). Since g_k,b,v_k are algebraic integers and P is an integer polynomial, Q(b + vx) also has integer coefficients.

With this choice, the rest of the argument directly follows Kane. First fixing an integer Y= Θ(X^1/2d), he defines a line in T to be a subset of T of the form {b+v, b+2v,…,b+Yv} for b∈ T.  Each element of T is contained in Y lines, so we can rewrite (<ref>) as 
    ξ(𝔞_0)/χ(N_K/(𝔞_0^k-1))Y∑_lines N∑_b∈ N∩ Rψ(b) e(α P (b))χ(Q(b)).


Kane breaks up the sum based on whether N is contained in R. 
For lines not contained in R, Kane's argument applies and we get a bound O(X^1 - 1/dY).  When a line N contained in R, his arguments show the contribution of the inner summand in (<ref>) is

    min(Y^2|(b+v)^-1|, Y) + ∑_n=1^Y e(α p_b(n))χ(q_b(n)).


By Lemma <ref>, the second term is 
    q^k|c|Y(1s+qY+sq^kY^k)^10^-k.


Summing over the lines, we get 
    q^k|c|X(1s+qX+sq^kX^k)^10^-k.
 

Lastly, Kane's original arguments show that

    ∑_lines N⊂ RO(min(Y^2|(b+v)^-1|,Y)) = O(X^1 - 1/dY),
 
which is again within the desired bounds.

Applying Abel summation and Lemma <ref> yields the following corollary.


Fix K a number field of degree d and ξ a Grössencharacter of modulus 𝔪.  Then given a positive number X and an irrational number α which has a rational approximation of denominator s, we have that

    |∑_N(𝔞)≤ Xlog(N(𝔞))ξ(𝔞)e(αN(𝔞))χ(N(𝔞)) | = O_L, ξ(q^d+1Xlog (X)(1s+1X^1/d+sX)^10^-d/2).


Using the above lemmata, we can now attain our necessary estimate of F_K, ξ, χ, X(α).

 This proof adapts <cit.>, which in turn adapts Theorem 12.6 in <cit.>, which is an application of Vaughan's identity.  We first see that
the necessary generalization of Equation (13.39) in <cit.> still applies.  Letting y=z=X^2/5, we find that F_K, ξ, X,χ(α) is the same as 


    ∑_N(𝔞𝔟)≤ X
    N(𝔞)<X^2/5μ(𝔞)ξ(𝔞)log(N(𝔟)) e(αN (𝔟)N(𝔞))χ(N(𝔞)) 
       - ∑_N(𝔞𝔟𝔠)≤ X 
    N(𝔟), N(𝔠)≤ X^2/5μ(𝔟)Λ_L(𝔠)ξ(𝔟𝔠)ξ(𝔞)e(αN(𝔟𝔠)N(𝔞))χ(N(𝔞𝔟𝔠)) 
       + ∑_N(𝔞𝔟𝔠)≤ X 
    N(𝔟), N(𝔠)≥ X^2/5μ(𝔟)Λ_L(𝔠)ξ(𝔞𝔠)ξ(𝔟)e(αN(𝔞𝔠)N(𝔟))χ(N(𝔞𝔟𝔠)) + O(X^2/5).


As in <cit.>, we bound the first time using Corollary <ref> on the sum over 𝔟.  Let A=B^1/4≤ X^1/8. By Lemmata <ref> and <ref>, we can bound the sum over terms where αN(𝔞) has no rational approximation with denominator between A and X/AN(𝔞) by 

    O(X(log^2(X)(A^3B^-1+X^-3/5A^4)(BA)^)) = O(Xlog^2(X)B^-1/4+).

For other values of 𝔟, Corollary <ref> bounds the sum as

    O(q^d+1Xlog^2(X)(B^-1/4+X^-3/5d)^10^-d/2).


The second term is bounded similarly.  We let A=min(B^1/4, X^1/41), and use Lemmas <ref> and <ref> to bound the sum over terms with 𝔟 and 𝔠 such that N(𝔟𝔠)α has no rational approximation with denominator s between A and X/AN(𝔟𝔠) by 

    O(Xlog^3(X)(BA)^ (B^-1/4+X^-1A^4X^4/5)) = O(Xlog^3(X)(B^-1/4+ + X^-1/10)).

Using <ref>, we bound the sum over other values of 𝔟 and 𝔠 as 

    O(q^d+1Xlog^2(X)(A^-1+X^-1/5d)^10^-d/2).


The final sum can be bounded exactly as in Proposition 23 of <cit.>.  The only difference is that we have factors of Dirichlet characters, but when they are inserted into the Cauchy-Schwarz argument the fact that their magnitude is 1 implies that the same bounds hold.  So indeed, the final bound of

    O(Xlog^2(X)(A^-1+X^-2/5d)^10^-d/4)

holds.
Putting all of this together, we get the desired bound for F_K, ξ, X, χ(α).



This follows immediately by the orthogonality relations given by Equation (<ref>), <ref>, and <ref>.





§ BOUNDED GAPS AND DENSE CLUSTERS


In <cit.>, Maynard extracts additional information about sets of well-distributed primes.  His results allow one to derive an asymptotic count for the number of primes with small gaps (i.e. the primes in dense clusters). 

To be precise, he stipulates the following. 
Given a set of integers , a set of primes , and L = {L_1,…, L_k} an admissible collection of linear functions L(n)=l_1n+l_2, we define

    (x)={n∈ : x≤ n < 2x},     (x; q, a) = {n∈(x), n≡ a  q}, 
       L() = {L(n): n∈},     φ_L(q)=φ(|l_1|q)/φ(|l_1|), 
       _L, (x) = L((x))∩,     _L, (x; q, a) = L((x; q, a))∩.




<cit.>
(, , , B, x, θ).  Let k = #.

    
  *  is well distributed in arithmetic progressions: we have
    
    ∑_q≤ x^θmax_a|#(x; q, a)-#(x)q| ≪#(x)(log x)^100k^2.

    
    
  * Primes in L()∩ are well distributed in most arithmetic progressions: for any L∈ we have 
    
    ∑_q≤ x^θ
     (q, B) = 1max_(L(a), q)=1|#_L, (x; q, a)-#_L, (x)φ_L(q)| ≪#_L, (x)(log x)^100k^2.

    
    
  *  is not too concentrated in any arithmetic progression: for any q<x^θ we have 
    
    #(x; q, a) ≪#(x)q.




Maynard proves the following result for sets satisfying Hypothesis <ref>.



[<cit.>, Theorem 3.1]
Let α > 0 and 0<θ < 1.  Let A be a set of integers, P a set of primes, L={L_1, …, L_k} an admissible set of k linear functions, and B, x integers.  Let L_i(n)=a_in+b_i∈L have coefficients that satisfy 0≤ a_i, b_i≤ x^α for all 1≤ i≤ k, and let k≤ (log x)^α and 1≤ B≤ x^α.  

There is a constant D_α,θ depending only on α and θ such that the following holds.  If k≥ D_α,θ and (A, L, P, B, x, θ) satisfy Hypothesis <ref>, and if δ>(log k)^-1 is such that

    1kφ(B)B∑_L∈Lφ(a_i)a_i#P_L, A(x)≥δ#A(x)log x,

then 

    #{n∈A(x): #({L_1(n), …, L_k(n)}∩P)≥ D_α,θ^-1δlog k}≫#A(x)(log x)^kexp(D_α,θk).


Moreover, if =ℙ, k≤ (log x)^1/5 and all L∈L have the form an+b_i with |b_i|≤ (log x)k^-2 and a≪ 1, then the primes counted above can be restricted to be consecutive, at the cost of replacing exp(Ck) with exp(Ck^5) in the bound.


Using Theorem <ref>, we now prove Theorem <ref>, which is a bounded gaps statement for P_C, α, β.  We do this by choosing our parameters to match the primes we are interested in, checking they satisfy the conditions, and translating the conclusion to match the desired statement. First we state a dense clusters theorem:


Let L/ be a finite Galois extension with discriminant Δ_L, and B_n,α,β = ⌊α n + β⌋ a Beatty sequence with α of finite type. Then there exists a constant D_L only depending on the field L such that if m ∈ and k = exp(D_L m), for any admissible set {n + b_1,…, n + b_k} we have 

    #{x ≤ n ≤ 2x:  at least m of n + b_i ∈P_C,α,β}≫_m x/(log x)^k.




Let  be the integers, let  be an admissible set of the form {n+b_1, …, n+b_k}, let B be the discriminant Δ_L of the extension L/, and let = _C, α, β be the primes in a fixed Chebotarev class and Beatty sequence with α of finite type.
For the sake of convenience, we take x large enough so that b_i < x^1/2 and k ≤ (log x)^1/2, so that the conditions of <ref> are satisfied.
We first check that these parameters do indeed satisfy Hypothesis <ref>.  (1) and (3) are trivially true for all the integers.  For (2), by Theorem <ref> and the triangle inequality, we have 


    ∑_q≤ x^θ
     (q, B) = 1max_(L(a), q)=1|#_L, (x; q, a)-#_L, (x)φ_L(q)| 
           ≪∑_q≤ x^θ
     (q, B) = 1max_(L(a), q)=1|π_C, α, β(2x+b_k-1; q, a) 
       -π_C, α, β(2x+b_k-1)φ(q)| 
           + |π_C, α, β(x+b_1-1; q, a)-π_C, α, β(x+b_1-1)φ(q)| 
       ≪#_L, (x)(log x)^100k^2.

For sufficiently large x, we have #_L, (x)>x2log x for all L∈L by the prime number theorem.  This implies that  

    1kφ(B)B∑_L∈Lφ(a_i)a_i#P_L, A(x)≥1kΔ_Lkx2log x≥12Δ_L#A(x)log x.

Thus by Theorem <ref>, when (2 Δ_L)^-1 > (log x)^-1 we have

    #{x≤ n < 2x: #({L_1(n), …, L_k(n)}∩P_C, α, β)≥ D^-1(2Δ_L)^-1log k}≫x(log x)^kexp(Dk).

Setting k ≥⌈exp(2mDΔ_L)⌉, or equivalently D_L ≥ 2DΔ_L yields the desired result.






 Choose b_j= p_π(k)+j where j∈ [1,k] and p_j is the jth prime.  For n≥ 6,


    nlog n + nloglog n - n < p_n < nlog n + n loglog n

If n≥ 355991, 

    n/log n ( 1+ 1/log n ) ≤π(n)≤n/log n ( 1 + 1/log n+2.51/(log n)^2)

Combining these two statements and 
doing an explicit Mathematica computation for small cases (see <cit.>), we have
p_π(k)+k-p_π(k)+1≤ 1.6k log k
for all k≥ 213.  Then if q_i is the ith prime in P_C, α, β, after adjusting D so that D ≥ 1.6· 213 ·log(213), we get that

    lim inf_n→∞(q_n+m-q_n) ≤ mDΔ_Lexp(2mDΔ_L),

as desired.







§ ARITHMETIC PROGRESSIONS IN BOUNDED GAPS FOR CHEBOTAREV INTERSECT BEATTY

We can apply the formalism of prime gaps to prove <ref>, a common generalization of the Green–Tao theorem and bounded gaps for primes in P_C,α,β. The theorem shows that we can find collections of arbitrarily long arithmetic progressions with bounded gaps.








This result will follow from a general criterion of Pintz, which marries the GPY method with Green–Tao arguments.



 §.§ The GPY setup


Let H = {h_1,…, h_k} be an admissible set. Following Thorner <cit.> we let

    U = ∏_p ≤logloglog N
    p ∤Δ_Lp

for some positive integer N to be chosen later.
This quantity differs from the W in the Maynard–Tao arguments by the primes that divide Δ_L, in order to exclude those moduli that ramify.
We first define 

    S_1(N,_C,α,β) ∑_N≤ n≤ 2N 
     n≡ u_0 U(∑_d_i|n+h_i, ∀ iλ_d_1, …, d_k)^2,

and

    S_2^(m)(N, _C, α, β)∑_N≤ n≤ 2N 
     n≡ u_0 Uχ__C,α, β(n+h_m)
    (∑_d_i|n+h_i, ∀ iλ_d_1, …, d_k)^2.

which sum to

    S_2(N, _α, β) = ∑_i=1^kS_2^(i)(N, _C,α, β).

for weights λ_d_1,…, d_k defined in terms of U,F, and R = N^θ/2 - δ where θ is the level of distribution.
The Maynard–Tao program seeks to show that 

    S_2(N,_C,α,β) - ρ S_1(N,_C,α,β) > 0

for appropriate choices of weights λ_d_1,…, d_k as well as N, ρ. This would then show at least ρ primes in the interval [N,2N) must be primes in a given set.
Maynard achieves such a result by finding formulas for S_1,S_2 as integral operators. The difference between our situation and Maynard's is that we exclude moduli that divide Δ_L in our Bombieri–Vinogradov estimate. Thorner precisely addresses this problem in case of Chebotarev classes.  We first define these integral operators and estimate S_1 and S_2.



<cit.>
Let F be a smooth function supported on _k = {(x_1, …, x_k)∈ [0,1]^k : ∑_i=1^kx_i≤ 1}.  Then define

    I_k(F)    ∫_0^1⋯∫_0^1 F(t_1, …, t_k)^2dt_1⋯ dt_k, 
     
        J_k^(m)(F)    ∫_0^1⋯∫_0^1(∫_0^1 F(t_1, …, t_k)dt_i)^2dt_1⋯ dt_i-1dt_i+1⋯ dt_k.


The S_1 sum only has dependence on the excluded moduli, so our sum is the same as Thorner's:

If  has level of distribution θ > 0 then 

    S_1 = (1 + o(1))φ(W)^kN(log R)^k/W^k+1I_k(F),

where I_k^(m)(F) is defined as in Definition <ref>.

S_2 relies on the indicator function of _C,α,β, but the estimates only involve the prime number theorem and Bombieri–Vinogradov. Thus, the only term that differs from Thorner's S_2 is the density δ, which is now α^-1|C|/|G|.


If the primes in _C,α, β have level of distribution θ > 0, then if δ=|C|/α|G|, we have 

    S_2(N, _C,α, β) = (1+o(1))δφ(rad(Δ_L))log(R)log(N)φ(W)^kNlog(R)^kW^k+1∑_i=1^k J_k^(i)(F),

where J_k^(m)(F) is defined as in Definition <ref>.


The argument is essentially identical to the proof of Proposition 5 in Thorner <cit.>, except we include the factor of α^-1 to adjust for the fact that our primes come from a Beatty sequence. 





 §.§ Pintz's argument



Let H = {h_1,…, h_k} be an admissible set. If there exists a set S(H) and constants c_1(k), c_2(k) > 0 with 

    P^-(∏_j = 1^k(n + h_j)) ≥ n^c_1(k) for all n ∈ S(H)

and 

    #{n≤ x : n ∈ S(H)}≥c_2(k)x/(log x)^k

for all x sufficiently large, then S(H) contains a t-term arithmetic progression for all t ∈_> 0.

To show that our collection of primes can satisfy these criteria, we need to adapt some lemmas from the work of Vatwani and Wong <cit.>.
For corrections of some of the arguments in <cit.>, see <cit.>.

Suppose we have an admissible set ℋ = {h_1,…, h_k} with 

    k ≫exp(2α |G|Δ_Lm/|C|θφ(Δ_L)).

Then there are infinitely many n such that at least m + 1 of the n + h_i lie in P_C,α,β and 

    P^-(∏_i = 1^k(n+h_i)) ≥ n^c_1(k).



The proof follows the same reasoning as <cit.>, with the only adjustment coming from the different density factor coming from the formula in <ref>.



Assume the notation and hypotheses of <ref>. For sufficiently small chosen c_1(k), let 

    S_P_C,α,β(ℋ) = {n ∈ :  at least  m + 1  of the n+h_i's are in P_C,α,β,    P^-(∏_i = 1^k(n + h_i)) ≥ n^c_1(k)}

Then #{n ≤ x: n ∈ S_𝒫_C,α,β(H) ≥ c_𝒫_C,α,β(k)x/(log x)^k} for some constant 
c_𝒫_C,α,β
 > 0.


The same proof as for <cit.> applies, using in this case the slightly altered S_2 and <ref>.

Using these two intermediate results alongside <ref> we can prove <ref>.

We wish to apply the result of Pintz to the set

    S_P_C,α,β(ℋ') = {n ∈ :  n + h_j' ∈P_C,α,β  ∀  1 ≤ j ≤ m+1,   P^-(∏_i = 1^k(n + h_i)) ≥ n^c_1(k)},

where ℋ' ⊆H is some (m+1)-element subset. For Pintz's two criteria, the first criterion that the n+h_i have large prime factors follows by definition. For the second criterion, first note  that there are only finitely many (m+1)-element subsets of ℋ. <ref> gives the desired result in the case that we do not specify which elements satisfy n + h_i ∈_C,α,β.  The conclusion of <ref> must hold for some particular (m+1)-element subset H' ⊆H for a smaller constant c__C,α,β, since we need to divide by the number of (m+1)-element subsets. Then applying Pintz's result, the corollary follows.






§ DENSE CLUSTERS

In <cit.>, Maynard proves that any set of primes which is well-distributed satisfies many desirable properties, such as having arbitrarily long subsets of consecutive elements in a given residue class.  To be precise, he stipulates the following. 
Given a set of integers , a set of primes , and a linear function L(n)=l_1n+l_2, we define

    (x)={n∈ : x≤ n < 2x},     (x; q, a) = {n∈(x), n≡ a  q}, 
       L() = {L(n): n∈},     φ_L(q)=φ(|l_1|q)/φ(|l_1|), 
       _L, (x) = L((x))∩,     _L, (x; q, a) = L((x; q, a))∩.




<cit.>
(, , , B, x, θ).  Let k = #.

    
  *  is well distributed in arithmetic progressions: we have
    
    ∑_q≤ x^θmax_a|#(x; q, a)-#(x)q| ≪#(x)(log x)^100k^2.

    
    
  * Primes in L()∩ are well distributed in most arithmetic progressions: for any L∈ we have 
    
    ∑_q≤ x^θ
     (q, B) = 1max_(L(a), q)=1|#_L, (x; q, a)-#_L, (x)φ_L(q)| ≪#_L, (x)(log x)^100k^2.

    
    
  *  is not too concentrated in any arithmetic progression: for any q<x^θ we have 
    
    #(x; q, a) ≪#(x)q.




We now choose our parameters to match the primes we are interested in.  Specifically, we set  to be a Beatty sequence ⌊α n+β⌋ with α of finite type,  to consist of the single form L(n) = n, and  to be the primes in a fixed Chebotarev class.  

Corollary 5.5 in <cit.> implies that (1) holds for some 0<θ < 1 and sufficiently large x.  Theorem <ref> implies the same for (2) after letting B be the discriminant of the relevant number field.  Corollary 5.5 in <cit.> also implies that (3) holds.  Thus our choices satisfy Hypothesis <ref>.

Maynard proves that, under Hypothesis <ref>, the following results hold. 


<cit.>

For any x, y≥ 1 there are ≫ xexp(-√(log x)) integers x_0∈ [x, 2x] such that

    π(x_0+y)-π(x_0)≫log y.






