Skip to main content
Acta Crystallographica Section A: Foundations and Advances logoLink to Acta Crystallographica Section A: Foundations and Advances
. 2020 Aug 21;76(Pt 5):600–610. doi: 10.1107/S2053273320009717

Pure discrete spectrum and regular model sets in d-dimensional unimodular substitution tilings

Dong-il Lee a, Shigeki Akiyama b, Jeong-Yup Lee c,d,*
PMCID: PMC7478237  PMID: 32869758

The equivalence between pure discrete spectrum and regular model sets in d-dimensional unimodular substitution tilings is discussed.

Keywords: Pisot family substitution tilings, pure discrete spectrum, regular model sets, Meyer sets, rigidity

Abstract

Primitive substitution tilings on Inline graphic whose expansion maps are unimodular are considered. It is assumed that all the eigenvalues of the expansion maps are algebraic conjugates with the same multiplicity. In this case, a cut-and-project scheme can be constructed with a Euclidean internal space. Under some additional condition, it is shown that if the substitution tiling has pure discrete spectrum, then the corresponding representative point sets are regular model sets in that cut-and-project scheme.

1. Introduction  

In the study of aperiodic tilings, it has been an interesting problem to characterize pure discrete spectrum of tiling dynamical systems (Baake & Moody, 2004). This property is related to understanding the structure of mathematical quasicrystals. For this direction of study, substitution tilings have been good models, since they have highly symmetrical structures. A lot of research has been done in this direction (see Akiyama et al., 2015; Baake & Grimm, 2013 and references therein). Given a substitution tiling with pure discrete spectrum, it is known that this can be described via a cut-and-project scheme (CPS) (Lee, 2007). However, in the work of Lee (2007), the construction of the CPS is with an abstract internal space built from the pure discrete spectral property. Since the internal space is an abstract space, it is neither easy to understand the tiling structure, nor clear if the model sets are regular or not. In the case of one-dimensional substitution tilings with pure discrete spectrum, it is shown that a CPS with a Euclidean internal space can be built and the corresponding representative point sets are regular model sets (Barge & Kwapisz, 2006). In this paper, we consider substitution tilings on Inline graphic with pure discrete spectrum whose expansion maps are unimodular. We show that it is possible to construct a CPS with a Euclidean internal space and that the corresponding representative point sets are regular model sets in that CPS.

The outline of the paper is as follows. First, we consider a repetitive primitive substitution tiling on Inline graphic whose expansion map is unimodular. Then we build a CPS with a Euclidean internal space in Section 3. In Section 4, we discuss some known results around pure discrete spectrum, Meyer set and Pisot family. In Section 5, under the assumption of pure discrete spectrum, we show that each representative point set of the tiling is actually a regular model set in the CPS with a Euclidean internal space.

2. Preliminaries  

2.1. Tilings  

We begin with a set of types (or colours) Inline graphic, which we fix once and for all. A tile in Inline graphic is defined as a pair Inline graphic where Inline graphic (the support of T) is a compact set in Inline graphic, which is the closure of its interior, and Inline graphic is the type of T.

We let Inline graphic for Inline graphic. We say that a set P of tiles is a patch if the number of tiles in P is finite and the tiles of P have mutually disjoint interiors. The support of a patch is the union of the supports of the tiles that are in it. The translate of a patch P by Inline graphic is Inline graphic. We say that two patches Inline graphic and Inline graphic are translationally equivalent if Inline graphic for some Inline graphic. A tiling of Inline graphic is a set Inline graphic of tiles such that Inline graphic and distinct tiles have disjoint interiors. We always assume that any two Inline graphic-tiles with the same colour are translationally equivalent (hence there are finitely many Inline graphic-tiles up to translations). Given a tiling Inline graphic, a finite set of tiles of Inline graphic is called a Inline graphic-patch. Recall that a tiling Inline graphic is said to be repetitive if every Inline graphic-patch occurs relatively densely in space, up to translation. We say that a tiling Inline graphic has finite local complexity (FLC) if, for every R > 0, there are finitely many equivalence classes of Inline graphic-patches of diameter less than R.

2.2. Delone κ-sets  

A κ-set in Inline graphic is a subset Inline graphic Inline graphic Inline graphic (κ copies) where Inline graphic and κ is the number of colours. We also write Inline graphic Inline graphic. Recall that a Delone set is a relatively dense and uniformly discrete subset of Inline graphic. We say that Inline graphic is a Delone κ-set in Inline graphic if each Inline graphic is Delone and Inline graphic Inline graphic is Delone.

The types (or colours) of points for Delone κ-sets have a meaning analogous to the colours of tiles for tilings. We define repetitivity and FLC for a Delone κ-set in the same way as for tilings. A Delone set Λ is called a Meyer set in Inline graphic if Inline graphic is uniformly discrete, which is equivalent to saying that Inline graphic for some finite set F (see Moody, 1997). If Inline graphic is a Delone κ-set and Inline graphic) is a Meyer set, we say that Inline graphic is a Meyer set.

2.3. Substitutions  

We say that a linear map Inline graphic is expansive if there is a constant c > 1 with

2.3.

for all Inline graphic under some metric d on Inline graphic compatible with the standard topology.

Definition 2.1   —

Let Inline graphic be a finite set of tiles on Inline graphic such that Inline graphic; we will call them prototiles. Denote by Inline graphic the set of patches made of tiles each of which is a translate of one of Inline graphic’s. We say that Inline graphic is a tile-substitution (or simply substitution) with an expansive map ϕ if there exist finite sets Inline graphic for Inline graphic, such that

graphic file with name a-76-00600-efd2.jpg

with

graphic file with name a-76-00600-efd3.jpg

