Random substitution tilings and deviation phenomena
Scott Schmieding
Northwestern University
[email protected]
and
Rodrigo Treviño
University of Maryland
[email protected]
Abstract.
Suppose a set of prototiles allows N different substitution rules. In this paper we study tilings of Rd constructed from random application of the substitution rules. The space of all possible tilings obtained from all possible combinations of these substitutions is the union of all possible tilings spaces coming from these substitutions and has the structure of a Cantor set. The renormalization cocycle on the cohomology bundle over this space determines the statistical properties of the tilings through its Lyapunov spectrum by controlling the deviation of ergodic averages of the Rd action on the tiling spaces.
1. Introduction
In this paper we study tilings which are generated by random combinations of substitutions using a finite family of substitution rules. This generalizes the constructions and results known for self-similar tilings, which are tilings constructed from a single substitution rule. As an example to keep in mind, consider the two substitution rules defined for the following triangles:
We first point out that the two substitutions are in fact different; it is not the case that one is the power of another. Moreover, their expansion constants are not related by a power. These two substitution rules were discovered in [GKM15].
The general procedure for constructing self-similar tilings from a single substitution rule can be roughly described as follows: start with a single tile, apply the substitution rule and rescale the tiled polygon so that the tiles in the polygon are isometric copies of the tiles on which the substitution rule is defined. Doing this infinitely many times and carefully taking a limit, one obtains a self-similar tiling.
Now, for the triangles in the figure above, suppose that instead of using a single substitution rule to build a tiling one applies a sequence of substitutions randomly chosen from among the two substitutions given above to construct a tiling. Suppose Tx and Tx′ are two different tilings constructed from two sequences x=x′∈{1,2}N, the entries of which determine the order in which we apply either substitution rule. We may ask:
- (i)
How are Tx and Tx′ related?
2. (ii)
How are the respective tiling spaces of Tx and Tx′ related?
3. (iii)
Will the dynamics defined by Tx and Tx′ be conjugate?
4. (iv)
What determines the statistical properties of the two tilings Tx and Tx′ such as asymptotic patch frequency?
The answers to these questions in the self-similar case are well-known to be related to the geometry and combinatorics of the substitution rule. In this paper we show that what determines the answers to these and other questions are the ergodic shift-invariant measures on {1,2}N, the typical points x,x′ of which which we take to construct tilings.
Our construction of tilings using graph iterated function systems is inspired by the blowup construction of Barnsley and Vince [BV17] but we make use of Bratteli diagrams to organize and give structure to all of the possible combinations of substitutions we may use. The use of Bratteli diagrams in the study of tilings goes back several decades, see e.g. [Kel95, BJS10, JS12]. Our use of Bratteli diagrams can particularly be seen as a non-stationary version of those used in [Kel95]. Our formalism using Bratteli diagrams also has many parallels to the fusion theory of Priebe-Frank and Sadun [FS14].
There have been other works where random substitutions have been investigated [GM13, BD14, Rus16, RS18] but most of the results in those are one-dimensional in nature. A difficulty which arises in the case of higher dimensional tilings, which is of independent interest in itself, is whether a given set of tiles admits more than one substitution rule. The results of [GKM15] indicate that although this is a hard question in general, one can find plenty of interesting examples by considering triangles with angles which are integer multiples of π/n for most n>4. The figure above is one of many examples found in [GKM15].
Our approach here is the one adopted in the study of translation flows in Teichmüller dynamics. To summarize, given a finite set of substitution rules we can consider all possible tiling spaces which can be constructed from these subsitution rules. This serves as a sort of “moduli space” of tiling spaces coming from a given family of substitutions on the same set of tiles. There is a dynamical system on this moduli space and the dynamics on this moduli space determine many of the properties of the tilings constructed. The dynamics on the moduli space are known as renormalization dynamics.
Tiling spaces associated to aperiodic tilings are foliated spaces which are not manifolds; instead, they are locally the product of a manifold with a Cantor set. As such, in contrast to the situation in Teichmüller dynamics, there is no Hodge theory for tiling spaces, so we have to come up with some components which are missing in the context of tiling spaces, such as a useful norm on the relevant cohomology bundle. Moreover, it is not clear whether there are Sobolev spaces where de Rham regularization yields an isomorphism between finite-dimensional smooth cohomology and any type of finite-dimensional Sobolev cohomology, so analytic approaches using Sobolev norms (e.g. [For02], [FF03], [CF15]) are not clearly applicable in this setting.
A thorough study of the moduli spaces defined by families of substitutions falls outside the scope of the present paper, and the investigation of such moduli spaces is a topic we plan pursue in future work. Thus, while we do not explicitly call anything in the paper an actual moduli space, the reader familiar with dynamics on moduli spaces will recognize our use of the shift on ΣN as the dynamics on moduli space where the action of some mapping class group of a tiling space acts through a map induced by the shift.
Our blowup construction through graph iterated function systems to construct tilings and tiling spaces is quite general. The restrictions we impose here allow us to obtain tilings and tiling spaces which have finite complexity (and, in addition, finite-dimensional cohomology). However, relaxing these restrictions may give tilings of several, even infinite, scales, as well as tilings of infinite complexity. Our hope is to extend the renormalization tools used in this paper to study the more general case of multiscale and tilings of infinite complexity.
As mentioned above, the constructions here generalize the construction of self-similar tilings, and our main result generalizes the results [Sad11, BS13, ST18a] to the context of not-self similar tilings. These types of results are not only illuminating in the study of tilings, but also are of interest to the mathematical physics community. Since mathematical tilings are taken as models for quasicrystals, the results here yield results about the convergence properties of diffraction measures for quasicrystals (see [ST18a]). In addition, these results also yield information about convergence properties in the Bellissard-Shubin formula for the integrated density of states for random Schrodinger operators on quasiperiodic media, as well as traces in the ∗-algebras of certain types of operators as in [ST18b].
1.1. Statement of results
Suppose we have N substitution rules F1,…,FN on the same set of prototiles which satisfy certain conditions (see Definition 8 in §4). The assumptions guarantee that most tilings constructed from these substitution rules will have finite complexity. Given x∈{1,…,N}Z, we can construct a (bi-infinite) Bratteli diagram Bx which records a set of instructions used to create a tiling. A Bratteli diagram is an infinite directed graph partitioned into levels indexed by Z (Bratteli diagrams are defined in §3), so the kth level of Bx is defined by xk. We construct tilings from infinite paths in Bx, and as long as Bx is connected enough, the collection of all such tilings gives a tiling space Ωx with an action of Rd given by translations. We call such sufficiently connected diagrams Bx minimal (minimal diagrams are defined in §3.1), and minimal diagrams yield tiling spaces with minimal Rd-actions. A shift-invariant measure on ΣN is minimal if Bx is minimal for μ-almost every x.
The shift σ:ΣN→ΣN defines a homeomorphism Φx:Ωx→Ωσ(x) which is a conjugacy between the translation actions in Ωx and Ωσ(x), respectively, and drives the renormalization dynamics (this is found in §5). We define the cohomology bundle HF over ΣN where the fiber over x is the vector space Hd(Ωx;R) and the renormalization cocycle is the bundle map (x,c)↦(σ(x),(Φx−1)∗c) over the shift σ.
As such, given a σ-invariant ergodic minimal measure μ on ΣN, Oseledets theorem yields Lyapunov exponents λ1≥⋯≥λr which measure the exponential rate of growth of vectors in Hd(Ωx;R) under the renormalization cocycle. The rapidly expanding subspace Ex+⊂Hd(Ωx;R) corresponds to vectors with Lyapunov exponents λi satisfying dλi>(d−1)λ1. The functions whose ergodic integrals we study are the analogue of C∞ functions on manifolds, which are the transversally locally constant functions, denoted Ctlc∞(Ωx) (they are defined in §6.1). For a set B⊂Rd we denote by T⋅B the rescaling of B by T>0, that is, T⋅B=TIdB.
Theorem 1**.**
Let F={F1,…,FN} be a family of substitution rules satisfying the conditions of Definition 8 in §5. Let μ be a minimal σ-invariant ergodic probability measure on ΣN, and let λ1≥⋯≥λρ be the Lyapunov exponents for μ corresponding to vectors in Ex+. Then for μ-almost every x∈ΣN, there are ρ Rd-invariant distributions D1,…,Dρ∈Ctlc∞(Ωx)′ such that for any f∈Ctlc∞(Ωx), if Di(f)=0 for all i<j≤ρ and Dj(f)=0, for a good Lipschitz domain B⊂Rd and T∈Ωx we have that
[TABLE]
Moreover, for any ε>0 there exists a compact subset Bε which is ε-close in the Hausdorff metric to B, a convergent sequence of vectors τk∈Rd and a sequence Tk→∞ such that
[TABLE]
Finally, if Di(f)=0 for all i≤ρ, then
[TABLE]
Remark 1**.**
As in the case of translation flows [For02], the lower bound is harder to obtain than the upper bound, and the geometry of the group acting on the spaces comes into play in the derivation of a lower bound. For tilings of dimension greater than 1 (d>1), unlike the case of flows, the geometry of Rd is nontrivial, which is why we must make small changes to the averaging sets to obtain a lower bound along a subsequence.
1.2. Outline
This paper is organized as follows. In §2 we review the necessary materials for tilings and tilings spaces. In §3 we review graph iterated function systems as well as Bratteli diagrams and construct Bratteli digrams from graph iterated functions systems. In §4 we show how to construct tilings using infinite paths on the Bratteli diagrams constructed from families of graph iterated function systems. We also relate the strcuture of the Bratteli diagram to the structure of the tiling space. In §5 we extend the construction to bi-infinite Bratteli diagrams and introduce the renormalization operations on the tiling spaces. §6 concerns the cohomology of the tiling spaces constructed and it culminates with explicit norm on the cohomology spaces of top degree for tiling spaces. In §7 we define the cohomology bundle and define the renormalization cocycle. Using all this, in §8, we prove the main results on deviation of ergodic averages. The route we follow is inspired by Forni’s work on translation surfaces[For02] (see also [DHL14, §5]).
Acknowledgements**.**
We would like to thank Giovanni Forni for pointing out a gap in the paper in an early draft. S.S was supported in part by the National Science Foundation grant ‘RTG: Analysis on manifolds’ at Northwestern University. R.T was supported by the National Science Foundation through grant DMS-1665100.
2. Background
A tile t is a bounded, connected subset of Rd. We assume tiles have non-empty interior and regular boundary. A tiling T of Rd by tiles {ti}i is a cover of Rd by translated copies of the tiles ti such that any two different tiles in this cover intersect, at most, along their boundaries. Here we are only concerned with tilings obtained using copies of a finite set of tiles {t1,…,tM}, called the set of prototiles. A patch P of the tiling T is a finite subset of the tiles of T, and the support of a patch P is the union of the tiles contained in P. Finally, denote by ∂T the union of the boundaries of all the tiles covering Rd in the tiling T, and ∂P the union of boundaries of the tiles contained in the patch P of T. We say a tiling T is regular if the set ∂T is closed in Rd. In this paper we will only consider regular tilings.
A tiling T admits a substitution rule if there exists a scaling factor s∈(0,1) such that each prototile ti can be tiled by the prototiles {st1,…,stM}. A tiling which admits a substitution rule is called a substitution tiling.
Tilings can be pushed around: for any τ∈Rd we denote by φτ(T)=T+τ the translation of the tiling T by the vector τ. A tiling T is repetitive if for any patch P⊂T there exists an R>0 such that for any x∈Rd the set Bx(R)∩T contains a translated copy of P. A tiling T has finite local complexity if for every R>0 there exists a set of patches P1R,…,PNRR such that for any x∈Rd the union of all the tiles of T which intersect Bx(R) is a translated copy of one of the patches PiR. A tiling T is aperiodic if φτ(T)=T implies that τ=0. In this paper we will only be concerned with aperiodic tilings of finite local complexity.
Denote by Πd:Rd→Sd the inverse of the stereographic projection. We can impose a distance on the set of all translates φτ(T) of a regular tiling T by
[TABLE]
where dH(X,Y) is the Hausdorff distance of two closed subsets X,Y⊂Sd. The completion
[TABLE]
with respect to the metric (1) is called the tiling space of T. As such, at admits an action of Rd by translation and thus is foliated by the orbits of this action. It is compact if T has finite local complexity, and the translation action of Rd is minimal if and only if T is repetitive.
Let T be a regular, repetitive tiling of Rd of finite local complexity whose tiles are all copies of a finite set of prototiles {t1,…,tM}. Pick a point pi∈ti in the interior of each prototile. Then each tile in the tiling T has a distinguished point in its interior coming from the distinguished points pi. The canonical transversal
[TABLE]
is a Cantor subset of ΩT if T has finite local complexity. Its name comes from the fact that it intersects every Rd orbit. This set depends on our choice of distinguished points for the prototiles, but we get homeomorphic sets as long as our choice for distinguished points in every tile is uniform. The following is well known.
Proposition 1**.**
Let T be an aperiodic, repetitive tiling of finite local complexity. The topological space ΩT has a basis given by sets of the form C×V, where C is a Cantor set and V⊂Rd is homeomorphic to an open disk.
For a closed subset S⊂Rd, a tiling T, and r>0, define the sets
[TABLE]
2.1. Lipschitz domains
Let Hm denote the m-dimensional Hausdorff measure.
Definition 1**.**
A set E⊂Rd is called m-rectifiable if there exist Lipschitz maps fi:Rm→Rd, i=1,2,… such that
[TABLE]
Definition 2**.**
A Lipschitz domain A⊂Rd is an open, bounded subset of Rd for which there exist finitely many Lipschitz maps fi:Rd−1→Rd, i=1,…,L such that
[TABLE]
Lipschitz domains have d−1-rectifiable boundaries.
Definition 3**.**
A subset A⊂Rd is a good Lipschitz domain if it is a Lipschitz domain and Hd−1(∂A)<∞.
3. Graph iterated function systems
Here we recall the basics of graph iterated function systems (GIFS), our goal being to build a graph which will represent an iterated function system. Suppose we have M∈N copies of Rd, denoted by R1d,…,RMd, and let
[TABLE]
Suppose we have r(i,j)∈N maps fi,j,k:Rid→Rjd, with k∈{1,…,r(i,j)}. Suppose S⊂X is of the form S=S1×⋯×SM, where Si⊂Rid. The GIFS associated to this collection of maps is the mapping of sets defined as
[TABLE]
An attractor for the GIFS F is a set A=A1×⋯×AM⊂X satisfying F(A)=A.
The following is a more general point of view. Let C be the set of all closed subsets of Rd endowed with topology induced by the Hausdorff metric, which makes it a compact metric space. Let Ck=C×⋯×C be the Cartesian product of C with itself k times with the product topology. A GIFS F as above induces a map F:CM→CM as follows. Let S=(S1,…,SM)∈CM. Then
[TABLE]
It is well known that if each fi,j,k is a contraction, then F is a contraction. As such, by Hutchinson’s theorem [Hut81], there is a fixed point for F which is an attractor for F. A GIFS F is contracting, uniform affine scaling (CUAS) if there exists a s∈(0,1) such that all maps are of the form f(x)=sx+q, for some q∈Rd.
Lemma 1**.**
Any substitution rule is given by a CUAS GIFS.
Proof.
For T to be a substitution tiling it needs to admit a substitution rule. By definition, a substitution rule gives a way of covering each prototile ti with copies of scaled prototiles {st1,…,stN}. So for our GIFS we take M to be the number of prototiles and the maps fi,j,k the different maps which take each prototile into another prototile. Since it is a substitution tiling, the attractor is the product of the prototiles.
∎
Given a GIFS F={fi,j,k} we can associate a graph as follows. The graph will have ∣V∣=M vertices labeled v1,…,v∣V∣ and there will be r(i,j) directed edges going from vertex vi to vertex vj. Note that there is a bijection between the edges of the graph and the maps fi,j,k of the GIFS.
Definition 4**.**
A set of GIFS F={F1,…,FN} is said to have a shared attractor if the attractor for Fi is the same as the attractor for Fj for all i,j.
Definition 5**.**
A family of GIFS F={F1,…,FN} is called contracting, uniformly affine scaling (CUAS) if there are (θ1,…,θN)∈(0,1)N such that all maps associated to Fi are of the form f(x)=θix+b for some b∈Rd.
Remark 2**.**
Given a CUAS family F of GIFS with shared attractor A, without loss of generality, we will always assume that the origin is contained in the interior of the attractor. Whenever the attractor corresponds to the product of the prototiles in a substitution tiling this can be done by choosing a distinguished point in the interior of each prototile and making this distinguished point the origin.
3.1. Bratteli diagrams and GIFS
A Bratteli diagram is an infinite directed graph B=(V,E) with both the vertex and edges sets partitioned as
[TABLE]
with surjective maps r:Ek→Vk and s:Ek→Vk−1 called, respectively, the range and source maps. Since the graph is directed, the maps r,s describe where individual edges end and begin, respectively. We shall always assume that the sets ∣Vk∣ and ∣Ek∣ are finite for all k.
A Bratteli diagram can also be described by the transitions between levels. That is, the data of the edges between Vk−1 and Vk is given by a matrix Mk defined by
[TABLE]
The matrix Mk is called the kth** transition matrix** of the Bratteli diagram.
A finite path of a Bratteli diagram is a collection of edges eˉ=(ei,…,ej) with r(ek)=s(ek+1) for all k=1,…,j−1. We extend the domain of the source map to the set of all finite paths by assigning the source of a path to be the same vertex which is the source of the first edge of the path. Likewise, we can extend the domain of the range map to all finite paths by assigning the range of the last edge on the path. We denote by Ep,q the set of all paths with source in Vp and range in Vq. For v∈Vk, we also denote by Ev the set of all paths eˉ with s(eˉ)∈V0 and r(eˉ)=v, i.e. all paths which end in the vertex v.
An infinite path of a Bratteli diagram is a collection of edges eˉ=(ei,ei+1,…) with r(ek)=s(ek+1) for all k>i−1 and we extend the domain of the source map to include infinite paths in the obvious way. We denote the set of all infinite paths with source in V0 by XB and endow it with the (infinite) product topology coming from the fact that XB can be seen as a subset of the infinite product of sets of edges Ek. Given eˉ=(e1,e2,…)∈XB we define eˉ∣k to be the finite path (e1,…,ek).
The topology of XB is generated by cylinder sets: if eˉ∣k is a finite path, we define Ceˉ∣k to be the open set of all paths which agree with eˉ in the first k edges. The collection of such cylinder sets Ceˉ forms a basis for the topology on XB, and XB is a compact totally disconnected space.
The tail of a path eˉ∈XB from level k is the infinite path (ek+1,ek+2,…). Two paths eˉ and fˉ are tail equivalent if there exists a k so that the tail of eˉ from level k is the same as the tail of fˉ from level k. This is an equivalence relation on XB and we denote by [eˉ] the tail-equivalence class of eˉ∈XB. A Bratteli diagram is minimal if for any eˉ∈XB the tail-equivalence class [eˉ] is dense in XB. A tail-equivalence class [eˉ] is called a periodic component of XB if it is finite.
Definition 6**.**
A Borel probability measure μ on XB is invariant under the tail equivalence relation if for any two finite paths eˉ, eˉ′ with the property that s(eˉ),s(eˉ′)∈V0 and r(eˉ)=r(eˉ′), we have that μ(Ceˉ)=μ(Ceˉ′).
Such measures will be referred to as invariant measures. If μ is an invariant measure on XB and v∈Vk, then we define
[TABLE]
for any eˉ∈E0,k with r(eˉ)=v. By definition of invariance, this is independent of the path chosen in E0,k.
3.1.1. Bratteli diagrams and GIFS
Suppose that we have N substitution rules defined on the same set of prototiles. By Lemma 1, these are given by a CUAS family of GIFS F={F1,…,FN} with shared attractor. Each GIFS Fi defines a matrix Mk=M(Fk) with integer entries: M(Fk)i,j is the integer r(i,j) coming from the GIFS in (4). Denote by M1,…,MN the different matrices for F and define Zˉ:=Z−{0}. For x=(x1,x2,…)∈ΣN:={1,…,N}Zˉ, the Bratteli diagram Bx(F)=Bx(F1,…,FN)=(Vx,Ex) is the Bratteli diagram with transition matrix Mk=M(Fxk) between Vk−1 and Vk for all k>0. This is called Bratteli diagram with parameter x. Note that in this construction there is a map fi,j,k associated to each edge e∈Ex.
Remark 3**.**
Note that even though the Bratteli diagram Bx(F) only depends on the coordinates of x∈ΣN with index greater than zero, we still take x to be a bi-infinite sequence and not only an infinite sequence. This is because having an infinite past will help us define homeomorphisms between tiling spaces. This will become clear in §4.1.
4. Blowups and random substitutions
The following condition first appeared in [GM13] and it ensures that a family F of GIFS gives a substitution rule with enough structure to guarantee finite complexity.
Definition 7** (Compatibility).**
A family F={F1,…,FN} of GIFS with shared attractor A=A1×⋯×AM are compatible if for every i, Ai has a CW-structure and if for any v∈V−V0, for any eˉ,eˉ′∈Ev with feˉ(As(eˉ))∩feˉ′(As(eˉ′))=∅, the intersection is a union of d−1 cells in both feˉ(As(eˉ)) and feˉ′(As(eˉ′)).
In order to reduce the tedious number of adjectives assigned to families of graph iterated function systems we make the following definition.
Definition 8** (Type H).**
A type H family F is a finite collection {F1,…,FN} of graph iterated function systems which
- (i)
is contracting,
2. (ii)
is uniformly affine scaling,
3. (iii)
has a shared attractor containing the origin,
4. (iv)
is compatible.
Let F={F1,…,FN} be a type H family and pick x∈ΣN. Let Bx(F)=(Vx(F),Ex(F)) be the Bratteli diagram given by the family F GIFS and parameter x. Note that the number of vertices is the same for all levels (as it is given by the number of prototiles in each of the substitutions) and we denote this number by M=∣V∣. Recall that the set of edges is in bijection with contracting maps fi,j,k of Rd in (4). Thus, to any edge e∈Ex(F) there is a unique contracting map fe:Rd→Rd.
Given a finite path eˉ=(ep+1,…,eq)∈Ep,q on Bx(F1,…,FN) we define an associated map
[TABLE]
Starting from the attractor A=A1×⋯×AM we can build a sequence of tiled patches of arbitrarily large size through “blowups” [BV17].
Pick eˉ∈E0,k. The idea behind blowups is first to consider each part Ai of the attractor A as a prototile, and label the prototiles with the vertices {v1,…,vM}. Since finite paths eˉ give us maps through composition as in (6), we can start with a part of the attractor Ai and apply the inverse of the map feˉ to “blow up” Ai. More precisely, for eˉ∈E0,k consider the set feˉ−1(Ar(eˉ)), where Ar(eˉ)=Aj if r(eˉ)=vj∈Vk.
This set feˉ−1(Ar(eˉ)) is the rescaling of Ar(eˉ) by the factor θx1−1⋯θxk−1, where the θi’s are the scaling factors in Definition 5. Moreover, this larger copy of Ar(eˉ) is tiled by tiles of the form feˉ−1∘feˉ′(As(eˉ′)), where eˉ′ is any path from V0 to r(eˉ). In other words:
[TABLE]
Let us emphasize that the union in (7) is the union of copies of prototiles: for each eˉ′∈Er(eˉ), feˉ−1∘feˉ′(As(eˉ′)) is a copy of the prototile As(eˉ′). So feˉ−1(Ar(eˉ)) in (7) is a patch of some tiling since it decomposes as the union of copies of prototiles.
Definition 9**.**
Let B=Bx(F1,…,FN) be a Bratteli diagram with parameter x built from a type H family F, and pick eˉ∈XB. For k∈N, the kth** approximant of eˉ** is the union of tiles forming the set feˉ∣k−1(Ar(eˉ∣k)) as defined in (7). We denote by Pk(eˉ) the kth approximant of eˉ. By convention we make the zeroth approximant P0(eˉ):=As(eˉ).
Since we have assumed that the shared attractor contains the origin in its interior, it follows that Pk(eˉ)⊂Pk+1(eˉ) for any k. That is, the tiles in the approximant Pk(eˉ) are also tiles in the approximant Pk+1(eˉ). Thus, taking arbitrarily large values of k tiles arbitrarily large parts of Rd through (7).
Definition 10**.**
Let B=Bx(F1,…,FN) be a Bratteli diagram with parameter x, where F is a type H family, and pick eˉ∈XBx. The tiling associated to eˉ is
[TABLE]
Note that the approximants Pk(eˉ) are patches of Teˉ. Patches of the form Pk(eˉ) are also called level k supertiles.
We now investigate when it is the case the the tilings Teˉ defined above cover all of Rd or just parts of it.
Let F={F1,…,FN} be a type H family and x∈ΣN. Let Bx(F)=(V,E). For each ℓ∈N, let
[TABLE]
and denote by
[TABLE]
the set of paths which are in ∂Vk for infinitely many k.
Lemma 2**.**
Let F={F1,…,FN} be a type H family. Then the tiling Teˉ covers all of Rd if eˉ∈limsup∂Vk.
Proof.
Let eˉ∈limsup∂Vk. There exists a j such that eˉ∈∂Vk for all k>j. This means the support of Pk(eˉ) is contained in the interior of the support of Pk+1(eˉ), at a positive distance from the boundary of the support of Pk+1(eˉ), uniformly for all k>j. Thus the nested approximants Pk−1(eˉ)⊂Pk(eˉ)⊂Pk+1(eˉ)⊂⋯ eventually cover all of Rd.
∎
The following result will not be used for the main theorem. However it is still interesting to know how likely it is that a path eˉ∈XB gives a tiling Teˉ of Rd.
Lemma 3**.**
Let F={F1,…,FN} be a type H family. For x∈ΣN let E be the set of edges of the Bratteli diagram B=Bx(F), and assume Bx has M vertices at each level. For the two quantities
[TABLE]
suppose that λ−>0 and
[TABLE]
If μ is a Borel probability measure which is invariant under the tail equivalence relation, then μ(limsup∂Vk)=0.
In practice, we will usually have λ+=λ−>0, which will satisfy the hypotheses of the Lemma. In fact, under some mild assumptions of minimality of Bx, one can always show that λ+=λ−>0. We leave this to the interested reader to work out.
Proof.
Let μ be a Borel probability measure on XB which is invariant for the tail-equivalence relation. Note that
[TABLE]
for any k>0, where μ(v) is defined in (5). We will show that
[TABLE]
for any measure μ invariant under the tail equivalent relation. Thus by the Borel-Cantelli lemma we will have that μ(limsup∂Vk)=0.
First, we claim that for any ε∈(0,λ−) there exists a constant cε>0 such that
[TABLE]
for any v∈Vk and k>0. Indeed, by the definition of λ−, for any ε∈(0,λ−) there exists a c0 such that for any v∈Vk and k>0
[TABLE]
Then, since 1=v∈Vk∑μ(v)∣Ev∣, for any k, we have
[TABLE]
from which it follows that
[TABLE]
for any k>0 and v∈Vk, proving (11).
We now claim that for any ε∈(0,λ+) there exists a constant Cε such that
[TABLE]
Indeed, let v∈Vk and let eˉ∈XB be such that r(eˉ∣k)=v. Then Pk(eˉ) is a CW-complex of volume Vol(Ar(eˉ∣k))(θxk⋯θx1)−d tiled by ∣Ev∣ tiles, each a copy of some prototile ti, as in (7). Now, for any ε+∈(0,λ+) there exists a Cε′>0 such that
[TABLE]
Let r∗>0 be large enough that Br∗ contains a copy of any prototile ti in its interior. Since Pk(eˉ) is a CW-complex, then there exists a K such that Vol(∂5r∗(Pk(eˉ)))≤KVol(Pk(eˉ))dd−1. Now, since ∣∂Vk∣ is the number of paths in Ek which correspond to tiles on the boundary of approximants Pk(eˉ), ∣∂Vk∣ is proportional to Vol(∂5r∗(Pk(eˉ))). Combining this with the above bound, we get (12) with Cε=KCε′.
By (9) we can pick ε±∈(0,λ±) small enough so that
[TABLE]
and hence
[TABLE]
Finally, by (10), (11) and (12),
[TABLE]
for some λ∗∈(0,1), where we used (14) in the last equality. Thus we have that k>0∑μ(∂Vk)<∞, so by the Borel-Cantelli lemma, μ(limsup∂Vk)=0.
∎
Let F={F1,…,FN} be a type H family and suppose that Bx(F) is minimal. We define the set of singular paths by
[TABLE]
which, by Lemma 2, is a subset of limsup∂Vk.
Definition 11**.**
The extension set of Teˉ for eˉ∈ΣBx consists of all Teˉ′ where eˉ′ is a limit point of {eˉk}, with eˉk→eˉ∈ΣBx but eˉk∈ΣBx for all k.
That extensions exist whenever μ(ΣBx)=0 for a finite Borel invariant measure μ follows from Lemma 2: since eˉk∈ΣBx, Teˉk covers all of Rd. Since XB is compact, a limit exists along a subsequence. Thus, even if Teˉ does not tile all of Rd for eˉ∈ΣBx, there are tilings of Rd which contain the tiling Teˉ, namely any of its extensions. Finally, define
[TABLE]
Lemma 4**.**
Suppose F is a type H family, x∈ΣN and eˉ∈X˚Bx(F). Then Teˉ has finite local complexity.
Proof.
This follows from the compatibility condition, so there are finitely many local configurations.
∎
4.1. Topology revisited
Let F={F1,…,FN} be a type H family. Given Bx(F) we will denote by θxk the scaling factor of the GIFS associated with the level k of the Bratteli diagram Bx(F).
Lemma 5**.**
Let B=Bx(F) be a Bratteli diagram with parameter x for a type H family, and pick eˉ∈XB. Then:
- (i)
if eˉ1,eˉ2∈[eˉ], then there exists a τ such that Teˉ1=φτ(Teˉ2).
2. (ii)
the tiling space Teˉ only depends on the minimal component in XB containing eˉ.
Proof.
Let eˉ=eˉ′ in XBx be tail-equivalent: there exists a smallest k∈N such that eˉi=eˉi′ for all i>k. Consider the approximants Pk(eˉ) and Pk(eˉ′). By (7) both approximants are the set Ar(eˉ∣k) scaled by θx1−1⋯θxk−1 and are tiled by tiles in bijection with paths from V0 to r(eˉ∣k)=r(eˉ′∣k) in the same way. Thus there is a τ∈Rd such that Pk(eˉ)=φτ(Pk(eˉ′)) and ∂Pk(eˉ)=φτ(∂Pk(eˉ′)).
The fact that eˉi=eˉi′ for all i>k means that heirarchical structures Pk(eˉ)⊂Pk+1(eˉ)⊂Pk+2(eˉ)⊂⋯ and Pk(eˉ′)⊂Pk+1(eˉ′)⊂Pk+2(eˉ′)⊂⋯ are the same. Thus, in the limit, Teˉ differs from Teˉ′ by a translation: Teˉ=φτ(Teˉ′), which proves the first part.
By (i), [eˉ] can be identified with a set of translates φτeˉ′(Teˉ) of Teˉ, for some τeˉ′ depending on eˉ′∈[eˉ]. So ΩTeˉ′=ΩTeˉ whenever [eˉ]=[eˉ′]. Let eˉ′∈[eˉ] but eˉ′∈[eˉ]. Then there exists a sequence {eˉk} in [eˉ] converging to eˉ′ in [eˉ] with eˉik=eˉi′ for all i≤k. This means that Pk(eˉk)=Pk(eˉ′) as tiled patches for all k∈N. Thus d(Teˉ′,Teˉk)=d(Teˉ′,φτeˉk(Teˉ))→0, so Teˉ′∈ΩTeˉ.
∎
Given eˉ∈X˚Bx(F), recall the definition of the tiling Teˉ as defined in (8). Since we are assuming that the shared attractor of F contains the origin, then the origin is contained in the interior of every single prototile, which we can treat as a distinguished point. As such, we have that if Teˉ tiles all of Rd then Teˉ∈℧Teˉ. Let Δx:X˚Bx(F)→℧Teˉ be the map Δx(eˉ)=Teˉ . This is called the Robinson map in [Kel95] where the following type of result can be found.
Proposition 2**.**
Let F={F1,…,FN} be a type H family and suppose that Bx(F) is minimal. The Robinson map Δx:X˚Bx→℧x is a continuous map onto its image which defines a bijection between Borel probability measures μ on XBx(F) which are invariant for the tail-equivalence relation and satisfy μ(ΣBx)=0 with Borel transverse invariant probability measures for the Rd action on ΩTeˉ supported on the canonical transversal ℧Teˉ.
Proof.
Since Bx is minimal, by the second part of Lemma 5, the tiling space is independent of which eˉ∈X˚Bx is used to construct a tiling Teˉ and then a tiling space. As such, the canonical transversal ℧x is also independent of this choice. That the map Δx is a continuous surjection onto ℧x follows directly by considering sequences in X˚Bx, their approximants, and their images through Δx.
Now consider a Borel probability measure μ which is invariant under the tail-equivalence relation with μ(ΣBx)=0,.
By definition, we have that if eˉ and eˉ′ have the property that s(eˉ),s(eˉ′)∈V0 and r(eˉ)=r(eˉ′), then μ(Ceˉ)=μ(Ceˉ′). A Borel probability measure ν on the canonical transversal is invariant under the Rd action if for any open set C⊂℧x and vector τ with φτ(C)⊂℧x we have that ν(φτ(C))=ν(C). Thus we verify the pushforward of (Δx)∗μ on open sets of the form C(Pk(eˉ)) and C(Pk(eˉ′)) with s(eˉ),s(eˉ′)∈V0 and r(eˉ)=r(eˉ′):
[TABLE]
where we used the invariance of μ in the third equality and part (i) of Lemma 5 in the last one. So (Δx)∗μ is invariant for the Rd action. That the inverse Δx−1 sends invariant measures to invariant measures for which ΣBx is a null set is similarly proved.
∎
5. Bi-infinite diagrams and hierarchical structures
We now extend the construction of tilings using Bratteli diagrams to bi-infinite Bratteli diagrams. A key application of this construction appears in Proposition 5, where, using Proposition 2, we connect the shift map σ on the parameter space ΣN (the full shift on N symbols) to an induced map between tiling spaces Ωx→Ωσ(x). We follow the conventions of [LT16, Tre18]. Recall that Zˉ=Z−{0}, and note Zˉ inherits an order from the order on Z.
5.1. Bi-infinite diagrams
A bi-infinite Bratteli diagram B=(V,E) is an infinite graph with vertex and edge sets partitioned as
[TABLE]
along with range and source maps r,s:E→V which are defined as r:Ek→Vk for k>0 and s:Ek→Vk for k<0, while s:Ek→Vk−1 for k>0 and r:Ek→Vk+1 for k<0. The definitions of paths from §3.1 are generalized in the natural way to the bi-infinite case.
For a bi-infinite Bratteli diagram B, we denote by XB the set of infinite paths in B, i.e.,
[TABLE]
The topology of XB(F) is generated by cylinder sets of the form Ceˉ, where eˉ is a finite path in B(F).
Definition 12**.**
Let B be a bi-infinite Bratteli diagram. The positive part of B, denoted by B+, is the (not bi-infinite) Bratteli diagram B where the vertices, edges, and source and range maps are the same as those of B when we restrict to sets with non-negative indices. Likewise, the negative part of B, denoted by B−, is obtained by restricting to sets with negative indices ignoring all the sets with positive indices in B and then reversing the sign of the indices of the sets left.
5.2. Hierarchical structures
Let ΣN={1,…,N}Zˉ, where Zˉ:=Z−{0}, inheriting an order from that of Z. Given a type H family F={F1,…,FN} and x∈ΣN we consider the bi-infinite Bratteli diagram Bx(F) by defining its kth transition matrix Mk to be M(Fi) if xk=i.
Recall that, assuming Bx+ is minimal, paths starting at V0 in Bx+ record the hierarchical structure of a tiling in ℧x. This is done through the approximants: if eˉ∈X˚Bx+, then the hierarchical structure of the tiling Δx(eˉ) is described by the inclusions
[TABLE]
Following the philosophy of [BM77], paths in the negative part of Bx describe the transverse structure of the object described by paths in the positive part. By Proposition 2, paths in Bx+ describe the local structure of ℧x, so considering the local product structure of Ωx in Proposition 1, then the paths in Bx− ought to describe the local structure of the leaves which foliate Ωx. We now describe how this is done.
Let eˉ be a path with s(eˉ)∈Vk, r(eˉ)∈V0 and k<0. As in (6), there is a map feˉ which maps As(eˉ) into Ar(eˉ). In fact, as in (7), for any k<0 and v∈V0, the prototile Av is tiled by tiles indexed by all paths eˉ with s(eˉ)∈Vk and r(eˉ)=v:
[TABLE]
Since all maps f in the family F are affine and contracting, the prototile Av can be partitioned by smaller and smaller tiles by considering longer and longer paths ending in v∈V0. As such, any point in Av has a (not necessarily unique) address given by an infinite path in the negative part of B, given by a surjective function px:XBx−→v∈V0⋃Av. Define
[TABLE]
We get the extension of Proposition 2 in the bi-infinite case.
Proposition 3**.**
The Robinson map Δx:X˚Bx+→℧x extends to a continuous map Δˉx:X˚Bx→Ωx.
Proof.
Let eˉ=(…,e−2,e−1,e1,e2,…)∈X˚Bx and denote by eˉ+∈X˚Bx+ its restriction to Bx+. Proposition 3 assigns to every path eˉ+∈ΣBx+ in the positive part of B a unique tiling Δx(eˉ+)=Teˉ+ in ℧x where the origin is contained in the interior of the tile containing the origin (which is As(eˉ+)). So considering the positive part of eˉ we know which tiling in the canonical transversal we obtain. As described in the paragraph above, an infinite path eˉ− in the negative part (that is, terminating in V0) defines a point px(eˉ−)∈Ar(eˉ−). Since the prototile corresponding to the range of the negative part of the path eˉ is the prototile containing the origin given by the positive part, we can translate the tiling Teˉ+ by a small vector so that the origin can be identified with the point px(eˉ−)∈Ar(e−1)=As(e1). This assignment can be seen to be continuous.
∎
5.3. Renormalization
Recall ΣN={1,…,N}Zˉ, where Zˉ:=Z−{0}, inheriting an order from that of Z. In that case, σ:ΣN→ΣN denotes the full N-shift, obtained by shifting the labels by one in the entries of x∈ΣN. Let σˉ:XBx→XBσ(x) denote the continuous map sending a path eˉ∈XBx to itself in XBσ(x), where it is viewed with different indices.
Definition 13**.**
Let F={F1,…,FN} be a type H family. A σ-invariant ergodic probability measure μ on ΣN is minimal with respect to F if Bx(F) is minimal for μ-almost every x.
If μ is minimal with respect to some type H family F we will only say that it is minimal when it is clear from context that we refer to F.
Remark 4**.**
Note that if each substitution rule F1,…,FN is primitive, then we should expect Bx(F) to be minimal. In such case any ergodic σ-invariant probability measure will be minimal with respect to F. The definition becomes interesting when not all F1,…,FN are primitive substitutions, but enough random combinations of them give minimal Bratteli diagrams.
Note that being minimal is a σ-invariant condition: if Bx(F) is minimal then so is Bσ(x)(F). As such, the set of minimal Bx(F) is σ-invariant, so they have either full or zero measure for any ergodic invariant probability measure μ. This observation, combined with the Poincaré recurrence theorem and the main result of [Tre18], gives the following.
Proposition 4**.**
Let F={F1,…,FN} be a type H family and let μ be an minimal, ergodic σ-invariant probability measure on ΣN. Then for μ-almost every x∈ΣN the Rd action on Ωx is uniquely ergodic.
Let Φeˉ be the map which assigns to the tiling Teˉ the tiling Tσ(eˉ). This extends to a nice map on the tiling space of Teˉ.
Proposition 5**.**
Let F={F1,…,FN} be a type H family and let x∈ΣN be such that Bx+(F) is minimal. The shift map σ:ΣN→ΣN induces a homeomorphism Φx:Ωx→Ωσ(x) which satisfies the conjugacy equation
[TABLE]
The hierarchical structure shifts under the map Φx: if t(1) is a level-1 supertile in some tiling T∈Ωx then θx1t is a tile in the tiling Φx(T).
Proof.
Let us first describe the inverse Φx−1. Take a tiling T∈Ωσ(x). The image Φx−1(T) is the tiling T′∈Ωx obtained from T by substituting each tile in T using the substitution rule F(σ(x))−1=Fx1 and rescaling by θ(σ(x))−1−1=θx1−1. Thus the map Φx−1 adds the smallest level of hierarchical structure and can easily be seen to be continuous.
As such, the map Φx should remove the smallest level of the hierarchical structure. So if T∈Ωx then Φx(T) is the tiling in Ωx obtained by first erasing all level-0 supertiles in T, leaving a tiling of Rd where the tiles are the level-1 supertiles of T. Rescaling this tiling by θx1 gives us the tiling Φx(T). This is also easily seen to be continuous, and the shifting of hierarchical structures follows from this.
From these operations one can see that the conjugacy equation (15) holds; we leave the details to the reader.
∎
6. Cohomology
Let T be a tiling of Rd. For R>0, a function f:Rd→R is called T-equivariant of range R if
[TABLE]
We say f is T-equivariant if it is T-equivariant of range R for some R>0. The set of all T-equivariant, C∞ functions is denoted by ΔT0. A k-form η is T-equivariant if each function involved in η is T-equivariant, and we denote the set of all T-equivariant, smooth k-forms by ΔTk.
The complex {ΔTk,d} is a subcomplex of the de Rham complex of smooth differential forms. As such, the restriction of d to T-equivariant forms satisfies d2=0. We can define its cohomology by
[TABLE]
which is the T-equivariant cohomology of ΩT.
6.1. The Anderson-Putnam Complex
Let Ω be a tiling space. For any tile t in the tiling T∈Ω, the set T(t) denotes all tiles in T which intersect t. This type of patch is called a collared tile.
Definition 14**.**
Let Ω be a tiling space. Consider the space Ω×Rd under the product topology, where Ω carries the discrete topology and Rd the usual topology. Let ∼1 be the equivalence relation on Ω×Rd which declares a pair (T1,u1)∼1(T2,u2) if T1(t1)−u1=T2(t2)−u2 for some tiles t1,t2 with u1∈t1∈T1 and u2∈t2∈T2. The space (Ω×Rd)/∼1 is called the Anderson-Putnam (AP) complex of Ω and is denoted by AP(Ω).
Let us now review the AP-complexes involved in our construction. First, note that for x=(x1,x2,…)∈ΣN, assuming that Bx(F) is minimal, AP(Ωx(F)) only depends on finitely many symbols x1,…,xℓ, since the collaring of tiles in tilings of Ωx only depends in the kth-approximants Pk for sufficiently large k. Thus for a type H family F, there exists a partition U1,…,Uq of ΣN by open sets and CW-complexes Γ1,…,Γq such that if x∈Ui and Bx is minimal, then AP(Ωx(F))=Γi.
It will be useful to also consider higher level AP complexes, defined as follows. For x∈ΣN, T∈Ωx, and denoting by t(1) a level 1 supertile (which are approximants of the form P1(eˉ) as in (7)), let T(t(1)) be the union of the supertile t(1) and the level 1 supertiles of T which intersect t(1). Proceeding similarly, we let T(t(n)) denote the collared level-n supertile corresponding to the level-n tupertile t(n). Let ∼n be the equivalence relation defined by the collared level-n supertiles T(t(n)) in Ω as in Definition 14. The quotient (Ω×Rd)/∼n is denoted by APn(Ω). By construction, AP(Ωσn(x)) and APn(Ωx) are homeomorphic. In fact, the only difference is their scale: APn(Ωx) is a rescaling of AP(Ωσn(x)) by θxn−1⋯θx1−1. Denote by
[TABLE]
the rescaling homeomorphisms.
Proposition 6**.**
The substitution rule Fxi induces a continuous map γi:AP(Ωσi(x)(F))→AP(Ωσi−1(x)(F)) defined by γi(T,u)=(Fxi(T),θxi−1u) for all i>0.
Proof.
[AP98, Proposition 4.2]
∎
We now want to relate the tiling spaces to inverse limit constructions as first done by Anderson and Putnam in [AP98].
Theorem 2**.**
Let x∈ΣN be such that XBx(F) is minimal. Then
[TABLE]
Proof.
[AP98, Proposition 4.3]
∎
Theorem 3**.**
Let x∈ΣN be such that XBx(F) is minimal. The Čech cohomology groups of Ωx(F) are the direct limits
[TABLE]
Proof.
[AP98, Theorem 6.1]
∎
Proposition 7**.**
Let V1,…,Vn be finite dimensional vector spaces and γi,j∗:Vj→Vi be linear maps. Then
[TABLE]
is finite dimensional. Moreover, for any σ-invariant ergodic probability measure μ on (Σn,σ) we have that for μ-almost every x∈Σn, there exists a subspace ESx⊂Vx0 such that the map (γx0∗)∞:Vx0→Wx+ (given by the definition of the direct limit) takes ESx onto Wx+.
Proof.
First we show Wx+ is finite dimensional. Let N=maxdimVi. We claim that dimWx+≤N. To see this, suppose we have k>N vectors [vi,k(i)]∈Wx+, and let K=imaxk(i). Then there exists vectors vi′∈VK such that [vi,k(i)]=[vi′,K] in Wx+. Since dimVK≤N, the set {vi′} is linearly dependent, and hence so are the [vi,k(i)] in Wx+.
To prove the second part, let W be the set of finite words from an alphabet of n symbols. For any word w=w0w1∈W of length 2, let γw∗=γw1,w0∗:Vw0→Vw1. Now for any word w=w0w1⋯wk∈W of length k+1≥3, define γw∗=γwkwk−1∗⋯γw2w1∗γw1w0∗:Vw0→Vwk. For every finite word w denote the cylinder set
[TABLE]
and define
[TABLE]
It follows from Poincaré recurrence that if
[TABLE]
and Aμ=Aμ′∩suppμ then μ(Aμ)=1. For x=(…,x−1,x0,x1,x2,…)∈Σn we denote the associated one-sided infinite string by x+=(x0,x1,x2,…). Then for all x∈Aμ we can write it (non-uniquely) as the concatenation of finite words x+=a1xb1xa2xb2xa3xb3x⋯ where aix is some finite, possibly empty word, and bix satisfies rankγbix∗=Rμ and ∣bix∣=Lμ for all i≥0.
Now take x∈Aμ and let c∈Wx+. Recall that this is an equivalence class: two elements ci∈Vxi and cj∈Vxj are equivalent if there exists a k≥max{i,j} such that γxi⋯xk∗ci=γxj⋯xk∗cj∈Vxk. So pick a representative cℓ∈Vxℓ of c∈Wx+. Then fixing a decomposition x+=a1xb1xa2xb2xa3xb3x⋯ we have that xℓ is in either a aix or bix for some i. Suppose it is in some aix (the other case is similarly treated). Then there is a ℓ′>ℓ with ℓ′−ℓ≤Lμ+∣aix∣ such that rankγℓ′,ℓ∗=Rμ. Similarly, we have that rankγℓ′,0∗=Rμ, since Rμ was defined to be the minimal such rank which appears. Thus γℓ′,ℓ∗cℓ∈Im(γℓ′,ℓ∗)=Im(γℓ′,0∗), so there exists a c0∈Vx0 such that γℓ′,ℓ∗cℓ=γℓ′,0∗c0, and so c has a representative in Vx0. Since any c∈Wx+ has a representative in Vx0 and this forms a vector space, the space of representatives in Vx0 of Wx+ is denoted by ESx.
∎
Definition 15**.**
A continuous function f:ΩT→R is called transversally locally constant if for any T′∈ΩT there exists a R>0 such that
[TABLE]
We denote by Ctlc∞(ΩT) the set of all transversally locally functions on ΩT which are C∞ along the leaves of the foliation of ΩT. The map iT:Ctlc∞(ΩT)⟶ΔT0 defined by
[TABLE]
extends to an isomorphism iT:Ctlc∞(ΩT,∧kRd)→ΔTk. As such, we can define the Hodge map ⋆:Ctlc∞(ΩT,∧kRd)→Ctlc∞(ΩT,∧d−kRd) through ⋆η=iT−1⋆iTη.
We can define the leaf-wise derivative using the Rd-action on ΩT as follows: for any vector v∈Rd we have
[TABLE]
for any f∈Ctlc∞(ΩT). This extends to maps v:Ctlc∞(ΩT,∧kRd)→Ctlc∞(ΩT,∧kRd) and in particular yields the differential d:Ctlc∞(ΩT,∧kRd)→Ctlc∞(ΩT,∧k+1Rd) satisfying d2=0. The cohomology of the complex {Ctlc∞(ΩT,∧kRd)} is the foliated cohomology of ΩT and it is denoted by H∗(Rd,Ctlc∞(ΩT,R)). The map (20) is an isomorphism of the complexes (ΔTk,d) and (Ctlc∞(ΩT,∧kRd),d) which intertwines the actions of the differentials. We summarize the above in a theorem, which can also be found in [KP06, Theorem 23].
Theorem 4**.**
The map iT (20) is an algebra isomorphism between the transversally locally functions which are smooth along leaves and smooth T-equivariant functions. It yields an isomorphism of the foliated cohomology H∗(Rd,Ctlc∞(ΩT,R)) and the T-equivariant cohomology H∗(ΩT,R).
There is also a relationship between the Čech cohomology Hˇ∗(ΩT;R) and the T-equivariant cohomology. The following is found in [KP06, Theorem 20], or [Sad07].
Theorem 5**.**
For a tiling T of finite local complexity, the T-equivariant cohomology H∗(ΩT;R) is isomorphic to the Čech cohomology Hˇ∗(ΩT;R).
6.2. Generators in Hd(Ωx;R)
Recall that for a type H family F there is a collection {Γi} of AP complexes. Each AP complex Γi has a CW-structure where the d-cells correspond to the image of the collared tiles in the projection giving the AP complex for any T∈Ωx and any x∈Ui. Denote by P1i,…,Pc(i)i the different patches corresponding to collared tiles of repetitive tilings in Ωx, x∈Ui. So for x∈Ui and j∈{1,…,c(i)}, Pji is a patch of any repetitive T∈Ωx. Each patch has a distinguished point in its interior: since the Pji are collared tiles they are of the form Pji=T′(t′) for some tile t′∈T′. As such, since t′ is a copy of a prototile Aι and Aι contains the origin, then the distringuished point in Pji=T′(t′) corresponds to the point in t′ which is identified with the origin in Aι. This is independent of which tiling x∈Ui and T′∈Ωx we use.
Let ri,j be the injectivity radius of Pji, r∗ be the minimum of all such injectivity radii and let x∈Ui⊂ΣN. For a tiling T′∈℧x, let ΛT′i,j be the set of vectors τ in Rd such that φτ(T′)∈℧x and φτ(T′) contains the patch Pji at the origin with its distinguished point exactly at the origin. In this manner, we construct c(i) sets of vectors {ΛT′i,1,…,ΛT′i,c(i)}, and use this to construct c(i) forms η1i,…,ηc(i)i∈ΔTd as follows. Let ρ be a positive, smooth bump function supported in a ball of radius r∗/2 and of integral 1 around the origin. Then
[TABLE]
where ⋆:ΔT0→ΔTd is the Hodge-⋆ operator. The forms ηji can be easily described as follows. The sum of convolutions in (21) gives a function in ΔT0 which places a copy of the bump function ρ around the distringuished point of all tiles in T′ whose collaring is the patch Pji. Multiplying that function by the volume form gives us ηji.
Another way to obtain the forms ηji is as follows. For T∈Ωx and x∈Ui, there is a projection map πT:Rd→AP(Ωx). Then for each j∈{1,…,c(i)} there exists a function fji obtained by placing the bump function ρ on the cell of AP(Ωx) corresponding to Pji in such a way that ηji=⋆πT∗fji. More generally, every form in ΔTk is obtained from pulling back smooth k-forms on APn(Ωx) from the canonical map πT,n:Rd→APn(Ωx) for some n. More specifically, by [Sad07, Theorem 2] we have that
[TABLE]
where Λk(APn(Ωx)) denotes the smooth k-forms on APn(Ωx) (considering APn(Ωx) as a branched manifold, in the sense of [Sad07]).
Let CkAP(Ωx) denote the group of degree k cellular cochains of AP(Ωx). The set of d-cells of AP(Ωx) is given by c(i) cells (corresponding to the collared tiles Pji), so CdAP(Ωx)=Hom(CdAP(Ωx),R) is generated by the c(i) forms ⋆fji dual to the collared patches Pji and the pairing is obtained by integration over AP(Ωx). As such, Hd(AP(Ωx);R) is generated by the restriction of these forms to the kernel of the boundary map ∂d:CdAP(Ωx)→Cd−1AP(Ωx). In particular, Hd(AP(Ωx);R) is generated by linear combinations of classes represented by the forms ⋆fji.
Denote by γ(n,m):AP(Ωσn(x))→AP(Ωσm(x)) the maps from the inverse system in (18). It follows that, since the maps in (17) are homeomorphisms, there exist maps γˉ(n,m):APn(Ωx)→APm(Ωx) such that
[TABLE]
Proposition 8**.**
Let F=(F1,…,FN) be a type H family and μ a minimal, ergodic σ-invariant probability measure. For μ-almost every x, if x∈Ui⊂ΣN, for any T′∈Ωx the forms η1i,…,ηc(i)i defined in (21) compose a generating set for Hd(Ωx;Rd). In other words, given T′∈Ωx, any class [η]∈Hd(Ωx;R) is in the span of the set {[ηji]}⊂Hd(Ωx;R).
Proof.
Let x∈ΣN be a typical point which satisfies the conclusion of Proposition 7 and pick any T∈Ωx. Let [η]∈Hd(Ωx;R), so η∈ΔTd. By (22), there exists a k≥0 such that η=πT,k∗ω for some ω∈Λd(APk(Ωx)). Therefore [ω] denotes a class in Hd(APk(Ωx);R) and through the homeomorphism rk,x we obtain the a class [ωˉ]=(rk,x−1)∗[ω] in Hd(AP(Ωσk(x));R) represented by ωˉ∈Λd(AP(Ωσk(x))).
It follows from Theorem 3 and Proposition 7 that there exist k0 and [ω0]∈Hd(AP(Ωx);R) such that γk0∗⋯γ1∗[ω0]=γk0∗⋯γk+1∗[ωˉ] in Hd(AP(Ωσk0(x))).
As such, we have that
[TABLE]
in Λd(AP(Ωσk0(x))), for some ω1∈Λd−1(AP(Ωσk0(x))). Considering the commutative diagram
[TABLE]
we obtain the dual diagram
[TABLE]
where im,n denotes the natural inclusion of one set of T-equivariant forms into a larger set. Now, by (23), we have that
[TABLE]
so using (24),
[TABLE]
The pullback πT,k0∗rk0,x∗dω1 of the exact form dω1 is exact, so we denote it by dω2. Finally, the class [ω0] is represented by a linear combination of the forms ⋆fji:
[TABLE]
where βj(ω0)∈R. So we have from (25) that
[TABLE]
which concludes the proof.
∎
6.3. A norm on Hd(Ωx;R)
Recall from §6.1 that given a type H family F={F1,…,Fn}, there exists a partition {Ui} of Σn and CW-complexes {Γi} such that AP(Ωx)=Γi if x∈Ui. In order to endow Hd(Ωx;R) with a norm, we first equip each Hd(AP(Ωx);R) with a norm. Since each CW-complex Γi is a finite complex, Hd(Γi;R) is finite dimensional for each i and so we can endow it with its natural Lp norm ∥⋅∥p. The following is a consequence of Proposition 7.
Corollary 1**.**
Let F={F1,…,Fn} be a type H family and μ a minimal ergodic σ-invariant probability measure. Then for μ-almost every x, there is a subspace ESx∗⊂H∗(AP(Ωx);R) such that H∗(Ωx;R) is naturally isomorphic to ESx∗.
By naturally isomorphic, we mean that each class in the direct limit presentation of H∗(Ωx;R) has a representative in H∗(AP(Ωx);R). See the proof of Proposition 7 for details. By the identification of H∗(Ωx;R) with ESx∗⊂H∗(Γi;R) given by Corollary 1, for x∈Ui we can now endow H∗(Ωx;R) with a norm: the restriction of the Lp norm in H∗(Γi;R)=H∗(AP(Ωx);R) to the subspace ESx∗⊂H∗(AP(Ωx);R).
Let us now define a specific norm which will be useful for the bounds needed in §8 to prove the main theorem. Let {Cki} be the cellular chain complex of Γi. Recall that since Cdi is generated by the d-faces {ck} of Γi, Hom(Cdi,R) is generated by the dual c(i) functions {f1i,…,fc(i)i} introduced after (21), where the pairing comes by fji(c)=∫c⋆fji for any c∈Cdi. This pairing gives an L∞-type of norm on Hom(Cdi,R) by
[TABLE]
Now, for x∈Ui, since
[TABLE]
the space Hd(AP(Ωx) is generated by a linear combination of the functions {fji}. Furthermore, since by Corollary 1 we have that H∗(Ωx;R)⊂H∗(AP(Ωx)), H∗(Ωx;R) is also generated by a linear combination of the functions {fji}. Thus the norm (27) restricts to an L∞ norm on Hd(Ωx;R) as follows. For a representative η=j=1∑c(i)βj(η)⋆fji of a class in Hd(Ωx;R) then
[TABLE]
defines a norm on Hd(Ωx;R). The following proposition shows this norm may be written in a slightly different way.
Proposition 9**.**
Let F=(F1,…,FN) be a type H family and μ a minimal, ergodic σ-invariant probability measure. For μ-almost every x, the function ∥⋅∥:Hd(Ωx;R)→R defined by
[TABLE]
where η∈ΔTd, T∈Ωx, is the representative of the class c∈Hd(Ωx;R) of the type given by Proposition 8, gives a norm on Hd(Ωx;R).
Proof.
For such a minimal, ergodic σ-invariant probability measure μ, let x∈Ui⊂ΣN be such that the conclusion of Proposition 8 holds. Let c∈Hd(Ωx;R) be a class. By Proposition 8 and its proof, for any T∈Ωx, we have [c]=[ηc] where
[TABLE]
So we have that
[TABLE]
Comparing with (28), the result follows.
∎
7. The cohomology bundle
Definition 16**.**
Given a type H family F={F1,…,FN}, the cohomology bundle of this family is the trivial bundle HF:=ΣN×Hd(Ω) over ΣN having as fiber over x∈ΣN the vector space Hd(Ωx;R).
We endow each fiber Hd(Ω) of HF with the norm defined in §6.3, and we write ∥⋅∥x for the norm on the fiber Hd(Ωx;R). Since the bundle HF is over a Cantor set, the notion of a connection does not make sense right away. However, given a minimal, ergodic σ-invariant probability measure μ, Corollary 1 gives a way to compare nearby fibers for μ-almost every fiber.
Since F is uniformly affine scaling, given x∈ΣN, we denote by Ax1=θx1−1⋅Id the expanding matrix associated with the maps in Fx1.
Lemma 6**.**
Let F be a type H family and Ωx be the tiling space for x∈ΣN. Let [ω]∈Hd(Ωσ(x);R) where ω∈ΔTd for T∈Ωσ(x). Then Φx∗[ω]∈Hd(Ωx;R) is represented by the pattern-equivariant form (Ax1−1)∗ω∈ΔΦx(T)d.
Proof.
We trace back the action through the isomorphisms iT:Ctlc∞(Ωx)→ΔT0 and iΦx(T):Ctlc∞(Ωσ(x))→ΔΦx(T)0 from Theorem 4:
[TABLE]
where we used the conjugacy from Proposition 5 in the third equality.
∎
Definition 17**.**
The renormalization cocycle is the map ς:HF→HF defined as (x,[η])↦(σ(x),Θx[η]), where Θx:=(Φx−1)∗:Hd(Ωx;R)→Hd(Ωσ(x);R).
We will denote products as A(n)x:=Axn…Ax1. We now appeal to Oseledets theorem. In what follows ∥⋅∥ denotes the operator norm, and log+(x)=max{0,log(x)}.
Theorem 6** (Oseledets theorem).**
Let F1,…,FN be a type H family. Let μ be an minimal ergodic, σ-invariant probability measure on ΣN. Suppose furthermore that
[TABLE]
Then there exist Lyapunov exponents λ1≥λ2≥⋯≥λrμ such that for μ-almost all x∈ΣN there is a ς-invariant measurable splitting of HF
[TABLE]
such that for any [η]∈Ei(x)\{0},
[TABLE]
We note that the condition
[TABLE]
holds in particular for the renormalization cocycle Θx=(Φx−1)∗:Hd(Ωx;R)→Hd(Ωσ(x);R); indeed, the cocycle takes finitely many values, over the partition Ui.
Definition 18**.**
The rapidly expanding subspace Ex+ is the subspace spanned by the collection of Oseledets subspaces Ei(x) in (30) with Lyapunov exponent λi in (31) satisfying λi≥dd−1λ1.
Definition 19**.**
Let F be a type H family and μ be a minimal, σ-invariant probability measure on ΣN. For the Lyapunov spectrum λ1≥λ2≥⋯≥λrμ of μ, the normalized Lyapunov exponents νi are given by
[TABLE]
for all i=1,…,rμ. Note that Ei(x)⊂Ex+ if and only if νi≥d−1.
To compactify notation, we denote by
[TABLE]
the composition of the maps from Proposition 5 along orbits of x.
Lemma 7**.**
Let F=(F1,…,FN) be a type H family and μ a minimal, ergodic σ-invariant probability measure. For μ-almost every x and any T∈Ωx we have that
[TABLE]
where the norm on the left is the one from (28) (or, equivalently, from (29)) and η∈ΔTd is the representative of the class [η] given in Proposition 8.
Proof.
For such a minimal, ergodic σ-invariant probability measure μ, let x∈Ui⊂ΣN be such that the conclusion of Proposition 8 holds, and pick T∈Ωx. By Lemma 6, for any n>0 there is a Tn=Φxn(T)∈Ωσn(x) and εn>0 such that A(n)x∗η∈ΔTnd is a representative of the class Θσn−1(x)∘⋯∘Θx[η] and, moreover, suppA(n)x∗η∩Nεn(∂t)=∅ for all t∈Tn, where Nε(S) denotes the ε-neighborhood of the set S. In other words, the form A(n)x∗η is supported way from the union of the boundaries of the tiles of Tn. We note that Tn=Φxn(T) and T are related in a very special way: by Proposition 5, the tiling T is obtained from the tiling Tn by performing n substitutions and inflations according to the substitution rules Fxn,Fxn−1,…,Fx1. This is why the support of A(n)x∗η is contained in the interior of the tiles of Tn.
Now, applying the construction of Proposition 8 to the class [A(n)x∗η] we obtain a form
[TABLE]
where the forms ηji′∈ΔTnd come from (21). Since they both represent the same class, we have that ηji′−A(n)x∗η=dωn. Since both A(n)x∗η and ηji′ are supported away from the union of the boundaries of all tiles t∈Tn, so is dωn. Thus we have
[TABLE]
where the first equality follows from (29) in Proposition 9.
∎
8. Ergodic integrals
Given that we will study averages of functions, we need to define the types of averaging sets which will be used. Given a compact set B with non-empty interior, denote by T⋅B the one-parameter family of sets obtained from B through
[TABLE]
As such, we have that Vol(T⋅B)=Vol(B)Td.
Recall by Lemma 6 that the renormalization map acts on forms through scaling matrices. More precisely, for T∈Ωx if η∈ΔTd represents a class in Hd(Ωx;R), then Θx[η] is represented by Ax1∗η∈ΔΦx(T)d, where Ax1 is the diagonal matrix with all entries θx1−1. To reduce the amount of tedious notation, we denote the renormalization cocyle actions by
[TABLE]
Finally, for a type H family F={F1,…,FN} and x∈ΣN, let Tx,n=θ(n)x. As such, we have
[TABLE]
We now make a basic observation about the leading Lyapunov exponent λ1. Let x∈ΣN be an Oseledets regular point for the renormalization cocycle for some ergodic, minimal σ-invariant probability measure μ. By Lemma 6,
if the volume form ⋆1 represents the class [η1]∈Hd(Ωx;R), then A(n)x∗(⋆1)=det(A(n)x)(⋆1)=θ(n)x−d(⋆1)=(θx1…θxn)−d(⋆1) represents the class Θx(n)[η1]∈Hd(Ωσ1(x);R). Thus, Oseledets theorem establishes that
[TABLE]
Using (33), it follows that
[TABLE]
8.1. Upper bound
Lemma 8**.**
Let F be a type H family and μ a minimal, σ-invariant ergodic probability measure on ΣN. For B a Lipschitz domain with non-empty interior and tiling T∈Ωx and T>0 there exists an integer n=n(T,B) and a decomposition
[TABLE]
where tj,k(i) is a level-i supertile of the tiling T of type j, such that
- (i)
κj(n)=0* for some j and Vol(T⋅B)≤K1θ(n)x−d,*
2. (ii)
j=1∑Mκj(i)≤K2Vol(∂T⋅B)θ(i)xd−1* for i=0,…,n−1*
for some K1,K2 which depend only on F and B.
Before proving the lemma, we establish an inequality related to efficient hierarchical packings of Lipshitz domains by supertiles of different orders. These types of estimates have been done elsewhere before, see for example [BS13, Page 769].
For a tiling T∈Ωx and Lipshitz domain B, let TB(k) denote the set of all supertiles of order k completely contained in B. Further, let RB(k) be the set of supertiles of order k which belong to supertiles of order k+1 which are not completely contained in B. As such, the supertiles in RB(k) are contained in supertiles of order k+1 which intersect ∂B. Let d−,d+ be, respectively, the smallest and largest diameters of the prototiles t1,…,tM. Since the largest diameter of level k+1 supertile is d+θ(k)x−1 we have that RB(k)⊂∂d+θ(k+1)x−1(B).
Let a− be the smallest of all of the volumes of the prototiles t1,…,tM. Then the volume of an order k supertile in Ωx is at least a−θ(k)x−d and we have that
[TABLE]
Proof of Lemma 8.
The idea here is to decompose OT−(T⋅B) into tiles of different heirarchical levels beginning from the top level n(T,B) and filling it in using smaller tiles. First we find n=n(T,B), after which the first property of the decomposition will follow.
Let Rt>0 be the smallest number such that in any T∈Ωx, any ball of radius Rt contains a tile of T. Let m1∈N be the smallest m such that Bθmax−m1 contains a ball of radius Rt, where θmax is the largest contraction constant in the family F; thus Bθmax−m1 contains a tile of T. For T≥θmax−m1, let n(T,B) be the largest n∈Z+ such that there exists a level-n supertile t(n) of T completely contained in T⋅B. So there is a finite set of level-n supertiles {tj,k(n)}, j=1,…,M and k=1,…,κj(n), where tj,k(n) is a supertile of type j such that
[TABLE]
where TT⋅B(n) denotes all the supertiles of order n completely contained in T⋅B. So κj(n)=0 for some j.
Given the definition of Rt, it follows that any ball of radius θ(n)x−1θmax−m1 contains a supertile of order n for any tiling T∈Ωx. Let rt be the smallest of all injectivity radii of the prototiles. Let m2 be the smallest integer such that Bθmax−m2rt(y) contains a supertile of order 1 for all y∈Rd and T∈Ωx. There is a m−∈Z such that Bθminm−T(y) contains no supertiles of order n for any y∈Rd and T∈Ωx. So we have that
[TABLE]
and it follows that since T⋅B contains a supertile of order n and (θmax−m2T)⋅B(x) contains a supertile of order n+1,
[TABLE]
from which the first property follows.
If n(T,B)=0, we are done. Otherwise we now look at OT−(T⋅B)\TT⋅B(n) and look for patches corresponding to level-n−1 supertiles of T which are contained in OT−(T⋅B)\TT⋅B(n). Let
[TABLE]
denote their union (it is possible that RT⋅B(n−1)=∅). Proceeding recursively in this way we obtain a decomposition of OT−(T⋅B) in terms of supertiles of different orders as in (36).
We now use (37) to estimate the numbers κj(k), which are the number of supertiles of order k of type j used in the decomposition:
[TABLE]
where we implicitly used that B is a Lipschitz domain in the second inequality of (39) (see [BS13, eq. (6)]).
∎
Proposition 10**.**
Let F={F1,…,FN} be a type H family, μ an ergodic, minimal σ-invariant probability measure on ΣN, and B⊂Rd a compact subset with non-empty interior. For μ-almost every x and any T∈Ωx, for ηℓ∈ΔTd representing a class in Eℓ+(x) of the form given by Proposition 8 we have
[TABLE]
where νℓ is the ℓth normalized Lyapunov exponent of μ.
Proof.
By Proposition 8 we can choose the representative ηℓ of a particular form, namely a linear combination of forms of the form (21), where ρ is a bump function whose support is small enough that each ηji in (21) consists of a bump function supported entirely inside the tile being collared to give Pji. We first decompose the integral into two integrals as
[TABLE]
We begin with I1. Using the decomposition given by Lemma 8, the relationship between supertiles tj,k(i) of T and tiles of Φxi(T) given by Proposition 5, and the expression for the norm in Lemma 7, by Oseledets theorem, given ε>0, there exist K4,K5,K6 such that
[TABLE]
where we used (ii) of Lemma 8 in the last inequality. By (34) and Oseledets theorem, for any δ>0 there is a constant K7 such that
[TABLE]
for all i>0. Using this in (41):
[TABLE]
Using the bound for Vol(T⋅B) given by Lemma 8 and (42), we continue (43):
[TABLE]
At this point we turn to I2 in (40). The integral is over a neighborhood of the boundary. Thus there exists a C>0 and a constant K12 such that we have
[TABLE]
and, using (34), (35), and (38), for ε>0:
[TABLE]
Since by assumption ηℓ represents a class in the rapidly expanding subspace, we have that λℓ≥dd−1λ1 and therefore, comparing the bounds for I1 and I2, respectively in (44) and (45), the bound for I1 dominates the bound for I2, so there exists a K14>0 such that
[TABLE]
Finally, using (38),
[TABLE]
which, through (35), implies
[TABLE]
Since ε,δ are arbitrary, the result follows.
∎
8.2. Lower Bound
Proposition 11**.**
Let F={F1,…,FN} be a type H family, μ an ergodic, minimal σ-invariant probability measure on ΣN, and B⊂Rd a compact subset with non-empty interior. For μ-almost every x, every T∈Ωx and ε>0 there exists a compact subset Bε which is ε-close in the Hausdorff metric to B, a convergent sequence of vectors τk∈Rd and a sequence Tk→∞ such that for any ηℓ∈ΔTd representing a class in Eℓ+(x) of the type given by Proposition 8 we have
[TABLE]
where νℓ is the ℓth normalized Lyapunov exponent of μ.
Proof.
The set of points x∈ΣN for which Bx is minimal, satisfy Poincaré recurrence, Proposition 8 and are Oseledets regular has full measure. Let x be one such point, pick T∈Ωx, and let eˉ∈XBx be such that Δx(eˉ)=T. Let nk→∞ be a subsequence of times such that:
Bx and Bσnk(x) agree on levels indexed by i with ∣i∣≤k;
eˉ∈Bx and σnk(eˉ)∈Bσnk(x) agree on all entries indexed by i with ∣i∣≤k.
That such subsequence exists follows from the fact that x is Poincaré recurrent and that tiling spaces are compact.
Let RF,1 denote the circumscribing radius of the prototiles {tz}. That is, RF,1 is the infimum of all R such that for all z∈{1,…,M} a ball of radius R contains an isometric copy of the prototile tz. By minimality, there exists a RF,2>0 such that for any T∈Ωx, BRF,2(y) contains a copy of every collared tile for any y∈Rd. Given ε>0 there exists an Tε≥0 such that
T−1⋅OT−(T⋅B) is ε-close to B in the Hausdorff metric,
OT−(T⋅B) contains a ball of radius 2max{RF,1,RF,2}
for all T≥Tε. Fix some T∗≥Tε and define
[TABLE]
and note that Px,ε,T is a a patch of T which, by construction, contains a copy of every collared tile. Then there exists a kε, a finite set of paths Eε,T⊂EV0,Vkε and a vector τ such that the patch Px,ε,T admits the decomposition
[TABLE]
where the vector τ is completely determined by the negative part of eˉ. Note that by recurrence of Ωx and the convergence σnk(T)→T for all k large enough, there exists a vector τk∈Rd such that τk+Px,ε,T is a patch in Φx(nk)(T). By minimality/repetitivity there exists a compact set K⊂Rd such that we can take all τk from K, that is, τk∈K for all k large enough. By passing to a subsequence, we may assume that the sequence of vectors τk is convergent.
We now make an explicit decomposition of the patches τk+Px,ε,T⊂Φx(nk)(T). Since x is Poincaré recurrent, for all k large enough we have that AP(Ωσnk(x))=AP(Ωx). Thus, for all k large enough the set of collared tiles of Φx(nk)(T) is some fixed set {t1x,…,tn~x}. We can decompose the patches τk+Px,ε,T as
[TABLE]
as a patch in Φx(nk)(T), where, for each k, {tz,yk}z,y is a finite collection of tiles of Φx(nk)(T). This decomposition breaks down the set τk+Px,ε,T as a finite union of s(z) copies of each collared tile tzx. Since Px,ε,T contains a ball of radius 2RF,2, it contains a copy of every prototile, so s(z)≥1 for all z.
By Proposition 8 we can choose the representative ηℓ∈ΔTd of a particular form, namely a linear combination of forms of the form (21), where ρ is a bump function whose support is small enough that each ηji in (21) consists of a bump function supported entirely inside the tile being collared to give Pji.
For such a representative ηℓ of a class in Eℓ+(x), we partition the set of indices {1,…,n~} of the collared tiles into Iℓ+ and Iℓ∘ as follows. An index z∈Iℓ+ if and only if
[TABLE]
and is in Iℓ∘ if the limsup in (49) is zero. The tiles tz,1k over which we integrate in (49) are the tiles from the decomposition (48).
Lemma 9**.**
Iℓ+=∅.
Proof.
By Lemma 7 we have
[TABLE]
Thus z∈Iℓ+ if and only if
[TABLE]
Note that the max over which the norm in Lemma 7 is taken is not a sup because all the possible values of the integrals (under the hypotheses of Lemma 7) are given by integrating over all possible collared tiles of Φx(nk)(T). Thus the max is taken from all possible values given by the integrals over all possible collared tiles. Since for every k the collection {tz,1k}z has at least one representative of each collared tile of Φx(nk)(T), then (50) holds for some z, so Iℓ+=0.
∎
Note that by our choice of representative ηℓ we have that for any z∈{1,…,n~} and any two y,y′∈{1,…,s(z)} we have that
[TABLE]
since the integrals in the numerators only depend on the the collared type of a tile, which is the same for tz,yk and tz,y′k.
Recall s(z) denotes the number of copies of the collared tile tzx found inside the set τk+Px,ε,T defined in (48) (this is independent of k) and let κ∘(B,x,ε) be the maximum of {s(z)} for z∈Iℓ∘. Let C be half of the smallest positive limsup in (49) for some (z,y)∈Iℓ+. Since the limsup in (49) vanishes for (z,y)∈Iℓ∘, we have that for k large enough,
[TABLE]
Now, by (48):
[TABLE]
Rearranging the terms in (51) and using the triangle inequality, for all ℓ large enough,
[TABLE]
Note that by our choice of Bε in (46) we can write
[TABLE]
where τˉk=T∗−1τk and Tk=T∗θ(nk)x−1. Finally, since ηℓ represents a class in the Oseledets subspace Eℓ+(x), by (32)-(35),
[TABLE]
∎
8.3. Proof of Theorem 1
Let F={F1,…,FN} be a type H family, μ a minimal σ-invariant ergodic probability measure on ΣN. For an Oseledets regular x∈ΣN for the renormalization cocycle, and any T∈Ωx we pick a basis {[η1],…,[ηrμ]}, where each class [ηi] spans the Oseledets subspace Ei(x) associated to the Lyapunov exponent λi and is represented by the form ηi∈ΔTd of the type given by Proposition 8, and we have ordered the spectrum such that λ1≥λ2≥⋯≥λrμ. Given f∈Ctlc∞(Ωx), let fˉ=iTf∈ΔT0, which allows us to write it as
[TABLE]
since one initially has
[TABLE]
where gi=⋆ηi, ef=dωf/(⋆1) and αi(f) are the components of the class [⋆fˉ] in the Oseledets space Ei(x). Note that for any good Lipschitz domain B one has
[TABLE]
for some Kf>0. As a result, the contributions to the ergodic integral of f will primarily come from the forms ηi representing classes in the rapidly expanding subspace.
Define the distributions Di as Di=αi and denote by ρμ=dimEx+ the dimension of the rapidly expanding subspace, which is constant μ-almost everywhere. Let f∈ΔTd and suppose αi(f)=0 for all i=1,…,j−1<ρμ but αj(f)=0. Then the decomposition of fˉ reads
[TABLE]
For B a good Lipschitz domain, Proposition 10 gives
[TABLE]
For any ε>0, let Bε be the good Lipschitz domain which is given by the proof of Proposition 11, along with the converging sequence of vectors {τk} and times Tk→∞. Proposition 11 then gives
[TABLE]
If αi(f)=0 for all i=1,…,ρμ, then the boundary has the dominant effect. Indeed, in the decomposition (40) used for the upper bound, we showed how the growth of I1 is controlled by the Lyapunov exponent in (44) whereas the growth of I2 is bounded by the growth of volume of ∂T⋅B. Thus, it follows from (38) and (45) that
[TABLE]