Model sets with Euclidean internal space

We give an almost dynamical characterization of inter-model sets with Euclidean internal space. This characterization is similar to previous results for general inter-model sets obtained independently by Baake, Lenz and Moody, and Aujogue. The new ingredients are two additional conditions on the rank of the Abelian group generated by the set of internal difference and a flow on a torus defined via the address map introduced by Lagarias that play the role of the maximal equicontinuous factor in the previous characterizations.


Introduction
In the 1970s Meyer introduced some Delone sets in R d , now called Meyer sets, in connection with his work in harmonic analysis. He observed that each Meyer set can be embedded into another type of Delone set called a model set. This last collection is a subclass of Meyer sets defined by a simple geometric construction: they are the projection on the first coordinate of some part of a lattice in R d × H where H, the internal space, is a locally compact abelian group.
After the discovery of quasicrystals by Gratias et al [DSC84], model sets with Euclidean internal space were proposed as a geometric model for the atomic positions in a quasicrystal. Euclidean model sets and their associated dynamical systems played an important role in the mathematical diffraction theory of quasicrystals. Hof in [Hof95] proved that every repetitive regular inter-model set (see the definition in §2) has pure point diffraction, and then Schlottmann in [Sch00] generalized this result to repetitive regular inter-model sets with arbitrary locally compact abelian group as internal space.