Here all sets in the right-hand side must have disjoint interiors; it is possible for some of the Inline graphic to be empty. We call the finite set Inline graphic a digit set (Lagarias & Wang, 1996). The substitution Inline graphic matrix Inline graphic of the tile-substitution is defined by Inline graphic. We say that ϕ is unimodular if the minimal polynomial of ϕ over Inline graphic has constant term Inline graphic (i.e. Inline graphic); that is to say, the product of all roots of the minimal polynomial of ϕ is Inline graphic.

Note that for Inline graphic

2.3.

where

2.3.

The tile-substitution is extended to translated prototiles by

2.3.

The equations (2) allow us to extend ω to patches in Inline graphic defined by Inline graphic. It is similarly extended to tilings all of whose tiles are translates of the prototiles from Inline graphic. A tiling Inline graphic satisfying Inline graphic is called a fixed point of the tile-substitution, or a substitution tiling with expansion map ϕ. It is known that one can always find a periodic point for ω in the tiling dynamical hull, i.e. Inline graphic for some Inline graphic. In this case we use Inline graphic in the place of ω to obtain a fixed-point tiling. We say that the substitution tiling Inline graphic is primitive, if there is an Inline graphic for which Inline graphic has no zero entries, where Inline graphic is the substitution matrix.

Definition 2.2   —

Inline graphic Inline graphic is called a substitution Delone κ-set if Inline graphic is a Delone κ-set and there exist an expansive map Inline graphic and finite sets Inline graphic for Inline graphic such that

graphic file with name a-76-00600-efd7.jpg

where the unions on the right-hand side are disjoint.

There is a standard way to choose distinguished points in the tiles of a primitive substitution tiling so that they form a ϕ-invariant Delone κ-set. They are called control points (Thurston, 1989; Praggastis, 1999) which are defined below.

Definition 2.3   —

Let Inline graphic be a fixed point of a primitive substitution with an expansion map ϕ. For every Inline graphic-tile T, we choose a tile Inline graphic on the patch Inline graphic; for all tiles of the same type, we choose Inline graphic with the same relative position. This defines a map Inline graphic called the tile map. Then we define the control point for a tile Inline graphic by

graphic file with name a-76-00600-efd8.jpg

The control points satisfy the following:

(a) Inline graphic, for any tiles Inline graphic of the same type;

(b) Inline graphic, for Inline graphic.

For tiles of any tiling Inline graphic, the control points have the same relative position as in Inline graphic-tiles. The choice of control points is non-unique, but there are only finitely many possibilities, determined by the choice of the tile map. Let

2.3.

It is possible to consider a tile map

2.3.

Then for any Inline graphic,

2.3.

Let

2.3.

be a set of control points of the tiling Inline graphic in Inline graphic. In what follows, if there is no confusion, we will use the same notation Inline graphic to mean Inline graphic.

For the main results of this paper, we need the property that Inline graphic with Inline graphic. Under the assumption that ϕ is unimodular, this can be achieved by taking a proper control point set which comes from a certain tile map. We define the tile map as follows. It is known that there exists a finite patch Inline graphic in a primitive substitution tiling which generates the whole tiling Inline graphic (Lagarias & Wang, 2003). Although it was defined with primitive substitution point sets by Lagarias & Wang (2003), it is easy to see that the same property holds for primitive substitution tilings. We call the finite patch Inline graphic the generating tile set. When we apply the substitution infinitely many times to the generating tile set Inline graphic, we obtain the whole substitution tiling. So there exists Inline graphic such that nth iteration of the substitution to the generating tile set covers the origin. We choose a tile R in a patch Inline graphic which contains the origin, where Inline graphic for some Inline graphic. Then there exists a fixed tile Inline graphic such that Inline graphic. Replacing the substitution ω by Inline graphic, we can define a tile map γ so that

2.3.

Then Inline graphic by the definition of the control point sets and so Inline graphic. Notice that

2.3.

since ϕ is unimodular. From the construction of the tile map, we have Inline graphic for any Inline graphic. From (9), Inline graphic for any Inline graphic. Hence Inline graphic. Thus

2.3.

Remark 2.4   —

In the case of primitive unimodular irreducible one-dimensional Pisot substitution tilings, it is known that Inline graphic by choosing the left end points of the tiles as the control points (see Barge & Kwapisz, 2006; Sing, 2007).

2.4. Pure point spectrum and algebraic coincidence  

Let Inline graphic be the collection of tilings on Inline graphic each of whose patches is a translate of a Inline graphic-patch. In the case that Inline graphic has FLC, we give a usual metric δ on the tilings in such a way that two tilings are close if there is a large agreement on a big region with small shift (see Schlottmann, 2000; Radin & Wolff, 1992; Lee et al., 2003). Then

2.4.

where the closure is taken in the topology induced by the metric δ. For non-FLC tilings, we can consider ‘local rubber topology’ on the collection of tilings (Müller & Richard, 2013; Lenz & Stollmann, 2003; Baake & Lenz, 2004; Lee & Solomyak, 2019) and obtain Inline graphic as the completion of the orbit closure of Inline graphic under this topology. For tilings with FLC, the two topologies coincide. In the case of either FLC or non-FLC tilings, we obtain a compact space Inline graphic. We have a natural action of Inline graphic on the dynamical hull Inline graphic of Inline graphic by translations and get a topological dynamical system Inline graphic. Let us assume that there is a unique ergodic measure μ in the dynamical system Inline graphic and consider the measure-preserving dynamical system Inline graphic. It is known that a dynamical system Inline graphic with a primitive substitution tiling Inline graphic always has a unique ergodic measure (Solomyak, 1997; Lee et al., 2003). We consider the associated group of unitary operators Inline graphic on Inline graphic:

2.4.

Every Inline graphic defines a function on Inline graphic by Inline graphic. This function is positive definite on Inline graphic, so its Fourier transform is a positive measure Inline graphic on Inline graphic called the spectral measure corresponding to g. The dynamical system Inline graphic is said to have pure discrete spectrum if Inline graphic is pure point for every Inline graphic. We also say that Inline graphic has pure discrete spectrum if the dynamical system Inline graphic has pure discrete spectrum.

