Values of random polynomials in shrinking targets
Dubi Kelmer, Shucheng Yu

TL;DR
This paper establishes asymptotic formulas for counting integer vectors with polynomial values in shrinking targets, confirming predictions for indefinite quadratic forms and extending results to higher degree polynomials.
Contribution
It provides effective asymptotic formulas for integer solutions in shrinking targets for indefinite quadratic forms and higher degree polynomials, confirming prior predictions.
Findings
Asymptotic formulas valid for almost all indefinite quadratic forms.
Existence of integer solutions in shrinking targets for these forms.
Extension of results to higher degree random polynomials.
Abstract
Relying on the classical second moment formula of Rogers we give an effective asymptotic formula for the number of integer vectors in a ball of radius , with value in a shrinking interval of size , that is valid for almost all indefinite quadratic forms in variables for any . This implies in particular, the existence of such integer solutions establishing the prediction made by Ghosh Gorodnik and Nevo. We also obtain similar results for random polynomials of higher degree.
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.
Values of random polynomials in shrinking targets
Dubi Kelmer
Department of Mathematics, Boston College, Chestnut Hill MA 02467-3806, USA
and
Shucheng Yu
Department of Mathematics, Technion, Haifa, Israel
Abstract.
Relying on the classical second moment formula of Rogers we give an effective asymptotic formula for the number of integer vectors in a ball of radius , with value in a shrinking interval of size , that is valid for almost all indefinite quadratic forms in variables for any . This implies in particular, the existence of such integer solutions establishing the prediction made by Ghosh Gorodnik and Nevo [GGN18]. We also obtain similar results for random polynomials of higher degree.
The authors were partially supported by NSF CAREER grant DMS-1651563. The second author was supported by ERC grant HD-APP
1. Introduction
Let be a non-degenerate indefinite quadratic form in variables. We say is irrational if is not a multiple of a quadratic form with rational coefficients. The Oppenheim Conjecture, proved by Margulis [Mar87], states that if is irrational, then . Going beyond this one can ask about an effective rate for the density, that is, given and a large parameter , one would like to establish how small can be, for with bounded. This type of problem has a long history [BD58, BG99, GM10], and we refer to [Mar97] for an extensive review. As an example we note that for it was shown in [GM10] , that under a suitable diophantine condition on the coefficients of there is such that the inequality
[TABLE]
has infinitely many integer solutions (when this holds for all forms). For ternary forms the best bounds are due to Lindenstrauss and Margulis [LM14] who showed that under suitable diophantine conditions on the inequality has infinitely many integer solutions.
Improving on these bounds for any given form seems like a very difficult problem, nevertheless, much more can be said when considering a generic form. In [GGN18], Ghosh Gorodnik and Nevo considered the problem of values of generic polynomials and gave a heuristic argument based on the pigeon hole principal predicting that for a generic degree polynomial in variables, one should expect that the system of inequalities
[TABLE]
would have integer solutions for any positive , and in particular, for quadratic forms this should hold for any .
To make the notion of a generic form more precise, we denote by the space of determinant one quadratic forms of signature and note that the natural action of on this space (via change of variables) is transitive, and hence the Haar measure of gives a natural measure on . In this setting, by utilizing the fact that an indefinite quadratic form is stabilized by a large semisimple group, and studying a shrinking target problem for the action of this group, [GGN18] showed that there is some such that for all for any , for almost all forms the inequality (1.1) has integer solutions for all sufficiently large . While in general the value of is smaller than , for they show that in agreement with the heuristic prediction (see also [GK17] for a similar result for ). For the special case where , in [AM18] Athreya and Margulis used a completely different approach relying on lattice point counting, and showed that for any and for any , for almost all there are integer solutions to with for all sufficiently large .
A different way to try and quantify the density of integer values of forms, is to study the asymptotics for the number of integer solutions with for some fixed small interval . Here Eskin, Margulis and Mozes [EMM98] showed that for any irrational quadratic form of signature with , , and any interval the number of solutions is asymptotic to with an explicit constant depending on the form . This is no longer true for forms of signature or where one can find examples for which the number of solutions grows logarithmically faster than . Nevertheless, they showed that the same asymptotic holds for almost all quadratic forms of signature or .
As in the problem for the rate of density, for this problem one can also expect more when considering a generic form. Indeed, [AM18] improved the asymptotic formula to give an effective estimate with a power saving. Explicitly, they showed that there is such that for any fixed interval and for almost all ,
[TABLE]
where here and below we use notation to mean that for some constant , and we use the subscript to emphasize the dependance of this constant on additional parameters.
In this paper, we refine the result of [AM18], by considering the same problem when we allow the interval to shrink as grows. As mentioned in [AM18], this method is suitable to deal with polynomials of higher degree, and we illustrate this by considering the problem in this generality. To do this, for and let
[TABLE]
and consider the space of homogenous polynomials of degree that are of the form with and . The Haar measure of then gives a measure on , giving us a natural notion of almost all polynomials in this space. We note that when the space is the full space of determinant one quadratic forms of signature .
Theorem 1**.**
For any even and with , let . Let be a decreasing family of bounded measurable subsets of with measures for some . Then there is such that for almost all there is a constant such that
[TABLE]
Remark 1.2*.*
From our proof one can extract an explicit value for , and in particular any will work. We did not try to obtain the optimal power saving here and our main point is that there is some positive power saving.
This result is valid for any family of shrinking targets, in particular, taking the shrinking sets to be the intervals it implies the following corollary, verifying the prediction of [GGN18].
Corollary 2**.**
Let be as in Theorem 1. For any and for any , for almost all the system of inequalities
[TABLE]
has integer solutions for all sufficiently large .
For the results described above, one first fixes the shrinking sets, or for the case of intervals the center point , and only then obtain a result for almost all polynomials, so that this full measure set of polynomials may depend on . A natural question is then, how well can one polynomial (chosen at random), approximate all target points ? This question was addressed in [Bou16] for the case of indefinite diagonal ternary quadratic forms, and in [GK18] for general indefinite ternary quadratic forms. In these cases they showed that given a sequence and such that with then for almost all and for all sufficiently large ,
[TABLE]
Using our method we are also able to give the following effective counting estimate in this setting.
Theorem 3**.**
Let be as in Theorem 1. Let and let . Let be a non-decreasing function satisfying that . Then there is such that for almost all for any interval with we have
[TABLE]
Remark 1.4*.*
Taking the function to be a constant implies that in order for (1.1) to have integer solutions for all sufficiently large and for all in some compact set, we need an exponent rather than as we got for a fixed . It is unclear if this is really the best one can hope for or if it is just an artifact of the proof.
As a consequence we get the following generalization of the result of [GK18] to higher dimensions as well as higher degrees.
Corollary 4**.**
Let be as in Theorem 1. Given a non-decreasing functions with and a non-increasing function satisfying that for some , we have that for almost all and for all sufficiently large
[TABLE]
1.1. Outline of proof
As some parts of the proof can get a bit technical, for readers’ convenience we outline here the general strategy. The main idea is the following general principle: Given a nice enough large set in we expect the number of lattice points in the set to be close to its volume. In particular, we consider here sets of the form
[TABLE]
whose volume is expected to grow like . Here and below we denote by the closed ball centered at the origin with radius . In particular, for of order with the volume of these sets grows with and we expect them to contain integer points.
More explicitly, writing an element as with , since we can write
[TABLE]
Next we recall the result of Schmidt [Sch60], relying on Rogers’ second moment formula [Rog55], who showed that given any increasing family of sets in for almost all lattices with one has that . When the interval is fixed, the family is an increasing family and hence we have a very good estimate for . This is still not enough, since for our purpose, the expanding sets also depend on . To overcome this problem we replace them with sets of the form with fixed and taken from a sufficiently dense set.
This was the approach used in [AM18] for the case of a fixed interval. When considering shrinking intervals , we encounter another difficulty, that our family of sets is no longer an increasing family so the results of Schmidt do not apply. The main new ingredient in our proof is using a different (simpler) interpolation argument, relying again on Rogers’ second moment formula, which allows us to handle families of sets that are increasing in one aspect and decreasing in another, as long as their volume grows sufficiently regularly. Of course, we pay a price that we no longer have a square-root bound for the remainder, but we do get some power saving which is sufficient for our result.
We further note that, for this approach to work, it is not enough to know the asymptotics of as , and one needs an explicit estimate for the volume with a power saving bound for the remainder of the form
[TABLE]
Following some preliminary results in section 2, we devote section 3 to establish such a volume estimate. Then in section 4 we use this approach to prove Theorem 1. Then in section 5 we follow a similar argument, but instead of considering a single target we consider a sufficiently dense collection of targets at once, in order to get the uniform estimate in Theorem 3.
Remark 1.6*.*
We note that this method is quite soft and works in general as long as one has a volume estimate of the form (1.5). While we establish this estimate here only for homogenous polynomials in the orbit for even , we expect that such an estimate (and hence similar results on integer values) should hold also for other homogenous polynomials.
Remark 1.7*.*
Another key ingredient for this method is Rogers’ second moment formula (see section 2.3). Recently, in [KY18], we showed how such a second moment formula can be generalized from the space of lattices to other homogenous spaces. Using such a generalization will allow one to apply this method in even greater generality. For example, replacing with a congruence subgroup allows one to deal with certain inhomogeneous forms (see [GKY19]), and considering different semisimple groups allows one to tackle this problem for polynomials on other varieties with a transitive -action as will be shown in [KY19].
2. Setup and some preliminary results
In this section, we set up some notation and provide some preliminary results that are needed for the proofs of our main theorems.
2.1. Notation
In what follows we fix , and even with and . Let and and . We denote by the Haar measure of normalized to be a probability measure on ,
For any we denote by the operator norm given by
[TABLE]
with the standard Euclidean norm on . We then define a symmetric norm on by
[TABLE]
We will use the notation as well as to indicate that there is a constant such that , and we will use subscripts to emphesize the dependence of this constant on additional parameters. We will also use the notation to mean that . Since we fix and , all implied constants may depend on them.
2.2. A covering lemma
For small we consider the norm balls
[TABLE]
and note that for any with and any we have
[TABLE]
Noting that the norm is right -invariant, since the Haar measure is absolutely continuous with respect to the volume measure on the Lie algebra, we have that for any
[TABLE]
with . Any compact set in can be covered by finitely many translates of , and we will use the following estimate for the number of translates that are needed.
Lemma 2.1**.**
Let be a fixed compact set. Then for any there exists a finite set such that and .
Proof.
Since can be covered by a finite number of translates of it is enough to show this for . Now for let be a maximal set of points in such that the translates with are pairwise disjoint. Note that for and for , if then , and hence, the maximality of implies that . Moreover, since is a disjoint union contained in then so by (2.2). ∎
2.3. Discrepancy bounds
As explained in the introduction, we can translate the problem of counting integer values of a homogeneous polynomial to a problem of counting lattice points in a region of , and the notion of a generic polynomial can be translated to counting lattice points from a generic lattice.
Recalling our expectation that the number of lattice points in a set should be roughly the volume we define the discrepancy for a lattice in and a finite-volume set as
[TABLE]
By using Siegel’s mean value formula together with Rogers’ second moment formula we can get very good mean square bounds for the discrepancy when averaged over the space of lattices. Recall the space of rank unimodular lattices can be parametrized by , where we identify the coset with the lattice , and let be the probability measure on coming from the Haar measure of as before. We recall that the Siegel transform, , of a bounded compactly supported function is defined by
[TABLE]
and the Siegel’s mean value formula states that
[TABLE]
Moreover, a direct consequence of Rogers’ second moment formula [Rog55] for implies that
[TABLE]
In particular applying this estimate for the indicator function of a bounded measurable set and noting that we get that there is some such that
[TABLE]
where the term is only needed if contains the origin. In particular, there exists some such that for all bounded measurable sets with
[TABLE]
Using this bound we get a good estimate on the measure of the collection of lattices with large discrepancy. For a fixed compact set for any large parameter and a set define the set
[TABLE]
We then get the following estimate.
Lemma 2.2**.**
Fix compact. For any bounded and measurable subset with and any
[TABLE]
Proof.
Let be some fixed fundamental domain for . Since is tessellated by translates with and is compact, it is covered by a finite number of translates, say, . Thus and we can bound
[TABLE]
Now, since any of the translates of is also a fundamental domain, by (2.4) we can bound
[TABLE]
We conclude this section with a simple interpolation argument relating the discrepancy of different sets, we omit the proof which is straightforward.
Lemma 2.3**.**
For any finite-volume sets and any we have that
[TABLE]
3. Volume estimates
Given a homogenous polynomial of degree and an interval , the heuristic argument given in [AM18] leads to the expectation that is asymptotic to . Such asymptotics were established for quadratic forms in [EMM98], and we refine their method and use it to give an explicit estimate with a power saving on the remainder for for any with even.
Theorem 5**.**
Fix even, and let with , and let . For and measurable, there exists such that for any we have
[TABLE]
where the implied constant is uniform over compact sets and the factor is only needed when .
We first give the following smoothed version.
Lemma 3.1**.**
Let be as in Theorem 5. Let be a nonnegative smooth function on that is supported on for some . For any measurable set with indicator function and for any we have
[TABLE]
where
[TABLE]
where and denote the unit spheres with respect to the -norm with , the corresponding cone measures, and
[TABLE]
Proof.
Denote by
[TABLE]
the integral we want to compute. First we note that , so, up to replacing by , or equivalently, switching and , we can assume that . Identify and write so that . For each factor we use spherical coordinates writing with and in the unit sphere with respect to -norm. To simplify notation we denote by . With these coordinates we can write
[TABLE]
Make a change of variable so that and . With this change of variable, writing we get
[TABLE]
For and , using the estimates if and if we can bound the contribution to this integral of the range by to get that
[TABLE]
Now, noting that for and we have , and we can estimate
[TABLE]
to get that
[TABLE]
where for the first part in the error term we used the assumption that is supported on noting that for all . Next, we can estimate uniformly for and to get that
[TABLE]
where we used that
[TABLE]
Now estimate
[TABLE]
and similarly
[TABLE]
to get that
[TABLE]
Noting that for the first term is bounded by the second term gives our result. ∎
We can now unsmooth to obtain the following.
Proof of Theorem 5.
We use the notation as before. First assume that so that . Let denote the indicator function of the unit ball and for small let be smooth functions taking values in approximating in the sense that h_{\delta}^{-}(v)=\left\{\begin{array}[]{ll}1&\|v\|\leq 1-\delta\\ 0&\|v\|\geq 1\end{array}\right. and similarly h_{\delta}^{+}(v)=\left\{\begin{array}[]{ll}1&\|v\|\leq 1\\ 0&\|v\|\geq 1+\delta\end{array}\right., and we can choose them so that .
Now recall that any satisfies that for some to get that
[TABLE]
and we can approximate it from above and below by .
Let , so that is supported on and satisfy . Now applying Lemma 3.1 to these functions gives us that for any
[TABLE]
Next, let and note that and that
[TABLE]
Since unless , we can bound
[TABLE]
where in the last step we used that for any .
Plugging this estimate back in (3.3) and taking
[TABLE]
we get that for any , is bounded both from above and from below by
[TABLE]
where for the case we used the estimate for all . Setting concludes the proof for the case of , where we note that the implied constant is bounded by some power of and is hence uniform for in compact sets.
Finally, we consider the general case of an interval . Denote by and note that for any we have that if and only if , so that writing we have that
[TABLE]
Since we assume we can apply the previous result to get that indeed
[TABLE]
where for the case we used that for . Finally, we conclude the proof by noting that for , and . ∎
4. Approximating a single point
In this section, we prove Theorem 1 by reducing it into a lattice point counting problem, and more precisely to a discrepancy estimate.
As mentioned in the introduction, for with and for any measurable subset we have that the counting function
[TABLE]
counts the number of lattice points of that lie inside the set . To simplify notation, for any , and subset and any we denote by
[TABLE]
In view of this relation, to get a power saving asymptotic formula for the counting function , we first prove a power saving asymptotic bound for the discrepancy .
Theorem 6**.**
Keep the assumptions as in Theorem 1. Then there exists some such that for -a.e. there exists such that for all
[TABLE]
Proof.
Fix a compact set and a sequence with the exponent depending on to be determined. Let . For any and consider the set defined by
[TABLE]
We will show that is a null set (this will imply that for -a.e. we have that for all sufficiently large and since this holds for any compact set this will conclude the proof).
Now, since the sequence is unbounded,
[TABLE]
and hence
[TABLE]
We thus need to estimate and show that the series is summable.
Now for , by Lemma 2.1, for any there exists a finite subset with such that where . Thus for , there exists some and such that . Then by (2.1) for any
[TABLE]
and since we get that
[TABLE]
where
[TABLE]
Hence using the interpolation Lemma 2.3, we get that for any there is such that
[TABLE]
implying that
[TABLE]
where with , and defined in (2.5). Now applying Lemma 2.2 we can bound
[TABLE]
Since is bounded, there exists some such that for all , and hence for all sufficiently large we can apply Theorem 5 to (or more precisely to having the same volume) which, recalling that , gives
[TABLE]
with from Theorem 5. Next, plug in and use the estimates and to get
[TABLE]
Since by assumption we have so that
[TABLE]
Similarly, applying Theorem 5 to for sufficiently large we get
[TABLE]
and hence,
[TABLE]
We also have for sufficiently large
[TABLE]
Moreover, since we assume then and hence
[TABLE]
Combining the above estimates with (4.4) we get that
[TABLE]
We can then use (4.3) and the fact to get for sufficiently large
[TABLE]
Now, the assumption also implies that , so taking we get that showing that the series is summable as needed. ∎
We can now use this discrepancy bound to conclude.
Proof of Theorem 1.
Fix be as above with , and let . Then by Theorem 6 for -a.e. we have that for all sufficiently large , and hence for with as above and all sufficiently large ,
[TABLE]
5. Uniform approximation
We now use similar ideas to give a uniform bound for the discrepancy for all intervals at once. We first prove a preliminary uniform bound for the discrepancy for all intervals of a fixed length.
Theorem 7**.**
Keep the assumptions as in Theorem 3. Then there exists some such that for almost all there is such that for all and for all intervals with we have
[TABLE]
where is as in Theorem 5.
Proof.
Fix a compact subset , and a sequence with some large number depending on and to be determined. Take such that . For any we define
[TABLE]
where as before. As in the proof of Theorem 6 it suffices to show that the series with is summable. To do that we will bound the set by a nicer set for which we have good control on the measure.
First, for any we reduce the collection of all intervals in into a finite discrete collection of intervals. Let and let be a -dense partition of the interval so that
Now for any interval with , since its center point satisfies , there exists some such that . Note that for , since and we have
[TABLE]
Next, let and again by Lemma 2.1 we know that for any , there exists a finite subset with such that . Thus for any , there exists some and such that . Then by (2.1) for we have . Combining this with (5.2) we get where
[TABLE]
and
[TABLE]
Then by Lemma 2.3 for any there exist some and such that
[TABLE]
Now for any and let with
[TABLE]
so that
[TABLE]
By Lemma 2.2 we can bound
[TABLE]
Now, we take
[TABLE]
We note that since , the second value in the above set is positive (and larger than ). We can now use (5.4) and (5.5) to give estimates for .
First, since with , for and , there exists such that for any ,
[TABLE]
Moreover, note that for each the intervals and are all contained in . Hence for any we can apply Theorem 5 to to get
[TABLE]
Now, using the assumption and the estimates , , and and the relation we can get
[TABLE]
Since we have that , so that
[TABLE]
Similarly, we can apply Theorem 5 to to get for any sufficiently large
[TABLE]
Using these estimates and that we get that
[TABLE]
so that
[TABLE]
Now, using (5.4) and the above estimate, and recalling and , we can estimate for
[TABLE]
where we used that . As in the proof of Theorem 6 for the exponent we can estimate
[TABLE]
where for the last inequality we used that . Hence the series is summable and this finishes the proof. ∎
Proof of Theorem 3.
Let and take another . By Theorem 7 there exists a full measure subset and some constant such that for any with , there exists some such that for any and any interval with we have
[TABLE]
Let and for any as above, let . Now, for this and any , we first assume that with is of length a multiple of . That is, is a positive integer, and we have a partition with each subinterval and . Applying (5.9) to each we get
[TABLE]
where for the last inequality we used that . Now we consider the general case of an interval with . There exist intervals such that lengths of and are of multiples of and . Since we have . This implies that for
[TABLE]
where for the second inequality we used triangle inequality and the bound
[TABLE]
Now since both and are of lengths multiples of , applying the above estimate for and and noting that we have
[TABLE]
where for the second inequality we used the estimates and , and for the last inequality we used that . This completes the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AM 18] J. S. Athreya and G. A. Margulis. Values of random polynomials at integer points. J. Mod. Dyn. , 12:9–16, 2018.
- 2[BD 58] B. J. Birch and H. Davenport. On a theorem of Davenport and Heilbronn. Acta Math. , 100:259–279, 1958.
- 3[BG 99] V. Bentkus and F. Götze. Lattice point problems and distribution of values of quadratic forms. Ann. of Math. (2) , 150(3):977–1027, 1999.
- 4[Bou 16] J. Bourgain. A quantitative Oppenheim theorem for generic diagonal quadratic forms. Israel J. Math. , 215(1):503–512, 2016.
- 5[EMM 98] A. Eskin, G. A. Margulis, and S. Mozes. Upper bounds and asymptotics in a quantitative version of the Oppenheim conjecture. Ann. of Math. (2) , 147(1):93–141, 1998.
- 6[GGN 18] A. Ghosh, A. Gorodnik, and A. Nevo. Optimal density for values of generic polynomial maps. ar Xiv preprint ar Xiv:1801.01027 , 2018.
- 7[GK 17] A. Ghosh and D. Kelmer. Shrinking targets for semisimple groups. Bull. Lond. Math. Soc. , 49(2):235–245, 2017.
- 8[GK 18] A. Ghosh and D. Kelmer. A quantitative Oppenheim theorem for generic ternary quadratic forms. J. Mod. Dyn. , 12:1–8, 2018.