M. Allendes Cerda and D. Coronel
Euclidean model sets are also important in the theory of Pisot substitution tilings. A central problem here has been to understand when the space generated by a Pisot substitution is topologically conjugate to the space generated by a Euclidean model set [ABB + 15, BK06,BST10].
In [Sch98], Schlottmann gave a necessary and sufficient condition for a Delone set to be a general non-singular model set in terms of the recurrence structure of the Delone set, and he asked for a characterization of non-singular model sets with well-behaved internal space such as R n . We recall that every non-singular model set is a repetitive inter-model set (see Definition 2.4). A dynamical characterization of repetitive regular inter-model sets was given by Baake, Lenz and Moody in [BLM07], and then Aujogue [Auj16a] extended this characterization to arbitrary repetitive inter-model sets not necessarily regular. Both results apply to general repetitive inter-model sets but left open the question of characterizing repetitive inter-model sets with Euclidean internal space. In this paper, we answer this question by adding an algebraic and a dynamical property to the previous characterizations in [Auj16a,BLM07]. The first condition is given in terms of the rank of the abelian group generated by the set of differences of the Delone set, and the second condition is written in terms of a flow on a torus constructed from the address map introduced by Lagarias in [Lag99]. We call this flow the address system. We recall that every inter-model set is a Meyer set, and all the previous characterizations of inter-model sets are written in the form of what we need to add to a Meyer set in order to have an inter-model set. Our result states that all the information needed for being an inter-model set with Euclidean internal space is encoded in the rank of the group of differences and the dynamical relation between the dynamical system associated to the Meyer set and the address system.
In order to give a more detailed statement of our results we recall some definitions; see §2 for details.
A discrete subset of R d is a Delone set if it is uniformly discrete and relatively dense. It is finitely generated if the abelian group generated by − is finitely generated, and it is repetitive if every pattern in appears with bounded gaps. Given a Delone set , its hull is defined as the collection of all Delone sets whose local patterns agree with those of up to translation. If has finite local complexity, then the hull can be endowed with a topology which is metrizable and compact. The subset of the hull of all Delone sets containing 0 is called the canonical transversal of and we denote it by . The group R d acts on the hull continuously by translation, given a (topological) dynamical system ( , R d ). Some combinatorial properties of the Delone set translate into dynamical properties. For example, repetitivity of is equivalent to minimality of ( , R d ). It is well known in dynamical systems theory that there is a dynamical system with an equicontinuous action of R d that is a factor (semi-conjugacy) of ( , R d ) and it is maximal with to respect these properties. This dynamical system is unique up to topological conjugacy and we call it the maximal equicontinuous factor of ( , R d ).
It is known that repetitivity implies finite local complexity (see, for instance, [BG13]) and that finite local complexity implies finitely generated (see [Lag99] and there is a homomorphism π Ad : → T s such that for every in and every t in Notice that the dynamical system (T s , R d ) and the homomorphism π Ad in Proposition 1.1 depend on the basis B chosen. However, if we change the basis, then the new system is topologically conjugate to the previous one. We call any of these dynamical systems an address system of , and the map π Ad an address homomorphism of , which are well defined up to topological conjugacy. Observe that each coordinate of π Ad in Proposition 1.1 gives a topological factor of ( , R d ) onto the circle T; however, (T s , R d ) is not necessarily a topological factor of ( , R d ). The minimality of ( , R d ) implies that (T s , R d ) is a topological factor of ( , R d ) if and only it is minimal. Indeed, minimality of ( , R d ) implies that (π Ad ( ), R d ) is minimal, and then π Ad ( ) = T s if and only if (T s , R d ) is minimal. Finally, applying a well-known criterion for minimality of linear flows on the torus [ [ABKL15,Lemma 3.11]) and the previous theorem, an address system of a repetitive inter-model set with Euclidean internal space is the maximal equicontinuous factor of ( , R d ).
From Theorem A and [BLM07, Theorem 5] we obtain the following characterization for regular inter-model sets with Euclidean internal space. Observe that if an address system of is minimal then it is also uniquely ergodic, since it is an equicontinuous system. THEOREM B. A repetitive Meyer set in R d is a regular inter-model set with Euclidean internal space if and only rank( − ) > d and there is an address system of that is a topological factor of ( , R d ) such that the set of points in the address system with a unique preimage under the factor map has full measure for the unique ergodic measure.
For the proof of Theorem A, given a Meyer set, we construct a cut and project scheme (CPS) with a Euclidean internal space and a window, which we call the 'Lagarias CPS' and the 'minimal window', respectively. What we actually prove in Theorem A is that if satisfies the necessary condition then it is an inter-model set generated by the Lagarias CPS and the minimal window. Using [BLM07, Theorem 5] again, we can give a more explicit version of Theorem B. THEOREM C. A repetitive Meyer set in R d is a regular inter-model set with Euclidean internal space if and only rank( − ) > d, there is an address system of that is a topological factor of ( , R d ) such that there is one point with a unique preimage under the factor map and the boundary of minimal window of has measure zero.
In order to put our results in context we mention an application to the theory of unimodular Pisot irreducible substitution tilings. For this purpose, given a tiling T of R by intervals, we identify T with the Delone set (T ) in R obtained from the extreme points of the tiles in T . It is well known that the hull of T with the action by translation of R is topologically conjugate to the hull of (T ) with the action by translation of R. When T is a periodic point of a unimodular Pisot irreducible substitution with the length of the tiles given by the coordinates of the eigenvector of the largest eigenvalue, one has that T ( ) is a Meyer set [BK06]. Using that the substitution is Pisot and irreducible, it is not difficult to prove that the length of the tiles forms a basis for the group of differences generated by (T ) and that the address system associated to this basis is a factor of ( (T ) , R). We call this address system the canonical address system of (T ). Moreover, from [BK06, Theorem 1] it is not difficult to deduce that the canonical address system is the maximal equicontinuous factor of ( (T ) , R). One has that the Lagarias CPS (see §4.2.1) constructed from (T ) is exactly the geometric construction that gives rise to the Rauzy fractal modulo a linear change of coordinates, and the Rauzy fractal corresponds to the minimal window in the Lagarias CPS. Since it is known that the Rauzy fractal has zero measure boundary (see, for instance, [BST10]) we get that the minimal window has zero measure boundary. Then, using Theorems A and C, one can give another proof of the following known characterization of pure point unimodular Pisot irreducible substitution tilings as regular model sets with Euclidean internal space, and by the condition that the canonical address system has a point with unique preimage. To prove Theorem 1.1, observe that (i) implies (iii). By Theorem C, we have that (iii) and the fact that the minimal window has zero measure boundary implies (ii). Finally, it is well known that the hull of a regular model set has pure point dynamical spectrum [Hof95].
There are constructions of Euclidean CPSs for Pisot type substitution in higherdimensional Euclidean spaces; see, for instance, [LAN18]. It is a current subject of research to study the relation of those constructions and the Euclidean CPS proposed in this paper.
Finally, we remark that from Proposition 1.1, for every repetitive Meyer set in R d , the dynamical system ( , R d ) has d continuous linearly independent eigenvalues in R d . This was first proved by Kellendonk and Sadun in [KS14] using pattern equivariant cohomological methods. Our proof relies on dynamical methods. Both proofs are basically the same and involve proving that some cocycles are coboundaries. But in our case we use a groupoid version of the classical Gottschalk-Hedlund theorem in dynamical systems, and in [KS14] the authors prove by hand that the cocycles that they define are coboundaries.
1.1. Strategy of the proof of Theorem A. The first step is to define an address system. This is done in Proposition 1.1 where we show that an address map on the canonical transversal minus the linear approximation defines a continuous cocycle on the transverse groupoid. This cocycle is bounded. Then we apply a groupoid version of the Gottschalk-Hedlund theorem [Ren12] to prove that the cocycle is a coboundary. Using this coboundary, we define the homomorphism. For the necessary condition we show that the maximal 6 M. Allendes Cerda and D. Coronel equicontinuous factor of the hull of an inter-model set with Euclidean internal space is topologically conjugate to the address system. To show that the condition is also sufficient is much more complicated. The first step is to prove that for a repetitive Meyer set the construction of an inter-model set given by Lagarias in [Lag99] gives a CPS that we call the Lagarias CPS †; see the definition in §2.4. Then we show that the maximal equicontinuous factor of the hull associated to the Lagarias CPS (for any window) is topologically conjugate to the address system. Then we use [Auj16b, Proposition 3.3] to prove that the closure of the projection in the internal space of the lifting of the Meyer set to the product space is a window for the Lagarias CPS. Finally, elaborating on the ideas in [Auj16a, Theorem 6.1], we show that if there is a point with a unique preimage under the maximal equicontinuous factor map of the hull of the Meyer set then the Meyer set is an inter-model set.

1.2.
Organization. In §2 we give some definitions and results about the theory of aperiodic order related to Delone sets and the dynamical systems associated to the Delone sets. In §3 we prove Proposition 1.1. In §4.1 we prove the necessary condition of Theorem A. In §4.2.1, we describe the Lagarias CPS. The proof of the sufficient condition in Theorem A is in §4.2.2 and uses a result that we prove later in §5, the main technical lemma.

Preliminaries
Let R d be the Euclidean d-space endowed with its Euclidean norm that we denote by · d .

Delone sets. A subset
of R d is called a Delone set if it is uniformly discrete, meaning that there is r > 0 such that every closed ball of radius r intersects in at most one point; and relatively dense, which means that there is R > 0 such that every closed ball of radius R intersects in at least one point.
Let be a Delone set in R d . For every t ∈ R d , we denote by − t the Delone set For every ρ > 0 and every t in R d denote by B(t, ρ) the open ball in R d of radius ρ and center t. A ρ-patch of centered at t ∈ R d is the set ∩ B(t, ρ). We consider two notions of long-range order for Delone sets: the first states that a Delone set has finite local complexity if for every ρ > 0 it has a finite number of ρ-patches up to translation; and the second says that is repetitive if for each ρ > 0 there is a number M > 0 such that each closed ball of radius M contains the center of a translated copy of every possible ρ-patch of . Observe that every repetitive Delone set has finite local complexity; see [BG13, Proposition 5.6].

Meyer sets and address map. Let be a Delone set in
In [Mey72], Meyer proved that every model set is a Meyer set. The following characterization of Meyer set is used in the proofs of Proposition 1.1 and the main theorem.
Remark 2.1. In the proof of [Lag99, Theorem 3.1] it was proved that is some kind of 'ideal address map' in the sense that if {v 1 , . . . , v s } is the basis of that we used to define the address map of then for every t in R d we have (2.2) 2.3. Dynamical systems and transverse groupoid. Let ⊆ R d be a Delone set with finite local complexity. The hull of is the collection of all Delone sets in R d whose ρ-patches, for every ρ > 0, are also ρ-patches of up to translation. We denote this set by . There is a natural metrizable topology on . Roughly speaking, two Delone sets are close in this topology if they agree on a large ball around the origin up to a small translation. In particular, for every in a basis of open neighborhoods for is given by the following sets. First, for every R > 0 put and for every 0 < ε < R/2 we define the open neighborhood N( , ε, R) of by for more details see, for example, [FHK02,KL13,LM06,Sch00]. If has finite local complexity then its hull is compact. Observe that the action by translation of R d on is continuous. Thus, we obtain a topological dynamical system denote by ( , R d ).
is minimal if and only if the only closed invariant sets are the empty set and the whole space. It is well known that minimality is equivalent to the fact every point has a dense orbit, and in the context of Delone sets repetitivity is equivalent to minimality.
We recall that every topological dynamical system admits a maximal equicontinuous factor, that is, a topological factor with an equicontinuous action such that any other equicontinuous factor is a topological factor of it; see, for instance, [BKS12,BK13,Kur03]. For a topological dynamical system (X, G), where X is a compact metric space and G a locally compact abelian group, we denote by (X me , G) its maximal equicontinuous factor. Given two minimal dynamical systems (X, G) and (Y , G), and a factor map π : (X, G) → (Y , G), we say that π : (X, G) → (Y , G) is an almost automorphic extension 8 M. Allendes Cerda and D. Coronel The transversal of the hull is the closed subset In general, the restriction of the action of R d to is not defined. For this reason, to study the dynamical properties of the transversal we introduce the transverse groupoid, This set, endowed with the induced topology from the product space × R d , has the structure of a topological groupoid; see [Ren80] for the abstract definition of topological groupoids. Two elements (x, t) and (z, s) in G are composable if and only if x − t = z, and the composition of (x, t) and (z, s) is defined by In this context, the set is called the unit space of G .
We say that a subset E of the unit space is invariant by the groupoid G if E = r(d −1 (E)). We recall the following definition from [Ren80]. The following result relates the minimality of ( , R d ) to the minimality of the transverse groupoid.
Proof. First, observe that for every subset E of we have We have that E is open in and by (2.3) it is invariant for the R d -action on . Then the complement of E is an invariant non-empty closed set strictly contained in , which contradicts the minimality of ( , R d ).
be an invariant non-empty closed set strictly contained in .
is a lattice, that is, a discrete and cocompact set. When H is a Euclidean space R n , for some positive integer n, we say that (H , , s H ) is an Euclidean CPS.
) is called a model set. More generally, for every subset V of H and every w in H denote by (w + V ) the set We say that an inter-model set is Observe that this is equivalent to the fact that the boundary of w + W does not intersect the projection of G(s H ) in H. Additionally, if the boundary of w + W has zero Haar measure we say the inter-model set is regular.
Remark 2.5. Notice that by Baire's theorem, the fact that ∂W has empty interior and s H ( ) is countable, the set

