This paper investigates the Hausdorff dimension of sets related to Diophantine approximation under $eta$-transformations, providing explicit dimension calculations for sets defined by approximation conditions.
Contribution
It introduces a novel analysis of Diophantine approximation sets for $eta$-transformations and computes their Hausdorff dimensions, extending understanding of orbit approximation properties.
Findings
01
Calculated Hausdorff dimension of $igcap ext{sets}$
02
Established dimension estimates for approximation sets
03
Extended results to general $eta$-transformations
Abstract
Let Tβ be the β-transformation on [0,1) defined by Tβ(x)=βx mod 1. We study the Diophantine approximation of the orbit of a point x under Tβ. Precisely, for given two positive functions ψ1,ψ2:N→R+, define L(ψ1):={x∈[0,1]:Tβnx<ψ1(n), for infinitely many n∈N},U(ψ2):={x∈[0,1]:∀N≫1,∃n∈[0,N],s.t.Tβnx<ψ2(N)}, where ≫ means large enough. We compute the Hausdorff dimension of the set L(ψ1)∩U(ψ2). As a corollary, we estimate the Hausdorff dimension of the set U(ψ2).
Equations514
Tβ(x)=βx mod 1.
Tβ(x)=βx mod 1.
L(ψ1):={x∈[0,1]:Tβnx<ψ1(n), for infinitely many n∈N},
L(ψ1):={x∈[0,1]:Tβnx<ψ1(n), for infinitely many n∈N},
U(ψ2):={x∈[0,1]:∀N≫1,∃n∈[0,N],s.t.Tβnx<ψ2(N)},
U(ψ2):={x∈[0,1]:∀N≫1,∃n∈[0,N],s.t.Tβnx<ψ2(N)},
∥nθ∥<Q−1,
∥nθ∥<Q−1,
∥nθ∥<n−1.
∥nθ∥<n−1.
Lψ:={θ∈R:∥nθ∥<ψ(n), for infinitely many n∈N}
Lψ:={θ∈R:∥nθ∥<ψ(n), for infinitely many n∈N}
{θ∈R:∥nθ∥<nτ1, for infinitely many n∈N}
{θ∈R:∥nθ∥<nτ1, for infinitely many n∈N}
{x∈M:Tnx∈B(n), for infinitely many n∈N},
{x∈M:Tnx∈B(n), for infinitely many n∈N},
Tβ(x):=βx−⌊βx⌋,
Tβ(x):=βx−⌊βx⌋,
L(ψ,x0):={x∈[0,1]:∣Tβnx−x0∣<ψ(n), for infinitely many n∈N}.
L(ψ,x0):={x∈[0,1]:∣Tβnx−x0∣<ψ(n), for infinitely many n∈N}.
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 Mathematical Theories and Applications
Full text
Dimension theory of Diophantine approximation related to β-transformations
Wanlou Wu
Department of Mathematics, Soochow University, Suzhou, 215006, China
Laboratoire d’Analyse et de Mathématiques Appliquées, Université Paris-Est Créteil Val de Marne, Créteil, 94010, France
Let Tβ be the β-transformation on [0,1) defined by
[TABLE]
We study the Diophantine approximation of the orbit of a point x under Tβ. Precisely, for given two positive functions ψ1,ψ2:N→R+, define
[TABLE]
[TABLE]
where ≫ means large enough. We compute the Hausdorff dimension of the set L(ψ1)∩U(ψ2). As a corollary, we estimate the Hausdorff dimension of the set U(ψ2).
1. Introduction
Diophantine approximation, which originaly asks how closely can a given irrational number be approximated by a rational number p/q with denominator q no larger than a fixed positive integer q0, has been widely studied by mathematicians. In 1842, Dirichlet [5] proved the following theorem.
Dirichlet Theorem Given two real numbers θ,Q with Q≥1, there is an integer n with 1≤n≤Q such that
[TABLE]
where ∥ξ∥ denotes the distance from ξ to the nearest integer.
Dirichlet Theorem is called a uniform approximation theorem in [18, pp.2]. A weak form of Dirichlet Theorem, called an asymptotic approximation theorem in [18, pp.2], which was often refered to as a corollary of Dirichlet Theorem in the litterature has already existed in the book of Legendre [12, 1808, pp.18-19] (using a continued fraction fact): for any real number θ, there are infinitely many n∈N such that
[TABLE]
For the general case, Khintchine in 1924 [11] showed that for a positive function ψ:N→R+, if x↦xψ(x) is non-increasing, then
[TABLE]
has Lebesgue measure zero if the series ∑ψ(n) converges and has full Lebesgue measure otherwise. In the case where the set has Lebesgue measure zero, it is natural to calculate the Hausdorff dimension of Lψ. The first result on the Hausdorff dimension of Lψ dates back to Jarník-Bosicovitch Theorem [2, 10]. It was shown that the set
[TABLE]
has Hausdorff deminsion 1+τ2, for any τ>1.
In analogy with the classical Diophantine approximation, Hill and Velani [9] studied the approximation properties of the orbits of a dynamical system and introduced the so called shrinking target problems: for a measure preserving transformation T:M→M on a manifold M, what is the size (Lebesgue measure, Hausdorff dimension) of the set
[TABLE]
where B(n)=B(x0,r(n)) is a ball centred at x0 with radius r(n)(r(n)→0)? They answered the case where T is an expanding rational map of the Riemann sphere C=C∪{∞}.
In this papper, we are interested in the approximation properties of the orbits of β-transformations. The β-transformation Tβ(β>1) on [0,1) is defined by
[TABLE]
where ⌊⋅⌋ is the integer part function. For any positive function ψ:N→R+, define the set of ψ-well asymptotically approximable points by x0 as
[TABLE]
By [15, Theorem 2A, B, C], the set L(ψ,x0) has Lebesgue measure zero if and only if the series ∑ψ(n) converges. Shen and Wang [17, Theorem 1.1] established the following result on the Hausdorff dimension of L(ψ,x0).
Theorem SW([17, Theorem 1.1]) For any real number β>1 and any point x0∈[0,1], one has
[TABLE]
Parallel to the asymptotic approximation theorem, it is also worth of studying the uniform approximation properties as in Dirichlet Theorem. The uniform Diophantine approximation related to β-transformations was studied by Bugeaud and Liao [4]. For x∈[0,1), let
[TABLE]
[TABLE]
Bugeaud and Liao [4] proved the following theorem.
Theorem BL ([4, Theorem 1.4]) For any v∈(0,+∞) and any v^∈(0,1), if v<v^/(1−v^), then the set
[TABLE]
is empty. Otherwise,
[TABLE]
The exponents νβ and ν^β were introduced in [1](see also [3, Ch.7]). They are strongly related to the run-length function of β-expansions (see [19]). The aim of this paper is to study the Diophantine approximation sets in [4] when the approximation speed function n↦β−nv is replaced by a general positive function. More precisely, fix two positive functions ψ1,ψ2:N→R+, and define
[TABLE]
[TABLE]
We will estimate the Hausdorff dimension of the sets L(ψ1)∩U(ψ2) and U(ψ2). Let
[TABLE]
[TABLE]
If v1<0, by the definition of v1, there is a sequence {nj} such that
[TABLE]
Then, for ε>0 small enough, there exists an integer j0 such that
[TABLE]
By the fact Tβnx<1, for any x∈[0,1) and any n∈N, for any x∈[0,1), we have Tβnjx<1<ψ1(nj). This implies
[TABLE]
On the other hand, if we take all the integers ni with the following property
[TABLE]
then for any x∈[0,1) and any integer n∈[1,ni], we have Tβnx<1<ψ2(ni). Thus, we can replace ψ2(n) by the function
[TABLE]
The size (Lebesgue measure, Hausdorff dimension) of the sets L(ψ1)∩U(ψ2) and U(ψ2) are the same as that of the sets L(ψ1)∩U(ψ2) and U(ψ2). Therefore, in this paper, we always assume v1≥0 and v2≥0. We establish the following theorems on the Hausdorff dimension of the set L(ψ1)∩U(ψ2).
Theorem A**.**
(1)
If v1=v1=v2=v2=0, then
[TABLE]
2. (2)
If v2=∞ and 0≤v1≤v1≤∞, then L(ψ1)∩U(ψ2) is countable.
3. (3)
If v1=∞ and 0≤v2≤v2≤∞, then dimH(L(ψ1)∩U(ψ2))=0.
Remark**.**
For Item (1), the set L(ψ1)∩U(ψ2) is not necessary of full Lebesgue measure. In fact, if the series ∑ψ1(n) converges, by [15, Theorem 2A, B, C],
[TABLE]
where m(A) denotes the Lebesgue measure of A. However, the set L(ψ1)∩U(ψ2) can also be of full Lebesgue measure. For example, if ψ1(n)=ψ2(n)=1/n, according to Dmitry, Konstantoulas, and Florian [6, Theorem 1.1],
[TABLE]
For Item (3), if v2=∞, then L(ψ1)∩U(ψ2) is countable. If 1<v2<∞, then L(ψ1)∩U(ψ2) is empty (see Lemma 3.5). If 0<v2≤1, then L(ψ1)∩U(ψ2) is uncountable (see Proposition 3.6).
Theorem B**.**
If v2>1, then L(ψ1)∩U(ψ2) is countable. If v1/(2+v1)≤v2≤1<v2, then
[TABLE]
If v1/(2+v1)<v2≤v2≤1 and v1/(2+v1)<v2, then
[TABLE]
If v2≤v1/(2+v1) and v1/(2+v1)<v2≤1, then
[TABLE]
If v1/(2+v1)<v2≤v2≤v1/(2+v1), then
[TABLE]
If v2≤v1/(2+v1) and v2≤v1/(2+v1), then
[TABLE]
We remark that Theorems A and B give all the cases. We also estimate the Hausdorff dimension of U(ψ2).
Theorem C**.**
If v2>1, then U(ψ2) is countable. If v2≤1<v2, then
[TABLE]
If v2≤1, then
[TABLE]
We will show in Examples 5.1, 5.2, 5.3, 5.4, 5.5, 5.6 and 5.7, that the upper and lower bound of the Hausdorff dimension in Theorems B and C can be all reached. When v1=v1=0, we have the result as Theorem D.
Theorem D**.**
Assume v1=v1=0. If v2>0, then U(ψ2)⊆L(ψ1).
Our paper is organized as follows. We recall some classical results of the theory of β-expansion in Section 2. Theorems A and B are proved in Section 3. Section 4 establishes Theorems C and D. In Section 5, we give examples to show that the estimations in Theorems B and C are sharp.
2. β-expansions
The notion of β-expansion was introduced by Rényi [16] in 1957. For any β>1, the β-transformation Tβ on [0,1) is defined by
[TABLE]
where ⌊ξ⌋ denotes the largest integer less than or equal to ξ. Let
[TABLE]
Definition 2.1**.**
The β-expansion of a number x∈[0,1) is the sequence {εn}n≥1:={εn(x,β)}n≥1 of integers from {0,1,⋯,⌈β⌋} such that
[TABLE]
where
[TABLE]
We also write dβ(x)=(ε1,⋯,εn,⋯).
We can extend the definition of the β-transformation to the point 1 as:
[TABLE]
One can obtain
[TABLE]
where \varepsilon_{1}(1,\beta)=\lfloor\beta\rfloor,~{}\varepsilon_{n}=\lfloor\beta T^{n-1}_{\beta}1\rfloor,~{}\text{for all n\geq 2}. We also write
[TABLE]
If dβ(1) is finite, i.e., there is an integer m>0 such that εm(1,β)=0 and εi(1,β)=0 for all i>m, then β is called a simple Parry number. In this case, the infinite β-expansion of 1 is defined as:
[TABLE]
where (ω)∞ denotes the periodic sequence (ω,ω,⋯). If dβ(1) is infinite, then we define
[TABLE]
Endow the set {0,1,⋯,⌈β⌋}N with the product topology and define the one-sided shift operator σ as:
[TABLE]
for any infinite sequence (ωn)n≥1 in {0,1,⋯,⌈β⌋}N. The lexicographical order <lex on {0,1,⋯,⌈β⌋}N is defined as:
[TABLE]
if ω1<ω1′ or if there is an integer k≥2 such that for all 1≤i<k, ωi=ωi′ but ωk<ωk′. Denote by ω≤lexω′ if ω<lexω′ or ω=ω′.
Definition 2.2**.**
A finite word (ω1,ω2,⋯,ωn) is called β-admissible, if there is x∈[0,1] such that the β-expansion of x begins with (ω1,ω2,⋯,ωn). An infinite sequence (ω1,ω2,⋯,ωn,⋯) is called β-admissible, if there is x∈[0,1] such that the β-expansion of x is (ω1,ω2,⋯,ωn,⋯).
Denote by Σβ the set of all infinite β-admissible sequences and Σβn the set of all β-admissible sequences with length n. The β-admissible sequences are characterized by Parry [14] and Rényi [16].
Theorem 2.3**.**
Let β>1,
(1)
(**[14, Lemma 1]**)
A word ω=(ωn)n≥1∈Σβ if and only if
[TABLE]
2. (2)
(**[14, Lemma 3]**) For any x1,x2∈[0,1], x1<x2 if and only if
an n-th order basic interval with respect to β. Denote by In(x) the n-th order basic interval containing x. The basic intervals are also called cylinders by some authors. It is crucial to estimate the lengths of the basic intervals. We will use the key notion of “full basic interval”as follows (see [13, 8]).
Definition 2.5**.**
For any (ω1,⋯,ωn)∈Σβn, a basic interval In(ω1,⋯,ωn) is said to be full if its length is β−n.
If (ω1,⋯,ωn+1) is a β-admissible sequence with ωn+1=0, then
[TABLE]
is full for any 0≤ωn+1′<ωn+1.
2. (2)
For every ω∈Σβn, if In(ω) is full, then for any ω′∈Σβm, one has
[TABLE]
3. (3)
For any ω∈Σβn, if In+m(ω,ω′) is a full basic interval contained in In(ω) with the smallest order, then
[TABLE]
Next, we define a sequence of numbers βN approaching to β as follows. Let {εk∗(β):k≥1} be the infinite β-expansion of 1. Let βN be the unique real solution of the equation
[TABLE]
Therefore, βN<β and the sequence {βN:N≥1} increases and converges to β when N tends to infinity.
Lemma 2.8**.**
([17, Lemma 2.7]) For every ω∈ΣβNn viewed as an element of Σβn, one has
First, we give an easy fact which is useful for the proofs of Theorems A and B.
Fact 3.1**.**
For any x∈[0,1), if there is an integer n0 such that Tβn0x=0, then
[TABLE]
Now, we prove that if v2=∞, then the Hausdorff dimensions of the sets L(ψ1)∩U(ψ2) and U(ψ2) are zero.
Proposition 3.2**.**
If v2=∞, then U(ψ2)⊆{x∈[0,1]:νβ(x)=∞}. Thus,
[TABLE]
Proof.
For every x∈U(ψ2), we distinguish two cases:
Case 1: There is an integer n0 such that Tβn0x=0. By Fact 3.1, we have
[TABLE]
Case 2: For any n∈N, we always have Tβnx>0. Since x∈U(ψ2), there is N0≥1 such that for any N≥N0, there is an integer n∈[0,N] such that
[TABLE]
Since n→∞limsupn−logβψ2(n)=v2=∞, for any L>0 large enough, there is a sequence {ni} such that ψ2(ni)≤β−niL. Let m1:=min{ni:ni≥N0}, there is an integer j1∈[0,m1] such that
[TABLE]
Take m2:=min{ni>m1:β−niL<Tβj1x}. There is j2∈[0,m2] such that
[TABLE]
Since Tβj2x<ψ2(m2)≤β−m2L<Tβj1x, j2=j1. Repeat this process, one can get a sequence of pairwise disjoint integers {ji:i≥1} such that
[TABLE]
Therefore, νβ(x)≥L. By the arbitrariness of L, we have νβ(x)=∞.
Hence, in all cases, we have
[TABLE]
By Theorem SW,
[TABLE]
∎
We discuss the relation between νβ(x), ν^β(x) and v1, v1, v2, v2, which are important to the proof of Theorem B.
(1) For any x with νβ(x)>v1 and any ε>0 small enough, there is a sequence {ni} such that Tβnix<β−ni(v1+ε). By the definition of v1, for the above ε, there is an integer i0 such that
[TABLE]
Then,
[TABLE]
Thus, x∈L(ψ1). Therefore,
[TABLE]
By similar discussion, {x∈[0,1]:ν^β(x)>v2}⊆U(ψ2). Thus,
[TABLE]
(2) For any x∈L(ψ1), there is a sequence {ni} such that
[TABLE]
By the definition of v1, for any ε>0, there is an integer i0 such that
[TABLE]
Thus, νβ(x)≥v1−ε. Therefore,
[TABLE]
By the arbitrariness of ε, one can obtain
[TABLE]
By similar discussion, U(ψ2)⊆{x∈[0,1]:ν^β(x)≥v2}. Thus,
[TABLE]
∎
To prove Theorem A, we characterize the set of all points x with νβ(x)=∞ and ν^β(x)=∞.
Then Tβnx>0 for every n∈N. Denote the β-expansion of x by
[TABLE]
where ai∈{0,⋯,⌈β⌋}, for all i≥1. We can take two increasing sequences {ni′:i≥1} and {mi′:i≥1} with the following properties:
(1)
For every i≥1, one has
[TABLE]
2. (2)
For every an=0, there is an integer i such that ni′<n<mi′.
By the choices of {ni′:i≥1} and {mi′:i≥1}, for every i≥1, one has ni′<mi′<ni+1′. Since ν^β(x)>0, one has
[TABLE]
Take n1=n1′ and m1=m1′. Suppose that mk,nk have been defined. Let i1=1 and ik+1:=min{i>ik:mi′−ni′>mk−nk},fork≥1. Then, define
[TABLE]
Note that limsupi→∞(mi′−ni′)=∞, the sequence {ik:k≥1} is well defined. By this way, we obtain the subsequences {nk:k≥1} and {mk:k≥1} of {ni′:i≥1} and {mi′:i≥1}, respectively, such that the sequence {mk−nk:k≥1} is non-decreasing. As the similar discussion in [4], one has
[TABLE]
This contradicts our assumption ν^β(x)=∞. Thus, we have proved
[TABLE]
Therefore,
[TABLE]
which implies that the set {x∈[0,1]:ν^β(x)=∞} is countable.
∎
Lemma 3.5**.**
The set {x∈[0,1]:1<ν^β(x)<∞} is empty.
Proof.
This follows from the proof of Item (2) of Lemma 3.4.
∎
Proposition 3.6**.**
The sets
[TABLE]
are uncountable.
Proof.
For any real number a>1, we give a correspondence:
[TABLE]
The infinite string is a β-expansion of some x∈[0,1). Denote this x by xa. Then, we can obtain a correspondence:
[TABLE]
from {a:a>1} to {xa}a>1. One can check νβ(xa)=∞ and ν^β(xa)=1. Therefore,
[TABLE]
For different a1>1 and a2>1, there is a k0∈N+ such that
[TABLE]
Thus, Ψ(a1)=Ψ(a2). Then, Φ(a1)=Φ(a2). Hence, the cardinality of {a:a>1} is less than or equal to that of {xa}a>1. Similarly, the cardinality of {xa:a>1} is less than or equal to that of {x∈[0,1]:νβ(x)=∞} ({x∈[0,1]:ν^β(x)=1}). Since {a:a>1} is uncountable, {x∈[0,1]:νβ(x)=∞} and {x∈[0,1]:ν^β(x)=1} are uncountable.
∎
The argument on the upper bound of the Hausdorff dimension of the set L(ψ1)∩U(ψ2) can be obtained by a natural covering of the set
[TABLE]
According to Theorem A(2) and (3), we only need to consider the case νβ(x)∈[v1,∞) and ν^β(x)∈[v2,∞). For any x∈L(ψ1)∩U(ψ2), there is a number vβ∈[v1,∞) such that
[TABLE]
Denote its β-expansion by
[TABLE]
where ai∈{0,⋯,⌈β⌋}, for all i≥1. Since νβ(x)<∞, Tβnx>0 for all n≥0. By the same way as Lemma 3.4, we take the maximal subsequences {nk:k≥1} and {mk:k≥1} of {ni′:i≥1} and {mi′:i≥1}, respectively. Notice βnk−mk<Tβnkx<βnk−mk+1. We have the following claim.
First, we show vβ=c1. For any ε>0, there is an integer k0>0 such that
[TABLE]
Since Tβnkx>βnk−mk, we have Tβnkx>βnk−mk≥β−nk(c1+ε). In general, for any n≥nk0, there is an integer k≥k0 such that nk≤n<nk+1. By the choice of {nk}, we have
[TABLE]
It means vβ=vβ(x)<c1+ε. On the other hand, by the definition of c1, taking subsequence {nki} and {mki} such that
[TABLE]
one has Tβnkix<βnki−mki+1≤β−nki(c1−ε)+1. Thus, vβ=νβ(x)≥c1−ε. By the arbitrariness of ε, vβ=c1.
Next, we will prove v2≤c2. By the definition of v2, for any ε>0, there is an integer n0=n0(ε)>0 such that
[TABLE]
By the definition of c2, one can take a subsequence {ki:i≥1} such that
[TABLE]
For the above ε>0, there is an integer i0=i0(ε)>0 such that
[TABLE]
By contrary, suppose c2<v2. Then, for any ε∈(0,(v2−c2)/4) and any integer J≥K:=max{n0(ε),ni0(ε)}, there is an integer nki+1>J such that for any integer n∈[1,nki+1], one has
[TABLE]
This contracts the fact x∈U(ψ2). Therefore,
[TABLE]
∎
Now, we consider
[TABLE]
[TABLE]
Since (limsupmknk)⋅(limsupnkmk)≥1, one has
[TABLE]
If v2>1, then v2>vβ/(1+vβ), for any vβ≥v1. This contradicts (3.3). Thus, B is empty. By Lemma 3.4,
[TABLE]
Hence, L(ψ1)∩U(ψ2) is countable.
If v2≤1, by the inequality (3.3), for any vβ<v2/(1−v2), the set B is empty. Therefore, we consider the case vβ≥v2/(1−v2). Take a subsequence {ki:i≥1} such that the supremum of (3.1) is obtained. For abbreviation, we continue to write {nk:k≥1} and {mk:k≥1} for the subsequence {nki:i≥1} and {mki:i≥1}, respectively. Given 0<ε<v2/2, for k large enough, one has
Therefore, the sequence {mk:k≥1} increases at least exponentially. Since nk≥mk−1 for every k≥2, the sequence {nk:k≥1} also increases at least exponentially. Thus, there is a positive constant C such that k≤Clogβnk. Combining (3.4) and (3.5), one obtains
[TABLE]
Thus, for k large enough, there is an integer n0 and a postive real number ε1 small enough such that the sum of all lengths of the blocks of [math] in the prefix of length nk of the infinite sequence a1a2⋯ is at least equal to
[TABLE]
Among the digits a1⋯amk, there are k blocks of digits which are ‘free’. Denote their lengths by l1,⋯,lk. Let ε2=vβ−v2(vβ−v2−vβ⋅v2)ε1, one has
[TABLE]
By Theorem 2.4, there are at most β⋅βli/(β−1) ways to choose the block with length li. Thus, one has in total at most
[TABLE]
possible choices of the digits a1⋯amk. On the other hand, there are at most k(k≤Clogβnk) blocks of [math] in the prefix of length nk of the infinite sequence a1a2⋯. Since there are at most nk possible choices for their first index, one has in total at most (nk)Clogβnk possible choices. Consequently, the set of those x∈B is covered by
[TABLE]
basic intervals of length at most β−mk. Moreover, by (3.4) and by letting ε3=ε/(1+vβ), we have β−mk≤β−(1+vβ)(1−ε3)nk. Set ε′=max{ε2,ε3}. The set of those x is covered by
[TABLE]
basic intervals of length at most β−(1+vβ)(1−ε′)nk. We consider the series
[TABLE]
The critical exponent s0 such that the series converges if s>s0 and diverges if s<s0 is given by
[TABLE]
By a standard covering argument and the arbitrariness of ε′, the Hausdorff dimension of B′:={x∈[0,1]:νβ(x)=νβ}∩U(ψ2) is at most equal to
[TABLE]
For vβ≥v2/(1−v2), fix L large enough. We consider the set
[TABLE]
Repeat the above discussion, if v2<1, then
[TABLE]
If v2=1, then vβ=+∞. By Theorem SW, dimH(D)=0. If v2<1, since L(ψ1)∩U(ψ2) is a subset of
[TABLE]
let L tend to +∞, one has
[TABLE]
Regard the right side as a function of vβ, if v1/(2+v1)<v2, then the maximum is attained for vβ=2v2/(1−v2). Therefore,
[TABLE]
If v2≤v1/(2+v1), then the maximum is attained for vβ=v1. Thus,
If v2=1, then dimH(L(ψ1)∩U(ψ2))≥0 always holds. If v2<1, then we fix δ>0 with v2+δ<1, we consider the lower bound of the Hausdorff dimension of the set
[TABLE]
where vβ≥v1 is a real number. By Theorem BL, if v2+δv1+δ<1−(v2+δ)1, then F is empty. Therefore, we consider the case v2+δv1+δ≥1−(v2+δ)1. If v2>0, then there is δ0>0 such that for any δ∈(0,δ0], one has
[TABLE]
For any δ∈(0,δ0], we will construct a Cantor subset Eδ of F. Let
[TABLE]
If v2=0, let
[TABLE]
Making an adjustment, we can choose two subsequences {nk} and {mk} with nk<mk<nk+1 for every k≥1 such that {mk−nk} is a non-decreasing sequence and
[TABLE]
Consider the set of real numbers x∈[0,1) whose β-expansion
[TABLE]
satisfies that for all k≥1,
[TABLE]
[TABLE]
where tk is the largest integer such that mk+tk(mk−nk)<nk+1. Then,
[TABLE]
for k large enough. Therefore, the sequence {tk:k≥1} is bounded. Fix N, let βN be the real number defined by the infinite β-expansion of 1 as equality (2.2). We replace the digit 1 for ank,amk and amk+i(mk−nk) for any 1≤i≤tk by the block 0N10N. Fill other places by blocks belonging to ΣβN. Thus, we have constructed the Cantor type subset Eδ. Since {tk} is bound, one has
[TABLE]
[TABLE]
According to the construction, the sequence dβ(x) is in ΣβN.
Claim**.**
Eδ⊆L(ψ1)∩U(ψ2).
Proof of Claim.
Given ε>0, by (3.7), there exists an integer k0 such that
[TABLE]
By the definitions of v1 and v2, there is an integer n0 such that
[TABLE]
Let N0=max{nk0,n0}, for any x∈Eδ and any nk≥N0, one has
[TABLE]
It means x∈L(ψ1). On the other hand, for N≥N0, there is an integer i such that nk+i≤N<nk+i+1. Therefore,
[TABLE]
It means x∈U(ψ2). Then, x∈L(ψ1)∩U(ψ2). Therefore,
[TABLE]
∎
We distribute the mass uniformly when meet a block in ΣβN and keep the mass when go through the positions where the digits are determined by construction of Eδ. The Bernoulli measure μ on Eδ is defined as follows.
If n<n1, define μ(In)=1/♯ΣβNn. If n1≤n≤m1+4N, define μ(In)=1/♯ΣβNn1−1. If there is an integer t with 0≤t≤t1−1 such that
[TABLE]
define
[TABLE]
If there is an integer t with 0≤t≤t1 such that
[TABLE]
where c:=min{n2+4N+2Nt1,m1+4N+(t+1)(m1−n1)+2Nt}, define
[TABLE]
For k≥2, let
[TABLE]
[TABLE]
If lk≤n≤hk, define
[TABLE]
If there is an integer t with 0≤t≤tk−1 such that
[TABLE]
define
[TABLE]
If there is an integer t with 0≤t≤tk such that
[TABLE]
define
[TABLE]
By the construction and Proposition 2.6, Ihk is full. For calculating the local dimension of μ, we discuss different cases as follows.
Case A: If n=hk, then
[TABLE]
Recall that {tk:k≥1} is bounded and {mk:k≥1} grows exponentially fast in terms of k, therefore,
Case B: For an integer n large enough, if there is k≥2 such that lk≤n≤hk, then
[TABLE]
Case C: For n, if there is an integer t with 0≤t≤tk−1 such that
[TABLE]
then one has
[TABLE]
Since Ihk is full, by Proposition 2.7, ∣In∣=∣Ihk∣⋅∣In−hk(ω′)∣, where ω′ is an admissible block in ΣβNn−hk. By Lemma 2.8,
[TABLE]
Hence,
[TABLE]
where φ(N)<1 and φ(N) tends to 1 as N tends to infinity. If there is an integer t with 0≤t≤tk such that
[TABLE]
then letting l:=n−(hk+t(mk−nk)+2Nt), one has
[TABLE]
Since Ihk is full, by Proposition 2.7, ∣In∣=∣Ihk∣⋅∣In−hk(ω′)∣, where ω′ is an admissible block in ΣβNn−hk. By Lemma 2.8, ∣In−hk(ω′)∣≥β−(n−hk+N). Therefore,
[TABLE]
Hence,
[TABLE]
Therefore, in all cases,
[TABLE]
Given a point x∈Eδ, let r be a number with ∣In+1(x)∣≤r<∣In(x)∣. We consider the ball B(x,r). By Lemma 2.8, every n-th order basic interval In satisfies ∣In∣≥β−(n+N). Hence, the ball B(x,r) interests at most ⌊2βN⌋+2 basic intervals of order n. On the other hand,
[TABLE]
Therefore,
[TABLE]
By the arbitrariness of δ∈(0,δ0], one has
[TABLE]
Let N tend to infinity, by Mass Distribution Principle [7, pp.60], one has
[TABLE]
Regarding the right side as a function of vβ with vβ≥v2/(1−v2), if v1/(2+v1)<v2, then the maximum is attained for vβ=2v2/(1−v2). Therefore,
[TABLE]
If v2≤v1/(2+v1), then the maximum is attained for vβ=v1. Thus,
If v2>0, by the definitions of v2 and v1=v1=0, for any ε∈(0,v2/2), there is an integer n0 such that for any n≥n0, one has
[TABLE]
For any x∈U(ψ2), by the same argument as Proposition 3.2, we have
[TABLE]
∎
5. Examples
In this section, we will show that the upper and lower bounds of Theorems B and C can be all reached. Examples 5.1, 5.2 and 5.3 explain that the upper bound estimation 1+v21, (1+v21−v2)2 and (1+v1)(v1−v2)v1−v2−v1v2 are reachable, respectively.
Now, we construct a Cantor subset E of L(ψ1)⋂U(ψ2) such that
[TABLE]
Let nk=kk and mk=4kk, for k=1,2,⋯, we construct a Cantor subset E by the same way as Proposition 3.9, then
[TABLE]
∎
Example 5.2**.**
Let ψ1(n)=1, for n=1,2,⋯ and
[TABLE]
Then, v1=v=0, v2=1/2, v2=2 and
[TABLE]
Proof.
Since v1/(2+v1)<v2, by Proposition 3.8, the proof is completed by showing
[TABLE]
Let nk=4k and mk=3⋅4k, for k=1,2,⋯, we construct a Cantor subset E by the same way as Proposition 3.9, then
[TABLE]
∎
Example 5.3**.**
For k=1,2,⋯, let
[TABLE]
Then, v1=1/2, v1=1, v2=1/6, v2=1/2 and
[TABLE]
Proof.
Since v2≤v1/(2+v1), by Proposition 3.8, one has
[TABLE]
It suffices to show dimH(L(ψ1)∩U(ψ2))≥1/2. Let nk=4k and mk=3⋅4k, for k=1,2,⋯, we construct a Cantor subset E by the same way as Proposition 3.9, then
[TABLE]
∎
Examples 5.4 and 5.5 explain that the lower bound estimation [math] and (1+v21−v2)2 are reachable, respectively.
Example 5.4**.**
Let ψ1(n)=1 for n=1,2,⋯ and
[TABLE]
Then, v1=v1=0, v2=1, v2=3 and
[TABLE]
Proof.
It remains to prove dimH(L(ψ1)∩U(ψ2))≤0. In fact, by Proposition 3.8, one has
[TABLE]
∎
Example 5.5**.**
For k=1,2,⋯, let
[TABLE]
Then, v1=3, v1=10/3, v2=21/32 and v2=2/3. One has
[TABLE]
Proof.
Since v1/(2+v1)<v2, by Proposition 3.9, the proof is completed by showing
[TABLE]
In fact, since v2≤v1/(2+v1), by Proposition 3.8, we have
[TABLE]
∎
The following two examples explain that the lower bound estimation (1+v1)(v1−v2)v1−v2−v1v2 is reachable. We consider the cases of v1=v1 and v2=v2, respectively.
Example 5.6**.**
Let ψ1(n)=β−n for n=1,2,⋯ and
[TABLE]
Then, v1=v1=1, v2=0, v2=1/4 and
[TABLE]
Proof.
Since v2≤v1/(2+v1), by Proposition 3.9, what is left is to show
[TABLE]
For any x∈[0,1], denote its β-expansion by
[TABLE]
where ai∈{0,⋯,⌈β⌋}, for all i≥1. Let
[TABLE]
If x∈L(ψ1)∩U(ψ2), since v1>0, then one has
[TABLE]
Arguing as in the proof of Proposotion 3.8, we take the maximal subsequences {nk:k≥1} and {mk:k≥1} of {ni′:i≥1} and {mi′:i≥1}, respectively, such that the sequence {mk−nk:k≥1} is non-decreasing. Notice βnk−mk<Tβnkx<βnk−mk+1, one has
[TABLE]
Since x∈U(ψ2), there is an integer k0 such that for any k≥k0, one has mk−nk≥⌊nk+1/4⌋. If not, for any j≥1, there is an integer kj such that mkj−nkj<nkj+1/4. Since one of nkj+1 and nkj+1+1 is even, denote it by lkj+1, for any integer n∈[1,lkj+1], one has
[TABLE]
It contradicts x∈U(ψ2).
Choose the subsequence {nki:i≥1} and {mki:i≥1} of {nk:k≥1} and {mk:k≥1}, respectively, such that
[TABLE]
For simplicity, let {nk:k≥1} and {mk:k≥1} stand for {nki:i≥1} and {mki:i≥1}, respectively. For any ε>0, there is an integer k′ such that for any k≥k′, one has
[TABLE]
Arguing as in the proof of Proposition 3.8, one has
[TABLE]
∎
Example 5.7**.**
Let
[TABLE]
and ψ2(n)=β−2n/11 for n=1,2,⋯. Then, v1=1/3, v1=2/3, v2=v2=2/11 and
[TABLE]
Proof.
Since v2≤v1/(2+v1), by Proposition 3.9, what is left is to show
[TABLE]
In fact, since v2=112≤71=v1/(2+v1), by Proposition 3.8,
[TABLE]
∎
Bibliography19
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Amou and Y. Bugeaud, Exponents of Diophantine approximation and expansions in integer bases, J. Lond. Math. Soc. (2) , 81 (2010), no. 2, 297-316.
2[2] A. Besicovitch, Sets of Fractional Dimensions (IV): On Rational Approximation to Real Numbers, J. London Math. Soc. , 9 (1934), no. 2, 126-131.
3[3] Y. Bugeaud, Distribution modulo one and Diophantine approximation, Cambridge Tracts in Mathematics, vol. 193, Cambridge University Press, Cambridge , 2012.
4[4] Y. Bugeaud and L. Liao, Uniform Diophantine approximation related to b 𝑏 b -ary and β 𝛽 \beta -expansions, Ergodic Theory Dynam. Systems , 36 (2016), no. 1, 1-22.
5[5] L. Dirichlet, Verallgemeinerung eines Satzes aus der Lehre von den Kettenbrüchen nebst einigen anwendungen auf die Theorie der Zahlen, SB Preuss. Akad. Wiss , 1842 (1842), 93-95.
6[6] K. Dmitry, K. Ioannis and K. Florian. Diophantine approximation and run-length function on β 𝛽 \beta -expansions, ar Xiv preprint ar Xiv:1904.08584 , 2019.
7[7] K. Falconer, Fractal geometry, Mathematical foundations and applications, John Wiley & Sons, Ltd., Chichester , 1990.
8[8] A. Fan and B. Wang, On the lengths of basic intervals in beta expansions, Nonlinearity , 25 (2012), no. 5, 1329-1343.