TL;DR
This paper constructs Markov partitions for toral -rotations that generate minimal aperiodic Wang shifts, linking symbolic dynamics, model sets, and -rotations in a novel way.
Contribution
It introduces explicit Markov partitions for -rotations producing minimal aperiodic Wang shifts, and connects these shifts to model sets via cut and project schemes.
Findings
The -rotation is the maximal equicontinuous factor of the minimal subshifts.
The set of fiber cardinalities of the factor map is , 1, 2, or 8.
The minimal subshifts are uniquely ergodic and measure-theoretically isomorphic to the -rotation.
Abstract
We define a partition and a -rotation (-action defined by rotations) on a 2-dimensional torus whose associated symbolic dynamical system is a minimal proper subshift of the Jeandel-Rao aperiodic Wang shift defined by 11 Wang tiles. We define another partition and a -rotation on whose associated symbolic dynamical system is equal to a minimal and aperiodic Wang shift defined by 19 Wang tiles. This proves that is a Markov partition for the -rotation on . We prove in both cases that the toral -rotation is the maximal equicontinuous factor of the minimal subshifts and that the set of fiber cardinalities of the factor map is . The two minimal subshifts are uniquely ergodic and are isomorphic as measure-preservingâŠ
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Markov partitions for toral -rotations
featuring Jeandel-Rao Wang shift and model sets
Sébastien Labbé
Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400, Talence, France
Abstract.
We define a partition and a -rotation (-action defined by rotations) on a 2-dimensional torus whose associated symbolic dynamical system is a minimal proper subshift of the Jeandel-Rao aperiodic Wang shift defined by 11 Wang tiles. We define another partition and a -rotation on whose associated symbolic dynamical system is equal to a minimal and aperiodic Wang shift defined by 19 Wang tiles. This proves that is a Markov partition for the -rotation on . We prove in both cases that the toral -rotation is the maximal equicontinuous factor of the minimal subshifts and that the set of fiber cardinalities of the factor map is . The two minimal subshifts are uniquely ergodic and are isomorphic as measure-preserving dynamical systems to the toral -rotations. It provides a construction of these Wang shifts as model sets of 4-to-2 cut and project schemes. A do-it-yourself puzzle is available in the appendix to illustrate the results.
RĂ©sumĂ©. Nous dĂ©finissons une partition et une -rotation (-action dĂ©finie par des rotations) sur un tore 2-dimensionnel dont le systĂšme dynamique symbolique associĂ© est un sous-dĂ©calage propre et minimal du sous-dĂ©calage apĂ©riodique de Jeandel-Rao dĂ©crit par un ensemble de 11 tuiles de Wang. Nous dĂ©finissons une autre partition et une -rotation sur dont le systĂšme dynamique symbolique associĂ© est Ă©gal au sous-dĂ©calage minimal et apĂ©riodique dĂ©fini par un ensemble de 19 tuiles de Wang. On montre que est une partition de Markov pour la -rotation sur . Nous prouvons dans les deux cas que la -rotation sur le tore est le facteur Ă©quicontinu maximal des sous-dĂ©calages minimaux et que lâensemble des cardinalitĂ©s des fibres du facteur est . Les deux sous-dĂ©calages minimaux sont uniquement ergodiques et sont isomorphes en tant que systĂšmes dynamiques mesurĂ©s Ă la -rotation sur le tore. Les rĂ©sultats fournissent une construction de ces sous-dĂ©calages de Wang en tant quâensembles modĂšles par la mĂ©thode de coupe et projection 4 sur 2. Un puzzle Ă faire soi-mĂȘme est disponible en annexe pour illustrer les rĂ©sultats.
Key words and phrases:
Wang tilings and aperiodic and rotation and Markov partition and cut and project
2010 Mathematics Subject Classification:
Primary 37B50; Secondary 52C23, 28D05, 37B05
The author acknowledges financial support from the Laboratoire International Franco-Québécois de Recherche en Combinatoire (LIRCO), the Agence Nationale de la Recherche through the project CODYS (ANR-18-CE40-0007) and the Horizon 2020 European Research Infrastructure project OpenDreamKit (676541).
Contents
-
2 Dynamical systems, maximal equicontinuous factors and subshifts
-
3 Symbolic representations and Markov partitions for toral -rotations
-
4 A one-to-one map from the 2-torus to symbolic representations
-
6 An isomorphism between symbolic dynamical systems and toral -rotations
-
10 Example 2: A minimal aperiodic Wang shift defined by 19 tiles
1. Introduction
We build a biinfinite necklace by placing beads at integer positions on the real line:
-2$$-1[math]1$$2$$3
Beads come in two colors: light red
and dark blue . Given , we would like to place the colored beads in such a way that the relative frequency
[TABLE]
converges to as goes to infinity.
A well-known approach is to use coding of rotations on a circle of circumference whose radius is . The coding is given by the partition of the circle into one arc of length associated with dark blue beads and another arc of length associated with light red beads. The two end points of the arcs are associated with red and blue beads respectively in one way or the other. Then, we wrap the biinfinite necklace around the circle and each bead is given the color according to which of the two arcs it falls in. For example, when and if the zero position is assigned to one of the end points, we get the picture below:
red****blue-2$$-1[math]1$$2$$3$$4$$5$$6$$7$$8
Then, we unwrap the biinfinite necklace and we get an assignment of colored beads to each integer position such that the relative frequency between blue and red beads is . Here is what we get after zooming out a little:
-2$$-1[math]1$$2$$3$$4$$5$$6$$7$$8
We observe that this colored necklace has very few distinct patterns. The patterns of size 0, 1, 2 and 3 that we see in the necklace are shown in the table below:
[TABLE]
We do not get other patterns of size 1, 2 or 3 in the whole biinfinite necklace since every pattern is uniquely determined by the position of its first bead on the circle. For each there exists a partition of the circle according to the pattern associated with the position of its first bead:
[TABLE]
When is irrational, one can prove that the partition of the circle for patterns of size is made of parts. The proof follows from the fact that the distance between two consecutive beads on the necklace is equal to the length of one of the original arc (here, the red arc of length 1). So the partition at a given level is obtained from the previous one by adding exactly one separation which increases the number of patterns by 1. This shows that the colored necklace is a Sturmian sequence, that is, a sequence whose pattern complexity is , see [Lot02]. When , this is a construction of the biinfinite Fibonacci word [Ber80]. Note that it is known that sequences having strictly less than patterns of length , for some , are eventually periodic [MH38]. Therefore, Sturmian sequences are the simplest aperiodic sequences in terms of pattern (or factor) complexity [CN10].
What Coven and Hedlund proved in [CH73] based on the initial work of Morse and Hedlund [MH40] on Sturmian sequences dating from 1940 is that a biinfinite sequence is Sturmian if and only if it is the coding of an irrational rotation. Proving that the coding of an irrational rotation is a Sturmian sequence is the easy part and corresponds to what we did above. The difficult part is to prove that a Sturmian sequence can be obtained as the coding of an irrational rotation for some starting point. The proof is explained nowadays in terms of -adic development of Sturmian sequences, Rauzy induction of circle rotations, the continued fraction expansion of real numbers and the Ostrowski numeration system [Fog02]. Rauzy discovered that the connexion between Sturmian sequences and rotations can be generalized to sequences using three symbols [Rau82] involving a rotation on a 2-dimensional torus . This result was extended recently for almost all rotations on [BST19], see also [Thu19].
1.1. From biinfinite necklaces to -dimensional configurations
In this work, we want to extend the behavior of Sturmian sequences beyond the 1-dimensional case by considering -dimensional configurations. We say that a configuration is an assignment of colored beads from a finite set to every coordinate of the lattice . Are there rules describing how to place colored beads in a configuration in such a way that it encodes rotations on a higher dimensional torus?
This is related to a question of Adler: âhow and to what extent can a dynamical system be represented by a symbolic oneâ [Adl98]. The kind of dynamical system we consider are toral -rotations, that is, -actions by rotations on a torus. When , the answer is given in terms of Sturmian sequences and factor complexity. While BerthĂ© and Vuillon [BV00] considered the coding of -rotations on the 1-dimensional torus, we consider -rotations on the -dimensional torus. We show that an answer to the question when can be made in terms of sets of configurations avoiding a finite set of forbidden patterns known as subshifts of finite type and more precisely in terms of aperiodic tilings by Wang tiles. This contrasts with the one-dimensional case, since Sturmian sequences can not be described by a finite set of forbidden patterns (a one-dimensional shift of finite type is nonempty if and only if it has a periodic point [LM95, §13.10]).
1.2. Jeandel-Raoâs aperiodic set of 11 Wang tiles
The study of aperiodic order [GS87, BG13] gained a lot of interest since the discovery in 1982 of quasicrystals by Shechtman [SBGC84] for which he was awarded the Nobel Prize in Chemistry in 2011. The first known aperiodic structure was based on the notion of Wang tiles. Wang tiles can be represented as unit square with colored edges, see Figure 1.
Given a finite set of Wang tiles , we consider tilings of the Euclidean plane using arbitrarily many translated (but not rotated) copies of the tiles in . Tiles are placed on the integer lattice points of the plane with their edges oriented horizontally and vertically. The tiling is valid if every pair of contiguous edges have the same color. Deciding if a set of Wang tiles admits a valid tiling of the plane is a difficult question known as the domino problem. Answering a question of Wang [Wan61], Berger proved that the domino problem is undecidable [Ber66] using a reduction to the halting problem of Turing machines. As noticed by Wang, if every set of Wang tiles that admits a valid tiling of the plane would also admit a periodic tiling, then the domino problem would be decidable. As a consequence, there exist aperiodic sets of Wang tiles. A set of Wang tiles is called aperiodic if there exists a valid tiling of the plane with the tiles from and none of the valid tilings of the plane with the tiles from is invariant under a nonzero translation.
Berger constructed an aperiodic set made of 20426 Wang tiles [Ber66], later reduced to 104 by himself [Ber65] and further reduced by others [Knu69, Rob71]. Small aperiodic sets of Wang tiles include Ammannâs 16 tiles [GS87, p. 595], Kariâs 14 tiles [Kar96] and Culikâs 13 tiles [Cul96]. The search for the smallest aperiodic set of Wang tiles continued until Jeandel and Rao proved the existence of an aperiodic set of 11 Wang tiles and that no set of Wang tiles of cardinality is aperiodic [JR15]. Thus their set, shown in Figure 1, is a smallest possible set of aperiodic Wang tiles. An equivalent geometric representation of their set of 11 tiles is shown in Figure 2.
The aperiodicity of the Jeandel-Rao set of 11 Wang tiles follows from the decomposition of tilings as horizontal strips of height 4 or 5. Using the representation of Wang tiles by transducers, Jeandel and Rao proved that the language of sequences describing the heights of consecutive horizontal strips in the decomposition is exactly the language of the Fibonacci word on the alphabet . Thus it contains the same patterns as in the necklace we constructed above where corresponds to the dark blue bead
and corresponds to the light red bead . This proves the absence of any vertical period in every tiling with Jeandel-Rao tiles. This is enough to conclude aperiodicity in all directions, see [BG13, Prop. 5.9]. The presence of the Fibonacci word in the vertical structure of Jeandel-Rao tilings is a first hint that Jeandel-Rao tilings are related to irrational rotations on a torus.
1.3. Results
In this article, we consider Wang tilings from the point of view of symbolic dynamics [Rob04]. While a tiling by a set of Wang tiles is a tiling of the plane whose validity is preserved by translations of (leading to the notion of hull, see [BG13]), we prefer to consider maps , that we call configurations, whose validity is preserved by translations of . The set of all valid configurations is called a Wang shift as it is closed under the shift by integer translates. The passage from Wang shifts (-actions) to Wang tiling dynamical systems (-action) can be made with the 2-dimensional suspension of the former as in the classical construction of a âflow under a functionâ in Ergodic Theory, see [Rob96].
We may now state the main results of this article together with an illustration. A partition of the plane into well-chosen polygons indexed by integers from the set is shown in Figure 3 (left). The partition is invariant under the group of translations where . Equivalently, it is a partition of the torus given by a partition of the rectangular fundamental domain . On the torus , we consider the continuous -action defined by for every which defines a dynamical system that we denote . The symbolic dynamical system corresponding to is the topological closure of the set of all configurations obtained from the coding by the partition of the orbit of some starting point in by the -action of (see Lemma 4.1). We say that is a subshift as it is also closed under the shift by integer translations. We state the first theorem below. The fact that is illustrated in Figure 3 where is the Jeandel-Rao Wang shift. The definitions of the terms used in the theorem can be found in Section 2 and Section 3.
Theorem 1**.**
The Jeandel-Rao Wang shift has the following properties:
- (i)
* is a proper minimal and aperiodic subshift of ,* 2. (ii)
the partition gives a symbolic representation of , 3. (iii)
the dynamical system is the maximal equicontinuous factor of , 4. (iv)
the set of fiber cardinalities of the factor map is , 5. (v)
the dynamical system is strictly ergodic and the measure-preserving dynamical system is isomorphic to where is the unique shift-invariant probability measure on and is the Haar measure on .
A larger picture of the partition is illustrated in the appendix together with a DIY puzzle allowing hand made construction of configurations in as the symbolic representation of starting points in .
Theorem 1 corresponds to the easy direction in the proof of Morse-Hedlundâs theorem, namely that codings of irrational rotations have pattern complexity . Proving the converse, i.e., that almost every (for some shift-invariant probability measure) configuration in the Jeandel-Rao Wang shift is obtained as the coding of the shifted lattice for some unique is harder. This has lead to split the proof of the converse [Lab19b].
Note that a similar result was obtained for Penrose tilings [Rob96, Theorem A]. In particular, it was shown that the set of fiber cardinalities for Penrose tilings (with the action of ) is . In [LM13], it was proved that the set of fiber cardinalities is for a minimal hull among Taylor-Socolar hexagonal tilings. We show in Lemma 2.2 that the set of fiber cardinalities of the maximal equicontinuous factor of a minimal dynamical system is invariant under topological conjugacy. Therefore, the Jeandel-Rao tilings, the Penrose tilings and the Taylor-Socolar tilings are inherently different.
We also provide a stronger result on another example. We define a polygonal partition of the torus into 19 atoms. We consider the continuous -action defined on by for every where . It defines a dynamical system that we denote . We prove that the symbolic dynamical system corresponding to is equal to the Wang shift where is the set of 19 Wang tiles introduced by the author in [Lab19a] and discovered from the study of the Jeandel-Rao Wang shift [Lab19c].
Theorem 2**.**
The Wang shift has the following properties:
- (i)
*the subshift is minimal, aperiodic and is equal to , * 2. (ii)
* is a Markov partition for the dynamical system ,* 3. (iii)
* is the maximal equicontinuous factor of ,* 4. (iv)
the set of fiber cardinalities of the factor map is , 5. (v)
the dynamical system is strictly ergodic and the measure-preserving dynamical system is isomorphic to where is the unique shift-invariant probability measure on and is the Haar measure on .
Since a Wang shift is a shift of finite type, the equality implies that is a Markov partition (see Definition 3.2) for the -action . Note that Markov partitions âremained abstract objects for a long timeâ [Fog02, §7.1]. Explicit constructions of Markov partitions were originally given for hyperbolic automorphisms of the torus, see [AW70, Adl98]. More recent references relate Markov partitions with arithmetics [KV98, Ken99], algebraic numbers [AFHI11] and numeration systems [Pra99].
The link between aperiodic order and cut and project schemes (Definition 12.1) and model sets (Definition 12.2) is not new. In one dimension, the fact that Sturmian sequences are codings of rotations implies that they can be seen as model sets of cut and project schemes, see [BMP05, BG13]. Since the contribution of N. G. de Bruijn [dB81], we know that Penrose tilings are obtained as the projection of discrete surfaces in a 5-dimensional space onto a 2-dimensional plane. Other typical examples include Ammann-Beenker tilings [BF13] and Taylor-Socolar aperiodic hexagonal tilings for which Lee and Moody gave a description in terms of model sets [LM13]. Likewise, a consequence of Theorem 1 and Theorem 2 is a description of the two aperiodic Wang shifts and with cut and project schemes. More precisely, we show that the occurrences of patterns in the two Wang shifts are regular model sets. Definitions of generic and singular configurations is in Section 4 and definitions of regular, generic and singular models sets can be found in Section 12.
Theorem 3**.**
*There exists a cut and project scheme such that for every Jeandel-Rao configuration , the set of occurrences of a pattern in is a regular model set. If is a generic (resp. singular) configuration, then is a generic (resp. singular) model set. *
We prove the same result for the Wang shift (see Theorem 4). As opposed to the Kari-Culik Wang shift, for which a minimal subsystem is related to a dynamical system on -adic numbers [Sie17], windows used for the cut and project schemes are Euclidean.
It was shown that the action of by translation on the set of Penrose tilings is an almost one-to-one extension of a minimal -action by rotations on [Rob96] (the fact that it is instead of is related to the consideration of tilings instead of shifts). This result can also be seen as a higher dimensional generalization of the Sturmian dynamical systems. Note that a shift of finite type or Wang shift can be explicitely constructed from the Penrose tiling dynamical system, as shown in [SW03]. This calls for a common point of view including Jeandel-Rao aperiodic tilings, Penrose tilings and others. For example, we do not know if Penrose tilings can be seen as a symbolic dynamical system associated to a Markov partition like it is the case for the Jeandel-Rao Wang shift. It is possible that such Markov partitions exist only for tilings associated to some algebraic numbers, see [bedaride_canonical_2020].
1.4. Structure of the article
This article is divided into three parts. In the first part, we construct symbolic representations of toral -rotations and a factor map which provides an isomorphism between symbolic dynamical systems and toral -rotations. In the second part, we construct sets of Wang tiles and Wang shifts as the coding of -rotations on the 2-torus. We illustrate the method on two examples including Jeandel-Rao aperiodic Wang shift. In the third part, we express occurrences of patterns in these Wang shifts in terms of model sets of cut and project schemes. In the appendix, we propose a do-it-yourself puzzle to explain the construction of valid configurations in the Jeandel-Rao Wang shift as the coding of -rotations on the 2-torus.
Acknowledgements
I am thankful to Jarkko Kari and Michaël Rao for their presentations at the meeting Combinatorics on words and tilings (CRM, Montréal, April 2017). I am grateful to Michaël Rao who provided me a text file of characters in the alphabet describing a rectangular pattern with Jeandel-Rao tiles. This allowed me to start working on aperiodic tilings.
I want to thank Michael Baake, Sebastiån Barbieri, Vincent Delecroix, Franz GÀhler, Ilya Galanov, Maik Gröger, Jeong-Yup Lee, Jean-François Marckert, Samuel Petite and Mathieu Sablik for profitable discussions during the preparation of this article which allowed me to improve my knowledge on tilings, measure theory and dynamical systems and write the results in terms of existing concepts. I am very thankful to the anonymous referees for their in-depth reading and valuable comments which lead to a great improvement of the presentation.
Part I Symbolic dynamics of toral -rotations
This part is divided into 5 sections. After introducing dynamical systems and subshifts, we define the symbolic representations of toral -rotations from a topological partition of the 2-torus. We introduce a one-to-one map from the 2-torus to symbolic representations and a factor map from symbolic representations to the 2-torus. We show that the factor map provides an isomorphism between symbolic dynamical systems and toral -rotations.
2. Dynamical systems, maximal equicontinuous factors and subshifts
In this section, we introduce dynamical systems, maximal equicontinuous factors, set of fiber cardinalities of a factor map, subshifts and shifts of finite type. We let denote the integers and be the nonnegative integers.
2.1. Topological dynamical systems
Most of the notions introduced here can be found in [Wal82]. A dynamical system is a triple , where is a topological space, is a topological group and is a continuous function defining a left action of on : if , is the identity element of and , then using additive notation for the operation in we have and . In other words, if one denotes the transformation by , then . In this work, we consider the Abelian group .
If , let denote the topological closure of and let denote the -closure of . A subset is -invariant if . A dynamical system is called minimal if does not contain any nonempty, proper, closed -invariant subset. The left action of on is free if whenever there exists such that .
Let and be two dynamical systems with the same topological group . A homomorphism is a continuous function satisfying the commuting property that for every . A homomorphism is called an embedding if it is one-to-one, a factor map if it is onto, and a topological conjugacy if it is both one-to-one and onto and its inverse map is continuous. If is a factor map, then is called a factor of and is called an extension of . Two subshifts are topologically conjugate if there is a topological conjugacy between them.
The set of all -invariant probability measures of a dynamical system is denoted by . An invariant probability measure on is called ergodic if for every set such that for all , we have that has either zero or full measure. A dynamical system is uniquely ergodic if it has only one invariant probability measure, i.e., . A dynamical system is said strictly ergodic if it is uniquely ergodic and minimal.
A measure-preserving dynamical system is defined as a system , where is a probability measure defined on the Borel -algebra of subsets of , and is a measurable map which preserves the measure for all , that is, for all . The measure is said to be -invariant. In what follows, is always the Borel -algebra of subsets of , so we omit and write when it is clear from the context.
Let and be two measure-preserving dynamical systems. We say that the two systems are isomorphic if there exist measurable sets and of full measure (i.e., and ) with , for all and there exists a map , called an isomorphism, that is one-to-one and onto and such that for all ,
- âą
,
- âą
, and
- âą
for all and .
The role of the set is to make precise the fact that the properties of the isomorphism need to hold only on a set of full measure.
2.2. Maximal equicontinuous factor
In this section, we provide the definition of maximal continuous factor and of related notions. We recall a sufficient condition for a factor to be the maximal equicontinuous factor and we prove a result on the set of fiber cardinalities of the maximal equicontinuous factor of a minimal dynamical system.
A metrizable dynamical system is called equicontinuous if the family of homeomorphisms is equicontinuous, i.e., if for all there exists such that
[TABLE]
for all and all with . According to a well-known theorem [ABKL15, Theorem 3.2], equicontinuous minimal systems defined by the action of an Abelian group are rotations on groups.
We say that is an equicontinuous factor if is a factor map and is equicontinuous. We say that is the maximal equicontinuous factor of if there exists an equicontinuous factor , such that for any equicontinuous factor , there exists a unique factor map with . The maximal equicontinuous factor exists and is unique (up to topological conjugacy), see [ABKL15, Theorem 3.8] and [Kur03, Theorem 2.44].
Let be a factor map. We call the preimage set of a point the fiber of over . The cardinality of the fiber for some has an important role and is related to the definition of other notions. In particular, the factor map is almost one-to-one if is a -dense set in . In that case, is an almost one-to-one extension of . Moreover, it provides a sufficient condition to prove that an equicontinuous factor of a minimal dynamical system is the maximal one as stated in the next lemma from [ABKL15].
Lemma 2.1**.**
[ABKL15, Lemma 3.11]* Let be a minimal dynamical system and an equicontinuous dynamical system. If is a factor of with factor map and there exists such that , then is the maximal equicontinuous factor.*
The set of fiber cardinalities of a factor map is the set , see [Fie01]. Note that different terminology is used in [Rob96] as the set of fiber cardinalities of a factor map is called thickness spectrum and its supremum is called thickness whereas the supremum is called maximum rank in [ABKL15]. As shown in the next lemma, the set of fiber cardinalities of the maximal equicontinuous factor of a minimal dynamical system is invariant under topological conjugacy.
Lemma 2.2**.**
Let and be a minimal dynamical systems. Let and be two maximal equicontinuous factors. If and are topologically conjugate, then and have the same set of fiber cardinalities.
The maximal equicontinuous factor defines an equivalence relation on the elements as if and only if . A theorem of Auslander [Aus88, p.130] on the equivalence relation defined by the maximal equicontinuous factor says that if is minimal, then if and only if and are regionally proximal. Two elements are said to be regionally proximal if there are sequences of elements and a sequence of elements such that , and .
Proof.
Let be a topological conjugacy. Let us show that the formula defines a map . Let . Since is onto, there exists such that . Suppose that . Thus and by Auslanderâs theorem, and are regionally proximal. That property depends only on the distance so it is preserved by the topological conjugacy. Thus and are regionally proximal. Therefore which shows that is well-defined.
The map is one-to-one. Let and suppose that . Let such that and . Then . Thus and are regionally proximal from Auslanderâs theorem. Thus and are regionally proximal and we obtain .
It is sufficient to show that the fiber cardinalities of is a subset of the fiber cardinalities of . Let such that . Then which means that and . Since is one-to-one, we deduce . Thus and . We conclude that . In particular, and
[TABLE]
The equality follows from the symmetry of the argument. â
2.3. Subshifts and shifts of finite type
We follow the notation of [Sch01]. Let be a finite set, , and let be the set of all maps , equipped with the compact product topology. An element is called configuration and we write it as , where denotes the value of at . The topology on is compatible with the metric defined for all configurations by where . The shift action of on is defined by
[TABLE]
for every and . If , let denote the topological closure of and let denote the shift-closure of . A subset is shift-invariant if and a closed, shift-invariant subset is a subshift. If is a subshift we write for the restriction of the shift action (1) to . When is a subshift, the triple is a dynamical system and the notions presented in the previous section hold.
A configuration is periodic if there is a nonzero vector such that and otherwise it is said nonperiodic. We say that a nonempty subshift is aperiodic if the shift action on is free.
For any subset let denote the projection map which restricts every to . A pattern is a function for some finite subset . To every pattern corresponds a subset called cylinder. A subshift is a shift of finite type (SFT) if there exists a finite set of forbidden patterns such that
[TABLE]
In this case, we write . In this article, we consider shifts of finite type on , that is, the case .
3. Symbolic representations and Markov partitions for toral -rotations
We follow the section [LM95, §6.5] on Markov partitions where we adapt it to the case of invertible -actions. A topological partition of a metric space is a finite collection of disjoint open sets such that .
Suppose that is a compact metric space, is a dynamical system and that is a topological partition of . Let and be a finite set. We say that a pattern is allowed for if
[TABLE]
Let be the collection of all allowed patterns for . It can be checked that is the language of a subshift. Hence, using standard arguments [LM95, Prop. 1.3.4], there is a unique subshift whose language is . We call the symbolic dynamical system corresponding to . For each and there is a corresponding nonempty open set
[TABLE]
The closures of these sets are compact and decrease with , so that . It follows that . In order for configurations in to correspond to points in , this intersection should contain only one point. This leads to the following definition.
Definition 3.1**.**
Let be a compact metric space and be a dynamical system. A topological partition of gives a symbolic representation of if for every configuration the intersection consists of exactly one point . We call a symbolic representation of .
Markov partition were originally defined for one-dimensional dynamical systems and were extended to -actions by automorphisms of compact Abelian group in [ES97]. We allow ourselves to use the same terminology for dynamical systems defined by higher-dimensional actions by rotations.
Definition 3.2**.**
A topological partition of is a Markov partition for if
- âą
* gives a symbolic representation of and*
- âą
* is a shift of finite type (SFT).*
Of course, 2-dimensional SFTs are much different then 1-dimensional SFTs. For example, there exist 2-dimensional aperiodic SFTs with zero entropy. But this is not possible in the one-dimensional case, since one-dimensional infinite SFTs have positive entropy. In this article, we consider partitions associated to 2-dimensional aperiodic Wang shifts with zero entropy.
The partitions we consider are partitions of the 2-dimensional torus. Let be a lattice in , i.e., a discrete subgroup of the additive group with linearly independent generators. This defines a -dimensional torus . By analogy with the rotation on the circle for some , we use the terminology of rotation to denote the following -action defined on a 2-dimensional torus.
Definition 3.3**.**
For some , we consider the dynamical system where is the continuous -action on defined by
[TABLE]
for every . We say that the -action is a toral -rotation or a -rotation on .
From now on, we assume that the compact metric space is and that is a -rotation on when we consider dynamical systems .
Lemma 3.4**.**
Let be a minimal dynamical system and be a topological partition of . If there exists an atom which is invariant only under the trivial translation in , then gives a symbolic representation of .
Proof.
Let . Let . As already noticed, the closures are compact and decrease with , so that . It follows that .
We show that contains at most one element. Let . We assume and we want to show that if . Let for some be an atom which is invariant only under the trivial translation. Since , contains an open set . Since is minimal, any orbit is dense in . Therefore, there exists such that . Also which implies . Thus which implies that and since is a topological partition. Thus
[TABLE]
The fact that also means that which can be rewritten as or and we conclude that . Thus gives a symbolic representation of . â
Remark 3.5**.**
Note that minimality hypothesis in Lemma 3.4 is not necessary. For example, the partition of the torus gives a symbolic representation of the toral -rotation defined by even if is not minimal.
4. A one-to-one map from the 2-torus to symbolic representations
The goal of this section is to express the symbolic dynamical system as the closure of the image of a one-to-one map defined on the -torus. First we define the map on the points of the torus having a unique symbolic representation. Then, we extend it on all points of the torus by approaching them from some direction .
The set
[TABLE]
is the set of points whose orbits under the toral -rotation intersect the boundary of the topological partition . From the Baire Category Theorem [LM95, Theorem 6.1.24], the set is dense in .
For every starting point , the coding of its orbit under the toral -rotation is a 2-dimensional configuration:
[TABLE]
Thus it defines a map
[TABLE]
The map SymbRep can not be extended continuously on . Up to some choice to be made, it can still be extended to the whole domain . Recall that for interval exchange transformations, one way to deal with this issue is to consider two copies and for each discontinuity point [Kea75]. Here we use this idea in order to extend SymbRep on the whole domain by approaching any point from a chosen direction. Not all directions work, so we need some care to formalize this properly. Let with be the set of vectors parallel to a segment included in the boundary of some atom . If all atoms have curved boundaries, then . If the atoms are polygons like in this article, then the set contains nonzero directions. In any case, we assume that . For every we define
[TABLE]
We say that the configuration is generic if and that is singular if for some . The choice of direction is not so important since the topological closure of the range of does not depend on as shown in the next lemma. In other words, singular configurations are limits of generic configurations and is equal to the topological closure of the range of SymbRep.
Lemma 4.1**.**
For every , the following equalities hold
[TABLE]
where is the symbolic dynamical system corresponding to .
Proof.
() If , then . Thus . Then
[TABLE]
() Let . Then for some . We may extract a subsequence with such that for all . This implies that . Therefore . We obtain
[TABLE]
which proves the first equality.
Recall that the collection of all allowed patterns for is the language . The set is a subshift and contains . Moreover the language of is contained in . The equality follows since the symbolic dynamical system is the unique subshift whose language is . â
Lemma 4.2**.**
Let give a symbolic representation of the dynamical system and let . Then and are one-to-one. Moreover, the following diagrams commute:
[TABLE]
for every .
Proof.
The fact that implies that . Therefore, if then . Since gives a symbolic representation of the dynamical system , the set contains at most one element, and it implies that . Thus, is one-to-one. As and SymbRep agree on , we also have that SymbRep is one-to-one.
We now show conjugacy of -actions. Let , and . We have
[TABLE]
Therefore . The conjugacy of -actions by the map SymbRep also extends to . â
The fact that is one-to-one means that it admits a left-inverse map such that . But we can say more and define the map on the closure . Indeed, if gives a symbolic representation of the dynamical system , then there is a well-defined function from to which maps a configuration to the unique point in the intersection . We consider the map in the next section.
5. A factor map from symbolic representations to the 2-torus
In the spirit of [LM95, Prop. 6.5.8], the following result shows that there exists a continuous and onto homomorphism and therefore a factor map from to .
Proposition 5.1**.**
Let give a symbolic representation of the dynamical system . Let be defined such that is the unique point in the intersection . The map is a factor map from to which makes the following diagram commute
[TABLE]
for every . The map is one-to-one on .
Proof.
Let . We show that the map is continuous. Let . Let . Since the partition gives a symbolic representation, there exists such that the diameter of
[TABLE]
is smaller than or equal to . That set contains if is such that . We conclude that if , then which means that is continuous.
We show that the map is onto. Let and . Then . Since gives a symbolic representation of , we have that
[TABLE]
so that . Thus the image of contains the dense set . Since the image of a compact set via a continuous map is compact and therefore closed, it follows that the image of is all of .
An alternate proof that is onto uses . Let and for some . We have that . Therefore, and is onto.
We show that the map is a homomorphism:
[TABLE]
where . Therefore for every and is a factor map.
We show that is one-to-one on . Let and suppose that . This means that . Therefore for every we have
[TABLE]
Then for every and . Therefore for every , contains exactly one element. â
As mentioned in Remark 3.5, it is possible that is not minimal. But as shown in the next lemma, it is minimal if is minimal.
Lemma 5.2**.**
Let give a symbolic representation of the dynamical system . Then
- (i)
if is minimal, then is minimal, 2. (ii)
if is a free -action on , then aperiodic.
Proof.
Let be the factor map from Proposition 5.1.
(i) Let be a nonempty subshift. Thus is compact. Continuous map preserve compact sets, thus is compact. The set is also -invariant since for every . Since is minimal, the only nonempty compact subset of which is invariant under is . Thus .
For every , . Then contains for every such that is a singleton. Then contains . Since is closed, it must contain . From Lemma 4.1, this means that . Thus and is minimal.
(ii) Suppose that there exists such that is periodic, i.e., there exists such that . Since commutes the -actions, we obtain
[TABLE]
Since we assume that is a free -action, this implies that . Thus is aperiodic. â
We can now deduce a corollary of Proposition 5.1.
Corollary 5.3**.**
If the dynamical system is minimal and gives a symbolic representation of , then is the maximal equicontinuous factor of .
Proof.
From Lemma 5.2 (i), is minimal. The dynamical system is equicontinuous. We proved in Proposition 5.1 that the factor map is one-to-one on . In particular, there exists at least one element such that . From Lemma 2.1, is the maximal equicontinuous factor of . â
Remark 5.4**.**
There are some more consequences. From Proposition 5.1, we deduce that
[TABLE]
*where be the Haar measure on . From [FGL18], this implies that is a regular extension of and that is mean equicontinuous which has more structural consequences including the fact of having discrete spectrum with continuous eigenfunctions. We refer the reader to [FGL18] for the definitions of regular extension and mean equicontinuous. *
6. An isomorphism between symbolic dynamical systems and toral -rotations
Let be a subshift. Recall that for any subset , is the projection map which restricts every to . To every finite pattern correspond a cylinder . The set of all cylinders
[TABLE]
generates the Borel -algebra on .
Let give a symbolic representation of the dynamical system and let be the factor map from Proposition 5.1. For each , we have that
[TABLE]
is a closed set. Thus the image of a cylinder under for some finite pattern is a closed set called coding region for the pattern being the finite intersection of closed sets:
[TABLE]
The following proposition can be seen as an explicit construction of a strictly ergodic symbolic dynamical system isomorphic to the -rotation on the torus as established by the Theorem of Jewett and Krieger [DGS76] for one-dimensional dynamical systems and generalized to -actions by Rosenthal [Ros87].
Proposition 6.1**.**
Let give a symbolic representation of a minimal dynamical system . Suppose that for each atom where is the Haar measure on . Then the dynamical system is strictly ergodic and the measure-preserving dynamical system is isomorphic to where is the unique shift-invariant probability measure on .
Proof.
We prove that the factor map from Proposition 5.1 provides the isomorphism. The map is measurable as is continuous and is compact for any compact subset . Let be the Haar measure on . By hypothesis, is minimal. It is also strictly ergodic [Wal82] with being the only -invariant probability measure on .
Since is continuous and is a compact metric space, the set of -invariant probability measures on is nonempty [Wal82, Cor. 6.9.1]. Thus let . Let be the cylinder corresponding to some pattern for some finite subset . From Equation (3) we know that is a closed set being the intersection of a finite number of closed sets. Closed sets as well as their interior are both measurable for the Haar measure . Continuity of implies that and are both measurable for .
For each letter , we have . Thus we have
[TABLE]
so that
[TABLE]
Let be the pushforward map
[TABLE]
which maps shift-invariant measures on to -invariant measures on . But there is only one such measure, so that for every . For every , we have for the left-hand side
[TABLE]
and for the right-hand side
[TABLE]
As the boundary of is a -null set, we obtain
[TABLE]
and we conclude that
[TABLE]
Since measures are defined from the measure of cylinders which generate the Borel -algebra, we conclude that there is a unique shift-invariant probability measure on . Thus is uniquely ergodic and therefore strictly ergodic since minimality of was proved in Lemma 5.2. â
Proposition 6.1 implies uniform pattern frequencies for configurations in . It also means that the symbolic dynamical system is an almost one-to-one extension of a Kronecker dynamical system (a rotation action on a compact Abelian group) and from Von Neumannâs Theorem [Que10, Theorem 3.9], it implies that has discrete spectrum. See also [Rob07] for a treatment of Von Neumannâs Theorem in the context of tiling dynamical systems.
Part II Wang shifts as codings of toral -rotations
This part is divided into 5 sections. After introducing Wang tiles and Wang shifts, we present a generic method for constructing sets of Wang tiles and valid configurations in the associated Wang shift as codings of toral -rotations. We illustrate the method on Jeandel-Raoâs set of 11 Wang tiles and on a self-similar set of 19 Wang tiles. We expose the limitations of the method by presenting two ânon-examplesâ.
7. Wang shifts
A Wang tile \tau=\raisebox{-8.53581pt}{ \leavevmode\hbox to26.13pt{\vbox to27.59pt{\pgfpicture\makeatletter\hbox{\hskip 0.2pt\lower-0.98941pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{25.6073pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } {}{{}}{} {}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{0.0pt}{25.6073pt}\pgfsys@stroke\pgfsys@invoke{ } {}{{}}{} {}{}{}\pgfsys@moveto{25.6073pt}{25.6073pt}\pgfsys@lineto{25.6073pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } {}{{}}{} {}{}{}\pgfsys@moveto{25.6073pt}{25.6073pt}\pgfsys@lineto{0.0pt}{25.6073pt}\pgfsys@stroke\pgfsys@invoke{ } {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{1.0}{0.0}{0.0}{1.0}{18.37155pt}{11.08144pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{\footnotesize{a}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{1.0}{0.0}{0.0}{1.0}{11.08699pt}{17.70813pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{\footnotesize{b}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{1.0}{0.0}{0.0}{1.0}{3.39035pt}{11.08144pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{\footnotesize{c}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{1.0}{0.0}{0.0}{1.0}{10.72171pt}{2.3436pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{\footnotesize{d}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}} is a unit square with colored edges formally represented as a tuple of four colors where , are two finite sets (the vertical and horizontal colors respectively). For each Wang tile , let , , , denote the colors of the right, top, left and bottom edges of [Wan61, Rob71].
Let be a set of Wang tiles. A configuration is valid if it assigns tiles to each position of so that contiguous edges have the same color, that is,
[TABLE]
for every where and . Let denote the set of all valid configurations and we call it the Wang shift of . Together with the shift action of on , is a SFT of the form (2) since there exists a finite set of forbidden patterns made of all horizontal and vertical dominoes of two tiles that do not share an edge of the same color.
A set of Wang tiles is periodic if there exists a periodic configuration . Originally, Wang thought that every set of Wang tiles is periodic as soon as is nonempty [Wan61]. This statement is equivalent to the existence of an algorithm solving the domino problem, that is, taking as input a set of Wang tiles and returning yes or no whether there exists a valid configuration with these tiles. Berger, a student of Wang, later proved that the domino problem is undecidable and he also provided a first example of an aperiodic set of Wang tiles [Ber66]. A set of Wang tiles is aperiodic if the Wang shift is a nonempty aperiodic subshift. This means that in general one can not decide the emptiness of a Wang shift . This illustrates that the behavior of -dimensional SFTs when is much different than the one-dimensional case where emptiness of a SFT is decidable [LM95]. Note that another important difference between and is expressed in terms of the possible values of entropy of -dimensional SFTs, see [HM10].
8. From toral partitions and -rotations to Wang shifts
We consider the -torus where is a lattice in . We suppose that is a dynamical system where is a toral -rotation. Let , be two finite topological partitions of . For each we define the intersection of 4 atoms in the following way
[TABLE]
where and . The quadruples for which the intersection is nonempty define a set
[TABLE]
that we see as a set of Wang tiles. Naturally, this comes with a topological partition
[TABLE]
of which is the refinement of the four partitions (the right color), (the top color), (the left color) and (the bottom color). Thus to each corresponds a unique Wang tile, that is, a right, a top, a left and a bottom color according to which atom it belongs in each of the four partitions.
Proposition 8.1**.**
Let be a dynamical system where is a -rotation and let and be two finite topological partitions of . Let be the refinement of four partitions. Let be the set of Wang tiles defined above as the set of quadruples such that is a nonempty atom of the partition . Then is a subshift of the Wang shift .
Proof.
Let and . Let . First we check that Equation (4) is satisfied. There exists such that . Equivalently, . Thus we have
[TABLE]
Similarly we check that Equation (5) is satisfied. There exists such that . Equivalently, . Thus we have
[TABLE]
Then the configuration is valid and . Thus .
Remark that is closed since it is a subshift. Therefore the topological closure of the image of SymbRep is in the Wang shift . Using Lemma 4.1, we conclude that
[TABLE]
Lemma 8.2**.**
If the refined partition gives a symbolic representation of , then for every , is a one-to-one map .
Proof.
Follows from Lemma 4.2 and Proposition 8.1. â
9. Example 1: Jeandel-Rao aperiodic Wang shift
Consider the lattice where . On the torus , we consider the -rotation defined by
[TABLE]
for every . We consider the fundamental domain of for the group of translations . Let and be sets of colors and consider the partitions and shown in Figure 4.
The refined partition is . The set of quadruples such that is nonempty is
[TABLE]
which can be seen as a set of Wang tiles
[TABLE]
We observe that is Jeandel-Raoâs set of 11 tiles [JR15]. Let be the Jeandel-Rao Wang shift. We may now prove Theorem 1 which follows mostly from the work done in the Part I.
Proof of Theorem 1.
(i) The dynamical system is minimal. Since and are linearly independent irrational rotations on , we have that is a free -action. Thus from Lemma 5.2, is minimal and aperiodic. From Proposition 8.1 and from Equation (6), we have . It was proved in [Lab19c] that the Jeandel-Rao Wang shift is not minimal. Thus is nonempty.
(ii) The atom is invariant only under the trivial translation. Therefore, from Lemma 3.4, gives a symbolic representation of .
(iii) From Proposition 5.1, there exists a factor map from to and from Corollary 5.3, is the maximal equicontinuous factor of .
(iv) From Proposition 5.1, we have that is one-to-one on . Suppose that . We have . If , then we may show that there exists such that . If for some , then the set contains 8 different configurations of the form for some where . If but is not in the orbit of under , then . We conclude that .
(v) We have that for each atom where is the Haar measure on . The result follows from Proposition 6.1. â
The frequency of any pattern in is equal to the measure of the associated cylinder in which is equal to the Haar measure of in and can be computed using Equation (3) as the area of the coding region which is the intersection of polygons. Here is what it gives for the frequencies of tiles in .
Proposition 9.1**.**
The frequencies of each of the 11 Jeandel-Rao tiles for in the subshift is given by the measure of the cylinders below:
[TABLE]
Proof.
Thanks to Theorem 1 (v), it can be computed from the area of atoms of the partition shown in Figure 4 and dividing by the area of the fundamental domain which is . â
We may check that the frequency of each tile in the minimal subshift match those obtained in [Lab19c] for some minimal subshift and computed from the substitutive structure of . In fact, but we postpone the proof of this in a later work [Lab19b] in which the substitutive structure of is described using Rauzy induction of toral partitions and -rotations. In [Lab19c], we also proved that is a shift of finite type as it can be described by the forbidden patterns coming from plus a finite number of other forbidden patterns. The completion of the proof of the equality will imply that the following statement holds, but we can only state it as a conjecture for now.
Conjecture 9.2**.**
* is a Markov partition for .*
10. Example 2: A minimal aperiodic Wang shift defined by 19 tiles
On the torus , we consider the -rotation defined by
[TABLE]
for every where . Let and be sets of colors and consider the partitions and shown in Figure 5.
The refined partition is . Let be the set of quadruples such that is nonempty. We represent as a set of Wang tiles, see Figure 6. It corresponds to the set of 19 Wang tiles introduced in [Lab19a] which was derived from the substitutive structure of the Jeandel-Rao Wang shift [Lab19c].
Let be the Wang shift associated with the set of Wang tiles . We now prove the second theorem of the article. Note that the fact that is minimal (proved in [Lab19a]) allows to conclude that is a Markov partition without having to exploit the substitutive structure of which is computed in [Lab19b].
Proof of Theorem 2.
(i) The dynamical system is minimal. Since and are linearly independent irrational rotations, we have that is a free -action. Thus from Lemma 5.2, is minimal and aperiodic. From Proposition 8.1, we have . It was proved in [Lab19a] that is minimal. Thus .
(ii) The atom is invariant only under the trivial translation. Therefore, from Lemma 3.4, gives a symbolic representation of . Moreover is a shift of finite type. Therefore, the conditions of Definition 3.2 are satisfied and is a Markov partition for the dynamical system .
(iii) From Proposition 5.1, there exists a factor map from to and from Corollary 5.3, is the maximal equicontinuous factor of .
(iv) In Proposition 5.1, we proved that is one-to-one on . Suppose that . We have . If , then we may show that there exists such that . If for some , then the set contains 8 different configurations of the form for some where . If but not in the orbit of under , then . We conclude that .
(v) We have that for each atom where is the Haar measure on . The result follows from Proposition 6.1. â
11. Two non-examples
In this section, we present two ânon-examplesâ. The motivation for presenting those two ânon-examplesâ is to illustrate that properties of partitions presented in the previous sections are not shared by ârandomlyâ chosen partitions of and -rotations on .
Example 3
Let . On the torus , we consider the -rotation defined by
[TABLE]
for every . Let and be trivial partitions with . The refined partition is where . The set of Wang tiles is a singleton set with . The associated color partitions and the tile coding partition are shown in Figure 7.
The map is clearly not one-to-one, but it is onto.
Lemma 11.1**.**
We have , but the partition does not give a symbolic representation of .
Proof.
The set of Wang tiles is a singleton set with . Therefore contains a unique configuration corresponding to the constant map for all . The fact that follows from Proposition 8.1. The unique constant configuration in can be obtained as for any . Therefore SymbRep is onto.
The partition does not give a symbolic representation of as every point of is associated with the same configuration. â
Example 4
Let . On the torus , we consider the -rotation defined by
[TABLE]
for every . Let and be sets of colors. We consider the partitions and shown in Figure 8 involving slopes and in the partition of into polygons. The refined partition is where is the set of Wang tiles made of 20 tiles shown in Figure 9.
Lemma 11.2**.**
The partition gives a symbolic representation of and is the maximal equicontinuous factor of . We have that is a strictly ergodic and aperiodic subshift of . But the Wang shift contains a periodic configuration so .
Proof.
The dynamical system is minimal. The atom is invariant only under the trivial translation. Therefore, from Lemma 3.4, gives a symbolic representation of . From Proposition 5.1 , there exists a factor map from to and from Corollary 5.3, is the maximal equicontinuous factor of .
Since and are linearly independent irrational rotations, we have that is a free -action. Thus from Lemma 5.2, is minimal and aperiodic. From Proposition 6.1, is uniquely ergodic thus strictly ergodic. From Proposition 8.1, we have . The set of Wang tiles contains the tile . Let be the constant map for all . The configuration is valid and periodic, thus . â
The two examples presented in this section show that we can not expect Theorem 1 and Theorem 2 to hold for any given toral partition and -rotation. The characterization of toral partitions and -rotations for which such results hold is an open question.
Part III Wang shifts as model sets of cut and project schemes
This part is divided into three sections. Its goal is to show that occurrences of patterns in a minimal subshift of the Jeandel-Rao Wang shift and in the Wang shift are obtained as 4-to-2 cut and project schemes.
12. Cut and project schemes and model sets
In [BHP97], the torus parametrization of three tiling dynamical systems was given. We want to do similarly in the case of symbolic dynamical systems and in particular in the case of Wang shifts. We recall from the more recent book [BG13, §7.2] the definition of cut and project scheme and we reuse their notation.
Definition 12.1**.**
A cut and project scheme (CPS) is a triple with a (compactly generated) locally compact Abelian group (LCAG) , a lattice in and the two natural projections and , subject to the conditions that is injective and that is dense in .
A CPS is called Euclidean when for some . A general CPS is summarized in the following diagram.
[TABLE]
The image is denoted . Since for a given CPS, is a bijection between and , there is a well-defined mapping given by
[TABLE]
where is the unique point in the set . This mapping is called the star map of the CPS. The -image of is denoted by . The set can be viewed as a diagonal embedding of as
[TABLE]
For a given CPS and a (general) set ,
[TABLE]
is the projection set within the CPS. The set is called its acceptance set, window or coding set.
Definition 12.2**.**
If is a relatively compact set with non-empty interior, the projection set , or any translate with , is called a model set.
A model set is termed regular when , where is the Haar measure of . If , the model set is called generic. If the window is not in a generic position (meaning that ), the corresponding model set is called singular.
The shape of the acceptance set is important and implies structure on the model set . For example, if is relatively compact, has finite local complexity and thus also is uniformly discrete; if , is relatively dense. If is a model set, it is also a Meyer set, [BG13, Prop. 7.5]. For regular model set with a compact window , it is known [BG13, Theorem 7.2] that the points are uniformly distributed in .
Linear repetitivity of model sets is an important notion. Recall that a Delone set is called linearly repetitive if there exists a constant such that, for any , every patch of size in occurs in every ball of diameter in . It was shown by Lagarias and Pleasants in [LP03, Theorem 6.1] that linear repetitivity of a Delone set implies the existence of strict uniform patch frequencies, equivalently the associated dynamical system on the hull of the point set is strictly ergodic (minimal and uniquely ergodic). As a consequence [LP03, Cor. 6.1], a linearly repetitive Delone set in has a unique autocorrelation measure . This measure is a pure discrete measure supported on . In particular is diffractive. A characterization of linearly repetitive model sets for cubical acceptance set was recently proved by Haynes, Koivusalo and Walton [HKW18].
Polygon exchange transformations
We end this section with a concept that will be useful for the next two sections. Suppose that is a dynamical system where is a -rotation on . The rotations and can be seen as polygon exchange transformations [Sch14] on a fundamental domain of .
Definition 12.3**.**
[AKY19]** Let be a polygon together with two topological partitions of into polygons
[TABLE]
such that for each , and are translation equivalent, i.e., there exists such that . A polygon exchange transformation (PET) is the piecewise translation on defined for by . The map is not defined for points .
13. A model set for the Jeandel-Rao Wang shift
We want to describe the positions of patterns in configurations belonging to . Because of that, in the construction of a proper cut and project scheme, we need to be careful in the choice of the locally compact Abelian group so that is an injective map. This is why we introduce the submodule and define the projections and on as:
[TABLE]
and
[TABLE]
where . The product of the projections is one-to-one and onto. Therefore, the projections define a Euclidean cut and project scheme with and on .
Recall that we proved in Theorem 1 that and that there exists a factor map from to . Therefore any Jeandel-Rao configuration can be qualified as a singular or generic according to whether is in the set or not.
Proof of Theorem 3.
Let . Let . We consider the lattice . We have that is injective. Also since . We also have that is dense in . Also .
Recall that the -rotation is defined on the torus by for every . The maps and can be seen as polygon exchange transformations on the fundamental domain of (see Figure 10):
[TABLE]
The translations written in terms of the base of and and vice versa are:
[TABLE]
Since is a fundamental domain for , by definition for every , there exist unique such that . Therefore, for every there exist unique such that the following holds
[TABLE]
Notice that the projection into the physical space is
[TABLE]
Thus
[TABLE]
so that
[TABLE]
Let be a pattern occurring in the configuration for some subset . Let be the cylinder associated with the pattern and be the acceptance set. The set is a polygon by construction, see Equation (3). Therefore the Lebesgue measure of is zero. Assume for now that is a generic configuration. Since for every , the set of occurrences of in is
[TABLE]
which is a regular and generic model set. If is a singular configuration, then for some . If , then we take as acceptance set and we have
[TABLE]
which is a regular and singular model set. â
14. A model set for the Wang shift defined by 19 tiles
As in the previous section we use the submodule and define the projections on as:
[TABLE]
and
[TABLE]
where . The product of the projections is one-to-one and onto so we may identify the domain of the projections as , in agreement with the definition of cut and project scheme.
Note that if , then is injective and . If the acceptance set is the whole cubical window , we obtain a description of the positions of patterns in a configuration as a model set, that is, . In the result below, noncubical acceptance sets are used to describe the positions of patterns occurring in configurations.
Recall that we proved among other things in Theorem 2 that and that there exists a factor map from to . Therefore any configuration can be qualified as singular or generic according to whether is in the set or not.
Theorem 4**.**
*Let be the self-similar set of Wang tiles shown in Figure 6. There exists a cut and project scheme such that for every configuration , the set of occurrences of a pattern in is a regular model set. If is a generic (resp. singular) configuration, then is a generic (resp. singular) model set. *
Proof.
Let be a valid configuration and let . We consider . We have that is injective and . We also have that is dense in . Also .
Since is a bijection between and , there is a well-defined mapping given by
[TABLE]
where is the unique point in the set .
Recall that the -rotation is defined on the torus by for every . The maps and can be seen as polygon exchange transformations on the fundamental domain of :
[TABLE]
with , , and , see Figure 11.
Notice that the base of can be written in terms of the translations as
[TABLE]
Since is a fundamental domain for , for every there exist unique such that . Therefore, for every there exist unique such that the following holds
[TABLE]
Notice that the projection into the physical space is
[TABLE]
Thus
[TABLE]
so that
[TABLE]
where is the fractional part of .
Let be a pattern occurring in the configuration for some subset . Let be the cylinder associated with the pattern and be the acceptance set. The set is a polygon by construction, see Equation (3). Therefore the Lebesgue measure of is zero. Assume for now that is a generic configuration. Since for every , the set of occurrences of in is
[TABLE]
which is a regular and generic model set. If is a singular configuration, then for some . If , then we take as acceptance set and we have
[TABLE]
which is a regular and singular model set. â
In [Lab19a], was proved to be self-similar being invariant under the application of an expansive and primitive substitution. It follows that is linearly repetitive. Based on [HKW18], an alternate proof of linear repetitivity of could be obtained now that is described as a model set. Some more work has to be done as the characterization of linearly repetitive model sets provided in [HKW18] is stated for cubical windows only.
In the present work, we made the choice of uniform size for Wang tiles but we can make the following remark on the use of other rectangular shapes and stone inflations.
Remark 14.1**.**
To use the natural size for Wang tiles in as stone inflation deduced from its self-similarity, see [Lab19a, §7], one must use
[TABLE]
as projection into the physical space. In this case, is injective making it a proper cut and project scheme. Another way to construct the cut and project scheme is to use the Minkowski embedding of
[TABLE]
where the star map corresponds to the algebraic conjugation in the quadratic field , see [BG13, §7]. In this setup, the natural window to be used should be instead of following known construction in the Fibonacci case. We do not provide this construction here.
References and appendix
Appendix â A DIY Puzzle to illustrate the results
We encode the 11 Jeandel-Rao tiles into geometrical shapes, see Figure 2, where each integer color in is replaced by an equal number of triangular or circular bumps.
Print one or more copies of this page and cut each of the 25 tiles shown in Figure 12 with scissors. Use the tiles and the Universal solver for Jeandel-Rao Wang shift shown in Figure 13 to construct every pattern seen in the proper minimal subshift of the Jeandel-Rao Wang shift.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ABKL 15] J.-B. Aujogue, M. Barge, J. Kellendonk, and D. Lenz. Equicontinuous factors, proximality and Ellis semigroup for Delone sets. In Mathematics of Aperiodic Order , volume 309 of Progr. Math. , pages 137â194. BirkhĂ€user/Springer, Basel, 2015. doi:10.1007/978-3-0348-0903-0_5 . · doi â
- 2[Adl 98] R. L. Adler. Symbolic dynamics and Markov partitions. Bull. Amer. Math. Soc. (N.S.) , 35(1):1â56, 1998. doi:10.1090/S 0273-0979-98-00737-X . · doi â
- 3[AFHI 11] P. Arnoux, M. Furukado, E. Harriss, and S. Ito. Algebraic numbers, free group automorphisms and substitutions on the plane. Trans. Amer. Math. Soc. , 363(9):4651â4699, 2011. doi:10.1090/S 0002-9947-2011-05188-3 . · doi â
- 4[AKY 19] I. Alevy, R. Kenyon, and R. Yi. A family of minimal and renormalizable rectangle exchange maps. Ergodic Theory and Dynamical Systems , pages 1â28, 2019. doi:10.1017/etds.2019.77 . · doi â
- 5[Aus 88] J. Auslander. Minimal flows and their extensions , volume 153 of North-Holland Mathematics Studies . North-Holland Publishing Co., Amsterdam, 1988. Notas de MatemĂĄtica [Mathematical Notes], 122.
- 6[AW 70] R. L. Adler and B. Weiss. Similarity of Automorphisms of the Torus . Memoirs of the American Mathematical Society, No. 98. American Mathematical Society, Providence, R.I., 1970.
- 7[Ber 65] R. Berger. The undecidability of the domino problem . Pro Quest LLC, Ann Arbor, MI, 1965. Thesis (Ph.D.)âHarvard University.
- 8[Ber 66] R. Berger. The undecidability of the domino problem. Mem. Amer. Math. Soc. No. , 66:72, 1966.