is a non-singular inter-model set if and only if w ∈ NS.
We say that W is irredundant if the equation W + w = W holds only for w = 0 in H. The following two results are well known in the theory of model sets and will be used in the proof of Theorem A.
Moreover, the map π is injective precisely on the subset of non-singular inter-model sets in MS and the dynamical system (T G , R d ) is the maximal equicontinuous factor of ( MS , R d ).
The proof of Theorem 2.2 is mainly in [Sch00]. The proof that (T G , R d ) is the maximal equicontinuous factor of ( MS , R d ) follows from the fact that (T G , R d ) is an equicontinuous factor and from the existence of points where π is injective; see, for instance, [ABKL15, Lemma 3.11].
2.5. Torus parametrization. Let X be a compact space and let (X, R d ) be a topological dynamical system. Consider a compact abelian group K with a minimal action of R d coming from group multiplication via a group homomorphism from R d into K. A torus parametrization is a factor map π : (X, R d ) → (K, R d ). A section of π is a map s : K → X such that π • s is the identity on K. A point x ∈ X is called singular if the fiber π −1 (π(x)) contains more than one element. Otherwise, x ∈ X is called non-singular. The set of non-singular points of X for π is denoted by R π (X). The following proposition was proved in [BLM07].
PROPOSITION 2.7. [BLM07, Proposition 3] Let π : X → K be a torus parametrization and let s be a section of π . Then s is continuous at all points of π(R π (X)).

