Ergodic Deviations of Degenerate Multidimensional Actions - Convex Bodies
Abstract. We prove that the ergodic deviation of a degenerate -action on the torus relative to a symmetric, strictly convex body can be decomposed into two parts, and that each part admits a limit distribution after choosing a suitable normalizer. Specifically, the first part is similar to an ergodic sum of smooth observables after being normalized by , and the second part is similar to the case of a random toral translation, i.e., the -action, but with a normalizer of . The key difference is that we employ the product flow on the product space of lattices for the multidimensional action.
1 INTRODUCTION
In a -dimensional torus, given a translation vector , we can consider the dynamical system , where is the Haar measure on , and is the translation from defined by , in the sense of modulo 1 for each coordinate. In this dynamical system, ergodic theory states that for every irrational translation, the number of visits inside a measurable set before time has a ratio conveging to the measure of the set . One object of interest is the discrepancy function defined as the difference of the actual visits before time and the expected visits . In dimension 1, Kesten [6, 7] proved that the discrepancy function for the circle rotation relative to an interval converges to a standard Cauchy distribution after being normalized by .
There are different ways to extend this result to higher dimensions, one way is to study the random toral translation relative to higher dimensional counterparts of the interval, such as balls (analytic convex bodies) and boxes, both of which were studied by Dolgopyat and Fayad in [4, 3]. They showed that -dimensional boxes behave similarly to 1-dimensional intervals, i.e., the discrepancy function also converges to a Cauchy distribution after normalized by . As for balls, they showed that the discrepancy function converges to a distribution function defined over the product space of infinite tori and the homogeneous space with the normalizer . Their proof consists of a combination of harmonic analysis of the discrepancyβs Fourier series, probability, and an important ingredient is the equidistribution of locally unstable submanifolds over the whole space of unimodular lattices.
In this paper, we follow a similar approach as Dolgopyat and Fayad, but instead of translations, we will consider the degenerate action in dimension (see the definition below), we restrict the set to be strictly convex, symmetric, and analytic bodies . Given a convex body , we denote the rescaled bodies with ratio by the homothety centered at the origin, where so that can fit inside the unit cube of . Let be the action vector, we consider the following discrepancy function:
(1 .1) |
where is the indicator function of the set .
We will show that by decomposing the discrepancy function into components, each component would admit a limit distribution after a suitable normalization, specifically:
(1 .2) |
where represents the part of the Fourier series of with coefficients of non-zero coordinate(s), whose definitions will be clearer after we introduce the Fourier series of in Section 3.
Our main result is the following:
Theorem 1.
Let be a symmetric, strictly convex analytic body that fits inside the unit cube of , and , defined as in (1 .1) and (1 .2), there exists a limit distribution for each after a suitable normalization, specifically, we have 2 distinct cases:
(a) For , assume that are uniformly distributed in , then for every fixed , there exists a function , such that as ,
in distribution, where is uniformly distribtuted on .
(b) For , assume that are uniformly distributed in , and denote the normalized Lebesgue measure on , then there exists a distribtuion function such that for any , we have
(1 .3) |
The explicit forms of will be given in Proposition 2.2 of Section 2.
Remark.
This paper is organized as follows: Section 2 will present the explicit form of the distribution functions. In Section 3 we will prove the limit distribution of the easier part of the discrepancy function . Sections 4 to 6 are devoted to the general d-dimensional counterpart of the sum , we give a detailed description of the sum in terms of short vectors of the lattice spaces, and how the variables become independent as . Section 4 obtains the main part of the sum that contributes to the discrepancy by using harmonic analysis. Section 5 introduces the space of lattices and express the discrepancy in the language of lattices. Section 6 shows the variables in the expression of Section 5 become independent as .
2 LIMIT DISTRIBUTIONS
2.1 Limit Dstribution for the case .
Proposition 2.1.
If is an analytic symmetric strictly convex body in , then we have
where
when and when , where represent the th Fourier coefficient of , the specific form of which is shown in (3 .1).
2.2 Limit Distribution for the case .
Notations. Let denote the space of 2-dimensional unimodular lattices of . . Given we denote by the shortest vector in , and the shortest vector in among those who have the shortest nonzero projection on the orthocomplement of the line generated by . Clearly the vectors are well defined outside a set of Haar measure . In fact, these vectors generate the lattice (see [1]). We denote .
Let be the set of prime vectors (i.e. the coordinates are coprime) with positive first nonzero coordinate. For later usage in Section 4 and 5, we define , and let
We denote elements of by , where , , and . For and , we denote by the vector . Given a prime vector , we denote and the Euclidean norm of .
Limit distribution. Let be a stricly convex body with smooth boundary. For each vector , we denote by the gaussian curvature of at the unique point where the unit outer normal vector is .
Denote
and let be the Haar measure on . Define the following function on
(2 .1) |
The distribution of Theorem 1 can now be described by the level set of the function above:
Proposition 2.2.
If is an analytic, symmetric, strictly convex body in , then for any we have
3 FOURIER SERIES AND PROOF OF PROPOSITION 2.1
In this section, we first introduce the Fourier series of the discrepancy function as our main object of study, and then give a proof for the limit distribution of the first part of the discrepancy function.
In following sections, is fixed and can be arbitrarily small. The constants may vary between inequalities but it does not depend on any variables other than the dimension , which is fixed to 2 in our case. Though we only treat the special case for the sum , it will be clear from the proof that higher dimensional counterparts can be treated in the exact same way as , and higher dimensional counterparts is similar to the case of . The sum exhibits distinctly different behavior and we conjecture that it is similar to the case of toral translations relative to boxes and admits a limit Cauchy distribution.
3.1 Fourier series for convex bodies.
We introduce the Fourier series for the smooth strictly convex body by using the aymptotic formula obtained in [5]. For each vector , define its maximal projection on by , if is of class , then we have the following formula for the Fourier node:
(3 .1) |
with
By a change of variable we have , and by grouping the corresponding positive and negative terms in the Fourier series we get that for a symmetric body:
(3 .2) |
3.2 Proof for the limit distribution when .
We will show that after being normalized by , , the part of the Fourier series that consists of nodes
will behave like the ergodic sum of a smooth function.
First, we define
where when and when , then takes the following form:
Proposition 2.1 will follow if we could prove the following:
Lemma 3.1.
For almost every , the series defined by:
is convergent in , and we have
Proof.
The identity is obtained by direct calculation. We will focus on the convergence of the series . Note that
Therefore it suffices to prove that the series
(3 .3) |
is convergent for almost every , .
By standard application of Borel-Cantelli Lemma, we have for almost every , every and every we have
(3 .4) |
which gives
(3 .5) |
where for convenience, is defined as 1. Therefore by taking small, and let the constant vary from line to line,
(3 .6) | ||||
Note that the integral
is convergent and the value is the same for all , thus for almost every ,
is also convergent. Then the convergence of follows from the convegence of (3 .3) through (3 .6). β
4 NON-RESONANT TERMS.
This section is devoted to highlight the nodes with main contributions in the Fourier series , the final goal is to arrive at the sum (4 .12) as an equivalent expression for our Fourier series in terms of limit distributions. Throughout Section 4, we will use the formula (3 .2) since we restrict ourselves to the case symmetric shapes.
For and , we use the notation where is the unique integer such that . To evaluate , we sum up term by term in the Fourier expansion (3 .2) of for , , and we will simplify by using the summation formula
Then the normalized term for the node becomes
(4 .1) |
where is the normalizer.
Since the sum consists of all-non-zero coordinates nodes, it becomes the following:
This step shows that the nodes outside the circle of radius have a negligible combined contribution. Given a set , for funciton defined on , we denote by the supremum of the norms over all . Let
Lemma 4.1.
We have
(4 .2) |
Proof.
Since
we have for every ,
Since in the integral only the square terms have non zero contributions, and , we get that
β
We show that, within the range of , by taking out a small measure set of , the divisors admit a lower bound such that , for every . Therefore we can furthur restrict our sum in the set of small divisors (see (4 .3)).
Let
Note that
Outside the measure set , we have for , , for every . This is how we apply the short vector argument in the next section.
Let
(4 .3) |
(4 .4) |
We have
Lemma 4.2.
(4 .5) |
Proof.
By (4 .2) it is sufficient to show that . We have
with
We have
where denote the part when the coordinate violates the condition in :
(4 .6) | ||||
For we define
and for , define
Then
Thus
(4 .7) |
similarly,
By using , we obtain
Summing over k, we get
and the claim follows. β
In fact, with the bounded range of in Step 2, we can show that the main contribution of the Fourier series comes from the nodes of coordinates of order . Let
(4 .8) |
We have
Lemma 4.3.
Proof.
Repeating the argument in the Lemma 4.2 by replacing in (4 .6) with , and using the inequality (4 .7) we obtain
Summing over , we get
and the claim follows. β
Now the error terms in the Fourier series can be savely removed. Introduce
and let
(4 .9) |
Since and is fixed,
(4 .10) |
Therefor and admit the same limit distribution if there exists one.
Observe that when is fixed, the sum in (4 .9) is limited to large and small . We can replace and by the following
Then it suffices to prove that
(4 .11) |
where
(4 .12) |
and is any subset of that contains .
5 GEOMETRY OF THE SPACE OF LATTICES.
Following [2], Section 2, and [4], Section 4, we show that the set corresponds to a set of short vectors in lattices in , where the lattice takes the form , and . Then the discrepancy function can be seen as a function on the homogeneous space .
Let
Consider the product lattice , where . For each , we associate the vectors , where is the unique interger such that . We then denote
(5 .1) |
We have if and only if :
(5 .2) |
Recall the definition of the shortest vectors of in Section 2. We will prove a version of Lemma 4.1 in [4] that works for our product lattice space.
Lemma 5.1.
For every there exists such that for outside , each corresponds to a pair of unique vectors such that for , and
Conversely, for fixed and large enough, implies that for each pair of vectors , where , , there exists a unique such that for
Denote the set of that corresponds to the set of pairs of vectors
Proof.
From (5 .2) we can deduce that implies is shorter that for . Since for each , the short vectors form a basis in , we have that the norm is equivalent to the norm . Then for every , there exists , such that if satisfies , we have . Now we show that the choice of can be uniform for the set of lattices . Therefore it is enough to show that the set
(5 .3) |
is precompact, since we can write the set as , we prove that each component is precompact. By the bound (5 .2) for and , when , if , then . For any , , so has a lower bound, therefore all vectors in are longer than some . Then by the Mahler compactness criterion for lattices[9], the set (5 .3) is precompact.
For the converse, when we fix and let be sufficiently large, if , we have that is much smaller than because of the equivalence between the two norms. For every , for some unique , we need to show that , where allows . When is not equal to , then , contradicting the fact that is much smaller than . Therefore , and .
For each pair of vectors , we have the corresponding set of , this gives us a unique vector . Therefore the second statement follows. β
For , , we define the coordinates of the correponding vector as
(5 .4) |
and define , and . We introduce a corresponding function to with as a variable:
with
From Section 4.1. we see that for ,
where .
When we restricted ourself to prime vectors , the variables mod will become independent random variables that are uniformly distributed on . In fact, could be rewritten as , where is the signed greatest common divisor such that the first coordinate of is positive, and , and are in . Since all the vectors are multiples of the prime ones, we introduce
(5 .5) |
and .
Introduce
(5 .6) | ||||
where
and
(5 .7) |
where is the coordinate of the short vector .
Recall the definition of in Section 2. Remind that and define . Since the set only consists of the primitive vectors with positive first coordinate, we need to add all the positive and negative βs, the summation of above becomes a summation of , note that the summation over and is finite, and the sum over is finite due to its large power:
(5 .8) |
Essentially we have reformulated our discrepancy function as a function defined on the lattice space, and from Step 5 of Section 4 we have the following proposition:
Proposition 5.1.
Uniform distribution of unstable submanifold . Since for each , is the unstable submanifold under the geodesic flow and will become equidistributed over the whole manifold , naturally the same uniform distribution law of holds in the finite product space . We have the following proposition(see [8], Theorem 5.3):
Proposition 5.2.
Denote by the Haar measure on . If is a bounded continuous function, then
(5 .9) | ||||
6 OSCILLATING TERMS.
In this section we will prove that typical variables appeared in the sum (5 .8) will behave like independent uniformly distributed random variables. We denote by the distribution of when is distributed according to Haar measure on . We denote by the Haar measure on .
The main result of this section is the following, from which the main theorem follows:
Proposition 6.1.
Assume that are uniformly distributed on , then the following random variables
where , converge in distribution as to
In order to prove Propsition 6.1 in Section 6.2, we will first prove that for different vectors ,, in , are typically independent over .
Exceptionally in this subsection we use the lower index for to represent a vector in , not to be confused with the coordinates in the Notations in section 2. For with , and , , define the function , where is a vector, and the bracket means euclidean inner product.
Proposition 6.2.
For different vectors ,, in , if are such that , then for .
Proof.
The proof follows the same line of reasoning of Lemma 5.2 and Proposition 5.4 in [4]. Similarly to Lemma 5.2 in [4], it is easy to see that the functions and are real analytic and not equal to a polynomial in their variables. First we prove that the sum of terms with the same , (therefore with different βs) must be zero.
For the first part of , let , and , we have
(6 .1) |
develop with respect to and consider the coefficient of in the sum for , we have:
(6 .2) |
With βs all being prime vectors in , we can choose a special such that is arbitrarily small for one while all the other that are distinct from have a uniform lower bound, then the sum of with identical must be zero. Repeat this procedure for , then the sum of with identical must be zero.
Next, we can assume that all are the same. For the sake of simplicity, we assume that and . First we suppose that , choose such that is the greatest among all , then
Consider the -th partial derivative of with respect to , then
Since for all , we can take sufficiently large by analyticity of , then becomes the dominant coefficient in the linear combination of -th derivatives, we must have the linear combination of terms of identical maximal is zero. By repeating this procedure for , we can deduce that the coefficient in front the term that has the greatest among those having the greatest is zero. Inductively, all coefficients are zero. β
By Proposition 6.2, we can deduce the following: if we take a lattice and let , , then . By analyticity, for any different ,, in ,
(6 .3) |
Now by Proposition 5.2 we have that
(6 .4) |
as , .
6.2. Proof of Proposition 6.1. Take integers , , and a function of compact support. It remains to show that as
(6 .5) | ||||
as .
Proof.
This proof is very close to the proof of Proposition 5.1 in [4], it suffice to rewrite the original proof with the new variables and use Proposition 6.2 and (6 .4). If for all and , , and , (6 .5) is a special case of (5 .9). Then it suffice to prove (6 .5) in the case that at least some or some are non-zero, then the right-hand side of (6 .5) is zero, and it reduces to the following:
(6 .6) | ||||
If for at least one , recall that , then the coefficient in front of in is . Note that the coordinates and are typically -independent outside a zero measure set of . Hence (5 .9) implies that
(6 .7) |
as . This limit states that most will not allow the coefficient in front of to be too small, then the integral of (6 .6) can be decomposed into two parts, , where corresponds to the part of integral for with and the part for with . Then
so it can be arbitrarily small as by (6 .7) . For , since the coefficient of is not too small, we use integrate by parts with respect to to achieve the following estimation:
Therefore this proves the case where not all vanish, the case where not all vanish is the same.
References
- [1] VladimirΒ Igorevich Arnolβd. Mathematical methods of classical mechanics, volumeΒ 60. Springer Science & Business Media, 2013.
- [2] ShrikrishnaΒ Gopal Dani. Divergent trajectories of flows on homogeneous spaces and diophantine approximation. 1985.
- [3] Dmitry Dolgopyat and Bassam Fayad. Deviations of ergodic sums for toral translations ii. boxes. arXiv preprint arXiv:1211.4323, 2012.
- [4] Dmitry Dolgopyat and Bassam Fayad. Deviations of ergodic sums for toral translations i. convex bodies. Geometric and Functional Analysis, 24(1):85β115, 2014.
- [5] CSΒ Herz. Fourier transforms related to convex sets. Annals of Mathematics, pages 81β92, 1962.
- [6] HΒ Kesten. Uniform distribution mod 1. Annals of Mathematics, pages 445β471, 1960.
- [7] HΒ Kesten. Uniform distribution mod 1 (ii). Acta Arithmetica, 7(4):355β380, 1962.
- [8] Jens Marklof and Andreas StrΓΆmbergsson. The distribution of free path lengths in the periodic lorentz gas and related lattice point problems. Annals of Mathematics, pages 1949β2033, 2010.
- [9] MadabusiΒ Santanam Raghunathan. Discrete subgroups of Lie groups, volumeΒ 3. Springer, 1972.