Академический Документы
Профессиональный Документы
Культура Документы
ON AVERAGE
arXiv:1908.09439v1 [math.NT] 26 Aug 2019
1. Introduction
Dirichlet proved that any linear polynomial with coprime coefficients
take prime values infinitely often. The case of showing a polynomial
of degree two or more representing prime values infinitely often is still
open, although there are stunning partial results due to Kuhn [18]
and later by Iwaniec [16]. Kuhn’s result [18] can be extended to show
that any irreducible polynomial an2 + bn + c with a > 0 and c is a
product of at most three primes for infinitely many n. Iwaniec [16]
improved Kuhn’s result [18] for the particular polynomial n2 + 1 by
showing n2 + 1 is a product of at most two primes for infinitely many
n. For polynomials of two variables, Friedlander & Iwaniec [7] proved a
spectacular theorem stating that the polynomial x2 + y 4 attain prime
values infinitely often. Later Heath-Brown [12] and Heath-Brown &
Li [13] showed the polynomials x3 + 2y 3 and a2 + p4 (p prime) takes
prime values infinitely often respectively.
A conjecture of Bateman-Horn [4] says that if f is an irreducible
polynomial in Z[x] satisfying gcd{f (n) : n ∈ Z} = 1 then
X Y np − 1
Λ (f (n)) ∼ 1− x,
n≤x p
p − 1
Next, we divide the interval [0, 1] into two sets, the major arc M and
the minor arc m, which corresponds to the main and error term respec-
tively. The computation for the integral over the major arc M and the
corresponding error terms are done in sections 4–7. The computation
for the integral over the minor arc m are done in section 8.
2. Results
We write f ≪ g or f = O(g) to mean there exist a C > 0 such that
f ≤ Cg . When M ≤ m < 2M we write m ∼ M .
For any integer n ≥ 1, we can write n = ℓ2 m where µ2 (m) = 1. We
denote the square-full part of n to be κ(n) = ℓ2 , and so n is square-free
if and only if κ(n) = 1.
PRIMES REPRESENTED BY QUARTIC POLYNOMIALS ON AVERAGE 3
Theorem 2.1. For any fixed A, B, ε > 0, we have for x4 (log x)−A ≤
y ≤ x4 , that
2
X X yx2
Λ(n4 + k) − S(k)x ≪ ,
(log x)B
k≤y n≤x
κ(k)≤y 1/2−ε
for all k up to y such that κ(k) ≤ y 1/2−ε with at most O y(log x)−C
exceptions.
3. Preliminaries
We recall a special case of the large sieve over quartic characters
from [9, Theorem 1.2].
Lemma 3.1. Let (am )m∈N be a sequence of complex numbers. Then
2
X X⋆ X
2
µ (m)am χ(m)
q∼Q χ mod q m∼M
χ4 =χ0 ,χ2 6=χ0
X
≪ (QM)ε (Q5/4 + Q2/3 M) µ2 (m)|am |2 ,
m∼M
where the ⋆ on the sum over χ restricts the sum to primitive characters.
Next, we recall a bound for linear multiplicative character sum inde-
pendently proved by Pólya, and Vinogradov, see [17, Theorem 12.5].
Lemma 3.2 (Pólya-Vinogradov). For any non-principle character χ
modulo q , we have
X
χ(n) ≪ q 1/2 log q.
M <n≤M +N
4 KAM HUNG YAU
We state a large sieve inequality for number fields from [14, Theorem
1].
Lemma 3.3. Let K be a number field and r denote an ideal in K .
Suppose u(r) is a complex-valued function defined on the set of ideals
in K . We have
2
X N (f ) X∗ X X
u(r)χ(r) ≪ (z + Q2 ) |u(r)|2,
Φ(f) χ mod f
N (f)≤Q N (r)≤z N (r)≤z
where N (f) denotes the norm of the ideal f, Φ(f) is Euler’s totient
function generalized to the setting of number fields, the ∗ over the sum-
mation over χ indicates that χ is a primitive character of narrow ideal
class group modulo f and the implicit constant depends on K .
We recall the Duality principle in [11, Theorem 228].
Lemma 3.4 (Duality principle). For a finite square T = (tmn ) ma-
trix with entries in the complex numbers. The follow statements are
equivalent:
For any complex sequence (an ), we have
2
X X X
an mn ≤ D
t |an |2 .
m n n
Lemma 3.8. Let 2 < ∆ < N/2 and N < N ′ < 2N . For arbitrary
complex sequence (an )n∈N , we have
2 2
Z X Z N
X
−2
an e(βn) dβ ≪ ∆ a dt.
n
|β|<∆−1 N <n<N ′ N −∆/2 max{t,N }<n<min{t+∆/2,N ′ }
where
a 1 a 1
Ia,q = − , + , Q1 = (log x)c1 , Q2 = x1−ε ,
q qQ2 q qQ2
for some suitable fixed c1 > 0. We remark that when x is sufficiently
large, Q2 > Q1 so that the intervals Ia,q with q ≤ Q1 are disjoint.
We write α ∈ M as
a 1
α = + β with |β| ≤ .
q qQ2
Let
X X
S1 (α) = Λ(m)e(αm) and S2 (α) = e(−αn4 ).
m≤x4 +k n≤x
where
q
X
τ (χ) = χ(n)e(an/q)
n=1
is the well-known Gauss sum. Applying this identity, the main term
of (4.2) is transformed into
1 X X
τ (χ)χ(a) χ(m)Λ(m)e(βm).
ϕ(q) χ mod q m≤z
PRIMES REPRESENTED BY QUARTIC POLYNOMIALS ON AVERAGE 7
where
q n d3 q∗
q∗ = , n∗ = , d∗ = , q1∗ = .
d d (d3 , q ∗ ) (d3 , q ∗ )
Therefore by separating the the main term corresponding to χ = χ0 ,
we obtain
X 1 X X
∗
S2 (α) = χ(−ad )τ (χ) e(−βn4 )
ϕ(q1∗ ) χ mod q∗ n≤x
d|q 1
χ4 =χ0 (n,q)=d
X 1 X
∗
X
+ ∗
χ(−ad )τ (χ) χ4 (n∗ )e(−βn4 )
ϕ(q1 ) χ mod q∗ n≤x
d|q 1
χ4 6=χ0 (n,q)=d
We consider the main term T2 (α). Observe that for G = (Z/q1∗ Z)∗
and G4 = {g 4 : g ∈ G}, we have by orthogonality
X X X
χ(−ad∗ )τ (χ) = e(b/q1∗ ) χ(−(ad∗ )3 b)
χ mod q1∗ b mod q1∗ χ mod q1∗
χ4 =χ0 (b,q1∗ )=1 χ4 =χ0
#G X
= e(b/q1∗ ),
#G4
−(ad∗ )3 b≡♥ mod q1∗
(b,q1∗ )=1
q1 ∗
#G4 X
= e(−ad∗ ℓ4 /q1∗ ),
#G ℓ=1
(ℓ,q1∗ )=1
since
(ad∗ )3 ℓ4 ≡ ad∗ (ad∗ ℓ)4 mod q1∗ ,
where u is the multiplicative inverse of u modulo q1∗ . It follows
q1 ∗
X 1 X
∗ 4 ∗
X
T2 (α) = e(−ad ℓ /q1 ) e(−βn4 ).
ϕ(q1∗ ) ℓ=1 n≤x
d|q
(ℓ,q1∗ )=1 (n,q)=d
In total, we obtain
Z X X
Λ(m)e(αm) e(−α(n4 + k)) dα
M m≤z n≤x
Z
= {T1 (α) + E1 (α) + O(log2 x)}{T2 (α) + E2 (α)}e(−αk) dα.
M
where
X X
Θd,q (β) = e(−βk) e −βn4 e (−βm) .
n≤x m≤z
(n,q)=d
= (p − 1)nk,p − (p − nk,p )
= p(nk,p − 1),
10 KAM HUNG YAU
m4 + k ≡ 0 mod p, m ∈ Z/pZ.
Now let χ1,p , χ2,p , χ3,p be three quartic characters of modulus p prime
such that p ≡ 1 mod 4 and χ21,p , χ22,p , χ23,p 6= χ0 . Then
(
p{χ1,p (−k) + χ2,p (−k) + χ3,p (−k)} if p ≡ 1 mod 4,
Σ(p) =
0 if p = 2 or p ≡ 3 mod 4.
where
a1 q2 + a2 q1 a1 q2 (q2 r1 )4 + a2 q1 (q1 r2 )4
Υk (a1 , r1 , q1 , a2 , r2 , q2 ) = −k −
q1 q2 q1 q2
a1 q2 + a2 q1 (a1 q2 + a2 q1 )(q1 r2 + q2 r1 )4
≡ −k − mod 1.
q1 q2 q1 q2
Consequently
Σ(q1 q2 ) = Σ(q1 )Σ(q2 ).
Therefore for some fixed constant c2 > 0, we get
Z X µ(q)
Σ(q) + O (xQ2 )1/2 (log x)c2
T1 (α)T2 (α)e(−kα) dα = x
M q≤Q
ϕ(q)q
1
∞
Xµ(q) Y
(nk,p − 1) − xΨ(k) + O (xQ2 )1/2 (log x)c2
=x
q=1
ϕ(q)
p|q
where
X µ(q) Y
Ψ(k) = (nk,p − 1).
q>Q
ϕ(q)
1 p|q
where
2
X X µ(q) Y
Ψ1 = {χ1,p (−k) + χ2,p (−k) + χ3,p (−k)} ,
ϕ(q)
k≤y Q1 <q≤U p|q
2
X X µ(q) Y
Ψ2 = {χ1,p (−k) + χ2,p (−k) + χ3,p (−k)} ,
k≤y
U <q≤2v U ϕ(q)
p|q
′
κ(k)≤y 1/2−ε
2
X X µ(q) Y
Ψ3 = {χ1,p (−k) + χ2,p (−k) + χ3,p (−k)} ,
v
k≤y 2 U <q
ϕ(q)
p|q
where
Pq1 ,q2 (k)
Y Y
= {χ1,p (−k) + χ2,p (−k) + χ3,p (−k)} {χ1,p (−k) + χ2,p (−k) + χ3,p (−k)}.
p|q1 p|q2
≪ U 1+ε .
Therefore
y 1+ε
(6.2) 1−ε + U Ψ1 ≪
.
Q1
Partitioning the summation inside and applying the Cauchy’s in-
equality, we have
2
⌊v+1⌋
X X X µ(q) Y
Ψ2 ≪ v {χ 1,p (−k) + χ2,p (−k) + χ3,p (−k)} .
r=1 k≤y
r−1 r
ϕ(q)
2 U <q≤2 U p|q
′
κ(k)≤y 1/2−ε
′
X 1
≪ y 1/4−ε /2 (2r Uy)ε ((2r U)5/4 + (2r U)2/3 y)
ϕ(q)2
2r−1 U <q≤2r U
1/4−ε′ /2 r ε r 1/4 r −1/3
≪y (2 Uy) ((2 U) + (2 U) y).
Summing over r = 1, . . . , R = ⌊log2 (y 3+ε /U)⌋ (logarithm base 2),
we obtain
2
R
y 1+ε
X X X X µ(q) 1/4−ε′ 3/4+6ε
χ(k) ≪ y
y + 1/3−ε .
r=1 k≤y
r−1 r χ mod q
ϕ(q) U
2 U <q≤2 U
′ 4 2
χ =χ0 ,χ 6=χ0
1/2−ε
κ(k)≤y
n
where aπ = µ(q)/ϕ(q), χπ (n) = π 4
. Note that by the quartic reci-
procity, we assert
N (n)−1 N (π)−1
χπ (n) = χn (π)(−1) 4 4 ,
therefore in view of [9, Lemma 3.2], applying Lemma 3.3 to (6.3) and
recalling (6.1), we majorise by
X 1
≪ (y 4 + 2r U)
ϕ(q)2
N (π)=q
2r−1 U <q≤2r U
Hence
2
r r
X X X µ(q) ≪ (y 4 +2r U) log log(2 U) log(2 U) .
χ(k)
2r−1 U <q≤2r U χ mod q ϕ(q)
2r U
k≤y
1/2−ε′ χ4 =χ0 ,χ2 6=χ0
κ(k)≤y
Now
X X Z
E1 ≪ |T1 (a/q + β)E2 (a/q + β)|2 dβ
q<Q1 a mod q |β|<δ
(a,q)=1
Z !
+ |T1 (a/q + β)E2 (a/q + β)|2 dβ .
1
δ<|β|< qQ
2
First consider
X X Z
Ωq (β) dβ,
1
q<Q1 a mod q |β|< qQ
2
(a,q)=1
where
2
X 1 X
∗
X
4 ∗ 4
Ωq (β) =
∗
χ(−ad )τ (χ) χ (n )e(−βn ) .
d|q ϕ(q1 ) χ mod q1∗ n≤x
χ4 6=χ 0
(n,q)=d
PRIMES REPRESENTED BY QUARTIC POLYNOMIALS ON AVERAGE 17
Partition the summation over n into dyadic intervals and let N < n ≤
N ′ ≤ 2N ≤ x. Applying the Cauchy’s inequality, it is enough to bound
2
XX X Z X
c5 4 ∗ 4
(log x) χ (n )e(−βn ) dβ,
1
q≤Q1 d|q χ mod q1∗ |β|≤ qQ n∼N ′
2 (n,q)=d
χ4 6=χ0
X x
x
x
≪ +1 +1 +1
′
q1 q2 q ′ /(q1 q2 )
q1 q2 |q
x3
≪ τ (q ′ )2 + τ (q ′ )2 x
q′
≪ x3 (log x)−c9 ,
for some fixed constant c9 > 0, and also
X 2 X q
≪ ≪ x3+ε .
−x<ℓ ,ℓ ,ℓ <x
k24ℓ1 ℓ2 ℓ3 a/qk 1≤ℓ ,ℓ ,ℓ <x
ℓ ℓ ℓ
1 2 3
1 2 3 1 2 3
q∤24ℓ1 ℓ2 ℓ3
Therefore
x2
sup |S2 (α)|2 ≪ ,
α∈m (log x)c9
20 KAM HUNG YAU
yx2
≪
(log x)c4
since x4 (log x)−A ≤ y ≤ x4 and by taking c4 to be sufficiently large.
Acknowledgement
The author thanks L. Zhao for the problem and many helpful conver-
sations and comments, and also I. E. Shparlinski for helpful comments.
This work is supported by an Australian Government Research Train-
ing Program (RTP) Scholarship.
References
[1] S. Baier, L. Zhao, Primes in quadratic progressions on average. Math. Ann.
338 (4) (2007), 963–982. 2
[2] S. Baier, L. Zhao, On primes represented by quadratic polynomials. Anatomy
of integers, 159–166, CRM Proc. Lecture Notes 46, Amer. Math. Soc., 2008. 2
[3] S. Baier, L. Zhao, On primes in quadratric progressions. Int. J. Number Theory
5 (6) (2009), 1017-1035. 2
[4] P. T. Bateman, R. A. Horn, A heuristic asymptotic formula concerning the
distribution of prime numbers. Math. Comp. 16, 1962, 363–367. 1
[5] H. Davenport, Multiplicative number theory. Third edition. Graduate Texts in
Mathematics, 74. Springer-Verlag, New York, 2000. 4
[6] T. Foo, L. Zhao, On primes represented by cubic polynomials. Math. Z. 274
(1-2) (2013), 323–340. 2, 9, 15, 18
[7] J. B. Friedlander, H. Iwaniec, The polynomial X 2 + Y 4 captures its primes.
Ann. of Math. (2) 148 (3) (1998), 945–1040. 1
[8] P. X. Gallagher, A large sieve density estimate near σ = 1. Invent. Math. 11,
1970, 329–339. 5
[9] P. Gao, L. Zhao, Large sieve inequalities for quartic characters. Q. J. Math.
63 (4) (2012), 891–917. 3, 13
PRIMES REPRESENTED BY QUARTIC POLYNOMIALS ON AVERAGE 21