The address system
In this section we prove Proposition 1.1. Given a repetitive Meyer set in R d , we start by defining a continuous and bounded cocycle in the transverse groupoid of (see Definition 3.1 below). We use a version of the Gottschalk-Hedlund theorem for groupoids to show that this cocycle is a coboundary. We use this cocycle and the map defining the coboundary to construct an equicontinuous dynamical system and homomorphism from ( , R d ) into this equicontinuous system.  ((z, s)).
We define the maps : G → Z s and L : G → R s as follows: for every (x, t) ∈ G , The aim of this subsection is to show that L − defines a continuous cocycle on G . For this, we first prove that L does not depend on the first coordinate. The proof of the continuity is at the end of the subsection.
PROPOSITION 3.2. There is a linear map : R d → R s such that for all (x, t) ∈ G we have L(x, t) = (t).
The proof of this proposition is given at the end of this subsection after some lemmas.
Using these inequalities and (3.1), we get Dividing both sides of this last inequality by u d , we obtain Taking the limit as u d → +∞, we have This, together with Lemma 3.3, implies that x − x−t op = 0, and thus concludes the proof of the lemma.
Proof of Proposition 3.2. Fix y in . We prove that for every x in we have x = y . By (3.1), (3.2) and Lemma 3.4, for t in y we have Fix x in . By minimality, there is a sequence (t n ) n∈N in R d such that y − t n converges to x in . Fix t ∈ x and consider > 0 such that t ≤ 1/ . There is N ∈ N such that for all n > N we have In particular, for all n > N we get t ∈ y − t n . Then, using Lemma 3.4 and (3.3), for every t in x we have By uniqueness of the map x , we conclude the proof of the proposition.
LEMMA 3.5. The map L − is a continuous cocycle on G .
Proof. By (3.1) and Proposition 3.2, we have that L − is a cocycle. Now we prove the continuity of L − . Consider a sequence {(x n , t n )} n∈N in G that converges to (x, t) in G . By definition of convergence in the groupoid, we have that {x n } n∈N ⊆ converges to x ∈ , and {t n } n∈N converges to t in R d . Let be a positive real number less than the uniformly discrete radius of such that t d < 1/2 . There is a positive integer N such that for all n ≥ N we have By definition of the groupoid G , for all n in N we have that t n ∈ x n , and also t ∈ x. By (3.4), for every n ≥ N we get t n = t. Then, for every n ≥ N, we have which implies the continuity of L − . (1) There exists a continuous function g : X → R d such that