When we restrict discussion to primitive substitution tilings, we note that a tiling Inline graphic has pure discrete spectrum if and only if the control point set Inline graphic of the tiling Inline graphic admits an algebraic coincidence (see Definition 2.5). So from now on when we assume pure discrete spectrum for Inline graphic, we can directly use the property of algebraic coincidence. We give the corresponding definition and theorem below.

Definition 2.5   —

Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansive map ϕ and Inline graphic be a corresponding control point set. We say that Inline graphic admits an algebraic coincidence if there exists Inline graphic and Inline graphic for some Inline graphic such that

graphic file with name a-76-00600-efd18.jpg

Here recall from (7) that Inline graphic.

Note that, if the algebraic coincidence is assumed, then for some Inline graphic

2.4.

Theorem 2.6   —

[Theorem 3.13 (Lee, 2007)] Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansive map ϕ and Inline graphic be a corresponding control point set. Suppose that all the eigenvalues of ϕ are algebraic integers. Then Inline graphic has pure discrete spectrum if and only if Inline graphic admits an algebraic coincidence.

The above theorem is stated with FLC by Lee (2007). But from Lemma 4.1 and Proposition 4.2, pure discrete dynamical spectrum of Inline graphic implies the Meyer property of the control point set Inline graphic. All Meyer sets have FLC. So it is a consequence of pure discrete dynamical spectrum. On the other hand, the algebraic coincidence implies that

2.4.

This means that Inline graphic is uniformly discrete and thus Ξ is uniformly discrete. From Moody (1997), we obtain that Inline graphic is uniformly discrete. For any Inline graphic,

2.4.

Hence Inline graphic is a Meyer set (Moody, 1997). Thus it is not necessary to assume FLC here. There is a computable algorithm to check the algebraic coincidence in a primitive substitution tiling (Akiyama & Lee, 2011).

2.5. Cut-and-project scheme  

We give definitions for a CPS and model sets constructed with Inline graphic and a locally compact Abelian group.

Definition 2.7   —

A cut-and-project scheme (CPS) consists of a collection of spaces and mappings as follows:

graphic file with name a-76-00600-efd22.jpg

where Inline graphic is a real Euclidean space, H is a locally compact Abelian group, Inline graphic and Inline graphic are the canonical projections, Inline graphic is a lattice, i.e. a discrete subgroup for which the quotient group Inline graphic is compact, Inline graphic is injective and Inline graphic is dense in H. For a subset Inline graphic, we denote

graphic file with name a-76-00600-efd23.jpg

A model set in Inline graphic is a subset Inline graphic of Inline graphic of the form Inline graphic, where Inline graphic has non-empty interior and compact closure. The model set Inline graphic is regular if the boundary of W

graphic file with name a-76-00600-efd24.jpg

is of (Haar) measure 0. We say that Inline graphic Inline graphic is a model κ-set (respectively, regular model κ-set) if each Inline graphic is a model set (respectively, regular model set) with respect to the same CPS. Especially when H is a Euclidean space, we call the model set Λ a Euclidean model set (see Baake & Grimm, 2013).

3. Cut-and-project scheme on substitution tilings  

Throughout the rest of the paper, we assume that ϕ is diagonalizable, the eigenvalues of ϕ are algebraically conjugate with the same multiplicity, since the structure of a module generated by the control points is known only under this assumption (Lee & Solomyak, 2012).

Let

3.

be the distinct real eigenvalues of ϕ and

3.

be the distinct complex eigenvalues of ϕ. By the above assumption, all these eigenvalues appear with the same multiplicity, which we will denote by J. Recall that ϕ is assumed to be diagonalizable over Inline graphic. For a complex eigenvalue λ of ϕ, the Inline graphic diagonal block

3.

is similar to a real Inline graphic matrix

3.

where Inline graphic, and

3.

Since ϕ is diagonalizable, by eventually changing the basis in Inline graphic, we can assume without loss of generality that

3.

where Inline graphic is a real Inline graphic matrix for Inline graphic, a real Inline graphic matrix of the form

3.

for Inline graphic, and Inline graphic is the Inline graphic zero matrix, and Inline graphic.

Let Inline graphic. Note that m is the degree of the minimal polynomial of ϕ over Inline graphic. For each Inline graphic, let

3.

Further, for each Inline graphic we have the direct sum decomposition

3.

such that each Inline graphic is Inline graphic-invariant and Inline graphic, identifying Inline graphic with Inline graphic or Inline graphic.

Let Inline graphic.

Let Inline graphic be the canonical projection of Inline graphic onto Inline graphic such that

3.

where Inline graphic and Inline graphic with Inline graphic.

We define Inline graphic such that for each Inline graphic,

3.

We recall the following theorem for the module structure of the control point sets. From Lemma 6.1 (Lee & Solomyak, 2012), we can readily obtain the property:1

3.

which is used in the proof of Lemma 5.2. So we state Theorem 4.1 (Lee & Solomyak, 2012) in the following form. Let

3.

Theorem 3.1   —

[Theorem. 4.1 (Lee & Solomyak, 2012)] Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with an expansion map ϕ. Assume that Inline graphic has FLC, ϕ is diagonalizable, and all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity J. Then there exists an isomorphism Inline graphic such that

graphic file with name a-76-00600-efd38.jpg

where Inline graphic, Inline graphic, are given in (18), and Inline graphic Inline graphic.

Since ϕ is a block diagonal matrix as shown in (16), we can note that Inline graphic are linearly independent over Inline graphic.

A tiling Inline graphic is said to be rigid if Inline graphic satisfies the result of Theorem 3.1; that is to say, there exists a linear isomorphism Inline graphic such that

3.

