Bases in which some numbers have exactly two expansions
Vilmos Komornik, Derong Kong

TL;DR
This paper investigates the set of bases where numbers have exactly two expansions, proving its topological properties, structure, and Hausdorff dimension near a critical constant.
Contribution
It establishes that the set of such bases is closed, characterizes its accumulation points, and analyzes its Hausdorff dimension near the Komornik-Loreti constant.
Findings
The set of bases with exactly two expansions is closed.
It contains infinitely many isolated and accumulation points.
The Hausdorff dimension of the set near the Komornik-Loreti constant is less than 1.
Abstract
In this paper we answer several questions raised by Sidorov on the set of bases in which there exist numbers with exactly two expansions. In particular, we prove that the set is closed, and it contains both infinitely many isolated and accumulation points in , where is the Komornik-Loreti constant. Consequently we show that the second smallest element of is the smallest accumulation point of . We also investigate the higher order derived sets of . Finally, we prove that there exists a such that \begin{equation*} \dim_H(\mathcal B_2\cap(q_{KL}, q_{KL}+\delta))<1, \end{equation*} where denotes the Hausdorff dimension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · semigroups and automata theory
Bases in which some numbers have exactly two expansions
Vilmos Komornik
Département de mathématique, Université de Strasbourg, 7 rue René Descartes, 67084 Strasbourg Cedex, France
Derong Kong
Mathematical Institute, University of Leiden, PO Box 9512, 2300 RA Leiden, The Netherlands
Abstract
In this paper we answer several questions raised by Sidorov on the set of bases in which there exist numbers with exactly two expansions. In particular, we prove that the set is closed, and it contains both infinitely many isolated and accumulation points in , where is the Komornik-Loreti constant. Consequently we show that the second smallest element of is the smallest accumulation point of . We also investigate the higher order derived sets of . Finally, we prove that there exists a such that
[TABLE]
where denotes the Hausdorff dimension.
keywords:
Non-integer bases, two expansions, derived sets, accumulation points, unique expansion, Hausdorff dimension
MSC:
[2010] Primary: 11A63, Secondary: 37F20, 37B10
1 Introduction
In this paper we consider expansions
[TABLE]
over the alphabet in some base . The sequence is called a -expansion of . Such an expansion may exist only if .
If , then every expansion is unique by an elementary argument, but not every has an expansion. If , then every has at least one expansion. For example, in the well-known integer base case all numbers have a unique expansion, except the dyadic rational numbers that have two. Henceforth we assume that .
Expansions in non-integer bases are more complicated than that in the integer base . Erdős et al. discovered in [10, 11, 12] that for any there exist and such that has precisely different -expansions. Furthermore, in case , where denotes the Golden Ratio, every has a continuum of -expansions. Later, Sidorov proved in [26] that for any Lebesgue almost every has a continuum of -expansions (see also [5]).
Many works have been devoted to unique expansions. Komornik and Loreti proved in [19] that there is a smallest base in which has a unique expansion. Subsequently, Glendinning and Sidorov discovered that the Komornik–Loreti constant plays an important role in describing the size of the univoque sets
[TABLE]
They proved in [14] the following interesting results:
if , then ;
- 2.
if , then is countably infinite;
- 3.
if , then is uncountable and has zero Hausdorff dimension;
- 4.
if , then , where denotes the Hausdorff dimension.
We point out that has a fractal structure for . The authors and Li proved in [18] that the function has a Devil’s staircase behavior.
Based on the classification of the bases by Komornik and Loreti [20], the topology of the univoque sets was studied by de Vries and Komornik in [7]. They proved among others that is closed if and only if , where is the topological closure of
[TABLE]
In other words, is the set of univoque bases for which has a unique expansion. An element of is called a univoque base. As mentioned above, the smallest univoque base is .
The set itself is also of general interest. Erdős et al. proved in [11] that is a Lebesgue null set of first category. Later, Daróczy and Kátai proved in [6] that has full Hausdorff dimension. The topological structure of was clarified in [20]. In particular, the authors proved that is a Cantor set, and is a countable and dense subset of . Recently, Bonanno et al. investigated in [4] the connections between , -continued fractions, unimodal maps and even the external rays of the Mandelbrot set.
For more information on the sets and we refer to the survey paper [15] and the book chapter [8].
Sidorov initiated in [27] the study of the sets
[TABLE]
for and . In particular, he has obtained the following important results for the set .
Theorem 1.1** (Sidorov, 2009)**
**
- (i)
; 2. (ii)
; 3. (iii)
, where denotes the Tribonacci number, i.e., the positive zero of ; 4. (iv)
the smallest two elements of are
[TABLE]
the positive zeros of the polynomials and respectively.
Theorem 1.1 (ii) was also contained in [7, Theorem 1.3].
Until now very little is known about the sets . Sidorov proved in [27] that contains a left neighborhood of for each . Baker and Sidorov proved in [3] that the second smallest element of is the smallest element of for each . It follows from the results of Erdős et al. [10, 11] that the Golden Ratio is the smallest element of . Recently, Baker proved in [2] that has a second smallest element which is strictly smaller than the smallest element of . Based on his work Zou and Kong proved in [29] that is not closed.
The purpose of this paper is to continue the investigations on the set . We answer in particular the following questions of Sidorov [27]:
- Q1.
Is a closed set?
- Q2.
Is a discrete set?
- Q3.
Is it true that
[TABLE]
for some ?
Some ideas of this paper might be useful for the future study of with .
Motivated by the work of de Vries and Komornik [7] (see also [16]) we introduce the sets
[TABLE]
Here and in the sequel an expansion is called infinite if it does not end with (it does not have a last one digit), and doubly infinite if it does not end with or (it has neither a last one digit, nor a last zero digit).
Remark 1.2
If is not an integer, then each has a doubly infinite -expansion, namely its quasi-greedy expansion. See also [28].
We recall from [7] that is closed, and
[TABLE]
for all , where denotes the topological closure of .
Using these sets we add two new characterizations of to Theorem 1.1 (i):
Theorem 1.3
The following conditions are equivalent:
- (i)
; 2. (ii)
; 3. (iii)
; 4. (iv)
* and .*
In order to state our next results we recall from [20] and [16] the notation
[TABLE]
this is the set of bases in which has a unique doubly infinite -expansion.
Remark 1.4
The number always has a doubly infinite -expansion, namely its quasi-greedy expansion, even in integer bases.
We recall from [20] that is closed, and that
[TABLE]
The smallest element of is the Golden Ratio , while the smallest element of (and ) is . Furthermore, the difference set is countably infinite and dense in , and the difference set is discrete, countably infinite and dense in .
We recall from [7, 9] that is the disjoint union of its connected components , where runs over and runs over a proper subset of . Since the Komornik–Loreti constant is the smallest element of , the first connected component is .
We recall that each left endpoint is an algebraic integer, and each right endpoint , called a de Vries–Komornik number, is a transcendental number; see Kong and Li [21].
We also recall that for each component, is formed by an increasing sequence of algebraic integers, converging to . For example, the first two elements of in the first connected component are the Golden Ratio and the second smallest element of ; see also Example 2.6 below.
Now we state our basic results on :
Theorem 1.5
**
- (i)
The set is compact. 2. (ii)
. 3. (iii)
Each element of is an accumulation point of . Hence has infinitely many accumulation points in each connected component of . 4. (iv)
The smallest accumulation point of is its second smallest element . 5. (v)
* contains only algebraic integers, and hence it is countable.* 6. (vi)
* has infinitely many isolated points in , and they are dense in .*
Remarks 1.6
**
Theorem 1.5 (i) answers positively Sidorov’s question Q1.
- 2.
Theorem 1.5 (ii) improves Theorem 1.1 (ii) because (and even ) is a proper subset of .
- 3.
Since is a connected component of , Theorem 1.5 (iii) answers negatively Sidorov’s question Q2.
- 4.
Theorem 1.5 (iv) answers partially a question of Baker and Sidorov **[3]** about the smallest accumulation point of for . We recall that the smallest accumulation point of is the smallest element of for all .
- 5.
Theorem 1.5 (v) strengthens a result of Sidorov **[27]** stating that contains only algebraic numbers.
In the following theorem we show that contains infinitely many accumulation points of all finite orders in . For this we introduce the derived sets by induction, setting , and then
[TABLE]
for
All these sets are compact by Theorem 1.5 (i) and a general property of derived sets. Since
[TABLE]
the derived set
[TABLE]
of infinite order is also well defined, non-empty and compact.
Theorem 1.7
**
- (i)
. 2. (ii)
. 3. (iii)
. 4. (iv)
All sets have infinitely many accumulation points in each connected component of . 5. (v)
If are the elements of , then
[TABLE]
and hence
[TABLE] 6. (vi)
For each has infinitely many isolated points, and they are dense in .
Remark 1.8
Theorem 1.7 (iv) provides a negative answer to the question Q2 even if we replace by .
Our last result is related to the local dimension of .
Theorem 1.9
For any we have
[TABLE]
Remarks 1.10
**
We recall from **[18]** that the dimension function is continuous, and vanishes at the Komornik–Loreti constant (see also Lemma 2.4 below). Since , by Theorem 1.5 (v) and Theorem 1.9 there exists a such that
[TABLE]
This answers affirmatively Sidorov’s question Q3.
- 2.
A related result, recently obtained in **[22]**, states that
[TABLE]
The rest of the paper is arranged in the following way. In Section 2 we recall some results from unique expansions. Based on the properties of unique expansions we describe the set in Section 3. In Section 4 we prove Theorem 1.3, and the first parts of Theorems 1.5 and 1.7. Section 5 is devoted to the detailed description of unique expansions. This important tool is extensively used in the rest of the paper. The remaining parts of Theorems 1.5 and 1.7 are proved in Sections 6 and 7, and the proof of Theorem 1.9 is given in Section 8. In the final section 9 we formulate some open questions related to the results of this paper.
2 Unique expansions
In this section we recall several results on unique expansions that will be used to prove our main theorems. Let be the set of sequences with elements . Let be the left shift on defined by . Then is a full shift. Accordingly, let denote the set of all finite strings of zeros and ones, called words, together with the empty word denoted by . For a word we denote by the -fold concatenation of with itself, and by the periodic sequence with period block . For a word we set
[TABLE]
if , and
[TABLE]
if . The reflection of a word is defined by the formula
[TABLE]
and the reflection of a sequence is defined by
[TABLE]
In this paper we use lexicographical orderings , , and between sequences and words. Given two sequences we write or if there exists an such that and . Furthermore, we write or if or . Finally, for two words we write or if .
Now we recall some notations and results from unique expansions. Given a base we denote by the lexicographically largest (called greedy) expansion of in base . Accordingly, we denote by
[TABLE]
the lexicographically largest infinite (called quasi-greedy) expansion of in base . Here an expansion is infinite if it has infinitely many one digits. If with , then is periodic and .
The following Parry type property (see [25]) of was given in [1]:
Lemma 2.1
The map is a strictly increasing bijection from onto the set of all infinite sequences satisfying
[TABLE]
We recall that is the set of having a unique -expansion. We denote by the set of expansions of all . The following lexicographical characterization is a simple variant of another one given by Erdős et al. [10].
Lemma 2.2
Let . Then if and only if
[TABLE]
Lemmas 2.1 and 2.2 imply that the set-valued map is increasing, i.e., if .
We recall that is the set of having at most one doubly infinite -expansion. The following lexicographical characterization of was given in [7].
Lemma 2.3
Let . Then if and only if has a -expansion satisfying
[TABLE]
Lemma 2.3 implies that is closed for any . Then using Lemma 2.2 we conclude that
[TABLE]
Moreover, the difference set is at most countable. It might happen that (see Lemma 2.8 below).
For any let be the set of length subwords of sequences in , and let denote the cardinality of a set . Then the topological entropy of is defined by
[TABLE]
The above limit exists for each by [18, Lemma 2.1]. Moreover, the following lemma was proved in [18]:
Lemma 2.4
The Hausdorff dimension of is given by
[TABLE]
for every . Furthermore, the dimension function has a Devil’s staircase behavior:
* is continuous, and has bounded variation in ;*
- 2.
* almost everywhere in ;*
- 3.
* for all , and for all .*
We recall that is the set of bases in which has a unique -expansion, and is the set of bases in which has a unique doubly infinite -expansion.
The following lexicographical characterizations of , its closure and are due to Komornik and Loreti [20] (see also, [9]).
Lemma 2.5
**
- (i)
* if and only if satisfies*
[TABLE] 2. (ii)
* if and only if satisfies*
[TABLE] 3. (iii)
* if and only if satisfies*
[TABLE]
Example 2.6
For the first two elements of we have and .
By Lemma 2.5 it is clear that . Furthermore, is closed. In order to prove our main results we will also need the following topological properties of and (see [20]):
Lemma 2.7
**
- (i)
* is a countable dense subset of , and is a discrete dense subset of .* 2. (ii)
For each there exists a sequence in that as . 3. (iii)
For each the quasi-greedy expansion is periodic. 4. (iv)
For each there exists a word with such that
[TABLE]
where satisfies (2.1).
Finally, we recall from [7] the following relation between the sets and .
Lemma 2.8
**
- (i)
* is closed if and only if .* 2. (ii)
* if and only if .* 3. (iii)
Let be a connected component of . Then for all .
3 Description of
In this section we describe the set by using unique expansions. The following result is essentially equivalent to Theorem 1.1 (i):
Lemma 3.1
A number belongs to if and only if there exist two sequences satisfying the equality
[TABLE]
Proof 1
The sufficiency of the condition (3.1) is obvious. Conversely, assume that a real number has exactly two -expansions, say and . Then, assuming by symmetry that lexicographically, there exists a first index such that . Then , , , and (3.1) is satisfied with and .\qed
For each we define
[TABLE]
Each sequence satisfies
[TABLE]
and
[TABLE]
by Lemma 2.2.
In the following improvement of Lemma 3.1 we use only sequences from :
Lemma 3.2
A number belongs to if and only if is a zero of the function
[TABLE]
for some .
Proof 2
Let . Since , by Lemma 3.1 we have if and only if satisfies one of the following equations for some :
[TABLE]
It follows by reflection that the first and the forth equalities are equivalent. It remains to prove that the first and the third equalities never hold.
Since , by Lemma 2.2 we have
[TABLE]
Similarly, . This implies that if and only if is a zero of the function
[TABLE]
\qed
In view of Lemma 3.2 we are led to investigate the functions for .
Lemma 3.3
Let and .
- (i)
The function is continuous and symmetric: . 2. (ii)
If and , then . 3. (iii)
If and , then . 4. (iv)
.
Proof 3
(i) follows from the definition of , (ii) follows from the definition of and the property of unique expansions that
[TABLE]
for any with . (iii) follows from (i) and (ii). Finally, (iv) follows from (ii), (iii) and the equality
[TABLE]
when (the lexicographically smallest element of ).\qed
Lemma 3.2 states that each is a zero of the function for some . We prove in our next lemma that no function with can provide more than one element of .
Since contains only one element by Theorem 1.1 (iv): the positive zero of , henceforth we restrict our attention to the set .
Lemma 3.4
Let and .
- (i)
If or , then . 2. (ii)
If and , or and , then . 3. (iii)
In all other cases the function is strictly increasing in .
Proof 4
(i) Let . Applying Lemma 2.2 we see that is the lexicographically smallest element of and . In view of Lemma 3.3 it suffices to prove that
[TABLE]
This follows from the following computation:
[TABLE]
The last inequality holds because
[TABLE]
(ii) We recall that is the Tribonacci number, the positive zero of . We distinguish the following two cases: (a) and (b) .
Case (a): . Since , by Lemma 2.1 we have . Then by Lemma 2.2 it follows that if with for some , then . In view of Lemma 3.3 it suffices to prove
[TABLE]
This follows from the following observation:
[TABLE]
Here the last inequality follows by using the inequalities
[TABLE]
Case (b): . By Lemma 3.3 it suffices to prove that
[TABLE]
This follows from the following computation:
[TABLE]
The last inequality follows by using and :
[TABLE]
(iii) Let and with . We will prove the inequality by distinguishing two cases again (see Figure 1).
First case: and , or and .* Observe that for any sequence and for any positive integer the elementary inequality*
[TABLE]
holds. By Lemma 3.3 it suffices to prove that
[TABLE]
Using (3.2) with and we get
[TABLE]
The required inequality follows by observing that the function
[TABLE]
is strictly increasing in .
Second case: and .* Now using (3.2) with we get, similarly to the first case, the inequality*
[TABLE]
Note that the function
[TABLE]
is strictly increasing in . Therefore we conclude that . \qed
Let and set
[TABLE]
If , then has a unique root in by Lemmas 3.3 (iv) and 3.4, and this root, denoted by , belongs to by Lemma 3.2. We have
[TABLE]
An element of may have multiple representations: see Remark 4.2 below.
Lemma 3.5
Let .
- (i)
If and , then ; 2. (ii)
If and , then .
Proof 5
By symmetry we only prove (i).
Let with . Applying Lemma 3.3 and using the definitions of we have
[TABLE]
Since is strictly increasing in by Lemma 3.4, we conclude that . \qed
4 Proof of Theorem 1.3, Theorem 1.5 (i)-(iv) and Theorem 1.7 (i)-(iii)
We recall that is the set of bases in which has a unique doubly infinite -expansion; equivalently, . In this section we show that . Based on this observation we give new characterizations of (Theorem 1.3). We also show that is closed, , and we conclude that the second smallest element of is also the smallest accumulation point of (Theorem 1.5).
We recall that is the set of univoque bases in which has a unique -expansion, i.e., . First we show that its topological closure is a subset of :
Lemma 4.1
We have , and even .
Proof 6
Since is a Cantor set and therefore , it suffices to prove that . Furthermore, since by Theorem 1.1, it suffices to prove that .
Take arbitrarily. By Lemma 2.7 (iii) there exists a word such that
[TABLE]
Suppose that is the smallest period of . Then , and the greedy -expansion of is given by . Observe that for all (cf. [25]). Then applying Lemma 2.5 (ii) it follows that
[TABLE]
Since , by Lemmas 2.1 and 2.7 (ii) there exists a such that
[TABLE]
In fact we could find infinitely many satisfying (4.2). Now we claim that
[TABLE]
belongs to , where is the set of sequences in with a prefix [math].
First we prove that . Since , by Lemmas 2.1 and 2.5 (i) it follows that
[TABLE]
Then by Lemma 2.2 it suffices to prove
[TABLE]
By (4.1) it follows that for any we have
[TABLE]
which implies that for any . Furthermore, by (4.1) we have
[TABLE]
This, together with (4.2), implies that
[TABLE]
the last equality holds because . Therefore, . Since , we conclude that .
Now take . Then by the above reasoning we also have . In view of Lemma 3.2 the following calculation shows that :
[TABLE]
the last equality holds because . \qed
Remark 4.2
The proof of Lemma 4.1 shows that each has infinitely many representations, i.e., for infinitely many pairs .
The preceding lemma may be improved:
Lemma 4.3
.
Proof 7
By Lemma 4.1 it remains to prove that each belongs to . Set
[TABLE]
By Lemmas 2.5 (iii) and 2.7 (iv) there exists a block with such that
[TABLE]
We claim that
[TABLE]
belongs to .
Since both and belong to , we have
[TABLE]
for all . This implies the relations
[TABLE]
for all . Hence . Since , we conclude that .
Let , then . We complete the proof of by showing that . This follows from the following computation:
[TABLE]
the last equality holds because . \qed
We recall that is the set of having a unique -expansion, is its topological closure, and is the set of having at most one doubly infinite -expansion. We also recall that for all .
Lemma 4.3 allows us to give new characterizations of :
Proposition 4.4
Set
[TABLE]
Then .
Proof 8
We already know from Theorem 1.1 (i) that
[TABLE]
Since for all , we have
[TABLE]
Since for all by Lemma 2.8 (i), we infer from Lemma 4.1 that
[TABLE]
Combining this with (4.4) we conclude that .
Next, since for all by Lemma 2.8 (ii), using also Lemma 4.3 we obtain that
[TABLE]
Observe that the condition is satisfied for because . This implies that . Combining this with (4.4) and we conclude that . \qed
Lemma 4.5
* is compact.*
Proof 9
Since is bounded, it suffices to prove that its complement is open. Since by Theorem 1.1 (iv) that has a smallest point , it suffices to show that is a neighborhood of each of its points.
Fix arbitrarily. Since , we have by Lemma 4.3. Consider the connected component of the open set that contains .
Since , by Lemma 2.8 (i) the set is compact, and hence is compact. Since by Theorem 1.1 (i) that is equivalent to , hence .
By Lemma 2.8 (iii) we have for all . Therefore the sets depend continuously on , and hence the inequality remains valid in a small neighborhood of . Then , i.e., for all . \qed
Next we improve Lemma 4.3: each is even an accumulation point of . In fact, the following stronger result holds:
Lemma 4.6
.
Proof 10
In view of Lemma 4.1 it suffices to show that each belongs to .
Take arbitrarily. By Lemma 2.7 there exists a word with such that
[TABLE]
where is defined in (4.3). The proof of Lemma 4.3 shows that , where
[TABLE]
Set
[TABLE]
We claim that for all and .
It suffices to prove that
[TABLE]
Since and , we infer from Lemmas 2.1 and 2.5 that
[TABLE]
It remains to prove (4.5) for . Since we have
[TABLE]
and this implies (4.5).
We have shown that for all and . Since , using the equality it follows that
[TABLE]
By Lemma 3.4 this implies that has a unique root in , and then it belongs to . Since strictly increases to as , we conclude by Lemma 3.5 and continuity that as .
By the same argument as above we can also show that for each fixed ,
[TABLE]
where
[TABLE]
Therefore . \qed
Now we apply the above results to prove some theorems stated in the introduction:
Proof of Theorem 1.3 1
We combine Proposition 4.4 and Theorem 1.1 (i). \qed
Proof of Theorem 1.5 (i)-(iv) 1
(i)-(iii) were established in Lemmas 4.5, 4.3 and 4.6, respectively.
(iv) We know that the smallest element of is isolated. The second smallest element of belongs to (it is the smallest element in after ), hence it is the smallest accumulation point of by the preceding lemma. Indeed, satisfies . Hence , so that by Lemma 2.5. \qed
Theorem 1.5 (v)-(vi) will be proved in Section 7 below.
Proof of Theorem 1.7 (i)-(iii) 1
(i) and (ii) coincide with Lemmas 4.1 and 4.6, respectively. (iii) follows from Lemma 4.6 and Theorem 1.5 (iv). \qed
Theorem 1.7 (iv)-(vi) will be proved in Sections 6 and 7 below.
5 Explicit description of unique expansions
In this section we give the detailed description of unique expansions. This will be used to investigate the derived sets and in the next sections.
We recall that is a Cantor set, and its smallest element is the Komornik–Loreti constant . Furthermore, its complement is the union of countably many disjoint open intervals:
[TABLE]
where runs over and runs over a proper subset of , formed by the de Vries–Komornik numbers. The first connected component is . Each left endpoint is an algebraic integer, and each right endpoint is a transcendental number.
Since , we have with a smallest periodic block satisfying
[TABLE]
for all . This implies that . Here we use the convention for , although is not a -expansion of . However is a -expansion of in the natural sense. (We have not defined -expansions for .)
We will say that the interval is the connected component of generated by . In particular, the interval is called the connected component of generated by the word .
We recall that is the set of bases such that has a unique doubly infinite -expansion, and that . Furthermore, for each connected component of , we have
[TABLE]
where and as . Therefore
[TABLE]
Let be the connected component of generated by . We define a sequence of words recursively by the formulas and
[TABLE]
For example,
[TABLE]
Observe that is a word of length .
We recall from [20, 7, 9] the relations
[TABLE]
for all It follows that the infinite sequence begins with
[TABLE]
The construction shows that for the quasi-greedy expansion is the truncated Thue-Morse sequence (see Section 7).
The main purpose of this section is to describe explicitly the difference sets for all for any connected component of .
We need the following result from [21]:
Lemma 5.1
Let be a connected component of generated by , and let .
If for some and for some , then the next block of length is
[TABLE]
- 2.
Symmetrically, if for some and for some , then the next block of length is
[TABLE]
We also need [21, Lemma 4.2]:
Lemma 5.2
Let be a connected component of generated by . Then for any the word satisfies
[TABLE]
for all .
Now we prove the main result of this section:
Theorem 5.3
Let be a connected component of generated by . Then is formed by the sequences of the form
[TABLE]
and their reflections, where the word satisfies for all , and the indices , , satisfy the following conditions:
[TABLE]
Remark 5.4
We may assume in Theorem 5.3 that whenever and . Indeed, in case the word is missing, and we may renumber the blocks.
Proof 11
First we show that each sequence in or its reflection is of the form (5.4).
Fix arbitrarily. There exists a smallest integer such that
[TABLE]
or
[TABLE]
Since the reflection of also belongs to , we may assume that (5.5) holds.
Then setting we have
[TABLE]
and for we have
[TABLE]
Indeed, (5.6) follows from the relations
[TABLE]
because both and start with , while (5.7) follows from the minimality of implying
[TABLE]
because begins with .
We claim that the word satisfies for all . Since by Lemma 2.2, it suffices to prove for each the relations
[TABLE]
If , then and . Otherwise the relations follow from (5.7) because each begins with by (5.6), and begins with .
If , then it is of the form (5.4). Otherwise there is a largest integer satisfying . Then by (5.5) and we have
[TABLE]
Let be the largest integer such that .
Since and
[TABLE]
by Lemma 5.1 and the maximality of the next block of length must be
[TABLE]
Then Lemma 5.1 implies that the next block of length is
[TABLE]
Hence
[TABLE]
or
[TABLE]
In the first subcase we either have
[TABLE]
or there exists a largest integer and a largest integer such that
[TABLE]
In the second subcase there exists a largest integer such that
[TABLE]
Using (5.8)–(5.10) we see that if starts with where is the largest such index, then three possibilities may occur:
- (i)
; 2. (ii)
* starts with for some and a maximal ;* 3. (iii)
* starts with for some and a maximal .*
Repeating the above reasoning in Subcase (ii) for sequences starting with , we have three possibilities:
- (iia)
* for some ;* 2. (iib)
* starts with for some and a maximal ;* 3. (iic)
* starts with for some and a maximal .*
Repeating the above reasoning in Subcase (iii) for sequences starting with , we have three possibilities again:
- (iiia)
; 2. (iiib)
* starts with*
[TABLE]
for some and a maximal ; 3. (iiic)
* starts with*
[TABLE]
for some and a maximal .
Iterating this reasoning in subcases (iib), (iic), (iiib) and (iiic) we obtain eventually that
[TABLE]
with as specified in the statement of the theorem.
Now we prove that, conversely, each sequence of the form (5.4) belongs to . Take a sequence of form (5.4). By Lemma 2.2 it suffices to prove that
[TABLE]
Write and . We distinguish three cases.
First case: .* Since is strictly increasing as , there exists a large integer such that*
[TABLE]
the second inequality of each line follows from the relations for all .
Second case: .* Writing again, we observe that*
[TABLE]
and therefore
[TABLE]
We infer from Lemma 5.2 that
[TABLE]
Hence
[TABLE]
and
[TABLE]
Since begins with , in view of (5.12) they imply (5.11).
T**hird case: . Write for By definition is a prefix of for all . By Lemma 5.2 the following strict inequalities hold for all and :
[TABLE]
Since is a prefix of whenever , it follows that satisfies (5.11).
Furthermore, we note that and that the words are forbidden in for all . We conclude that all sequences of the form (5.4) belong to . By symmetry this completes the proof. \qed
Now we recall that is the set of sequences with . Let be a connected component of generated by and write as above. Then for each we have . We are going to describe for any . This is based on the following lemma:
Lemma 5.5
Let be a connected component of generated by . Suppose . Then for any the words and its reflection are forbidden in the language of .
Proof 12
Since is reflection invariant, it suffices to prove that is forbidden.
Assume on the contrary that there exists a sequence with . Since it follows that , and then by Lemma 2.2. This implies that
[TABLE]
On the other hand, since , we have by Lemma 2.2. Combining with (5.13) this yields that
[TABLE]
A similar argument shows that if , then the next block of length is .
Iterating the above reasoning we conclude that if has a word then it will eventually end with . This contradicts our initial assumption . \qed
Theorem 5.3 and Lemma 5.5 imply the following
Corollary 5.6
Let be a connected component of generated by , and let with . If for some , then all elements of are given by
[TABLE]
where the nonempty word satisfies for all , and
[TABLE]
Remark 5.7
**
We emphasize that the initial word cannot be empty. For otherwise the corresponding sequence might begin with the digit for , while the sequences in start with [math].
- 2.
If , then the initial word is simply of the form because .
6 Proof of Theorem 1.7 (iv)
Based on the results of the preceding section, in this section we investigate the derived sets
Since by Lemma 4.1, it suffices to investigate the derived sets in each connected component of .
In the following we consider an arbitrary connected component of generated by satisfying (5.2), and we write with as usual, so that
[TABLE]
By Corollary 5.6 and Lemma 3.2 for each there exist two words satisfying for all , and a pair of vectors
[TABLE]
satisfying the statements in Corollary 5.6 such that with an obvious notation. We mention that a may have multiple representations (see Remark 4.2).
We have the following result:
Lemma 6.1
Let be a connected component of generated by and write with Suppose
[TABLE]
for some , where the words satisfy for all , and the vectors
[TABLE]
(Here we use the convention that if and if .) Then .
Moreover, in case and then there exist two sequences in such that and as .
Proof 13
For the lemma follows from Corollary 5.6 and Lemma 3.2. Proceeding by induction on , assume that the assertion is true for some , and consider .
Take a point such that for all , and
[TABLE]
satisfy
[TABLE]
We will show that by distinguishing the cases
[TABLE]
First case:* . Since and , (6.1) implies that or . Without loss of generality we assume , and we consider for each the vectors*
[TABLE]
Applying the induction hypothesis, it follows by continuity that
[TABLE]
for all sufficiently large . Writing
[TABLE]
for convenience, we have
[TABLE]
Therefore, using Lemma 3.5 we obtain that for sufficiently large the sequences
[TABLE]
belong to and
[TABLE]
In particular, .
Second case:* . We obtain similarly to the preceding case that there exists a sequence satisfying as . Therefore, as required. \qed*
Proposition 6.2
Let be a connected component of generated by and write with . Then
[TABLE]
Remark 6.3
The assumption cannot be omitted. Indeed, for we know that . Since , this implies that
[TABLE]
Proof 14
Let , and set
[TABLE]
and
[TABLE]
Note that . Take with . Then begins with . Pick . Using Lemma 5.2 we see that
[TABLE]
and
[TABLE]
for all . Hence , and therefore for all . It follows from Corollary 5.6 that the sequences
[TABLE]
also belong to . We are going to prove that and . It will then follow by Lemmas 3.2 and 3.4 that has a (unique) zero in , and then Lemma 6.1 will imply that .
It remains to prove the two inequalities. Since and for all , we have
[TABLE]
for all . Since and the word is of length , we infer from (6.2) that
[TABLE]
because
[TABLE]
for all . Indeed, starts with
[TABLE]
Next we observe that . Therefore, using (6.2) we have
[TABLE]
We observe that
[TABLE]
If , then
[TABLE]
so that
[TABLE]
and thus as required.
The relation (6.3) and hence the proof of remains valid if and contains at least one zero digit.
In the remaining case we have and
[TABLE]
for some .
If , then
[TABLE]
so that (6.4) holds again.
Finally, if , then (6.4) takes the form
[TABLE]
This is equivalent to
[TABLE]
and this holds because the unique positive root of the polynomial is greater than . \qed
Proof of Theorem 1.7 (iv) 1
It follows from Proposition 6.2 that
[TABLE]
for all connected components of . This implies that all sets have infinitely many accumulation points in . \qed
7 Proof of Theorem 1.5 (v)-(vi) and Theorem 1.7 (v)-(vi)
In this section we focus on the derived sets of in the first connected component of , generated by .
Note that
[TABLE]
where the numbers satisfy
[TABLE]
Here
[TABLE]
is the truncated Thue–Morse sequence. We recall that the complete Thue–Morse sequence is defined by the formulas and
[TABLE]
The first five elements of the sequence are the following:
[TABLE]
Note that is the Golden Ratio and is the smallest accumulation point of by Theorem 1.5.
Since for , Corollary 5.6 and Remark 5.8 yields the following description of for any :
Corollary 7.1
If for some , then the elements of are given by the formula
[TABLE]
where
[TABLE]
Examples 7.2
**
- (i)
If , then , then
[TABLE] 2. (ii)
If , then
[TABLE] 3. (iii)
If , then
[TABLE]
Using Corollary 7.1 we may strengthen a result of Sidorov [27]:
Proposition 7.3
Each is an algebraic integer. Hence is a countable set.
Proof 15
If , then there exist satisfying by Lemma 3.1. Since the sequences are eventually periodic by Corollary 7.1, the last equality takes the form
[TABLE]
with suitable polynomials of integer coefficients, satisfying the conditions
[TABLE]
Furthermore, are of the form with suitable positive integers . Hence is a zero of the polynomial
[TABLE]
We conclude by observing that this polynomial is monic by the special form of , mentioned above. \qed
If , then by Corollary 7.1 each sequence is uniquely determined by a vector
[TABLE]
with the components as in the statement of Corollary 7.1. Observe that has components if , while if .
For convenience we set
[TABLE]
When we set . We infer from Lemma 3.2 that for each there exists a pair of vectors
[TABLE]
such that setting the equality holds. In this cases we denote by .
Remark 7.4
We do not rule out the possibility that an element has multiple representations by different pairs of vectors and . See Lemma 7.7 below and Question 6 at the end of the paper.
In order to investigate the topology of we need the following elementary result, probably first published by Kürschák [24]:
Lemma 7.5
**
- (i)
Every sequence of real numbers has a monotone subsequence. 2. (ii)
Every sequence in has either a strictly increasing or a constant subsequence.
Proof 16
(i) See, e.g., [17, Theorem 1.1 (a), p. 6].
(ii) If does not have a constant subsequence, then occurs at most finitely many times, and therefore has a monotone subsequence . Since has no constant subsequences either, it has a strictly monotone further subsequence. It is necessarily increasing because there is no strictly decreasing sequence of nonnegative integers. \qed
Lemma 7.6
If a sequence*
[TABLE]
converges to some point with , then there exists a subsequence in which each component sequence is either constant or strictly increasing.
Proof 17
Observe that there are only finitely many possibilities for the vectors and . Then there exists a subsequence such that
[TABLE]
for all , where . (The letters denote superscripts, not exponents.)
Applying Lemma 7.5 (ii) repeatedly to each component sequence and , we obtain after steps a subsequence where each component sequence is either constant or strictly increasing. \qed
We have seen in Remark 4.2 that an element may have infinitely many representations, i.e., we may have for infinitely many pairs of sequences . For we may have only finitely many representations:
Lemma 7.7
No element may be represented by infinitely many pairs of vectors and .*
Proof 18
Assume that with for a sequence of distinct pairs of vectors and . By the preceding lemma we may assume, by taking a subsequence, that each component sequence is either constant or increasing. By Lemma 3.5 each component sequence has to be constant, contradicting the choice of and . \qed
Now we investigate the derived sets in . In this case we may improve Lemma 6.1 by giving a complete characterization of .
Proposition 7.8
Let be a connected component of for some , and let . A point belongs to if and only if for some pair of vectors
[TABLE]
satisfying the condition
[TABLE]
where we write if and if .
Furthermore, for all .
Proof 19
The sufficiency follows from Lemma 6.1. We prove the necessity by induction on .
For the necessity follows from Corollary 7.1 and Lemma 3.2. Now assume that the necessity holds for some , and take arbitrarily. Then there exists a sequence converging to , and we may write
[TABLE]
By Lemma 7.5 we may even assume that the vectors do not depend on , so that we may write simply , and that each component sequence in and is either constant or strictly increasing. Since the numbers are different, at least one of these component sequences is strictly increasing. We may thus write
[TABLE]
with
[TABLE]
by the induction hypothesis. Letting at least one of the components of or becomes infinite, so that we obtain where
[TABLE]
with , and hence
[TABLE]
as claimed.
Note by Theorem 1.1 that . Furthermore, since and by Theorem 1.1 that , we have . If there exists a for some , then we infer from (7.1) that , so that with . Then
[TABLE]
and hence , contradicting our assumption . \qed
Remark 7.9
In the proof of Proposition 7.8 the selected subsequence is monotonic. Indeed, if is the smallest index tending to infinity as , then the corresponding sequence is strictly increasing if , and strictly decreasing if .
Proof of Theorem 1.5 (v) and (vi) 1
(v) was established in Proposition 7.3.
(vi) Since is an infinite set, it suffices to prove the density. Assume on the contrary that there exist an integer , a point and a closed neighborhood of such that has no isolated points of . We may assume that . Then all points of the closed set are accumulation points, so that it is a non-empty perfect set, and hence it is uncountable by a classical theorem of topology. This contradicts the countability of by Proposition 7.3. \qed
Proof of Theorem 1.7 (v) and (vi) 1
(v) The inequalities follow from Theorem 1.1 (iv) for , from Theorem 1.7 (iii) for , and from Propositions 6.2 and 7.8 for .
Since the sequence is non-decreasing by definition, its limit satisfies the inequalities
[TABLE]
Since by Theorem 1.7 (i), the claimed limit relations follow.
(vi) We may repeat the proof of Theorem 1.5 (vi) by changing to everywhere. \qed
8 Local dimension of : proof of Theorem 1.9
Since is at most countable by Proposition 7.3, Theorem 1.9 is trivial for . Henceforth we assume that .
For the proof we recall the following result on Hausdorff dimension and Hölder continuous maps (cf. [13]):
Lemma 8.1
Let be a Hölder map between two metric spaces, i.e., there exist two constants and such that
[TABLE]
for any . Then .
Given and , set
[TABLE]
The map
[TABLE]
is well-defined and onto by Lemmas 3.2 and 3.4. Furthermore, by Lemma 3.5 the map is strictly decreasing with respect to each of the vectors and with .
We recall that the symbolic space is compact with respect to the metric defined by
[TABLE]
In the following lemma we show that the map is also Hölder continuous with respect to the product metric on defined by
[TABLE]
for any .
Lemma 8.2
Let and . Then the function is Hölder continuous of order with respect to the product metric on .
Proof 20
Fix and arbitrarily. Let , and consider their images and in . Without loss of generality we may assume and . Then there exist positive integers and such that
[TABLE]
The definitions of and imply that
[TABLE]
Hence
[TABLE]
Since , we have
[TABLE]
Similarly, we also have
[TABLE]
Therefore, using (8.1) it follows that
[TABLE]
On the other hand, since , we have
[TABLE]
Comining with (8.2) we conclude that
[TABLE]
where the fractional term on the right hand side is positive since and . \qed
Proof of Theorem 1.9 1
Let and . Using Lemmas 8.1 and 8.2 we get
[TABLE]
where the last inequality follows because is a subset of . Observe that is a fractal set whose Hausdorff dimension is given by
[TABLE]
Hence, using (8.3) we obtain that
[TABLE]
Letting and applying Lemma 2.4 we conclude that
[TABLE]
\qed
9 Final remarks
In this section we present some open questions.
We have seen that has infinitely many isolated points in .
Question 1. Does have any isolated points greater than ?
By Theorems 1.1 and 1.9 there exists a smallest number such that .
Question 2. What is this smallest number ?
Sidorov proved in [27] that is an accumulation point of , and then Baker proved in [2] that is in fact its smallest accumulation point.
We have shown in Theorem 1.5 that is the smallest accumulation point of and of .
Question 3. What is the smallest element of for
Question 4. What is the smallest accumulation point of for ? (This question has already been raised in [3].)
We have shown in Theorem 1.5 that is closed, and it was proved in [29] by Zou and Kong that is not closed.
Question 5. Are the sets closed or not for ?
Recently, the second author and his coauthors studied in [23] the smallest element of for multiple digit sets . The ideas and methods in this paper might also be useful to further explore in the multiple digit set case. For this extension the main difficulty we may encounter is the characterization of as in Section 3. Furthermore, a generalization of Theorem 5.3 for the explicit description of is also needed.
Each has infinitely many representations by Remark 4.2, and this cannot happen for by Lemma 7.7.
In the last three questions we consider the elements of .
Question 6. Is the representation of each unique?
Question 7. Is it true that is isolated from the left in ?
Question 8. Is it possible that for some ?
Acknowledgements
The authors thank the anonymous referee for many useful suggestions. The second author was supported by NSFC No. 11401516. He would like to thank Professor Yann Bugeaud for his hospitality when he visited Strasbourg University in November, 2016.
References
- [1]
C. Baiocchi, V. Komornik, Greedy and quasi-greedy expansions in non-integer bases, arXiv:0710.3001v1.
- [2]
S. Baker, On small bases which admit countably many expansions, J. Number Theory 147 (2015) 515–532.
- [3]
S. Baker, N. Sidorov, Expansions in non-integer bases: lower order revisited, Integers 14 (2014) Paper No. A57, 1–15.
- [4]
C. Bonanno, C. Carminati, S. Isola, G. Tiozzo, Dynamics of continued fractions and kneading sequences of unimodal maps, Discrete Contin. Dyn. Syst. 33 (4) (2013) 1313–1332.
- [5]
K. Dajani, M. de Vries, Invariant densities for random -expansions, J. Eur. Math. Soc. (JEMS) 9 (1) (2007) 157–176.
- [6]
Z. Daróczy, I. Kátai, On the structure of univoque numbers, Publ. Math. Debrecen 46 (3-4) (1995) 385–408.
- [7]
M. de Vries, V. Komornik, Unique expansions of real numbers, Adv. Math. 221 (2) (2009) 390–427.
- [8]
M. de Vries, V. Komornik, Expansions in non-integer bases, Combinatorics, words and symbolic dynamics, Encyclopedia Math. Appl., vol. 159, Cambridge Univ. Press, Cambridge, 2016, pp. 18–58.
- [9]
M. de Vries, V. Komornik, P. Loreti, Topology of the set of univoque bases, Topology Appl. 205 (2016) 117–137.
- [10]
P. Erdős, I. Joó, V. Komornik, Characterization of the unique expansions and related problems, Bull. Soc. Math. France 118 (1990) 377–390.
- [11]
P. Erdős, M. Horváth, I. Joó, On the uniqueness of the expansions , Acta Math. Hungar. 59 (3-4) (1991) 333–342.
- [12]
P. Erdős, I. Joó, On the number of expansions , Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 35 (1992) 129–132.
- [13]
K. Falconer, Fractal geometry, John Wiley & Sons Ltd., Chichester, 1990, Mathematical foundations and applications.
- [14]
P. Glendinning and N. Sidorov, Unique representations of real numbers in non-integer bases, Math. Res. Lett. 8 (2001) 535–543.
- [15]
V. Komornik, Expansions in noninteger bases, Integers 11B (2011) Paper No. A9, 1–30.
- [16]
V. Komornik, Unique infinite expansions in noninteger bases, Acta Math. Hungar. 134 (3) (2012) 344–355.
- [17]
V. Komornik, Lectures on functional analysis and the Lebesgue integral, Universitext, Springer-Verlag, London, 2016, Translated from the 2002 French original.
- [18]
V. Komornik, D. Kong, W. Li, Hausdorff dimension of univoque sets and devil’s staircase, Adv. Math. 305 (2017) 165–196.
- [19]
V. Komornik, P. Loreti, Unique developments in non-integer bases, Amer. Math. Monthly 105 (7) (1998) 636–639.
- [20]
V. Komornik, P. Loreti, On the topological structure of univoque sets, J. Number Theory 122 (1) (2007) 157–183.
- [21]
D. Kong, W. Li, Hausdorff dimension of unique beta expansions, Nonlinearity 28 (1) (2015) 187–209.
- [22]
D. Kong, W. Li, F. Lü, M. de Vries, Univoque bases and hausdorff dimension, Monatsh. Math. 184 (3) (2017) 443–458.
- [23]
D. Kong, W. Li, Y. Zou, On small bases which admit points with two expansions, J. Number Theory 173 (2017) 100–128.
- [24]
J. Kürschák, Analízis és analitikus geometria [Analysis and analytic geometry], Budapest, 1920.
- [25]
W. Parry, On the -expansions of real numbers, Acta Math. Acad. Sci. Hungar. 11 (1960) 401–416.
- [26]
N. Sidorov, Almost every number has a continuum of -expansions, Amer. Math. Monthly 110 (9) (2003) 838–842.
- [27]
N. Sidorov, Expansions in non-integer bases: lower, middle and top orders, J. Number Theory 129 (4) (2009) 741–754.
- [28]
W. Steiner, Review of the paper [16], Mathematical Reviews, MR2886211.
- [29]
Y. Zou, D. Kong, On a problem of countable expansions, J. Number Theory 158 (2016) 134–150.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. Baiocchi, V. Komornik, Greedy and quasi-greedy expansions in non-integer bases, ar Xiv:0710.3001 v 1.
- 2[2] S. Baker, On small bases which admit countably many expansions, J. Number Theory 147 (2015) 515–532.
- 3[3] S. Baker, N. Sidorov, Expansions in non-integer bases: lower order revisited, Integers 14 (2014) Paper No. A 57, 1–15.
- 4[4] C. Bonanno, C. Carminati, S. Isola, G. Tiozzo, Dynamics of continued fractions and kneading sequences of unimodal maps, Discrete Contin. Dyn. Syst. 33 (4) (2013) 1313–1332.
- 5[5] K. Dajani, M. de Vries, Invariant densities for random β 𝛽 \beta -expansions, J. Eur. Math. Soc. (JEMS) 9 (1) (2007) 157–176.
- 6[6] Z. Daróczy, I. Kátai, On the structure of univoque numbers, Publ. Math. Debrecen 46 (3-4) (1995) 385–408.
- 7[7] M. de Vries, V. Komornik, Unique expansions of real numbers, Adv. Math. 221 (2) (2009) 390–427.
- 8[8] M. de Vries, V. Komornik, Expansions in non-integer bases, Combinatorics, words and symbolic dynamics, Encyclopedia Math. Appl., vol. 159, Cambridge Univ. Press, Cambridge, 2016, pp. 18–58.