Proof of Proposition
(2) There exists x ∈ X such that c(d −1 (x)) is relatively compact.
(3) c(G) is relatively compact. Let L and be as in §3.1. We check that G and the cocycle L − : G → R s verify the hypotheses of Theorem 3.1. By Proposition 2.3, the groupoid is minimal. By Lemma 3.5, the map L − is a continuous cocycle. Let be the linear map given by Proposition 3.2. By (3.2), for every x ∈ the set is bounded. By Theorem 3.1, there is a continuous map F : (3.5) Since F is continuous and the space is compact there is a constant C > 0 such that the inequality in the first part of Proposition 1.1 holds. Now we check that is injective. By contradiction suppose that the kernel of has dimension greater than 1. Hence, there is an infinite subset of such that the address map is bounded on this infinite set, which gives a contradiction.
Finally, we construct the address system. Denote by T s the torus R s /Z s . Since is linear the following map defines an equicontinuous action of R d on T s :

Now we define π Ad :
→ T s as follows. For every y ∈ there exist x ∈ and t ∈ R d such that y = x − t. Put We verify that π Ad is well defined. Indeed, suppose that for y ∈ there are x 1 , x 2 ∈ and t 1 , t 2 ∈ R d such that y = x 1 − t 1 = x 2 − t 2 . Thus, x 1 = x 2 − (t 2 − t 1 ), and by (3.5) we have that which is equivalent to Together with the fact that ϕ(t 2 − t 1 ) ∈ Z s , this implies that π Ad is well defined. Now we prove the continuity of π Ad . Fix y ∈ and suppose that y = x − t for some x ∈ and t ∈ R d . For every y close to y there is x in close to x and there is t close to t such that y = x − t . By the continuity of F and , the map π Ad defined in a sufficiently small neighborhood of y by π Ad (y ) = F (x ) + (t ) is continuous. By the continuity of the canonical projection of R s onto T s we conclude that π Ad is continuous at y. It remains to check that for every y in and every t in R d we have π Ad (y − t) = π Ad (y) + [ (t)] Z s . Fix y in and fix t in R d . There are x 1 and x 2 in and t 1 and t 2 in R d such that y = x 1 − t 1 and y − t = x 2 − t 2 . Then x 2 = x 1 − (t 1 − t 2 + t). Using this, (3.5) and the fact that ϕ(t 1 − t 2 + t) ∈ Z s , we get that which concludes the proof of the proposition.

