Central Limit Theorems for group actions which are exponentially mixing of all orders
Michael Bj\"orklund, Alexander Gorodnik

TL;DR
This paper proves a general dynamical Central Limit Theorem for group actions with exponential mixing of all orders, including applications to Cartan flows and horocycle flows on hyperbolic surfaces.
Contribution
It introduces a novel relativization of the cumulant method to establish CLTs for exponentially mixing group actions, broadening the scope of dynamical limit theorems.
Findings
CLT holds for Cartan flows on finite-volume quotients of simple Lie groups.
CLT applies to lacunary samples of horocycle flows on hyperbolic surfaces.
New proof technique using relativized cumulants enhances understanding of mixing properties.
Abstract
In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie groups. Our proof uses a novel relativization of the classical method of cumulants, which should be of independent interest. As a sample application of our techniques, we show that the CLT holds along lacunary samples of the horocycle flow on finite-area hyperbolic surfaces applied to any smooth compactly supported function.
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.
Central limit theorems for group actions which are exponentially mixing of all orders
Michael Björklund
Department of Mathematics, Chalmers, Gothenburg, Sweden
and
Alexander Gorodnik
University of Bristol, Bristol, UK
Abstract.
In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie groups. Our proof uses a novel relativization of the classical method of cumulants, which should be of independent interest. As a sample application of our techniques, we show that the CLT holds along lacunary samples of the horocycle flow on finite-area hyperbolic surfaces applied to any smooth compactly supported function.
Key words and phrases:
Central Limit Theorem, Multiple mixing
2010 Mathematics Subject Classification:
Primary: 37C85, 60F05 ; Secondary: 37A25, 37A45
1. Introduction
1.1. Central limit theorems in dynamics
One of the fundamental problems in the theory of dynamical systems is to understand whether a sequence of observables of a chaotic dynamical system computed along generic orbits behaves similarly to a sequence of independent identically distributed random variables. More precisely, given a measure-preserving transformation of a probability space and a measurable function on , one is interested in analysing statistical properties of the sequence
[TABLE]
where is distributed according to the measure . One says that the “Central Limit Theorem” (CLT) holds if there exists such that
[TABLE]
where denotes the Gaussian distribution with variance , and denotes convergence in the sense of distributions. Explicitly this means that for every interval ,
[TABLE]
as . Due to deterministic nature of the sequence (1.1), it is known that CLT cannot hold for general functions in , and one is interested in finding a “large” subspace of functions satisfying (1.2). In applications, the space is often assumed to be a finite-volume Riemannian manifold, a smooth map which preserves the volume measure on , and is some linear subspace of continuous functions with prescribed regularity (Hölder, for some , etc.). Starting with the pioneering work of Sinai [28] who established the Central Limit Theorem for geodesic flows on compact manifolds with constant negative curvature, this problem has been extensively studied for transformations satisfying some hyperbolicity assumptions [24, 27, 5, 19, 12, 23, 6, 25, 32, 20, 21, 10, 26, 13, 17]. We refer to [11, 12, 18, 22, 30] for surveys of this area of research.
More generally, we consider a measure-preserving action of a group on a probability space . Given a measurable function on , we obtain a collection of observables
[TABLE]
The aim of this paper is to establish a general Central Limit Theorem for the averages
[TABLE]
for actions of higher-dimensional (possibly non-commutative) groups. Previously, CLT was established in [7, 8, 9] for actions of the group by automorphisms of compact abelian groups. Our result holds for general actions that are “sufficiently chaotic”, which is manifested by quantitative estimates on the higher-order correlations
[TABLE]
for and .
The multi-parameter averages of this type naturally arise in number-theoretic problems. In [3] we apply the developed techniques to analyze the discrepancies of distributions of values of products of linear forms.
1.2. The main result
Let be a locally compact group equipped with a left-invariant Haar measure and a proper left-invariant metric . We say that has sub-exponential growth if
[TABLE]
where denotes the -ball around the identity element in of radius . It is not hard to show that every locally compact second countable abelian group has sub-exponential growth; a bit more work is required to show that every locally compact second countable nilpotent group has sub-exponential growth. Furthermore, it is well-known that groups of sub-exponential growth are amenable, and thus possess right Følner sequences. We recall that a sequence of compact subsets with non-empty interiors in is right Følner if
[TABLE]
where denotes the symmetric difference of sets. It is easy to show that if , then any sequence of Euclidean balls of increasing radii forms a Følner sequence in . More generally, balls in groups of sub-exponential growth also form Følner sequences.
Suppose that the group acts jointly measurably by measure-preserving maps on a probability measure space . We shall assume that there exists an -invariant sub-algebra of and a family of semi-norms on , which satisfy some technical conditions spelled out in Section 2 (see (2.3)–(2.6) below), such that the -action is exponentially mixing of all orders with respect to and (in the sense of Definition 2.1 below). Roughly speaking, this property requires that
[TABLE]
with and and an explicit error term depending on the quantities and . We refer to Section 2 for the required definitions and notation.
Our main result now reads as follows.
Theorem 1.1** (Sub-exponential growth and CLT).**
Let have sub-exponential growth and be a right Følner sequence in such that . Suppose that the action of on is exponentially mixing of all orders on an -invariant sub-algebra of . Then, for any with ,
[TABLE]
where
[TABLE]
A more general version of this theorem, which does not assume sub-exponential growth, will be stated in Theorem 1.5.
Remark 1.2**.**
Exponential -mixing, combined with the sub-exponential growth of , will ensure that given by (1.6) is finite for all (see Section 3.2). However, we stress that is definitely possible for non-zero ; indeed, it is not hard to show that this happens if for some and .
1.2.1. A sample application: CLT for Cartan actions on homogeneous spaces
Let be a connected Lie group, a lattice in and the unique -invariant probability measure on . Let be a semisimple Lie subgroup of with finite center, and assume that the -action on has strong spectral gap. Let denote a Cartan subgroup of , and fix a closed subgroup of . Let be a sequence of strictly increasing balls in with respect to some left-invariant Riemannian metric on restricted to . One readily checks that forms a right Følner sequence in .
In recent joint work [2] with M. Einsiedler, the authors showed that if one takes to be the algebra of smooth functions on with compact supports, and a family of certain Sobolev norms on , then the assumptions of Theorem 1.5 are satisfied for the -action on with respect to , which leads to the following corollary of Theorem 1.1.
Corollary 1.3**.**
For every real-valued, compactly supported smooth function on with ,
[TABLE]
where is given by (1.6).
For example, Corollary 1.3 applies when
[TABLE]
and is a closed subgroup of the group of diagonal matrices in .
Remark 1.4**.**
The first author and G. Zhang [4] have recently provided, under some technical assumptions on and , lower (positive) bounds on the variance , whenever is non-zero and invariant under a maximal compact subgroup of .
1.3. Connections to earlier works
A number of different approaches have been developed for proving dynamical Central Limit Theorems for one-parameter actions. An influential approaches based on a martingale approximation originated in the work of Gordin [16]. We refer to the survey [22] by Le Borgne for an overview of this technique, as well as for an extensive list of references. The martingale approximation method becomes harder to implement already for actions of , , let alone for actions by non-commutative groups; see for instance [31] for some recent developments in this direction when . Other approaches to the Central Limit Theorem involve Markov approximations [27, 5, 6, 13] and spectral analysis of transfer operators [19, 18], and it is also not clear how to implement them for multi-parameter actions.
In this paper, we use an alternative approach to the Central Limit Theorem based on the classical method of cumulants, due to Fréchet and Shohat [15] (see Section 5 for an outline of this method). Roughly speaking, this method is equivalent to the more well-known method of moments, but is better tailored for approximations to Gaussian laws. An important novelty in our work is the systematic use of conditional cumulants (see Section 8), which greatly simplifies the estimation of cumulants in the presence of exponential mixing of all orders.
The method of cumulants has been recently used by Cohen and Conze in [7, 8, 9] to establish Central Limit Theorems for multiple mixing actions by by automorphisms of a compact abelian group — but only for functions which are finite sums of characters on . It seems that it is still not known whether in this setting the CLT also holds for all smooth functions.
1.4. A general Cental Limit Theorem
Our method allows to prove the Central Limit Theorem for actions of general groups and for more general averaging schemes provided that some technical conditions are verified. Let us now assume that is a locally compact second countable group equipped with a left-invariant metric .
The following is the main technical result of this paper.
Theorem 1.5** (General CLT).**
Let be a sequence of positive and finite Borel measures on such that , and for any integer and real number ,
[TABLE]
Suppose that the action of on is exponentially mixing of all orders on an -invariant sub-algebra of . Let with and suppose that the limit
[TABLE]
exists. Then
[TABLE]
In Section 3 below we show that these conditions are satisfied for the averages
[TABLE]
when has sub-exponential growth, and is a right Følner sequence in , and we identify the limit in (1.8). Hence, Theorem 1.1 will be deduced from Theorem 1.5.
1.4.1. A sample application: CLT for unipotent flows sampled at lacunary times
Let us now retain the notation from Section 1.2.1, and let be a non-trivial one-parameter unipotent subgroup . Although actions of Cartan subgroups of on are exponentially mixing of all orders, actions of unipotent subgroups are not (although they are polynomially mixing of all orders). Sinai raised the question whether the Central Limit Theorem still holds for unipotent flows on ; this was later answered in the negative by Flaminio and Forni in [14, Cor. 1.6]. However, our next corollary shows that if one is willing to “speed up” unipotent flows by sampling them at lacunary times, then the CLT does hold.
Corollary 1.6**.**
For any lacunary sequence and a real-valued, compactly supported smooth function on with ,
[TABLE]
Remark 1.7**.**
Contrary to Theorem 1.1, we note that in this setting the variance is always positive whenever has mean zero and does not vanish identically on .
1.5. Structure of the paper
In Sections 3 and 4 below we shall assume Theorem 1.5 and show how Theorem 1.1 and Corollary 1.6 respectively can be deduced from it.
The rest of the paper is then devoted to the proof of Theorem 1.5, which we shall break down into several propositions, whose proofs, in turn, will be divided into further lemmas and propositions. The following tree graphically represents this break-down:
{forest}
[Theorem 1.5 [Proposition 5.2 [Proposition 6.1 [Proposition 7.1[Lemma 8.2]] [Proposition 7.2 [Lemma 9.1]]] [Proposition 6.2 [Lemma 10.1]] ]]
2. Definitions and standing technical assumptions
Let us here in this section give the definitions of some notions used in the introduction, and collect some of the technical assumptions which are necessary for our analysis.
Throughout the paper, we shall fix a locally compact second countable group , and a left-invariant metric on . We assume that acts jointly measurably by measure preserving maps on a probability measure space . In particular, also acts (weakly continuously) by isometries on via
[TABLE]
We fix an -invariant sub-algebra of , and a family of semi-norms on , indexed by positive integers .
Definition 2.1** (Exponential mixing of all orders).**
Let be an integer. We say that the -action on is exponentially mixing of order , with respect to and , if there exist and an integer such that for all and ,
[TABLE]
for all , where
[TABLE]
We refer to as the rate of -mixing. The notation here means that there exists a constant , which is allowed to depend on and such that .
We shall from now on always assume that the -action on is exponentially mixing of all orders with respect to and ; in particular, from now on, the meanings of the numbers and have been fixed. Furthermore, we shall require the following four technical conditions on the family (with all implicit constants depending only on ):
- •
Monotonicity: For all and ,
[TABLE]
- •
Sobolev embedding: For all and ,
[TABLE]
- •
-boundedness: For all , there exists such that for all and ,
[TABLE]
- •
Almost multiplicative: For all and ,
[TABLE]
We may further, and shall, throughout the paper, assume that the sequence increases with , and the sequence from Definition 2.1 decreases with . Also, without any loss of generality, we may assume that for all and .
3. Proof of Theorem 1.1 assuming Theorem 1.5
Recall our standing assumptions on and from Section 2. Let us further assume that has sub-exponential growth, and is a right Følner sequence in . We shall apply Theorem 1.5 to the sequence of positive and finite measures on defined by
[TABLE]
One readily checks that for all . In particular, as . In order to prove Theorem 1.1, it suffices to verify conditions (1.7) and (1.8).
3.1. Checking condition (1.7)
Writing out condition (1.7) explicitly in our setting, we see that we must prove that for every integer and real number ,
[TABLE]
as . The integral is bounded from above by
[TABLE]
Hence it suffices to show that for every and real number ,
[TABLE]
as . Since and , this readily follows from the sub-exponential growth of , see (1.4).
3.2. Calculating the variance
Upon expanding (1.8) for our choice of and a fixed with , we see that one has to show that
[TABLE]
where . Using left--invariance of , the left-hand side can be re-written as
[TABLE]
Since is a right Følner sequence in ,
[TABLE]
whence (3.2) follows from the Dominated Convergence Theorem if we can show that belongs to . Since the -action on is exponentially mixing of order two with respect to and , we have
[TABLE]
where the implicit constant is independent of . Hence, the following lemma finishes the proof.
Lemma 3.1**.**
If is a complex-valued measurable function on such that for some ,
[TABLE]
then belongs to .
Proof.
Using (3.4), we obtain
[TABLE]
where . Since has sub-exponential growth, , which readily implies that the series converges. ∎
4. Proof of Corollary 1.6 assuming Theorem 1.5
Recall our assumptions on and from Corollary 1.6, and let be a non-trivial unipotent one-parameter subgroup of , and a sequence in such that for some ,
[TABLE]
We shall apply Theorem 1.5 to the sequence of positive and finite measures on defined by
[TABLE]
One readily checks that .
We shall crucially use the easily checkable fact the distance along unipotent subgroups grows at least logarithmically (see, for instance, [2, Lem. 2.1]): for every fixed choice of such a unipotent subgroup , there exist such that
[TABLE]
In particular, it follows from the exponential mixing property that there exists such that for every and satisfying ,
[TABLE]
4.1. Checking condition (1.7)
If we write out condition (1.7) explicitly in our setting, we see that we must show that for all and ,
[TABLE]
as . We deduce from (4.3) that for ,
[TABLE]
Hence, it suffices to show that for every ,
[TABLE]
Using (4.1), it is not hard to show that
[TABLE]
where the implied constant is independent of . Then
[TABLE]
and (4.5) is immediate since .
4.2. Calculating the variance
Take with . If we expand , we get
[TABLE]
We wish to prove that the second term tends to zero as . By (4.4), we have for all ,
[TABLE]
It thus suffices to show that
[TABLE]
Since by (4.1), this follows from the finiteness of the series
[TABLE]
5. An outline of the proof of Theorem 1.5
Our proof of Theorem 1.5 makes use of the classical cumulant method, in essence due to Fréchet and Shohat in [15]. We shall briefly summarize its main steps below.
Let be a probability measure space and an integer. Denote by the set . A cyclically ordered partition of the set is a partition of into non-empty subsets , where the cyclic order of is also taken into account; for instance, if , then and are viewed as the same cyclically ordered partition, while and are viewed as different partitions, since the associated orders and are not cyclic permutations of each other. We denote by the set of all cyclically ordered partitions of .
Given an -tuple in and a subset , we define
[TABLE]
and the joint cumulant of order by
[TABLE]
where denotes the number of partition elements in . If , we define , the cumulant of of order , to be
[TABLE]
The utility of cumulants for problems pertaining to Central Limit Theorems is well-known; we shall use the following classical criterion, which can be deduced from the results in [15].
Proposition 5.1** (Cumulants and CLT).**
Let be a sequence of real-valued, bounded and measurable functions on satisfying . If
[TABLE]
and the limit
[TABLE]
exists, then
[TABLE]
5.1. Main proposition
Recall our standing assumptions concerning and the norms from Subsection 2. In particular, the meaning of the numerical sequences and has been fixed. Let be a sequence of positive and finite measures on . Given , thanks to Proposition 5.1, the proof of the CLT for the sequence is essentially reduced to the asymptotic vanishing of for . Using our assumptions on in Theorem 1.5, this will be deduced from the following proposition.
Proposition 5.2** (Estimating cumulants).**
For all and , there exists such that for all , and ,
[TABLE]
where the implicit constant depends only on and .
5.2. Proof of Theorem 1.5 assuming Theorem 5.2
Fix . By Proposition 5.1, applied to , we need to show that the limit
[TABLE]
exists, and
[TABLE]
The existence of the first limit is assumed in Theorem 1.5, so we only need to consider the second kind of limits. Fix , and choose in Proposition 5.2 for some . Then, (5.5) yields for all ,
[TABLE]
Applying our assumption (1.7) with , we conclude that this quantity tends to zero as , since .
6. An outline of the proof of Proposition 5.2
Throughout this section, we retain our assumptions on and the norms . We shall further fix an integer , and write for the set .
6.1. Rewriting cumulants
Let be a sequence of positive and finite measures on . For any , we see that
[TABLE]
Furthermore, for every fixed , we can write every joint cumulant of the form as
[TABLE]
where
[TABLE]
We shall now adopt the following notational convention. If is a real-valued function defined on the set of all subsets of with , then we define its cumulant as
[TABLE]
so that . With this convention, we now have
[TABLE]
In what follows, we shall estimate for “well-separated” -tuples , and we shall also show that “most” -tuples are well-separated on suitable scales. In order to make the notions of “well-separateness” and “most” more precise, we must first introduce some additional notation.
6.2. Well-separated -tuples
If and , we set
[TABLE]
and
[TABLE]
If is a partition of , we set
[TABLE]
and
[TABLE]
Two extremal cases of this notation will be of special interest. We note that if we write for the partition of into points, then
[TABLE]
which we have previously also denoted by . At the other extreme, if denotes the partition into one single block, then
[TABLE]
In order to ease the somewhat heavy notation, we set For , we set
[TABLE]
We note that for all , the set
[TABLE]
satisfies
[TABLE]
Given a partition of , and , we define
[TABLE]
We shall think of the elements in for some partition with and as being “well-separated”, while we think of the elements in as being “clustered”.
6.3. Main propositions
Our first proposition roughly asserts that the joint cumulants are “small” for all “well-separated” -tuples .
Proposition 6.1** (Separated tuples).**
Let be a partition of with , and fix and an integer . Then, for every and , we have
[TABLE]
where the implicit constant depends only on and .
Our second proposition roughly shows that we have a lot of flexibility in setting up the thresholds for the notions of “well-separated” and “clustered”.
Proposition 6.2** (Exhausting ).**
For every sequence with and
[TABLE]
we have
[TABLE]
6.4. Proof of Proposition 5.2 assuming Proposition 6.1 and Proposition 6.2
Fix and , and pick a sequence such that , and
[TABLE]
By (6.2) and (6.9), we have that for all ,
[TABLE]
where the second maximum is taken over all partitions of with at least two partition elements. Recall from our standing assumptions in Subsection 2 that . Hence, using the inclusion (6.5) for the first term, we see that
[TABLE]
We stress that this inequality is valid for any and sequence satisfying (6.10). It remains to choose a sequence so that the second term is as small as possible.
Let us now fix once and for all, and set . For every , we pick recursively so that
[TABLE]
Recall from Subsection 2 that we assume that , and thus (6.13) in particular implies that , that is to say, thus constructed satisfies (6.10). By induction, (6.13) also implies that
[TABLE]
In what follows, we can choose any sequence as in (6.13) with .
We fix a partition of with and an index . By Proposition 6.1, we know that for all “well-separated” -tuples ,
[TABLE]
where the last equality follows from (6.13). We stress that the right hand side is independent of both and , and thus it follows from (6.12) that
[TABLE]
which finishes the proof.
7. Proof of Proposition 6.1
We retain the notation from the previous section. In particular, an integer has been fixed, and we write for the set , and for the set of cyclically ordered partitions of .
Recall from Subsection 6.1 that if with , then its cumulant is defined by
[TABLE]
We can extend to a function by
[TABLE]
so that
[TABLE]
Finally, given a partition of , we set
[TABLE]
7.1. Estimating cummulants
Recall that if and , then is defined by
[TABLE]
and . Our first proposition asserts that in order to estimate from above, it suffices to estimate all differences of the form , where varies over all possible partitions of with at least two blocks. These differences will be estimated below using our assumption that the -action on is exponentially mixing of all orders.
Proposition 7.1**.**
For any partition of with , and ,
[TABLE]
Given this result, which will be established in Section 8 below, Proposition 6.1 follows immediately from the following proposition, which will be established in Section 9.
Proposition 7.2** (Estimating the effect of conditioning).**
Fix and an integer . Then for any partition of , and ,
[TABLE]
where the implicit constant depends only on and .
8. Proof of Proposition 7.1
Throughout this section, let be an integer, and write for the set .
If is a set function with , recall the definition of its cumulant from (6.1), and if is a partition of , recall the definition of the “conditional” set function from (7.2), and the definitions of the “extended” versions and from (7.1). It follows immediately from the definition of that
[TABLE]
We recall that the cumulant of random variables vanish provided that there exists a non-trivial partition such that and are independent (see, for instance, [29, Lem. 4.1]). The following proposition is a combinatorial version of this property. It can be proved by modifying the argument from [29] (see also Theorem 2 in [1]). We include a proof for completeness.
Proposition 8.1**.**
For any partition of with and , we have
[TABLE]
We note that Proposition 7.1 is a direct consequence of Proposition 8.1 and estimate (8.1).
Let us briefly explain the driving mechanism in the proof of this proposition. Recall that denotes the set of all cyclically ordered partitions of the set . Let be a set function and suppose that there exists a bijection such that
[TABLE]
for all . Then,
[TABLE]
and thus .
The next lemma shows that one can produce, for every partition of with at least two partition elements, a bijection such that (8.2) holds for , for every choice of set function . In particular, by the comment above, this shows that , which finishes the proof of Proposition 7.1.
Lemma 8.2**.**
For any partition of with , there exists a bijection such that
- •
for every , we have mod , and
- •
for every , we have .
8.1. Proof of Lemma 8.2
If is a cyclically ordered partition with , we set
[TABLE]
so that , and we note if , then the function satisfies
[TABLE]
We shall use the decomposition to construct a bijection such that
[TABLE]
for all cyclically ordered partitions of and all functions which satisfy (8.3).
To this end, we choose once and for all an element . Given a cyclically ordered partition of , let be the unique index such that , and pick the first index following (in the cyclic ordering of ) such that . We now set
[TABLE]
Let be a function which satisfies (8.3). If , we see that and by (8.3),
[TABLE]
If , we see that . In this case, we observe that and because , so that and . Hence, by (8.3),
[TABLE]
It is clear that the map constructed in this manner satisfies , which finishes the proof.
9. Proof of Proposition 7.2
Lemma 9.1** (Estimating local effects of conditioning).**
Fix and an integer . Then, for any partition of , and ,
[TABLE]
where the implicit constant depends only on and .
9.1. Proof of Proposition 7.2 assuming Lemma 9.1
Fix a partition of . Given , we set
[TABLE]
so that we can write
[TABLE]
We claim that
[TABLE]
where
[TABLE]
Indeed, if one expands the first product in (9.1), one ends up with terms, one of which equals the product of all of the ’s. All other terms contains at least one for some in them, and thus their absolute values are trivially estimated from above by .
By Lemma 9.1, we have for all ,
[TABLE]
[TABLE]
for every . Hence,
[TABLE]
Note that the bound in Proposition 7.2 is trivial (and useless) if , so let us henceforth assume that . We then get that
[TABLE]
which finishes the proof.
9.2. Proof of Lemma 9.1
We assume that have been fixed once and for all, as well as a partition of , along with a subset . Pick and a tuple . We recall that the latter means that
[TABLE]
where and are defined in Subsection 6.2. Let
[TABLE]
and choose, for every , an index . For every , we now set
[TABLE]
and note that
[TABLE]
In particular, by our convention that ,
[TABLE]
Since the action is assumed to be exponentially mixing of all orders, we conclude by (2.1) with and , that for all ,
[TABLE]
where
[TABLE]
and the implicit constants depend only on and .
Let us now estimate the norms for . We fix , and suppose that contains at least two elements so that we can write for some and . Then, by (2.6) and (2.5), we have
[TABLE]
If we iterate this argument as many times as there are elements in , we arrive at the bound
[TABLE]
where we used that is increasing, and thus, by (2.3),
[TABLE]
where and are as in (6.3) and (6.4) respectively. Going back to (9.3), and using our assumption from Subsection 2 that the sequences and are increasing and that the sequence is decreasing, we conclude from (9.4) that for all , we have
[TABLE]
We have assumed that , and thus
[TABLE]
whence
[TABLE]
which finishes the proof.
10. Proof of Proposition 6.2
We retain the conventions and notations which were set up in Subsection 6.2. In particular, we fix an integer throughout the section, and write for the set .
10.1. Passing to coarser partitions
If and are partitions of , we say that is coarser than if every partition element in is a union of partition elements in , and strictly coarser if also has fewer partition elements than . In other words, is strictly coarser than if at least one partition element in is the union of at least two partition elements from . In particular, the partition into one single block is strictly coarser than any other partition of , and every partition of with strictly less than partition elements is strictly coarser than the partition of into points.
The following lemma summarizes the main inductive step in the proof of Proposition 6.2.
Lemma 10.1** (Passing to coarser partitions).**
Let be a partition of with . Fix , and suppose that satisfies
[TABLE]
Then there exists a partition of , strictly coarser than , such that
[TABLE]
10.2. Proof of Proposition 6.2 assuming Proposition 10.1
Let us fix a sequence
[TABLE]
Pick an element . We wish to prove that either
- •
, or
- •
there exist and a partition of with such that .
This will be done in several steps. We first check whether . If not, then
[TABLE]
and thus Lemma 10.1 (applied to and ) implies that there exists a strictly coarser partition than such that . If (that is, ), then
[TABLE]
and we are done, so let us assume that . We now check whether . If not, then
[TABLE]
and since , Lemma 10.1 (applied to and ) implies that there exists a strictly coarser partition than such that . If , then we again can conclude the argument as before, so we may assume that .
If we continue like this, then we will have produced a chain of strictly coarser partitions of , which eventually must terminate at the trivial partition in no more than steps. At the -th step, we check whether belongs to . If this check fails for every , then we conclude that .
10.3. Proof of Lemma 10.1
Let be a partition of with and satisfy and . Since , it follows from the second inequality that there exist atoms in such that . We consider the partition consisting of and which is strictly coarser than . Since , there exist and such that . Moreover, since , we have and for all . Similarly, we conclude that for all . Hence, it follows that for all and ,
[TABLE]
This proves that . Additionally, for ,
[TABLE]
Hence, we conclude that , as required.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Ahlbach, C.; Pippenger N.; Usatine, J. A combinatorial interpretation of the joint cumulant. Preprint, https://arxiv.org/pdf/1211.0652.pdf .
- 2[2] Björklund, M.; Einsiedler, M.; Gorodnik, A. Quantitative multiple mixing. Preprint, https://arxiv.org/abs/1701.00945
- 3[3] Björklund, M.; Gorodnik, A. Central limit theorems in the geometry of numbers . Preprint.
- 4[4] Björklund, M.; Zhang, G. Positivity of integrals of spherical functions over Cartan subgroups. In preparation.
- 5[5] Bowen, R. Equilibrium states and the ergodic theory of Anosov diffeomorphisms. Lecture Notes in Mathematics, Vol. 470. Springer-Verlag, Berlin-New York, 1975.
- 6[6] Chernov, N. I. Limit theorems and Markov approximations for chaotic dynamical systems. Prob. Th., Rel. Fields 101 (1995), 321–363.
- 7[7] Cohen G.; Conze, J-P. CLT for Random Walks of Commuting Endomorphisms on Compact Abelian Groups. J. Theoret. Probab. 30 (2017), no. 1, 143–195.
- 8[8] Cohen G.; Conze, J-P. Central limit theorem for commutative semigroups of toral endomorphisms. Preprint, https://arxiv.org/abs/1304.4556 .
