Rational ergodicity of Step function Skew Products
Jon. Aaronson, Michael Bromberg, Nishant Chandgotia

TL;DR
This paper investigates the ergodic properties of step function skew products over circle rotations, demonstrating rational ergodicity for quadratic irrational rotation numbers through analysis of associated affine random walks.
Contribution
It establishes rational ergodicity of step function skew products over certain rotations, especially for quadratic irrationals, linking dynamics to affine random walk behavior.
Findings
Proves ergodicity for these skew products.
Shows bounded rational ergodicity for quadratic irrationals.
Connects orbit statistics to affine random walk models.
Abstract
We study rational step function skew products over certain rotations of the circle proving ergodicity and bounded rational ergodicity when rotation number is a quadratic irrational. The latter arises from a consideration of the asymptotic temporal statistics of an orbit as modelled by an associated affine random walk.
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.
Taxonomy
TopicsMathematical Dynamics and Fractals · Quantum chaos and dynamical systems · Stochastic processes and statistical mechanics
Rational ergodicity of
Step function Skew Products.
Jon. Aaronson , Michael Bromberg Nishant Chandgotia
School of Math. Sciences, Tel Aviv University,69978 Tel Aviv, Israel. *Webpage *: http://www.math.tau.ac.il/$\sim$aaro
Math. Dept., Bristol University, Bristol, UK.
School of Math. Sciences, Tel Aviv University,69978 Tel Aviv, Israel.
Abstract.
We study rational step function skew products over certain rotations of the circle proving ergodicity and bounded rational ergodicity when rotation number is a quadratic irrational. The latter arises from a consideration of the asymptotic temporal statistics of an orbit as modelled by an associated affine random walk.
Key words and phrases:
Infinite ergodic theory, skew product, step function, cylinder flow, renormalization, random affine transformation, affine random walk, stochastic matrix, perturbation, temporal central limit theorem, weak rough local limit theorem.
2010 Mathematics Subject Classification:
37A40, 11K38, 60F05
The research of Aaronson and Chandgotia was partially supported by ISF grant No. 1599/13. Chandgotia was also partially supported by ERC grant No. 678520 Bromberg’s research was supported by EPSRC Grant EP/I019030/1. ©2016-7.
§0 Introduction
A rational step function is a right continuous, step function on the additive circle taking values in , whose discontinuity points are rational.
Let be a rational step function.
The skew products defined by
[TABLE]
are conservative if and only if
[TABLE]
Necessity follows from the ergodic theorem and sufficiency follows from the Denjoy-Koksma inequality (see below).
Consider the collections of badly approximable irrationals
[TABLE]
and of quadratic irrationals
[TABLE]
It is known that and that BAD has Lebesgue measure zero (see e.g. [HW]).
Denominator of a rational step function
Fix and .
The rational step function with denominator and values is the step function defined by
[TABLE]
where is defined by . Every rational step function is of this form for some and .
If is a rational step function with denominator , then
[TABLE]
We prove, for a rational step function with denominator and values and which is centered in the sense that : Theorem 1’: Ergodicity**
There is a collection of full Lebesgue measure so that and so that if , then is a CEMPT where is the closed subgroup of generated by .
Here and throughout, CEMPT means conservative, ergodic, measure preserving transformation, denotes Haar measure on the locally compact, Polish, Abelian group , normalized if is compact. Also, is always going to mean a centered rational step function.
Theorem 1’ will follow from the stronger theorem 1 (see below).
The technique of the proof of theorem 1 is not new. For older, related results, see [CP], [Oren] and references therein.
Theorem 2: Temporal CLT**
If and , then for some and so that for any box ,
[TABLE]
where is a globally supported, centered, normal random variable on and is its probability density function.
Here and throughout and denotes counting measure.
For an introduction to temporal statistics in dynamics see [DS]. Theorem 2 here is a generalization of a subsequence version of theorem 1.1 in [Beck], which in turn has been recently strengthened in [BU]. Theorem 3: Rational ergodicity**
Suppose that and that , then
[TABLE]
is boundedly rationally ergodic and .
See [AK] for a definition of bounded rational ergodicity. Bounded rational ergodicity of for was established in [AK] for and in [ABN2016] for .
Notations
Here and throughout, for :
means so that for each ,
means and ,
means and
means .
Outline of the rest of the paper.
In §1 we prove theorem 1, a stronger version of theorem 1’. The rest of the paper is devoted to the proofs of theorems 2 and 3.
As in [AK] , [ABN2016], proofs rely on recursive properties of the tuples , for a suitably chosen sequence .
To study the temporal statistics of these tuples, we consider the “temporal random variables” , defined by , where is a uniformly distributed random variable with values in . In other words,
[TABLE]
The recursive properties of the tuples (see §2), allow us to construct an associated affine random walk (ARW) which models the distribution of the “temporal random variables” (see §3).
In §4 we show that when is quadratic, the sequence of expectations is asymptotically linear. This culminates in the approximation of the distribution of by an affine random walk generated by a sequence of centered, independent, identically distributed affine transformations (see the ARW centering lemma).
This enables proof in §5 of theorem 2 which is a central limit theorem for . The proof of theorem 3 in §6 is based on a “weak, rough local limit theorem” for . Both proofs use a spectral theory of ARWs based on perturbation theory of stochastic matrices (as in [HH]).
§1 Ergodicity
Regular continued fractions
Recall that the regular continued fraction expansion of is
[TABLE]
where with for .
Recall that and so every irrational in indeed has an infinite regular continued fraction expansion. On the other hand, if then and has only a finite regular continued fraction expansion. In the sequel, we’ll consider modified continued fractions where the situation is different.
Fix and and define the principal convergents by
[TABLE]
Here, and throughout, for , we denote
[TABLE]
The principal denominators of are given by
[TABLE]
the numerators are given by
[TABLE]
and the principal convergents satisfy
[TABLE]
We’ll also need theorems 16, 17 and 19 in [Khintchine]: Proposition* For ,*
If for some , for all then for some .
For , .
If and , then .
The following is also well known (see e.g. [HW], [Khintchine]):
Proposition* Let , then*
(i)* iff so that ;*
(ii)* iff .*
For , we’ll also need the collection
[TABLE]
Evidently, and it is not hard to show that SBAD has full Lebesgue measure.
In the following, is a rational step function with denominator . Theorem 1**
Suppose that either (i) , or (ii) is prime, then is a CEMPT.
The rest of this section is devoted to the proof of theorem 1.
Essential values and Periods
Let be a standard probability space, and let be an invertible, ergodic, probability preserving transformation and .
Suppose that is a locally compact, Polish, Abelian group equipped with the translation invariant metric (e.g. if ).
Let be measurable and define by
[TABLE]
The collection of essential values of (as in [rigveda]) is
[TABLE]
The skew product is defined by
[TABLE]
and preserves the measure .
Define the collection of periods for -invariant functions:
[TABLE]
where
It is not hard to see that is ergodic iff is ergodic . Schmidt’s Theorem [rigveda]**
* is a closed subgroup of and .*
In view of this, the conclusion of theorem 1 is equivalent to
[TABLE]
We prove this first in the case that is countable and then deduce the uncountable case.
Let
[TABLE]
We’ll need
Denjoy-Koksma inequality ([Katznelson], [Herman])**
[TABLE]
where denotes the total variation of .
Remark
Consequently, when is countable, there is a finite set such that for every .
Given an Abelian group and , let denote the group rotation on given by . Proof of theorem 1 in the countable case ** Sublemma 1 For theorem 1 in the countable case, it suffices that
[TABLE]
**Proof **
Let be the group generated by , that is,
[TABLE]
Evidently, whence and is cyclic.
We claim moreover that . To see this, using , we have
[TABLE]
whence indeed .
By (🚹), .
By Schmidt’s theorem, if and , then a.e. and so that
[TABLE]
Evidently
[TABLE]
where (as before).
Defining as usual, we have
[TABLE]
which is ergodic, being a product of two ergodic group rotations with disjoint spectra.
Thus is constant a.e., whence also , and is ergodic. ☑
Sublemma 2**
[TABLE]
**Proof **
We’ll prove the sublemma using *Oren’s Lemma [Oren] *** If there exist and such that is constant on and , and then .
Here and and throughout, .
Note that a version of Oren’s lemma is implicit in [Conze76].
Next, we claim that for (🚹), it suffices to show
☺ For any there are sequences of measurable sets and positive integers such that is constant on and ,
[TABLE]
and where does not depend on .
Indeed, by the remark after Denjoy-Koksma inequality, there is a finite set so that .
Thus such that whence .
By Oren’s lemma, , whence, since is a group, and sufficiency of ☺ is established.
Finally, we construct the sequences of measurable sets as in ☺.
To this end, we prove first that the discontinuities of are “dynamically separated”.
Let . Since is a step function with the set of discontinuities contained in the set of discontinuities of is contained in the set
[TABLE]
Hence the distance between the discontinuities is bounded below by
[TABLE]
Claim**
[TABLE]
**Proof of (🚺) when **
By definition of SBAD, there exist a sequence , and such that
[TABLE]
whence for all and , since is a principal denominator,
[TABLE]
(🚺) follows. ☑**Proof of (🚺) when is prime ** This further splits into two separate cases.
(i) There are only finitely many ’s such that : Choose large enough such that for . For ,
[TABLE]
As before, we have
[TABLE]
•
Since is prime to for all , for , is not a multiple of for . Thus by [Khintchine, theorem 19] if
[TABLE]
then is a multiple of for some ; in this case
[TABLE]
Therefore
[TABLE]
(ii)There are infinitely many ’s such that : Let be the subsequence such that . Let the -th term of the continued fraction expansion of be given by ; we know
[TABLE]
Since for all , there determinant of the product is either or . Thus .
By the recursion formula for the principal denominators, we have that for some . Again,
[TABLE]
If
[TABLE]
then by [Khintchine, theorem 19], is a multiple of for some .
Since , if for some then ; it follows that is not a multiple of . Therefore . Since if
[TABLE]
then is multiple of implying ; thus the number cannot be a multiple of for any and it follows that .
Hence by [Khintchine, theorem 16] we have
[TABLE]
This proves (🚺). ☑
**Construction of measurable sets as in ☺ **
By (🚺) there exist a subsequence and such that and such that is sufficiently large compared to , where is the finite set of values taken by as in the remark after the Denjoy-Koksma inequality.
Fix . To obtain the periodicity , we build sequences of measurable sets such that
\bullet\ \ \$$\varphi_{q_{n_{k}}} is constant on and ,
\bullet\ \ \$$\varphi_{q_{n_{k}}}|_{B_{k}}-\varphi_{q_{n_{k}}}|_{A_{k}}=\Phi(\epsilon+1)-\Phi(\epsilon) and
\bullet\ \ \$$m_{\mathbb{T}}(A_{k}),m_{\mathbb{T}}(B_{k})>c>0.
Fix and let be the partition of by the discontinuities of the step function .
For , let be the interval with right endpoint and be the interval with left endpoint .
We can choose such that is constant on
[TABLE]
Evidently,
[TABLE]
and by (🚺)
[TABLE]
These sets are as in ☺ and the proof of theorem 1 in the countable case is now complete. **Proof of theorem 1 in the uncountable case **
Let
[TABLE]
let and let be a basis for so that each
[TABLE]
Consider the cocycle defined by
[TABLE]
It follows that . We claim that
[TABLE]
To see this,
[TABLE]
By linear independence of , for each showing that indeed
Thus, by (♿) as on page ♿ ‣ Essential values and Periods in the countable case, and Schmidt’s theorem,
[TABLE]
It follows that (and ) where is given by
[TABLE]
By linearity of ,
[TABLE]
and
[TABLE]
§2 The orbit sequence
Theorems 2 and 3 both depend on the modeling of the orbit sequence
[TABLE]
by an associated affine random walk. To extract this affine random walk we first obtain a sequential substitution construction of the jump sequence
[TABLE]
To this end, let so that .
Define the map by
[TABLE]
the transformation by and by
[TABLE]
then
[TABLE]
Thus
[TABLE]
where . The sequence is generated as follows.
The modified continued fraction expansion of is
[TABLE]
where with and .
See [Keane1970] [KN].
The quadratic case
If , then so does and there exist
[TABLE]
such that
[TABLE]
Here and throughout,
\bullet\ \ \$$\mathbb{1} denotes a vector all of whose coordinates are ,
\bullet\ \ \$$b_{0}\odot b_{1} denotes the concatenation of the finite sequences and ,
\bullet\ \ \and denotes the concatenation of copies of . Theorem 2.1 in [AK]* For , let *
[TABLE]
then
[TABLE]
if the last symbol in is changed from “1” to “0”.
Here are the block lengths.
Block lengths
Let , then
[TABLE]
Parities, Jumps Orbits
Next, we compute the jump blocks.
We call the parity of and we begin by calculating the parity blocks with a generalization of [AK, theorem 2.2].
For , define
[TABLE]
then by (\IroningI) as on page \IroningI and [AK, theorem 2.1] respectively,
[TABLE]
where the addition is and . Note that . Theorem 5.1 (Parity recursions)**
[TABLE]
with and for finite sequences and . Here (as before) the addition is .
It follows that
[TABLE]
**Proof ** Fix and , then where and with for .
Using [AK, theorem 2.1] and (\Bat) as on page \Bat, we have ,
[TABLE]
Parity states and transition algorithm
The parity states are where
[TABLE]
In (☕) as on page ☕ ‣ Parities, Jumps Orbits, .
The parity states are given by and
[TABLE]
Parity proposition* For every , .*
Proof Define by
[TABLE]
It follows that
\bullet\ \ \ ;
\bullet\ \ \$$\text{\tt gcd}\,\{\zeta_{k}(0),\zeta_{k}(1)\}=1\ \forall\ k\geq 1;
\bullet\ \ \$$\text{\tt gcd}\,\{\zeta_{k}(0),\zeta_{k+1}(0)\}=1\ \forall\ k\geq 1;
\bullet\ \ \$$\mathbb{\langle}\{\zeta_{k}(0),\zeta_{k+1}(0)\}\mathbb{\rangle}=\mathbb{Z}\ \forall\ k\geq 1;
\bullet\ \ \$$\mathbb{\langle}\{\epsilon_{k},\epsilon_{k+1}\}\mathbb{\rangle}=\mathbb{Z}_{Q}. ☑
Jump blocks
Next, for , define the auxiliary jump blocks
[TABLE]
where
[TABLE]
It follows from (☕) that for :
[TABLE]
where addition is and that the jump block
[TABLE]
Orbit blocks
Define the auxiliary orbit blocks
[TABLE]
In particular by (☼)
[TABLE]
Our goal here is to obtain the transition between auxiliary orbit blocks.
Orbit block transitions
The simple displacement over the auxiliary jump block is
[TABLE]
The cumulative displacements over the concatenation jump blocks are
[TABLE]
By (*), for ,
[TABLE]
Generating functions of orbit blocks
For define the functions by
[TABLE]
and their generating functions
[TABLE]
Here and throughout, .
Transition matrices
Noting that
[TABLE]
we have
[TABLE]
where for ,
[TABLE]
(with as before).
Equivalently,
[TABLE]
where and is given by
[TABLE]
is given by:
[TABLE]
It follows that
[TABLE]
where .
§3 The random affine model
Probabilities
Here, we consider the probabilities
[TABLE]
and each as a random variable with sample space , and understand the transitions of the resulting stochastic processes
[TABLE]
in the RAT lemma.
Let
[TABLE]
then
[TABLE]
where is given by
[TABLE]
Random variables
We denote by , for a measurable space the collection of - valued random variables.
Consider any sequence of independent, random vectors
[TABLE]
whose marginals satisfy
[TABLE]
Note that when , then a.s. and that is defined when and only when .
Random affine transformations
Given a random vector
[TABLE]
the associated random affine transformation (RAT) defined by
[TABLE]
This RAT is of flip-type in the sense of [ABN2016].
Throughout this paper we’ll often denote a flip-type RAT
[TABLE]
by
[TABLE]
Here
[TABLE]
Given a sequence of independent random vectors as before, consider the associated RAT sequence
[TABLE]
of independent RATs defined by (\Handwash).
RAT characteristic function
The characteristic function of the RAT ( RAT-CF) is defined by
[TABLE]
Note that in (\dsjuridical) on page Probabilities is the RAT-CF of the RAT where are as in (\Handwash) on page \Handwash. RAT** lemma ****
For each :
[TABLE]
where is as in (☣) as on ☣ ‣ Generating functions of orbit blocks.
Here and throughout for RATs
[TABLE]
Proof For , define
[TABLE]
and
[TABLE]
By construction,
[TABLE]
By (\dsjuridical) as on page Probabilities,
[TABLE]
The result follows by induction since . ☑
Associated affine random walks
We associate to a sequence
[TABLE]
of independent RATs an affine random walk (ARW).
This is the -valued stochastic process
[TABLE]
defined by
[TABLE]
Elementary presentation
We now split the random vectors into more elementary components.
Write
[TABLE]
then is a -valued random variable where
[TABLE]
and
[TABLE]
where and are -valued random variables; the latter is given by
[TABLE]
and
[TABLE]
Next define random variables by
[TABLE]
Now we define random variables by
[TABLE]
It is not hard to see that
[TABLE]
In the sequel, we’ll have recourse to the elementary random vector sequence where
[TABLE]
The RAT is constructed from the (deterministic) cumulative displacements .
§4 The RAT sequence in the quadratic case
We assume that ; thus . These hold if and only if there exist
[TABLE]
such that
[TABLE]
We next establish that the centered RAT sequence (as in [ABN2016]) corresponding to a quadratic irrational and a rational step function is “asymptotically eventually periodic”.
The proofs of theorems 2 3 rely on this fact.
This asymptotic eventual periodicity is obtained via centering. We’ll see that elementary random vector sequence is always asymptotically eventually periodic, however, the cumulative displacements may have linear growth. The centering is needed to offset this possibility.
In this section, we’ll often “possibly extend the period in ⚽” to demonstrate eventual periodicity of related sequences.
This means that for some , we’ll modify ⚽ to
[TABLE]
Recall ((☎) on page ☎ ‣ Parity states and transition algorithm) that the parity state transitions are given by
[TABLE]
In the quadratic case, these transitions form an eventually periodic sequence, whence
[TABLE]
is also eventually periodic.
These parity transitions only depend on .
If , then by possibly extending the period in ⚽, we may assume that
Simple displacement transitions
Consider the simple displacement vectors
[TABLE]
By theorem 5.1, for and :
[TABLE]
where as before.
Thus there exist matrices such that
[TABLE]
for each .
The simple displacement transformations also only depend on .
Seeing as
[TABLE]
we note that each is a linear image of (the coordinate of ) and for each .
Displacement lemma* Suppose that , then there exist and so that*
[TABLE]
For , the simple displacement transitions are eventually periodic and the proof of the displacement lemma rests on the Denjoy-Koksma inequality and a spectral analysis of the simple displacement transformations on over a period (as in the “eigenvalue lemma” below).
Subspace decomposition eigenvalues
For , the parity sequence is eventually periodic, whence the above sequence of matrices giving the displacement transitions is also eventually periodic.
Suppose that
[TABLE]
Thus
[TABLE]
Next, write and as .
The parity state transitions can now be rewritten as
[TABLE]
where
[TABLE]
and
[TABLE]
with defined by
[TABLE]
and
[TABLE]
are polynomials given by
[TABLE]
Set and let be given by
[TABLE]
for and .
Since , we have that form an orthogonal basis for and
[TABLE]
Moreover,
[TABLE]
Next, define the bracket by
[TABLE]
where .
It follows from (\dstechnical) that
[TABLE]
To summarize, letting for ,
[TABLE]
then
and . Eigenvalue lemma**
For , all the eigenvalues of are roots of unity.
**Proof **
We have that is a product of integer matrices of the form with ; we have for at least one of these matrices. Therefore is a positive matrix with integer coefficients and unit determinant. It follows that the characteristic polynomial of is an integer polynomial of form for some (and that is hyperbolic).
For each ,
[TABLE]
We claim first that no is hyperbolic. If this were not the case for , there would be and a rational cocycle with giving rise to either
\bullet\ \ \$$\|\sigma_{K+L{n}}\|\gg\lambda^{n} which is impossible by the Denjoy-Koksma estimate;
or
\bullet\ \ \$$\|\sigma_{K+L{n}}\|\ll\frac{1}{\lambda^{n}} which is impossible by theorem 1.
To continue, since is an integer matrix, is a polynomial with integer coefficients.
It follows that
[TABLE]
is also a polynomial with integer coefficients. As shown above, all its roots are of unit modulus. By Kronecker’s theorem ([Kronecker]), all these roots are roots of unity. ☑
**Proof of the displacement lemma **
Let be the collection of eigenvalues of counting multiplicity which are all roots of unity. Let be the corresponding Jordan subspace, then by the above,
[TABLE]
We may extend the period in ⚽ as on page ⚽ ‣ §4 The RAT sequence in the quadratic case so that .
For each let be the Jordan basis of .
For and , we have that
[TABLE]
Thus for ,
[TABLE]
This proves the displacement lemma. ☑
In the sequel, we’ll also need the following. Positivity proposition* By possibly extending the period in ⚽ as on Page ⚽ ‣ §4 The RAT sequence in the quadratic case, we may ensure that .*
Remark
Evidently iff . Recall the assumption as in the subsection on subspace decompositions and eigenvalues, that, the parity sequence is given by:
[TABLE]
**Proof **
It follows from (☞) as on page ☞ ‣ Subspace decomposition eigenvalues that
[TABLE]
Choose such that . A direct calculation shows
[TABLE]
where are matrices where each row and column has at least one non-zero entry.
By the parity proposition, and generate the group .
Applying this to , we get that there exists an such that for all , , meaning all of its entries are positive. Thus . This proves that is aperiodic and irreducible and that by extending the period, we can ensure that is a positive matrix. ☑
Asymptotic eventual periodicity centering
Let and be a step function with rational discontinuities with associated RAT sequence and ARW .
By the displacement lemma, we may suppose that
[TABLE]
Next, we examine the asymptotic, distributional periodicity of the RAT sequence and, in particular, that of the elementary random vector sequence:
[TABLE]
as on page Elementary presentation. Elementary periodic approximation lemma**
There are constants and, for each there is a random vector
[TABLE]
so that
[TABLE]
**Proof ** We have that
[TABLE]
where
[TABLE]
Now and each , so is hyperbolic, with eigenvalues and .
Moreover, there exists with so that
[TABLE]
whence
[TABLE]
Define random variables by
[TABLE]
It follows that for ,
[TABLE]
Next, we observe that for , the distribution of given does not depend on and define:
[TABLE]
and
[TABLE]
Analogously, has a conditional distribution independent of and we define
[TABLE]
The random vectors where
[TABLE]
are as advertised by construction. ☑
RAT** periodic approximation lemma****
There are random variables so that if
[TABLE]
then so that ,
[TABLE]
where
[TABLE]
**Proof **
Let be independent, each distributed as in (\dsagricultural).
Define
[TABLE]
then, since
[TABLE]
we have by the elementary periodic approximation lemma,
[TABLE]
To study the random variables , we’ll need formulae for the cumulative displacements.
Using the displacement lemma, for ,
[TABLE]
where
[TABLE]
•
It follows that
[TABLE]
Now let be the RATs defined by
[TABLE]
for all then there is a constant so that ,
[TABLE]
Finally, let
[TABLE]
This has the form
[TABLE]
for all where .
It follows from (‡) that satisfies (🚲) and (\dsmedical). ☑
Coupling
It follows that there exists a probability space on which the independent random vectors ( ) can be defined so that
[TABLE]
Consider the ARW
[TABLE]
ARW** periodic approximation lemma****
There is a constant so that for all ,
[TABLE]
and
[TABLE]
**Proof of (\dscommercial) **
[TABLE]
Proof of (\dsheraldical) For fixed and a measurable function , for which is integrable, let
[TABLE]
then is a norm.
Next, it follows from the RAT periodic approximation lemma that
[TABLE]
whence
[TABLE]
Thus, for some ,
[TABLE]
Thus possibly increasing ,
[TABLE]
and (\dsheraldical) follows. ☑
Corollary* There are constant vectors and so that*
[TABLE]
**Proof ** We have
[TABLE]
where
[TABLE]
and are independent and identically distributed.
It follows as in [ABN2016] that
[TABLE]
By the positivity proposition, by possibly extending the period in ⚽ as on page ⚽ ‣ §4 The RAT sequence in the quadratic case, we may ensure that is an aperiodic stochastic matrix whence is a simple, dominant eigenvalue with eigenvector .
Suppose that satisfies (where is the transpose of the matrix ).
Let , then
[TABLE]
where and so that .
We claim next that so that
[TABLE]
**Proof of (☢) **
By (\dschemical) as on page Coupling,
[TABLE]
where
[TABLE]
To obtain the expansion for from (☢) (with enlarged ), it suffices to show that .
This will follow from the Denjoy-Koksma estimate.
By (\dsheraldical) as on page Coupling, we have
[TABLE]
Thus, if , then by (☢), contradicting the Denjoy-Koksma estimate that . The expansion for follows. ☑
Centering
As in [ABN2016], set be the centered ARW defined by
[TABLE]
and let be the independent RAT sequence so that
[TABLE]
ARW** centering lemma****
There is a centered, independent, identically distributed RAT sequence and so that if for , is defined by
[TABLE]
then
[TABLE]
**Proof **
Define
[TABLE]
As in [ABN2016], is given by the centered RAT sequence where and
[TABLE]
where are independent, identically distributed random variables and is the identity matrix.
By the remark after the positivity proposition, is irreducible and aperiodic.
Thus, by the variance lemma in [ABN2016], for each ,
[TABLE]
By (\dsheraldical) as on page Coupling,
[TABLE]
whence, by the Denjoy-Koksma estimate, and .
Thus
[TABLE]
Accordingly, define by
[TABLE]
The lemma follows. ☑
§5 Spectral theory and theorem 2
By the Perron-Frobenius theorem, is a simple, dominant eigenvalue of (where and is the RAT-CF as defined by (\dsliterary) on page RAT characteristic function) with right eigenvector and left eigenvector satisfying .
By the implicit function theorem and smooth functions
[TABLE]
so that
\bullet\ \ \$$\mathbb{\langle}\pi(0),v(\theta)\mathbb{\rangle}=\mathbb{\langle}\pi(\theta),v(\theta)\mathbb{\rangle}=1;
\bullet\ \ \$$\lambda(0)=1,\ v(0)=\mathbb{1}\ \&\ \pi(0)=\pi;
\bullet\ \ \for each , is a simple, dominant eigenvalue of with eigenvector and left eigenvector .
As in [HH], consider the principal projections defined by
[TABLE]
then possibly reducing , we ensure so that
[TABLE]
where .
The proofs of our limit theorems in the sequel use the following lemma.
**Lemma: Taylor expansion of the eigenvalue Under the assumptions of Theroem 2,
[TABLE]
as where is positive definite.
Proof We have
[TABLE]
where is the matrix of second partial derivatives:
[TABLE]
and we must show that and that is positive definite.
Fix and write, for differentiable ,
[TABLE]
then
[TABLE]
Accordingly, it suffices to show that for each
(i) and (ii) .
¶1 . **Proof of ¶1 ** For fixed :
[TABLE]
**Proof of (i) **
Since , we have that . Also
[TABLE]
whence
[TABLE]
and in particular
[TABLE]
Thus
[TABLE]
¶2 . **Proof ** Differentiating at [math]:
[TABLE]
By ¶1 (i),
[TABLE]
Thus for some . But , and so
[TABLE]
¶3 . **Proof ** Differentiating twice at [math] in direction :
[TABLE]
By (i) ¶2
[TABLE]
and in particular
[TABLE]
**Proof of (ii) ** For fixed :
[TABLE]
whence by ¶3,
[TABLE]
with equality iff .
Next recall that .
If , then, taking we have
[TABLE]
whence
[TABLE]
It follows from this that and that is a coboundary.
In view of the assumption that has full dimension, this contradicts theorem 1 and completes the proof of the lemma. ☑ (ii) ∎**Proof of theorem 2 ** It suffices to prove that for fixed
[TABLE]
By asymptotic, eventual periodicity so that for any fixed and all ,
[TABLE]
where for a constant independent of . By the Taylor expansion of the eigenvalue,
[TABLE]
To deduce (\dsrailways) from this, let and choose so that
[TABLE]
and then choose so that
[TABLE]
This implies (\dsrailways). ∎
§6 The WRLLT and theorem 3
Visits to zero and RATs
Recall that we assume , with .
Let satisfy and define by
[TABLE]
and by
[TABLE]
Let . *Visit lemma *** Let be the associated ARW, then
[TABLE]
Visit sets
The visit set to is
[TABLE]
and the visit distributions are the discrete measures on defined by
[TABLE]
The auxiliary visit sets to are
[TABLE]
and the auxiliary visit distributions are the discrete measures on defined by
[TABLE]
As above,
[TABLE]
**Visit sublemma ****
[TABLE]
Proof Fix is a step function on , whence Riemann integrable. Using the unique ergodicity of ,
[TABLE]
By [AK, Theorem 2.1] and the orbit block transitions, for and so that
[TABLE]
and
[TABLE]
Since , it follows that
[TABLE]
Also by (\dsmilitary), for fixed
[TABLE]
**Proof of (4.1) ** We have for fixed
[TABLE]
Thus
[TABLE]
and using \Yinyang as on page \Yinyang with
[TABLE]
**Proof of (4.2) **
Using \Yinyang as on page \Yinyang with arbitrary and fixed we have
[TABLE]
Similar to (\dsmilitary) as on page Visit sets,
[TABLE]
for some .
We have as before, for fixed ,
[TABLE]
Fix . For fixed ,
[TABLE]
Thus
[TABLE]
Using this and Hölder’s inequality,
[TABLE]
whence
[TABLE]
**Proof of the Visit Lemma **
Let
[TABLE]
then
[TABLE]
Using (4.1) in the sublemma and the Riesz-Fischer theorem, we see that
[TABLE]
This is (a). To see (b),
[TABLE]
This is (b). ☑
Adaptedness
As in [ABN2016], the norm of a matrix is given by
[TABLE]
where .
We’ll call the RAT adapted if a discrete subgroup (called the adaptivity group) so that
[TABLE]
Equivalently, for some ,
[TABLE]
Now, writing , we have as
[TABLE]
where for a -valued random variable, the covariance matrix is defined by
[TABLE]
A covariance matrix is non-negative definite in the sense that
[TABLE]
and is called positive definite if it is invertible. Equivalently, for some (the minimum eigenvalue modulus)
[TABLE]
Thus, is adapted iff
[TABLE]
It follows as in [ABN2016] that if is adapted, then so that
[TABLE]
The following lemma gives a sequence version of adaptedness similar to that in [ABN2016]. Adaptedness lemma* For large, a discrete subgroup and so that*
[TABLE]
where where is the independent RAT sequence as on page Centering.
The proof is in a series of steps, the first two of which are as in [TM].
¶1 If satisfy , then with equality iff
[TABLE]
where is the multiplicative circle. **Proof ** Write . Evidently (a) .
Now suppose that with , then
[TABLE]
If , then and
[TABLE]
and so that
[TABLE]
Thus, for ,
[TABLE]
which is (a). ☑
Next, for , let
[TABLE]
By ¶1, . Set .
¶2 is a discrete subgroup of and
[TABLE]
**Proof ** Since ,
[TABLE]
which is evidently a subgroup of .
Now suppose that with where . By ¶1,
[TABLE]
Equivalently
[TABLE]
whence
[TABLE]
Statement (b) follows from this, whence ¶2 via the Taylor expansion of . ☑
¶3 For sufficiently large, is an adapted RAT with adaptivity group . **Proof ** Fix and so that
[TABLE]
It follows that is adapted with adaptivity group . ☑
To complete the proof of the lemma, fix and let
[TABLE]
Statements (i) and (ii) follow because for each ,
[TABLE]
and statement (iii) follows from
[TABLE]
To establish theorem 3, we use the following. Weak, rough local limit theorem**
For each and ,
[TABLE]
The proof is a multidimensional version of the proof of the WRLLT in [ABN2016]. **Proof of **
By theorem 6.1 in [ABN2016], for each , we have
[TABLE]
Thus, by the Adaptedness lemma, so that
[TABLE]
Next, fix , then by Chebyshev’s inequality,
[TABLE]
Now fix so that
[TABLE]
We have
[TABLE]
For , we have
[TABLE]
whence
[TABLE]
**Proof of **
We have
[TABLE]
Fix so that . By the Adaptedness lemma, for we have
[TABLE]
and
[TABLE]
[TABLE]
**Proof of theorem 3 **
Set . The Visit lemma and the WRLLT show that
[TABLE]
Next, so that whence for
,
[TABLE]
and for ,
[TABLE]
References