Proof of Theorem A
In this section we prove Theorem A. First, we prove a characterization of the maximal equicontinuous factor for a Euclidean CPS, and then we prove the necessary condition.
Having done so, we use the address map to construct a Euclidean CPS that we use in the proof of the sufficient condition. Finally, we prove the sufficient condition assuming the main technical lemma. This lemma is stated in §4.2 and proved in §5.

Necessary condition.
Let be an inter-model set for a Euclidean CPS over R d with internal space R n , lattice L and window W. Denote by MS the hull of the non-singular model sets generated by these data. Repetitivity of and Proposition 2.6 imply that MS = . By [Auj16a, Theorem 8.1], the associated dynamical system ( MS , R d ) is almost automorphic (see also [Sch00,FHK02]). The remaining part of the proof of the necessary condition follows directly from the following proposition.
PROPOSITION 4.1. Let MS be the hull of the non-singular model sets generated by a Euclidean cut and project scheme (R n , , s R n ) over R d and a window W. Then, for every in MS , we have that the group − is equal to and its rank is d + n. Moreover, the maximal equicontinuous factor of ( MS , R d ) is topologically conjugate to an address system of .
Proof. Denote by p 1 and by p 2 the orthogonal projections from R d × R n onto R d and R n , respectively, and put L := G(s R n ). Fix in MS . By [Moo97, Proposition 2.6(ii)], for every w in R n we have that In particular, (w + W ) − (w + W ) = . By Proposition 2.6, there is w in NS such that (w + W ) is in MS , and thus by repetitivity We now prove that the maximal equicontinuous factor of ( MS , R d ) is topologically conjugate to the address system of . Fix a basis B = { v 1 , . . . , v s } of L. Let be the linear map given by the Proposition 1.1 applied to with the basis p 1 (B) for and let (T s , R d ) be the corresponding address system. Denote by ψ : R s → R d × R n the linear isomorphism sending the canonical basis of R s onto { v 1 , . . . , v s }, that is, ψ(u 1 , . . . , u s ) = u 1 v 1 + · · · + u s v s . By (2.2), for every t ∈ R d we have p 1 (ψ( (t))) = t. (4.1) Define the map : Note that is a homeomorphism. By (4.1), for all t ∈ R d and [w] ∈ T s , we have To prove that conjugates the address system with the maximal equicontinuous factor (R d × R n /L, R d ), we need to show that for every t ∈ R d , p 2 (ψ( (t))) = 0. By Remark 2.5, Proposition 2.6 and the fact that the window W has non-empty interior, there is w in NS such that 0 ∈ w + W and the set (w + W ) is in MS . Put 0 := (w + W ). We have that 0 is in . Observe that ϕ is also the address map for 0 associated to the basis p 1 (B). By Proposition 1.1, there is a constant C > 0 such that for every t ∈ 0 we have Together with the fact that p 2 (ψ(ϕ( 0 ))) = p 2 (s R n ( 0 )) ⊆ w + W , this implies that the map p 2 • ψ • is uniformly bounded on 0 . Using that 0 is relatively dense in R d and that p 2 • ψ • is linear, we get that p 2 (ψ( (R d ))) is bounded, which implies that p 2 (ψ( (R d ))) = 0. We conclude that (T s , R d ) and (T G , R d ) are topologically conjugated, finishing the proof of the lemma.  (u 1 , . . . , u s ) = u 1 v 1 + · · · + u s v s . By (2.2), for every t ∈ R d we have In the proof of [Lag99, Theorem 3.1], Lagarias proved that the set B := { v 1 . . . , v s } is Z-linearly independent in R d × R n and generates a full-rank lattice. Denote by L the lattice generated by B. Denote by p 1 and p 2 the orthogonal projections of R d × R n onto R d and R n , respectively. By construction, p 1 is injective on L and its image is − . Denote by ψ : R s → R d × R n the linear isomorphism sending the canonical basis of R s onto { v 1 , . . . , v s }, that is, In the proof of [Lag99, Theorem 3.1], it was proved that for every t in − we have LEMMA 4.2. Let be a repetitive Meyer set in R d . If the address system of associated with B is a topological factor of ( , R d ), then p 2 ( L) is dense in R n .
Therefore the linear map p 2 • ψ • is uniformly bounded on 0 , which is relatively dense. Then, for all t ∈ R d , we have Consider the dynamical system defined on the space (R d × R n )/ L with the following R d -action: for every t ∈ R d and every w ∈ (R d × R n )/ L, Define the map : By (4.6), the map is a topological conjugacy between the address system of and the dynamical system just defined ((R d × R n )/ L, R d ). Let π Ad be the address homomorphism defined in Proposition 1.1. Since we are assuming that π Ad is a factor of ( , R d ), we have that the map • π Ad is also a factor from ( , R d ) to ((R d × R n )/ L, R d ). By the repetitivity of we have that ( , R d ) is minimal, and then the factor ((R d × R n )/ L, R d ) is also minimal. But the set [R d × V ] L is closed and R d -invariant, and by (4.5), it is strictly contained in (R d × R n )/ L, which is a contradiction to the minimality of ((R d × R n )/ L, R d ).

