On a counting theorem for weakly admissible lattices
Reynold Fregoli

TL;DR
This paper provides a precise lattice point counting estimate in regions with hyperbolic spikes using o-minimal structures, with applications to Diophantine approximation and Khintchine type subspaces.
Contribution
It introduces a general counting theorem for weakly admissible lattices in regions with hyperbolic spikes using o-minimal structures, and applies it to Diophantine approximation and Khintchine type subspaces.
Findings
Established nearly sharp bounds for sums of reciprocals of fractional parts.
Extended previous results by Lê, Vaaler, Widmer, Huang, and Liu.
Developed a partition method for counting lattice points in complex regions.
Abstract
We give a precise estimate for the number of lattice points in certain bounded subsets of that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure and expansions thereof to formulate our counting result in a general setting. We give two different applications of our counting result. The first one establishes nearly sharp upper bounds for sums of reciprocals of fractional parts, and thereby sheds light on a question raised by L\^e and Vaaler, extending previous work of Widmer and of the author. The second application establishes new examples of linear subspaces of Khintchine type thereby refining a theorem by Huang and Liu. For the proof of our counting result we develop a sophisticated partition method which is crucial for further upcoming work on sums of reciprocals of…
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.
On a counting theorem for weakly admissible lattices
Reynold Fregoli
Department of Mathematics
Royal Holloway, University of London
TW20 0EX Egham
UK
(Date: March 13, 2024, and in revised form ….)
Abstract.
We give a precise estimate for the number of lattice points in certain bounded subsets of that involve “hyperbolic spikes” and occur naturally in multiplicative Diophantine approximation. We use Wilkie’s o-minimal structure and expansions thereof to formulate our counting result in a general setting. We give two different applications of our counting result. The first one establishes nearly sharp upper bounds for sums of reciprocals of fractional parts, and thereby sheds light on a question raised by Lê and Vaaler, extending previous work of Widmer and of the author. The second application establishes new examples of linear subspaces of Khintchine type thereby refining a theorem by Huang and Liu. For the proof of our counting result we develop a sophisticated partition method which is crucial for further upcoming work on sums of reciprocals of fractional parts over distorted boxes.
1991 Mathematics Subject Classification:
Primary ; Secondary
1. Introduction
1.1. Notation
Let be a set. For any pair of functions , we write () to mean that there exists a real number such that () for all . If the constant depends on any parameters, we write them under the symbol (). We write to indicate a function such that . We use to denote the Euclidean norm on and to denote the maximum norm. We write for the set of positive integers. We indicate by the distance from any to the nearest integer, i.e., . We denote by the diameter (i.e., ) of any set , and we use to indicate its -dimensional Hausdorff measure (). When the dimension is not specified, we assume .
1.2. Main result
In this paper we prove a general counting result for weakly admissible lattices. More specifically, we estimate the number of lattice points lying in the area bounded by a certain compact hypersurface defined in terms of the lattice structure. We generalise this result to any definable set in Wilkie’s o-minimal structure lying within the above mentioned hypersurface, and we derive an asymptotic formula for the number of lattice points contained in any such set. Our counting principle allows us to shed light on a question raised by Lê and Vaaler on the behaviour of certain sums of reciprocals of fractional parts. It also yields a refinement of a theorem proved by Huang and Liu on linear subspaces of Khintchine type.
Before stating the main result, we look at a special case that already captures the main features of our counting principle. Let and let . We denote by the linear forms induced by the rows of the matrix , i.e., the functions
[TABLE]
for . We assume throughout the paper that along with the coefficients of each of these linear forms are linearly independent over . Let and let . We consider the set
[TABLE]
Our goal is to estimate the cardinality of . To this end, we let
[TABLE]
where and are identity matrices of size and respectively, and we let . We also set
[TABLE]
Then, we have
[TABLE]
where . Therefore, estimating is equivalent to estimating , if we exclude the points of that lie in .
We now make some assumptions on the lattice . First, we assume that the distance between the points in and the coordinate subspaces of orthogonal to is always positive. In the worst case, this distance will be decaying as we move away from the origin. We want to control its decay rate in terms of the distance from the origin. Hence, we additionally assume that the distance between the points of and the coordinate subspaces orthogonal to is also bounded from below by a certain non-increasing function. To make this precise, we give the following definition.
Definition 1.1**.**
Let be a non-increasing111We say that is non-increasing if for all . function. We say that a matrix is -semi multiplicatively badly approximable if
[TABLE]
for all . If the function can be chosen constant, we say that is semi-multiplicatively badly approximable.
For the lattice , the purely arithmetic property introduced in Definition 1.1 yields the geometric condition described above. Provided this geometric condition is fulfilled, we can derive an asymptotic estimate for .
Proposition 1.2**.**
Let be a -semi multiplicative badly approximable matrix and suppose that , where is the base of the natural logarithm. Then, we have
[TABLE]
where
[TABLE]
The case , of Proposition 1.2 was proved by Widmer [18]. We briefly explain how the proof is structured, so that we can highlight the main difficulties. The key idea is to decompose the set into approximately subsets. To each such subset we apply a different diagonal linear map and obtain a ball-like shaped set. We then count the points of the corresponding transformation of lying in each of these sets. Note that for , , and , we already find more than different subsets and linear maps. The finer the subdivision, the more precise is each single estimate. However, when the subdivision is too fine, we end up summing too many error terms, and controlling the minima of the transformed lattices becomes rather difficult. The geometric condition introduced in Definition 1.1 allows us to give sufficiently good bounds on the first successive minima of these lattices to control the total error term. The essence of this partition method is summarised in Proposition 2.1, which itself is a crucial ingredient in our upcoming work on sums of reciprocals of fractional parts over general boxes.
The strategy that we described above also applies to prove a much more general counting principle, that is the central object of this paper. In lieu of the lattice and the set , we can consider a general weakly admissible lattice in and a general definable set contained in . In this much more general setting, we can prove an analogous counting result.
Before stating this result, we introduce some notation and we recall the main definitions. Let and let . We set and we write for any vector in . Note that each induces a multiplicative norm on the space , given by . We indicate this norm by . The following definition is a generalisation of the property considered in Definition 1.1, due to Widmer [19].
Definition 1.3**.**
Let
[TABLE]
for some , and let . We say that a full rank lattice is weakly admissible for the couple if
[TABLE]
for all , where we interpret as .
For our purpose, it is convenient to work with the product of two spaces of the form . We therefore adopt a double index notation. Let and let , where , , , and . Let and let . Let also and let . We consider the vector space and we denote its vectors by . As mentioned above, the vectors and induce a multiplicative norm on , given by , where and . Throughout this section, we fix a subspace of the form
[TABLE]
where , , and .
Now, we introduce a generalisation of the set appearing in Proposition 1.2. We let
[TABLE]
and
[TABLE]
Then, we set . Finally, for we define
[TABLE]
and for any we define .
To make our counting result applicable to a large class of sets we use o-minimal structures. For the convenience of the reader we quickly recall the basic definitions.
Definition 1.4**.**
A structure over is a sequence of families of subsets of such that for each :
is a boolean algebra of subsets of (under the usual set-theoretic operations);
contains every semi-algebraic subset of ;
if and , then ;
if is the projection onto the first coordinates and , then .
A structure over is said to be -minimal if additionally:
the boundary of any set in is finite.
A set is definable in the structure if . A map is definable if its graph is a definable set.
Let and let be a definable set. We call a definable family in , and we call the variables parameters of . For we call the set
[TABLE]
the fibre of above . In our setting, functions such as (for any real r>0) and on need to be definable. Therefore, we require that the o-minimal structure we are working with extends Wilkie’s o-minimal structure [20], i.e., we require that each set definable in is also definable in .
We recall that every subset of of the form
[TABLE]
where is a finite system of functions in the variables and , obtained by the (suitably interpreted) composition of polynomials, exponential functions , and logarithms , is definable in .
From now on, we see the set as a definable family in , with parameters . In analogy with the above, we indicate its fibres by . We can now state our main theorem.
Theorem 1.5**.**
Let be a weakly admissible lattice for the couple and let be definable in an o-minimal structure expanding . Suppose that for all there exists such that . Then, for all and all choices of with (where is the base of the natural logarithm) we have
[TABLE]
We recall that the special case of Theorem 1.5 was proved by Widmer [19, Theorem 2.1].
1.3. Applications I
Theorem 1.5 has some interesting applications in multiplicative Diophantine approximation. Let and let . We set
[TABLE]
The function is of major importance in several branches of Diophantine Approximation and Geometry of Numbers. For instance, Kuipers and Niederreiter use it to control the discrepancy of the sequence via the Erdős-Turan inequality [13, p.122,129,131]. Hardy and Littlewood use it to count the number of lattice points contained in certain polygons [7][8]. Beresnevich, Haynes, and Velani, work out very precise estimates for in the one dimensional inhomogeneous setting [4]. Huang and Liu show how estimates of can be used to solve the convergence case of the generalised Baker-Schmidt problem for simultaneous approximation on certain affine subspaces [10].
In this section, we focus on a question raised by Lê and Vaaler [14]. Lê and Vaaler show that for it holds
[TABLE]
independently of the choice of the matrix [14, Corollary 1.2]. They also ask whether the estimate in (2) is sharp, i.e., whether there exists a matrix such that
[TABLE]
Lê and Vaaler themselves show that (3) holds true whenever the matrix is multiplicatively badly approximable [14, Theorem 2.1]. However, multiplicatively badly approximable matrices seem unlikely to exist for , since each of them would provide a counterexample to the Littlewood conjecture. In the present section we prove a general estimate for the function , when . This estimate shows that, in the special case , Lê and Vaaler’s hypothesis can be significantly weakened. Let us first recap some definitions (see [5][16] for a deeper insight).
Definition 1.6**.**
Let be non-increasing. We say that a matrix is -additively badly approximable if
[TABLE]
for all . We say that is -multiplicatively badly approximable if
[TABLE]
for all . If can be chosen constant in either case, we say that is additively or multiplicatively badly approximable.
The additive and multiplicative conditions are very different. Schmidt [16] showed that the set of additively badly approximable matrices in has full Hausdorff dimension. On the other hand, as mentioned above, multiplicatively badly approximable matrices are unlikely to exist for .
We introduce a new condition, which is hybrid between (4) and (5).
Definition 1.7**.**
Let be as in Definition 1.6. We say that a matrix is -semi multiplicatively badly approximable if
[TABLE]
for all . If the function can be chosen constant, we say that is semi-multiplicatively badly approximable.
Note that (5)(6)(4). Now, under the additional hypothesis , we have the following estimate for .
Corollary 1.8**.**
Let be a -semi multiplicatively badly approximable matrix. Then, for we have
[TABLE]
Corollary 1.8 immediately implies that, in the special case , all matrices that are -semi multiplicatively badly approximable with satisfy (3).
The case , of Corollary 1.8 was proved by Widmer [18], whereas the analogous result for was proved by the author [6], by using Widmer’s case of Theorem 1.5 [19, Theorem 2.1]. Huang and Liu addressed the general case [10, Theorem 6] by using the well-known gap principle [13, Proof of Lemma 3.3 p.123]. However, Huang and Liu’s Theorem 6 contains an extra factor of in the error term, which we could get rid of in Corollary 1.8.
Unfortunately, the existence of -semi multiplicatively badly approximable matrices with has not yet been established, except for . Despite this, at least in dimension , there is some heuristic evidence for their existence. For , Badziahin showed that condition (5), with ( sufficiently small), holds true for a set of vectors of full Hausdorff dimension [1]. It follows from Corollary 1.8 that for , the set of matrices such that has full Hausdorff dimension. Badziahin and Velani also conjectured that the set of -multiplicatively badly approximable matrices, with ( sufficiently small), has full Hausdorff dimension [1, Conjecture 1]. To the best of our knowledge, nothing is known in higher dimension.
1.4. Applications II
Let . We consider the set
[TABLE]
where i.m. stands for infinitely many. The set is said to be the set of simultaneously -approximable points. A well-known theorem of Khintchine [11] relates the Lebesgue measure of the set to the convergence of the sum .
Khintchine showed that if is non-increasing and converges, we have
, whereas if is non-increasing and diverges, we have
. It is well known that this theorem becomes false when we restrict to certain submanifolds of , such as proper rational affine subspaces. This leads naturally to the following definition.
Definition 1.9**.**
Let be a submanifold of dimension . We say that is of Khintchine type for convergence if for all non-increasing functions we have
[TABLE]
We say that is of Khintchine type for divergence if for all non-increasing functions we have
[TABLE]
If both conditions hold, we simply say that is of Khintchine type.
We recall that there is also a notion of strong Khintchine type submanifold in , i.e., a submanifold for which Definition 1.9 holds without the assumption that the function is non-increasing.
It has been shown that many non-degenerate submanifolds (i.e., those that in some sense deviate from a hyperplane at each point) are of strong Khintchine type for convergence [9],[17]. It seems natural then, to ask whether the non-degeneracy condition is necessary for a submanifold to be of (strong) Khintchine type. The answer to this question is no, and indeed it turns out that even some proper affine subspaces of are of strong Khintchine type [12],[15]. So, what makes an affine subspace of (strong) Khintchine type? Since each affine subspace is defined by a real matrix, it appears interesting to try and establish a link between the Diophantine type of this matrix and the properties of the subspace in terms of the validity of the Khintchine Theorem. In a very recent paper [10] Huang and Liu made some progress in this direction.
Definition 1.10**.**
Let . We set
[TABLE]
We call the multiplicative exponent of the matrix .
Observe that for () we have
[TABLE]
Let be an integer, and let . Let also . We define
[TABLE]
Then, we consider the following submanifold of .
[TABLE]
Huang and Liu [10, Theorem 1] proved that if , the submanifold is of Khintchine type for convergence, whereas if , the submanifold is of strong Khintchine type for convergence. We recall that for all there always exist matrices such that [5, Theorem 1]. More precisely, we have
[TABLE]
where dim denotes the Hausdorff dimension. An analogous formula holds for . It can also be shown that for all the set of matrices such that has actually full Lebesgue measure. It follows that Huang and Liu’s theorem holds for generic matrices and .
One could ask if anything can be said about the limit cases, i.e., and . We show that that, up to a logarithmic factor, these cases yield Khintchine type subspaces.
Definition 1.11**.**
Let and let . We set
[TABLE]
We call the multiplicative logarithmic exponent of the matrix at .
Corollary 1.12**.**
Let and be as above. Then,
if and , the submanifold is of Khintchine type for convergence;
if and , the submanifold is of strong Khintchine type for convergence.
Unfortunately, not much is known about the existence of matrices with prescribed multiplicative logarithmic order. However, their existence is established in the additive setting [3]. We can therefore say something about the case . From [3, Theorem 1] we can easily deduce that if , there always exist matrices such that for any given (this implies ). More precisely, we have
[TABLE]
independently of the choice of (here dim denotes the Hausdorff dimension). It follows from Corollary 1.12 that there exist strong Khintchine type lines in with exponent , improving on [10, Theorem 1].
Now, [10, Theorem 1] follows in turn from [10, Theorems 2 and 3]. These results establish some Khintchine type conditions for the submanifold with respect to general -dimensional Hausdorff measures (i.e., need not coincide with the dimension of the submanifold). The problem of establishing Khintchine type conditions with respect to general Hausdorff measures is widely known as the generalised Baker-Schmidt problem. Huang and Liu prove that such conditions hold for the convergence case, when or . We show that [10, Theorems 2 and 3] can be refined to include the limit cases.
Proposition 1.13**.**
Let and let . Let be the matrix defined in (7), and let . Assume that is -semi multiplicatively badly approximable, where is a non-increasing function with the following properties:
* for all ;*
* for some ;*
there exists a non-increasing function such that
;
.
*Then, for all non-increasing approximating functions such that
, we have .*
Note that when is of the form , with , condition implies , i.e., the hypothesis in Huang and Liu’s theorem along with the limit case.
Proposition 1.14**.**
Let and let be a -semi multiplicatively badly approximable matrix, where is a non-increasing function with the following properties:
* for all ;*
* for some ;*
there exists a function such that
;
.
Then, for all approximating functions such that , we have .
With Propositions 1.13 and 1.14 at hand, the proof of Corollary 1.12 is straightforward. We sketch it below.
Proof.
Let for all . The proof follows from taking () and (), and applying the case of Propositions 1.14 and 1.13, with . ∎
Note that we intentionally chose not to specify the function in Propositions 1.13 and 1.14, since these results could be used to derive even finer Diophantine conditions on subspaces, involving, e.g, iterated logarithms.
2. Proof of Theorem 1.5
From now on, we fix an -minimal structure extending , and we say that a set is definable if it is definable in . We fix the parameters and such that . For simplicity, we set and . We also write for and for .
To prove our estimate, we partition the set and we consider the induced partition on . We then count the lattice points contained in each subset of this partition. Let
[TABLE]
and let . Let also
[TABLE]
and for . We set and for . Then, we have
[TABLE]
Hence,
[TABLE]
To decompose the sets and we use the following crucial decomposition result.
Proposition 2.1**.**
Assume that (where is the base of the natural logarithm). Then, there exists a partition of the set of the form , and there exists a collection of linear maps , defined on the space , such that
;
each of the sets for is definable;
the maps for are defined by for , where is a constant only depending on and the coefficients satisfy
* for ;*
;
* for .*
We prove Proposition 2.1 in Section 3. The following corollary is an immediate consequence of Proposition 2.1.
Corollary 2.2**.**
Let and let for all . Then,
* is a partition of the set ;*
each of the sets for is definable;
* for .*
Corollary 2.2 yields the following partition of the set .
[TABLE]
Hence, we can write
[TABLE]
Lemma 2.3**.**
Let . Then, for we have
[TABLE]
Proof.
By weak admissibility, we have . Therefore, it is enough to estimate . Now, is either or a full rank lattice in some subspace with . To prove the claim, it suffices to show that for any bounded set and any full rank lattice we have
[TABLE]
This follows easily from [2, Lemmas 2.1 and 2.2]. Applying (10) to and noting that and yields
[TABLE]
Note that in the last inequality we can replace by a bigger integer, due to the definition of the constant in (10) (see again [2, Lemmas 2.1 and 2.2]). ∎
We are left to estimate the quantity for . By Corollary 2.2, we know that
[TABLE]
To make the counting more effective, we reshape the set on the right-hand side of (12) into a ball-like shaped set. Let be the map
[TABLE]
and let be the map
[TABLE]
where
[TABLE]
Then, we have
[TABLE]
Now, to complete the estimate we use the following general counting result [2, Theorem 1.3], which we state for a vector space of the form and a definable family.
Theorem 2.4** (Barroero-Widmer).**
Let and let . Let also . Consider a full rank lattice and a definable family . Suppose that each fibre of is bounded. Then, there exists a constant , only depending on , such that
[TABLE]
where is the sum of the -dimensional volumes of the orthogonal projections of onto every -dimensional coordinate subspace of , and is the -th successive minimum of the lattice with respect to the Euclidean unit ball. By convention, .
We fix , and we apply Theorem 2.4 to the family
[TABLE]
This family is definable in view of Definition 1.4 and part of Corollary 2.2 (note that is a definable map). Moreover, since the fibres of are bounded, the same holds true for the fibres of . Hence, by Theorem 2.4, Lemma 2.3, and Equations (2) and (13), we have
[TABLE]
where is the first successive minimum of the lattice .
Proposition 2.5**.**
*Let and let be the first successive minimum of the lattice
. Then,*
[TABLE]
for all . By convention, the last term is if .
We prove Proposition 2.5 in Section 4. Note that implies . Hence, combining (2) and Proposition 2.5, we get that for all
[TABLE]
where the last term is null if . It follows that
[TABLE]
By Proposition 2.1, we have and thus, the proof is complete.
3. Proof of Proposition 2.1
In this section, we use the notation to indicate the set for any subset of .
3.1. A partition of the boundary
We start off by constructing a partition of the set and a collection of linear maps defined on , that satisfy parts for the set . Then, we extend this partition to by taking cones, and we prove that the same maps work for the whole set. To this end, we consider the sets
[TABLE]
and .
3.2. The hyperbolic part
We start by proving parts , and for the set . Let with for . We denote by the coordinates of the codomain of . We also introduce the sets
[TABLE]
and
[TABLE]
Lemma 3.1**.**
There exists a partition of of the form , and there exists a collection of linear maps for , that satisfy parts , and of Proposition 2.1.
Proof.
First, we observe that
[TABLE]
Let be any point on the hyperplane and let be an orthonormal basis of (i.e., the only linear subspace associated to ). We consider a tiling of given by the sets
[TABLE]
for . Since is bounded and , we trivially have
[TABLE]
Now, the set is a -dimensional simplex, whose vertices () have coordinates
[TABLE]
for . We define , and we consider the only aligned box whose vertices include the points . We let be its centre. Since the side length of this box is
[TABLE]
and since it contains , by (16) we have
[TABLE]
Now, we set
[TABLE]
Note that . Then, the sets form a partition of , and part follows directly from (17). We associate with each of these sets a translation of the form , where . In particular, we choose to be the distance vector from the centre of the tile to the point . Given that , we have
[TABLE]
proving part . Now, lies in the box of vertices , whereas the centre of the tile lies in a box of centre and side length at most . Since , we have
[TABLE]
Hence, part is proved (modulo the fact that depends uniquely on ). Let for and let be the linear transformation defined by
[TABLE]
for . The following diagram commutes
[TABLE]
Hence,
[TABLE]
To conclude the proof of part it suffices to rescale all coordinates by , where . ∎
Lemma 3.2**.**
Each of the sets defined in Lemma 3.1 is definable.
Proof.
Let be the orthogonal projection onto the hyperplane , and let
[TABLE]
for . Each of the sets is semi-linear, since it is bounded by a finite number of hyperplanes. Moreover, we have
[TABLE]
It follows that all the inequalities defining the set are semi-linear in . Let be the system defining . Then, is defined by the system , which is a system of inequalities of generalised polynomials222finite sums of monomials with non-negative real exponents. Note that the function on with real is definable in . in the variables . Hence, the set is definable. ∎
3.3. The non-hyperbolic part
Now, we prove parts , and for the set .
Lemma 3.3**.**
There exists a partition of the set of the form , and there exists a collection of linear maps for , that satisfy parts , and of Proposition 2.1.
Proof.
Let . We define a unique point associated to by the following procedure. By definition of , we have
[TABLE]
We increase the first coordinate of until either or . We call the increased coordinate . If
[TABLE]
we stop and we set . Otherwise, we increase the second coordinate until either or . We call the increased coordinate . If
[TABLE]
we stop and we set . Otherwise, we repeat the same steps for the remaining coordinates. This procedure terminates, since . Moreover, we have that . Now, we set , and for each we define
[TABLE]
Then, we have
[TABLE]
and this is a partition of , since the sets form a partition of . We show that the sets and the maps for (i.e., the maps introduced in Lemma 3.1) have the required properties. The proof of parts and is trivial. To prove part we observe that, by construction, for each point there are points such that for (e.g., any point ). Therefore, since
[TABLE]
we have
[TABLE]
by the definition of the maps . ∎
Lemma 3.4**.**
Each of the sets defined in Lemma 3.3 is definable.
Proof.
We have
[TABLE]
Now, we consider the set
[TABLE]
and we let be the projection onto the first cartesian factor. Then, By the properties of -minimal structures (see Definition 1.4), is a definable set. ∎
3.4. From the boundary to the whole set
Given a set , we denote by the cone generated by the set , i.e., the set
[TABLE]
Let , and let
[TABLE]
for (where we drop the apex ′ for the sets with ). Then, clearly
[TABLE]
and this is a partition of the set (each line through the origin intersects the boundary at at most one point). We prove that the sets and the maps satisfy parts of Proposition 2.1. From Lemmas 3.1 and 3.3, we easily deduce
[TABLE]
To prove part , we need the following lemma.
Lemma 3.5**.**
Let be a definable set. Then, the set is also definable.
Proof.
We have
[TABLE]
We consider the set
[TABLE]
and we let be the natural projection. Then,
[TABLE]
By the properties of -minimal structures (see Definition 1.4), is a definable set. ∎
From Lemmas 3.2 and 3.5 it follows that is a definable set for each , proving part . Part is a straightforward consequence of Lemmas 3.1 and 3.3. To prove part , it suffices to note that for each point there is a point or such that for (namely ). Hence, part follows again from Lemmas 3.1 and 3.3, and by the definition of the maps .
4. Proof of Proposition 2.5
Let be a shortest vector in the lattice . Then, has the form
[TABLE]
for some point . It follows that
[TABLE]
Fix . We consider three cases. Case :
- •
for and for ;
- •
.
By applying the weighted arithmetic-geometric mean inequality to (21), with weights and , we get
[TABLE]
where we used the fact that (see Proposition 2.1, part ).
Case :
- •
.
In this case it must be either for some or for some .
Case :
- •
there exists such that .
By ignoring all the terms but , we get
[TABLE]
It follows from Proposition 2.1 part that
[TABLE]
Case :
- •
there exists such that .
By ignoring all the terms but , we get
[TABLE]
where .
Case :
- •
for some or for some .
We can suppose , otherwise this case does not occur. Since is weakly admissible for we have that . Now, let
[TABLE]
[TABLE]
and let (if , we set ). Then, by Proposition 2.1 part , we have
[TABLE]
This concludes the proof.
5. Proof of Proposition 1.2
The set that we consider in Proposition 1.2 has a slightly different structure from the fibres of the family appearing in Theorem 1.5. In particular, it involves the maximum norm instead of the Euclidean norm . Therefore, in order to apply Theorem 1.5 to the set , we need to introduce a new family and see as a fibre of . Let and let (which implies and according to the notation described in the Introduction). We set , where
[TABLE]
and
[TABLE]
(note that the definition of hasn’t changed). Then, , where
[TABLE]
To prove proposition 1.2, we need to estimate
[TABLE]
where . We consider two different cases. First, we assume
[TABLE]
In this case, we use Theorem 1.5 to estimate . A suitable choice for the parameter in order to have is . Also, we need to show that the lattice is weakly admissible for the couple , where . We do this in the following lemma.
Lemma 5.1**.**
Let and let . Let also and let . Then,
[TABLE]
for all . Therefore, the lattice is weakly admissible for the couple (see Definition 1.3).
Proof.
Let . If , then and (24) holds true. We can thus suppose that . Let with . Then,
[TABLE]
for some and . It follows from the hypothesis that
[TABLE]
where we used the fact that is non-increasing. Hence, . ∎
By applying Theorem 1.5 to , we find
[TABLE]
Now, since , we have . Hence, by choosing in (25), we deduce
[TABLE]
An easy integration shows that
[TABLE]
[TABLE]
Since , the required estimate is a straightforward consequence of (23) and (27).
We are now left to prove the claim for .
Lemma 5.2**.**
Suppose that . Then, .
Proof.
Assume by contradiction that there exists . Then,
[TABLE]
for some and . Since , we have
[TABLE]
and this contradicts (1.1). ∎
If , it follows from Lemma 5.2 and (22) that . Hence, to prove Proposition 1.2, it suffices to show that
[TABLE]
and that
[TABLE]
Inequality (28) follows immediately from the assumption . To prove (29), we notice that
[TABLE]
and again we use the fact that . The proof is hence complete.
6. Proof of Corollary 1.8
We notice that
[TABLE]
where the last equality follows from (22) and Lemma 5.2 ().
We use Proposition 1.2 to estimate the right-hand side of (6). Since we need , i.e., , we split the sum into two parts, one for and one for . We find
[TABLE]
[TABLE]
where we estimate with for . Note that we used (30) to obtain (32). The required result follows from (33) combined with the trivial estimates and .
7. Proof of Propositions 1.13 and 1.14
The proofs of Theorems [10, Theorems 2 and 3] rely on [10, Theorems 7 and 8]. We state here the refined versions of Theorems 7 and 8. Let , where and . For we set
[TABLE]
and
[TABLE]
where .
Lemma 7.1**.**
Let and let . Let be the matrix defined in (7). Assume that is -semi multiplicatively badly approximable, where is such that for all . Then, for all we have
[TABLE]
Lemma 7.2**.**
Let be a -semi multiplicatively badly approximable matrix, where is such that for all . Then, for all we have
[TABLE]
For simplicity, we prove Lemma 7.2 first.
Proof.
From Huang and Liu’s proof of [10, Theorem 7], we have
[TABLE]
for any (recall that denotes the linear form induced by the -th row of the matrix ). We apply Corollary 1.8 to estimate the right-hand side. We conclude the proof as in [10], by using the fact that , where is some large integer. ∎
The proof of Lemma 7.1 is along the same lines.
Now, we show how to prove Proposition 1.14. We follow [10]. First, we note that without loss of generality we can assume for all , since otherwise we replace with , and we prove that the Hausdorff dimension of the set
is zero (here we use condition ). It follows that in condition we can replace with . To prove the claim, we need to estimate , where is some large constant depending on (see [10, Proof of Thm. 2]). By applying Lemma 7.2 with , we find
[TABLE]
Then, from we deduce
[TABLE]
Finally, condition with in lieu of implies
[TABLE]
Hence, from (35), (36), and (37) we deduce , and we can conclude just as in [10].
To prove Proposition 1.13, we use Lemma 7.1 and part to obtain an estimate of
.
Acknowledgements
My deep gratitude goes to my supervisor, Martin Widmer, for his valuable advice and constant encouragement. I would also like to thank Royal Holloway, University of London, for funding my position here.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Badziahin. On multiplicatively badly approximable numbers. Mathematika , 59(No. 1):31–55, 2013.
- 2[2] F. Barroero and M. Widmer. Counting lattice points and o-minimal structures. IMRN , 2014(No. 18):4932–4957, 2014.
- 3[3] V. Beresnevich, D. Dickinson, and S. Velani. Sets of exact ’logarithmic’ order in the theory of Diophantine approximation. Math. Annalen , 321:253–273, 2001.
- 4[4] V. Beresnevich, A. Haynes, and S. Velani. Sums of reciprocals of fractional parts and multiplicative Diophantine approximation. Mem. Am. Math. Soc , 2017.
- 5[5] Y. Bugeaud. ‘Multiplicative Diophantine approximation’, Dynamical systems and Diophantine approximation. Proc. Conf. Inst. H. Poincaré (Soc. Math. de France, Paris) , 19:105–125, 2009.
- 6[6] R. Fregoli. Sums of reciprocals of fractional parts. Int. J. Number Theory , 15(No. 4):789–797, 2019.
- 7[7] G. H. Hardy and E. J. Littlewood. Some problems of Diophantine approximation: the lattice-points of a right-angled triangle. Proc. London Math. Soc. , s 2-20:15–36, 1922.
- 8[8] G. H. Hardy and E. J. Littlewood. Some problems of diophantine approximation: the lattice-points of a right-angled triangle (second memoir). Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universität , 1(No. 1):211–248, 1922.
