Abstract
The system of equations
has prime solutions \((p_1, \ldots , p_s)\) for \(s \ge 12\), assuming that the system has solutions modulo each prime p. This is proved via the Hardy–Littlewood circle method, building on Wooley’s work on the corresponding system over the integers and recent results on Vinogradov’s mean value theorem. Additionally, a set of sufficient conditions for local solvability is given: If both equations are solvable modulo 2, the quadratic equation is solvable modulo 3, and for each prime p at least 7 of each of the \(u_i\), \(v_i\) are not zero modulo p, then the system has solutions modulo each prime p.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Much work has been done in applying the Hardy–Littlewood circle method to find integral solutions to systems of simultaneous equations (see [2, 3, 10], and [12] for examples). In particular, recent progress on Vinogradov’s mean value theorem (see [1, 9]) has enabled progress on questions of this type. Here we consider the question of solving systems of equations with prime variables, generalizing the Waring–Goldbach problem in the same way existing work on integral solutions of systems of equations generalizes Waring’s problem. Following Wooley [12], we address here the simplest nontrivial case: one quadratic equation and one cubic equation. We find that under suitable local conditions, 12 variables will suffice for us to establish an eventually positive asymptotic formula guaranteeing solutions to the system of equations.
Consider a pair of equations of the form
where \(u_1, \ldots , u_s, v_1, \ldots , v_s\) are nonzero integer constants and \(p_1, \ldots , p_s\) are variables restricted to prime values. We seek to prove the following theorem:
Theorem 1.1
If
-
1.
the system (1) has a nontrivial real solution,
-
2.
\(s \ge 12\), and
-
3.
for every prime p, the corresponding local system
$$\begin{aligned} \begin{aligned}&u_1x_1^2 + \cdots + u_sx_s^2 \equiv 0 \pmod p,\\&v_1x_1^3 + \cdots + v_sx_s^3 \equiv 0 \pmod p \end{aligned} \end{aligned}$$(2)has a solution \((x_1, \ldots , x_s)\) with all \(x_i \ne 0 \pmod p\),
then the system has a solution \((p_1, \ldots , p_s)\) with all \(p_i\) prime. Moreover, if we let R(P) be the number of solutions \((p_1, \ldots , p_s)\) with each \(p_i \le P\), each weighted by \((\log p_1)\ldots (\log p_s)\), then we have \(R(P) \sim CP^{s-5}\) for some constant \(C > 0\) uniformly over all choices of \(u_1, \ldots , u_s, v_1, \ldots , v_s\).
In Sect. 9 we give a sufficient condition for (2) to be satisfied, giving us the explicit theorem
Theorem 1.2
Consider the system
where \(u_1, \ldots , u_s, v_1, \ldots , v_s\), are nonzero integer constants and U, V are integer constants. If
-
1.
the system has a nontrivial real solution,
-
2.
\(s \ge 12\),
-
3.
the quadratic form \(u_1p_1^2 + \cdots + u_sp_s^2\) is indefinite,
-
4.
\(\displaystyle \sum \nolimits _{i=1}^{s} u_i \equiv U \pmod 2\) and \(\displaystyle \sum \nolimits _{i=1}^s v_i \equiv V \pmod 2,\)
-
5.
\(\displaystyle \sum \nolimits _{i=1}^s u_i \equiv U \pmod 3\), and
-
6.
for each prime \(p \ne 2\), at least 7 of each of the \(u_i\) and the \(v_i\) are not zero modulo p,
then the system has a solution \((p_1, \ldots , p_s)\) with all \(p_i\) prime. Moreover, if we let R(P) be the nu mber of solutions \((p_1, \ldots , p_s)\), each weighted by \((\log p_1)\ldots (\log p_s)\), then we have \(R(P) \sim CP^{s-5}\) where \(C > 0\) uniformly over all choices of \(u_1, \ldots , u_s, v_1, \ldots , v_s\), U, and V.
We use the Hardy–Littlewood circle method to prove these results. Section 2 performs the necessary setup for the application of the circle method: defining the relevant functions and the major arc/minor arc dissection. Section 3 consists of a number of preliminary lemmas, which are referenced throughout. Section 4 proves a Hua-type bound necessary for the minor arcs. Section 5 proves a Weyl-type bound on the minor arcs by means of Vaughan’s identity. Section 6 is the circle method reduction to the singular series and singular integral. Section 7 shows the convergence of the singular series and Sect. 8 shows that it is eventually positive, contingent on the local solvability of the system (3). Section 9 shows sufficient conditions for the solvability of the local system. This depends on a computer check of local solvability for a finite number of primes. Section 10 discusses several techniques which can be employed to improve the efficiency of this computation. Section 11 finishes the proof of Theorems 1.1 and 1.2. Appendix 1 contains the source code used to run the computations laid out in Sect. 10.
2 Notation and definitions
As is standard in the literature, we use \(e(\alpha )\) to denote \(e^{2\pi i \alpha }\). The letter p is assumed to refer to a prime wherever it is used, and \(\varepsilon \) means a sufficiently small positive real number. The symbols \(\Lambda \) and \(\mu \) are the von Mangoldt and Möbius functions, respectively. Symbols in bold are tuples, with the corresponding symbol with a subscript denoting a component, i.e., \(\mathbf {a} = (a_1, \ldots , a_k)\). The letter C is used to refer to a positive constant, with the value of C being allowed to change from line to line. We write \(f(x) \ll g(x)\) for \(f(x) = O(g(x))\), \(f(x) \asymp g(x)\) if both \(f(x) \ll g(x)\) and \(g(x) \ll f(x)\) hold, and \(f(x) \sim g(x)\) if \(f(x)/g(x) \rightarrow 1\) as \(x \rightarrow \infty \). When we refer to a solution of the system under study, we mean an ordered s-tuple of prime numbers \((p_1, \ldots , p_s)\) satisfying (1) or (3), depending on context.
Define the generating function
Let \(\mathcal {A}\) be the unit square \((\mathbb {R}/\mathbb {Z})^2\) and let \(S_0\) be the set of solutions of the system (1). Then
by orthogonality. Thus \(R(P)>0\) if and only if there is a solution to the system (1).
We divide \(\mathcal {A}\) into major and minor arcs. For any T with \(1 \le T \le P\). and for all \(q < T\), \(1 \le a_2 \le q\), \(1 \le a_3 \le q\), \((a_2, a_3, q) = 1\), let a typical major arc \(\mathfrak {M}(a_2,a_3,q;T)\) consist of all \((\alpha _2, \alpha _3)\) such that
Let the major arcs \(\mathfrak {M}(T)\) be the union of all such \(\mathfrak {M}(a_2,a_3,q)\), and let the minor arcs \(\mathfrak {m}(T)\) be the complement of \(\mathfrak {M}(T)\) in \(\mathcal {A}\).
We will use two distinct dissections in our argument: the primary dissection into \(\mathfrak {M} = \mathfrak {M}(Q)\) and \(\mathfrak {m} = \mathfrak {m}(Q)\) with \(Q = (\log P)^A\), where A is a positive constant whose value will be fixed later, and a secondary dissection \(\mathfrak {M}(R)\), \(\mathfrak {m}(R)\) with \(R = P^{\frac{1}{2}+\delta }\) for some sufficiently small positive \(\delta \).
3 Preliminary lemmas
We begin by defining the necessary generating functions. Let
and for \(\pmb \gamma \in \mathfrak {M}(R)\) let
Lemma 3.1
We have the bounds
and
Proof
This is the relevant portion of Theorem 1.3 of [12]. \(\square \)
Lemma 3.2
We have the bounds
and
Proof
For any positive integer k,
is the number of positive integer solutions to the system
and
is the number of prime solutions to the same system, so this lemma follows from Lemma 3.1. \(\square \)
Lemma 3.3
Proof
This follows from Lemma 5.2 of [12]. \(\square \)
Lemma 3.4
Proof
If \(|\theta _3| \le P^{-3}\), the result is immediate. Thus we assume \(|\theta _3| > P^{-3}\). Let \(K = (|\theta _3| P)^{\frac{1}{2}}\) and let \(r(x) = \theta _2x^2+\theta _3x^3\). Then \(r'(x) = 2\theta _2x + 3\theta _3x^2\) has at most one zero in [P, 2P]. Thus we can divide [P, 2P] into subsets \(I_1\) and \(I_2\) such that \(|r'(x)| \ge K\) on \(I_1\), where \(I_1\) is the union of at most three intervals such that \(r'(x)\) is monotonic on each, and \(|r'(x)| \le K\) on \(I_2\), where \(I_2\) is the union of at most two intervals.
First we consider \(I_1\):
so, upon integrating by parts,
The integral on the right is bounded by
since \(r'(x)\) is monotonic on each interval in \(I_1\). Thus
Next we consider \(I_2\). Given an interval in \(I_2\), let \(x_0\) be one of its endpoints. Then for any x in \(I_2\),
Moreover,
Applying the triangle identity to (9) yields
Also,
Combining (9), (10), and (11) yields
Thus
Combining (8) and (12) now gives the desired result.
\(\square \)
Lemma 3.5
Let \(t = 12-\delta \). Then
Proof
By Hölder’s inequality
Applying Lemma 3.2 gives
\(\square \)
Lemma 3.6
Let \(R = P^{\frac{1}{2}+\delta }\) and let \(\pmb \gamma \in \mathfrak {M}(R)\). Then
This follows from Theorem 7.2 of [7].
Lemma 3.7
Let \(\kappa (q)\) be the multiplicative function defined by
Then there is a positive constant C such that
Proof
The case \(j=1\) follows from Theorem 2E of [6]. The cases with \(j > 1\) follow from Theorem 7.1 of [7]. \(\square \)
Let
Lemma 3.8
Let \(Q>0\) and let M(Q) be the number of solutions of the system
with all \(m_j \le Q\). Then there is a positive constant C such that
This is a result of Rogovskaya [5].
Lemma 3.9
If \((q, a_2, a_3)=1\), then
In addition, if \((p,a_2,a_3)=1\), then
Proof
The case where \(q = p\) follows from Theorem 2E of [6]. The case for general q follows from Lemma 8.5 of [4]. \(\square \)
4 Minor arc bounds
The primary purpose of this section is to prove the following theorem, which, together with the result of the next section, will provide the necessary minor arc bounds for our circle method approach.
Recall from the end of Sect. 2 that \(\delta \) is a small positive number with \(R = P^{\frac{1}{2}+\delta }\). Assume \(\delta < 1\) and let \(t = 12-\delta \).
Theorem 4.1
For \(\delta \) sufficiently small,
Let
Lemma 4.1
Proof
Applying the Cauchy–Schwarz inequality to (14) yields
By Lemmas 3.3 and 3.5 and recalling that \(t = 12-\delta \), we can bound the minor arc portion of (15):
We now apply Lemma 3.6 to the major arc portion of (15).
Combining (15), (16), and (17) yields the lemma. \(\square \)
Let \(\pmb \gamma = \pmb \alpha - \pmb \beta \),
(note that \(\lambda > 2\)), and
Lemma 4.2
Proof
We begin by noting that
can be rewritten as
Let
be the integral on the right in Lemma 4.1. Using (20) to apply Hölder’s inequality to \(I_t^*(P)\), we obtain
Applying (22) to Lemma 4.1, we have
Thus either \(I_t(P) \ll P^{t-5}\) or
which implies the desired result. \(\square \)
Lemma 4.3
Let N(q) be the number of solutions of the system
Then
Proof
By (19) and the definition of \(\mathfrak {M}(R)\),
By Lemmas 3.4, 3.7, and the fact that for a given q, the intervals \(\left[ \frac{a_2}{q} - \frac{R}{qP^2}, \frac{a_2}{q} + \frac{R}{qP^2}\right] \) are disjoint for distinct \(a_2\),
We now examine the inner sum and integral.
Now
and
so
Substituting (24) into (23) yields
Since \(\lambda > 2\), this becomes
\(\square \)
Lemma 4.4
Let \(N_1(q)\) be the number of solutions to the system
Then
Proof
First, note that
Let
and
Thus
Since \(|f_|(\pmb \alpha )| \ll \log q\),
Now
so
\(\square \)
Lemma 4.5
Let \(N_2(q)\) be the number of solutions of the system
Then
Proof
We classify the solutions \(\mathbf {p}\) counted by \(N_1(q)\) according to the residue class \(r_j\) of each \(p_j\) modulo q, and let \(m_j = \frac{p_j-r_j}{q}\). Thus
so \(N_1(q) \le N_2(q)\). \(\square \)
Lemma 4.6
Let \(N_3(q)\) be the number of solutions of the system
Then
Proof
Let \(\mathbf {r}\), \(\mathbf {m}\) be a solution counted in \(N_2(q)\), i.e., let \(\mathbf {r}\), \(\mathbf {m}\) satisfy (25). Expanding the third equation of (25) gives
Since \(s_2(\mathbf {r}) \equiv 0 \pmod q\) by the second equation of (25), this can be rewritten as
with each term remaining integer-valued. For a fixed \(\mathbf {r}\), define
Thus the number of \(\mathbf {m}\) satisfying (25) for a given \(\mathbf {r}\) is
By Hölder’s inequality this is
The integral
counts the number of solutions of
Let \(s_2(\mathbf {m}) = u\) and \(s_1(\mathbf {m}) = v\). Then (27) becomes \(qu + 2r_j v = 0\). For any solution, we have \(|v| \le \frac{6P}{q}\), and since \((q,r_j)=1\), \(v = \frac{v'q}{(q,2)}\). Thus the number of choices for \(v'\) is \(\le 1 + 24P/q^2\), and u is determined by \(v'\).
Let
For fixed pair u, v, the number of choices of \(\mathbf {m}\) is
But this is the number of solutions of the system
so by Lemma 3.8,
So, given \(\mathbf {r}\) satisfying the first two equations of (25) and \((q,r_j)=1\), the number of solutions to the third equation of (25) is
Thus
\(\square \)
Lemma 4.7
Let \(N_3(q)\) be as defined in Lemma 4.6 above. Then there exists a positive constant C such that
Proof
We begin by observing that \(N_3(q)\) is a multiplicative function, and that by orthogonality,
Sorting the terms of this sum by the value of \((p^k, b_2, b_3) = p^{k-j}\), where \(0 \le j \le k\), gives
If \(j=0\), then
and if \(j > 0\), then
Thus
By Lemma 3.9,
and for \(j \ge 2\),
Thus
and the lemma follows by multiplicativity. \(\square \)
Proof of Theorem 4.1
By Lemma 4.2,
Bounding \(J(\pmb \beta )\) with Lemma 4.3 yields
Lemmas 4.4, 4.5, and 4.6 successively bound N(q) in terms of \(N_1(q)\), then \(N_2(q)\), then \(N_3(q)\), and Lemma 4.7 bounds \(N_3(q)\). Collecting these bounds and applying them to (28) gives
Since \(q \le R = P^{\frac{1}{2}+\delta }\),
and
so we have
We now desire a bound on
Since \(\kappa \) is multiplicative, it suffices to bound
We have
Thus
which implies that
which, upon applying the definition of \(\lambda \) in (18), is
\(\square \)
5 A pointwise minor arc bound sensitive to multiple coefficients
In this section, we will work with a narrower set of minor arcs \(\mathfrak {m}(Q)\), where \(Q = (\log P)^A\). Henceforth \(\mathfrak {m}\) will be assumed to mean \(\mathfrak {m}(Q)\) rather than \(\mathfrak {m}(R)\) unless otherwise specified. Let \(\pmb \alpha = (\alpha _1, \ldots , \alpha _k)\) and let
This section consists of the proof of the following theorem and corollary:
Theorem 5.1
For \(D > 0\), where \(D = D(A)\) can be made arbitrarily large by increasing A, if \((\alpha _2, \alpha _3) \in \mathfrak {m}(Q)\), then
Corollary 5.1
For each i, \(1\le i \le s\),
Proof
Take \((0 ,u_i\alpha _2, v_i\alpha _3)\) as the argument of \(F_3\) in Theorem 5.1 and sum over the dyadic intervals, noting that multiplying \(\alpha _2\) and \(\alpha _3\) by the integer coefficients \(u_i\) and \(v_i\) does not move them out of \(\mathfrak {m}(Q)\), and that there are trivially \(\ll P^{1/2}\log P\) prime powers \(\le P\) which contribute \(\ll P^{1/2}(\log P)^2\) to the sum. \(\square \)
We begin by citing some known results on Vinogradov’s mean value theorem. Let
We cite the bound
from [5] (cf. [7] chap. 7 exercise 2) and for \(s > 6\)
from equation (7) of [1].
Let \(X = (\log P)^B\) for some \(B > 0\) to be fixed later. For brevity, we let \(h(n) := e(\alpha _1n + \alpha _2n^2 + \alpha _3n^3)\). Then
Applying Vaughan’s identity [8] to this sum yields
where
with
This now enables us to bound each of the sums \(S_1\), \(S_2\), \(S_3\), \(S_4\) individually to obtain the desired bound on \(F_3(\pmb \alpha )\). The bounds on these four sums constitute Lemmas 5.1–5.4.
Lemma 5.1
Proof
Since \(|h(n)| \ll 1\),
where the last bound is a classical result of Chebyshev. \(\square \)
Lemma 5.2
Proof
Let
and note for future reference that
Interchanging the order of summation in (35) yields
We now use Dirichlet’s theorem on Diophantine approximation to obtain integers \(b_j\), \(q_j\) for \(j \in \{2,3\}\) such that \((b_j, q_j)=1\),
Assume for contradiction that \(q_j \le (\log (P/k))^{A/2}\) for both \(j=2\) and \(j=3\) and rewrite (37) as
Let \(b_j' = b_j/(k^j,b_j)\), \(q_j' = k^j q_j/(k^j,b_j)\). Then
\((b_j',q_j')=1\), and \(q_j' \le (\log (P/k))^{A/2}\) for \(j \in \{2,3\}\). Let \(q = \text {lcm}(q_2',q_3')\) and \(a_j = b_j'q/q_j\). Then \((a_2,a_3,q)=1\), \(q \le (\log (P/k))^A\), and
This implies that \((\alpha _2, \alpha _3) \in \mathfrak {M}(Q)\). However, we have \((\alpha _2, \alpha _3) \in \mathfrak {m}(Q)\), which is the desired contradiction, so we may assume that \(q_j > (\log (P/k))^{A/2}\) for at least one \(j_0 \in \{2,3\}\).
Define \(\alpha _j' = \alpha _j k^j\) and note that (37) becomes
We now need a bound on
By Theorem 5.2 of [7], using the Diophantine approximation of (38), we have
Now by (31), we have \(J_{3,2}(P) \ll P^3(\log P)\), so
Now \(\frac{k}{P} \ll P^{-1/2}\), and \(\frac{q_j'k^j}{P^j} \ll (\log P)^{2jB-A}\), \(1/q_{j_0}' \ll (\log P)^{2Bj_0 - A/2}\), so
assuming \(2Bj_0 - A/2 < 0\).
Applying the bound of (40) to (39) yields
since \(j_0 \le 3\).
Substituting the bound of (41) into (36), we obtain
\(\square \)
Lemma 5.3
Proof
Now by (41),
Substituting this into (42) yields
\(\square \)
Lemma 5.4
Proof
We begin by splitting \(S_4\) into dyadic ranges. Let \(\mathcal {M} = \{X2^m : 0 \le k, 2^m \le P/X^2\}\). Then
where
Our goal is now to replace the sum over the range \(l \le P/k\) with one over the range \(l \le P/M\). We begin by considering the integral
where \(R>0\) is a constant. Computing the integral via the residue theorem gives
Now for \(x \ne R\), \(t \ge 1\),
Integrating the right-hand side of (44) by parts gives
Thus we can rewrite I(x) as an integral over \([-T,T]\) with an acceptable error term:
We now take \(R = \log (\lfloor P\rfloor + \frac{1}{2})\), \(x = \log (kl)\), giving us
Now
and
so
Take \(T = P^3\), \(a(k,t) = a(k)k^{-2\pi it}\), \(b(l,t) = b(l)l^{-2\pi it}\), and let
Then
We now consider \(S_4(M,t)\). Let \(b>6\). By Hölder’s inequality
Now \(|a(k,t)| = |a(k)| \le \log k \ll \log M \ll \log P\), so
Expanding the 2b-th power in (47) yields
where
Collecting terms in (48) by values of \(s_j\) yields
where
by (32). Substituting (49) into (47) yields
We now repeat the procedure followed from (46) to (50). By Hölder’s inequality
We expand the 2b-th power in (52) and collect like terms. Thus
where
by (32). Substituting (53) into (52), we obtain
Summing over each of the \(v_j\) gives
Applying Lemma 2.2 of [7] yields
Combining (54) with (43) and (45), we obtain
Recalling that \(q_j > (\log P)^A\) for some j and \(X = (\log P)^B\), this is
for \(b > 6\). \(\square \)
Proof of Theorem 5.1
Using the Vaughan’s identity breakdown of (33) and the estimates for the \(S_i\) found in Lemmas 5.1, 5.2, 5.3, and 5.4, we have
So, taking \(B > 4b^2D(D+4)\) and \(A > 12(B + D + 4)\) for some \(D > 0\) yields
uniformly in \(\pmb \alpha \). \(\square \)
6 Major arc approximations
On a typical major arc \(\mathfrak {M}(a_2,a_3,q)\), let \(\alpha _2 = \frac{a_2}{q}+\theta \), \(\alpha _3 = \frac{a_3}{q}+\omega \), with \(\theta < \frac{Q}{qP^2}\), \(\omega < \frac{Q}{qP^3}\), and \(q < Q\). For ease of notation, let \(\frac{Q}{qP^2} = \Theta \), \(\frac{Q}{qP^3} = \Omega \). Let
and for \(x > \sqrt{P}\),
We begin with preliminary bounds on \(T_i(x,a_2,a_3)\) and \(T_i^\dagger (q,a_2,a_3)\).
Lemma 6.1
Proof
The exponential function \(e((a_2u_ip^2 + a_3v_ip^3)/q)\) is only sensitive to the residue class of p modulo q, so
Now by the Siegel–Walfisz theorem we have that
so
\(\square \)
Corollary 6.1
For \(x > \sqrt{P}\),
Proof
\(\square \)
Lemma 6.2
On \(\mathfrak {M}(q,a_2,a_3)\),
for some positive constant C.
Proof
First, we isolate the range \((\sqrt{P}, P]\), bounding the remainder immediately.
Now
where \(\mathbb {1}_\mathcal {P}\) is the indicator function of the primes.
We now apply Abel summation to (58), with the term in square brackets serving as the coefficient. This yields that
Now Corollary 6.1 gives that for \(x > \sqrt{P}\),
so
\(\square \)
For clarity of notation, let
We are now able to state the primary lemma of this section:
Lemma 6.3
For some \(E > 0\),
Proof
We first introduce variant major arcs whose length is independent of q:
for \(1 \le Q \le P\), \(q < Q\), \(1 \le a_2 \le q\), \(1 \le a_3 \le q\), and \((a_2, a_3, q) = 1\). Let \(\mathfrak {B}\) be the union of all such \(\mathfrak {B}(q, \mathbf {r}, Q)\) and note that \(\mathfrak {M} \subseteq \mathfrak {B}\) and thus \(\mathfrak {B} \setminus \mathfrak {M} \subseteq \mathfrak {m}\).
It follows immediately from Lemma 6.2 that
Summing (60) over all arcs in \(\mathfrak {B}\) gives
We now wish to compute
Combining (61) and (62) yields the bound
Combining Theorem 4.1 and Corollary 5.1 yields the minor arc bound
and moreover, since \(\mathcal {A}\setminus \mathfrak {B} \subseteq \mathfrak {m}\), by Corollary 5.1 and Theorem 4.1 we have
Now by (5), (63), and (65) we have
\(\square \)
7 Convergence of the singular series
Lemma 7.1
Let \((q_1,q_2)=1\). Then
Proof
Each residue class r modulo \(q_1q_2\) with \((r, q_1q_2) = 1\) is uniquely represented as \(cq_1+dq_2\) with \(1 \le c \le q_2\), \((c, q_2) = 1\), \(1 \le d \le q_1\), and \((d, q_1) = 1\). Also, \(cq_1\), \(dq_2\) run over all residue classes modulo \(q_2\), \(q_1\) with \((cq_1, q_2) = 1\), \((dq_2, q_1) = 1\), respectively. Thus
\(\square \)
Lemma 7.2
A(q) is multiplicative.
Proof
Let \((q_1,q_2)=1\). Then
Now \(a_2\) and \(a_3\) can be represented by \(b_1q_2+b_2q_1\) and \(c_1q_2+c_2q_1\), respectively, with \(1 \le b_1,c_1 \le q_1\), \(1 \le b_2,c_2 \le q_2\). So we can rewrite our sum as
Now since \((q_1,q_2)=1\), \((c_2,b_2,q_1)=1\), and \((b_1,c_1,q_2)=1\), we have that \(b_2q_1^2,c_2q_1^3,b_1q_2^2,c_1q_2^3\) run through complete sets of residue classes modulo \(q_2,q_2,q_1,q_1\), respectively. Thus
\(\square \)
Let \(\mathfrak {S}\) be the completed singular series
Since A(q) is multiplicative,
Lemma 7.3
\(\mathfrak {S}\) converges absolutely.
Proof
By Lemma 3.9 and the fact that there are \(\ll p^{2k}\) choices for the pair a, b, we have
Since \(s \ge 7\), we have
Thus
Then
converges, so
converges. \(\square \)
8 Positivity of the singular series
To show that R(P) is eventually positive, we now need to show that \(\mathfrak {S}\) is positive.
Lemma 8.1
There exists \(R > 0\) such that
Proof
By (68), we have \(A(p^k) \ll (p^k)^{-3/2+\varepsilon } \ll (p^k)^{-1/4}\). Choose C, R such that \(A(p^k) \le Cp^{-5/4}< Cp^{-1/4} < \frac{1}{8}\) for all \(p \ge R-1\). Then
\(\square \)
We now need only show that for \(p \le R\), \(1 + \sum _{k=1}^\infty A(p^k) > 0\). For \(1 \le t \le s\), define \(M_t(q)\) to be the number of solutions \((x_1, \ldots , x_s)\) to the simultaneous congruences
with \((x_i,q)=1\) for all i.
Lemma 8.2
For any positive integer q,
Proof
Let \(d = \frac{q}{(r_2,r_3,q)}\), \(a_1 = \frac{r_2}{(r_2,r_3,q)}\), and \(a_2 = \frac{r_3}{(r_2,r_3,q)}\). Then, rearranging according to the value of d, we have
\(\square \)
Lemma 8.3
For positive integers \(t, \gamma \) with \(t > \gamma \),
Proof
This is [11], Lemma 6.7, with the added observation that (in that paper’s notation)
So if \(a_1,b_1 \not \equiv 0 \) (mod p), then \(a_2,b_2 \not \equiv 0 \) (mod p). Thus the argument lifts solutions over reduced residue classes modulo \(p^\gamma \) to solutions over reduced residue classes modulo \(p^t\), so it applies here without modification. \(\square \)
Theorem 8.1
If for every prime p there exists a positive integer \(\gamma \) such that \(M_s(p^\gamma ) > 0\), then \(\mathfrak {S} > 0\).
Proof
By Lemma 8.2,
By Lemma 8.3, for some positive integer \(\gamma \),
The lemma now follows from (67), Lemma 8.1, and (69). \(\square \)
In Sects. 9 and 10 we prove that, under the conditions of Theorem 1.2, for every p there exists a positive integer \(\gamma \) such that \(M(p^\gamma )>0\).
9 Solvability of the local problem
We now consider the local system
with \(x_i \ne 0\) in \(\mathbb {Z}/p\mathbb {Z}\).
We will prove the following result:
Theorem 9.1
The system
has a solution \((x_1, \ldots , x_s)\) with all \(x_i \ne 0\) modulo every prime p if
-
1.
\(\displaystyle \sum _{i=1}^s u_i \equiv U \pmod 2\) and \(\displaystyle \sum _{i=1}^s v_i \equiv V \pmod 2,\)
-
2.
\(\displaystyle \sum _{i=1}^s u_i \equiv U \pmod 3,\) and
-
3.
for each prime p at least 7 of the \(u_i\), \(v_i\) are not zero modulo p.
Observe that if the system
has a solution for all \(u_1, \ldots , u_t, v_1, \ldots , v_t \ne 0\), then so does the system
for any \(\{i_1, \ldots , i_t\}\), \(\{j_1, \ldots , j_t\} \subset \{1, \ldots , s\}\). Also observe that the conditions of Theorem 9.1 guarantee solvability modulo \(p=2\) and \(p=3\): \(p=2\) is immediate and for \(p=3\), the condition guarantees that the quadratic equation is satisfied and each term \(v_ix_i^3\) of the cubic equation can be independently set to 1 or \(-1\), allowing us to set \(v_1x_1^3 = V\) if \(V \not \equiv 0 \pmod 3\) and partition the remainder of \(\{1, \ldots , t\}\) into groups of 2 and 3, which can be zeroed by setting them to \(\{1, -1\}\) and \(\{1, 1, 1\}\).
Thus we have reduced Theorem 9.1 to this lemma:
Lemma 9.1
For all \(u_i\), \(v_i \ne 0 \pmod p\), \(p \ge 5\), \(t \ge 7\), U, V, there exist \(\{x_1, \ldots , x_s\}\) with \(x_i \ne 0 \pmod p\) such that
Lemma 9.2
Suppose \(p > 3\), and that a and b are not both equal to p. Then \(|W_i(p,a_2,a_3)| \le 2\sqrt{p}+1.\)
Proof
Corollary 2F of [6] gives
Now
\(\square \)
Lemma 9.3
\(M_t(p) \ge \frac{1}{p^2}\big ((p-1)^t- (p^2-1)(2\sqrt{p}+1)^t\big )\).
Proof
We have \(W_i(p,p,p)=p-1\) and for \(r_2\), \(r_3\) not both p, \(W_i(p,r_2,r_3) \le 2\sqrt{p}+1\) by Lemma 9.2. Thus
So we have
\(\square \)
Taking \(t=7\), we get
This gives that \(M_7(p) > 0\) for \(p > 40.58\). This means that we now need only check that Lemma 9.1 holds for each prime smaller than 41. This is now a finite number of cases to check and thus can be verified by computer. In the following section, we note several techniques that may be employed to bring the computational difficulty of the task into the realm of feasibility, and in Appendix 1 we provide Sage code for performing the computation.
It is worth noting that \(t=7\) appears to only be required for \(p=7\). It seems highly probable that \(t=5\) will suffice for all other primes; however, reducing t to 5 weakens the bound of Lemma 9.3 to requiring us to check all primes less than 1193, which would require more computation than is feasible, since even after the optimizations of Sect. 10, the algorithm checks \(O(p^7)\) distinct forms for solvability to verify Lemma 9.3 for all primes up through p.
10 Computational techniques
First, we note that if every pair U, V modulo p can be represented by the form in \(t_0\) variables, then every pair can be represented by t variables for \(t>t_0\). So we will start our search with \(t=3\) and store the forms that represent all pairs (U, V) of residue classes mod p. We then need only search higher values of t for the forms that failed to represent all pairs of residue classes with a smaller t.
(The methods in this paragraph are closely modeled after those of [10].) By independently substituting \(c_ix_i\) for each \(x_i\), we can assume each \(x_i\) is either 1 or a fixed quadratic nonresidue c modulo p. By rearranging and multiplying by \(b^{-1}\) as needed, we can assume that \(u_1, \ldots , u_r = 1\), \(u_{r+1}, \ldots , u_t = c\) with \(r \ge \lceil {t/2}\rceil \). By multiplying the cubic equation by \(v_1^{-1}\) and rearranging, we may assume \(1 = v_1 \le v_2 \le \cdots \le v_t\). By substituting \(-x_i\) for \(x_i\) as needed, we can assume \(1 \le v_i \le (p-1)/2\) for each \(v_i\) without affecting the \(u_i\).
As a final optimization, we note that if the system of congruences
represents \(p^2-1\) of the possible \(p^2\) pairs of residue classes (U, V) modulo p, then
will necessarily represent all \(p^2\) residue classes, since \((u_{t+1}x_{t+1}^2, v_{t+1}x_{t+1}^3)\) must represent at least two distinct pairs of residue classes, so
will be solvable for some \((u_{t+1}, v_{t+1})\). This turns out to be quite useful: a substantial number of forms represent exactly \(p^2-1\) pairs of residue classes modulo p.
Using these techniques to minimize the computation needed, running the Sage code in Appendix 1 verifies that Lemma 9.1 holds for \(p < 41\). This allows us to conclude the following unconditional form of Theorem 8.1.
Lemma 10.1
\(\mathfrak {S} > 0.\)
11 Conclusion
We have that \(R(P) = \mathfrak {S}(Q)J(Q) + O(P^{s-5}(\log P)^{-E})\) by Lemma 6.3. Lemma 10.1, in conjunction with Lemma 8.1, shows that \(\mathfrak {S}(Q)>0\) uniformly over all \(u_i\), \(v_i\) satisfying the conditions of Theorem 1.1 or Theorem 1.2.
The singular integral J(Q) is the same as the one Wooley obtains in the corresponding problem over the integers, so by Lemma 7.4 of [12], there exists a positive constant C such that
In addition, we have the asymptotic upper bound \(\mathfrak {S}(Q) \ll 1\) from Lemma 7.3. So we have
for \(E > 0\), \(C > 0\) uniformly.
Thus R(P) is eventually positive. This can only be true if there is a solution of (1) over the primes, so we can conclude Theorems 1.1 and 1.2.
References
Bourgain, J., Demeter, C., Guth, L.: Proof of the main conjecture in Vinogradov’s mean value theorem for degrees higher than three. Ann. Math. 184(2), 633–682 (2016)
Brüdern, J., Cook, R.: On simultaneous diagonal equations and inequalities. Acta Arith. 62(2), 125–149 (1992)
Cook, R.J.: Simultaneous quadratic equations. J. Lond. Math. Soc. 2(4), 319–326 (1971)
Hua, L.K.: Additive Theory of Prime Numbers. American Mathematical Society, Providence (1965)
Rogovskaya, N.N.: An Asymptotic Formula for the Number of Solutions of a System of Equations. Diophantine Approximations, Part II (Russian), 78–84, Moskov. Gos. Univ., Moscow (1986)
Schmidt, W.M.: Equations Over Finite Fields. An Elementary Approach. Lecture Notes in Mathematics, vol. 536. Springer, Berlin (1976)
Vaughan, R.C.: The Hardy–Littlewood Method, 2nd edn. Cambridge University Press, Cambridge (1997)
Vaughan, R.C.: Sommes trigonométriques sur les nombres premiers. (French). C. R. Acad. Sci. Paris Sér. A-B 285(16), A981–A983 (1976)
Wooley, T.D.: The cubic case of the main conjecture in Vinogradov’s mean value theorem. Adv. Math. 294, 532–561 (2016)
Wooley, T.D.: On simultaneous additive equations, I. Proc. Lond. Math. Soc. (3) 63(1), 1–34 (1991)
Wooley, T.D.: On simultaneous additive equations, II. J. Reine Angew. Math. 419, 141–198 (1991)
Wooley, T.D.: Rational solutions of pairs of diagonal equations, one cubic and one quadratic. Proc. Lond. Math. Soc. 3(110), 325–35 (2015)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix 1: Sage code
Appendix 1: Sage code
Code: (SageMath 8.6)
Output:
Rights and permissions
About this article
Cite this article
Talmage, A. Simultaneous cubic and quadratic diagonal equations in 12 prime variables. Ramanujan J 57, 863–905 (2022). https://doi.org/10.1007/s11139-021-00386-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-021-00386-y