M. Allendes Cerda and D. Coronel
Put s L := p 2 • ψ • ϕ on − . By Lemma 4.2 if the address system of is a topological factor of ( , R d ) the triple (R n , − , s L ) is a CPS and we call it the Lagarias CPS for .
Recall that a window is irredundant if its redundancies group is trivial (see §2.4). By compactness, every window in R n is irredundant. By Theorem 2.1 and (4.4), the set s L ( 0 ) ⊆ R n is a compact. Together with Proposition 5.2 we obtain the following result. Proof of sufficient condition in Theorem A. Let be a repetitive Meyer set in R d and let − be the subgroup of R d generated by − . Assume that rank( − ) = s > d, that some address system of is a topological factor of ( , R d ) and that ( , R d ) is an almost automorphic extension of this address system. Since the address systems are topologically conjugated among them we have that every address system of is a topological factor of ( , R d ) and that ( , R d ) is an almost automorphic extension of every address system of .
Let (R n , − , s L ) be the Lagarias CPS for where n = s − d. Fix * in and recall that by the repetitivity of we have that = * . By Lemma 4.3, the set W = s L ( * ) is an irredundant window. Denote by MS the hull of the generic inter-model sets generated by (R n , − , s L ) and W . By Lemma 4.4, the maximal equicontinuous factor of ( MS , R d ) is topologically conjugated to every address system of which agrees with the address systems of * by Proposition 1.1. By hypothesis, the dynamical system ( * , R d ) is an almost automorphic extension of every address system of * , and then it is also an almost automorphic extension of ( MS,me , R d ). By the main technical lemma applied to * and (R n , − , s L ), there are 0 ∈ * and 1 ∈ MS such that 0 = 1 . By the minimality of ( * , R d ) we have that * is equal to the hull of 0 which is equal to the hull of the generic model sets generated by a Euclidean CPS. Since = * by Proposition 2.6 we conclude that is an inter-model set generated by a CPS with Euclidean internal space, finishing the proof of the sufficient condition.