where Inline graphic, Inline graphic, are given in (18). One can find an example of a non-FLC tiling that the rigidity property fails in (Frank & Robinson, 2008; Lee & Solomyak, 2019).

3.1. Construction of a cut-and-project scheme  

Consider that ϕ is unimodular and diagonalizable, all the eigenvalues of ϕ are algebraic integers and algebraically conjugate with the same multiplicity J, and Inline graphic is rigid. Since ϕ is an expansion map and unimodular, there exists at least one other algebraic conjugate other than eigenvalues of ϕ. Under this condition, we construct a CPS with a Euclidean internal space. In the case of multiplicity 1, the CPS was first introduced in Lee et al. (2018). For earlier development, see Siegel & Thuswaldner (2009).

It is known that if ϕ is a diagonalizable expansion map of a primitive substitution tiling with FLC, every eigenvalue of ϕ is an algebraic integer (Kenyon & Solomyak, 2010). So it is natural to assume that all the eigenvalues of ϕ are algebraic integers in the assumption. In (16), suppose that the minimal polynomial of ψ over Inline graphic has e number of real roots and f number of pairs of complex conjugate roots. Recall that

3.1.

are distinct eigenvalues of ϕ from (13) and (21). Let us consider the roots in the following order:

3.1.

for which

3.1.
3.1.

where Inline graphic are the same as in (13) and (14).

Let

3.1.

We consider a space where the rest of the roots of the minimal polynomial of ψ other than the eigenvalues of ψ lie. Using similar matrices as in (15) we can consider the space as a Euclidean space. Let

3.1.

For Inline graphic, define a Inline graphic matrix

3.1.

where Inline graphic is a real Inline graphic matrix with the value Inline graphic for Inline graphic, and Inline graphic is a real Inline graphic matrix of the form

3.1.

for Inline graphic. Notice that ϕ and ψ have the same minimal polynomial over Inline graphic, since ϕ is the diagonal matrix containing J copies of ψ. Let us consider now the following algebraic embeddings:

3.1.

where Inline graphic is a polynomial over Inline graphic and Inline graphic. Note that

3.1.

Now we can define a map

3.1.

Since Inline graphic are linearly independent over Inline graphic, the map Ψ is well defined. Thus Inline graphic for

3.1.

where Inline graphic. Let Inline graphic.

Let us construct a CPS:

3.1.

where Inline graphic and Inline graphic are canonical projections,

3.1.

and

3.1.

It is easy to see that Inline graphic is injective. We shall show that Inline graphic is dense in Inline graphic and Inline graphic is a lattice in Inline graphic. We note that Inline graphic is injective, since Ψ is injective. Since ϕ commutes with the isomorphism σ in Theorem 3.1, we may identify Inline graphic and its isomorphic image. Thus, from Theorem 3.1,

3.1.

where Inline graphic. Note that for any Inline graphic and Inline graphic, Inline graphic. So we can note that

3.1.

Lemma 3.2   —

Inline graphic is a lattice in Inline graphic.

Proof   —

By the Cayley–Hamilton theorem, there exists a monic polynomial Inline graphic of degree n such that Inline graphic. Thus every element of Inline graphic is expressed as a polynomial of ϕ of degree Inline graphic with integer coefficients where the constant term is identified with a constant multiple of the identity matrix. Therefore L is a free Inline graphic-module of rank nJ. Notice that L and Inline graphic are isomorphic Inline graphic-modules so that Inline graphic is also a free Inline graphic-module of rank nJ on Inline graphic. Let us define

graphic file with name a-76-00600-efd57.jpg

Then, in fact, for any Inline graphic,

graphic file with name a-76-00600-efd58.jpg

Define also

graphic file with name a-76-00600-efd59.jpg

which is a linear map on Inline graphic. Note that Inline graphic Inline graphic and Inline graphic is isomorphic to the image of Inline graphic by multiplication of the Inline graphic matrix Inline graphic. Since A is non-degenerate by the Vandermonde determinant, Inline graphic Inline graphic forms a basis of Inline graphic over Inline graphic. Thus Inline graphic is a lattice in Inline graphic.

Lemma 3.3   —

Inline graphic and Inline graphic is dense in Inline graphic.

Proof   —

For simplicity, we prove the totally real case, i.e. Inline graphic for all i. Since the diagonal blocks of ϕ are all the same, it is enough to show that Inline graphic is dense in Inline graphic. By Theorem 24 (Siegel, 1989), Inline graphic is dense in Inline graphic if

graphic file with name a-76-00600-efd60.jpg

implies Inline graphic for Inline graphic. The condition is equivalent to Inline graphic with Inline graphic in the terminology of Lemma 3.2. Multiplying by the inverse of A, we see that the entries of ξ must be Galois conjugates. As ξ has at least one zero entry, we obtain Inline graphic which shows Inline graphic for Inline graphic. In fact, this discussion is using the Pontryagin duality that the Inline graphic has a dense image if and only if its dual map Inline graphic is injective [see also Meyer (1972, ch. II, Section 1), Iizuka et al. (2009), Akiyama (1999)]. The case with complex conjugates is similar.

Now that we have constructed the CPS (23), we would like to introduce a special projected set Inline graphic which will appear in the proofs of the main results in Section 5. For Inline graphic, we define

3.1.

In the following lemma, we find an adequate window for a set Inline graphic and note that Inline graphic is a Meyer set.

Lemma 3.4   —

For any Inline graphic and Inline graphic, if Inline graphic, then

graphic file with name a-76-00600-efd62.jpg

and Inline graphic forms a Meyer set.

Proof   —

Note that

graphic file with name a-76-00600-efd63.jpg

Notice that if ϕ is unimodular, then Inline graphic and Inline graphic. Thus

graphic file with name a-76-00600-efd64.jpg
graphic file with name a-76-00600-efd65.jpg

