Abstract
We consider the problem of counting lattice points contained in domains in \(\mathbb {R}^d\) defined by products of linear forms. For \(d \ge 9\) we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit Theorems with respect to the unique \({\text {SL}}_d(\mathbb {R})\)-invariant probability measure on the space of unimodular lattices in \(\mathbb {R}^d\). We also study more refined versions pertaining to “spiraling of approximations”. Our techniques are dynamical in nature and exploit effective exponential mixing of all orders for actions of diagonalizable subgroups on spaces of unimodular lattices.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(\Lambda \) be a lattice in \(\mathbb {R}^d\), and let \((\Omega _T)\) be an increasing family of Borel subsets of \(\mathbb {R}^d\) with finite volumes tending to infinity as \(T\rightarrow \infty \). A fundamental problem in the Geometry of Numbers is to estimate the number of points in \(\Lambda \) which are contained in \(\Omega _T\). Under mild regularity conditions, one can usually show that
In this paper we study the corresponding discrepancy function defined by
When the domain \(\Omega _T\) is a T-dilation of a region \(\Omega \subset \mathbb {R}^d\) with piecewise smooth boundary, one can easily prove that
(see the book [21] for many results of this form), and this estimate is the best possible in this generality. However, the estimate has been improved for certain particular classes of domains. A well-studied setting is when the domain \(\Omega \) has non-vanishing curvature. In this case, Hlawka [16] has shown that
These bounds have been subsequently improved by a number of people (see, for instance, [17] for a survey).
In this paper we shall be interested in asymptotic behaviour (\(T \rightarrow \infty \)) of the discrepancy function \(\mathcal {D}_{T}(\Lambda )\) for "generic" lattices \(\Lambda \). The following two questions naturally arise in this setting:
-
(i)
what is the asymptotic "generic" growth of \(\mathcal {D}_{T}(\Lambda )\)?
-
(ii)
do suitably normalized discrepancy functions converge in distribution?
Concerning Question (i): it turns out that the estimate (1.2) can be improved for generic lattices. The first striking result in this direction was established by W. Schmidt [25]. He proved that for a every increasing family of Borel sets \(\Omega _T\) as above and almost every lattice \(\Lambda \),
However, the exact asymptotic behavior of \(\mathcal {D}_{T}(\Lambda )\) for generic lattices is still quite mysterious, and it turns out that the answer depends very sensitively on the shape of the domains. For instance, Hardy, Littlewood [16] and Khinchin [20] discovered that when \(\Omega _T\) is a T-dilation of a generic compact polygon in \(\mathbb {R}^2\), then
This exhibits a striking difference with the estimate (1.3) for strictly convex domains. Skriganov [28] established a far-reaching generalization of this estimate. He showed that when \(\Omega _T\) is a dilation by a factor T of a compact polyhedron in \(\mathbb {R}^d\), then for almost every unimodular lattice \(\Lambda \),
It is not known whether the above bound is optimal. Another well-studied example is the case when the domains \(\Omega _T\) are the Euclidean balls in \(\mathbb {R}^d\). In this case, it was shown by Kelmer [18] that for any exponentially growing sequence \(T_i\rightarrow \infty \) and almost all lattices \(\Lambda \),
Concerning Question(ii) above: several results have been proved for certain particular families of lattices. For instance, it was discovered by Beck that the distributions of suitably normalized discrepancy functions are asymptotically Gaussian. We refer to a survey [2] and a monograph [3] for a comprehensive exposition of these results. Beck considered the domains
and translated lattices \(\Lambda _{\omega }:=\mathbb {Z}^2+(\omega ,0)\) with \(0<\omega <1\) and showed that there exists an explicit \(\sigma >0\) such that
While this approach seems to work for domains defined by more general indefinite integral binary quadratic forms, it was not clear whether this result could hold in higher dimensions since its proof was based on properties of continued fraction expansions for quadratic irrationals. Furthermore, Beck points out that there are essential difficulties in extending his work to higher dimensions related to the long-standing Littlewood Conjecture.
Levin [22] investigated the discrepancy function of the family of lattices of the form
where \(\mathcal {O}\) is a fixed lattice in \(\mathbb {R}^d\) arising from an order in a totally real number field. He showed that for the boxes \(\Omega _{\underline{N}}:=[-N_1,N_1]\times \cdots \times [-N_d,N_d]\), suitably normalized discrepancy functions \(\mathcal {D}_{\underline{N}}(\Lambda _{\underline{a}})\) are asymptotically Gaussian as \(N_1\cdots N_d\rightarrow \infty \), with \(\underline{a}\in (0,1)^d\) considered random. Since the results [2, 3, 22] treat only very particular lattices arising from orders in number fields, one may wonder whether this behavior occurs for truly generic lattices. We will address this question in the present paper.
One should also mention the ground-breaking works of Dolgopyat, Fayad [8, 10] (see also the survey [9]), generalizing Kersten [19], about the discrepancy of distribution for toral translations. Using our terminology, these results can be interpreted in terms of discrepancy functions for the family of lattices given by
and certain families of domains \(\Omega _{T}({\underline{\theta }})\) depending on additional parameters \({\underline{\theta }}\). It is shown in [8, 10] that the corresponding discrepancy for \(|\Lambda _{\underline{u}}\cap \Omega _{T}({\underline{\theta }})|\) after a suitable normalization converges in distribution as \(T\rightarrow \infty \), with \((\underline{u},{\underline{\theta }})\) considered random. It should be noted that the obtained limit distributions in [8, 10] are different from the Normal Law. Further related results about distribution of Diophantine approximants were proved in [11] and [7].
1.1 Main results
Let \(L_1,\ldots , L_d:\mathbb {R}^d\rightarrow \mathbb {R}\) be linearly independent linear forms and \(N(x):= L_1(x)\cdots L_d(x)\). For a bounded interval \(I\subset \mathbb {R}^+\) and \(T>0\), we consider the domains
We write X for the space of unimodular lattices in \(\mathbb {R}^d\) equipped with the unique \({\text {SL}}_d(\mathbb {R})\)-invariant probability measure \(\mu \). The following result provides an analogue of (1.4) for \(\mu \)-generic unimodular lattices:
Theorem 1.1
Let \(\mathcal {D}_T\) denote the discrepancy function for \(\Omega _T(I)\). If \(d \ge 9\), then
for all \(\xi \in \mathbb {R}\), where
Remark 1.2
We explain in Sect. 4.1 that one may, without loss of generality, prove Theorem 1.1 in the special case when \(L_i(x) = x_i\) for \(i = 1,\ldots ,d\).
Athreya, Ghosh and Tseng [1] studied the related problem of "spiraling" of Diophantine approximants which involves counting the lattice points in the domains
defined for an interval \(I\subset \mathbb {R}^+\) and a Borel subset \(B\subset S^{d-1}\). Our method allows us to analyze the distribution of the error term for this counting problem.
Theorem 1.1 is a special case of Theorem 1.3 below, which deals with the following general setting. For \(k \ge 2\) and positive integers \(d_1,\ldots ,d_k\), we set
and define \(\mathbb {S}_{\underline{d}} := \prod _{j=1}^k S^{d_j-1},\) where \(S^{d_j-1}\) denotes the unit sphere in \(\mathbb {R}^{d_j}\), endowed with the standard Euclidean inner product, with the convention that \(S^0 = \{-1,1\}\). The corresponding norm on \(\mathbb {R}^{d_j}\) will be denoted by \(\Vert \cdot \Vert \), the spherical measure on \(S^{d_j-1}\) will be denoted by \(\kappa _{j}\), and we set
Let us also fix rotation-invariant smooth metrics on each \(S^{d_j-1}\) with \(d_j \ge 2\). If \(d_j = 1\), we endow \(S^0 = \{-1,1\}\) with the discrete distance. If \(B \subset \mathbb {S}_{\underline{d}}\) is a Borel set and \(\varepsilon > 0\), we denote by \(B_\varepsilon \) the \(\varepsilon \)-thickening of B with respect to the products of the chosen metrics. We say that a Borel set \(B \subset \mathbb {S}_{\underline{d}}\) has a smooth boundary if
where the implicit constants are independent of \(\varepsilon \).
Let now \(L_j:\mathbb {R}^d\rightarrow \mathbb {R}^{d_j}\), \(j=1,\ldots ,k\), be linear maps such that \((L_1,\ldots ,L_k)\) is a bijection of \(\mathbb {R}^d\). We define
Given a bounded interval \(I \subset (0,\infty )\), a Borel set \(B \subset \mathbb {S}_{\underline{d}}\) and \(T>0\), we consider the domains
Our main result is the following:
Theorem 1.3
When \(k\ge 2\) and \(d\ge 9\), the discrepancy functions for the sets \(\Omega _T(I,B)\) satisfy,
for all \(\xi \in \mathbb {R}\), where
Theorems 1.1 and 1.3 have been announced in [5] for \(d\ge 4\). However, it turned out that the technical part of our argument works only for \(d\ge 9\).
In the next section, we summarize the main steps of the proof of Theorem 1.3. Our argument can be roughly divided into two parts that involve:
-
a construction of a suitable approximation for the counting function (Sect. 4),
-
analysis of such approximations (Sect. 3).
1.2 Concerning novelty
We want to stress that the approximation of the counting function in this paper is very different from, and much more involved than, the approximation employed in our previous paper [7]. In the latter paper, the domains in which the lattice points were counted could be perfectly tiled by a fixed subgroup of diagonal matrices, thus essentially reducing the question whether a Central Limit Theorem holds, to (an unbounded version of) the setting in [6].
In this paper however, the relevant domains in which we wish to count, are foliated by lower-dimensional subsets, which all admit nice tilings by (higher rank) diagonal subgroups of matrices, but these subgroups depend in a non-trivial way on the leaf in the foliation. We can approximate the counting function on each of these leaves, and bunch the resulting approximations together into a functional tiling (see Sect. 2 for more details). This functional tiling is an integral of averages of a parameterized family of smooth functions over yet another parameterized family of subgroups of diagonal matrices. Each of these parameterized averages can in principle be analyzed using the techniques from [6, 7], but that is not enough.
The issue is that the parameterized family of smooth functions in the averages is not bounded in the relevant parameter (even after the cuspidal cut-offs), which causes serious problems in our cumulant machinery, more specifically in our analysis of "clustered tuples". To circumvent this, we need to make use of some special features of the geometry at hand (see Sect. 3.5.2).
2 Outline of the proof
Our argument will involve analysis on the space X of unimodular lattices in \(\mathbb {R}^d\), which can be considered as a homogeneous space \(X\simeq \hbox {SL}_d(\mathbb {R})/\hbox {SL}_d(\mathbb {Z})\). The space X supports a unique \(\hbox {SL}_d(\mathbb {R})\)-invariant probability measure, which we shall denote by \(\mu \) throughout the paper.
Given a bounded Borel measurable function \(f : \mathbb {R}^d \rightarrow \mathbb {R}\) with bounded support, its Siegel transform \(\widehat{f} : X\rightarrow \mathbb {R}\) is defined by
According to Siegel’s Mean Value Theorem [27], if f is Riemann integrable, then
where we normalise the Lebesgue measure dz on \(\mathbb {R}^d\) so that the unit cube is assigned volume one.
Suppose that \(\Omega _T\) is a bounded Borel set in \(\mathbb {R}^d\), which does not contain the origin. Then, with the above notations,
so that
In the setting of Theorem 1.3, these formulas can be rewritten further. In what follows, we retain the notation used there. In particular, we have fixed \(k \ge 2\) and \(d \ge 3\), as well as a k-tuple \(\underline{d}= (d_1,\ldots ,d_k)\) of positive integers with \(d = d_1 + \cdots + d_k\). We have chosen a bounded interval \(I \subset (0,\infty )\) and a Borel set \(B \subset \mathbb {S}_{\underline{d}}\) with a smooth boundary. We denote by \(\Omega _T = \Omega _T(I,B)\) the sets defined in (1.7). There is no loss of generality in assuming that the maps \(L_j\) are the standard coordinate projections (see Sect. 4.1). Then the domains \(\Omega _T\) can be conveniently foliated by the level sets
which are invariant under the subgroup \(A< {\text {SL}}_d(\mathbb {R})\) of diagonal matrices of the form
We note that \(A\simeq \mathbb {R}^{k-1}\) since
The initial idea of our approach is that the level sets \(\mathcal {L}_{s,\xi }\) can be tessellated, using the action of a discrete subgroup of \(A\) on \(\mathbb {R}^d\). Unfortunately, the domains \(\Omega _T\) themselves do not possess such simple tilings. However, it turns out that each of the intersections \(\Omega _T\cap \mathcal {L}_{s,\xi }\) has a tiling where tiles and the discrete subgroup depends on the parameters s and T (but not on the parameter \(\xi \)). We will show that the indicator functions \(\chi _{\Omega _T}\) can be approximated by suitable integrals of varying functional averages. These “functional tilings” stem from the above tilings for different values of s and \(\xi \) and are constructed using the following data:
-
A collection of finite measure spaces \((Y_{T,i},\kappa _{T,i})\) indexed by \(T>0\) and i in a finite set \(\mathcal {I}\),
-
A collection of bounded Borel functions \(f_{T,i}:\mathbb {R}^d\times Y_{T,i}\rightarrow [0,\infty )\) with \(T>0\) and \(i\in \mathcal {I}\),
-
A collection of finite subsets \(Q(y_i)\) of A with \(y_i\in Y_{T,i}\).
The corresponding “functional tiling” is given by
We shall show that for a suitable choice of the data, \(F_T\) provides an approximation for the characteristic function \(\chi _{\Omega _T}\) in the sense that
Assuming this, we can then write
where the first and third term on the right hand side tend to zero in the \(L^1(\mu )\)-norm. Thus, the distributional limit of \(\mathcal {D}_T(\Lambda )\) is the same as the distributional limit of the sequence of functions
The significance of this observation is that Siegel transforms of functional tilings like \(F_T\) can be investigated using homogeneous dynamics techniques.
Since averages of this form also arise in other arithmetic problems, we will analyze their behavior in an abstract axiomatic setting (cf. assumptions (I.a)–(I.c) and (II.a)–(II.c) below). This analysis will be carried out in Sect. 3. Our main result here is Theorem 3.19. Notably, it shows that when certain basic norm estimates for functions \(f_{T,i}\) hold, the distributional convergence of \(\Upsilon _T(\Lambda )\) holds provided that the variance \(\Vert \Upsilon _T\Vert _{L^2(X)}\) converges. Next, in Sect. 4 we construct an approximation for \(\chi _{\Omega _T}\) of the form (2.4) satisfying our assumptions (I.a)–(I.c) and (II.a)–(II.c). Once such an approximation is available, our main result will be a corollary of Theorem 3.19.
3 Analysis of general functional tilings
In this section we consider a family of functions \(F_T\) on \(\mathbb {R}^d\) defined by a “functional tiling” as in (2.4). Our goal is to analyze the asymptotic behavior of the sums \(\widehat{F}_T(\Lambda )=\sum _{z\in \Lambda \backslash \{0\}} F_T(z)\) for lattices \(\Lambda \) in \(\mathbb {R}^d\). We will formulate several assumptions on the objects defining \(F_T\) and then in the next section demonstrate that the developed framework does apply to our setting.
We hope that the axiomatic approach outlined in this paper can be used in other counting problems as well. Our main result here is Theorem 3.19, which establishes the Central Limit Theorem for \((\widehat{F}_T)\), with respect to the measure \(\mu \).
3.1 Some remarks about the axioms
The goal of this section is to describe a general approach for proving Central Limit Theorems for Siegel transforms of functional tilings \((F_T)\) of the form (2.4). Our approach is based on two sets of assumptions on the data
The first set of assumptions are labelled I.a,I.b,I.c and are described in Sect. 3.2, while the second set of assumptions are labelled II.a, II.b, II.c and are described in Sect. 3.4.
The first set of assumptions simply describes the objects in the data that make up the functional tiling. The key point here is that the functions \(f_{T,i}\) are smooth in the first variable and supported in a fixed compact subset of \(\mathbb {R}^d\) (in particular, the Siegel transform of \(f_{T,i}(\cdot ,y_i)\) is well-defined and smooth for every \(y_i \in Y_{T,i}\) and for all \(i \in \mathcal {I}\).
The second set of assumptions is deeper. The first two assumptions (II.a and II.b) are concerned with the finite subsets \(Q_{T,i}(y_i)\). Roughly speaking, II.a requires that \(Q_{T,i}\) are well-separated subsets of the group A described in the previous subsection, while II.b takes this assumption a bit further, namely that there is a sequence \((\widetilde{Q}_{T,i})\) (independent of \(y_i \in Y_{T,i}\)) and a family of quasi-isometric embeddings \(\beta _{T,i}(\cdot ,y_i)\) of \(\mathbb {R}^{k-1}\) into itself such that \(Q_{T,i}(y_i) = \beta _{T,i}(\widetilde{Q}_{T,i},y_i)\). These two assumptions will be useful when we estimate the contribution to cumulants of (truncations of) \(\widehat{F}_{T,i}(\cdot ,y_i)\) coming from separated tuples (Sect. 3.5.1)
The remaining assumption II.c is the most technical one. It is used to control the contribution to cumulants of (truncations of) \(\widehat{F}_{T}\) coming from clustered tuples (Sect. 3.5.2). Roughly speaking, the idea behind this assumption can be explained as follows. By II.b, the \(y_i\)-dependence of the map \(\beta _{T,i}\) is rather mild, and, up to bounded error, \(\beta _{T,i}\) is close to a map \({\widetilde{\beta }}_{T,i}\) which is independent of \(y_i\). The essence of the assumption II.c is that the sums in functional tilings like (2.4) can be estimated from above by sums over subsets which are independent of \(y_i\). Although this assumption probably can be weakened, it holds in the setting that we are interested in, and it simplifies a lot of the upper estimates of integrals involving products of the \(f_{T,i}\)’s.
3.2 Functional averages and their truncations
Let \(\mathcal {I}\) be a finite set. For \(T>0\) and \(i\in \mathcal {I}\), we consider:
-
(I.a)
finite measure spaces \((Y_{T,i},\kappa _{T,i})\) satisfying \(\sup _{T,i} \kappa _{T,i}(Y_{T,i}) < \infty \),
-
(I.b)
bounded Borel functions \(f_{T,i} :\mathbb {R}^d \times Y_{T,i} \rightarrow [0,\infty )\) such that for \(y_i \in Y_{T,i}\), the map \(x \mapsto f_{T,i}(x,y_i)\) is smooth, and supported in a compact set \(\mathcal {K}\subset \mathbb {R}^d\), independent of T, i, and \(y_i\),
-
(I.c)
a set-valued map \(y_i \mapsto Q_{T,i}(y_i)\) from \(Y_{T,i}\) into the set of finite subsets of the subgroup \(A < {\text {SL}}_d(\mathbb {R})\) of diagonalizable matrices of the form a(u) defined in (2.3) such that
$$\begin{aligned} \sup _{i,y_i} |Q_{T,i}(y_i)|\ll V_T \end{aligned}$$with a parameter \(V_T\) satisfying \(V_T\rightarrow \infty \) as \(T\rightarrow \infty \).
For \(f \in C^\infty _c(\mathbb {R}^d)\), let \(\partial _k f\) denote the partial derivative of f with respect to the k-th coordinate for \(k=1,\ldots ,d\). If \(\beta = (\beta _1,\ldots ,\beta _d)\) is a multi-index, we set \(\partial _\beta f = \partial _1^{\beta _1} \cdots \partial _d^{\beta _d}f\), and define
where \(|\beta | = \beta _1 + \cdots + \beta _d\).
We use the notations
Given the data in (I.a)–(I.c), we consider the family of functions given by
and their Siegel transforms
Our goal is to show that under suitable assumptions the functions
converge in distribution. One of the difficulties here is that Siegel transforms (even for bounded Borel functions with bounded support) are not bounded. Nonetheless, they are typically only large on sets of very small \(\mu \)-measure and belong to \(L^p(X)\) for \(p<d\) (see Lemmas 3.2 and 3.3 below). Here and later in the paper we always assume that \(d\ge 3\) so that the Siegel transforms are \(L^2\)-integrable. This makes it possible to efficiently approximate a Siegel transform by bounded functions on \(X\) whose \(L^p\)-distance from the original Siegel transform is small. To make this approximation precise, we shall use a family of compactly supported cutoff functions \(\eta _L : X\rightarrow [0,1]\) with \(L>0\), constructed in [7, Lemma 4.11] such that for every compact set \(K \subset \mathbb {R}^d\) and \(f \in C(K)\), we have
Furthermore, for every \(\varepsilon >0\),
where the implicit constants are independent of L.
We introduce a parameter \(L_T\rightarrow \infty \), which will be specified later, and introduce the functions \(\varphi _{T,i} : X\times Y_{T,i} \rightarrow [0,\infty )\) defined by
which provide compactly supported truncations of the functions \(\widehat{f}_{T,i}(\cdot ,y_i)\). We then consider
The following lemma shows that this function approximates the Siegel transform \(\widehat{F}_T\) if the parameter \(L_T\) grows fast enough.
Lemma 3.1
If for some \(\varepsilon >0\),
then
Similarly, if
then
Before we proceed to the proof of this lemma, we discuss its relevance to our arguments so far. We wish to prove convergence in distribution for the functions
If \(L_T\) is chosen as in (3.9), then the first and third term of the right hand side tend to zero in the \(L^1\)-norm, whence \(\Upsilon _T\) converges in distribution to a continuous measure if and only if the functions
do. In the upcoming subsections, we will analyse this type of sequences.
Proof of Lemma 3.1
By construction, we have
Since the measure \(\mu \) is \(A\)-invariant, the inner terms are independent of \(a \in Q_{T,i}(y_i)\), whence
By the assumption (I.b), the supports of the functions \(x \mapsto f_{T,i}(x,y_i)\) are all contained in a fixed compact set \(\mathcal {K}\subset \mathbb {R}^d\), independent of T, i and \(y_i\). Hence, by (3.7),
Furthermore, by the assumption (I.c), we have \(|Q_{T,i}(y_i)| \le V_T\), so that we conclude that
This implies the first part of the lemma, and the proof of the second part is similar.
\(\square \)
3.3 Sobolev norms and mixing estimates
In order to obtain quantitative estimates on correlations, we need to control the smoothness of the functions. Our main tool for this purpose are Sobolev norms, which we now introduce. First note that every Y in the Lie algebra \({\mathfrak {s}{\textrm{l}}}_d(\mathbb {R})\) of \({\text {SL}}_d(\mathbb {R})\) induces a differential operator \(D_Y\) on \(C^\infty (X)\) by
More generally, if we fix a basis \(Y_1,\ldots ,Y_m\) of \({\mathfrak {s}{\textrm{l}}}_d(\mathbb {R})\) with \(m = d^2-1\), and if Y is a monomial in the universal enveloping algebra of \({\mathfrak {s}{\textrm{l}}}_d(\mathbb {R})\) with respect to this basis, say \(Y = Y_1^{\eta _1} \cdots Y_m^{\eta _m}\) for non-negative integers \(\eta _1,\ldots ,\eta _m\), then we define \(D_\eta := D_{Y_1}^{\eta _1} \cdots D_{Y_m}^{\eta _m}\), and refer to the integer \(|\eta | := \eta _1 + \cdots + \eta _m\) as the order of \(D_\eta \), where \(\eta = (\eta _1,\ldots ,\eta _m)\). We write \(C_c^\infty (X)\) for the space of compactly supported functions \(\varphi \) such that all the derivatives \(D_\eta \varphi \) exist.
Let \(\Lambda \in X\). We say that a linear subspace \(V < \mathbb {R}^d\) is \(\Lambda \)-rational if \(V \cap \Lambda \) is a lattice in V. If V is \(\Lambda \)-rational, we denote by \(d_\Lambda (V)\) the volume of \(V/V \cap \Lambda \). We define
It can readily be checked that \(\alpha \) is a proper function on \(X\), and that for every compact set \(\mathcal {C}\subset {\text {SL}}_d(\mathbb {R})\), there is a constant \(A_{\mathcal {C}} > 0\) such that
Before we introduce Sobolev norm, we mention important properties of the \(\alpha \)-function in relation with Siegel transforms.
Lemma 3.2
([26], Lemma 2) If \(f : \mathbb {R}^d \rightarrow \mathbb {R}\) is a bounded function with bounded support, then
The following estimate is also well-known (see e.g. [13, Lemma 3.10]):
Lemma 3.3
\(\int _X \alpha ^p \, d\mu <\infty \) for every \(p<d\).
The following norms were introduced and studied by Einsiedler, Margulis and Venkatesh [12].
Definition 3.4
(Sobolev norms) Let q be a positive integer. For \(\varphi \in C^\infty _c(X)\), its Sobolev norm \(S_q(\varphi )\) of order q is defined as
The explicit expression of the norm \(S_q\) will not be important in our paper. Instead we shall use as black boxes, the following properties of the norms, established in [12] and in our previous paper [7].
Proposition 3.5
([12], Subsect. 3.7) For all sufficiently large q,
-
(i)
\(S_q(\varphi ) \ll _q S_{q+1}(\varphi )\) and \(\Vert \varphi \Vert _{L^\infty (X)} \ll _q S_q(\varphi )\) for all \(\varphi \in C_c^\infty (X)\).
-
(ii)
for some \(p \ge 1\), we have \(S_q(\varphi _1 \varphi _2) \ll _q S_{q+p}(\varphi _1) S_{q+p}(\varphi _2)\), for all \(\varphi _1, \varphi _2 \in C^\infty _c(X)\).
-
(iii)
there exists \(\sigma _q > 0\) such that \(S_q\big (\varphi \circ a(u)\big ) \ll _q e^{\sigma _q \Vert u\Vert } S_q(\varphi )\), for all \(u \in \mathbb {R}^{k-1}\), where \(a(u)\) is defined in (2.3) and \(\Vert \cdot \Vert \) is the \(\ell ^\infty \)-norm on \(\mathbb {R}^{k-1}\).
For our next proposition, we need some notation and preliminary results. First, we recall some further properties of the cut-off functions \(\eta _L\) constructed in [7]:
Proposition 3.6
([7], Lemma 4.11) There exists a constant \(c > 0\) such that
and for all \(q \ge 1\), \(f \in C^\infty (\mathbb {R}^d)\), and \(L > 0\),
Remark 3.7
The second inequality in Proposition 3.6 is not explicitly stated in [7]. However, Lemma 4.11 in [7] tells us that \(\Vert D_\eta \eta _L\Vert _{L^\infty (X)} \ll _\eta 1\), so the inequality in the proposition above follows after iterated use of the product rule for derivatives, in combination with Lemma 3.2 and the fact that the supports of the functions \(D_\eta \eta _L\) are still contained in \(\{ \alpha \ll L \}\) for every \(\eta \) (where the implicit constants are independent of L and \(\eta \)).
The following corollary concerning Sobolev norms of truncated Siegel transforms is now immediate.
Corollary 3.8
For all \(q \ge 1\), \(f \in C^\infty (\mathbb {R}^d)\), and \(L > 0\),
We also record the following corollary for future references. It is immediate from the inequalities in (3.11) and the first part of Proposition 3.6.
Corollary 3.9
For every compact set \(\mathcal {C}\subset {\text {SL}}_d(\mathbb {R})\), there is a constant \(B_{\mathcal {C}} > 0\) such that
Recall that \(A\simeq \mathbb {R}^{k-1}\) via the map \(u \mapsto a(u)\) defined in (2.3). Let us throughout the rest of the section denote by \(\Vert \cdot \Vert \) the \(\ell ^\infty \)-norm on \(\mathbb {R}^{k-1}\). The following theorem is a special case of [4, Theorem 1.1]. Roughly speaking, this theorem asserts that if \(\varphi \in C_c^\infty (X)\), then the family \(u \mapsto \varphi (a(u) \cdot )\) consists of "almost independent" random variables, at least if the u’s are far apart.
Theorem 3.10
(Theorem 1.1 in [4]) For every \(r \ge 2\), there exist \(q_r \ge 1\) and \(\delta _r > 0\) such that for all \(q \ge q_r\), \(\varphi _1,\ldots ,\varphi _r \in C^\infty _c(X)\), and \(u^{(1)},\ldots ,u^{(r)} \in \mathbb {R}^{k-1}\),
Theorem 1.1 in [4] is formulated for general r-tuples of elements in \(G = {\text {SL}}_d(\mathbb {R})\), and not just for r-tuples in \(A\). Furthermore, in the version in [4], the \(\min _{i \ne j}\)-expression is applied to differences with respect to an invariant Riemannian metric on G. The restriction of any such metric to \(A\) is quasi-isometric to the \(\ell ^\infty \)-distance on \(\mathbb {R}^{k-1}\), and the resulting constants are assumed to have been absorbed in \(\delta _r\) and by the \(\ll \)-sign.
3.4 Cumulants
We review the notion of cumulants, and a classical CLT-criterion due to Frechet and Shohat. In this subsection \((X,\mu )\) can be a general probability measure space.
Definition 3.11
(Cumulants) Fix \(r \ge 2\). Given \(\varphi _1,\ldots ,\varphi _r \in L^\infty (X)\), we define their cumulant \({{\,\textrm{cum}\,}}_r(\varphi _1,\ldots ,\varphi _r)\) of order r by
where \(\mathfrak {P}_{[r]}\) denotes the set of partitions of the set \([r] = \{1,\ldots ,r\}\). Given \(\Phi \in L^\infty (X)\), we define its r-cumulant \({{\,\textrm{cum}\,}}_r(\Phi )\) by
Remark 3.12
It is clear that \({{\,\textrm{cum}\,}}_{[r]}\) is multi-linear in the functions \(\varphi _1,\ldots ,\varphi _r\), and if one of them is a constant function, then \({{\,\textrm{cum}\,}}_{[r]}(\varphi _1,\ldots ,\varphi _r) = 0\) (see e.g. [23, Subsect. 3.1]). In particular,
and
Furthermore, the 2-cumulant of \(\Phi \) is just the \(\mu \)-variance of \(\Phi \).
The main property of cumulants that makes them valuable to us in this paper is summarized in the following CLT-criterion by Frechet and Shohat, which can be deduced from their results in [14]. It is essentially the classical method of moments tailored for (distributional) convergence to the normal distribution.
Proposition 3.13
(Frechet–Shohat’s cumulant criterion) Let \((\Psi _T)\) be a sequence of real-valued, bounded and measurable functions on X such that
-
\(\int _X \Psi _T\, d\mu =0,\)
-
the limit \(\sigma ^2 := \lim _{T} \Vert \Psi _T\Vert ^2_{L^2(X)}\) exists and is finite,
-
\({{\,\textrm{cum}\,}}_r(\Psi _T) \rightarrow 0\) for all \(r \ge 3\).
Then the \(\mu \)-distributions of \(\Psi _T\) converge in the sense of distribution to the Normal Law with mean zero and variance \(\sigma ^2\) (the case \(\sigma = 0\) is interpreted as convergence in the sense of distributions to the Dirac measure at 0).
Remark 3.14
There are no explicit mentioning of cumulants in the paper of Frechet and Shohat, so in particular Proposition 3.13 is not directly featured there. A more modern (and explicit) exposition of cumulants can be found in [23], although our formulation of Proposition 3.13 is not explicit there either. However, it is noted in [23, Subsect. 3.2] that cumulants of random variables can be expressed in terms of moments (and vice versa). By the classical method of moments, to prove that the \(\mu \)-distributions of \(\Psi _T\) converges in the sense of distributions to the centered Normal Law with variance \(\sigma ^2\) it suffices to check that all moments (or cumulants) of \(\Psi _T\) with respect to \(\mu \) converge (as real numbers) to the moments (or cumulants) of the centered Normal Law with variance \(\sigma ^2\). Since cumulants of a random variable can be expressed as logarithmic derivatives of the Fourier transform of the corresponding probability distribution (see e.g. [23, Subsect. 3.1]), it follows after some straightforward computations that Normal Laws are characterized as those probability distributions whose cumulants of order \(r \ge 3\) all vanish (at least within the class of distributions that are uniquely determined by their moments).
In order to apply this proposition, we have to analyze the cumulants \({{\,\textrm{cum}\,}}_r(\Psi _T)\). This task will be carried out in the next section.
3.5 Estimating cumulants of order \(r \ge 3\)
Let \(\Psi _T\) be defined by (3.10). Our goal is to show that under suitable additional conditions,
for all \(r\ge 3\). Since
this is equivalent to
Let us from now on fix \(r \ge 3\). For each r-tuples \(\underline{i}= (i_1,\ldots ,i_r) \in \mathcal {I}^r\), we set
and for \(y = (y_1,\ldots ,y_r) \in Y_{T,\underline{i}}\), we set
We write elements of \(Q_{T,\underline{i}}(y)\) as \(\underline{u}=(u^{(1)},\ldots , u^{(r)})\). Using the multi-linearity of the cumulants, we see that \({{\,\textrm{cum}\,}}_{r}(\Phi _{T})\) can be written as
We shall make the following additional assumptions regarding the data defining the function \(\Phi _T\). Throughout this section, \(\Vert \cdot \Vert \) denotes the \(\ell ^\infty \)-norm on \(\mathbb {R}^{k-1}\) and \(B(x,\gamma )\) the ball with respect to this norm.
-
(II.a)
There exist finite sets \(\widetilde{Q}_{T,i} \subset \mathbb {R}^{k-1}\) satisfying:
-
for all \(\gamma \ge 1\)
$$\begin{aligned} \big |\widetilde{Q}_{T,i} \cap B(u,\gamma )\big | \ll \gamma ^{k-1}, \end{aligned}$$(3.13)where the implicit constants are independent of u, T, and i.
-
\(\max _i |{\tilde{Q}}_{T,i}|\ll V_T\) with a parameter \(V_T\) satisfying \(V_T\rightarrow \infty \) as \(T\rightarrow \infty \).
-
-
(II.b)
There exist Borel maps \(\beta _{T,i} : \mathbb {R}^{k-1} \times Y_{T,i} \rightarrow \mathbb {R}^{k-1}\) such that
$$\begin{aligned} Q_{T,i}(y_i) = \beta _{T,i}\big (\widetilde{Q}_{T,i},y_i\big ) \end{aligned}$$satisfying:
-
there exist \(c_1, c_2 > 0\), independent of T, such that for all \(u,v \in \widetilde{Q}_{T,i}\),
$$\begin{aligned} \min _{i,j} \inf _{y_i \in Y_{T,i}} \inf _{y_j \in Y_{T,j}} \big \Vert \beta _{T,i}(u,y_i) - \beta _{T,j}(v,y_j)\big \Vert \ge c_1 \Vert u-v\Vert - c_2,\qquad \end{aligned}$$(3.14) -
there exist maps \({\widetilde{\beta }}_{T,i} : \mathbb {R}^{k-1} \rightarrow \mathbb {R}^{k-1}\) such that for all \(u \in \widetilde{Q}_{T,i}\),
$$\begin{aligned} \sup _{T} \sup _{y_i \in Y_{T,i}} \big \Vert \beta _{T,i}(u,y_i)-{\widetilde{\beta }}_{T,i}(u)\big \Vert < \infty . \end{aligned}$$(3.15)
-
-
(II.c)
For the functions \(f_{T,i}\) from (I.b), there exist Borel functions \(h_{T,i} : \mathbb {R}^d \times Y_{T,i} \rightarrow [0,\infty )\) such that
$$\begin{aligned} f_{T,i}\big (a(\beta _{T,i}(u,y_i))z,y_i\big ) \le h_{T,i}\big (a({\widetilde{\beta }}_{T,i}(u))z,y_i\big ) \end{aligned}$$for all \(u \in \widetilde{Q}_{T,i}\), \(y_i \in Y_{T,i}\), and \(z \in \mathbb {R}^d\). We further assume that the family of the functions
$$\begin{aligned} H_{T,i}(z) := \int _{Y_{T,i}} h_{T,i}(z,y_i) \, d\kappa _{T,i}(y_i) \end{aligned}$$is uniformly bounded, and there exists a fixed compact set \(\mathcal {K}' \subset \mathbb {R}^d\) such that
$$\begin{aligned} {{\,\textrm{supp}\,}}(H_{T,i}) \subset \mathcal {K}' \end{aligned}$$for all T and i.
Remark 3.15
We note that the condition (I.c) from Sect. 3.2 follows immediately from condition (II.a) and the first part of condition (II.b).
With this new notation, we set
where \(\widetilde{Q}_{T,\underline{i}} := \widetilde{Q}_{T,i_1} \times \cdots \times \widetilde{Q}_{T,i_r}\). Then
For \(\gamma > 0\), we define the r-diagonal \(\gamma \)-neighborhood \(\Delta _r(\gamma )\) by
We split the sum defining \(\Xi _{r,T,\underline{i}}\) into two subsums subdivided with respect to the set \(\Delta _r(\gamma )\). Namely, we choose a parameter \(\gamma _{T,r}\rightarrow \infty \), which will be specified later, and write
where \(\Xi ^{(1)}_{r,T,\underline{i}}(y)\) denotes the sum over clustered r-tuples
and \(\Xi ^{(2)}_{r,T,\underline{i}}(y)\) denotes the sum over separated r-tuples:
The aim in the upcoming subsections is to find conditions on the parameters \(\gamma _{T,r}\) and \(L_T\) such that for every \(\underline{i}= (i_1,\ldots ,i_r) \in \mathcal {I}^r\),
and
Together with the assumption (I.a) in Sect. 3.2, these estimates imply (3.12).
3.5.1 Analysis of the separated tuples
Now we prove the estimate (3.20) involving separated tuples. The crucial ingredient here is the estimates on higher-order correlations (Theorem 3.10), which allows us to establish an estimate on cumulants following our approach from [6].
We recall the estimate from Proposition 3.5(iii) that for every \(q \ge 1\), there exists \(\sigma _q > 0\) such that
We may without loss of generality assume that the map \(q \mapsto \sigma _q\) is increasing. Furthermore, we may also assume that the map \(r \mapsto \delta _r\) in Theorem 3.10 is decreasing. In particular, without loss of generality we can assume that
The following lemma is a corollary of the main technical results from our work [6].
Lemma 3.16
There is an integer \(q_r \ge 1\), such that for every integer \(q > q_r\), there exists a constant \(c_{r,q} > 0\), with the property that for every \(\gamma > 0\) and for all \(\varphi _1,\ldots ,\varphi _r \in C_c^\infty (X)\) and \(u^{(1)},\ldots ,u^{(r)} \in \mathbb {R}^{k-1}\) with
we have
Proof
The proof follows the argument in [6, Sec. 6.4]. Let us fix \(r \ge 2\), \(\gamma > 0\) and an integer \(q \ge 1\). We define parameters \(\beta _0=0\), \(\beta _1\),..., \(\beta _r\) recursively by \(\beta _{j+1} \delta _r - 3 r \sigma _q \beta _j = \gamma \). Then because of (3.21),
It is also clear from the recursive definition that
for a constant \(c_{r,q}>0\). Combining [6, Prop. 6.1] and [6, Prop. 6.2], we conclude that there is an integer \(q_r\) such that if \(q > q_r\), then
for all \(u^{(1)},\ldots ,u^{(r)}\in \mathbb {R}^{k-1}\) such that \(\max _{j \ne k} \Vert u^{(j)} - u^{(k)}\Vert > \beta _r\). Together with (3.22), this proves the lemma. \(\square \)
Now we apply Lemma 3.16 to estimate \(\Xi ^{(2)}_{r,T,\underline{i}}\), and deduce a criterion for (3.20). From now on \(q_r\) denotes the integer from Lemma 3.16.
Proposition 3.17
Let \(q_r\) be as in Lemma 3.16 and suppose that the parameters \(L_T\) and \(\gamma _{T,r}\) are chosen so that for some \(q > q_r\),
where \(c_1\) is the positive constant in condition (II.b), and \(c_{r,q}\) is given by Lemma 3.16. Then, for every \(\underline{i}= (i_1,\ldots ,i_r)\in \mathcal {I}^r\),
Proof
We first note that if \((u^{(1)},\ldots ,u^{(r)})\) belongs to \(\widetilde{Q}_{T,\underline{i}} \cap \Delta _r(\gamma _{T,r})^c\), then by condition (II.b), for all \(i_m,i_n \in \mathcal {I}\),
for all \(y_{i_m} \in Y_{T,i_m}\) and \(y_{i_n} \in Y_{T,i_n}\). Applying Lemma 3.16 with \(\gamma \) defined by \(c_1 \, \gamma _{T,r} - c_2 = c_{r,q} \gamma ,\) we deduce that
is estimated by
where we in the last \(\ll \)-sign have absorbed the \(e^{-c_2/c_{r,q}}\)-factor. We recall that
By Corollary 3.8,
where \(\mathcal {K}\subset \mathbb {R}^d\) is a fixed compact set which contains all of the supports of the functions \(x \mapsto f_{T,i}(x,y_i)\) as \(y_i\) ranges over \(Y_{T,i}\). We conclude that
This implies the proposition. \(\square \)
3.5.2 Analysis of the clustered tuples
Next, we deal with the clustered tuples. Our analysis here is one of the main novelties of this paper. We stress that we do not assume that the maps \(T \mapsto \Vert f_{T,i}\Vert _\infty \) are bounded (otherwise, our analysis could have been carried out as in [6]). This is also where the assumption (II.c) becomes crucial. This condition says roughly that the \(\kappa _{T,i}\)-integrals of \(f_{T,i}\) are bounded functions. The main purpose of this subsection is to explain how this "bounded on average"-condition can be used to derive (3.19).
Proposition 3.18
Suppose that the parameters \(L_T\) and \(\gamma _{T,r}\) satisfy for some \(\varepsilon >0\),
Then,
Proof
Expanding the definition of the cumulant in (3.17), we deduce that
We recall that
By condition (II.c), there exist Borel functions \(h_{T,i} : \mathbb {R}^d \times Y_{T,i} \rightarrow [0,\infty )\) such that
for all \(u \in \widetilde{Q}_{T,i}\), \(z\in {\mathbb {R}}^d\), and \(y_i\in Y_{T,i}\). Hence, setting
we deduce that
We recall that according condition (II.c), the function h is uniformly bounded and its support is contained in a fixed compact set. In particular, it follows from Lemma 3.2 that
By condition (II.b), there is a fixed compact set \(\mathcal {C}\subset A\) such that
By Corollary 3.9, there is a constant \(B=B({\mathcal {C}}) > 0\) such that
whence
Combining the above estimates, we conclude that
where \(\psi _T\) is defined by
Therefore, we deduce from (3.25) that
We observe that it follows from (3.26), (3.27), and Lemma 3.3 that
In particular, it also follows that for \(p\ge d\),
According to the general Hölder inequality, for exponents \(p_k\in (1,\infty ]\) satisfying \(\sum _{k} 1/p_k=1\),
Therefore, when \(|I|<d\),
and when \(|I|\ge d\),
We conclude that for every partition \(\mathcal {P}\),
and from (3.25),
Since
it follows from condition (II.a) that
whence
for all \(\varepsilon >0\), which implies the assertion of the proposition. \(\square \)
3.6 Main result
In this section, we finally prove convergence in distribution of the functions
where
We recall that the data in this formula satisfy the conditions (I.a)–(I.c) and (II.a)–(II.c). We further put an additional condition on the norms of the functions \(f_{T,i}\), using the notation introduced in (3.2)–(3.3).
The main result of Sect. 3 is the following theorem:
Theorem 3.19
Suppose that
-
There exists \(\theta _0 > 0\) such that
$$\begin{aligned} M_{T} = O\left( V_T^{\theta _0}\right) . \end{aligned}$$ -
For \(q \ge 1\), there exists \(\theta _q > 0\) such that
$$\begin{aligned} M_{T,q} = O\left( V_T^{\theta _q}\right) . \end{aligned}$$ -
The limit
$$\begin{aligned} \sigma :=\lim _{T\rightarrow \infty } \Vert \Upsilon _T\Vert _{L^2(X)} \end{aligned}$$exists and is finite.
If \(d > 4(1 + \theta _0)\), then the functions \(\Upsilon _T\) on \((X,\mu )\) converge in distribution to the Normal Law with variance \(\sigma \).
Proof
We shall use Proposition 3.13. We recall that by Lemma 3.1, the functions \(\widehat{F}_T\) can be approximated by functions
so that
This implies that the functions
satisfy
Then, in particular, \(\lim _{T\rightarrow \infty } \Vert \Psi _T\Vert _{L^2(X)}=\sigma \). It also follows that if \(\Psi _T\) converges in distribution to the Normal Law, so does \(\Upsilon _T\). Hence, it remains to verify that the conditions of Proposition 3.13 hold for the functions \(\Psi _T\), namely, that
Since the later cumulant can be expressed as (3.16), this will follow from Propositions 3.17 and 3.18.
Now it remains to choose the parameters \(L_T\) and \(\gamma _{T,r}\) so that the conditions in Lemma 3.1, Propositions 3.17, and 3.18 are satisfied. To do this, we shall take
where \(\rho \) and \(M_r\) are positive real numbers, which will be chosen later. The condition (3.8) in Lemma 3.1 is satisfied if \(\rho \) is chosen so that for some \(\varepsilon >0\)
or equivalently, if
We write \(q_r\) for the index introduced in Lemma 3.16 and fix an integer \(q > q_r\). The condition (3.23) in Proposition 3.17 is satisfied if
which can always be arranged by choosing \(M_r\) large enough, depending on \(r,\rho , d\). Finally, the condition (3.24) in Proposition 3.18 is satisfied if we choose the constants \(\rho \) and \(M_r\) such that for some \(\varepsilon >0\),
This holds provided that
Hence, it is sufficient to choose \(\rho \) so that both (3.31) and (3.32) hold for all \(r\ge 3\). This is possible provided that
Since \(\varepsilon > 0\) is arbitrary, this argument works provided that \(d > 4 + 4 \theta _0\). \(\square \)
Remark 3.20
In order to proceed with the proof above it is sufficient to have that
and
According to Lemma 3.1, condition (3.33) holds under assumption (3.9). This assumption is weaker than (3.8), so that we can replace (3.31) by the assumption
Then the argument can be carried out when \(d > 2(1 + \theta _0)\), provided that we can establish (3.34) independently.
4 Proof of the main theorem
In this section, we prove our main theorem (Theorem 1.3). We recall that our goal is to analyze the lattice counting function for the domains
Ultimately, we will construct an approximation of the characteristic function \(\chi _{\Omega _T}\) by functional averages of the form (2.4) and show that these functional averages satisfy the assumptions of Theorem 3.19, so that Theorem 1.3 will be a consequence of Theorem 3.19. This is a tedious and rather technical task, so it might be beneficial for the reader to first take a look in Sect. 4.7, where the main objects of the section are summarized, and the most important verifications are indexed.
4.1 A basic reduction
Let \(L_j : \mathbb {R}^{d} \rightarrow \mathbb {R}^{d_j}\) with \(j=1,\ldots ,k\), \(I\subset (0,\infty )\), and \(B \subset \mathbb {S}_{\underline{d}}\) be the objects defining the sets \(\Omega _T\). We also consider the basic domains
where
Then \(\Omega _T = L^{-1}(\Omega ^0_T)\) for the invertible linear map \(L=(L_1,\ldots ,L_k)\). Let us write \(L=cL_0\) with \(c\in \mathbb {R}^\times \) and \(\det (L_0)=1\). Then
Therefore, for any lattice \(\Lambda \),
and
Since the measure on the space of lattices is invariant under \(L_0\), it is sufficient to analyze the distribution of the function \(\Lambda \mapsto | \Lambda \cap \Omega ^0_T| - \hbox {Vol}(\Omega ^0_T)\).
From now on we assume that the sets \(\Omega _T=\Omega _T(I,B)\) are defined by (4.2), where I is a non-empty bounded interval in \((0,\infty )\), and B is a Borel subset of \(\mathbb {S}_{\underline{d}}\) with positive measure.
4.2 A coodinate system
The sets \(\Omega _T\) are more conveniently studied in a different coordinate system which we now introduce. We use notations
Let
where
It is readily checked that the map \(\pi \) is equivariant with respect to the group A defined in (2.3) in the following sense:
and that the inverse map \(\pi ^{-1}\) is given by
If one computes the Jacobian of this inverse map, the following lemma emerges:
Lemma 4.1
For every bounded Borel function \(f : \mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}} \rightarrow \mathbb {R}\) with bounded support,
Here dz denote the volume element on \(\mathbb {R}^d\) which assigns volume one to the unit cube, du is the volume element on \(\mathbb {R}^{k-1}\) such that the unit cube in \(\mathbb {R}^{k-1}\) has volume one, and the measure \(\kappa \) is defined in (1.5).
Let us now write out the set \(\Omega _T\) in \((u,s,\xi )\)-coordinates. We define
and given a point z in \(\mathbb {R}_*^{\underline{d}}\), we set
Then \(z \in \Omega _T\) if and only if
We now set \(v_j = u_j - \log T\) for \(j = 1,\ldots ,k-1\). Then, the above conditions on u are equivalent to
For \(s < d \log T\), we let \(\delta _T(s)\) denote the diagonal \((k-1) \times (k-1)\)-matrix whose diagonal elements \(\delta _{T,j}(s)\) are given by
We note that since the interval I is bounded, the inequality \(s < d \log T\) is satisfied for all \(x \in \Omega _T(I,B)\) when \(T> e^{\sup (I)/d}\). Then (4.7) can be re-written as
Let
and
We conclude that
when \(T> e^{\sup (I)/d}\).
4.3 Volume and variance computations
The above parametrization of \(\Omega _T\) leads, in particular, to an an easy computation of its volume, and the mean and the variance of the Siegel transforms \({{\widehat{\chi }}}_{\Omega _T}\).
Lemma 4.2
There exists a polynomial \(P_{I,B}\) such that
where
such that
for all \(T> e^{\sup (I)/d}\).
Proof
It follows from (4.9) and Lemma 4.1 that
If we expand the inner parenthesis and integrating term-wise, we deduce that \({{\,\textrm{Vol}\,}}(\Omega _T) = P_{I,B}(\log T)\) for the polynomial
The leading term of this polynomial is \(c_{k-1}(I,B)t^{k-1}\) with
which finishes the proof of the lemma. \(\square \)
From (2.2), we also obtain that
To compute the variance of the Siegel transform, we need the following
Theorem 4.3
(Rogers’ mean-square value theorem, [24]) Let \(d \ge 3\) and let \(f : \mathbb {R}^d \rightarrow \mathbb {R}\) be a bounded and non-negative Borel measurable function with bounded support. Then \(\widehat{f} \in L^{2}(X)\) and
where \(\zeta \) denotes the Riemann zeta-function.
For a future reference, we also note that a straightforward application of the Cauchy-Schwarz inequality to the expression in Theorem 4.3 yields the following corollary:
Corollary 4.4
If \(d \ge 3\) and \(f : \mathbb {R}^d \rightarrow \mathbb {R}\) is a bounded and non-negative Borel measurable function with bounded support, then
Now using Theorem 4.3, we compute the variance:
Corollary 4.5
Proof
By Theorem 4.3,
If we split this sum into sums over \(\{p = q\}\) and \(\{p \ne q\}\) and use the symmetry of p and q and the formula \({{\,\textrm{Vol}\,}}(q^{-1}\Omega _T) = q^{-d}{{\,\textrm{Vol}\,}}(\Omega _T)\) for every \(q \ge 1\), we see that this sum can be written as
We observe that for \(c,T>0\), \(I\subset (0,\infty )\), and \(B \subset \mathbb {S}_{\underline{d}}\),
and for \(T_1,T_2>0\), \(I_1, I_2 \subset (0,\infty )\), and \(B_1, B_2\subset \mathbb {S}_{\underline{d}}\),
Hence, we deduce from Lemma 4.2 that for every \(c\ge 1\),
Then since we are assuming that \(d\ge 3\), we can apply the Dominated Convergence Theorem to conclude that the limit \(\sigma ^2\) exists and
This implies the stated formula. \(\square \)
4.4 Tessellations of the sets \(\Omega _T(I,B)\)
In this subsection, we construct, for all large enough T, a functional tiling of the indicator function \(\chi _{\Omega _T}\) using the coordinate system introduced in the previous section. This tiling will be the basis for our smooth approximation scheme later. Before we can state our main observation (Corollary 4.10) of this subsection, we need some preliminaries. For a positive integer N, we define
and set
We note that this definition of \(\mathcal {S}_1\) coincides with the one given in (4.8) above. Geometrically, \(\mathcal {S}_1\) and \(\mathcal {S}_2\) are the lower and upper pieces of the unit cube \((-1,0]^k\) in \(\mathbb {R}^{k-1}\) cut in half by the hyperplane \(u_1 + \cdots + u_{k-1} = -1\). Furthermore, we define
The next lemma tells us that \(\mathcal {S}(N)\) can be tesselated by translates of \(\mathcal {S}_1\) by vectors in \(P_{N,1}\) and by translates of \(\mathcal {S}_2\) by elements of \(P_{N,2}\). We stress that while the sets of integer vectors \(P_{N,1}\) and \(P_{N,2}\) are not disjoint, the translates of \(\mathcal {S}_1\) and \(\mathcal {S}_2\) by vectors in the respective sets are disjoint.
Lemma 4.6
For every positive integer N,
In particular,
Proof
Fix \(u \in \mathcal {S}(N)\), and note that since \(-N \le u_j \le 0\) for all j, there are unique integers \(0 \le n_j \le N\) such that
and thus either \(w \in \mathcal {S}_1\) or \(w \in \mathcal {S}_2\), whence \(u \in \mathcal {S}_{i} - n\) for either \(i = 1,2\). Clearly these are disjoint events, so in particular,
which finishes the proof. \(\square \)
We observe that in view of (4.9) the sets \(\Delta _T\) are related to suitable dilations of the sets \(\mathcal {S}(N)\). Indeed, for T and s with \(s < d \log T\), we let
denote the diagonal \((k-1) \times (k-1)\)-matrix with the positive diagonal entries
then
Therefore, applying Lemma 4.6 to \(\mathcal {S}(\lfloor \log T \rfloor )\), we get the following “functional tiling” for the characteristic function \(\chi _{\Delta _T}\).
Lemma 4.7
For all \((u,s,\xi ) \in \mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}}\) with \(s < d\log T\),
In particular, for all \(T> e^{\sup (I)/d}\), this identity holds everywhere.
4.5 Construction of a functional tiling
Now we construct our functional tiling, namely, the objects satisfying conditions (I.a)–(I.c) and (II.a)–(II.c) with \(V_T:={{\,\textrm{Vol}\,}}(\Omega _T)\).
4.5.1 Construction of the sets \({\widetilde{Q}}_{T,i}\), \(Q_{T,i}(y)\) and maps \(\beta _{T,i}\), \({\widetilde{\beta }}_{T,i}\) (assumptions (II.a)–(II.b))
Let us now rewrite the assertion of Lemma 4.7, so that it fits the decomposition (2.4). We note that
uniformly on s in compact sets, where
We define
by
for \(u \in \mathbb {R}^{k-1}\) and \(s \in \mathbb {R}\). Let
From Lemmas 4.2 and 4.6, we see that \(|\widetilde{Q}_{T,i}| \ll {{\,\textrm{Vol}\,}}(\Omega _T).\) The condition (3.13) in (II.a) can be also checked easily. The following lemma verifies condition (II.b). We recall that \(\Vert \cdot \Vert \) denotes the \(\ell ^\infty \)-norm on \(\mathbb {R}^{k-1}\).
Lemma 4.8
Let \(J \subset \mathbb {R}\) be a bounded interval.
-
(i)
There exist \(c_1,c_2>0\) such that for all \(T\ge T_0(J)\), \(s_1,s_2 \in J\), and \(u,v \in \widetilde{Q}_{T,i}\),
$$\begin{aligned} \big \Vert \beta _{T}(u,s_1) - \beta _{T}(v,s_2)\big \Vert \ge c_1 \Vert u-v\Vert -c_2. \end{aligned}$$ -
(ii)
There exists \(c_3>0\) such that for all \(T\ge T_0(J)\), \(s \in J\), and \(u \in \widetilde{Q}_{T,i}\),
$$\begin{aligned} \big \Vert \beta _T(u,s) - {\widetilde{\beta }}_T(u)\big \Vert \le c_3. \end{aligned}$$
Proof
Since \(\Vert u\Vert \ll \log T\) for all \(u \in \widetilde{Q}_{T,i}\), this lemma follows immediately from (4.12) and the definitions of the maps \(\beta _T\) and \(\tilde{\beta }_T\). \(\square \)
Remark 4.9
While in Sect. 2 we have allowed \(\beta _{T}\) and \({\widetilde{\beta }}_{T}\) to also depend on i, it is not necessary at this point. However, to properly work with these functions in our setting, we also need to define the finite measure spaces \((Y_{T,i},\kappa _{T,i})\), for \(i= 1,2\). This will be done in the next section.
Let us now rewrite the decomposition in Lemma 4.7 using the standard coordinates. We set
and
for \(i =1,2\), and note that the assertion in the lemma above can be written as
for all large enough T. Let us now set
Since \(\chi _{\Omega _T} = \chi _{\Delta _T} \circ \pi \), the equivariance (4.5) of \(\pi \) yields the following corollary of Lemma 4.7:
Corollary 4.10
For all large enough T,
We stress that the summation range in the above formula depend on the point z, albeit in a weak way via \(s(z)\). In the next subsection, we will get rid of this z-dependence upon introducing an additional average. The price we have to pay for this is that the functions \(h_{T,i}\) will be replaced with more complicated functions \(f_{T,i}\), which depend on the an extra variable, coming from the average.
4.5.2 Construction of the spaces \((Y_{T,i},\kappa _{T,i})\) and functions \(f_{T,i}\) (assumptions (I.a)–(I.b))
If \(\mathcal {T}\subset \mathbb {R}^{k-1}\) is a subset and \(r \ge 0\), we denote by \(\mathcal {T}_r\) the r-thickening of \(\mathcal {T}\) with respect to this norm. Similarly, for a subset B of \(\mathbb {S}_{\underline{d}}\), we denote by \(B_r\) the r-thickening of B with respect to the rotation-invariant metric on \(\mathbb {S}_{\underline{d}}\).
Since \(|v| \ll \log T\) for every \(v \in \widetilde{Q}_{T,i}\), it follows from (4.12) that for any bounded interval \(J \subset \mathbb {R}\), there exist \(c(J)>0\) such that for all \(s,t \in J\), \(T \ge T_0(J)\), and \(v \in \widetilde{Q}_{T,i}\),
Hence, we deduce that for all \(s,t \in J\) satisfying \(|s-t| \le r\), \(T \ge T_0(J)\), \(u\in {\mathbb {R}}^{k-1}\), and \(v \in \widetilde{Q}_{T,i}\),
Let us now introduce a parameter \(\varepsilon \in (0,1)\) and a non-negative real smooth function \(\rho _\varepsilon \) on \(\mathbb {R}\) with
For future reference, we also note that \(\rho _\varepsilon \) can be chosen, so that
By the standard properties of convolutions,
Then, using (4.17), we deduce that for every \(u\in {\mathbb {R}}^{k-1}\) and \(v \in \widetilde{Q}_{T,i}\),
where \(c=c(J)>0\) for a fixed bounded interval J which contains \((\log I)_\varepsilon \) for all \(0< \varepsilon < 1\). Let \(\psi _{i,\varepsilon }\) be a smooth function on \(\mathbb {R}^{k-1}\) such that
and let \(\vartheta _\varepsilon \) be a smooth function on \(\mathbb {S}_{\underline{d}}\) such that
For future reference, we note that these functions can be constructed, so that
From the above estimate, we deduce that for every \(u\in {\mathbb {R}}^{k-1}\) and \(v \in \widetilde{Q}_{T,i}\),
By the same argument as in (4.17), we also have for all \(s,t \in J\) satisfying \(|s-t| \le \varepsilon \), \(T \ge T_0(J)\), \(u\in {\mathbb {R}}^{k-1}\), and \(v \in \widetilde{Q}_{T,i}\),
Then it follows from (4.20) and (4.21) that
and
We introduce a parameter \(\varepsilon _T\in (0,1)\), to be specified later, and define
For \(y \in Y_{T}\), we set
and consider
It follows from (4.23) that for every \(u\in {\mathbb {R}}^{k-1}\) and \(v \in \widetilde{Q}_{T,i}\),
Let
Then it follows from (4.25) that
We conclude that
The estimate indicates that \(\widetilde{F}_T\) provides an approximation for the characteristic function \(\chi _{\Delta _T}\). Let us now define \(f_{T,i} : \mathbb {R}^d \times \mathbb {R}\rightarrow [0,\infty )\) by
and \(f_{T,i}(z,y) := 0\) for all \(z \in \mathbb {R}^d {\setminus } \mathbb {R}_*^{\underline{d}}\). Then \(f_{T,i}\) is smooth in the z-coordinate. We also set
From (4.5) we see that the function \(F_T\) can be written as
which is exactly the form of functional tiling analyzed in Sect. 3.
The following lemma demonstrates that the function \(F_T\) proves a good approximation for the characteristic function \(\chi _{\Omega _T}=\chi _{\Delta _T}\circ \pi \).
Lemma 4.11
Let \(p \ge 1\). For \(\varepsilon _T = {{\,\textrm{Vol}\,}}(\Omega _T)^{-\eta }\) with \(\eta >p/2\), then
Proof
We shall use the integral formula from Lemma 4.2. From (4.29),
We recall that \(\chi ^+_{\Delta _T}\) and \(\chi _{\Delta _T}\) are given by (4.28) and (4.16) respectively. By successive use of the triangle-inequality, this expression is less than \(A_1 + A_2\), where
with
Since
uniformly over \(s\in J\) and sufficiently large T, we conclude that \(A_{i,1}(v)\ll \varepsilon _T^{1/p}\) uniformly over v. Also since
uniformly over \(s\in J\) and sufficiently large T, and
we deduce that \(A_{i,2}(v)+A_{i,3}(v)\ll \varepsilon _T^{1/p}\) uniformly on v. Therefore,
Hence, when \(\varepsilon _T = {{\,\textrm{Vol}\,}}(\Omega _T)^{-\eta }\) with \(\eta >p/2\), we have \(\Vert \chi _{\Omega _T} - F_T\Vert _{L^p} = o\big ({{\,\textrm{Vol}\,}}(\Omega _T)^{1/2}\big ).\) \(\square \)
4.5.3 Construction of the maps \(h_{T,i}\) (assumption (II.c))
Let us now turn to the construction of the maps \(h_{T,i}\) satisfying the condition (II.c). We recall that \(h_{T,i}\) should be non-negative Borel functions on \(\mathbb {R}^d \times Y_{T,i}\) satisfying
for all \(v \in \widetilde{Q}_{T,i}\), \(z \in \mathbb {R}^d\), and \(y \in Y_{T,i}\). Moreover, we arrange that the supports the functions \(x \mapsto h_{T,i}(x,y)\) lie in a fixed compact set, independent of \(y \in Y_{T}\), and
We shall use the coordinate system (4.4). Then in view of (4.30), it is sufficient to construct non-negative Borel functions \(\widetilde{g}_{T,i}\) on \((\mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}}) \times Y_T\) such that
for all \(v \in \widetilde{Q}_{T,i}\) and \((u,s,\xi ) \in \mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}}\) and \(y \in Y_{T}\), whose supports lie in a set \(\mathcal {K}\times Y_{T,i}\), with a fixed compact \(\mathcal {K}\subset \mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}}\), and such that
Indeed, if such maps have been constructed, we can simply set \(h_{T,i} = \widetilde{g}_{T,i} \circ \pi \). We recall from (4.27) that
where \(\psi _{i,\varepsilon _T}\) satisfies
By Lemma 4.8(ii), there is a compact set \(\mathcal {D}_0 \subset \mathbb {R}^{k-1}\) such that
Furthermore, by the construction of the map \(\tau _T\) in (4.11), there exists a compact set \(\mathcal {D}\subset \mathbb {R}^{k-1}\) such that
Hence, for all \(s \in J\), \(u\in \mathbb {R}^{k-1}\), \(v \in \widetilde{Q}_{T,i}\), \(y\in Y_T\), and sufficiently large T,
Let us now define
Then the estimate (4.33) clearly holds. Furthermore,
which is clearly compactly supported and bounded, uniformly in T.
4.6 Estimation of the function norms
In order to apply our general result from the previous section (Theorem 3.19), We have to estimate the norms of the functions \(f_{T,i}\), specifically, the quantities \(M_{T}\) and \(M_{T,q}\) defined in (3.2)–(3.3).
Lemma 4.12
For the functions \(f_{T,i}\) defined in (4.30),
with \(r_q>0\).
Proof
We use that \(f_{T,i}(\cdot , y) = \widetilde{f}_{T,i}(\cdot ,y) \circ \pi \), and the maps \(\widetilde{f}_{T,i}(\cdot ,y)\) are supported in a fixed compact subset of \(\mathbb {R}^{k-1} \times \mathbb {R}\times \mathbb {S}_{\underline{d}}\), which is independent of \(y \in Y_{T,i}\). Then the restrictions to this compact set of all partial derivatives of the map \(\pi \) are uniformly bounded. Therefore, it is sufficient to estimate
We recall from (4.27) that
According to (4.20), (4.19), and (4.21),
Hence, we conclude that \(\big \Vert \widetilde{f}_{T,i}(\cdot ,y)\big \Vert _{C^0}\ll \varepsilon _T^{-1}.\) This proves the first estimate. Using additionally (4.22), we conclude that also \(\big \Vert \widetilde{f}_{T,i}(\cdot ,y)\big \Vert _{C^q}\ll \varepsilon _T^{-r_q}\) for some \(r_q>0\), which implies the second estimate. \(\square \)
4.7 Proof of Theorem 1.3
Let us now summarize what we have done in this technical section. The aim has been to produce smooth approximations \(F_T\) for the indicator functions \(\chi _{\Omega _T}\) to which the arguments of Sect. 3 apply. These approximations are given explicitly in (4.32). They are integrals of varying averages which are fibered over the finite measure spaces
These averages are constructed using finite subsets \(\widetilde{Q}_{T,i} \) and \({Q}_{T,i}(y)\) of \(\mathbb {R}^{k-1}\), defined in (4.14) and (4.15), and Borel maps \(\beta _T : \mathbb {R}^{k-1} \times Y_T \rightarrow \mathbb {R}^{k-1}\) and \({\widetilde{\beta }}_T : \mathbb {R}^{k-1} \rightarrow \mathbb {R}^{k-1}\), defined in (4.13). The approximations \(F_T\) depend on a choice of a parameter \(\varepsilon _T\), which we take \(\varepsilon _T = {{\,\textrm{Vol}\,}}(\Omega _T)^{-\eta }\) for some \(\eta > 0\). In order for these approximations to be useful for us, we arrange that
According to Lemma 4.11, one can take \(\eta > 1\). Then (4.34) holds. The averages are further made up by Borel functions \(f_{T,i} : \mathbb {R}^d \times Y_T \rightarrow [0,\infty )\), which are defined in (4.27) and (4.30). These functions are smooth in the first variable, but unbounded as \(T \rightarrow \infty \). They are however "bounded on average", in the sense that there are Borel functions \(h_{T,i} : \mathbb {R}^d \times Y_T \rightarrow [0,\infty )\) defined in Sect. 4.5.3. Ultimately, this provides the framework outlined in (I.a)–(I.c) and (II.a)–(II.c) from Sect. 3, so that we can apply Theorem 3.19 with \(V_T=\hbox {Vol}(\Omega _T)\). The conditions on the norms \(M_T\) and \(M_{T,q}\) have been verified in Lemma 4.12 with \(\theta _0=\eta >1\). We recall that the limit
has been computed in Corollary 4.5. In view of (4.34), it follows from Corollary 4.4 that
Hence, we conclude that also
Now we have verified all the assumptions of Theorem 3.19.
We conclude that the functions \(V_T^{-1/2}\big (\widehat{F}_{T} - \int _{X} \widehat{F}_{T}d\mu \big )\) converge in distribution to the Normal Law with variance \(\sigma \) when \(d>4(1+\eta )\) with some \(\eta >1\), namely, when \(d\ge 9\). Because of (4.35), the functions
also converge in distribution to the same limit.
References
Athreya, J., Ghosh, A., Tseng, J.: Spiraling of approximations and spherical averages of Siegel transforms. J. Lond. Math. Soc. 91(2), 383–404 (2015)
Beck, J.: Randomness in Lattice Point Problems. Combinatorics, Graph Theory, Algorithms and Applications. Discrete Math. 229(1–3), 29–55 (2001)
Beck, J.: Probabilistic Diophantine Approximation. Randomness in Lattice Point Counting. Springer Monographs in Mathematics. Springer, Cham (2014)
Björklund, M., Einsiedler, M., Gorodnik, A.: Quantitative multiple mixing. J. Eur. Math. Soc. 22(5), 1475–1529 (2020)
Björklund, M., Gorodnik, A.: Central limit theorems in the geometry of numbers. Electron. Res. Announc. Math. Sci. 24, 110–122 (2017)
Björklund, M., Gorodnik, A.: Central limit theorems for groups actions which are exponentially mixing of all orders. J. Anal. Math. 141(2), 457–482 (2020)
Björklund, M., Gorodnik, A.: Central limit theorems for diophantine approximants. Math. Ann. 374(3–4), 1371–1437 (2019)
Dolgopyat, D., Fayad, B.: Deviations of ergodic sums for toral translations I. Convex bodies. Geom. Funct. Anal. 24(1), 85–115 (2014)
Dolgopyat, D., Fayad, B.: Limit theorems for toral translations. Hyperbolic dynamics, fluctuations and large deviations, 227–277, Proceedings of Symposium Pure Mathematics, 89, American Mathematical Society, Providence, RI (2015)
Dolgopyat, D., Fayad, B.: Deviations of Ergodic Sums for Toral Translations II. Boxes. Publ. Math. Inst. Hautes Etudes Sci. 132, 293–352 (2020)
Dolgopyat, D., Fayad, B., Vinogradov, I.: Central Limit Theorems for Simultaneous Diophantine Approximations. J.Éc. Polytech. Math. 4, 1–36 (2017)
Einsiedler, M., Margulis, G., Venkatesh, A.: Effective results for closed orbits of semisimple groups on homogeneous spaces. Invent. Math. 177, 137–212 (2009)
Eskin, A., Margulis, G., Mozes, S.: Upper bounds and asymptotics in a quantitative version of the Oppenheim conjecture. Ann. Math. (2) 147(1), 93–141 (1998)
Fréchet, M., Shohat, J.: A proof of the generalized second-limit theorem in the theory of probability. Trans. Am. Math. Soc. 33(2), 533–543 (1931)
Hardy, G.H., Littlewood, J.E.: Some problems of diophantine approximation: the lattice points of a right-anled triangle: Parts I and II. Proc. Lond. Math. Soc. (2), 20, 15–36; Abh. Math. Sem. Hamburg, 1, 212–249 (1922)
Hlawka, E.: Uber Integrale auf konvexen Körpern I. Monatsh. Math. 54, 1–36 (1950)
Ivic, A., Krätzel, E., Kühleitner, M., Nowak, W.G.: Lattice points in large regions and related arithmetic functions: recent developments in a very classic topic. Elementare und analytische Zahlentheorie, 89–128, Schr. Wiss. Ges. Johann Wolfgang Goethe Univ. Frankfurt am Main, 20, Franz Steiner Verlag Stuttgart, Stuttgart (2006)
Kelmer, D.: On the mean square of the remainder for the Euclidean lattice point counting problem. Israel J. Math. 221, 637–659 (2017)
Kesten, H.: Uniform distribution mod 1. Ann. Math. 71, 445–471. Acta Arith. 7(1961/1962), 355–380 (1960)
Khintchine, A.: Ein Satz über Kettenbrüche, mit arithetischen Anwendungen. Math. Zeitschrift 18, 289–306 (1923)
Krätzel, E.: Lattice Points. Mathematics and its Applications (East European Series), 33. Kluwer Academic Publishers Group, Dordrecht. 320 pp (1988)
Levin, M.: On the Gaussian limiting distribution of lattice points in a parallelepiped. Unif. Distrib. Theory 11(2), 45–89 (2016)
Peccati, G., Taqqu, M.S.: Wiener Chaos: Moments, Cumulants and Diagrams. A Survey with Computer Implementation. Supplementary material available online. Bocconi & Springer Series, 1. Springer, Milan; Bocconi University Press, Milan, 2011. xiv+274 pp
Rogers, C.A.: Mean values over the space of lattices. Acta Math. 94, 249–287 (1955)
Schmidt, W.M.: A metrical theorem in geometry of numbers. Trans. Am. Math. Soc. 95, 516–529 (1960)
Schmidt, W.M.: Asymptotic formulae for point lattices of bounded determinant and subspaces of bounded height. Duke Math. J. 35, 327–339 (1968)
Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46, 340–347 (1945)
Skriganov, M.M.: Ergodic theory on SL(n), Diophantine approximations and anomalies in the lattice point problem. Invent. Math. 132(1), 1–72 (1998)
Acknowledgements
The authors are grateful for the hospitality shown by the departments of Mathematics at Bristol University, Chalmers University and University of Zürich, where most of this work was done. The first author also acknowledges financial support from GoCas Young Excellence grant 11423310 until December 2018, and from the grant VR M Björklund 20-23 from the Swedish Research Council from January 2020. The second author was supported by SNF grant 200021–182089.
Funding
Open access funding provided by Chalmers University of Technology.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Björklund, M., Gorodnik, A. Central limit theorems for generic lattice point counting. Sel. Math. New Ser. 29, 12 (2023). https://doi.org/10.1007/s00029-022-00815-w
Accepted:
Published:
DOI: https://doi.org/10.1007/s00029-022-00815-w