New bounds of Weyl sums
Changhao Chen, Igor E. Shparlinski

TL;DR
This paper improves bounds on Weyl sums and discrepancy of fractional parts of polynomials by extending Wooley's method with new ideas, including a self-improving approach and generalizations to projections, also providing Hausdorff dimension bounds.
Contribution
It introduces novel bounds for Weyl sums, extends results to projections of coefficients, and develops a self-improving method for tighter bounds.
Findings
Enhanced metric bounds on Weyl sums
New bounds on discrepancy of polynomial fractional parts
Upper bounds on Hausdorff dimension of large Weyl sum sets
Abstract
We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also extend these results and ideas to principally new and very general settings of arbitrary orthogonal projections of the vectors of the coefficients onto a lower dimensional subspace. This new point of view has an additional advantage of yielding an upper bound on the Hausdorff dimension of sets of large Weyl sums. Among other technical innovations, we also introduce a ``self-improving'' approach, which leads an infinite series of monotonically decreasing bound, converging to our final result.
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.
New bounds of Weyl sums
Changhao Chen
Department of Pure Mathematics, University of New South Wales, Sydney, NSW 2052, Australia
and
Igor E. Shparlinski
Department of Pure Mathematics, University of New South Wales, Sydney, NSW 2052, Australia
Abstract.
We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients.
We also extend these results and ideas to principally new and very general settings of arbitrary orthogonal projections of the vectors of the coefficients onto a lower dimensional subspace. This new point of view has an additional advantage of yielding an upper bound on the Hausdorff dimension of sets of large Weyl sums. Among other technical innovations, we also introduce a “self-improving” approach, which leads to an infinite series of monotonically decreasing bounds, converging to our final result.
Key words and phrases:
Weyl sums, orthogonal projections, discrepancy
2010 Mathematics Subject Classification:
11K38, 11L15
Contents
-
2.1 Results for coordinate-wise projections of : a traditional point of view
-
2.2 Results for arbitrary orthogonal projections of : a new point of view
-
3.7 Orthogonal projections and large values of exponential sums
1. Introduction
1.1. Background
For an integer , let be the -dimensional unit torus. The exponential sums
[TABLE]
have been introduced and estimated by Weyl [20], and thus are called the Weyl sums, where throughout the paper we denote
[TABLE]
By investigating the properties of the sums (1.1), Weyl [20] established the uniformity of distribution modulo one of the sequence
[TABLE]
provided at least one of the coefficients is irrational. The Weyl sums play crucial role in many other fundamental number theoretic problems. These include estimating the zero-free region of the Riemann zeta-function and thus obtaining good bounds in the error term in the prime number theorem, see [16, Section 8.5], and the Waring problem, see [16, Section 20.2] or [19] for a more detailed treatment. Further problems include bounds of very short character sums modulo highly composite numbers [16, Section 12.6] and various problems from the uniformity of distribution theory and Diophantine approximations [2].
However, despite more than a century long history of estimating such sums, the behaviour of individual sums is not well understood. There have been several conjectures made about their behaviour and true order of magnitude of such sums depending on Diophantine properties of the coefficients ; some have been ruled out, some are still widely open even in the case of sums with monomials , see [6, 7].
The following bound is a direct implication of the current form of the Vinogradov mean value theorem from [5, 21] and is explicitly given in [4, Theorem 5]. Let be such that for some with and some positive integers and with we have
[TABLE]
Then for any there exits a constant such that
[TABLE]
It seems that the current bounds are expected to be far away from the true size of . We also remark that as mentioned by Bourgain [4, Section 3], for better results are known.
On the other hand, the behaviour of the average value of the Weyl sums has recently been fully unveiled in works of Bourgain, Demeter and Guth [5] (for ) and Wooley [21] (for ) (see also [23]) in the best possible form
[TABLE]
of the Vinogradov mean value theorem, where for we denote
[TABLE]
Here we study a question which originates from the work of Flaminio and Forni [14] and has also been studied in more detail by Wooley [22]. Namely, here we seek results which hold for all values of the components of on some prescribed set of positions and almost all values of the components on the remaining positions. Thus this question “interpolates” between individual bounds and bounds involving some kind of averaging. Wooley [22, Theorem 1.1] has shown that in this setting the individual bound in (1.2) can be improved. In this project we introduce several additional arguments and make further improvements.
1.2. Set-up and previous results
Given a family of distinct nonconstant polynomials and a sequence of complex weights , for we define the trigonometric polynomials
[TABLE]
Furthermore, for , decomposing
[TABLE]
with and . Given , we refine the notation (1.5) and write
[TABLE]
If (that is, for each ) we just write
[TABLE]
For the classical case for all and the polynomials
[TABLE]
satisfying some natural necessary conditions, the result of Wooley [22, Theorem 1.1] together with the modern knowledge towards the Vinogradov mean value theorem, see (1.3), asserts that for almost all with respect to the -dimensional Lebesgue measure on , one has
[TABLE]
where
[TABLE]
and
[TABLE]
We remark that the bound (1.7) is presented in a more explicit form than in [22, Theorem 1.1] as we have used the optimal result of Wooley [23, Theorem 1.1] for the parameter of [22, Theorem 1.1]. Furthermore the results in [22, Theorem 1.1] have the restriction that , but our method works for also. Naturally, for the case we consider only and remove the variable from each statement for this special case.
Here we use some new ideas to extend the method and results of Wooley [22] in serval directions. In particular, we obtain an improvement of (1.7).
We note that it is also interesting to find a tight upper bound for the almost all points for the classical Weyl sums given by (1.1). In this direction the authors [8, Appendix A] have shown that for almost all one has
[TABLE]
It is very natural to conjecture that the exponent cannot be improved.
Fedotov and Klopp [13, Theorem 0.1] have shown that the conjecture is true for . More precisely, for any non-decreasing sequence of positive numbers, for almost all we have
[TABLE]
We remark that the conjecture is still open for .
As in [22], we give applications of our bounds of exponential sums to bounds on the discrepancy (see Section 2.6 for a definition) of the sequence of fractional parts of polynomials. However, we modify and improve the approach of Wooley [22] of passing from exponential sums to the discrepancy and obtain stronger results.
1.3. An overview of our results and tools
Here we obtain results of three different types:
- (i)
We study the scenario of Wooley [22] when the vector is split into two parts and formed by its components which is related to the coordinate-wise projections of .
- (ii)
We introduce and study an apparently new problem related to arbitrary orthogonal projections of . As an additional benefit, our results for arbitrary orthogonal projections, combined with the classical Marstrand–Mattila projection theorem, see [17, Chapter 5], lead to an upper bound on the Hausdorff dimension of sets or large Weyl sums, complementing our previous lower bounds [8].
- (iii)
As in [22], we study the uniform distribution of polynomials modulo one and obtain a bound for the discrepancy, which improves that of [22, Theorem 1.4].
We note that although our results improve those of [22], we see the main value of this work in new ways to combine several principal elements which have been used in the area for quite some time. Namely, we exploit the interplay between
- (i)
the modern form of the Vinogradov mean value theorem, see, for example, Lemma 3.1;
- (ii)
the completion technique, see, for example, Lemma 3.2;
- (iii)
continuity of Weyl sums, see, for example, Lemmas 3.4, 3.5 and 3.6, which in turn leads us to a new type of “self-improving” results in Lemma 4.1 and Corollary 4.2.
As we have mentioned, as one of the applications of our results we obtain an upper bound for the Hausdorff dimension of sets with large Weyl sums, see Corollaries 2.11 and 2.12. Other applications are given in Theorems 2.6 and 2.16 to a bound on short Weyl sums and to the distribution of fractional parts of polynomials over short intervals, respectively.
We hope that similar combinations of these ideas may find several other applications. We also believe that the idea of studying arbitrary orthogonal projections and its applications to bounds of Hausdorff dimension has never been used in analytic number theory before this work.
2. Main results
2.1. Results for coordinate-wise projections of : a traditional point of view
Throughout the paper, let be distinct nonconstant polynomials such that the Wronskian
[TABLE]
does not vanish identically and let be a sequence of complex weights with .
We start with a very broad generalisation of (1.7). We recall that is given by (1.8).
Theorem 2.1**.**
Suppose that is such that the Wronskian does not vanish identically, then for almost all one has
[TABLE]
where
[TABLE]
We remark that Theorem 2.1 gives a nontrivial upper bound provided that , where is given by (1.4).
Furthermore for the classical choice of as in (1.6) we always have . Elementary calculations show that
[TABLE]
Thus Theorem 2.1 gives a direct improvement and generalisation of the bound (1.7), which is due to Wooley [22, Theorem 1.1].
We observe also that when , and this gives the same bound as that of (1.9) for more general polynomials . More precisely, we have the following.
Corollary 2.2**.**
Let , , be such that the Wronskian does not vanish identically and let , then for almost all one has
[TABLE]
For some special cases of , we obtain a series of better bounds which in almost all cases are better than Theorem 2.1 and thus give a further improvement of the result of Wooley [22, Theorem 1.1]. The bounds are based on a new “self-improving” argument, see Lemma 4.1 and Corollary 4.2 below.
We consider the following three mutually exclusive possibilities:
- A.
For some we have , that is, with there is a linear polynomial attached to the vector .
- B.
For some we have , that is, with there is a linear polynomial attached to the vector .
- C.
For all we have , that is, does not contain a linear polynomial.
To reflect these there possibilities we denote new exponents, replacing by , and .
In fact our main result below Theorem 2.3 handles only Case A. Then we reduce Cases B and C to Case A.
Indeed, for Case B, assuming without loss of generality that , we simply write , where we append to so that which we estimate for almost all . That is, in Case B, for any we use the inequality
[TABLE]
To tackle Case C, we simply replace with , where we append to and to , so that and , which we estimate for almost all . That is, in Case C, for any we use the inequality
[TABLE]
More precisely, recalling the definitions (1.4) and (1.8) in Case A we have the following bound.
Theorem 2.3**.**
Suppose that is such that the Wronskian does not vanish identically and suppose that
[TABLE]
Then for almost all one has
[TABLE]
where
[TABLE]
We remark that if then for each one has
[TABLE]
Moreover for the case we have . Thus Theorem 2.3 improves Theorem 2.1 if there is a linear polynomial attached to the vector .
As we have described in the above, for Cases B and C, from Theorem 2.3 we obtain the following two estimates:
Corollary 2.4**.**
Suppose that is such that the Wronskian does not vanish identically and suppose that and
[TABLE]
Then for almost all one has
[TABLE]
where
[TABLE]
Corollary 2.5**.**
Suppose that is such that the Wronskian of with does not vanish identically and suppose that
[TABLE]
Then for almost all one has
[TABLE]
where
[TABLE]
As yet another application of Theorem 2.3 we derive the following bounds for the short sums. For , we consider Weyl sums over short intervals
[TABLE]
Theorem 2.6**.**
For almost all , one has
[TABLE]
*where . *
From Theorem 2.6 we immediately derive that for almost all one has
[TABLE]
Note that using the bound (1.2) and a similar observation about the leading coefficient of shifted polynomials, one obtains a version of Theorem 2.6 with the exponent
[TABLE]
Remark 2.7**.**
The bounds of Theorem 2.3 and Corollaries 2.4 and 2.5 are typically stronger than that of Theorem 2.1. However in the case when but this is the only result at our disposal.
2.2. Results for arbitrary orthogonal projections of : a new point of view
We now consider other projections which seems to be a new scenario which has not been studied in the literature prior to this work.
We need to introduce some notation first.
Let denote the collections of all the -dimensional linear subspaces of . For , let denote the orthogonal projection onto . For , we consider the set
[TABLE]
We also use to denote the Lebesgue measure of (and also for sets in other spaces).
We are interested in the following apparently new point of view:
Question 2.8**.**
Given , for what we have for all ?
We now see that Theorem 2.1 implies that for is as in Theorem 2.1 and , for any
[TABLE]
we have
[TABLE]
where is the orthogonal projection of onto , that is,
[TABLE]
For the degree sequence we denote them as
[TABLE]
and define
[TABLE]
We remark that the following result is similar to the result of Theorem 2.1, with the change of only.
Theorem 2.9**.**
Suppose that is such that the Wronskian does not vanish identically and , then for any one has
[TABLE]
provided that where
[TABLE]
We now consider Question 2.8 in the classical case (1.6) and the sums (1.1). That is, we study the following set
[TABLE]
which we define for and integer . Note that in this setting we have .
Corollary 2.10**.**
For any one has
[TABLE]
provided that where
[TABLE]
We remark that the orthogonal projection of sets is a fundamental topic in fractal geometry and geometric measure theory. Recall the classical Marstrand–Mattila projection theorem: Let , be a Borel set with Hausdorff dimension , see [17, Chapter 5] for more details and related definitions. Then we have:
- •
Dimension part: If , then the orthogonal projection of onto almost all -dimensional subspaces has Hausdorff dimension .
- •
Measure part: If , then the orthogonal projection of onto almost all -dimensional subspaces has positive -dimensional Lebesgue measure.
From the Marstrand–Mattila projection theorem and Corollary 2.10 we obtain the following results. For we use to denote the Hausdorff dimension of .
Corollary 2.11**.**
Let be two integers with and . Then for any
[TABLE]
In particular, taking we obtain
Corollary 2.12**.**
For any integer one has for any
[TABLE]
We note that the authors [9] showed that for any one has
[TABLE]
with some explicit function . Moreover the function
[TABLE]
However the exact comparison between the bound and that of Corollary 2.11 is not immediately obvious.
We remark that the authors [8] have obtained a lower bound of the Hausdorff dimension of . Among other things, it is shown in [8] that for any and one has
[TABLE]
with some explicit function . As a counterpart to (2.5), we remark that we expect for , see also [8, 10]. On the other hand, we do not have any plausible conjecture about the exact behaviour of for .
Remark 2.13**.**
In principle, one can obtain various analogues of Theorem 2.3 and Corollaries 2.4 and 2.5 for the arbitrary projections. However they require imposing some additional (and rather cluttered) restrictions on linear combinations of components of . We omit these similar but more involuted arguments for this setting.
2.3. Uniform distribution modulo one
Let , , be a sequence in . The discrepancy of this sequence at length is defined as
[TABLE]
We note that sometimes in the literature the scaled quantity is called the discrepancy, but since our argument looks cleaner with the definition (2.6), we adopt it here.
For , we consider the sequence
[TABLE]
and for each we denote by the corresponding discrepancy of its fractional parts.
Wooley [22, Theorem 1.4] has proved that () for almost all with one has
[TABLE]
where
[TABLE]
We improve this bound as follows.
Theorem 2.14**.**
Suppose that is such that the Wronskian does not vanish identically and , then for almost all one has
[TABLE]
where
[TABLE]
For the classical choice of as in (1.6) we always have , where is given by (1.4), and elementary calculations show that
[TABLE]
Thus, as before with Theorem 2.1, we see that Theorem 2.14 gives a direct improvement and generalisation of the result of Wooley [22, Theorem 1.4].
Remark 2.15**.**
It is natural to try to obtain analogues of the bounds of exponential sums of Theorem 2.3 and Corollaries 2.4 and 2.5 for the discrepancy. However our main tool, the Erdős–Turán inequality, see Lemma 5.1 below, involves a growing with family of exponential sums of length . So one needs some additional ideas to adjust our argument to this case.
From Theorem 2.14 we derive a bound on the discrepancy of real polynomials over short intervals. More precisely, we now given an upper bound on which denotes the discrepancy of the sequence of fractional parts
[TABLE]
Theorem 2.16**.**
For almost all , one has
[TABLE]
where .
From Theorem 2.16 we obtain that for almost all one has
[TABLE]
Finally, for we claim that by combining [15, Theorem 5.13] with some additional arguments, one can show that for almost all with one has the following stronger bound,
[TABLE]
We give a proof at Section 6. Furthermore we conjecture that this upper bound is the best possible except for a logarithm factor. We remark that this is true for which follows by applying a result of Fedotov and Klopp [13, Theorem 0.1] and the Koksma inequality [15, Theorem 5.4]. However the conjecture is still open when .
3. Preliminaries
3.1. Notation and conventions
Throughout the paper, the notation , and are equivalent to for some positive constant , which throughout the paper may depend on the degree and occasionally on the small real positive parameter .
For any quantity we write (as ) to indicate a function of which satisfies for any , provided is large enough. One additional advantage of using is that it absorbs and other similar quantities without changing the whole expression.
We use to denote the cardinality of a finite set .
We always identify with half-open unit cube , in particular we naturally associate the Euclidean norm with points .
We say that some property holds for almost all if it holds for a set of -dimensional Lebesgue measure .
We always assume that consists of polynomials of degrees
[TABLE]
3.2. Generalised mean value theorems
For the classical case of the Weyl sums as in (1.1), the Parseval identity gives
[TABLE]
Furthermore, we have the Vinogradov mean value theorem, in the optimal form (1.3).
We use the following a general form due to Wooley [23, Theorem 1.1], which extends the bound (1.3) to the sums .
We also recall that for functions their Wronskian is defined in (2.1).
Lemma 3.1**.**
For any a family of polynomials such that the Wronskian does not vanish identically, any sequence of complex weights , and any integer , we have the upper bound
[TABLE]
for any real positive , where is given by (1.4).
3.3. The completion technique
We remark that the completion technique has many applications in analytic number theory. We show the following version for the later application.
Lemma 3.2**.**
For and we have
[TABLE]
where
[TABLE]
Proof.
For and denote
[TABLE]
Observe that by the orthogonality
[TABLE]
We also note that for we have
[TABLE]
see [16, Equation (8.6)]. It follows that
[TABLE]
which finishes the proof. \sqcap$$\sqcup
For , , by Lemma 3.2 we also have
[TABLE]
where
[TABLE]
Note that for any there exists a sequence such that
[TABLE]
and can be written as
[TABLE]
Indeed, since each inner sums in depends only on (for a fixed ) we clearly can write
[TABLE]
for some complex on the unit circle. Hence we can take
[TABLE]
in (3.2). Combining (3.2) with Lemma 3.1 we obtain the following.
Corollary 3.3**.**
Let such that the Wronskian does not vanish identically and , then we have
[TABLE]
3.4. Continuity of exponential sums
We start with the following general statement which could be of independent interest.
Lemma 3.4**.**
Let integer and a vector be such that for any we have
[TABLE]
as , for some real . Then for any positive and with
[TABLE]
if for all large enough n, and
[TABLE]
if for all large enough , we obtain
[TABLE]
where the implied constant is absolute.
Proof.
We first remark that the condition for all sufficiently large is equivalent to that the polynomial is eventually an increasing function, which is used below when we apply the partial sum formula.
Furthermore we remark that the choice of is to guarantee the “non-negativity condition”
[TABLE]
for all large enough .
Let , . For each we have
[TABLE]
It follows that
[TABLE]
For each we now turn to the estimate
[TABLE]
where . Applying partial sum formula we derive
[TABLE]
where
[TABLE]
By our assumption, we obtain
[TABLE]
Observe that there exists a constant (which depends on only) such that the sequence is monotonically non-decreasing for all . It follows that
[TABLE]
We see from (3.5) and (3.6) that
[TABLE]
which together with (3.4) yields
[TABLE]
Since for , the desired result follows. \sqcap$$\sqcup
We remark that if we can always apply Lemma 3.4 with , which we actually do in Lemma 3.5 below. On the other hand, we can use some for some special cases, see Lemma 3.6 below. Furthermore, for applications of Lemma 3.4 to Lemmas 3.5 and 3.6, the value is quite small, in particular, .
For and with , , we define the -dimensional box centred at and with the side lengths by
[TABLE]
We have the following analogues of Wooley [22, Lemma 2.1].
Lemma 3.5**.**
Suppose that and are as (3.1). Let and let be sufficiently small. Suppose that for some , then for
[TABLE]
there is a set with
[TABLE]
such that
[TABLE]
holds for any provided that is large enough.
Proof.
Let be the set of vectors which satsify the “non-negativity condition” (3.3). By Lemma 3.4, applied with and , for we have
[TABLE]
The result follows from the definition of in Lemma 3.2. \sqcap$$\sqcup
Lemma 3.6**.**
Let be such that
[TABLE]
Let and let be sufficiently small. Suppose that for some and
[TABLE]
for some constant , then for
[TABLE]
there is a set with
[TABLE]
such that
[TABLE]
*holds for any provided that is large enough. *
Proof.
From (3.7), without loss of generality, we assume that and hence
[TABLE]
for some real numbers with . For any integer we write
[TABLE]
For any , by (3.8), with the vector of coefficients
[TABLE]
we obtain
[TABLE]
Combining this with (3.9) we derive
[TABLE]
By Lemma 3.4, applied with the coefficients instead of , and , we have
[TABLE]
By the definition of in Lemma 3.2 we obtain
[TABLE]
the result now follows for all large enough . \sqcap$$\sqcup
We note that a similar concept of continuity of Weyl sums has also played a major role in a different point of view on the distribution of Weyl sums [6, 7].
3.5. Distribution of large values of exponential sums
We adapt the arguments of [22, Lemma 2.2] to our setting.
First we show the following useful box counting result. We note that any better bound of the exponent of immediately yields an improvement of our results.
Let and let be sufficiently small. For each let
[TABLE]
where are as (3.1).
We divide into
[TABLE]
boxes of the form
[TABLE]
where for each . Let be the collection of these boxes, and
[TABLE]
Lemma 3.7**.**
In the above notation, we have
[TABLE]
Proof.
Let . By Lemma 3.5 if for some , then there is a set with
[TABLE]
such that for any we have . Combining this with Corollary 3.3 we have
[TABLE]
which yields the desired bound. \sqcap$$\sqcup
Note that the above bound of is nontrivial when .
Corollary 3.8**.**
Let . Then
[TABLE]
Proof.
We fix some sufficiently small and define the set
[TABLE]
Observe that
[TABLE]
Clearly we have
[TABLE]
By Lemma 3.7 and the choice of in (3.10), since is arbitrary, we now obtain the desired result. \sqcap$$\sqcup
Applying Lemma 3.6, in analogy with Corollary 3.8, we obtain the following.
Corollary 3.9**.**
Let be such that
[TABLE]
Let with and let . Suppose that there exits a positive constant such that for all we have
[TABLE]
Let
[TABLE]
then we obtain
[TABLE]
Proof.
We fix some sufficiently small and define
[TABLE]
and we divide into rectangles in a natural way. Let be the collection of these rectangles.
We also define an analogue of (3.11) as
[TABLE]
Using Lemma 3.6 instead of Lemma 3.5 in the proof Lemma 3.7 we obtain
[TABLE]
Applying the similar argument as in Corollary 3.8 we obtain the result. \sqcap$$\sqcup
3.6. Orthogonal projections of boxes
We start with the following general result which is perhaps well known.
Lemma 3.10**.**
Let be a box with the side lengths . Then for all we have
[TABLE]
where the implied constant depends on and only.
Proof.
The idea is to cover a box by balls, and use that the size of the orthogonal projections of any given ball does not depend on the choice of .
More precisely, without loss of generality we can assume that
[TABLE]
Let
[TABLE]
be a subset of . Since for any there exists such that
[TABLE]
we obtain
[TABLE]
where is the ball of centred at and of radius and for , as usual, we define:
[TABLE]
Now we intend to cover by a family of balls of such that each of these balls has the radius roughly .
For each we have
[TABLE]
where and
[TABLE]
Then
[TABLE]
Observe that for each choice on integers with
[TABLE]
there exists a ball of of radius such that
[TABLE]
Denote the collection of these balls by
[TABLE]
It follows that
[TABLE]
Since the radius of each ball is , we have
[TABLE]
where . Together with (3.13) and (3.15) we obtain
[TABLE]
It follows that for any we have
[TABLE]
Since for each ball the projection is a ball of the -dimensional subspace with radius , one has
[TABLE]
Combining this with (3.14), we obtain
[TABLE]
which gives the result. \sqcap$$\sqcup
3.7. Orthogonal projections and large values of exponential sums
We now provide a basic tool for the proof of Theorem 2.9. Applying Lemma 3.7 and Lemma 3.10 we obtain the following analogue of Corollary 3.8.
Corollary 3.11**.**
Let . For any we have
[TABLE]
as , where is given by (2.4).
Proof.
We fix some sufficiently small . We use the same notation as in Section 3.5, including the choice of , in (3.10). For with the side lengths we denote them as
[TABLE]
For by (2.3) we obtain
[TABLE]
We also define the set
[TABLE]
Observe that
[TABLE]
Combining this with Lemma 3.7, Lemma 3.10 and (3.16) we obtain
[TABLE]
By the definition of and since is arbitrary, we obtain the desired bound. \sqcap$$\sqcup
4. Proofs of exponential sum bounds
4.1. Proof of Theorem 2.1
We fix some and set
[TABLE]
We now consider the set
[TABLE]
By Corollary 3.8 we have
[TABLE]
We ask that the parameters satisfy the following condition
[TABLE]
Combining (4.2) with the Borel–Cantelli lemma, we obtain that
[TABLE]
Since
[TABLE]
we conclude that for almost all there exists such that for any one has
[TABLE]
We fix this in the following arguments. For any there exists such that
[TABLE]
By Lemma 3.2 and (4.3) we have
[TABLE]
Note that the condition (4.2) can be written as
[TABLE]
which gives the desired bound.
4.2. Proof of Theorem 2.3
Recall that
[TABLE]
Applying a similar chain of arguments as the proof of Theorem 2.1, from Corollary 3.9 we derive the following “self-improving” property of Weyl sums.
Lemma 4.1**.**
Let be such that
[TABLE]
Let with and let . Suppose that there exits a positive constant such that for all we have
[TABLE]
Then for almost all and for any there exists a positive constant such that
[TABLE]
where
[TABLE]
Proof.
We fix some and set
[TABLE]
For each denote
[TABLE]
Corollary 3.9 gives
[TABLE]
Similarly to the proof of Theorem 2.1, we ask the parameters satisfy the condition
[TABLE]
which is
[TABLE]
Thus we finishes the proof. \sqcap$$\sqcup
We remark that in Lemma 4.1 if then , this is reason why we call it a “self-improving” type result.
We now immediately derive from Lemma 4.1 the following “self-improving” property underlying our bounds. Compared to Lemma 4.1 it allows us to have some level of non-uniformity in our assumption.
Corollary 4.2**.**
Let be such that
[TABLE]
Let with and let . Suppose that for almost all there exits a positive constant such that
[TABLE]
Then for almost all and for any there exists a positive constant such that
[TABLE]
where
[TABLE]
Proof.
We take a decomposition such that and for each the sums are uniformly bounded by , that is, for any we have
[TABLE]
Applying Lemma 4.1 for each , , we obtain the desired result. \sqcap$$\sqcup
Now we turn to the proof of Theorem 2.3. Denote
[TABLE]
Firstly Theorem 2.1 claims that for almost all and for any there exists a constant such that
[TABLE]
Applying Corollary 4.2 repeatedly, we obtain the following sequence
[TABLE]
Since the function is strictly monotonically decreasing for
[TABLE]
and
[TABLE]
by an arbitrary choice small enough at each steps, we finish the proof.
4.3. Proof of Theorem 2.6
For , recall that Weyl sums over short intervals are defined as follows
[TABLE]
We write
[TABLE]
and observe that in the polynomial identity
[TABLE]
where for , each , depends only on and .
Hence Theorem 2.3, applied , and thus with , yields the desired estimate on .
4.4. Proof of Theorem 2.9
As we have claimed, Theorem 2.9 now follows by applying Corollary 3.11 instead of Corollary 3.8 and using similar arguments as in the proofs of Theorem 2.1. We omit these very similar arguments here.
5. Proof of discrepancy bounds
5.1. Preliminaries
We start with recalling the classical Erdős–Turán inequality (see, for instance, [11, Theorem 1.21]).
Lemma 5.1**.**
Let , , be a sequence in . Then for the discrepancy given by (2.6) and any , we have
[TABLE]
We also use the following trivial property of the Lebesgue measure, see [22, Section 3] for a short proof.
Lemma 5.2**.**
Let and , then
[TABLE]
5.2. Proof of Theorem 2.14
As in Section 3.5, if , we just write
[TABLE]
Let , and let for some to be chosen later. For each let
[TABLE]
and
[TABLE]
Observe that
[TABLE]
where the notation is given by (3.12) in the case . By Lemma 5.2 and the inequality (4.1) we conclude that
[TABLE]
We ask that the fixed and satisfy the following condition
[TABLE]
Combining this with the Borel–Cantelli lemma, and choosing a small enough , we obtain that
[TABLE]
It follows that for almost all there exists such that for any and any , one has
[TABLE]
Combining with Lemma 3.2 we obtain that for any there exists such that
[TABLE]
and for any , one has
[TABLE]
Applying Lemma 5.1 for and we conclude that
[TABLE]
Let . The condition (5.1) can be written as
[TABLE]
which finishes the proof.
5.3. Proof of Theorem 2.16
Recall that is the discrepancy of the sequence of fractional parts
[TABLE]
Clearly this sequence is same as
[TABLE]
and thus as before, see (4.4), we see that this sequence is the same as
[TABLE]
where for , each , depends only on and . Furthermore let and
[TABLE]
Then we have
[TABLE]
where the implied constant is absolute. This can be showing by combining the above arguments and the following “translation invariance” of the discrepancy. More precisely, let be a constant and be a sequence of real number. Let be the discrepancy of the fractional parts
[TABLE]
Thus . From the definition of discrepancy (2.6) we derive
[TABLE]
Easy calculations, show that Theorem 2.14 with , and thus with , implies the result.
6. Comments
6.1. Discrepancy of polynomials
First of all we give a proof for (2.7), that is, that for almost all one has
[TABLE]
This is based on [15, Theorem 5.13] (see Proposition 6.2 below) and the following general statement which is perhaps well-known but the authors have not been able to find it in the literature.
Proposition 6.1**.**
Let , be a set of positive Lebesgue measure . Then there is a vector and a set real numbers of positive Lebesgue measure , such that for every we have .
Proof.
Let be the characteristic function of , then clearly we have
[TABLE]
Applying the polar coordinates [12, Theorem 3.12] to the function , we obtain
[TABLE]
where is the -dimensional Hausdorff measure which is given by [12, Chapter 2]. By taking for some in the second term of (6.2) we obtain
[TABLE]
where is the unit sphere centred at the origin. Combining this with (6.1) and (6.2) and applying Fubini’s theorem, we arrive to
[TABLE]
Since , we conclude that there exist a vector
[TABLE]
and a set of of positive Lebesgue measure such that , which gives the desired result. \sqcap$$\sqcup
We formulate [15, Theorem 5.13], see also [2], in the following form.
Proposition 6.2**.**
Let be a sequence increasing sequence of real numbers such that and let . Then for almost all we have
[TABLE]
where means the discrepancy of the sequence , .
Let us now fix some and denote by the set of , for which
[TABLE]
for infinitely many . Assume that . By Proposition 6.1 there exists a vector
[TABLE]
and a set of of positive Lebesgue measure such that we have (6.3) with and for infinitely many . On the other hand applying Proposition 6.2 to the sequence , and parameter , we obtain that for almost all one has
[TABLE]
This now gives the contradiction and therefore together with the arbitrary choice of the estimate (2.7) holds.
At the moment we are not able to rule out that for almost all one has
[TABLE]
for any , which we believe to be false. In fact, as we have mentioned, we believe that (2.7) is tight except the logarithm factor, and this is true for the case which follows from a result of Fedotov and Klopp [13, Theorem 0.1] and the Koksma inequality [15, Theorem 5.4], while the conjecture is still open when .
For the monomial sequence , we denote by the corresponding discrepancy of its fractional parts. We note that in the case the celebrated result of Khintchine, see [11, Theorem 1.72], implies that for almost all one has
[TABLE]
Finally, we remark that for Aistleitner and Larcher [1, Corollary 1] have recently shown that for almost all one has
[TABLE]
for any and for infinitely many . Many other metrical results on the discrepancy of polynomials and other sequences can be found in [1, 3, 15].
6.2. The structure of the exceptional sets
For and denote
[TABLE]
Theorem 2.1 claims that for any
[TABLE]
the set is of zero -dimensional Lebesgue measure. It is natural to ask what we can say more for these sets with zero Lebesgue measure.
Motivated from the works [8, 9] we ask the size of in the sense of Baire categories and Hausdorff dimension. In the following suppose that is the classical choice as in (1.6). The argument in [8] implies that for any and any the set
[TABLE]
is of first Baire category in . For the Hausdorff dimension, [9, Corollary 1.3] implies that
[TABLE]
where means the Hausdorff dimension. We omit these details here.
6.3. Further possible extensions
We have formulated Theorems 2.1 and 2.3 in terms of the unit torus only. In fact these result may shed some light for subsets of also. For instance, Theorem 2.1 implies the following statement.
Let such that where the notation is given by (2.2) and the symbol represents the -dimensional Lebesgue measure. Note that the set itself may be of vanishing -dimensional Lebesgue measure. Suppose that is such that the Wronskian does not vanish identically, then for almost all one has
[TABLE]
where comes from Theorem 2.1.
Indeed, let be the collection of vectors which satisfy (6.4), then Theorem 2.1 implies that the set has full measure (that is, ), and therefore
[TABLE]
Thus the bound (6.4) holds for almost all .
Now, suppose that for some subset . It is interesting to investigate whether one can obtain an appropriate analogue of Theorem 2.1 in this case. In the following we formulate a general framework for the possible extension of Theorem 2.1.
Let and be a “nice” probability measure on , for example a Borel measure. Suppose that the measure admits some kind of the mean value theorem, that is, there exist positive constants such that ()
[TABLE]
Furthermore, assume that has some regular properties, for instance, there exist positive constants such that for any ball centred at and of positive radius one has
[TABLE]
with some absolute implied constants. Note that the condition (6.6) gives the upper bound and lower bound on the measure of any given high dimensional rectangle.
We remark that our methods work for any subset and any measure on which has the above properties (6.5) and (6.6). More precisely, let be the projection measure of , that is,
[TABLE]
Suppose that is such that the Wronskian does not vanish identically, then for -almost all one has
[TABLE]
where is a positive constant which can be explicitly evaluated in terms of the parameters in (6.5) and (6.6). We expect that
[TABLE]
holds in many natural situations.
On the other hand, it is not clear how to extend Theorem 2.14 (the result of the discrepancy) to subsets with some measure on since in general does not have the invariant property as in Lemma 5.2. For example, the famous -Conjecture of Furstenberg, which still remains open (see [18, 24] and references therein): using our notation as in Lemma 5.2, let be a Borel probability measure on such that for any “nice” subset the identity
[TABLE]
holds for and , then is Lebesgue measure or some “trivial” measure.
Acknowledgement
The authors are grateful to Trevor Wooley for helpful discussions and patient answering their questions. The authors also would like to thank the anonymous referee for the very careful reading of the manuscript and many helpful comments.
This work was supported by ARC Grant DP170100786.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. Aistleitner and G. Larcher, ‘Metric results on the discrepancy of sequences ( a n α ) n ⩾ 1 subscript subscript 𝑎 𝑛 𝛼 𝑛 1 (a_{n}\alpha)_{n\geqslant 1} modulo one for integer sequences ( a n ) n ⩾ 1 subscript subscript 𝑎 𝑛 𝑛 1 (a_{n})_{n\geqslant 1} of polynomial growth’, Mathematika , 62 (2016), 478–491.
- 2[2] R. C. Baker, ‘Metric number theory and the large sieve’, J. London Math. Soc. , 24 (1981), 34–40.
- 3[3] D. Bilyk, ‘Discrepancy theory and harmonic analysis’, Uniform Distribution and Quasi-Monte Carlo Methods , Radon Ser. Comput. Appl. Math., vol. 15, De Gruyter, Berlin, 2014, 45–61.
- 4[4] J. Bourgain, ‘On the Vinogradov mean value’, Proc. Steklov Math. Inst. , 296 (2017), 30–40.
- 5[5] 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.
- 6[6] J. Brüdern, ‘Approximations to Weyl sums’, Acta Arith. , 184 (2018), 287–296.
- 7[7] J. Brüdern and D. Daemen, ‘Imperfect mimesis of Weyl sums’, Internat. Math. Res. Notices ,, 2009 (2009), 3112–3126.
- 8[8] C. Chen and I. E. Shparlinski, ‘On large values of Weyl sums’, Preprint , 2019, available at https://arxiv.org/abs/1901.01551 .