It is easy to see that the set in (28) is contained in the set in (29). The inclusion for the other direction is due to the fact that Inline graphic and Inline graphic. Hence for any Inline graphic,

graphic file with name a-76-00600-efd66.jpg

Since (23) is a CPS and Inline graphic is bounded, Inline graphic forms a Meyer set for each Inline graphic (see Moody, 1997).

<!?tpb=-12pt>

4. Pure discrete spectrum, Meyer set and Pisot family  

Lemma 4.1   —

[Lemma 4.10 (Lee & Solomyak, 2008)] Let Inline graphic be a tiling on Inline graphic. Suppose that Inline graphic has pure discrete dynamical spectrum. Then the eigenvalues for the dynamical system Inline graphic span Inline graphic.

Proposition 4.2   —

[Proposition 6.6 (Lee & Solomyak, 2019)] Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansion map ϕ. Suppose that all the eigenvalues of ϕ are algebraic integers. Assume that the set of eigenvalues of Inline graphic is relatively dense. Then Inline graphic is a Meyer set.

We note that ‘repetitivity’ is not necessary for Proposition 4.2. Under the assumption that Inline graphic is a primitive substitution tiling on Inline graphic, the following implication holds:

4.

Definition 4.3   —

A set of algebraic integers Inline graphic is a Pisot family if for any Inline graphic, every Galois conjugate γ of Inline graphic, with Inline graphic, is contained in Θ. For Inline graphic, with Inline graphic real and Inline graphic, this reduces to Inline graphic being a real Pisot number, and for Inline graphic, with Inline graphic non-real and Inline graphic, to Inline graphic being a complex Pisot number.

Under the assumption of rigidity of Inline graphic, we can derive the following proposition from Lemma 5.1 (Lee & Solomyak, 2012) without additionally assuming repetitivity and FLC.

Proposition 4.4   —

[Lemma 5.1 (Lee & Solomyak, 2012)] Let Inline graphic be a primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ. Suppose that all the eigenvalues of ϕ are algebraic conjugates with the same multiplicity and Inline graphic is rigid. Then if the set of eigenvalues of Inline graphic is relatively dense, then the set of eigenvalues of ϕ forms a Pisot family.

5. Main result  

We consider a primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ. Suppose that all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity J and Inline graphic is rigid. Additionally we assume that there exists at least one algebraic conjugate λ of eigenvalues of ϕ for which Inline graphic. Recall that

5.

where Inline graphic is the set of control points of tiles of type i and Inline graphic. By the choice of the control point set in (10), we note that Inline graphic.

Lemma 5.1   —

Assume that the set of eigenvalues of ϕ is a Pisot family. Then Inline graphic for some Inline graphic, where Inline graphic is given in (26).

Proof   —

Since we are interested in Ξ which is a collection of translation vectors, the choice of control point set Inline graphic does not really matter. So we use the tile map (8) which sends a tile to the same type of tiles in Inline graphic. From Lemma 4.5 (Lee & Solomyak, 2008), for any Inline graphic,

graphic file with name a-76-00600-efd69.jpg

Since ϕ is an expansive map and satisfies the Pisot family condition, the maps Inline graphic and Ψ are defined with all the algebraic conjugates of eigenvalues of ϕ whose absolute values are less than 1. Thus Inline graphic for some Inline graphic. From the definition of Inline graphic in (26), Inline graphic.

Lemma 5.2   —

Assume that Inline graphic has pure discrete spectrum. Then for any Inline graphic, there exists Inline graphic such that Inline graphic.

Proof   —

Note from (24) that for any Inline graphic and Inline graphic, Inline graphic is contained in Ξ. Recall that Inline graphic Inline graphic, where Inline graphic, Inline graphic Inline graphic. So any element Inline graphic is a linear combination of Inline graphic over Inline graphic. Applying (11) many times if necessary, we get that for any Inline graphic, Inline graphic for some Inline graphic.

Proposition 5.3   —

Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansion map ϕ. Under the assumption of the existence of CPS (23), if Inline graphic has pure discrete spectrum, then there exists Inline graphic such that

graphic file with name a-76-00600-efd70.jpg

Proof   —

We first prove that there exists a finite set F such that for all Inline graphic, Inline graphic for some Inline graphic. This can be obtained directly from Lemma 5.5.1 (Strungaru, 2017; Baake & Grimm, 2017), but for the reader’s convenience we give the proof here. Note that Inline graphic is a Meyer set and Inline graphic for some Inline graphic. Since Ξ is relatively dense, for any Inline graphic, there exists Inline graphic such that Inline graphic. From the Meyer property of Inline graphic, the point set configurations

graphic file with name a-76-00600-efd71.jpg

are finite up to translation elements of Inline graphic. We should note that if Inline graphic has FLC but not the Meyer property, the property (32) may not hold. Let

graphic file with name a-76-00600-efd72.jpg

Then

graphic file with name a-76-00600-efd73.jpg

Inline graphic, and F is a finite set. Thus for any Inline graphic,

graphic file with name a-76-00600-efd74.jpg

From Lemma 5.2 and Inline graphic, for any Inline graphic, there exists Inline graphic such that Inline graphic. By the pure discrete spectrum of Inline graphic and (11), there exists Inline graphic such that

graphic file with name a-76-00600-efd75.jpg

Applying the containment (34) finitely many times, we obtain that there exists Inline graphic such that Inline graphic. Hence together with (33), there exists Inline graphic such that

graphic file with name a-76-00600-efd76.jpg

<!?tpb=-12pt>

In order to discuss model sets and compute the boundary measures of their windows for substitution tilings, we need to introduce Inline graphic-set substitutions for substitution Delone sets which represent the substitution tilings.

Definition 5.4   —

For a substitution Delone κ-set Inline graphic Inline graphic satisfying (2), define a matrix Inline graphic whose entries are finite (possibly empty) families of linear affine transformations on Inline graphic given by Inline graphic . We define Inline graphic for Inline graphic. For a κ-set Inline graphic let

