A Diophantine approximation problem with two primes and one $k$-th power of a prime
Alessandro Gambini, Alessandro Languasco, Alessandro Zaccagnini

TL;DR
This paper improves bounds on a Diophantine approximation problem involving two primes and a prime's k-th power, extending the range of k and providing stronger approximation bounds.
Contribution
The authors extend the range of k from 1<k<4/3 to 1<k≤3 and enhance approximation bounds using harmonic analysis techniques.
Findings
Extended the k-range to 1<k≤3
Combined Harman's technique with new estimates for exponential sums
Provided stronger bounds for Diophantine approximation
Abstract
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a -th power of a prime which was only proved to hold for . We improve the -range to by combining Harman's technique on the minor arc with a suitable estimate for the -norm of the relevant exponential sum over primes . In the common range we also give a stronger bound for the approximation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A Diophantine approximation problem with two primes and one -th power of a prime
Alessandro Gambini
Università di Parma, Dipartimento di Scienze Matematiche, Fisiche e Informatiche, Parco Area delle Scienze 53/a, 43124 Parma, Italy.
Alessandro Languasco
Università di Padova, Dipartimento di Matematica “Tullio Levi-Civita”, Via Trieste 63, 35121 Padova, Italy.
Alessandro Zaccagnini
Abstract
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a -th power of a prime which was only proved to hold for . We improve the -range to by combining Harman’s technique on the minor arc with a suitable estimate for the -norm of the relevant exponential sum over primes.
keywords:
Diophantine inequalities , Goldbach-type problems , Hardy-Littlewood method
MSC:
primary 11D75 ,
MSC:
secondary 11J25, 11P32, 11P55
1 Introduction
This paper deals with an improvement of the result contained in [8], which is due to the last two Authors: we refer to its introduction for a more thorough description of the general Diophantine problem with prime variables. Here we just recall that the goal is to prove that the inequality
[TABLE]
where , …, are fixed positive numbers, , …, are fixed non-zero real numbers and is arbitrary, has infinitely many solutions in prime variables , …, for any given real number , under as mild Diophantine assumptions on , …, as possible. In some cases, it is even possible to prove that the above inequality holds when is a small negative power of the largest prime occurring in it, usually when is large enough.
The problem tackled in [8] had , , . Assuming that is irrational and that the coefficients are not all of the same sign, the last two Authors proved that one can take \eta=\bigl{(}\max\{p_{1},p_{2},p_{3}^{k}\}\bigr{)}^{-\phi(k)+\varepsilon} for any fixed , where . Our purpose in this paper is to improve on this result both in the admissible range for and in the exponent, replacing by a larger value in the common range. More precisely, we prove the following Theorem.
Theorem 1
Assume that , , and are non-zero real numbers, not all of the same sign, that is irrational and let be a real number. The inequality
[TABLE]
has infinitely many solutions in prime variables , , for any , where
[TABLE]
We point out that in the common range we have . We also remark that the strong bounds for the exponential sum , defined in (3) below, that recently became available for integral (see Bourgain [1] and Bourgain, Demeter & Guth [2]) are not useful in our problem.
The technique used to tackle this problem is the variant of the circle method introduced in the 1940’s by Davenport & Heilbronn [4], where the integration on a circle, or equivalently on the interval , is replaced by integration on the whole real line. Our improvement is due to the use of the Harman technique on the minor arc and to the fourth-power average for the exponential sum for .
We thank the anonymous referee for an extremely careful reading of a previous version of this paper.
2 Outline of the proof
Throughout this paper denotes a prime number, is a real number, is an arbitrarily small positive number whose value may vary depending on the occurrences and is a fixed real number. In order to prove that (1) has infinitely many solutions, it is sufficient to construct an increasing sequence that tends to infinity such that (1) has at least one solution with , with a fixed which depends only on the choice of , and . Let be a denominator of a convergent to and let (dropping the suffix ) run through the sequence . The main quantities we will use are:
[TABLE]
where . We will approximate with and . By the Prime Number Theorem and first derivative estimates for trigonometric integrals we have
[TABLE]
Moreover the Euler summation formula implies that
[TABLE]
We also need a continuous function we will use to detect the solutions of (1), so we introduce
[TABLE]
which is the Fourier transform of the function defined by
[TABLE]
for and, by continuity, . A well-known estimate is
[TABLE]
Let now
[TABLE]
and
[TABLE]
where is a measurable subset of . From (3) and using the Fourier transform of , we get
[TABLE]
where actually denotes the number of solutions of the inequality (1) with . In other words provides a lower bound for the quantity we are interested in; therefore it is sufficient to prove that .
We now decompose into subsets such that where is the major arc, is the intermediate arc (which is non-empty only for some values of , see section 6), is the minor arc and is the trivial arc. The decomposition is the following: if we consider
[TABLE]
while, for , we set
[TABLE]
where the parameters and are chosen later (see (15) and (16)) as well as , that, as we explained before, we would like to be a small negative power of (and so of ). We have to distinguish two cases in the previous decomposition of the real line in order to avoid a gap between the end of the major arc and the beginning of the minor arc, where we can prove Lemma 12 in the form that we need: see the comments at the beginning of section 6 and just before the statement of Lemma 12. As we will see later in section 6, we need to introduce intermediate arc only for .
The constraints on are in (18), (20) and (21), according to the value of . In any case, we have . We expect that provides the main term with the right order of magnitude without any special hypothesis on the coefficients . It is necessary to prove that , and are o\bigl{(}\mathcal{I}(\eta,\omega,\mathfrak{M})\bigr{)} as on the particular sequence chosen: we show that the contribution from trivial arc is “tiny” with respect to the main term. The main difficulty is to estimate the minor arc contribution; in this case we will need the full force of the hypothesis on the coefficients and the theory of continued fractions.
Remark: from now on, anytime we use the symbol or we drop the dependence of the approximation from the constants and . We use the notation for .
3 Lemmas
In their original paper [4] Davenport and Heilbronn approximate directly the difference estimating it with . The -norm estimation approach (see Brüdern, Cook & Perelli [3] and [8]) improves on this taking the -norm of : this leads to the possibility of having a wider major arc compared to the original approach. We introduce the generalized version of the Selberg integral
[TABLE]
where is the usual Chebyshev function. We have the following lemmas.
Lemma 1** ([7], Theorem 3.1)**
Let be a real number. For we have
[TABLE]
Lemma 2** ([7], Theorem 3.2)**
Let be a real number and be an arbitrarily small positive constant. There exists a positive constant , which does not depend on , such that
[TABLE]
uniformly for .
In order to prove our crucial Lemma 4 on the -norm of , we need the following technical result.
Lemma 3
Let , and . Let further denote the number of solutions of the inequalities
[TABLE]
Then
[TABLE]
Proof 1
This is an immediate consequence of Theorem 2 of Robert & Sargos [9]; we just need to choose , and there. \qed
Lemma 4
Let , , , and . Then we have
[TABLE]
Proof 2
A direct computation gives
[TABLE]
where
[TABLE]
say. Using Lemma 3 on we get
[TABLE]
Concerning , by a dyadic argument we get
[TABLE]
Combining (9)-(11), the first part of the lemma follows. The second part can be proved in a similar way. \qed
We need the following result in the proof of Lemma 9 and also when dealing with ; see section 6.
Lemma 5
Let , , and . Then
[TABLE]
Proof 3
It follows directly from the proof of Lemma 7 of Tolev [10] by letting and using instead of there. We explicitly remark that the condition in Tolev’s original version of this lemma depends on other parts of his paper; in fact the proof of Lemma 7 of [10] holds for every . \qed
We now state some other lemmas which will be mainly useful on the minor and trivial arcs.
Lemma 6** (Vaughan [11], Theorem 3.1)**
Let be a real number and be positive integers satisfying and . Then
[TABLE]
Lemma 7
Let . Then .
Proof 4
It follows immediately from Lemma 6 by choosing and . \qed
Lemma 8
Let , and . Then there are coprime integers satisfying
[TABLE]
Proof 5
Let be a parameter that we will choose later. By Dirichlet’s theorem there exist coprime integers such that and . The choice
[TABLE]
allows us to prove the second part of the statement and to neglect some terms in the estimations of . Using Lemma 6, knowing that and , we can rewrite the bound for neglecting the term :
[TABLE]
The condition allows us to neglect the term and deal with small values of ; in fact, if then we would have a contradiction
[TABLE]
Then , since . Moreover, we can rewrite the inequality on as
[TABLE]
and finally we get , which completes the proof. \qed
The optimizations in section 7 depend either on or on averages of , according to the value of ; these are provided by the following Lemmas. For brevity, we skip the proof of the first one, remarking that it requires Lemma 5.
Lemma 9** (Lemma 5 of [8])**
Let , , , and . We have
[TABLE]
Lemma 10
Let , , , , and . Then
[TABLE]
Proof 6
Using (6) we obtain
[TABLE]
say. By Lemma 4, we immediately get
[TABLE]
Moreover, again by Lemma 4, we have that
[TABLE]
Combining (12)-(14) and using , the lemma follows. \qed
As we remarked in the introduction, stronger bounds are now available for larger integral , but they are not useful for our purpose. The next Lemma provides the additional information that enables us to give a non-trivial result also when .
Lemma 11
Let , , , and . Then
[TABLE]
Proof 7
Inserting Hua’s estimate in [6], i.e. in the body of the proof of Lemma 10 and exploiting the periodicity of , the result follows immediately. \qed
Another lemma on the minor arc is inserted in the body of section 7.
4 The major arc
We recall the definitions in (7) and (8). The major arc computation is the same as in [8]:
[TABLE]
say.
4.1 Main term: lower bound for
As the reader might expect the main term is given by the summand .
Let so that
[TABLE]
[TABLE]
provided that . Let now . We obtain
[TABLE]
Apart from trivial changes of sign, there are essentially two cases:
, , 2. 2.
, , .
We deal with the first one. We warn the reader that here it may be necessary to adjust the value of in order to guarantee the necessary set inclusions. After a suitable change of variables, letting , we find that
[TABLE]
Apart from sign, the computation is essentially symmetrical with respect to the coefficients : we assume, as we may, that , the other cases being similar. Now, for let , and ; if for then
[TABLE]
so that, for every choice of the interval with endpoints is contained in . In other words, for the values of cover the whole interval . Hence for any we have
[TABLE]
Summing up, we get
[TABLE]
which is the expected lower bound.
4.2 Bound for , and
The computations for and are similar to and simpler than the corresponding one for ; moreover the most restrictive condition on arises from ; hence we will skip the computation for both and . Using the triangle inequality and (6),
[TABLE]
say, where and are defined in (3). Using the Cauchy-Schwarz inequality, Lemmas 1-2 and trivial bounds yields, for any fixed ,
[TABLE]
as long as , provided that . Using again the Cauchy-Schwarz inequality, (5) and trivial bounds, we see that
[TABLE]
Taking P=o\bigl{(}X^{1/k}(\log X)^{-1}\bigr{)} we get \eta^{2}B_{4}=o\bigl{(}\eta^{2}X^{1+1/k}\bigr{)}. We may therefore choose
[TABLE]
5 The trivial arc
We recall that the trivial arc is defined in (7) and (8). Using the Cauchy-Schwarz inequality and (4), we see that
[TABLE]
say. Using the PNT and the periodicity of , for every we have that
[TABLE]
Hence, recalling that has to be , the choice
[TABLE]
is admissible.
6 The intermediate arc:
In section 7 we apply Harman’s technique to the minor arc, using Lemma 8 as the starting point. We remark that in the course of the proof of Lemma 12 it is crucial that both the integers and appearing in (22) below do not vanish; in fact, if , say, then is very small () and, according to our definitions above, it belongs to .
For small we do not need an intermediate arc, because the major arc is wide enough to rule out the possibility that for . For larger values of , the constraint (15) implies that there is a gap between the major arc and the minor arc which we need to fill: see the definition in (8). Using the intermediate arc , we are able to cover more than needed.
Let : we now show that the contribution of is negligible. Using (6), Lemma 7, the Cauchy-Schwarz inequality and (15) we get
[TABLE]
where we also used Lemma 5 with and the fact that . The last estimate is o\bigl{(}\eta^{2}X^{1+1/k}\bigr{)} for every .
7 The minor arc
Here we use Harman’s technique as described in [5]. The minor arc is defined in (7) and (8), according to the value of . In view of using Lemma 8, we now split into subsets , and , where
[TABLE]
In order to obtain the optimization, we chose to split the range for into two intervals in which to take advantage of the -norm of in one case (Lemma 9) and the -norm of in the other one (Lemma 10). The same choice will be made later in the discussion of the arc . We will see that it is not possible to split the minor arc in another way in order to get a better result, in the present state of knowledge on exponential sums.
7.1 Bounds on
Using Hölder’s inequality and Lemma 9, for we obtain
[TABLE]
The estimate in (17) should be ; hence this leads to the constraint
[TABLE]
where means .
Using Hölder’s inequality and Lemmas 9 and 10, for we obtain
[TABLE]
The estimate in (19) should be ; hence this leads to
[TABLE]
If we use Lemmas 9 and 11 thus getting
[TABLE]
This bound leads to the constraint
[TABLE]
which justifies the last line of (2).
7.2 Bound on
We recall our definitions in (7) and (8). It remains to discuss the set where the following bounds hold simultaneously
[TABLE]
where by our choice in (15) if , and otherwise. Using a dyadic dissection, we split into disjoint sets in which, for , we have
[TABLE]
where and for some non-negative integers .
It follows that the number of disjoint sets is, at most, . Let us write as a shorthand for the set . We need an upper bound for the Lebesgue measure of . In the following Lemma, it is crucial that both the integers and appearing in (22) below do not vanish; in fact, if , say, then and is so small that it can not belong to . If is large, we treat the range and its symmetrical by means of the argument in section 6: this is needed because, in this case, the inequalities (22) below do not rule out the possibility that , unless is large enough.
Lemma 12
Let . We have that , where denotes the Lebesgue measure.
Proof 8
If , by Lemma 8 there are coprime integers and such that
[TABLE]
We remark that otherwise we would have . In fact, if , recalling the definitions of and (22), .
Now, we can further split into sets where, on each set, . Note that and are uniquely determined by ; in the opposite direction, for a given quadruple , , , , the inequalities (22) define an interval of of length
[TABLE]
by taking the geometric mean.
Now we need a lower bound for : by (22) we obtain
[TABLE]
Recalling that and that , we have
[TABLE]
We recall that is a denominator of a convergent of . Hence by (23), Legendre’s law of best approximation for continued fractions implies that and by the same token, for any pair , having distinct associated products ,
[TABLE]
thus, by the pigeon-hole principle, there is at most one value of in the interval for any positive integer . Furthermore determines and to within possibilities (from the bound for the divisor function) and consequently also determines and to within possibilities from (23).
Hence we got a lower bound for , since, using , we get
[TABLE]
for the quadruple under consideration.
As a consequence we obtain that the total length of the part of with is
[TABLE]
Now we need a bound for : since , we have
[TABLE]
and hence we get
[TABLE]
Next, we sum on every interval to get an upper bound for the measure of : we get
[TABLE]
Standard estimates imply that the sum on the right is , and recalling that we can finally write
[TABLE]
This proves the lemma. \qed
8 Conclusion
Here we finally justify the choice of the function in the statement of the main Theorem. Using Lemmas 9-10-12 we are now able to estimate for . For , we also need the result in section 6.
If we proceed as follows:
[TABLE]
Hence we need \eta=\infty\bigl{(}X^{1/3-1/(2k)+\varepsilon}\bigr{)}, which is the same condition we got in (18).
If ,
[TABLE]
Hence we need \eta=\infty\bigl{(}\max\{X^{1/6-1/(2k)+\varepsilon},X^{-1/12+\varepsilon}\}\bigr{)}, which is the same condition we got in (20). If , using Lemmas 11 and 12 we obtain
[TABLE]
This leads to the same constraint for that we had in (21).
References
- [1]
J. Bourgain, On the Vinogradov mean value, Tr. Mat. Inst. Steklova 296 (2017), Analiticheskaya i Kombinatornaya Teoriya Chisel, 36–46.
- [2]
J. Bourgain, C. Demeter, and L. Guth, Proof of the main conjecture in Vinogradov’s mean value theorem for degrees higher than three, Ann. Math. 184, (2016), 633–682.
- [3]
J. Brüdern, R. J. Cook, and A. Perelli, The values of binary linear forms at prime arguments, Proc. of Sieve Methods, Exponential sums and their Application in Number Theory (G. R. H. Greaves et al, ed.), Cambridge University Press, 1997, pp. 87–100.
- [4]
H. Davenport and H. Heilbronn, On indefinite quadratic forms in five variables, J. London Math. Soc. 21 (1946), 185–193.
- [5]
G. Harman, Diophantine approximation by prime numbers, J. London Math. Soc. 44 (1991), 218–226.
- [6]
L. K. Hua, Some results in the additive prime number theory, Quart. J. Math. Oxford 9 (1938), 68–80.
- [7]
A. Languasco and A. Zaccagnini, On a ternary Diophantine problem with mixed powers of primes, Acta Arith. 159 (2013), 345–362.
- [8]
A. Languasco and A. Zaccagnini, A Diophantine problem with prime variables, in V. Kumar Murty, D. S. Ramana, and R. Thangadurai, editors, Highly Composite: Papers in Number Theory, Proceedings of the International Meeting on Number Theory, celebrating the 60th Birthday of Professor R. Balasubramanian (Allahabad, 2011), volume 23, pages 157–168. RMS-Lecture Notes Series, 2016.
- [9]
O. Robert and P. Sargos, Three-dimensional exponential sums with monomials, J. reine angew. Math. 591 (2006), 1–20.
- [10]
D. I. Tolev, On a Diophantine inequality involving prime numbers, Acta Arith. 51 (1992), 289–306.
- [11]
R. C. Vaughan, The Hardy–Littlewood method, second ed., Cambridge U. P., 1997.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Bourgain, On the Vinogradov mean value , Tr. Mat. Inst. Steklova 296 (2017), Analiticheskaya i Kombinatornaya Teoriya Chisel, 36–46.
- 2[2] J. Bourgain, C. Demeter, and L. Guth, Proof of the main conjecture in Vinogradov’s mean value theorem for degrees higher than three , Ann. Math. 184 , (2016), 633–682.
- 3[3] J. Brüdern, R. J. Cook, and A. Perelli, The values of binary linear forms at prime arguments , Proc. of Sieve Methods, Exponential sums and their Application in Number Theory (G. R. H. Greaves et al , ed.), Cambridge University Press, 1997, pp. 87–100.
- 4[4] H. Davenport and H. Heilbronn, On indefinite quadratic forms in five variables , J. London Math. Soc. 21 (1946), 185–193.
- 5[5] G. Harman, Diophantine approximation by prime numbers , J. London Math. Soc. 44 (1991), 218–226.
- 6[6] L. K. Hua, Some results in the additive prime number theory , Quart. J. Math. Oxford 9 (1938), 68–80.
- 7[7] A. Languasco and A. Zaccagnini, On a ternary Diophantine problem with mixed powers of primes , Acta Arith. 159 (2013), 345–362.
- 8[8] A. Languasco and A. Zaccagnini, A Diophantine problem with prime variables , in V. Kumar Murty, D. S. Ramana, and R. Thangadurai, editors, Highly Composite: Papers in Number Theory, Proceedings of the International Meeting on Number Theory, celebrating the 60th Birthday of Professor R. Balasubramanian (Allahabad, 2011) , volume 23, pages 157–168. RMS-Lecture Notes Series, 2016.