Proof of main technical lemma
In this section we prove the main technical lemma used in the proof of Theorem A. Indeed, we prove a more detailed version of the main technical lemma for future reference. Put 0 := π −1 (π 0 (R π 0 ( MS ))). There is a continuous map such that for every 0 ∈ 0 we have π 1 ( 0 − t) = π 1 ( 0 ) − t and π( 0 ) = π 0 • π 1 ( 0 ).
The proof of the lemma will be given in §5.2 after recalling the definition of the optimal CPS of a Meyer set introduced in [Auj16a].
5.1. The optimal CPS and the optimal window. Let be a repetitive Meyer set in R d and let be the subgroup of R d generated by . Define as the collection of all ∈ having support in :

M. Allendes Cerda and D. Coronel
Observe that ⊆ . We consider the combinatorial topology on , which is obtained from the distance dist( , The combinatorial topology is always strictly finer than the usual topology on , and on the transversal both topologies coincide. We endow with the combinatorial topology. We say that and in are strongly regionally proximal, denoted ∼ srp , if for each R > 0 there are 1 , 2 ∈ and t ∈ R d such that Since is a repetitive Meyer set we have that the strongly regionally proximal relation is a closed R d -invariant equivalent relation on , and moreover, it agrees with the equicontinuous relation; see [BK13]. In particular, the quotient / ∼ srp gives the maximal equicontinuous factor. In the following proposition we recall some results in [Auj16a] which allow us to introduce the optimal CPS and optimal window for a Meyer set. More precisely, part (1)  In the following result we recall the definition of a map that we use to construct the maps π 1 and π in the statement of the main technical lemma .
Define the map We have that ω is uniformly continuous for the combinatorial topology, and for all ∈ and γ ∈ we have: We verify that π is well defined. Assume that there is s in R d such that − s is in . Observe that t − s is in . By part (1) in Lemma 5.3, we have that Since (t − s, s H (t − s)) belongs to G(s H ), we have that and hence π is well defined.
We now check that π commutes with the R d action on and on MS,me . Let be in and t be in R. There are s and s in R d such that − s and ( − t) − s = − (t + s ) are in . Notice that t + s − s belongs to . Again, by part (1) in Lemma 5.3 we have .
Now we prove that π is continuous. Let be MS and let U be a neighborhood of 0 in MS,me . We can assume that U = [B(0, r 0 ) × U H ] where r 0 > 0 and U H is a neighborhood of 0 in H . There exists t ∈ such that − t ∈ ⊆ . For r > 0, denote and observe that for r > r we have C r ⊆ C r . By Lemma 5.3, r>0 C r = {ω( − t )}.
(5.2) Now we prove that there is r > 0 such that for every r ≥ r , By contradiction, suppose that there is an increasing sequence (r i ) i∈N of positive real numbers converging to infinity as i goes to infinity, such that (C r i − ω( − t )) ∩ U c H = ∅. Then, for every i ∈ N, there is since for every i, j in N with j ≥ i we have C r j ⊆ C r i . By compactness of C r 1 there is an accumulation pointx of (x i ) i∈N in U c H , and thusx = 0. Butx also belongs to r>0 C r − ω( − t ) which is {0} by (5.2), giving the desired contradiction.
Put R := t d + r + r 0 and consider the set Put t := t − t. We have t − t d < r 0 and since − t is in we also have that − t is in ⊆ . Then showing the continuity of π at in MS . Finally, since the R d -action on MS,me is minimal we have that π is surjective, which concludes the proof that π is a factor map.
By the continuity of π and Proposition 2.7, the map π 1 is also continuous. Since s is a section of π 0 , for every in 0 we have π( ) = π 0 • π 1 ( ). (5.4) Since s commutes with the action of R d on the set π 0 (R( MS )), we get that for every in 0 and t in R d , π 1 ( − t) = π 1 ( ) − t.