graphic file with name a-76-00600-efd77.jpg

Thus Inline graphic Inline graphic by definition. We say that Φ is a κ-set substitution. Let

graphic file with name a-76-00600-efd78.jpg

be a substitution matrix corresponding to Φ. This is analogous to the substitution matrix for a tile-substitution.

Recall that there exists a finite generating set Inline graphic such that

5.

from Lagarias & Wang (2003), Lee et al. (2003). If the finite generating set Inline graphic consists of a single element, we say that Inline graphic is generated from one point. Since Inline graphic is dense in Inline graphic by Lemma 3.3, we have a unique extension of Φ to a κ-set substitution on Inline graphic in the obvious way; if Inline graphic for which Inline graphic, Inline graphic, we define Inline graphic, Inline graphic, D is given in (22), and Inline graphic. Since Inline graphic is dense in Inline graphic, we can extend the mapping Inline graphic to Inline graphic. If there is no confusion, we will use the same notation Inline graphic for the extended map.

Note that, by the Pisot family condition on ϕ, there exists some Inline graphic such that Inline graphic for any Inline graphic. This formula defines a mapping on Inline graphic and Inline graphic is a contraction on Inline graphic. Thus a κ-set substitution Φ determines a multi-component iterated function system Inline graphic on Inline graphic. Let Inline graphic be a substitution matrix corresponding to Inline graphic. Defining the compact subsets

5.

and using (36) and the continuity of the mappings, we have

5.

This shows that Inline graphic are the unique attractor of Inline graphic.

Remark 5.5   —

From Proposition 4.4 (Lee, 2007), if Inline graphic has pure discrete spectrum, then there exists Inline graphic such that the control point set Inline graphic of the tiling Inline graphic satisfies

graphic file with name a-76-00600-efd82.jpg

for some Inline graphic, Inline graphic and Inline graphic. Note that Inline graphic. Let Inline graphic. We can consider a rth-level supertiling Inline graphic of Inline graphic. Note that there exists an rth-level supertile Inline graphic in Inline graphic containing the origin in the support which contains the tile Inline graphic. Redefining the tile map for the control points of this supertiling so that the control point of the rth-level supertile Inline graphic is at the origin, we can build a substitution tiling Inline graphic for which algebraic coincidence occurs at the origin. So rewriting the substitution if necessary, we can assume that Inline graphic. With this assumption, we get the following proposition.

Proposition 5.6   —

Let Inline graphic be a primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ which is uni­modular. Suppose that all the eigenvalues of ϕ are algebraic conjugates with the same multiplicity and Inline graphic is rigid. Suppose that

graphic file with name a-76-00600-efd83.jpg

for some Inline graphic, Inline graphic and Inline graphic. Assume that CPS (23) exists. Then each point set

graphic file with name a-76-00600-efd84.jpg

is a Euclidean model set in CPS (23) with a window Inline graphic in Inline graphic which is open and pre-compact.

Proof   —

For each Inline graphic and Inline graphic, there exists Inline graphic such that

graphic file with name a-76-00600-efd85.jpg

From Inline graphic,

graphic file with name a-76-00600-efd86.jpg

By Theorem 2.6 and Proposition 5.3, there exists Inline graphic such that Inline graphic. Thus

graphic file with name a-76-00600-efd87.jpg

where Inline graphic depends on z. From the equality of (30), we let

graphic file with name a-76-00600-efd88.jpg

Then

graphic file with name a-76-00600-efd89.jpg

for any Inline graphic.

From Lemma 5.1, Inline graphic for some Inline graphic. Thus Inline graphic Inline graphic. Since Inline graphic is compact, Inline graphic is compact. Thus Inline graphic is compact.

We can assume that the open window Inline graphic in (39) is the maximal element satisfying (39) for the purpose of proving the following proposition. In this proposition, we show that the control point set Inline graphic is a regular model set using Keesling’s argument (Keesling, 1999).

Proposition 5.7   —

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ which is unimodular. Suppose that all the eigenvalues of ϕ are algebraic conjugates with the same multiplicity and Inline graphic is rigid. Under the assumption of the existence of CPS (23), if

graphic file with name a-76-00600-efd90.jpg

where Inline graphic, Inline graphic and Inline graphic, then each Euclidean model set Inline graphic, Inline graphic has a window with boundary measure zero in the Euclidean internal space Inline graphic of CPS (23).

Proof   —

Let us define Inline graphic, where Inline graphic is the maximal open set in Inline graphic satisfying (39). From the assumption of (40), we first note that ϕ fulfils the Pisot family condition from Theorem 2.6 and Proposition 4.4. For every measurable set Inline graphic and for any Inline graphic with Inline graphic,

graphic file with name a-76-00600-efd91.jpg

where μ is a Haar measure in Inline graphic and D is the contraction as given in (22). Note that Inline graphic. In particular,

graphic file with name a-76-00600-efd92.jpg

We have attractors Inline graphic’s satisfying

graphic file with name a-76-00600-efd93.jpg

Let us denote Inline graphic for Inline graphic and Inline graphic = Inline graphic. Then for any Inline graphic,

graphic file with name a-76-00600-efd94.jpg

Note here that for any Inline graphic, Inline graphic follows from the fact that Inline graphic has a non-empty interior. Thus

graphic file with name a-76-00600-efd95.jpg

Note from Lagarias & Wang (2003) that the Perron eigenvalue of Inline graphic is Inline graphic. From the unimodular condition of ϕ,

graphic file with name a-76-00600-efd96.jpg

Since Inline graphic is primitive, from Lemma 1 (Lee & Moody, 2001)

graphic file with name a-76-00600-efd97.jpg

By the positivity of Inline graphic and Inline graphic, Inline graphic = Inline graphic.

Recall that for any Inline graphic,

