On intrinsic and extrinsic rational approximation to Cantor sets
Johannes Schleischitz

TL;DR
This paper advances the understanding of rational approximation to fractal sets, especially Cantor sets, by establishing new bounds, extending results to multi-dimensional cases, and analyzing the structure of rational points within these fractals.
Contribution
It introduces new approximation bounds for rational numbers near fractal sets, generalizes previous results to higher dimensions, and studies the pattern and structure of rational points in Cantor and similar fractals.
Findings
Provided a lower bound for the distance of rationals outside the Cantor set to the set.
Extended approximation results to multi-dimensional fractal sets with mild assumptions.
Analyzed the structure of rational points in missing digit Cantor sets, including their denominator properties.
Abstract
We establish various new results on a problem proposed by K. Mahler in 1984 concerning rational approximation to fractal sets by rational numbers inside and outside the set in question, respectively. Some of them provide a natural continuation and improvement of recent results of Broderick, Fishman and Reich and Fishman and Simmons. A key feature is that many of our new results apply to more general, multi-dimensional fractal sets and require only mild assumptions on the iterated function system. Moreover we provide a non-trivial lower bound for the distance of a rational number outside the Cantor middle third set to the set , in terms of the denominator . We further discuss patterns of rational numbers in fractal sets. We want to highlight two of them: Firstly, an upper bound for the number of rational (algebraic) numbers in a fractal set up to a given height (andâŠ
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.
On intrinsic and extrinsic rational
approximation to Cantor sets
Johannes Schleischitz
Abstract.
We establish various new results on a problem proposed by K. Mahler in 1984 concerning rational approximation to fractal sets by rational numbers inside and outside the set in question, respectively. Some of them provide a natural continuation and improvement of recent results of Broderick, Fishman and Reich and Fishman and Simmons. A key feature is that many of our new results apply to more general, multi-dimensional fractal sets and require only mild assumptions on the iterated function system. Moreover we provide a non-trivial lower bound for the distance of a rational number outside the Cantor middle third set to the set , in terms of the denominator . We further discuss patterns of rational numbers in fractal sets. We want to highlight two of them: Firstly, an upper bound for the number of rational (algebraic) numbers in a fractal set up to a given height (and degree) for a wide class of fractal sets. Secondly we find properties of the denominator structure of rational points in âmissing digitâ Cantor sets, generalizing claims of Nagy and Bloshchitsyn.
Middle East Technical University, Northern Cyprus Campus, Kalkanli, GĂŒzelyurt
*Keywords: Cantor sets, intrinsic/extrinsic Diophantine approximation, continued fractions
Math Subject Classification 2010: 28A80, 11H06, 11J13 *
1. A question of Mahler and generalizations
1.1. Introduction and notation
In 1883, G. Cantor introduced what is today referred to as Cantor middle-third set. It consists of the real numbers in whose infinite base representation avoids the digit , i.e. numbers of the form
[TABLE]
In 1984, K. Mahler [22] proposed the problem to study how well elements in this set can be approximated by rational numbers within the set, and rational numbers outside of it. Problems of this type are usually referred to as intrinsic and extrinsic approximation, respectively. He noticed that convergents of the continued fraction expansion to numbers in the Cantor middle third set may lie in the Cantor middle third set or not. His problem can be naturally generalized to wider families of fractal sets. The easiest twist is to take an integer and a digit set of cardinality at least two and at most , and to consider all numbers in whose base digits belong to . We call such sets missing digit Cantor sets and write . We will consider wider classes of -dimensional fractal sets, comprised in the following Definition 1. For convenience we always consider equipped with the supremum norm , however all proofs below can be easily modified if we work with the usual Euclidean norm instead.
Definition 1** (IFS, Cantor set).**
We call a function a contraction if for some fixed we have if
[TABLE]
In this paper, an iterated function system (IFS) is a finite set of contractions. We call the IFS a similarity IFS if the contractions are similarities, that is for there exist with the property
[TABLE]
We call the IFS affine if the contractions are affine functions on , i.e. functions
[TABLE]
where and . We call an IFS rational-preserving if for . Any IFS induces a compact set , called attractor of the IFS, given as the unique solution of . We call any such a Cantor set and carry over the definitions above in the obvious way to Cantor sets (for example is called affine and rational-preserving Cantor set if the corresponding IFS is affine and rational-preserving).
We discuss relations between the notions of the above definition. Any similarity IFS is an affine IFS with matrices for orthogonal matrices and scalar multiples of the identity matrix, see Hutchinson [16]. Hence any similarity Cantor set is an affine Cantor set and for the concepts coincide. An affine IFS is rational-preserving if and only if and for . By the above characterization of , to obtain a rational-preserving similarity Cantor set we require orthogonal matrices with rational entries (then we can choose ). A comprehensive description of all such matrices was given in [21]. Clearly, a special choice is and for . There are also various examples of non-affine, rational-preserving IFS. For , one may consider any collection of rational functions with , with not having real roots, degree of not exceeding the degree of , and rational sufficiently small to guarantee uniformly, for example . It is further possible to construct real analytic, transcendental functions with this property (here transcendental means does not satisfy a polynomial identity with ), it suffices to multiply the functions obtained by Marques and Moreira in [23, Theorem 1.2] by any non-zero rational factor of absolute value less than .
The existence of the unique fixed point in Definition 1 follows from Banachâs Fixed Point Theorem [16] applied with respect to the Hausdorff metric on compact subsets of . Any has an address , i.e. it can be written in the form
[TABLE]
Addresses may not be unique, to guarantee uniqueness one typically has to assume the so called strong separation condition (SSC), see Definition 2 below. We do not dig deeper into this topic here. We will further need the open set condition for some of our results.
Definition 2** (OSC, SSC).**
An iterated function system satisfies the open set condition (OSC) if there exists a bounded open set so that for and for we have . For simplicity we will say a Cantor set as in Definition 1 satisfies OSC if its associated IFS does. A Cantor set satisfies the strong separation condition (SSC) if the sets are disjoint.
We briefly discuss measures and dimension of fractals. Any Cantor set in Definition 1 supports a natural probability measure by Frostmannâs Lemma (see [11]). For similarity Cantor sets that satisfy OSC, it is just a multiple of some -dimensional Hausdorff measure, and there is a well-known general formula to determine in terms of the contraction factors [16]. See also [24] for a generalization. Clearly this value equals the Hausdorff dimension of . For it just becomes . We refer to Falconer [11] for an introduction to metric theory on fractals. Rational approximation to Cantor type sets has been intensely studied, especially metrical questions with respect to the mentioned measure. However, until recently, approximation to fractals in the sense of Mahlerâs question with restrictions of the rationals had not been studied in detail. Only in 2007 a first attempt was made by Levesley, Salp and Velani [20]. In 2011 a paper of Broderick, Fishman and Reich [5] dealt with intrinsic approximation. Two recent papers of Fishman and Simmons [13, 14] shed more light on the topic as well. We rephrase important results from [5, 13, 14] in Section 1.2 below. The purpose of this paper is to establish further results on Mahlerâs question, where possible in the very general settings of Definition 1. In Section 2 we generalize results on intrinsic approximation from [5, 13]. The focus of the paper lies on extrinsic approximation in Section 3. As a byproduct we obtain related results, especially on the cardinality of rational/algebraic vectors of bounded degree and height and their period lengths. Moreover we gain some new insight on the structure of rational numbers in missing digit Cantor sets . We gather all these findings in Section 4.
1.2. Recent results on Mahlerâs problem
The main result of [5] shows a Dirichlet type result for intrinsic rational approximation to missing digit Cantor sets . We present a slightly simplified version to avoid dealing with technical details.
Theorem 1.1** (Broderick, Fishman, Reich (2011)).**
Let be a missing digit Cantor set and . If denotes the Hausdorff dimension of , the inequalities
[TABLE]
have a solution for every parameter . In particular, if , there exist infinitely many with the property
[TABLE]
As observed in [5], the bounds (2) and (3) become weaker when for fixed we extend the digit set and thereby increase the Hausdorff dimension . This seems counter-intuitive as there are more rational numbers in , however in larger Cantor sets there exist more irrational to be approximated as well. A generalization of Theorem 1.1 was given by Fishman and Simmons [13].
Theorem 1.2** (Fishman, Simmons (2014)).**
Let be a one-dimensional, affine, rational-preserving Cantor set, i.e. derived from an IFS as in (4), that satisfies OSC. Let be its Hausdorff dimension and let be as in (5). Let . Then there is a constant such that for any the estimate
[TABLE]
admits a solution with .
For one-dimensional, affine, rational-preserving Cantor sets as in the theorem, is the attractor of an iterated function system
[TABLE]
for of absolute value at most and a rational number. We can assume . Then let
[TABLE]
Definition 3**.**
If , we call an affine, rational-preserving IFS monic if in (4) for all , or equivalently if . We call the derived Cantor set a one-dimensional, affine, monic, rational-preserving Cantor set.
Note that the missing Cantor sets defined above are monic. Indeed the similarities can be written for , with every contraction factor equal to . For monic Cantor sets as in the theorem where , the estimate becomes
[TABLE]
We thus identify Theorem 1.1 (up to the value of the constant) as a special case. We turn to extrinsic approximation. A result of Fishman and Simmons reads as follows [14, Corollary 1.2].
Theorem 1.3** (Fishman, Simmons (2015)).**
Let be a Cantor set that satisfies OSC and does not contain a line segment. Assume the additional property that for any compact set there is a constant with
[TABLE]
Let . Then for some constant , there exist infinitely many such that
[TABLE]
Originally this result is only formulated for the narrower class of similarity Cantor sets in [14], however the given proof extends to our more general situation, upon small modifiactions of the proof of [14, Lemma 2.12]. Indeed, our local hypothesis (6) on the contractions suffices to derive as in its proof, and the equality in the last displayed formula must be altered to greater or equal, not affecting the implication of the lemma. Up to the constant , the bound is of best possible order we can expect for generic . As observed in [14], if , by Dirichletâs Theorem the claim follows directly with whenever infinitely many convergents to lie outside . However, it was recently shown [26] that any missing Cantor set contains irrational numbers with almost all convergents in . The actual proof of Theorem 1.3 employed a variant of Lemma 5.3 below.
2. Intrinsic approximation
In this section we provide a variant of Theorem 1.2 for Cantor sets in higher dimension.
Theorem 2.1**.**
Let be a rational-preserving affine Cantor set, i.e. the attractor of an IFS consisting of contraction maps
[TABLE]
where and . Let be the contraction factor of and . Further let and
[TABLE]
Then for any and any parameter , there exists with the properties
[TABLE]
If and we identify with in (5), we almost obtain Theorem 1.2. One difference is a slightly altered exponent for . We believe the optimal exponent for is again for the Hausdorff dimension of . For similarities , our exponent is slightly worse, unless in the special case that all contraction factors coincide where the identity can be readily verified [16]. In particular we identify Theorem 1.1 as a special case of Theorem 2.1. On the other hand, even for our Theorem 2.1 is slightly more general than Theorem 1.2 in the sense that we do not require as in (4), so is in general better than the inferred constant obtained from transitioning to representation (4). Observe that , with for instance if all are permutation matrices (with optional sign conversions to ). Note also that in contrast to [13] we do not require OSC for the conclusion of Theorem 2.1.
3. Extrinsic approximation
3.1. Uniform extrinsic approximation
A topic that seems to be untouched so far is uniform extrinsic approximation to Cantor sets. Theorem 3.3 below shows that under mild assumptions on the underlying IFS, any element of the derived Cantor set is uniformly approximable by rationals outside with denominator at most of order , and this bound is essentially optimal. Thereby, we see that an improvement as for intrinsic approximation in Theorem 1.1 and Theorem 1.2 cannot be achieved for extrinsic approximation. Another interpretation is that the exponent from Theorem 1.3 is not valid when it comes to uniform approximation. The result follows from a combination of Theorem 3.1 and Theorem 3.2, which are formulated in very general settings.
Theorem 3.1**.**
Let be any Cantor set arising from an IFS with contraction ratios and let and . Assume that either
- âą
* satisfies the OSC and (6), and there is a vector such that contains no line segment parallel to , or*
- âą
we have
Then there exists a constant so that for every and every , the inequality
[TABLE]
has a solution with .
We believe that the weak assumption on line segments just means that has empty interior, however for a proof of this would be desirable. The implication from this first assumption is in fact a straight-forward consequence of results in [14]. The alternative latter assumption essentially says that has small Hausdorff dimension, and the implication is a consequence of a new counting result in this case. Now we turn towards the more challenging reverse estimates.
Definition 4**.**
We call a vector irrational if it has at least one irrational coordinate, i.e. .
Theorem 3.2**.**
Let be a rational-preserving Cantor set. Assume that there is whose unique fixed point lies in . Assume further that either
- âą
all contraction maps are one-to-one, or
- âą
any element in has at most countably many addresses (which is true if satisfies the SSC).
Let be any function that tends to [math] (arbitrarily slowly). Then the set of irrational for which
[TABLE]
holds for infinitely many and every with , is uncountable and dense in .
Remark 1**.**
Clearly the claim holds if , and such vectors are dense in rational-preserving Cantor sets (see also the last claim of Theorem 3.3 and its proof below). Hence the irrationality in the claim is an important issue. Ideally we would like to sharpen the claim by asking the coordinates of to be -linearly independent together with . We may infer this strengthened version if any hyperplane in intersects in at most countably many points, however this assumption seems unnatural.
Remark 2**.**
It is possible to relax the assumption that the contraction maps are one-to-one in various ways. However, we are unable to provide a very natural assumption and do not further elaborate on it here. The condition appears to be unrelated to OSC, and we believe OSC is not sufficient to imply the alternative assumption either, however we are not aware of any concrete example. See Sidorov [30] for similarity Cantor sets in which all but finitely many elements have uncountably many addresses, which however do not satisfy the OSC.
While not satisfied in general, the condition of the rational fixed point in Theorem 3.2 holds if is a rational-preserving affine Cantor set, i.e. derived from an IFS as in (1), as then clearly (note that is no eigenvalue of since it induces a contraction). We may choose rational scalar multiples of the identity matrix to obtain an IFS that consists of similarity contractions
[TABLE]
Recall a Liouville number is an irrational real number with the property that has a rational solution for arbitrarily large . We call Liouville vector if accordingly has infinitely many solutions for every . Theorem 3.2 is essentially equivalent to asking that contains points that are arbitrarily well-approximable by rational vectors inside (in particular must contain âintrinsic Liouville vectorsâ). Indeed, the proof of Theorem 3.2 relies on the construction of such intrinsic Liouville vectors. Combining these observations, from Theorem 3.1 and Theorem 3.2 we deduce at once
Theorem 3.3**.**
Let be a rational-preserving similarity Cantor set, for instance derived from an IFS of contractions as in (9). Assume either OSC is satisfied and there is a vector such that contains no line segment parallel to , or with as in Theorem 3.1. Then there exists such that for any and any the inequality
[TABLE]
has a solution with . On the other hand, for any function that tends to [math], there exists for which
[TABLE]
holds for certain arbitrarily large and any with . Finally, for any function, there are intrinsically -approximable vectors in , defined as the vectors for which the inequality
[TABLE]
admits infinitely many solutions . In particular, contains Liouville vectors.
As observed in Section 1.1 a wider class of suitable IFS can be readily found with the aid of [21]. Any reasonable one-dimensonal rational-preserving Cantor set with OSC, in particular any missing digit Cantor set (with ), satisfies the assumptions of Theorem 3.3. This first claim does not require the rationality of the IFS, however for the other claims it is probably needed. Intuitively, (similarity) Cantor sets containing no Liouville vector should exist when we drop the rationality condition. For and the class of topological Cantor sets, the existence was shown in [1]. See also [4] for fat Cantor sets without rational elements. We remark further that for rational-preserving similarity Cantor sets induced by diagonal-matrices that satisfy OSC, the existence of very well-approximable vectors that are no Liouville-vectors was shown by S. Baker [2, Theorem 5.6]. Notice also that the claim concerning Liouville vectors cannot be derived from standard metric results as in [13] even for , as the set of Liouville numbers has Hausdorff dimension [math] due to JarnĂk [17].
3.2. Ordinary extrinsic approximation
We use Theorem 1.1 and Theorem 1.2 to obtain a lower bound on the distance of certain one-dimensional Cantor sets to a rational number not contained in it. This can be viewed as a reverse of Theorem 1.3. For we write and denote by Eulerâs number.
Theorem 3.4**.**
Let be a one-dimensional, affine, rational-preserving monic Cantor set, i.e. derived from an IFS as in (4) with , that satisfies OSC. Denote its Hausdorff dimension by . Then for sufficiently large , we have the estimate
[TABLE]
for every .
In the special case of missing digit Cantor sets , we have and the inequality
[TABLE]
holds for every . In particular, for every and any , the inequality
[TABLE]
has only finitely many solutions .
We remark that in view of Theorem 2.1, it is possible to provide a variant of Theorem 3.4 that does not require OSC for the cost of (possibly) increasing slightly. We do not believe that the bounds are optimal. It might be true that there is an absolute upper bound for the order of extrinsic approximation, equivalently with the notation of Section 4.3 below. However, a metric result of Fishman and Simmons [14, Theorem 3.9] demonstrates that we cannot hope an improvement of Theorem 1.1 and Theorem 1.2 underlying our proof. Hence the bounds in Theorem 3.4 are the limit of our method. Our proof does not extend to non-monic Cantor sets, as we require that the right hand side in Theorem 1.2 decays faster than . This can only be guaranteed if in (5) vanishes. Also for we see that Cantor sets as in Theorem 2.1 do not fufill the requirement. In these cases, no bound seems to be known. We formulate resulting open problems.
Problem 1**.**
Improve the bounds in Theorem 3.4. Do there exist extrinsic Liouville numbers, i.e. numbers with in the notation of Section 4.3 below?
Problem 2**.**
Let be a one-dimensional, affine, rational-preserving Cantor set which is not necessarily monic. For , find a lower bound for in dependence of . What about Cantor sets in higher dimensional Euclidean space?
We believe the latter problem is related to Problem 3 in Section 4.2 below. For , an elementary approach, using that the base expansion of a rational number in lowest terms has period length , indicates the bound
[TABLE]
with a suitable constant . See Section 4.4 below, in particular Proposition 4.10, for more details. However, the conclusion (11) is stronger than (13) since .
We remark that similar patterns as in Theorem 3.4 are known concerning extrinsic rational approximation to algebraic sets in . See [6, Lemma 1], [9, Lemma 1], [10, Lemma 4.1.1], [28, Theorem 2.1]. However, the lower bounds typically decay like a negative power of in that case. In [28] it is shown that for an algebraic variety defined by an implicit integral polynomial equation of total degree , there are no rational numbers outside that approximate of order greater than . We refer to [12] for approximation to manifolds by rationals within the manifold.
4. Related topics
4.1. Rational/Algebraic vectors in Cantor sets
As a byproduct of the proof of Theorem 2.1, we show the following upper bound for the number of rational elements with denominator at most in a Cantor set.
Theorem 4.1**.**
Let be any Cantor set as in Definition 1. Let be the maximum contraction rate of the IFS and denote by the diameter of the compact Cantor set. Let . Then the set of rational vectors in up to height
[TABLE]
has cardinality at most .
We require or equivalently for the result to be non-trivial. When is the Cantor middle third set, the bound becomes . The exponent has twice the expected magnitude, indeed in view of numeric evidence it was conjectured in [5] that for any . We can extend our claim to algebraic vectors.
Theorem 4.2**.**
With the assumptions and notation of Theorem 4.1, let be the set of vectors in whose entries are real algebraic numbers of degree at most and height at most . Then
[TABLE]
Clearly the trivial bound on is of order , so if or we obtain an improvement simultaneously for every . For the Cantor middle third set we get an improvement for . In case of affine, rational-preserving Cantor sets one might expect for any , i.e. there are no irrational algebraic vectors in . For the Cantor middle-third set this is a famous open conjecture of Mahler [22]. It seems that even in this case no non-trivial bound on had been established previously.
4.2. Adresses of rational vectors in certain Cantor sets
We want to discuss addresses of rational vectors in , as the above sections indicate that they are directly linked to the order of rational approximation to Cantor sets. This topic has already been addressed in [13] and Theorem 4.3 below generalizes [13, Lemma 4.2] to certain multi-dimensional settings. We also provide a quantitative version for period lengths. While our proof strategy resembles the one in [13] to some extent, we proceed slightly different.
Definition 5**.**
We call an affine, rational-preserving IFS unimodular if the contraction maps are of the form where with , and and . We call a Cantor set unimodular if it is induced by an unimodular IFS.
Unimodularity generalizes the concept of a monic, affine IFS for from Section 1.2. Note that our setup is more general than assuming , i.e. , with all parameters as in the definition, as the determinant condition is relaxed. Therefore our next theorem in fact even generalizes [13, Lemma 4.2] when .
Theorem 4.3**.**
Let be an affine, rational-preserving Cantor set. Then any vector in that admits an ultimately periodic address is in . If is unimodular, the rational vectors in are precisely those vectors in that have an ultimately periodic address. Moreover, in this case the period length (including preperiod) of can be chosen with as in Theorem 4.1.
We remark that the bound supposedly can be reasonably improved, potentially up to . See the remark after the proof and also [13, Theorem 5.3, Conjecture 5.6]. For , the problem if the assumption of being unimodular (=monic) is necessary for the conclusion was already raised in [13, Section 5]. We have no new contribution to this interesting question, but want to formulate the corresponding generalization.
Problem 3**.**
In a Cantor set derived from an affine rational-preserving IFS, does every rational vector in have an ultimately periodic address? If yes, can it be arranged that the period length of is of order ?
From Theorem 4.3 we get some information on the structure of rational numbers in missing digit Cantor sets. We only highlight special consequences, from its proof below more information can be extracted.
Corollary 4.4**.**
Let and . If is any finite set of prime numbers not dividing , then there are only finitely many rational numbers in with consisiting only of prime factors in . In particular only finitely many integer powers of a rational number with can lie in . Moreover, contains at most finitely many rational numbers where is a safe prime, i.e. and are both prime numbers.
It was recently pointed out to me by Michael Coons and Igor Shparlinki that it can be inferred from Korobov [19] that the largest prime divisor of a denominator of written in lowest terms is at least , implying the first two claims of the corollary. However, I was unable to find this deduction explicitly in the literature. The method in [19] is based on exponential sum estimates, unrelated to our proof below.
Results of this type (restrictions on rationals in ) appear to be rare. Apart from [19], the author is only aware of a succession of papers by Wall [31], Nagy [25] and Bloshchitsyn [3], treating rationals with very smooth denominators. The first claim of Corollary 4.4 extends [3, Theorem 2] (and thus also [25]) where the finiteness implication was proved for a single prime greater than . For the second claim about powers of a rational in fact we only require that the denominator has a prime divisor that does not divide , or equivalently the radical of does not divide . This condition is easily seen to be necessary in general, as for example any positive integer power of belongs to . For irrational numbers we state the analogous question as an open problem.
Problem 4**.**
Does there exist a real number which is not a root of a rational number and with infinitely many integral powers belonging to a missing digit Cantor set ?
4.3. Exponents
We define several exponents to measure the quality of intrinsic and extrinsic rational approximation in a Cantor set. We restrict to the one-dimensional setting in this paper. In the sequel for convenience we agree on and .
Definition 6**.**
Let and . Define the ordinary exponent of rational approximation as the supremum of such that
[TABLE]
has a solution with for arbitrarily large values of . Define the uniform exponent as the supremum of for which (14) for every large . Define similarly the ordinary and uniform exponents of intrinsic and extrinsic approximation denoted by and respectively, via replacing by and in the definitions accordingly.
The exponents are classical exponents of Diophantine approximation and are usually denoted by and , respectively. The following properties can be readily checked. We leave the verification to the reader.
Proposition 4.5**.**
Let . For any irrational we have
[TABLE]
Further we have
[TABLE]
and
[TABLE]
Remark 3**.**
The ordinary exponent of approximation can equivalently be defined as the supremum of such that
[TABLE]
has infinitely many solutions . However, for the intrinsic and extrinsic exponents, for certain sets the according definition leads to different exponents than those defined above. Several inequalities in (15) may turn out false with this altered definition.
The identity is due to Khintchine [18]. In general there is no equality in the last inequality. From [14, 13] quoted above some inequalities concerning special types of Cantor sets can be inferred. For example, by Theorem 1.3 in any one-dimensional Cantor set that satisfies OSC we have for any . Our main result is inspired by Theorem 3.2 and admits a similar proof.
Theorem 4.6**.**
Let be any set and . We have
[TABLE]
If is any one-dimensional Cantor set that satisfies OSC and , then
[TABLE]
Define the spectrum of an exponent as the set of values taken when inserting any irrational real . For missing digit Cantor sets , Bugeaud [8] provided a construction of with for any given in missing digit Cantor sets . See also [20],[27]. Therefore the spectrum of in equals , and the spectrum of contains this interval. Further in the case that is prime and contains [math] and but does not contain two successive digits, the metrical result [13, Theorem 3.10] implies that for the set of with (or ) has Hausdorff dimension , where is the Hausdorff dimension of . Thus from Theorem 4.6 we deduce at once the following results.
Corollary 4.7**.**
Consider the missing digit Cantor set of Hausdorff dimension . The spectrum of with respect to equals . Assume is prime and contains but does not contain two successive digits. Then for the sets and have Hausdorff dimension , whereas for the Hausdorff dimension equals . In particular the set has Hausdorff dimension .
We pose the problem to decide whether the claims of Corollary 4.7 generalize to one-dimensional Cantor sets that satisfy OSC. Finally we point out that numbers with the property do exist in any missing digit Cantor set . Indeed, it is easy to verify this identity for the numbers constructed in [26] which have almost all convergents in . The identity can further be checked for Liouville type numbers , , compare with [27, Lemma 3.10]. Thus, in view of the metric result rephrased above, we believe that the spectrum of equals as well. However, we are unable to show this at present.
4.4. Base expansions
For missing digit Cantor sets , Theorem 4.3 and Theorem 3.4 have implications on the base digit patterns of rational numbers that can be stated without the framework of Cantor sets. Related considerations concerning the period lengths of base representations of rational numbers in have been addressed in [13, Section 5]. However, the results there are almost all of conditional nature. We start with a consequence of Theorem 4.3.
Theorem 4.8**.**
Let and . Let and assume that the infinite word has period length . Then we have
[TABLE]
Proof.
Write for the fraction in lowest terms. Then the rational number has base expansion , and by assumption it has period length , which by Theorem 4.3 is . Thus , which implies that the common factor is of size . â
The natural assumption that the period length is not shorter than expected is necessary, since if we let then the gcd in question is a multiple of and thus . Now we turn to implications of Theorem 3.4.
Theorem 4.9**.**
Let and . Further let . Let
[TABLE]
with and be a rational number in expanded in base . Then with
[TABLE]
Assume there exists an index with and let be the smallest index with this property. Further let be the fraction in lowest terms. Then . Equivalently, if for in (19) the first base digits lie in , but not all belong to , then its reduced denominator is .
The relation to Theorem 3.4 arises from the fact that the rational numbers in are precisely those where in (19). For a generic rational in (19) we expect that is of exponential order, that is , reasonably stronger than in our claim. However, elementary methods only yield a bound of order that is valid for all in (19), as we will see from Proposition 4.10 below. The bound of our Theorem 4.9 is stronger since . The special case of rationals where is primitive root of the denominator illustrates the improvement well. We denote by the Euler totient function. For coprime integers, as usual denotes the smallest positive integer with . The next proposition comprises results on the -function and period lenghts of rational numbers in a base.
Proposition 4.10**.**
We have . Let be integers with . Write with and consisting only of factors of . Then written in base has preperiod of length equal to the smallest integer with , followed by a period of length . In particular if , then has purely periodic base expansion of period length . Anyway, the total period length of is of order .
We omit a proof as the claims are well-known. The first claim can be found in the book of Hardy and Wright [15, Theorem 328]. The identities for periods can be checked in an elementary way. The bounds on period lengths follow from and , or alternatively directly from Theorem 4.3. Recall is called primitive root modulo if .
Corollary 4.11**.**
Let as in Theorem 4.9. Let be coprime integers and assume is a primitive root modulo . Let (19) be the base expansion of . Assume not all belong to and let be the smallest index for which the digit lies outside . Then , i.e. for some with an absolute implied constant. In particular, any digit that occurs among the in (19) already occurs within the first places.
Proof.
If is a primitive root modulo then by Proposition 4.10 the number has no preperiod (i.e. ) and the period length satisfies . Thus, using the notation of Theorem 4.9, from its claim we infer , as desired. For the particular case, apply the above observation to of cardinality , which induces . â
An equivalent way to state the claim of Theorem 4.9 is that numbers as in (20) have greatest common divisor at most . If we let , another variant on the base expansion of large divisors of numbers of the form is obtained.
Corollary 4.12**.**
Let and as in Theorem 4.9. Let and be positive integers with the property for sufficiently large . Assume for some integer we have divides and is written in base as
[TABLE]
with possibly for some , and assume all . Then for
[TABLE]
the letters occurring in the first and all digits of , respectively, we have .
In particular, if for some , and for sufficiently small , the following holds. Assume has a small divisor , and write the complementary divisor as in (21). The sets of digits that occur within and coincide.
In particular if we take of cardinality , we see that for any large divisor of , all occurring digits in its base expansion already can be found in a relatively short initial sequence. Generically, for large we expect . However, in base reads , so . In this case we easily verify the claim. We end this section with an example.
Example 1**.**
Let with . Then
[TABLE]
for any choice of , (observe that ). Thus, cannot have a very large divisor given by the sum expression. Consider special cases. First, assume for and for , for some integer . Then the sum expression results in , thus
[TABLE]
In particular the assumption implies , or equivalently for . In this particular example, in fact the divisibility condition implies the stronger (sharp) estimate , since is equivalent to . As a second special case let precisely for a power of and otherwise. We are unable to find an elementary proof that confirms our implication
[TABLE]
5. Proofs
5.1. Proof of Theorem 2.1
The crucial step for the proof of Theorem 2.1 is to extend [13, Lemma 2.2]. Fortunately, this can be derived rather easily. Compared to [13], it does not involve the measure supported on , which might not be nice in our general setting, but stems from the following elementary counting argument.
Proposition 5.1**.**
Let be any Cantor set as in Definition 1 and let be the maximum contraction ratio of the IFS. If is an integer and a subset of of cardinality greater than , then there are two elements in with distance , where is the diameter of the compact set .
Proof.
For any let be any address of and let . Then by pigeon hole principle since there are two elements whose prefices and coincide, so for . Let
[TABLE]
Clearly . Then we have
[TABLE]
Since their distance is bounded above by and the claim follows. â
From the proposition we immediately obtain the required variant of [13, Lemma 2.2].
Lemma 5.2**.**
Let be as in Proposition 5.1. Then, if is an integer and belong to , there is constant and two indices with
[TABLE]
We may choose .
Proof.
For given choose the integer so that . By Proposition 5.1 there are two elements in the sequence with distance at most , which leads to in the theorem. â
In the sequel we denote by the norm of a matrix .
Proof of Theorem 2.1.
We proceed essentially as in the proof of [13, Theorem 2.1]. Let arbitrary. Fix an address of it, so that with we have . If is the left shift on the space of infinite formal words, for every large we consider , a finite sequence in . By Lemma 5.2 there are two integers so that if
[TABLE]
then . Define endomorphisms on by and , so that and . Consider and as in the theorem. Then let
[TABLE]
Further with define the integer vectors
[TABLE]
and
[TABLE]
In the additional factor compared to [13] has entered according to the notational difference for the shift vector. By the recursive process, the maps are accordingly given as
[TABLE]
The unique fixed point of denoted by is given by the solution of
[TABLE]
which yields
[TABLE]
We carry out why the inverse matrix is well-defined. All have norm since are contractions for , thus their product which is has norm less than , i.e.
[TABLE]
Consequently all eigenvalues of are of absolute value smaller than , proving the regularity of . We also observe that by Cramerâs rule, hence this applies to as well so we may write
[TABLE]
with and . Concretely by Cramerâs rule the inverse matrix contributes a factor in the denominator, so the total denominator will be if we do not simplify the vector to lowest terms. For any matrix we have (determinant is at most product of column norms, and columns are images of canonical base vectors), and from (22) we infer . Applied to we derive
[TABLE]
Taking logarithms yields
[TABLE]
with the constant . Let be the contraction rates on , . Then, on the other hand
[TABLE]
hence
[TABLE]
Applying gives
[TABLE]
Now , thus with we infer
[TABLE]
By assumption for every . Thus from (24) and since further
[TABLE]
and after exponentiating again we get
[TABLE]
with some constant . On the other hand, again from (23) we derive
[TABLE]
Let . Finally since , for and we conclude and
[TABLE]
Putting we derive the claim from (25). â
5.2. Proofs from Section 3
For the proof of Theorem 3.1 we utilize an auxiliary result established within the proof of [14, Theorem 1.1]. It deals with almost-arithmetic sequences in Cantor sets. While originally formulated only for similarity Cantor sets, as pointed out in Section 1.2 we may extend its claim to Cantor sets as in Definition 1. We do not rephrase the notion of almost-arithmetic from [14] and restrict to the arithmetic sequence setting that suffices for our proof.
Lemma 5.3** (Fishman, Simmons).**
Let be a Cantor set which satisfies OSC. There exists a positive integer with the property that if set contains an arithmetic progression of length , then the entire line segment joining these points is contained in . In particular, if contains no line segment, then no non-constant arithmetic progression of length is contained in .
The lemma will apply to the first condition of Theorem 3.1. For the implication from the latter condition, we will employ our counting result Theorem 4.1
Proof of Theorem 3.1.
As pointed out the claim is almost an immediate consequence of Lemma 5.3. In our situation, given and , we consider for chosen such that is the rational number with denominator that is closest to the -th coordinate of . Clearly . Assume the first condition of the theorem. Let be large enough that contains no arithmetic sequence of length as in Lemma 5.3. Then with as in the theorem, the rational vectors
[TABLE]
have common denominator at most and form an arithmetic progression. Thus not all can belong to as otherwise by Lemma 5.3 the line segment joining and would be contained in , contradicting our hypothesis. On the other hand we easily see that any element of the progression has distance from .
Finally, assume the second condition . Then for every prime number with again let be the rational vector with numerator coordinates chosen so that is closest to . We see that . Moreover, for these vectors are clearly pairwise distinct and by Prime Number Theorem there are such vectors. On the other hand, by Theorem 4.1 there are only rational vectors in with denominator at most . Thus if , for large some must lie outside and satisfy the desired property. â
The proof of Theorem 3.2 requires more preparation. The next lemma comprises some estimates on continued fractions and is partly well-known.
Lemma 5.4**.**
Let be a real number with sequence of convergents . Then
[TABLE]
Moreover, if is given and is any rational number with , then
[TABLE]
For the proof recall that for an origin-symmetric convex set and a lattice , the -th successive minimum of with respect to is defined as the infimum of real numbers such that contains linearly independent vectors (for ). Minkowskiâs Second Convex Body Theorem then bounds the product of all successive minima in terms of the volume of , the fundamental area of the lattice and . In particular the case we will require reads as
[TABLE]
Proof of Lemma 5.4.
The inequalities of (26) are in fact well-known. Recall that two consecutive covergents have distance . In particular convergents lie alternatingly on the left and the right of the limit, and the right inequality follows. The left estimate follows similarly incorporating also that lies closer to than , also a well-known fact. We have to show the second claim involving (27). Define the convex body
[TABLE]
and the lattice
[TABLE]
The lattice has determinant and the rectangular convex body has volume . We may assume and thus for all large . Since we know from the theory of continued fractions and (26) that
[TABLE]
we see that the point lies in . Hence the first successive minimum of with respect to satisfies . By Minkoswkiâs second Convex Body Theorem (28) we conclude that the second successive minimum satisfies
[TABLE]
Thus there is no lattice point linear independent from in the region
[TABLE]
In other words, for any linearly independent from and with we have . The proof of the second claim is finished. â
For the density result in Theorem 3.2 we utilize the following lemma.
Lemma 5.5**.**
Let be a Cantor set. Assume for every function there exists so that
[TABLE]
has infinitely many solutions . Then the set of with the same property is dense in .
Proof of Lemma 5.5.
Let arbitrary with address and write so that . For given and , we construct a -approximable point with . For again the largest absolute value of the contraction factors and the diameter of , take an integer large enough so that . Then consider the function for a large integer dependent only on (and thus ) to be chosen later. By assumption there exists that is -approximable. Define . Then we have
[TABLE]
as the addresses of and coincide up to the -th place. On the other hand, we claim that is -approximable if was chosen large enough. To see this first notice that as are linear maps with rational coefficients, also induces a linear, rational transformation , with and . It is not hard to see that if some is -approximable for some function , then (with as above) is -approximable, for sufficiently large depending only on . This is readily derived from the facts that (since is a contraction) and , where denotes the common denomintor of a rational vector. Application to and starting with some corresponding suitable value yields that is -approximable. â
Now we can prove Theorem 3.2.
Proof of Theorem 3.2.
We recursively define a fast growing lacunary sequence of positive integers that will induce satisfying (8), as carried out below. Assume for the moment this sequence is fixed. Write and for integers . Let be two different contractions in our IFS and without loss of generality assume is the map whose fixed point is rational. Let for be the contraction factors of and respectively and let . We define by
[TABLE]
This means that the contraction is at the -th positions and otherwise. Assume we have chosen and want to construct the remaining sequence with the property stated in the theorem. Take
[TABLE]
This vector clearly lies in . Then clearly the suffix vector of is the fixed point of , so that and recall is assumed to be rational. Since both are rational-preserving, we see that is also a rational vector (if the IFS is affine then with denominator if is the largest denominator among the contraction factors, but we will not need this). Write in lowest terms, with . Next, we claim that
[TABLE]
where denotes the diameter of our compact Cantor set . Observe
[TABLE]
for
[TABLE]
some well-defined limit in , since are contractions with factor at most and there are a total of contractions applied. It then suffices to notice that as they both belong to , to derive (31). From (31) we see that can be made arbitrarily small when taking large enough, which is all we need for the sequel.
Since by definition, we may assume is large enough that is a convergent (not necessarily in lowest terms!) to for any . Let be the preceding convergent and be the convergent following , for . We have to justify that this is well-defined, in the sense that and do only depend on but not on the exact choices of , for any given sufficiently large and much larger . It is clear for the preceding convergent . For , notice that when we choose much larger than as well then we can guarantee that is a convergent to as well, by the same argument as above. Thereby we can reconstruct the convergents of up to . Now by definition of as the subsequent convergent of . Hence indeed once we have chosen large and assume exceeds by a large amount, everything is well-defined. Since by Lemma 5.4
[TABLE]
and is fixed, we infer from (31) that we can make arbitrarily large by choosing accordingly large (note that for this argument we do not require to be in lowest terms, the same applies to any argument below).
By Lemma 5.4 we know that
[TABLE]
and for any ratinal number with we have
[TABLE]
So let . Thus for any as above
[TABLE]
Recall is fixed so is a constant as well. On the other hand
[TABLE]
Now by assumption tends to [math], and we have observed above that we may choose and consequently arbitrarily large. Thus we may choose large enough so that , and (32) and (33) imply
[TABLE]
for any with . Since this holds for any and , this means that any with satisfies
[TABLE]
The desired property holds for . Repeating this process, we get a sequence of values with property (8) for defined in (29).
To finish the proof, we show that all vectors derived from our construction are irrational, and that we can construct uncountably many distinct ones among them. The density is then also implied by Lemma 5.5. Clearly the the method is flexible enough to provide uncountably many formal elements with the given property. If we assume any element has at most countably many addresses, we are done. If not, by hypothesis we may assume are one-to-one. This case requires more work. We first show that any constructed above is irrational. Observe that by the fast growth of the , we may assume that the approximating rational vectors to satisfy
[TABLE]
In particular any is a convergent to (not necessarily in lowest terms). Note that the denominators tend to infinity, since we divide by some integer in each contraction step. If some coordinate were rational, then clearly any rational number has distance unless . Hence, in view of (34), if was rational, then we must have for all large . In particular for large . Hence, if all coordinates are rational, by increasing if necessary we have the identity for all coordinates , that is for any large . Since the addresses of share the same prefix up to and are one-to-one by assumption, applying inverse functions repeatedly we infer an identity
[TABLE]
Recall fixes . In fact, is the only solution to since is one-to-one. Now note that if all contractions of the IFS fix the same element , it is easy to check that the Cantor set collapses to a single point , but then has uncountably many addresses, which we have dealt with before. Thus we may assume does not fix , i.e. . Then by the above observation that the preimage under is only , we see that (35) cannot hold for any choice of . Thus we have confirmed that any in our construction is irrational. Lemma 5.5 and its proof show that by taking finite forward orbit of some under the IFS essentially preserves the property, so we obtain a countably infinite set of suitable that is dense in . We only sketch the proof of why the set is actually uncountable and omit rigorous calculations. Assume are two as in (29) arising from sequences and , respectively. We claim that if they are ordered with very large gaps between two consecutive elements, then . If true this clearly implies we get an uncountable family of suitable . The claim is obvious if there is some coordinate for which is rational and is irrational, or vice versa. Thus, as we have shown above that both vectors are irrational, we may assume there is an index with both irrational. To show the claim, observe that the respective rational approximations as in (30) are again very good approximating convergents to . If we choose the gaps between two consecutive elements of sufficiently large in each step, then we will have for any , where denotes written in lowest terms. Here we use that the denominators of convergents grow fast when the approximation is good, a well-known fact from the theory of continued fractions, see (26). In fact, with a proper choice the convergent of following will still have larger denominator than . Hence is a convergent to but no convergent to , thus the continued fraction expansion of and are not the same, consequently and . â
We turn towards the proof of Theorem 3.4. For convenience, we will use the framework of parametric geometry of numbers introduced in [29], essentially a parametric logarithmic version of Minkowskiâs Second Lattice Point Theorem. We only need the special case of approximation to a single number, which corresponds to in the notation of [29]. This means essentially we use a parametric, logarithmic version of formula (28) above. Concretely, for given , similar as for the proof of Lemma 5.4 consider the lattice and the family of convex bodies parametrized by of the form
[TABLE]
Observe that a point in corresponds to the system of inequalities
[TABLE]
Denote by the successive minima of with respect to the lattice , that is is the minimum value for which contains linearly independent points of , for . According to Minkowskiâs Second Convex Body Theorem (28), in view of and , we infer
[TABLE]
If we let and for , then we obtain
[TABLE]
The functions are piecewise linear with slopes among . More precisely, if with are the vectors realizing the -th minimum at given position for , then
[TABLE]
where for we denoted
[TABLE]
In particular has its minimum at the point position with where the expressions in the maximum coincide. This setup will suffice for our purpose to prove Theorem 3.4, we refer to [29] for parametric geometry of numbers with respect to simultaneous rational approximation to .
Proof of Theorem 3.4.
First consider the special case . Fix any . Let . Let further be given. Note we are in the situation of Theorem 1.1. Application of Theorem 1.1 to yields that the system
[TABLE]
has a solution in positive integers such that . Write with . Since is irrational in fact . Transition to logarithmic scale yields that the minimum of the function is attained for
[TABLE]
and at this position we have
[TABLE]
Clearly we started with is linearly independent to , since this just rephrases as , which is true since but . Hence by (37) we have
[TABLE]
as the reverse estimate would imply , contradicting (37). In view of the definition of in (38), equivalently at least one of the inequalities
[TABLE]
and
[TABLE]
holds. Thus, if the first estimate is violated, which just becomes
[TABLE]
then the second one is correct which yields
[TABLE]
However, (39) is satisfied since , therefore we conclude
[TABLE]
Notice that the bound is independent from the choice of . Assume the distance for some was smaller than the right hand side of (40) divided by . Then by compactness of there is realizing this distance . Clearly , since for these numbers we have (40). However, since is dense in , we get a contradiction to (40) anyway by choosing sufficiently close to . Hence the right hand side in (40) divided by is a lower bound for , which means (11) is true. Since and were chosen arbitrary, we readily infer (12) from (40) as well. This finishes the proof of the special case .
For the general case of any monic, rationally generated Cantor set with open set condition, by Theorem 1.2 for any the estimates
[TABLE]
admit a solution for any large and some constant . For given , we proceed as above for to obtain
[TABLE]
and the claim follows again by choosing sufficiently large to guarantee
[TABLE]
simultaneously for any . â
A similar strategy is applied for the proof of Theorem 4.6 below, indeed the right claim of (17) rewritten as resembles the assertion of Theorem 3.4.
5.3. Proofs from Section 4
We start this section with the proof of the counting results. For this employ Proposition 5.1 above.
Proof of Theorem 4.1.
Let be an integer. Assume there are more than distinct rational vectors in each with common denominator at most . Then by Proposition 5.1 there are two vectors among them that differ by at most . On the other hand, if we write , then
[TABLE]
We conclude . In other words, if then there are at most rational vectors with common denominator at most . Now for given , let be the unique integer with . Then by the above argument there are at most rational vectors with common denominator at most . â
The estimate extends to bound the cardinality of vectors with each denominator . The proof of Theorem 4.2 employs Liouvilleâs inequality.
Proof of Theorem 4.2.
Let be distinct algebraic vectors with entries of degree at most and heights at most , respectively. Since the vectors are distinct there is an index with . Then Liouvilleâs inequality [7, Theorem A.1, Corollary A.2] yields
[TABLE]
Using this estimate in place of (41), the claim follows very similarly as Theorem 4.1. â
Next we show Theorem 4.3.
Proof of Theorem 4.3.
Let be an address of and , so that . Assume is the (possibly empty) preperiod and is the successive period. Let so that . By construction . For simplicity write and , with as in Definition 5, so that . Therefore from the concatenation we obtain an identity , for some . Since induce contractions so does any product, so is not an eigenvalue and we see is given as . Hence as and . Thus also is rational since are rational-preserving.
Conversely, assume the IFS is unimodular and take arbitrary . Again assume is any formal representation of . Consider the sequence , which is well-defined as clearly are bijective if the IFS is unimodular. Then obviously for any . Moreover, when building the inverses to derive from , it follows from the rational IFS being unimodular that the denominators that occur are divisors of with . Here we use that when building the inverses with Cramerâs rule we do not get additional factors in the denominator by unimodularity of the matrices, and the shift vectors can possible only cause a factor that divides . Since is compact with some finite diameter , there are at most rational vectors in with this property. Moreover, since with denominator we infer from Theorem 4.1 and its proof that there are at most such vectors (we may remove the factor in the exponent since all denominators divide , see the proof of Theorem 4.1). Hence the number is . By this finiteness, some rational vector must occur twice, that is for some . This means . Hence
[TABLE]
In the last identity we used that are contractions. Thus composed with is a periodic address of . â
The estimate on rationals in whose denominator divides we used is potentially very crude, we believe in fact should be the correct order of period lengths.
Proof of Corollary 4.4.
For the first claim let be as in the theorem and their product. We notice that for a given prime it follows directly from [3, Lemma 3] that for some diving and all . Thus, since for we have that is the lowest common multiple of the orders over and are distinct primes not dividing , we see that is divisible by and thus . On the other hand, according to Proposition 4.10 the period length of equals , which is by Theorem 4.3. For large we get a contradiction as . For the second claim, again since the period length of is , it divides . Since is prime the only possible divisors are . On the other hand, by Theorem 4.3 the period length is . Since for large the divisors can be ruled out, so which only gives finitely many values of as well. In both claims, since this yields only finitely many potential rational numbers of the stated form. â
As indicated above, the proof of Theorem 4.6 is similar to the one of Theorem 3.4.
Proof of Theorem 4.6.
As in Lemma 5.4 let be the convergents of . We only show the left inequality of (17), the right is proved analogously. We may assume as otherwise the claim is trivial. For simplicity write . Let . Recall from the theory of continued fractions that any fraction that is no convergent to satisfies . Thus, our assumption implies that there exist arbitrarily large indices so that the convergent lies in and has the property
[TABLE]
By Lemma 5.4 we have so for large we infer
[TABLE]
Moreover again Lemma 5.4 shows that for any with we have . In particular this estimate holds for any with . Thus for and any such with we have
[TABLE]
On the other hand from (43) we know . Thus the left hand side is for any with . The left inequality in (17) follows since clearly as and can be taken arbitrarily small. As indicated above, an analogous argument starting with yields the right estimate in (17).
In the case that is a Cantor set as in the last claim, we now provide the reverse of the left estimate of (17) in order to show (18). First assume . We may again assume strict inequality as if otherwise , the claimed estimate is a consequence of (17) and (16). This again implies certain convergents satisfy as above. Let be an arbitrary, large real number. Let be the index such that . Then by Lemma 5.4 we have
[TABLE]
If , then since we may simply choose . Now assume . Then by (43), for large additionally to (44) we have
[TABLE]
Combining, for any given natural number and any , we have
[TABLE]
Now, from Lemma 5.3 we see that for large and some the expression does not belong to . By the above estimate, as can be chosen arbitrarily small and was chosen arbitrary, we verify the reverse inequality
[TABLE]
so by (17) we must have equality. Hence (18) holds in this case.
Finally assume . Then we have for some and any . On the other hand, by Dirichletâs Theorem we know that for any parameter there is a rational number with and . Combining these observations, for large these rationals must lie outside . Hence , where the last identity is Khintchineâs result already mentioned in (16). Again we conclude (18). â
The question arises if we can reverse the argument of the proof to infer âgoodâ intrinsic rational approximations to from âbadâ uniform extrinsic approximation of , corresponding to a hypothetical inequality like if is small enough (it is in general false by a metrical argument if ). The problem is that in the lattice point problem studied above, both successive minima may be throughout realized by vectors that lead to rational numbers in , for , in which case can only infer . Nevertheless, as this seems to be rather exceptional situation that may not occur, the estimate may be true if .
Problem 5**.**
Assume . Does it follow that ?
We turn towards the verification of Theorem 4.9.
Proposition 5.6**.**
Let an integer and . Assume is the base representation of a rational number. If belong to and for some , then .
Proof.
If has a unique base expansion then the claim follows from . If the representation is not unique then there are two base representations of , one ending in and the other ending in . However, since and for some and both letters appear in the period above, clearly is not of this form, contradiction. â
Proof of Theorem 4.9.
Clearly any has ultimately periodic base expansion, and the representation of in (19) via with in (20) is carried out straightforwardly as in [5, Lemma 2.3]. Let . If so that the first digit ouside belongs to the preperiod or equals the first period digit, then the estimate follows from the elementary estimate , as discussed in Section 4.4. Thus we may assume . Obviously has distance at most from . By definition of clearly . On the other hand, by our assumption and by Proposition 5.6 we have . Hence, by Theorem 3.4 the rational number has distance at least from any element of for some uniform , in particular from . Comparison yields . â
Proof of Corollary 4.12.
Obviously , and if the claim is obvious. Otherwise there is some . If , by taking , from Theorem 4.9 we get . We get a contradiction by our assumptions on as soon as . Hence , and since was arbitrary the sets are equal. â
The author thanks the referee for the careful reading and suggestions for improvement. The author further thanks Simon Kristensen, Diego Marques, Nikita Sidorov, Michael Coons and Igor Shparlinski for help with references!
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Ălvarez-Samaniego, W.P. Ălvarez-Samaniego, J. Ortiz-Castro. Some existence results on Cantor sets. J. Egyptian Math. Soc. 25 (2017), no. 3, 326â330.
- 2[2] S. Baker. An analogue of Khintchineâs theorem for self-conformal sets. to appear in Math. Proc. Cambridge Philos. Soc., ar Xiv: 1609.04588 .
- 3[3] V. Ya. Bloshchitsyn. Rational points in m-adic Cantor sets. J. Math. Sci. (N.Y.) 211 (2015), no. 6, 747â751.
- 4[4] D. Boes, R. Duane, P. Erdös. Fat, symmetric, irrational Cantor sets. Amer. Math. Monthly 88 (1981), no. 5, 340â341.
- 5[5] R. Broderick, L. Fishman, A. Reich. Intrinsic approximation on Cantor-like sets, a problem of Mahler. Mosc. J. Comb. Number Theory 1 (2011), no. 4, 3â12.
- 6[6] N. Budarina, D. Dickinson, J. Levesley. Simultaneous Diophantine approximation on polynomial curves. Mathematika 56 (2010), no. 1, 77â85.
- 7[7] Y. Bugeaud. Approximation by algebraic numbers. Cambridge Tracts in Mathematics, 160. Cambridge University Press, Cambridge , 2004.
- 8[8] Y. Bugeaud. Diophantine approximation and Cantor sets. Math. Ann. 314 (2008), 677â684.
