On the specification property and synchronisation of unique q-expansions
Rafael Alcaraz Barrera
Instituto de Física, Universidad Autónoma de San Luis Potosí. Av. Manuel Nava 6, Zona Universitaria, C.P. 78290. San Luis Potosí, S.L.P. México
[email protected]
Abstract.
Given a positive integer M and q∈(1,M+1] we consider expansions in base q for real numbers x∈[0,M/q−1] over the alphabet {0,…,M}. In particular, we study some dynamical properties of the natural occurring subshift (Vq,σ) related to unique expansions in such base q. We characterise the set of q∈V⊂(1,M+1] such that (Vq,σ) has the specification property and the set of q∈V such that (Vq,σ) is a synchronised subshift. Such properties are studied by analysing the combinatorial and dynamical properties of the quasi-greedy expansion of q. We also calculate the size of such classes as subsets of V giving similar results to those shown by Blanchard [11] and Schmeling in [36] in the context of β-transformations.
Key words and phrases:
Expansions in non integer bases, specification property, synchronised systems, Hausdorff dimension
2010 Mathematics Subject Classification:
Primary 37B10, 11A63; Secondary 37B40, 68R15.
Research of R. Alcaraz Barrera was sponsored by CONACYT-FORDECYT 265667
1. Introduction
Since their introduction in Rényi’s [35] and Parry’s [34] seminal papers, the theory of expansions in non-integer bases, colloquially known as β-expansions or q-expansions, has received much attention by researchers in many areas of mathematics, most notably ergodic theory, fractal geometry, number theory and symbolic dynamics.
Let us remind the reader the setting of q-expansions. Let M∈N and set
[TABLE]
equipped with the product topology. Given q∈(1,M+1] for every x∈Iq,M=[0,M/(q−1)] there is a sequence x=x1x2…∈ΣM satisfying
[TABLE]
The sequence x is called an expansion of x in base q (or simply a q-expansion of x).
The greedy q-shift (most commonly known as β-shift), emerges from the set of expansions generated by the greedy algorithm for x∈[0,1]. The greedy q-shift is the subshift (Σq,σ) given by
[TABLE]
where α(q) stands for the quasi-greedy expansion of 1 in base q, that is, the lexicographically largest infinite q-expansion of 1. The properties of (Σq,σ) have been studied extensively. For example, it is widely known that the topological entropy of (Σq,σ) is log(q). The following theorem summarises the results regarding the symbolic dynamics and the size of certain classes of q-shifts —see [10], [19], [36] and [38].
Theorem 1.1**.**
Let q∈(1,M+1] and (Σq,σ) be the corresponding greedy q-shift. Then:
- i)
(Σq,σ)* is topologically mixing for every q∈(1,M+1].*
2. ii)
(Σq,σ)* is a subshift of finite type if and only if α(q) is periodic. Moreover,*
[TABLE]
is a countable and dense subset of (1,M+1].
3. iii)
(Σq,σ)* is a sofic subshift if and only if α(q) is eventually periodic. Moreover,*
[TABLE]
is a countable subset.
4. iv)
(Σq,σ)* has the specification property (see Definition 2.1 iii)) if and only if α(q) does not contain arbitrarily long strings of consecutive [math]’s. Moreover*
[TABLE]
is an uncountable subset of Lebesgue measure zero and dimH(C3)=1.
5. v)
(Σq,σ)* is synchronised (see Definition 2.1 iv)) if and only if the orbit of α(q) is not dense in Σq. Moreover*
[TABLE]
is a meagre set in (1,M+1].
6. vi)
The set
[TABLE]
is a residual set.
Perhaps the most noticeable feature of expansions in non-integer bases is the fact that they are not always unique. In fact, for any k∈N∪{ℵ0}∪{2ℵ0} and any M∈N, there is q∈(1,M+1] and x∈IM,q such that x has precisely k different q-expansions—see [16, 39]. Sidorov in [37] describes the generic behaviour of the set of expansions; that is, for any q∈(1,M+1) and for Lebesgue-almost-every x∈IM,q has a continuum of q-expansions. The situation described above is of course completely different to the usual expansions in integer bases where every number has a unique M-expansion except for a countable set of exceptions, the M-adic rationals, that have precisely two.
Another particularly well-studied topic in expansions in non-integer bases is the set of numbers in IM,q with a unique q-expansion. The properties of this set have received lots of attention recently, see for example [2, 4, 8, 14, 22, 23, 29] and references therein. Let us remind the reader of this setting. For q∈(1,M+1] the univoque set on base q is
[TABLE]
We consider
[TABLE]
to be the corresponding set of expansions. The pair (Uq,σ) is not necessarily a subshift [14, Theorem 1.8]. However, the set
[TABLE]
where α(q)=(M−αi(q)), is a closed, forward-σ-invariant and non-empty subset of ΣM for every q∈[qG(M),M+1] where qG(M) is the generalised golden ratio introduced by Baker in [8] (see also [2, Lemma 2.4]). We will refer to (Vq,σ) as the symmetric q-shift. A natural question to ask is when the symmetric q-shift satisfies similar properties to the properties of the greedy q-shift. As we will see along the paper, the behaviours of the subshifts (Σq,σ) and (Vq,σ) are completely different. In this direction, it was shown in [26] (see also [3]) that the entropy function, i.e. H:(1,M+1]→[0,1] given by H(q)=htop(Vq), is a devil staircase. In [2] a full description of the plateaus of the entropy function, as well as a full description of its bifurcation set, was given. Also, in [2, Theorem 1] the set of q’s such that the symmetric q-shift is a transitive subshift was characterised using the symbolic properties of the quasi-greedy expansion of 1 in base q. It is also worth mentioning that in [2] it was shown that the sets
[TABLE]
and
[TABLE]
both have positive Lebesgue measure. Furthermore, for every q∈(qG(M),qT(M)), the subshift (Vq,σ) is not transitive.
We will give a brief explanation of the constants qG(M) and qT(M) in Section 2.
The objective of the paper is to solve some questions similar to the ones posed by Blanchard in [11] in the context of symmetric q-shifts and to develop a similar result to Theorem 1.1 —see [36, p. 693]. For this purpose, inspired by [11] we introduce the following classes of subshifts:
Definition 1.2**.**
Let
[TABLE]
We define the following classes of symmetric q-shifts:
[TABLE]
From [14, Theorem 1.7] it is not difficult to see that for Lebesgue-almost-every q∈(1,M+1], the subshift (Vq,σ) is a subshift of finite type. However, we can ask about the size of the classes C1′,C2′,C3′,C4′ and C5′ and their topological structure as subsets of V. Also, we want to understand what the symbolic properties of α(q) are when q belongs to one of the considered classes.
Using the results obtained by De Vries and Komornik in [14, Theorem 1.7, 1.8] (see also [32, Theorem 1.3]) it is immediate that the class C1′ is countable and dense in V. Moreover, q∈C1′ if and only if α(q) is periodic. As a consequence of [24, Proposition 2.14], Kalle and Steiner characterised the class C2′; namely, q∈C2′ if and only if α(q) is eventually periodic. It is not difficult to check that C2′ is a countable set and that
[TABLE]
The main result of our work is the following.
Theorem A**.**
Let M∈N, q∈[qG(M),M+1] and consider (Vq,σ) the symmetric q-shift. Then:
- i)
(Vq,σ)* has the specification property if and only if α(q) is a strongly irreducible sequence (see Definition 4.1) and there exists K∈N such that d(σk(α(q)),α(q))≥1/2K for every k∈N.*
2. ii)
(Vq,σ)* is synchronised if and only if α(q) is an irreducible sequence and α(q),α(q) are not dense in Vq. Moreover dimH(C4′)=1.*
3. iii)
dimH(C5′)=1.**
The structure of the paper is the following. In Section 2 we recall the relevant concepts of symbolic dynamics and unique q-expansions needed to develop our investigation. In Section 3 we introduce the natural approximation from below of a symmetric subshift (Vq,σ). Using this approximation we prove that every transitive symmetric subshift is mixing and coded. In Section 4 we will characterise the elements of the class C3′. In Section 5 we will study the classes C4′ and C5′. Finally, in Section 6 we will calculate the Hausdorff dimension of the classes C3′, C4′ and C5′.
2. Preliminaries
In this section, we recall some basic tools and definitions used in our study. We will adopt most of the notation used in [2] and [23] and in Subsection 2.3 we summarise the results in those papers relevant for this work.
We refer the reader to [33] for a thorough exposition of symbolic dynamics. A standard reference for the theory of Hausdorff dimension is [18]. Finally, detailed works on unique expansions in non-integer bases are [13, 14, 25, 28].
2.1. Symbolic Dynamics
We recall some basic notions of symbolic dynamics firstly. Fix M∈N. We call the set {0,…,M} an alphabet and its elements are called symbols. A word ω=w1…wn is a finite string of symbols. We denote the length of a word ω by ∣ω∣. Given two words ω=w1…wn and ν=v1…vm their concatenation is the word ων=w1…wnv1…vm. Also, ωk is the word obtained by concatenating ω with itself k times and ω∞ is the infinite concatenation of ω with itself. We denote the *empty word *by ϵ.
We consider
[TABLE]
i.e. ΣM is the set of infinite one-sided sequences whose symbols belong to {0,…,M}. It is a well known fact that ΣM is a compact space with the product topology. Also, the product topology on ΣM is equivalent to the topology induced by the distance given by
[TABLE]
The one-sided shift map σ:ΣM→ΣM is given by σ(x)=σ((xi))=(xi+1). We call the pair (ΣM,σ) a full one-sided shift. We call a sequence x∈ΣM periodic if there exist m∈N such that σm(x)=x. The smallest m satisfying this property is called the period of x and the word x1…xm is called the periodic block of x. A sequence x∈ΣM is said to be eventually periodic if there exist m∈N such that σm(x) is a periodic sequence and σn(x) is not a periodic sequence for every 0≤n≤m−1.
A word ω=w1…wn is called a factor of a sequence x∈ΣM if there exists k∈N such that xk+1…xk+n=w1…wn. If k=1 we say that ω is a prefix of x. Note that the notions of factor and prefix can be defined on finite words in a similar fashion. Then, if a word ω of length n is a factor of a word ν and w1…wn=vm−n+1…vm where ∣ν∣=m we call ω a suffix of ν of length n.
Given a sequence x∈ΣM we define its reflection as x=(xi)=(M−xi). For a word ω we define the reflection of ω similarly. In this case ω=w1…wn=w1…wn. If ω is a word of length n such that wn<M we write
[TABLE]
and if ω is a word of length n with wn>0 we put
[TABLE]
Throughout this work, we use the lexicographic order. Given x,y∈ΣM we say that x≺y if there exist n∈N such that xi=yi for every i≤n−1, and xn<yn. Also, we write x≼y if x=y or x≺y. We can define the lexicographic order between words of the same length in a similar way.
A subshift (X,σ) is a pair where X is a non-empty, closed and forward-σ-invariant subset of ΣM and σ is understood to be σ∣X. From [33, Theorem 6.1.21] we have that for every closed, non-empty and forward-σ-invariant subset X of ΣM there is a set of finite words \pazocalF with symbols in {0,…,M} such that X=X\pazocalF where
[TABLE]
If \pazocalF can be chosen to be finite we say that (X,σ) is a subshift of finite type. We say that a subshift (X,σ) is a sofic subshift if it is a factor of a subshift of finite type, i.e. there exists a subshift of finite type (X′,σ) (not necessarily in the same alphabet) and a semi-conjugacy h:X′→X, i.e. a continuous and surjective map such that h∘σ∣X′=σ∣X∘h. Alternatively, a subshift (X,σ) is sofic if there is a labelled graph \pazocalG=(G,E) which represents (X,σ).
For a subshift (X,σ) and n∈N, the set of admissible words of length n is given by
[TABLE]
For n=0, Bn(X)={ϵ}. We define the language of X by
[TABLE]
Given M∈N and a subshift (X,σ) of ΣM we define the topological entropy of (X,σ) by
[TABLE]
where log=logM+1 and # denotes the cardinality of a set.
Given a subshift (X,σ) and ω∈\pazocalL(X) we define the follower set of ω to be
[TABLE]
and the prefix set of ω to be
[TABLE]
Given m∈N and a word ω∈\pazocalL(X) we denote by FXm(ω)={υ∈FX(ω):∣υ∣=m}.
Definition 2.1**.**
We say a subshift (X,σ):
- i)
is topologically transitive, if for every ordered pair of words υ,ν∈\pazocalL(X) there is a word ω∈\pazocalL(X) such that υων∈\pazocalL(X). This is equivalent to having a point x∈X such that {σn(x)}n=0∞ is a dense subset of X;
2. ii)
is topologically mixing, if for every ordered pair of words υ,ν∈\pazocalL(X) there exists N=N(υ,ν)∈N such that for every n≥N there is a word ω∈Bn(X) such that υων∈\pazocalL(X);
3. iii)
has the specification property, or simply has specification, if there exist S∈N such that for any υ,ν∈\pazocalL(X) there exist ω∈BS(X) such that υων∈\pazocalL(X), i.e. every two words υ and ν can be connected by a word ω of length S;
4. iv)
has the almost specification property, or simply A-specification, if there exist S∈N such that for any υ,ν∈\pazocalL(X) there exists ω∈\pazocalL(X) such that υων∈\pazocalL(X) and ∣ω∣≤S;
5. v)
is a coded system, if
[TABLE]
where n=1⋃∞Xn denotes the topological closure of n=1⋃∞Xn, each (Xn,σ) is a transitive subshift of finite type, and Xn⊂Xn+1 for every n∈N - see[20, Theorem 2.1] and [30].
It is well known that transitive subshifts of finite type and transitive sofic subshifts are coded. Also, observe that every subshift (X,σ) with specification is topologically transitive, and in fact mixing. It is easy to show that the almost specification property coincides with the specification property if (X,σ) is topologically mixing. Finally, we would like to remark that all coded systems are topologically transitive [11].
We now state the specification property in a more convenient way for our purposes. Given a subshift (X,σ) we define
[TABLE]
Then (X,σ) has specification if and only if n→∞limsn<∞. If such limit exists we call it the specification number of (X,σ) and we denote it by sX.
Given a transitive subshift (X,σ) a word ω∈\pazocalL(X) is said to be intrinsically synchronising if whenever υω and ων∈\pazocalL(X) we have υων∈\pazocalL(X). A transitive subshift (X,σ) is synchronised if there exists an intrinsically synchronising word ω∈\pazocalL(X).
Finally, we list the following list of implications stated in [12] for topologically mixing subshifts:
[TABLE]
2.2. Hausdorff Dimension
Let A be a subset of a metric space X. Recall that a collection of subsets of X, \pazocalU={Uλ}λ∈Λ
is an open cover of A if each Uλ∈\pazocalU is an open set and
[TABLE]
If \pazocalU={Ui}i=1∞ is a countable open cover of A and diam(Ui)≤δ for a given δ>0 we say that \pazocalU is a δ-cover of A.
Fix s≥0. For δ>0 we set
[TABLE]
The s-dimensional Hausdorff measure of A is defined to be
[TABLE]
The Hausdorff dimension of A is given by
[TABLE]
We will only consider X=R with the usual topology in this work.
Given a subset A⊂R and x∈A we define, following [40], the local Hausdorff dimension of A at x to be
[TABLE]
The following standard result is useful to compute the Hausdorff dimension of a subset of R.
Lemma 2.2**.**
Let X be a metric space and A⊂X be a compact subset. Then,
[TABLE]
Moreover, if A⊂X satisfies that its topological closure A is compact, then
[TABLE]
if the map x⟼dimHloc(A,x) is continuous on A.
2.3. Expansions in non-integer bases
Let us bring up to mind the properties of q-expansions used in our study.
Fix M∈N and let q∈(1,M+1]. The greedy q-expansion of x∈IM,q=[0,M/q−1] is the lexicographically largest q-expansion of x, and the quasi-greedy q-expansion of x∈IM,q∖{0} is the lexicographically largest q-expansion of x with infinitely many non-zero elements. We denote by β(q)=(βi(q)) the greedy q-expansion of 1, and the quasi-greedy q-expansion of 1 is denoted by α(q)=(αi(q)). It is not hard to check that if β(q) is not a finite sequence, then β(q)=α(q) and if β(q) is a finite sequence then
[TABLE]
where k satisfies that βj(q)=0 for every j>k. We define
[TABLE]
and
[TABLE]
The following result is essentially due to Parry [34]; see also [7, Theorem 2.5], [15, Proposition 2.3].
Lemma 2.3**.**
The map Φ:V→V given by Φ(q)=α(q) is strictly increasing and bijective. Moreover, Φ is continuous from the left and Φ−1 is strictly increasing, bijective and continuous.
Let us remind the reader that for every q∈(1,M+1] the univoque set on base q is given by
[TABLE]
and Uq:=πq−1(\pazocalUq) is the corresponding set of q-expansions. It was shown in [14] that every sequence x∈Uq satisfies the following lexicographic inequalities:
[TABLE]
Also, recall that the set of univoque bases is given by
[TABLE]
The set U has Lebesgue measure zero and full Hausdorff dimension—see [17, 13, 26]. Moreover, the topological closure of U, U, is a Cantor set [15, Theorem 1.2]. The sets U and U were characterised symbolically in [15, Theorem 2.5, Theorem 3.9] as follows:
Lemma 2.4**.**
Let M∈N. Then:
- i)
U={q∈(1,M+1):α(q)≺σn(α(q))≺α(q) for all n≥1}∪{M+1};**
2. ii)
U={q∈(1,M+1]:α(q)≺σn(α(q))≼α(q) for all n≥0}.**
Clearly U⊊U⊊V. The topological and symbolic properties of U, U and V are summarised in the following theorem—see [14, 15].
Theorem 2.5**.**
Let M∈N then:
- i)
U∖U* and V∖U are both countable;*
2. ii)
U∖U* is dense in U. Moreover, if q∈U∖U then α(q) is periodic;*
3. iii)
V∖U* is discrete and dense in V. Moreover, if q∈V∖U then α(q) is periodic.*
4. iv)
If q∈V∖U then α(q) is periodic.
It follows from [15, Lemma 3.5] that the smallest element of V is the generalised golden ratio, denoted by qG=qG(M), and defined as
[TABLE]
Furthermore α(qG)=k∞ if M=2k and α(qG)=((k+1)k)∞ if M=2k+1. Thus, qG∈V∖U. Also, it was shown in [27] that the smallest element of U is the so-called Komornik–Loreti constant, denoted by qKL=qKL(M), which is defined using the classical Thue-Morse sequence (τi)i=0∞; this sequence is defined as follows: τ0=0, and if τi has already been defined for some i≥0, then τ2i=τi and τ2i+1=1−τi. The Komornik-Loreti constant is defined explicitly by
[TABLE]
Notice that the sequence (λi)i=1∞ in (2.4) depends on M. Also, from the definition of (τi)i=0∞ it follows that (λi) satisfies the recursive equations:
[TABLE]
[27]. Therefore, α(qKL) starts with
[TABLE]
Using (2.3), (2.4) and Lemma 2.3 we obtain that qG<qKL<qT. Here qT refers to the transitive base defined in (2.8).
We would like to bring to mind that (Uq,σ) is not always a subshift [14, Theorem 1.8]. However we consider the subshift (Vq,σ), where q∈V and
[TABLE]
Accordingly, we define \pazocalVq=πq(Vq). It is easy to check that ω∈\pazocalL(Vq) if and only if ω=w1…wn satisfies
[TABLE]
Also, it is clear that if ω∈\pazocalL(Vq) then ω∈\pazocalL(Vq).
In [26, Proposition 2.8] Komornik et. al. showed that
[TABLE]
Moreover, in [26, Theorem 1.3] the authors showed that
[TABLE]
Komornik et. al. also studied the entropy function H:[qG,M+1]→[0,1] given by H(q)=htop(Vq) and the Hausdorff dimension function HD:[qG,M+1]→[0,1] given by HD(q)=dimH(Vq). In [26, Lemma 2.11] (see also, [3] [29, Theorem 2.6]) was shown that H is a devil’s staircase and, as a consequence of 2.7, it is shown in [26, Theorem 1.4] that HD is continuous, has bounded variation and has devil’s-staircase-like behaviour.
In [2, Theorem 2, Theorem 3] the entropy plateaus, i.e, the maximal intervals [pL,pR] for which
[TABLE]
as well as the bifurcation set
[TABLE]
and its topological closure
[TABLE]
were characterised. The set
[TABLE]
was also characterised (see [2, Theorem 1]).
The following special classes of sequences in V were introduced in [2] (see also [1]) in order to characterise the entropy plateaus and the sets B,B and T.
Let ζi=α(qG(M))i. For every n∈N we define the sequence
[TABLE]
Definition 2.6**.**
- i)
A sequence α∈V is said to be irreducible if
[TABLE]
whenever (α1…αj−)∞∈V.
2. ii)
A sequence α∈V is said to be ∗-irreducible if there exists n∈N such that ξ(n+1)≼α≺ξ(n), and
[TABLE]
whenever
[TABLE]
We denote by
[TABLE]
and by
[TABLE]
We would like to mention that I and I∗ are subsets of U [2, Lemma 4.7]. It is not difficult to check that α(qG) is irreducible, and hence it is the smallest irreducible sequence. Also, the base qT=qT(M), called the transitive base, was introduced in [2]. The base qT is defined implicitly as
[TABLE]
Notice that α(qT)∈V and therefore qT∈V. Moreover qT∈U and qT>qG. The following Theorem summarises [2, Theorem 1, Theorem 2, Theorem 3].
Theorem 2.7**.**
- i)
Let q∈V. Then (Vq,σ) is a transitive subshift if and only if α(q) is irreducible, or q=qT;
2. ii)
The interval [qL,qR]⊆(qKL,M+1] is an entropy plateau of H if and only if qL∈I∪I∗ and α(qL) is periodic, and
[TABLE]
3. iii)
The topological closure of the bifurcation set B is
[TABLE]
Moreover B is a Cantor set and dimH(B)=1.
The interval [qL,qR] described in ii) is known as the irreducible interval generated by qL whenever qL∈I. We will denote an irreducible interval generated by q∈I with α(q) periodic by I(q), whenever necessary.
In [23, Remark 1.2] Kalle et. al. mentioned that B∖B is a countable set. Moreover, it is clear that if q∈B∖B then q is an end point of an entropy plateau. Finally in [23, Theorem 2] it is shown that
[TABLE]
By [23, Theorem 2] and [26, Theorem 1.4] the following proposition holds.
Proposition 2.8**.**
The functions H and HD are continuous in B. Moreover the map
[TABLE]
is continuous in B.
3. Approximation properties of symmetric q-shifts
In this section we introduce a notion of approximation of symmetric q-shifts that will be useful for the rest of the paper. Using this approximation we show that every transitive symmetric q-shift is coded and mixing.
Definition 3.1**.**
Given q∈U we define natural approximation of q from below as the sequence {qm−}m=1∞⊂V given by q1− defined implicitly by α(q1−)=(α1(q)…αn1(q)−)∞ where
[TABLE]
and if qm−1− is already defined then qm− is defined implicitly by
[TABLE]
where
[TABLE]
We make the following observation on Definition 3.1.
Remark 3.2*.*
Note that Theorem 2.5 iii) implies that for every q∈(V∖U)∖{qG}, α(q) is a periodic sequence. Set m to be the period of α(q). Then, since q∈V∖U there exists m′<m such that σm′(α(q))=α(q). We claim that, for every j>m′ the sequence (α1(q)…αj(q)−)∞∈/V. Suppose on the contrary that there exists j>m′ such that (α1(q)…αj(q)−)∞∈V. Then,
[TABLE]
i.e
[TABLE]
Note that
[TABLE]
Then
[TABLE]
which is a contradiction.
We have shown that if q∈(V∖U)∖{qG} there is N∈N such that for any m≥N there is no nm>nN such that
[TABLE]
Thus, for sake of completeness, if q∈(V∖U)∖{qG} we set the natural approximation from below of q to be the finite sequence {q1−,…qN−,qN+1−} where qN+1−=q. Also, since qG is the smallest element of V we set the natural approximation from below of qG to be {qG}.
In the following propositions we show that indeed, the natural approximation from below approximates a given q∈U.
Proposition 3.3**.**
Let q∈U. Then, the natural approximation from below of q, {qm−}m=1∞, satisfies:
- i)
For every m∈N, qm−<qm+1− and qm−<q.
2. ii)
qm−m→∞↗q.
Proof.
Let us show i). From Lemma 2.3 it suffices to show that
[TABLE]
for every m∈N. From Definition 3.1, we have for every natural number m,
[TABLE]
Note that
[TABLE]
so α(qm−)≺α(qm+1−) and qm−≤qm+1−. The proof for qm−≤q follows from the same argument.
To show ii), let q∈U be fixed. Note that that d(α(q),α(qm−))=1/2nm. Then, for a given ε>0 there is N∈N such that if m≥N, then
[TABLE]
that is α(qm−)⟶α(q) as m→∞. Then, by Lemma 2.3 we have that qm−m→∞↗q.
∎
We introduced the natural approximation from below of elements of U in order to approximate the subshifts (Vq,σ) in the following way: we say that (X,σ) is approximated from below if there exists a sequence of subshifts of finite type {(Xm,σ)}m=1∞ such that Xm⊂Xm+1 for every m∈N and
[TABLE]
Lemma 3.4**.**
If q∈V then the subshift (Vq,σ) is approximated from below by the sequence of subshifts (Vqm−,σ) where {qm−}m=1∞ is the natural approximation from below of q.
Proof.
Firstly, let q∈V∖U. If q=qG then, using Remark 3.2, we have that the natural approximation of below of qG is {qG}. Then, the conclusion of the Lemma follows easily. On the other hand, if q=qG from Remark 3.2 we have that there is N∈N such that the natural approximation from below of q, {qm−}m=1∞ satisfies that qm−=qN+1−=q for all m≥N+1. So, it is straightforward that (Vqm−,σ) approximates from below the subshift (Vq,σ).
Now, consider q∈U and let {qm−}m=1∞ be the natural approximation from below of q. From Proposition 3.3 we have that qm−<qm+1− for every m∈N. Since {qm−}m=1∞⊂V, then Vqm−⊂Vqm+1−. Since qm−<q then Vqm−⊂Vq for every m∈N. This implies that m=1⋃∞Vqm−⊂Vq. Also, recall that Vq is a closed subset of ΣM, then m=1⋃∞Vqm−⊂Vq. On the other hand, consider ω∈\pazocalL(Vq). Since qm−↗q as m⟶∞, there exists n∈N such that ω∈\pazocalL(Vqm−). This implies that there exists x∈Vqm− such that ω is a factor of x. Then k=1⋃∞Vqm− is dense in Vq with respect to the metric d defined in (2.1). Thus,
[TABLE]
∎
From Definition 3.1, if q∈U we have {qm−}m=1∞⊂V. We wish to point out that the approximation from below constructed in Lemma 3.4 is similar to the approximation (WpL,σ) considered in [23] and [26]. One of the advantages of our approach is that it is not necessary to compare finite words and sequences introducing a variation of the lexicographic order. Also, the constructed approximations together with Remark 3.2 allow us to always get strict inclusions when q∈U. That is, since q∈U, {qm−}m=1∞⊂V and qn−<qm− for every n<m we have that Vqn−⊊Vqm− for every n<m.
We now show that given the natural approximation from below of q it is also possible to approximate the language of Vq by the languages of the associated subshifts of each of the elements of the natural approximation from below (compare with [23, Lemma 3.4]).
Lemma 3.5**.**
Let q∈V and consider the natural approximation from below of q, {qm−}m=1∞. Then, for every k∈N there exists J∈N such that if m≥J, then
[TABLE]
Proof.
Firstly, let us assume that q∈V∖U. Then α(q) is a periodic sequence. Let J∈N be the period block of α(q). Then, from Lemma 3.4 there is N∈N such that qm−=qN+1− and α(qm−)=α(q). Thus, for all k≥J we have Bk(Vq)=Bk(Vqm−)=Bk(VqJ−).
Suppose that q∈U. From Proposition 3.3 we have qm−<qm+1−<q, for every m∈N and qm−m→∞↗q. This implies
[TABLE]
Then, for every k∈N and m,J∈N with m≥J we have
[TABLE]
Fix k∈N and let nm be the period of α(qm−). We claim that J=min{m∈N:k<nm} satisfies
[TABLE]
To show this, it suffices to show that Bk(Vq)⊂Bk(VqJ−). Let ω∈Bk(Vq). Then, for every i∈{0,…,k−1}
[TABLE]
Since nK>k then α1(q)…αk(q)=α1(qJ−)…αk(qJ−). This gives
[TABLE]
and the proposition follows.
∎
We show now the following technical, but important results. We will show that if q∈I then there must exist infinitely many irreducible elements in the natural approximation from below {qm−}m=1∞. For this endeavour, we prove the following statement firstly.
Lemma 3.6**.**
Let q∈I. Then, if there is j∈N such that qj−>qT and
[TABLE]
is not irreducible then there exists a unique k<j and a unique 1<nk<nj such that qk−∈I and qj−∈I(qk−).
Proof.
Let q∈I and qj− be such that (α1(qj−)…αnj(qj−))∞=(α1(q)…αnj(q)−)∞ with qj−>qT and qj−∈/I. Then, from [2, Lemma 4.9] there exists a unique irreducible interval I such that qj−∈I. Let q′∈I be such that I=I(q′). Since I(q′) is an irreducible interval then there exists a word w1…wm such that α(q′)=(w1…wm)∞ and α(q) is an irreducible sequence. From [2, Lemma 4.1] we can assume without loss of generality that m is the period of α(q′). From the uniqueness of I we get that w1…wm is unique. Since qj−∈I we have
[TABLE]
Observe that nj=m as if nj=m then (w1…wm)∞ is not irreducible, which is a contradiction. On the other hand, if m>nj then
[TABLE]
This implies that the period of (w1…wm)∞ is smaller than m, which is a contradiction as well. Therefore, m<nj. Since I⊂U,
[TABLE]
This implies that
[TABLE]
Then qk−=q′ and m=nk satisfy the desired properties.
∎
Lemma 3.7**.**
Let q∈I and {qm−}m=1∞ be the natural approximation from below of q. Then, there exist infinitely many m∈N such that qm−∈I.
Proof.
Let q∈I. Let us assume on the contrary that there is N1∈N such that qm−∈/I for every m≥N1.
From Proposition 3.3, qm−↗q as m→∞ and since q∈I from [2, Lemma 4.4] we know that q>qT. Then, there exists a minimal N2∈N such that, qm−∈(qT,M+1) for every m≥N2. Let N=max{N1,N2}. Then, from Lemma 3.6 there is a unique k<N such that qk−∈I and qN−∈I(qk−).
We claim that for every m>N, qm−∈I(qk−). Suppose this is not true. Then, there is m>N such that qm−∈/I(qk−). Also note that Lemma 3.3 implies that qN−<qm−. Then, Lemma 3.6 implies that there is a unique k′<m such that qk′−∈I and qm−∈I(qk′−). Clearly k<k′. From [2, Lemma 4.6] we know that I(qk−)∩I(qk′−)=∅. This implies that N1<k′ which is a contradiction. Therefore, qm−∈I(qk−) for every m≥N which gives that that q∈I(qk−), thus q∈/I. This establishes a contradiction.
∎
We show now that every transitive symmetric q-shift (Vq,σ) is a coded system. We want to emphasise that I⊂B⊂U —see [2, Lemma 4.7, Lemma 6.1].
Proposition 3.8**.**
For every q∈I the subshift (Vq,σ) is coded.
Proof.
Let q∈I. Then, from Theorem 2.7 i) the subshift (Vq,σ) is transitive. Then, if α(q) is periodic then [14, Theorem 1.7, 1.8] implies that (Vq,σ) is coded. Similarly if α(q) is eventually periodic then [24, Proposition 2.14] implies that (Vq,σ) is coded. So, let q∈I such that α(q) is neither periodic nor eventually periodic. Then, from Lemma 3.7 and [2, Lemma 6.1] the natural approximation from below {qm−}m=1∞contains a subsequence {qmj−}j=1∞ such that qmj−∈I, α(qmj−) is periodic for every j∈N and qmj−j→∞↗q. This implies that Vqmj−⊊Vqmj+1−. Then, from Lemma 3.4 it follows that the sequence of subshifts {(Vqmj−,σ)}j=1∞ also approximates (Vq,σ) from below. Moreover, since qmj−∈I for every j∈N we obtain from [2, Theorem 1] that (Vqmj−,σ) is a transitive subshift for every j∈N. Finally, using [14, Theorem 1.7, 1.8] and [32, Theorem 1.3] imply that (Vqmj−,σ) is a subshift of finite type for every j∈N. Thus, (Vq,σ) is coded.
∎
To finish this section, we now show that every symmetric and transitive q-shift is topologically mixing. For this purpose we want to recall the usual Sharkovskiǐ order of N:
[TABLE]
It has been shown in [6, Theorem 1.3] and [22, Theorem 1.1] that periodic points of (Vq,σ) grow with respect to the Sharkowskǐ order of N, that is, if Vq contains a periodic point of period m with respect to σ, then Vq contain points of period n for every n⊲m. On the other hand it is known ([33, Proposition 4.5.10 (4)]) that a subshift of finite type (X,σ) is topologically mixing if and only if it is transitive and the greatest common divisor of the periods of its periodic points is 1; that is, there exists a pair of periodic points x and y∈X such that gcd(m,n)=1, where m and n are the periods of x and y respectively. Using (2.8) it follows that if q∈I then (Vq,σ) contains a periodic orbit of odd period. As a consequence of these results we obtain the following:
Proposition 3.9**.**
If q∈I and α(q) is periodic then (Vq,σ) is a mixing subshift of finite type.
Now we prove that every transitive symmetric q-shift is mixing.
Proposition 3.10**.**
If q∈I then (Vq,σ) is a mixing subshift.
Proof.
From Proposition 3.9 we can assume that α(q) is not periodic. From Lemma 3.7 we have that there is a subsequence {qmj−}j=1∞ of the natural approximation from below of q, {qm−}m=1∞ such that (Vqmj−,σ) is a mixing subshift of finite type for every j∈N. Also, Lemma 3.4 implies that (Vq,σ) is approximated from below by {(Vqmj,σ)}j=1∞. Let υ,ν∈\pazocalL(Vq). From Lemma 3.5 there are J,J′∈N such that (VqJ−,σ) and (VqJ′−,σ) are mixing subshifts of finite type and for every m≥J,
[TABLE]
and for every m≥J,
[TABLE]
Put J′′=max{J,J′}. Since (VqJ′′,σ) is a mixing subshift then there is N∈N such that for every n≥N there is ω∈Bn(VqJ′′) such that υων∈\pazocalL(VqJ′′). Since VqJ′′⊂Vq, the result follows.
∎
4. The specification property of (Vq,σ)
In this section, we characterise the set of q∈V such that (Vq,σ) has the specification property. In order to do this, we introduce the notions of strongly irreducible and weakly irreducible sequences.
Definition 4.1**.**
We say that an irreducible sequence α=α(q)∈V is strongly irreducible if there exists N∈N such that for all m≥N one has qm−∈I. We also say that an irreducible sequence is weakly irreducible if there are infinitely many m∈N such that qm−∈/I.
In a similar fashion we introduce the notion of strongly irreducible number.
Definition 4.2**.**
A number q∈I is called strongly irreducible if α(q) is strongly irreducible, similarly q∈I weakly irreducible if α(q) is weakly irreducible.
We will use the notations
[TABLE]
and
[TABLE]
Clearly
[TABLE]
In this section we will show some properties of the set of strongly and weakly irreducible sequences. Firstly, we mention that there are three different kinds of strongly irreducible sequences.
Definition 4.3**.**
We say that a strongly irreducible sequence α(q) is:
- i)
of Type 1 if for every m∈N, qm−∈I;
2. ii)
of Type 2 if there is N∈N such that qm−∈I for every m≥N and qk−<qT for every k<N ;
3. iii)
of Type 3 if there exists an N∈N and m<N such that qm−∈/I with qm−>qT and qk−∈I for all k≥N.
Let us illustrate Definition 4.3 with some examples.
Example 4.4**.**
Consider M=1, then:
- (1)
Let n≥3. The sequence (1n0)∞ is strongly irreducible of type 1. Note that here q1−=qG(1), so by [2, Lemma 3.1] α(q1−) is an irreducible sequence;
2. (2)
The sequence (11010)∞ is strongly irreducible of type 2. Here N=4 and the corresponding nN=7. The last non-irreducible sequence of the approximation from below is q3− where
[TABLE]
3. (3)
The sequence (1110010010)∞ is strongly irreducible of type 3. Here N=5 and the last non-irreducible sequence of the
approximation from below is q4− where
[TABLE]
Consider M=2, then:
- (1)
Let n≥2. The sequence (2n1)∞ is strongly irreducible of type 1.
2. (2)
The sequence (211211121111)∞ is strongly irreducible of type 2. Here N=4 and the last non-irreducible sequence of the approximation from below is q3− where α(q3−)=(210)∞≼α(qT(2));
3. (3)
The sequence (22010101)∞ is strongly irreducible of type 3. Here N=6 and the last non-irreducible sequence of the approximation from below is q5− where
[TABLE]
We can distinguish strongly irreducible numbers of types 1, 2 and 3 defining q implicitly, as was done in Definition 4.2.
To start our investigation, we want to show the reader why our intuition is that strongly irreducible sequences are, loosely speaking, the “right ones” to look for the specification property; i.e. a symmetric q-shift with the specification property is parametrised by a strongly irreducible sequence and vice versa.
Proposition 4.5**.**
Set
[TABLE]
Then, Per(I)⊂SI.
Proof.
Let q∈Per(I). Suppose that α(q)=(α1(q),…αk(q))∞ has period k. Let {qm−}m=1∞ the natural approximation from below of q and set
[TABLE]
the quasi-greedy expansion of qm− for every m∈N.
Since q∈I then for every m∈N we have
[TABLE]
Also, since q∈Per(I)⊂I then Lemma 3.7 implies that there are infinitely many m∈N such that qm−∈I.
Let
[TABLE]
i.e. N is the first irreducible element of the natural approximation from below such that α(qm−) has larger period than the period of α(q). Observe that Lemma 3.7 implies that N is well-defined.
We claim that for every m≥N, qm−∈I, i.e. α(qm−)=(α1(q)…αnm(q)−)∞ is an irreducible sequence. We will proceed by induction. From the definition of N we have that qN−∈I. Suppose that for every N≤j≤m we have that qj−∈I. We show now that qm+1−∈I. Clearly, nm<nm+1. We show in the following two cases that for every i∈N such that (α1(qm+1−)…αi(qm+1−)−)∞∈V then
[TABLE]
Assume firstly that 1≤i<nm. From the induction hypothesis qm−∈I then using (4.2) we have
[TABLE]
So, (4.3) holds in this case.
Consider now i≥nm. Observe that
[TABLE]
and
[TABLE]
We claim that for every ℓ∈N
[TABLE]
Let us show (4.5). From (4.4) we have
[TABLE]
for every ℓ∈N. Now, clearly (α1(qm+1−)…αi(qm+1−)−)∞≺αqm+1−. Since
[TABLE]
then Lemma 2.3 implies there is a unique p∈V such that
[TABLE]
Moreover Vp⊊Vq. Therefore, for every ℓ∈N
[TABLE]
So (4.5) holds. Then (4.5) implies
[TABLE]
which implies that (4.3) holds in this case.
∎
We now show that transitive sofic symmetric q-shifts are parametrised by strongly irreducible numbers.
Proposition 4.6**.**
Let q∈I. Then, if α(q) is eventually periodic then q∈SI.
Proof.
Let q∈I. Suppose that α(q)=α1(q)…αr(q)(αr+1(q)…αn(q))∞. Set k to be the period of σr(α(q)). Since q∈I then for every j∈N such that (α1(q)…αj(q)−)∞∈V then
[TABLE]
Let {qm−}m=1∞ the natural approximation from below of q. We will define N in a similar way as in Proposition 4.5. Let
[TABLE]
Using Lemma 3.7 we get that N is well defined. The argument to show that for every j>N, qj−∈I is exactly the same as in Proposition 4.5.
∎
4.1. Existence of non periodic strongly irreducible sequences and weakly irreducible sequences.
We now show that, for a fixed M∈N, I contains non-periodic and non-eventually periodic sequences, which can be either strongly or weakly irreducible.
We start our investigation by recalling that in [26, Theorem 1.6] the following class of subsets was constructed. Let M∈N and fix N≥2.
We consider a subset of V that satisfy
[TABLE]
namely
[TABLE]
In [2, Lemma 6.2] it is shown that IN⊂I for every N≥2. Moreover IN⊂U. Then, Lemma 2.4 i) implies that for every q∈IN, α(q) is not periodic. Furthermore, in [2, Lemma 6.4] it is shown that dimH(IN)>0 for every N≥2, so IN is uncountable.
Proposition 4.7**.**
Let M∈N. Then, for every N≥2, IN⊂SI.
Proof.
Let q∈IN. Since q∈I then from Lemma 3.7 we have that
[TABLE]
is well-defined. We claim that for every j≥K the sequence (α1(q)…αnj(q)−)∞ is irreducible. Fix j≥K and let qj− be the corresponding element of the natural approximation from below. Then
[TABLE]
Since N≥2 and α(q) satisfies (4.8) then the word 02N−1 is not a factor of α(qj−).
We split the proof in two cases:
Suppose that i∈N satisfies (α1(qj−)…αni(qj−)−)∞∈V and 1≤ni≤2N. Then
[TABLE]
Since 1≤ni≤2N then
[TABLE]
Suppose that i∈N satisfies that (α1(qj−)…αni(qj−)−)∞∈V and 2N≤ni. Then
[TABLE]
Since 02N−1 is not a factor of α(qj−) we obtain
[TABLE]
and the result follows.
∎
4.2. Construction of strongly irreducible sequences
We describe a construction to obtain non-periodic strongly irreducible sequences. This construction will allow us to find strongly irreducible sequences in I∖N≥2⋃IN.
Recently, Allaart in [5, Definition 2.1] introduced the notion of fundamental word. Given M∈N, a word ω=w1…wn∈\pazocalL(ΣM) with n>2 is said to be a fundamental word if
[TABLE]
It is clear that if α=α1…αm is a fundamental word then (α1…αm)∞∈V [5, p.6510].
Lemma 4.8**.**
Let q∈U. Then, there exists a strictly increasing sequence {mj}j=1∞∈N such that α1(q)…αmj(q) is a fundamental word.
Remark 4.9*.*
We want to make clear that the statement of Lemma 4.8 remains valid for q∈V making the following modifications. From Theorem 2.5 iv) we have that for every q∈V∖U, α(q) is a periodic sequence. If α(q)=s∞ with s∈{k+1,…,M} given that M=2k+1 or s∈{k,…,M} if M=2k, then no factor of α(q) is a fundamental word, however s∞∈U and (α1(q)…αm(q))∞=s∞ for every m∈N. Also, if q∈V∖U with α(q)=s∞ as in the former case then α(q)=(α1(q)…αm(q))∞ with m=1. It is clear that the periodic block α1(q)…αm(q) is a fundamental word. Then, the sequence mj=m⋅j for each j∈N satisfies the consequence of Lemma 4.8.
Proof of Lemma 4.8.
Let q∈U. Then α(q)≺σn(α(q))≺α(q) for every n∈N. Let
[TABLE]
Since q∈U then α(q) is not a periodic sequence, so m1 is well defined. Note that
[TABLE]
since α1(q)…αm1−i(q)=α1(q)m1−i for every i∈{1,…,m1−1}.
Clearly, (α1(q)…αm1(q))∞≻α(q). Let us set (α1(q)…αm1(q))∞=α(q1+) where q1+ is defined implicitly. Then, there exists a minimal integer ℓ>m1 such that
[TABLE]
[TABLE]
and
[TABLE]
So, let m2=ℓ. Observe that
[TABLE]
holds for every 1≤i≤m2−1; this, the definition of m1 and the minimality of m2 give that
[TABLE]
for every 1≤i≤m2−1. Thus, the word α1(q)…αm2(q) is fundamental and
[TABLE]
Let us call α(q2+)=(α1(q)…αm2(q))∞.
Now we proceed by induction. Suppose that n∈N and that m1…mn and q1+…qn+ have been already defined. Then we define mn+1 to be the smallest integer ℓ>mn such that αℓ(q)<α1(q),
[TABLE]
and
[TABLE]
We claim that α1(q)…αmn+1(q) is a fundamental word. From the definition of mn+1 we only need to show that for every 1≤i≤mn+1−1,
[TABLE]
From the induction hypothesis (4.11) is valid for 1≤i<mn−1 and from the minimality of mn+1 we obtain that
(4.11) holds for mn≤i≤mn+1−1.
∎
In comparison with Definition 3.1, in Lemma 4.8 we constructed another “natural” approximation of q∈V. It is possible to show that the sequence {qn+}n=1∞ is strictly decreasing and qn+n→∞↘q. We call this the natural approximation from above of q.
Lemma 4.10**.**
If q∈B then for every j∈N such that α1(q)…αmj(q) is a fundamental word, the sequence (α1(q)…αmj(q))∞ is irreducible or ∗-irreducible.
Proof.
Let q∈B. Let us assume that q≥qT. The proof for q<qT follows from a similar argument. In [23, Lemma 2.6] (see also [2, Theorem 3]) it was shown that B⊊U. Also, from [2, Lemma 4.10] we have that if q∈B satisfies that α(q) is periodic then α(q)∈U∖U. Then, the sequence given in Remark 4.9 satisfies that (α1(q)…αmj(q))∞ is irreducible for every j∈N. So, let us assume that α(q) is not periodic. Fix j∈N such that (α1(q)…αmj(q))∞∈V and set α(qj+)=(α1(q)…αmj(q))∞. We want to show that if i∈N is such that (α1(q)…αi(qj+)−)∞∈V then
[TABLE]
Suppose that there exists i∈N such that
[TABLE]
Without loss of generality we assume that such i is minimal. Then, from [2, Lemma 4.9 (1)] there exists a unique k<i such that (α1(qj+)…αk(qj+)−)∞ is irreducible and
[TABLE]
Then (4.13) and Lemma 4.8 imply that, whenever n≥j, the sequence
[TABLE]
Thus, qn+∈I(qj+) for every n≥j, which is a contradiction to q∈B.
∎
We now construct non-periodic strongly irreducible sequences. Fix q1∈Per(I) with α(q1)=(α1(q1)…αm1(q1))∞. Then q1 parametrises an irreducible interval I(q1). Let p1 be the right end point of I(q1). Then, p1∈B∩U and the quasi-greedy expansion of p1 is given by
[TABLE]
Since p1∈B then from Lemmas 4.8 and 4.10 there are infinitely many m∈N such that α1(p1)…αm(p1) is a fundamental word and (α1(p1)…αm(p1))∞ is an irreducible sequence. Taking m′=m1+1 it is clear that α1(p1)…αm′(p1) is a fundamental word, so there exists at least one m∈{m1+1,…,2⋅m1} where α1(p1)…αm(p1) is a fundamental word.
Let m2∈{m1+1,…,2⋅m1} such that α1(p1)…αm2(p1) is a fundamental word. Let q2 be defined implicitly to be such that
[TABLE]
Thus, q2 generates an irreducible interval I(q2) with right end point p2.
Set m3∈{m2+1…2⋅m2} such that α1(p2)…αm3(p2) is a fundamental word and m3=m2. This generates q3. So, let us assume that q1,…,qn and p1,…,pn has been already defined. Let mn+1∈{mn+1…2⋅mn} such that α1(pn)…αmn+1(pn) is a fundamental word and mn+1=mn, so we define qn+1 implicitly to have quasi-greedy expansion
[TABLE]
Then {qn}n=1∞ is a strictly increasing sequence of elements of I. Moreover, qn<p1+ where p1+ is given by the proof Lemma 4.8 applied to p1. Thus qn converges to a number q∈(q1,p1+). We claim that q is strongly irreducible.
Let α(q) be the quasi-greedy expansion of q. From the above construction, it is clear that q∈B. To show that α(q) is an irreducible sequence, note that whenever i∈N satisfies that (α1(q)…αi(q)−)∞∈V then there exists K∈N such that for every k≥K,
[TABLE]
This implies the irreducibility of α(q). Let us show that α(q) is strongly irreducible. We claim that for every i≥m1+1 such that
[TABLE]
is an irreducible sequence.
Observe that for every n∈N there is no i, mn<i<mn+1, satisfying (α1(q)…αi(q)−)∞∈V.
This holds since αmn+1(q)…αi(q)=α1(qn−1+)…αi−mn−1(qn−1+) for every mn<i<mn+1. So, to show (4.14) we observe that if i=mn where mn is the period of qn for some n≥2 then (α1(q)…αmn(q)−)∞=α(qn) which is an irreducible sequence. So, using m2, we obtain that α(q) is strongly irreducible.
Observe that our construction depends entirely on the choice of mn at each step n. Note that at each step n the number of choices of mn+1 is strictly greater to the number of choices we have at the step mn since the period of α(qn) is strictly smaller than the period of α(qn+1). Moreover, using Lemmas 4.8 and 4.10, it is not difficult to check that for any M∈N one has I∖IN=∅ for every N≥2. We have then proved:
Proposition 4.11**.**
The set SI∖N≥2⋃IN is uncountable.
4.3. Construction of weakly irreducible sequences
Let us now construct a weakly irreducible sequence. The idea behind this construction is similar to the one for strongly irreducible sequences. The difference between both constructions is that for strongly irreducible sequences, in each step n we find an irreducible sequence “relatively far” from each entropy plateau, whereas for the case of weakly irreducible sequences we will strive to be “relatively close” to entropy plateaus at each step.
Fix q1∈I with α(q1)=(α1(q1)…αm1(q1))∞. Then, q1 parametrises an irreducible interval I(q1). Let p1 the right end point of I(q1). Then, p1∈B∩U and the quasi-greedy expansion of p1 is given by
[TABLE]
Fix N1∈N. Then Lemmas 4.8 and 4.10 imply that there exist infinitely many m∈N such that α1(p1)…αm(p1) is a fundamental word and (α1(p1)…αm(p1))∞ is an irreducible sequence. In particular, there must exists at least one m∈{(N1+1)⋅m1,…,(N1+2)⋅m1} where α1(p1)…αm(p1) is a fundamental word. Let m2∈{(N1+1)⋅m1,…,(N1+2)⋅m1} be such that α1(p1)…αm2(p1) is a fundamental word. Let q2 be defined implicitly to be such that
[TABLE]
Notice that for every i=k⋅m1 with 1≤k≤N1.
[TABLE]
Then, the cardinality of the set of integers i such that (α1(q2)…αi(q2)−)∞∈V and (α1(q2)…αi(q2)−)∞ is not irreducible is at least N1.
Note that q1<q2. Now, recall that q2 generates an irreducible interval I(q2) with right end point p2. Fix N2∈N. Then there exists m3∈{(N2+1)⋅m2,…(N2+2)⋅m2} such that α1(p1)…αm3(p3) is a fundamental word. We define q3 implicitly to have quasi-greedy expansion (α1(p1)…αm3(p3))∞. Now, note that for every i=k⋅m2 with 1≤k≤N2
[TABLE]
This implies that
[TABLE]
has cardinality at least N2+N1.
So, let us assume that q1,…,qn, p1,…,pn and N1,…,Nn have been already defined. Fix Nn+1 and let mn+1∈{(Nn+1)⋅mn…(Nn+2)⋅mn} such that α1(pn)…αmn+1(pn) is a fundamental word, so we define qn+1 implicitly to have quasi-greedy expansion
[TABLE]
Then {qn}n=1∞ is a strictly increasing sequence of elements of I. Moreover, qn<p1+ as in Lemma 4.8 applied to p1. Thus qn converges to a number q∈(q1,p1+). Observe that q∈I since for every i∈N with (α1(q)…αi(q)−)∞ there is k∈N such that
[TABLE]
Note that, for each n≥2, qn forces the set
[TABLE]
to have cardinality at least ∑j=1n−1Nj. So q∈WI.
This finishes our construction of weakly irreducible subsequences.
We want to remark once more that our construction now depends entirely on the choice of mn and Nn at each step n. Note that at each step n the number of choices of mn+1 is strictly greater to the number of choices we have at the step mn since the period of α(qn) is strictly smaller than the period of α(qn+1). Moreover, the set of sequences {Nn}n=1∞ with Nn∈N is uncountable. Then, the following proposition holds.
Proposition 4.12**.**
The set WI is uncountable.
From Propositions 3.3 and 4.5, and Lemma 3.7 we obtain the following result.
Proposition 4.13**.**
The set of irreducible sequences I is dense in B∩[qT,M+1]. Moreover, SI is dense in B∩[qT,M+1].
We now show that WI is also a dense subset relative to B∩[qT,M+1].
Proposition 4.14**.**
The set WI is dense in B∩[qT,M+1]
Proof.
Let q∈(B∩[qT,M+1])∖WI with quasi-greedy expansion α(q). Fix ε>0. Then, from Lemma 2.3 there is δ>0 such that if d(α(p),α(q))<δ then ∣p−q∣≤ε. Let n∈N be sufficiently large to satisfy 1/2n≤δ/2. From Proposition 4.13 and Lemma 3.7 there exists q′∈I such that α(q′)=(α1(q′)…αm(q′)) is periodic of period m, irreducible, α(q′)≺α(q) and 0<d(α(q′),α(q))<1/2n. Since α(q) is irreducible and α(q′)≺α(q) we have
[TABLE]
Then, from Lemma 3.7 and Lemma 4.10 there exist N∈N and i∈{1,…,m} such that
[TABLE]
is a fundamental word and
[TABLE]
Let q1 be defined implicitly by
[TABLE]
Then, appliying 4.3 to q1 we obtain a weakly irreducible sequence p such that
[TABLE]
So, d(p,q)<ε. This shows that WI is dense in B∩[qT,M+1].
∎
4.4. Characterisation of the specification property for (Vq,σ)
We proceed now to characterise the set of q∈V such that (Vq,σ) has the specification property. For this endeavour we would like to recall the definition of the specification property: (Vq,σ) has the specification property if there exists S∈N such that for any υ,ν∈\pazocalL(Vq) there
exists ω∈BS(Vq) such that υων∈\pazocalL(Vq). Recall that, given q∈V with q≥qT the sequence sn(Vq) is given by
[TABLE]
Also, (Vq,σ) has the specification property if and only if n→∞limsn<∞.
We now study the properties of sn(Vq). Firstly, let us prove some technical lemmas. Let us recall that {qj−}j=1∞ stands for the natural approximation from below of q and let α(qj−) be as in Definition 3.1. Lemma 3.6 will allow us to show that weakly irreducible sequences do not have specification. To prove that assertion, we find a lower bound for sn, for large values of n.
Lemma 4.15**.**
Let q∈I be such that there is j∈N such that qj−>qT and
[TABLE]
is not irreducible. Let k and nk be given by Lemma 3.6. Then there exists N1∈N such that sn(Vq)>N1⋅nk−1 for every n≥nk.
Proof.
Let q∈I. Since there is j∈N such that qj−>qT and (α1(q)…αnj(q)−)∞ is not irreducible, then there exists N∈N such that
[TABLE]
where k and mk are given by Lemma 3.6. Let N1 be the maximal integer satisfiying (4.18). Note that α(qj) is periodic and qj− parametrises the subshift of finite type (Vqj−,σ) . Moreover Vqj−⊂Vq. This shows that N1 is well defined.
Let n≥nk and consider υ=u1…un, and let ν=v1…vn∈\pazocalL(Vq) be such that
[TABLE]
and
[TABLE]
Since q∈I then (Vq,σ) is a transitive subshift. Then, there exists ω∈\pazocalL(Vq) such that υων∈\pazocalL(Vq). Also, from the choice of υ and ν we have
[TABLE]
Moreover, since (Vqj−,σ) is not a transitive subshift, then ω∈\pazocalL(Vq)∖\pazocalL(Vqj−). Note that the period of α(qj−)=N1⋅nk. From Lemma 3.5 we have that ∣ω∣≥N1⋅nk−1.
∎
Proposition 4.16**.**
If the subshift (Vq,σ) has the specification property then q∈SI.
Proof.
We will show that (Vq,σ) does not have the specification property if q∈/SI. Firstly, note that if q∈V∩((qG,M]∖I), α(q) is not an irreducible sequence. Then, from [2, Theorem 1] (Vq,σ) is not transitive, thus
(Vq,σ) cannot have the specification property.
Recall that if (Vq,σ) is a transitive subshift then q∈I. Moreover, if q∈/SI then q∈WI, that is, there are infinitely many j∈N such that qj− satisfies that α(qj−) is periodic but not irreducible. On the other hand, [2, Proposition 6.1] and Proposition 3.8 imply that there are also infinitely many m∈N such that α(qm−) is periodic and irreducible. This implies that there exist infinitely many j∈N such that qj− and such that α(qj−) is not irreducible and qj−≥qT. Let m1∈N be such that qm1− is irreducible and qm1−1−≥qT and qm1−1− is not irreducible. Let m1 be the period of α(qm1−). Let k1 and nk1 be given by Lemma 3.6. Then, from Lemma 4.15 we have that for every n≥m1, sn(Vq)≥N1⋅nk1 for some N1∈N. Since q is weakly irreducible, then there exists m2>m1+1 such that qm2− is irreducible and qm2−1− is not irreducible. Since {qj−} is an increasing sequence then qT<qm1−1<qm1<qm2−1<qm2. Then again, Lemma 3.6 and Lemma 4.15 imply that there are N2∈N and nk2∈N such that for every n≥m2, sm2(Vq)≥N2⋅nk2−1 for N2∈N. Note that nk2≥nm1≥N1⋅nk1−1. This implies sm2(Vq)>sm1(Vq). Then for every r∈N, it is clear that
[TABLE]
Also, nkr⟶∞ as n→∞. Then n→∞limsn(Vq) is not bounded from above, which shows that (Vq,σ) does not have the specification property.
∎
Showing that strongly irreducible sequences parametrise symmetric subshifts with the specification property is more complicated since it is necessary to find an upper bound for sn. The following technical lemma will allow us to obtain such an upper bound.
Lemma 4.17**.**
Let q∈SI. Then, there exists j∈N such that either ω=α1(q)…αj(q)− or ω=α1(q)…αj(q)+ satisfy ων or ων are in \pazocalL(Vq), for any ν∈\pazocalL(Vq).
Proof.
Let ν=v1…vr∈\pazocalL(Vq). We consider three cases:
Case 1: Suppose that α(q) is strongly irreducible of type 1. Let us assume that α1(q)<v1≤α1(q). Since q>qT one has α1(q)≤α1(q)−<α1(q), hence
[TABLE]
Since ν∈\pazocalL(Vq) then our result holds.
Now, suppose that v1=α1(q). Since q>qT it follows that
[TABLE]
If α1(q)+<α1(q), using symmetry we obtain that
[TABLE]
and since v1…vr∈\pazocalL(Vq) our result follows.
Finally, we assume that α1(q)+=α1(q). Recall that q>qT and that q∈SI⊂I. Thus,
[TABLE]
Therefore,
[TABLE]
As a result, the proposition follows.
Note that j=1.
Case 2: Suppose that α(q) is strongly irreducible of type 2. Then, let
[TABLE]
Since α(q) is of type 2, then α(qT)≺(α1(q)…αk(q)−)∞≺α(qT). This implies that
[TABLE]
We claim that j=1 if M=2k and j=2 if M=2k+1. Let us prove firstly the case when M=2k. Since α(q) is strongly irreducible of type 2, then α1(q)+=α1(q)−=k. Therefore,
[TABLE]
which implies our result.
Now, if M=2k+1, since α(q) is strongly irreducible of type 2, then α1(qG)α2(qG)=α1(q)α2(q). This implies that α(q)∈{k,k+1}∞. Then, if v1=α1(q) note that
[TABLE]
Using symmetry, we have that if v1=α1(q) then
[TABLE]
Then, (4.19) and (4.20) together with the fact that ν∈\pazocalL(Vq) imply that our result holds —see also [2, Lemma 3.9].
Case 3: Suppose that α(q) is strongly irreducible of type 3. Let
[TABLE]
Since α(q) is strongly irreducible of type 3 then from Lemma 3.6 there exists a unique j<k such that α1(q)…αj(q)− is a fundamental word, (α1(q)…αj(q)−)∞ is irreducible and
[TABLE]
in particular
[TABLE]
If α1(q)≺v1≺α1(q) then, since ν∈\pazocalL(Vq), (4.21) implies
[TABLE]
Suppose that v1=α1(q), note that since α1(q)…αj(q)− is a fundamental word then αj(q)−<α1(q)=v1. Therefore, from (4.21) we obtain
[TABLE]
Moreover, since α1(q)…αj(q)− is a fundamental word and ν∈\pazocalL(Vq) we have that for every 2≤i≤j,
[TABLE]
which implies that
[TABLE]
By symmetry (see (2.6)), using a similar argument we obtain that if v1=α1(q) then
[TABLE]
∎
Note that the index j obtained in Lemma 4.17 does not depend neither on ν∈\pazocalL(Vq) nor on the length of ν. However, it depends on q. We now recall [2, Lemma 3.8]. We will include the proof since it will be used later on.
Lemma 4.18**.**
Let q∈V. Then, for any word υ∈\pazocalL(Vq) and any m>∣υ∣ there exists η∈\pazocalL(Vq) such that υη∈\pazocalL(Vq) and α1(q)…αm(q) or α1(q)…αm(q) is a suffix of υη.
Proof.
Let υ=u1…un∈\pazocalL(Vq) and let m>n be fixed. Then,
[TABLE]
If
[TABLE]
then it is clear that the words η=α1(q)…αm(q) and η′=α1(q)…αm(q) satisfy the conclusion of the lemma.
Suppose now that
[TABLE]
Then, we define
[TABLE]
Then, the minimality of s+ and (4.22) imply that
[TABLE]
Then, for every j∈N the word η=αn−s++1(q)…αn−s++j(q) satisfies the conclusion of the lemma.
Now, let us assume that
[TABLE]
In a similar way to (4.25) we define
[TABLE]
Here, the minimality of s− and (4.22) imply that
[TABLE]
So, for every j∈N the word η=αn−s−+1(q)…αn−s−+j(q) satisfies the conclusion of the lemma.
Finally, suppose that
[TABLE]
Using symmetry, we may assume without losing generality that s+<s−, i.e
[TABLE]
If s+=0, then υ=α1(q)…αn(q). Therefore, for every j∈N the word η=αn+1(q)…αn+j(q) satisfies the conclusion of the lemma. Let us assume now that s+=0. Then, the minimality of s+, as well as (4.22) and the inequality s+<s− imply
[TABLE]
Then, for every j∈N the word η=αn−s++1(q)…αn−s++j(q) satisfies the conclusion of lemma.
∎
Proposition 4.19**.**
If q∈SI and there exists K∈N such that
[TABLE]
for every k∈N then (Vq,σ) has the specification property.
Proof.
Let q∈SI. Then, there exists N∈N such that for every m≥N, qm−∈I. Let us assume that there is K∈N such that d(σk(α(q)),α(q))≥1/2K for every k∈N. Clearly, d(σk(α(q)),α(q))≥1/2K for every k∈N. Set
[TABLE]
for every m∈N. Let
[TABLE]
It is easy to check that nJ>K.
Claim A: For every m≥J we have that nm+1−nm≤K+1.
To show this, suppose that there is m≥J such that nm+1−nm>K+1. Then, for every nm+1≤j≤nm+1,
[TABLE]
This, combined with the assumption nm+1−nm>K+1, implies that
[TABLE]
for some i≥0. Then,
[TABLE]
which is a contradiction. Therefore, our claim is true.
Let υ=u1…uℓ and ν=v1…vℓ∈Bℓ(Vq). From Lemma 3.5 there exists L∈N such that υ,ν∈\pazocalL(Vqm−) for every m≥L. Consider
[TABLE]
Note that Proposition 3.9 (VqJ−,σ) and (VqJ′−,σ) are mixing subshifts of finite type. Also,
[TABLE]
Moreover, if ℓ≤mN then J′=N+1. Since υ∈Bℓ(VqJ′−), then
[TABLE]
We now split the proof in three cases:
Case 1: Strict inequalities hold in (4.32).
Then from Lemma 4.18, we have that the words
[TABLE]
satisfy that
[TABLE]
for every t∈N. Since J<J′, Lemma 3.5 implies that
[TABLE]
and
[TABLE]
From Lemma 4.17 there is j∈N such that
[TABLE]
Then, either
[TABLE]
or
[TABLE]
satisfy that υων∈\pazocalL(VqJ′−), so υων∈\pazocalL(Vq). Since J<J′ we obtain that ∣ω∣=nJ+j.
Case 2: Let s+,s− given by Lemma 4.18 and let s=min{s+,s−}. We prove the case when s=s+ since the proof for other case is analogous.
Case 2 a): Suppose that s=0. Then, there is N1∈N such that either
[TABLE]
or
[TABLE]
Suppose that (4.33) holds. Again, as a consequence of Lemma 4.18, we obtain that
[TABLE]
satisfy
[TABLE]
for every t∈N. Using a similar argument as in Case 1), we have that either
[TABLE]
or
[TABLE]
satisfy
υων∈\pazocalL(VqJ′−), and υων∈\pazocalL(Vq). In this case, we also have ∣ω∣=nJ+j.
Suppose now that (4.34) holds. Then l∈{1,…nJ′−1}. If l∈{1,…,N−1} then υα(q)l+1…αnN(q)−∈\pazocalL(VqJ′−). Then either
[TABLE]
or
[TABLE]
satisfy that υων∈\pazocalL(VqJ′)⊂\pazocalL(Vq). Note that ∣ω∣≤nN−1+j. If l∈{mN…nJ′−1}, Claim A together with (4.31) imply that there is l′∈{mN…mJ′−1} such that l<l′, (α1(q)…αl(q)−)∞ is an irreducible sequence and l′≤l≤K+1. Then, using Lemma 4.17 we have that ω=αnN+1(q)…αl′(q)α1(q)…αj(q)− or ω=αnN+1(q)…αl′(q)α1(q)…αj(q)+ satisfies that υων∈\pazocalL(VqN′′)⊂\pazocalL(Vq). Note that ∣ω∣=l′−l+j≤K+1+j.
Case 2 b): Finally, let us assume that s=0. Then
[TABLE]
Then, there exists N2∈N such that
[TABLE]
or
[TABLE]
for l∈{1,…,mJ′−1}.
Then, we can proceed as in Case 2 a).
Combining cases 1 and 2 and Proposition 3.10 we get that for every υ,ν∈Bℓ(Vq) there is ωsuch that υων∈\pazocalL(Vq) and ∣ω∣=S=max{nJ+j,K+1+j}. Observe that ∣ω∣ does not depend on ℓ. This gives that sℓ(Vq)=S for every ℓ∈N. Then we conclude that sVq=S and that (Vq,σ) has the specification property.
∎
Corollary 4.20**.**
Let N≥2. Then, if q∈IN then (Vq,σ) has specification.
Proof.
Fix M∈N, N≥2 and let q∈IN. Then, Proposition 4.7 implies that q∈I. Then α(q) satisfies that for any r≥2,
[TABLE]
This implies that d(σn(α(q)),α(q))≥1/2N. Then the result follows directly from Proposition 4.19.
∎
Note that Proposition 4.16 shows the necessity for q∈SI in order to get the specification property. As we show in the Proposition 4.21 the strong irreducibility of q is not sufficient to get the specification property. In those cases d(σn(α(q)),α(q)) is very small for infinitely many n∈N.
Proposition 4.21**.**
There exists q∈SI such that (Vq,σ) has no specification.
Proof.
We construct now q∈SI such that for any K∈N there is n∈N such that d(σn(α(q)),α(q))≤1/2K. Fix p1∈Per(I) with quasi-greedy expansion
[TABLE]
Let I(p1) the irreducible interval generated by p1 as [2, Theorem 2] and define q1 implicitly by
[TABLE]
From Lemma 4.8 and Lemma 4.10 there exists infinitely many n∈N such that α1(q1)…αn(q1) is a fundamental word and (α1(q1)…αn(q1))∞ is an irreducible sequence. Let
[TABLE]
Let p2 be defined implicitly as
[TABLE]
Set q2 to have quasi-greedy expansion
[TABLE]
Again, applying [2, Theorem 2] we have that I(p2) is an entropy plateau. Also note that p1<q1<p2<q2. As before, applying Lemma 4.8 and Lemma 4.10 we obtain
[TABLE]
Then, we can define implicitly p3 to be
[TABLE]
Assuming that I(pn) is already defined, we define pn+1 to satisfy
[TABLE]
and
[TABLE]
Then, pn<qn<pn+1 for every n∈N. Note that, mn<mn+1 for every n∈N. Furthermore, using 4.2 we obtain that p=n→∞limpn exists and p∈SI. As we constructed p we have that
[TABLE]
Since mn<mn+1 we obtain the desired conclusion.
∎
Remark 4.22*.*
The procedure described in Subsection 4.2 can also be performed to get a base p∈SI with the specification property. In Proposition 4.21 the sequence {mn}n=1∞ is not bounded. If a bounded sequence {mn}n=1∞⊂N is considered then the resulting limit point p will satisfy that the subshift (Vp,σ) has specification. Here K=max{mn}n=1∞+1 will satisfy the hypothesis of Proposition 4.19.
On the other hand, it is not difficult to show that
[TABLE]
will satisfy that there is N∈N with d(σn(α(q)),α(q))≥1/2N for every n∈N. However, from [2, Lemma 3.3], the subshift (Vq,σ) is not transitive, thus, it can not have the specification property.
We obtain the following corollary as a direct consequence of [2, Lemma 6.2] Proposition 4.12, and Corollary 4.20.
Corollary 4.23**.**
The class C3′ is uncountable and (B∩[qT,M+1])∖C3′ is an uncountable set.
5. Synchronised q-subshifts
In this section we characterise the set of q∈V such that (Vq,σ) is synchronised. Recall that a word ω∈\pazocalL(X) for a transitive subshift (X,σ) is intrinsically synchronising (colloquially ω is a magic word) if whenever υω and ων∈\pazocalL(X) we have υων∈\pazocalL(X). We call a transitive subshift (X,σ) to be synchronised if there exists an intrinsically synchronising word ω∈\pazocalL(X). Following this, let us observe that C5′=∅ since for every q∈V∩(qG,qT), (Vq,σ) cannot be a synchronised subshift. Also, notice that C4′⊂I.
We will show the existence of an intrinsically synchronising word whenever α(q) is irreducible and the orbit of α(q) is not dense in Vq; that is, there is a word ω∈\pazocalL(Vq) such that ω is not a factor of α(q). Our intuition is based on Propositions 4.16 and 4.21.
Lemma 5.1**.**
If α(q) is an irreducible sequence and the orbit of α(q) under σ is not dense in Vq then there exists an intrinsically synchronising word ω∈\pazocalL(Vq).
Proof.
We claim that any word ω∈\pazocalL(Vq) such that ω is neither a factor of α(q) nor a factor of α(q) is an intrinsically synchronising word. Let υ=u1…uℓ and ν=v1…vn∈\pazocalL(Vq) such that υω∈\pazocalL(Vq) and ων∈\pazocalL(Vq). Suppose that ∣ω∣=m. Since, υω∈\pazocalL(Vq) we have that
[TABLE]
for every i∈{0,…ℓ−1}. Moreover, since ων∈\pazocalL(Vq) we obtain that
[TABLE]
for every j∈{0,…m−1}. Suppose that υων∈/\pazocalL(Vq). From (5.1) and (5.2) there exists i∈{0,…ℓ−1} such that either
[TABLE]
or
[TABLE]
Suppose that
[TABLE]
Then, (5.1) implies the following: either
[TABLE]
or there is j′∈{2,…n} such that
[TABLE]
Both (5.3) and (5.4) contradict that ω is not a factor of α(q). If
[TABLE]
the proof follows from a similar argument.
∎
The following proposition gives a sufficient condition on α(q) to guarantee that there exists q∈I such that (Vq,σ) is transitive and non-synchronised.
Proposition 5.2**.**
If q∈I and α(q) has dense orbit under σ then no word ω∈\pazocalL(Vq) is intrinsically synchronising.
Proof.
Let ω∈\pazocalL(Vq) and let us assume that ∣ω∣=n. Since the orbit under σ of α(q) is dense in Vq, it is clear that the orbit of α(q) is also dense in Vq. Recall that the follower set of ω is given by
[TABLE]
Fix m∈N and let FVqm(ω)={ν∈FVq(ω):∣ν∣=m}. Since α(q) and α(q) have dense orbits in Vq then for every ν∈FVqm(ω) there exist k,k′∈N such that ων is a prefix of σk(α(q)) and ων is a prefix of σk′(α(q)). Fix γ,ν∈FVqm(ω) with γ≺ν. Then, there exist k and k′∈N such that σk(α(q))=ωγ and σk′(α(q))=ων. Clearly ωγ≺ων. Let υ=α1(q)…αk(α(q)). Then υω∈\pazocalL(Vq). However υων∈/\pazocalL(Vq) since υων≻α1(q)…αk+n+m. Thus, ω is not a synchronising word.
∎
As a direct consequence of (2.2) and Corollary 4.23, we obtain the following corollary.
Corollary 5.3**.**
The class C4′ is uncountable.
5.1. Existence non synchronised and transitive symmetric q-subshifts.
We will show now that there are bases q∈I with α(q) dense in Vq. We will perform a construction inspired by the one given by Schmeling in [36, Proof of Theorem B]. Unfortunately, the presented construction is algorithmically complicated. Nonetheless, it is not our objective to give an optimal construction for such bases.
Firstly, fix q∈Per(I). So, α(q)=(α1(q)…αm(q))∞ where m is the period of α(q). Consider Bm(Vq) ordered in a decreasing way with respect to the lexicographical order. Note that the largest element of Bm(Vq) is α1(q)…αm(q) and the smallest is α1(q)…αm(q). Now we recall [2, Lemma 3.9].
Lemma 5.4**.**
Let q∈[qT,M+1]∩V and m∈N. Then for any ν∈\pazocalL(Vq) there exists η∈\pazocalL(Vq) such that km is a prefix of ην∈\pazocalL(Vq) if M=2k, or ((k+1)k)m is a prefix of ην∈\pazocalL(Vq) if M=2k+1.
Then, for every ω∈Bn(Vq) there is a word ηω∈\pazocalL(Vq) such that (k+1)k is a prefix of ηωω∈\pazocalL(Vq) if M=2k+1, or k is a prefix of ηωω∈\pazocalL(Vq) if M=2k. On the other hand, Lemma 4.18 assures us that for every j>∣ηωω∣, there exists a word γηωω∈\pazocalL(Vq) such that ηωωγηωω∈\pazocalL(Vq) and the word α1(q)…αm(q) is a suffix of ηωωγηωω. For each i∈{2,…,#Bm(Vq)−1} and for each word ωi∈Bm(Vq) we call the word
[TABLE]
an extended word of ωi. For ω1=α1(q)…αm(q) we set ω1′=(α1(q)…αm(q))t for a fixed t∈N with t≥2,111This technical condition will help us to prove that the word generated in Lemma 5.7 will parameterise a transitive symmetric subshift. and for ω#Bm(Vq)=α1(q)…αm(q) we set ω#Bm(Vq)′=ω#Bm(Vq).
From [2, Theorem 1] there exists {υi}i=1#Bm(Vq)−1⊂\pazocalL(Vq) such that
[TABLE]
Clearly, the word δ(q) defined in 5.6 satisfies that ν is a factor of δ(q) for every ν∈k=0⋃mBk(Vq).
We recall now the notion of primitive word introduced in [2, Definition 3.10]. Given a finite word ω=w1…wn we say that ω is primitive if
[TABLE]
Note that
(5.7) is similar to (4.10). Also, it is clear that
[TABLE]
Here, we are inducing the distance d for ΣM as a distance in B∣δ(q)∣(Vq).
The main idea of our construction is to show that for any q∈Per(I) it is possible to find a set {υi}i=1#Bm(Vq)−1⊂\pazocalL(Vq) satisfying that δ(q) is a prefix of a fundamental word θ(q). For this purpose, we need to recall the notion of reflection recurrence word introduced in [2, Definition 3.11] and some related results.
Given a primitive word ω=w1…wn, the reflection recurrence word of ω is the truncated word
[TABLE]
where
[TABLE]
In the case that s=0, we have that R(ω)=ϵ. We summarise the results proven in [2, Lemmas 3.13, 3.14. 3.15 and 3.16] in the following lemma.
Lemma 5.5**.**
Suppose that ω is a primitive word with ∣ω∣=m.
- i)
If m≥2 then
[TABLE]
2. ii)
R(ω)* is primitive;*
3. iii)
For n∈N set Rn(ω)=R(Rn−1(ω)) and R0(ω)=R(ω). If m≥2 then there exists j∈{0,…,m} such that either
[TABLE]
with ∣Rj(ω)∣≤2 or Rj(ω)=w1w1+.
4. iv)
Let q∈I. There exists infinitely many m∈N such that α1(q)…αm(q) is a primitive word and for each of such m∈N there exists N=N(m) such that
[TABLE]
and for every r∈N
[TABLE]
We now show the desired properties for δ(q). We want to remark that the proof of the following lemma is strongly based on the argument used to prove [2, Propositon 3.17].
Lemma 5.6**.**
Let q∈Per(I). Then there exists {υi}i=1#Bm(Vq)−1⊂\pazocalL(Vq) such that δ(q) is a prefix of a fundamental word θ(q).
Proof.
Let α(q)=(α1(q)…αm(q))∞ and consider Bm(Vq) ordered in a decreasing way with respect to the lexicographical order. For each ωi∈Bm(Vq) let ωi′ be a extended word of ωi given in 5.5. From Lemma 5.5 there is a word γ1 such that
[TABLE]
We can consider γ1 to have minimal length and satisfy (5.13). From [2, Proposition 3.17] there exists ν1∈\pazocalL(Vq) such that ω1′γ1ν1ω2′∈\pazocalL(Vq) and
[TABLE]
where ℓ∈{1,…,∣ω1′γ∣} and N is given by (5.12) of Lemma 5.5. Let us set
[TABLE]
with K1=∣ω1′γν1ω2′∣. Since ω1≻ω2 we have that for any j∈{1,…,K1},
[TABLE]
Since ω2′ is the suffix of b1…bK we have that α1(q)…αm(q) is the suffix of length m of b1…bK. Then, from Lemma 5.5 there is γ2 such that α1(q)…αm(q)γ2∈\pazocalL(Vq) is primitive. We can consider again γ2 to have minimal lenght. Then [2, Proposition 3.17] implies that there is ν2∈\pazocalL(Vq) such that ω1′γ1ν1ω2′γ2ν2ω3′∈\pazocalL(Vq) and
[TABLE]
with ℓ∈{1,…,m+∣γ2∣} and N∈N. Set K2=∣ω1′γ1ν1ω2′γ2ν2ω3′∣ and
[TABLE]
Similarly, since ω2≻ω3 then for any j∈{1,…,K2} we obtain that
[TABLE]
Iterating this procedure we obtain that the set {υi}i=1#Bm(Vq) with υi=γiνi for every i∈{1,…#Bm(Vq)−1} satisfies that
[TABLE]
and
[TABLE]
for every j∈{0,…,K−1}. Observe that for j=K−m we have that σj(δ(q))=α1(q)…αm(q). Consider θ(q)=δ(q)α1(q). Note that σj(θ(q))=α1(q)…αm(q)α1(q). Since α1(q)…αm(q) is a fundamental word and satisfies
[TABLE]
we have that for every j∈{1,…m},
[TABLE]
This implies that θ(q) is a fundamental word.
∎
As a consequence of Lemma 5.6 we obtain the following result.
Lemma 5.7**.**
Let q∈Per(I) with α(q)=(α1(q)…αm(q))∞ and let θ(q)=θ(q,t) given by Lemma 5.6. Then:
- i)
θ(q)* is a fundamental word;*
2. ii)
For any ν∈k=0⋃mBk(Vq), ν is a factor of θ(q).
3. iii)
(θ(q))∞≺α(q)**
4. iv)
(θ(q))∞* is irreducible.*
Proof.
Note that i) and ii) are direct consequences of Lemma 5.6. Moreover, since ω1≻ω2 we obtain iii) directly from the definition of θ(q). It remains to show that (θ(q))∞ is irreducible. Let j∈N such that (θ1(q)…θj(q)−)∞∈V. Then if j∈{1,…,t⋅m} then
[TABLE]
holds from the irreducibility of α(q). On the other hand for t⋅m≥j note that since α1(q)…αm(q)≺ωi′ for every i∈{1,…,#Bm(α(q))−1} and α1(q)…αm(q)t is a factor of α1(q)…αj(q) we have that (5.14) holds. Thus θ(q) is irreducible.
∎
Proposition 5.8**.**
There exists q∈I such that {σn(α(q))}n=0∞ is a dense subset of Vq.
Proof.
Let q1∈Per(I) with quasi-greedy expansion α(q1)=(α1(q1)…αm1(q1))∞. Fix t1∈N with t1≥2. From Lemma 5.6 and Lemma 5.7 there is a fundamental word θ(q1) such that:
- i)
(θ(q1))∞ is irreducible;
2. ii)
(θ(q1))∞≺α(q1); and
3. iii)
ν is a factor of θ(q1) for any ν∈k=0⋃m1Bk(Vq1).
Since (θ(q1))∞ is irreducible then α(qT)≺(θ(q1))∞. Set q2 be defined explicitly such that
[TABLE]
Clearly m1<m2. Also, (5.8) implies that
[TABLE]
Moreover, from Lemma 2.3 we have that q1≥q2. This combined with [33, 1.5.10] imply that
[TABLE]
Then, iii) implies that ν is a factor of α(q2) for every ν∈k=0⋃m1Bk(Vq2).
Consider tn∈N with tn≥2 for every n≥2. Suppose that qn is already defined. We define qn+1 implicitly as α(qn+1)=(θ(qn))∞=(θ(qn,tn))∞.
Note that from i) we have that α(qn) is irreducible, so qn∈I for every n∈N. Also, Lemma 2.3 and ii imply that {qn}n=1∞ is a decreasing sequence. Furthermore, {qn} is bounded from below by qT. Thus qn↘q∈U∩[qT,M+1] as n→∞. This implies
[TABLE]
Let us consider the quasi-greedy expansion of q, α(q). If x=(xi)∈n=1⋂∞Vqn then
[TABLE]
Therefore, α(qn)≺σm((xi))≺α(qn) for every n,m∈N, which gives that α(q)≼σm((xi))≼α(q), i.e. x∈Vq. Thus,
[TABLE]
Since, mn<mn+1, it is clear that α(q) is not a periodic sequence. Note that iii) implies that for every n∈N and for every ν∈k=0⋃mnBk(Vqn), ν is a factor of α(qn+1). Also, observe that for every n∈N, α1(qn)…αmn(qn) is a prefix of α(q). Then, for any
[TABLE]
ν is a factor of α(q). Fix ω=w1…wk∈\pazocalL(Vq). Then
[TABLE]
Then, from (5.15) and since qn↘q, [33, 1.5.10] implies that there is N∈N such that for every n≥N, ω∈Bk(Vqn)=Bk(VqN) and Bk(Vqn)=Bk(Vq). Thus, ω is a factor of α(qn) for every n≥N which gives that ω is a factor of α(q). Then, since each word in \pazocalL(Vq) has to appear in α(q) infinitely often we obtain that {σn(α(q))}n=0∞ is a dense subset of Vq and that Vq is a transitive subshift. Therefore, [2, Theorem 1] gives that q∈I.
∎
Corollary 5.9**.**
For any q∈B∩[qT,M+1] there is p such that {σn(α(p))}n=0∞ is dense in Vp and p is arbitrarily close to q, i.e. {p∈I:α(p) is dense in Vp} is dense in B∩[qT,M+1].
Proof.
Let q∈B∩[qT,M+1] with quasi-greedy expansion α(q). We note here that if q∈I(p′) for some p′∈Per(I) then, from [2, Proposition 4.11] Lemma 3.7 we obtain that q=p′, or q satisfies
[TABLE]
where m(p′) is the period of α(p′). Then, we have to consider three cases:
Case 1: Suppose that q∈I(p′) and q=p′. Let α(q)=(α1(q)…αm(q))∞ the quasi-greedy expansion of q. Then, since Per(I) is dense in B∩[qT,M+1] then, for every N∈N there exists pN∈Per(I), α(pN)=(α1(pN)…αmN(pN))∞ such that d(α(pN),α(q))≤1/2N+1. In particular, for any ε>0 there are N,M∈N such that
[TABLE]
So, fix t1∈N with t1≥2 and consider θ(pN) given by Lemma 5.7 and set pN1 defined implicitly by α(pN1)=(θ(pN))∞. Since t1≥2, we get
[TABLE]
Then,
[TABLE]
Consider {θ(pNi)}i=1∞, the sequence generated in the proof of Proposition 5.8 and the associated sequence {α(pNi)}i=1∞ with limit p. Note that for every i≥2,
[TABLE]
where mN1 is the period of α(pN1). Then, d(α(pNi),α(q))<ε for every i∈N, thus d(α(p),α(q))<ε. As a consequence of Lemma 2.3 we obtain the result for this case.
Case 2: Suppose that q∈I(p′) and α(q)=α1(p′)…αm(p′)(p′)+(α1(p′)…αm(p′)(p′))∞. Let ε>0. From Lemmas 4.8 and 4.10 there exists N∈N such that for every n≥N,
- i)
α1(q)…αmn(q) is a fundamental word;
2. ii)
(α1(q)…αmn(q))∞ is an irreducible sequence; and
3. iii)
d((α1(q)…αmn(q))∞,α(q))<1/2N⋅mn<ε.
Fix n∈N such that i), ii) iii) holds for for ε and let q′ with α(q′)=(α1(q)…αmn(q))∞. Fix t1∈N with t1≥2. Let θ(p1) given by Lemma 5.7 and set p1 defined implicitly by α(p1)=(θ(q′))∞. Fix a sequence {tn}n=2∞⊂N with tn≥2 for every n≥2. Then, for every n≥2 consider {θ(pn)}i=2∞ the sequence generated in the proof of Proposition 5.8 and the associated sequence {α(pn)}i=1∞. From a similar argument as in Case 1, the quasi-greedy expansion of p, α(p), where p is the limit of the sequence {pn}n=1∞ satisfies the desired conclusion.
Case 3: Suppose that q∈(B∩[qT,M+1])∖p′∈Per(I)⋃I(p′). In such case, note that for any ε>0, there are p+,p−∈Per(I) such that
[TABLE]
and
[TABLE]
Then, applying the construction exposed on Case 1 to α(p−)=(α1(p−)…αmp−(p−))∞ and the construction exposed in Case 2 to α(p+)=(α1(p+)…αmp+(p+))∞ we can construct the desired base.
∎
As in the previous constructions 4.2 and 4.3, the construction of a base q with dense quasi-greedy expansion α(q) in Vq depends on a sequence {tn}n=1∞. Then, the following corollary holds.
Corollary 5.10**.**
The subclass C5′∩I is uncountable.
6. Hausdorff dimension of the classes C3′,C4′,C5′
We will investigate the Hausdorff dimension of the classes C3′,C4′,C5′. Let us summarise the results concerning of this classes so far.
(A) C3′={q∈I:q∈SI and there is K∈N with d(σn(α(q)),α(q))≥1/2K for n∈N};
(B) C4′={q∈I:σn(α(q)) is not dense in Vq};
(C) C5′={q∈I:σn(α(q)) is dense in Vq};
Observe that (A) is a consequence of Proposition 4.16, Proposition 4.19 and Proposition 4.21. Also, (B) and (C) are consequences of Lemma 5.1 and Proposition 5.2. Finally, Corollary 4.23, Corollary 5.3, Proposition 5.9 and Corollary 5.10 imply C3′,C4′, and C5′ are uncountable and dense subsets of B∩[qT,M+1].
Let us establish the necessary results to complete the proof of Theorem A. From Theorem 2.7 we have that dimH(B)=1. Furthermore, from [2, Lemma 4.10] we have
[TABLE]
Then, combining [2, Theorem 3], [23, Lemma 2.6] it holds that
[TABLE]
Now, from [23, Theorem 2] we know that for any q∈B we have that dimHloc(Bq)=dimH(\pazocalVq).
We recall now [2, Lemma 6.4].
Lemma 6.1**.**
Let N≥2. Then
[TABLE]
Then, from Lemma 6.1 we obtain directly the following:
Proposition 6.2**.**
dimH(C3′)=1.* Moreover, dimH(C4′)=1.*
Proof.
As in the proof of [2, Theorem 3], we note that IN⊂C3′ for every N≥2. From Lemma 6.1 the statement holds by letting N→∞. Finally, (2.2) gives us dimH(C4′)=1.
∎
Now, as a consequence of Lemma 2.2, Proposition 2.8 and Proposition 4.14 we have
[TABLE]
thus
[TABLE]
Finally, Lemma 2.2, Proposition 2.8 and Corollary 5.9 imply the following statement.
Proposition 6.3**.**
[TABLE]
Proof of Theorem A.
Theorem A follows from Propositions 4.16, 4.19, 4.21. 6.2, 5.2, 6.3 and Lemma 5.1.
∎
7. Final comments and open questions
We notice that Definition 4.1 can be generalised in the following way. We say that a sequence α=(αi)∈V is strongly ∗-irreducible if α is ∗-irreducible and there exists N∈N such that for every n≥N with
(α1…αn−)∞∈V, then (α1…αn−)∞ is ∗-irreducible. Similarly, a sequence (αi)∞∈V is weakly ∗-irreducible if α is ∗-irreducible and there exist infinitely many n∈N such that (α1…αn−)∞∈V and (α1…αn−)∞ is not ∗-irreducible. We can also define strongly irreducible numbers and weakly irreducible numbers as in Definition 4.2.
Using the constructions performed in Subsections 4.2 and 4.3 with small modifications it is not difficult to see that there exist uncountably many strongly ∗-irreducible sequences and uncountably many weakly ∗-irreducible sequences. Also, it is not hard to check that strongly irreducible numbers and weakly irreducible numbers are dense in (qKL,qT)∩V where qKL is defined in (2.4). Then, it is natural to investigate the Hausdorff dimension of the set of strongly ∗-irreducible numbers and ∗-weakly irreducible numbers.
Question 7.1**.**
What is the Hausdorff dimension of strongly irreducible and weakly irreducible numbers?
We would like to make some comments about the symbolic dynamics of (Vq,σ) when q∈(qKL,qT). In [2, Proposition 5.10] it was shown that if q is a ∗-irreducible base q such that α(q) is periodic then for every p∈I∗(q), Vp contains a unique subshift of finite type (X,σ) such that htop(X)=htop(Vq)=htop(Vp). To the best of the knowledge of the author it is not known that (X,σ) is a mixing subshift. Also, if q∈V∩[qKL,qT) it is known that (Vq,σ) is not a transitive subshift [2, Lemma 3.3]. However, we do not know much about the symbolic dynamics of the transitive components of (Vq,σ).
Question 7.2**.**
Consider q∈B∩(qKL,qT).
- i)
Is it true that if (Vq,σ) is sofic, then there exists a unique transitive subshift (X,σ) such that htop(X)=htop(Vq) and (X,σ) is a sofic subshift?
2. ii)
Is it true that if q is a strongly ∗-irreducible number then (Vq,σ) contains a unique transitive subshift (X,σ) such that htop(X)=htop(Vq) and (X,σ) is a has the specification property?
3. iii)
What are the conditions for the quasi-greedy expansion of q to ensure that (Vq,σ) contains a unique transitive subshift (X,σ) such that htop(X)=htop(Vq) and (X,σ) is synchronised?
It would be also interesting to know if for every q∈V the subshift (Vq,σ) is balanced or boundedly supermultiplicative as in [9, Definition 3.1, Definition 3.2]. In particular, this question is interesting from two different perspectives: firstly, it is not clear if there is an example of a non-transitive balanced shift or a non-transitive boundedly supermultiplicative subshift. Secondly, in [9, p. 639] the authors ask if there is an example of a balanced subshift without the almost specification property. It would be interesting to find such example in C5′ or in B∩[qT,M+1]∖C3′.
It would be interesting to classify the set of q∈(B∩[qT,M+1])∖C3′ satisfying the weaker forms of specification defined in [31] and calculate their size. Finally, to the best of the knowledge of the author, it is not known if every transitive symmetric q-shift is entropy minimal, i.e. that every subshift (X,σ) of (Vq,σ) satisfies
[TABLE]
— see[21].
Acknowledgements
The author is indebted with Felipe García-Ramos and with Edgardo Ugalde for all their support during the development of this research. Also, the author wants to thank Simon Baker, Óscar Guajardo and Derong Kong for their useful remarks and comments. Finally, the author thank the anonymous referee for their rigorous and meticulous reading of this research and their very helpful suggestions that led to an improved presentation.