graphic file with name a-76-00600-efd98.jpg

From (3), for any Inline graphic,

graphic file with name a-76-00600-efd99.jpg

and

graphic file with name a-76-00600-efd100.jpg

Note that Inline graphic and Inline graphic is a non-empty open set. As Inline graphic, Inline graphic is dense in Inline graphic. Since Inline graphic is a Euclidean space, we can find a non-empty open set Inline graphic such that Inline graphic. So there exist Inline graphic and Inline graphic such that Inline graphic. Since Inline graphic,

graphic file with name a-76-00600-efd101.jpg

Thus there exists Inline graphic such that

graphic file with name a-76-00600-efd102.jpg

Hence

graphic file with name a-76-00600-efd103.jpg
graphic file with name a-76-00600-efd104.jpg

The inclusion (43) is followed by the maximal choice of an open set Inline graphic. Let

graphic file with name a-76-00600-efd105.jpg

Then

graphic file with name a-76-00600-efd106.jpg

From (42), we observe that not all functions in Inline graphic are used for the inclusion (44). Thus there exists a matrix Inline graphic for which

graphic file with name a-76-00600-efd107.jpg

where Inline graphic and Inline graphic. If Inline graphic, again from Lemma 1 (Lee & Moody, 2001), Inline graphic. This is a contradiction to (42). Therefore Inline graphic for any Inline graphic.

The regularity property of model sets can be shared for all the elements in Inline graphic. One can find the earliest result of this property in the work of Schlottmann (2000) and the further development in the work of Baake et al. (2007), Keller & Richard (2019) and Lee & Moody (2006). We state the property [Proposition 4.4 (Lee & Moody, 2006)] here.

Proposition 5.8   —

(Schlottmann, 2000; Baake et al., 2007; Keller & Richard, 2019; Lee & Moody, 2006) Let Inline graphic be a Delone κ-set in Inline graphic for which Inline graphic where Inline graphic is compact and Inline graphic for Inline graphic with respect to some CPS. Then for any Inline graphic Inline graphic, there exists Inline graphic so that

graphic file with name a-76-00600-efd108.jpg

From the assumption of pure discrete spectrum and Remark 5.5, we can observe that the condition (40) is fulfilled in the following theorem.

Theorem 5.9   —

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ which is unimodular. Suppose that all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity. If Inline graphic has pure discrete spectrum, then each control point set Inline graphic, Inline graphic, is a regular Euclidean model set in CPS (23).

Proof   —

Under the assumption of pure discrete spectrum, we know that Inline graphic has FLC from the work of Lee & Solomyak (2019) and ϕ fulfils the Pisot family condition (Lee & Solomyak, 2012). From Theorem 3.1, we know that Inline graphic is rigid. Since ϕ is unimodular, there exists at least one algebraic conjugate λ of eigenvalues of ϕ for which Inline graphic. Thus we can construct the CPS (23) with a Euclidean internal space. Since Inline graphic has pure discrete spectrum and is repetitive, we can find a substitution tiling Inline graphic in Inline graphic such that

graphic file with name a-76-00600-efd109.jpg

where Inline graphic, Inline graphic and Inline graphic. The claim follows from Propositions 5.3, 5.7 and 5.8.

Corollary 5.10   —

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ which is unimodular. Suppose that all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity. Then Inline graphic has pure discrete spectrum if and only if each control point set Inline graphic, Inline graphic, is a regular Euclidean model set in CPS (23).

Proof   —

It is known that any regular model sets have pure discrete spectrum in quite a general setting (Schlottmann, 2000). Together with Theorem 5.9, we obtain the equivalence between pure discrete spectrum and regular model set in substitution tilings.

The next example shows that the unimodularity of ϕ is necessary.

Example 5.11   —

Let us consider an example of non-unimodular substitution tiling which is studied by Baake et al. (1998). This example is proven to be a regular model set in the setting of a CPS constructed by Baake et al. (1998) with the help of 2-adic embedding. In our setting of CPS (23), we show that this example cannot provide a model set, since we are only interested in the Euclidean window in this paper.

The substitution matrix of the primitive two-letter substitution

graphic file with name a-76-00600-efd110.jpg

has the Perron–Frobenius eigenvalue Inline graphic which is a Pisot number but non-unimodular. We can extend the letter a to the right-hand side by the substitution and the letter b to the left-hand side. So we can get a bi-infinite sequence fixed under the substitution. A geometric substitution tiling arising from this substitution can be obtained by replacing symbols a and b in this sequence by the intervals of length Inline graphic and Inline graphic. Then we have the following tile-substitution ω,

graphic file with name a-76-00600-efd111.jpg
graphic file with name a-76-00600-efd112.jpg

where Inline graphic and Inline graphic. Considering return words Inline graphic for a, and Inline graphic for b, we can check Inline graphic. We choose left end points Inline graphic of corresponding intervals as the set of control points. Then they satisfy

graphic file with name a-76-00600-efd113.jpg
graphic file with name a-76-00600-efd114.jpg

by Lagarias–Wang duality (Lagarias & Wang, 2003). Applying the Galois conjugate κ which sends Inline graphic, we obtain a generalized iterated function system

graphic file with name a-76-00600-efd115.jpg
graphic file with name a-76-00600-efd116.jpg

with Inline graphic, Inline graphic and Inline graphic. We can easily confirm that

graphic file with name a-76-00600-efd117.jpg

are the unique attractors of this iterated function system. Since Inline graphic contains an inner point, it is unable to distinguish them by any window in this setting.

6. Further study  

We have mainly considered unimodular substitution tilings in this paper. Example 5.11 shows a case of non-unimodular substitution tiling which is studied by Baake et al. (1998). It cannot be a Euclidean model set in the cut-and-project scheme (23) that we present in this paper, but it is proven to be a regular model set in the setting of a cut-and-project scheme constructed in the work of Baake et al. (1998), which suggests non-unimodular tilings require non-Archimedean embeddings to construct internal spaces. It is an intriguing open question to construct a concrete cut-and-project scheme in this case.

Acknowledgments

We would like to thank to F. Gähler, U. Grimm, M. Baake and N. Strungaru for the valuable and important comments and discussions at MATRIX in Melbourne. The third author also thanks A. Quas at ESI in Austria for his interest in this work. We are grateful to MATRIX and ESI for their hospitality. We are indebted to the two referees for their important comments which further improved the paper. J.-Y. Lee is grateful to KIAS where part of this work was done.

Funding Statement

This work was funded by National Research Foundation of Korea grant 2019R1I1A3A01060365 to Jeong-Yup Lee. Japan Society for the Promotion of Science grants 17K05159, 17H02849, and BBD30028. Seoul Women‘s University grant 2020-0205 to Dong-il Lee.

Footnotes

1

This fact is stated in a slightly different way in the work of Lee & Solomyak (2012).

References

  1. Akiyama, S. (1999). Dev. Math. 2, 7–17.
  2. Akiyama, S., Barge, M., Berth, V., Lee, J.-Y. & Siegel, A. (2015). Mathematics of Aperiodic Order Progress in Mathematics, Vol. 309, pp. 33–72. Basel: Birkhauser/Springer.
  3. Akiyama, S. & Lee, J.-Y. (2011). Adv. Math. 226, 2855–2883.
  4. Baake, M. & Grimm, U. (2013). Aperiodic Order, Vol. 1. Cambridge University Press.
  5. Baake, M. & Grimm, U. (2017). Aperiodic Order, Vol. 2. Cambridge University Press.
  6. Baake, M. & Lenz, D. (2004). Ergod. Th. Dyn. Sys. 24, 1867–1893.
  7. Baake, M., Lenz, D. & Moody, R. V. (2007). Ergod. Th. Dyn. Sys. 27, 341–382.
  8. Baake, M. & Moody, R. V. (2004). J. Reine Angew. Math. 573, 61–94.
  9. Baake, M., Moody, R. V. & Schlottmann, M. (1998). J. Phys. A Math. Gen. 31, 5755–5765.
  10. Barge, M. & Kwapisz, J. (2006). Am. J. Math. 128, 1219–1282.
  11. Frank, N. P. & Robinson, E. A. (2008). Trans. Am. Math. Soc. 360, 1163–1178.
  12. Iizuka, S., Akama, Y. & Akazawa, Y. (2009). Interdiscip. Inf. Sci. 15, 99–113.
  13. Keesling, J. (1999). Topology Appl. 94, 195–205.
  14. Keller, G. & Richard, C. (2019). Ergod. Th. Dyn. Sys. 38, 1048–1085.
  15. Kenyon, R. & Solomyak, B. (2010). Discrete Comput. Geom. 43, 577–593.
  16. Lagarias, J. C. & Wang, W. (1996). Adv. Math. 121, 21–49.
  17. Lagarias, J. C. & Wang, W. (2003). Discrete Comput. Geom. 29, 175–209.
  18. Lee, J.-Y. (2007). J. Geom. Phys. 57, 2263–2285.
  19. Lee, J.-Y., Akiyama, S. & Nagai, Y. (2018). Symmetry, 10, 511.
  20. Lee, J.-Y. & Moody, R. V. (2001). Discrete Comput. Geom. 25, 173–201.
  21. Lee, J.-Y. & Moody, R. V. (2006). Ann. Henri Poincaré, 7, 125–143.
  22. Lee, J.-Y., Moody, R. V. & Solomyak, B. (2003). Discrete Comput. Geom. 29, 525–560.
  23. Lee, J.-Y. & Solomyak, B. (2008). Discrete Comput. Geom. 39, 319–338.
  24. Lee, J.-Y. & Solomyak, B. (2012). Discrete Contin. Dyn. Syst. 32, 935–959.
  25. Lee, J.-Y. & Solomyak, B. (2019). Discrete Contin. Dyn. Syst. 39, 3149–3177.
  26. Lenz, D. & Stollmann, P. (2003). Operator Algebras and Mathematical Physics (Constanta, 2001), pp. 267–285. Bucharest: Theta.
  27. Meyer, Y. (1972). Algebraic Numbers and Harmonic Analysis. Amsterdam: North-Holland Publishing Co.
  28. Moody, R. V. (1997). NATO ASI Ser. C, Vol. 489, pp. 403–441. Dordrecht: Kluwer.
  29. Müller, P. & Richard, C. (2013). Can. J. Math. 65, 349–402.
  30. Praggastis, B. (1999). Trans. Am. Math. Soc. 351, 3315–3349.
  31. Radin, C. & Wolff, M. (1992). Geometriae Dedicata, 42, 355–360.
  32. Schlottmann, M. (2000). CRM Monograph Series, Vol. 13, pp. 143–159. Providence, RI: AMS.
  33. Siegel, A. & Thuswaldner, J. M. (2009). Mém. Soc. Math. Fr. (N. S.), 118, 1–140.
  34. Siegel, C. L. (1989). Lectures on the Geometry of Numbers. Berlin: Springer-Verlag.
  35. Sing, B. (2007). PhD thesis. Bielefeld University, Germany.
  36. Solomyak, B. (1997). Ergod. Th. Dyn. Sys. 17, 695–738.
  37. Strungaru, N. (2017). Aperiodic Order, Vol. 2, pp. 271–342. (Encyclopedia of Maths and its Applications, Vol. 166.) Cambridge University Press.
  38. Thurston, W. (1989). Groups, tilings, and finite state automata. AMS Colloquium Lecture Notes. Boulder, USA.

Articles from Acta Crystallographica. Section A, Foundations and Advances are provided here courtesy of International Union of Crystallography

RESOURCES