Overlapping iterated function systems from the perspective of Metric Number Theory
Simon Baker

TL;DR
This paper introduces a novel metric number theory approach to analyze overlapping iterated function systems, revealing Khintchine-like behavior and providing new proofs for classical results on Bernoulli convolutions and measure properties.
Contribution
It develops a new method inspired by Diophantine approximation to study overlaps in iterated function systems and introduces the concept of being consistently separated with respect to a measure.
Findings
Typical systems exhibit Khintchine-like measure behavior
Identifies conditions for exact overlaps in a specific family of IFS
Provides new proofs of classical measure-theoretic results
Abstract
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums. For many parameterised families of overlapping iterated function systems, we prove that a typical member will exhibit similar Khintchine like behaviour. Families of iterated function systems our results apply to include those arising from Bernoulli convolutions, the problem, and affine contractions with varying translation parameter. As a by-product of our analysis we obtain new proofs of well known results due to Solomyak on the absolute continuity of Bernoulli convolutions, and when the attractor in the problem has…
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.
Overlapping iterated function systems from the perspective of Metric Number Theory
Simon Baker
School of Mathematics,
University of Birmingham,
Birmingham, B15 2TT, UK.
Email: [email protected]
Abstract
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation which shows that for a family of limsup sets, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums. For many parameterised families of overlapping iterated function systems, we prove that a typical member will exhibit similar Khintchine like behaviour. Families of iterated function systems that our results apply to include those arising from Bernoulli convolutions, the problem, and affine contractions with varying translation parameter. As a by-product of our analysis we obtain new proofs of some well known results due to Solomyak on the absolute continuity of Bernoulli convolutions, and when the attractor in the problem has positive Lebesgue measure.
For each we let be the iterated function system given by
[TABLE]
We prove that either contains an exact overlap, or we observe Khintchine like behaviour. Our analysis shows that by studying the metric properties of limsup sets, we can distinguish between the overlapping behaviour of iterated function systems in a way that is not available to us by simply studying properties of self-similar measures.
Last of all, we introduce a property of an iterated function system that we call being consistently separated with respect to a measure. We prove that this property implies that the pushforward of the measure is absolutely continuous. We include several explicit examples of consistently separated iterated function systems.
Mathematics Subject Classification 2010: 11K60, 28A80, 37C45.
Key words and phrases: Overlapping iterated function systems, Khintchine’s theorem, self-similar measures.
Contents
-
2.3.1 New methods for distinguishing between the overlapping behaviour of IFSs
-
9.2 The non-existence of Khintchine like behaviour without exact overlaps
1 Introduction
Attractors generated by iterated function systems are among the first fractal sets a mathematician encounters. The familiar middle third Cantor set and the Koch curve can both be realised as attractors for appropriate choices of iterated function system. Attractors generated by iterated function systems have the property that they are equal to several scaled down copies of themselves. When these copies are disjoint, or satisfy some weaker separation assumption, then much can be said about the attractor’s metric and topological properties. However, when these copies overlap significantly the situation is much more complicated. Measuring how an iterated function system overlaps, and determining properties of the corresponding attractor, are two important problems that are occupying much current research (see for example [24, 25, 50, 51, 53, 60, 61]). The purpose of this paper is to develop a new approach for measuring how an iterated function system overlaps. This approach is inspired by classical results from Diophantine approximation and metric number theory. One such result due to Khintchine demonstrates that for a class of limsup sets defined in terms of the rational numbers, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums (see [31]). Importantly this result provides a quantitative description of how the rational numbers are distributed within .
In this paper we study limsup sets that are defined using iterated function systems (for their definition see Section 1.3). We are motivated by the following goals:
We would like to determine whether it is the case that for a parameterised family of iterated function systems, a typical member will satisfy an appropriate analogue of Khintchine’s theorem. 2. 2.
We would like to answer the question: Does studying the metric properties of these limsup sets allow us to distinguish between the overlapping behaviour of iterated function systems in a way that was not previously available? 3. 3.
We would like to understand how the metric properties of these limsup sets relates to traditional methods for measuring how an iterated function system overlaps, such as the dimension and absolute continuity of self-similar measures.
In this paper we make progress with each of these goals. Theorems 2.2, 2.6 and 2.9 address the first goal. These results demonstrate that for many parametrised families of overlapping iterated function systems, it is the case that a typical member will satisfy an appropriate analogue of Khintchine’s theorem. To help illustrate this point, and to motivate what follows, we include here a result which follows from Theorem 2.2.
Theorem 1.1**.**
For Lebesgue almost every Lebesgue almost every is contained in
[TABLE]
Theorem 2.10 allows us to answer the question stated in our second goal in the affirmative. See the discussion in Section 2.3.1 for a more precise explanation. Theorem 2.15 addresses the third goal. It shows that if we are given some measure , and our iterated function system satisfies a strong version of Khintchine’s theorem with respect to , then the pushforward of must be absolutely continuous. Moreover, we demonstrate with several examples that this strong version of Khintchine’s theorem is not equivalent to the absolute continuity of the pushforward measure.
In the rest of this introduction we provide some more background to this topic, and introduce the limsup sets that will be our main object of study.
1.1 Attractors generated by iterated function systems
We call a map a contraction if there exists such that for all . We call a finite set of contractions an iterated function system or IFS for short. A well known result due to Hutchinson [26] states that given an IFS then there exists a unique, non-empty, compact set satisfying
[TABLE]
We call the attractor generated by . When an IFS satisfies for all , or is such that there exists an open set for which for all and for all then many important properties of can be determined (see [17]). This latter property is referred to as the open set condition. Without these separation assumptions determining properties of the attractor can be significantly more complicated.
The study of attractors generated by iterated function systems is classical within fractal geometry. One of the most important problems in this area is to determine the metric properties of attractors generated by overlapping iterated function systems. To understand the properties of an attractor in both the overlapping case and non-overlapping case, it is useful to study measures supported on . A particularly distinguished role is played by the measures described below, that are in a sense dynamically defined.
Let be given by
[TABLE]
The map is surjective and is also continuous when is equipped with the product topology. The sequence space comes with a natural left-shift map defined via the equation . Given a finite word we associate its cylinder set
[TABLE]
We call a measure on -invariant if for all finite words . We call a probability measure ergodic if implies or . Given a measure on we obtain the corresponding pushforward measure supported on using the map i.e. .
We define the dimension of a measure on to be
[TABLE]
Note that for any pushforward measure we have The problem of determining is often solved by finding a -invariant ergodic probability measure whose pushforward has dimension equal to some known upper bound for . This approach is especially useful when the iterated function system is overlapping.
When studying attractors of iterated function systems, one of the guiding principles is that if there is no obvious mechanism preventing an attractor from satisfying a certain property, then one should expect this property to be satisfied. This principle is particularly prevalent in the many conjectures which state that under certain reasonable assumptions, the Hausdorff dimension of , and the Hausdorff dimension of dynamically defined pushforward measures supported on , should equal the value predicted by a certain formula. A particular example of this phenomenon is provided by self-similar sets and self-similar measures. We call a contraction a similarity if there exists such that for all . If an IFS consists of similarities then it is known that
[TABLE]
where is the unique solution to . Given a probability vector we let denote the corresponding Bernoulli measure supported on If an IFS consists of similarities, then we define the self-similar measure corresponding to p to be The measure can also be defined as the unique measure satisfying the equation
[TABLE]
For any self-similar measure we have the upper bound:
[TABLE]
For an appropriate choice of it can be shown that equality in (1.2) implies equality in (1.1). An important conjecture states that if an IFS consisting of similarities avoids certain degenerate behaviour, then we should have equality in (1.2) for all and therefore equality in (1.1) (see [24, 25]). In this conjecture can be stated succinctly as: If an IFS does not contain an exact overlap, then we should have equality in (1.2) for all p. Recall that an IFS is said to contain an exact overlap if there exists two distinct words and such that
[TABLE]
In [24] and [25] significant progress was made towards this conjecture. In particular, in [24] it was shown that for an IFS consisting of similarities acting on if strict inequality holds in (1.2) for some then
[TABLE]
where
[TABLE]
Using this statement, it can be shown that if the parameters defining the IFS are algebraic, and there are no exact overlaps, then equality holds in (1.2) for all and therefore also in (1.1) .
In addition to expecting equality to hold typically in (1.2), it is expected that if
[TABLE]
and the IFS avoids certain obstacles, then will be absolutely continuous with respect to -dimensional Lebesgue measure. A standard technique for proving an attractor has positive -dimensional Lebesgue measure is to show that there is an absolutely continuous pushforward measure. Note that by a recent result of Simon and Vágó [56], it follows that the list of mechanisms leading to the failure of absolute continuity is strictly greater than the list of mechanisms leading to the failure of equality in (1.2).
The usual methods for gauging how an iterated function system overlaps are to determine whether the Hausdorff dimension of the attractor satisfies a certain formula, to determine whether the dimension of pushforwards of dynamically-defined measures satisfy a certain formula, and to determine whether these measures are absolutely continuous with respect to the -dimensional Lebesgue measure. If an IFS did not exhibit the expected behaviour, then this would be indicative of something degenerate within our IFS that was either preventing from being well spread out within , or was forcing mass from the pushforward measure into some small subregion of . This method for gauging how an iterated function system overlaps has its limitations. If each of the expected behaviours described above occurs for two distinct IFSs within a family, then we have no method for distinguishing their overlapping behaviour. The approach put forward in this paper shows how we can still make a distinction (see the discussion in Section 2.3.1). As previously stated this approach is inspired by results from Diophantine approximation and metric number theory. We now take the opportunity to briefly recall some background from this area.
1.2 Diophantine approximation and metric number theory
Given we can define a limsup set defined in terms of neighbourhoods of rationals as follows. Let
[TABLE]
Here and throughout we use i.m. as a shorthand for infinitely many. If we say that is -approximable. An immediate application of the Borel-Cantelli lemma implies that if then has zero Lebesgue measure. The following theorem due to Khintchine shows that a partial converse to this statement holds. This theorem motivates much of the present work.
Theorem 1.2** (Khintchine [31]).**
If is decreasing and
[TABLE]
then Lebesgue almost every is -approximable.
Results analogous to Khintchine’s theorem are ubiquitous in Diophantine approximation and metric number theory. We refer the reader to [7] for more examples.
By an example of Duffin and Schaeffer, it can be seen that it is not possible to remove the decreasing assumption from Theorem 1.2. Indeed in [13] they constructed a such that yet has zero Lebesgue measure. This gave rise to a conjecture known as the Duffin-Schaeffer conjecture which was recently proved by Koukoulopoulos and Maynard in [33].
Theorem 1.3** ([33]).**
If satisfies
[TABLE]
then Lebesgue almost every is -approximable.
Here is the Euler totient function.
By studying the Lebesgue measure of for those satisfying we obtain a quantitative description of how the rationals are distributed within the reals. The example of Duffin and Schaeffer demonstrates that there exists some interesting non-trivial interactions occurring between fractions of different denominator.
1.3 Two families of limsup sets
Before defining the limsup sets we study in this paper, it is necessary to introduce some notation. In what follows we let
[TABLE]
Given an IFS and let
[TABLE]
Let denote the length of . If has attractor then for each let
[TABLE]
1.3.1 The set
Given an IFS , and an arbitrary we let
[TABLE]
Throughout this paper we will always have the underlying assumption that satisfies
[TABLE]
This condition guarantees
[TABLE]
The study of the metric properties of will be one of the main focuses of this paper. Proceeding via analogy with Khintchine’s theorem, it is natural to wonder what metric properties of are encoded in the volume sum:
[TABLE]
It is an almost immediate consequence of the definition of Hausdorff measure that if we have convergence in (1.3), then for all . Given the results mentioned in the previous section, it is reasonable to expect that divergence in (1.3) might imply some metric property of which demonstrates that a typical element of is contained in . A classification of those for which divergence in (1.3) implies a typical element of is contained in would provide a quantitative description of how the images of are distributed within . This in turn provides a description of how the underlying iterated function system overlaps. This idea provides us with a new tool for describing the overlapping behaviour of iterated function systems. We refer the reader to Section 2.3.1 for further discussions which demonstrate the utility of this idea.
The question of whether divergence in (1.3) implies a typical element of is contained in was studied previously by the author in [2, 3, 4]. Related work appears in [34, 43, 44]. In [2] the following theorem was proved:
Theorem 1.4**.**
[2*, Theorem 1.4]**
If is a conformal iterated function system and satisfies the open set condition, then for any if is a decreasing function and satisfies*
[TABLE]
then -almost every is contained in
Note that for a conformal iterated function system it is known that the open set condition implies (see [38]). For the definition of a conformal iterated function system see Section 2.5. Note that an iterated function system consisting of similarities is automatically a conformal iterated function system. In [2, Theorem 6.1] it was also shown that if is a conformal iterated function system and contains an exact overlap, then there exist many natural choices of such that we have divergence in (1.3), yet As such an exact overlap effectively prevents any Khintchine like behaviour.
In [3] and [4] the author studied the family of IFSs where . For each element of this family the corresponding attractor is In [3] the author proved that if the reciprocal of belongs to a special class of algebraic integers known as Garsia numbers, then for a general class of , divergence in (1.3) implies that for all Lebesgue almost every is contained in . For more on this result and Garsia numbers we refer the reader to Section 9 where this result is recovered using a different argument. The main result of [2] provides strong evidence to suggest that for a general class of , for a typical we should expect that divergence in (1.3) implies that Lebesgue almost every is contained in . A consequence of the main result of [2] is that for Lebesgue almost every for all Lebesgue almost every is contained in . Note that the results in [3] and [4] are phrased for but can easily be adapted to the case of arbitrary .
1.3.2 The set
Instead of studying the sets directly it is more profitable to study a related family of auxiliary sets. These sets are interesting in their own right and are defined in terms of a measure supported on . Our approach doesn’t work for all and we will require the following additional regularity assumption.
Given a probability measure supported on we let
[TABLE]
We say that is slowly decaying if . If is slowly decaying, then for -almost every we have
[TABLE]
for all Examples of slowly decaying measures include Bernoulli measures, and Gibbs measures for Hölder continuous potentials (see [10]). In fact any measure with the quasi-Bernoulli property is slowly decaying.
Given a slowly decaying probability measure , for each we let
[TABLE]
and
[TABLE]
The elements of are disjoint and the union of their cylinders has full measure. Importantly, by the slowly decaying property, the cylinders corresponding to elements of have comparable measure up to a multiplicative constant. Note that when is the uniform Bernoulli measure the set is simply .
Given and a slowly decaying probability measure we let
[TABLE]
Obtaining information on how the elements of are distributed within for different values of will occupy a large part of this paper.
Given a slowly decaying measure an IFS , and we can define a limsup set as follows. Let
[TABLE]
Here and throughout denotes the closed Euclidean ball centred at with radius . Throughout this paper we will always assume that is non-atomic and is a bounded function. These properties ensure
[TABLE]
In this paper we study the metric properties of the sets for parameterised families of IFSs when the underlying attractor typically has positive -dimensional Lebesgue measure. In which case, for the set the appropriate volume sum that we expect to determine the Lebesgue measure of is
[TABLE]
It can be shown using the Borel-Cantelli lemma that if then has zero Lebesgue measure. For us the interesting question is: When does imply that has positive or full Lebesgue measure?
The sets are easier to work with than the sets . In particular we can use properties of the measure to aid with our analysis. As we will see, the sets can be used to prove results for the sets but only under the following additional assumption. Given a slowly decaying measure and we say that is equivalent to if
[TABLE]
for each for all . Here and throughout, for two real valued functions and defined on some set , we write if there exists a positive constant such that
[TABLE]
for all . As we will see, if is equivalent to and has positive Lebesgue measure, then will also have positive Lebesgue measure (see Lemma 3.7).
2 Statement of results
Before stating our theorems we need to define the entropy of a measure supported on and introduce a class of functions that are the natural setting for some of our results.
For any -invariant measure supported on we define the entropy of to be
[TABLE]
The entropy of a -invariant measure always exists.
Given a set we define the lower density of to be
[TABLE]
and the upper density of to be
[TABLE]
Given let
[TABLE]
and
[TABLE]
We also define
[TABLE]
and
[TABLE]
For any we have Therefore It can be shown that contains all decreasing functions satisfying . Most of the time we will be concerned with the class of functions . The class will only appear in Theorem 2.10.
We say that a function is weakly decaying if
[TABLE]
Given a measure supported on we let
[TABLE]
As we will see, the weakly decaying property will allow us to obtain full measure statements.
2.1 Parameterised families with variable contraction ratios
Let be a finite set of real numbers. To each we associate the iterated function system
[TABLE]
It is straightforward to check that the corresponding attractor for is
[TABLE]
and the projection map takes the form
[TABLE]
To study this family of iterated function systems, it is useful to study the set and the corresponding class of power series
[TABLE]
To each we associate the set
[TABLE]
In other words, is the set of that can be realised as a double zero for a non-trivial function in We let
[TABLE]
if and let otherwise.
These families of iterated function systems were originally studied by Solomyak in [58]. He was interested in the absolute continuity of self-similar measures. In particular, he was interested in the pushforward of the uniform Bernoulli measure. We denote this measure by The main result of [58] is the following theorem.
Theorem 2.1**.**
For Lebesgue almost every the measure is absolutely continuous and has a density in .
Using Theorem 2.1, Solomyak proved the well known result that for Lebesgue almost every the unbiased Bernoulli convolution is absolutely continuous and has a density in . As a by-product of our analysis, in Section 4 we give a short intuitive proof that for Lebesgue almost every the unbiased Bernoulli convolution is absolutely continuous. Instead of using the Fourier transform or by differentiating measures, as in [58] and [41], our proof makes use of the fact that self-similar measures are of pure type, i.e. they are either singular or absolutely continuous with respect to the Lebesgue measure. As a further by-product of our analysis, in Section 4 we recover another result of Solomyak from [58]. We prove that for Lebesgue almost every the set
[TABLE]
has positive Lebesgue measure. Interestingly our proof of this statement does not rely on showing that there is an absolutely continuous measure supported on this set. Instead we study a subset of this set, and show that for Lebesgue almost every this set has positive Lebesgue measure.
For the families of iterated function systems introduced in this section, our main result is the following.
Theorem 2.2**.**
Let be a finite set of real numbers. The following statements are true:
Let be a slowly decaying -invariant ergodic probability measure with and For Lebesgue almost every for any the set has positive Lebesgue measure. 2. 2.
Let be the uniform Bernoulli measure. For Lebesgue almost every for any and , the set has positive Lebesgue measure. 3. 3.
Let be a slowly decaying -invariant ergodic probability measure with and For Lebesgue almost every for any Lebesgue almost every is contained in 4. 4.
Let be the uniform Bernoulli measure. For Lebesgue almost every for any and Lebesgue almost every is contained in
To aid with our exposition we will prove in Section 4 the following corollary to Theorem 2.2.
Corollary 2.3**.**
Let be a finite set of real numbers and be a Bernoulli measure corresponding to the probability vector . Then for any , for Lebesgue almost every Lebesgue almost every is contained in the set
[TABLE]
In Section 4 we will apply these results to obtain more explicit statements in the setting of Bernoulli convolutions and the problem.
Certain lower bounds for the transversality constant are known. Let be a finite set of real numbers and assume for all so
[TABLE]
The proposition stated below provides a summary of the lower bounds obtained separately in [42], [45], and [54].
Proposition 2.4**.**
Let be a finite set of real numbers and be as above. Then the following statements are true:
- •
If then
- •
If then
- •
* whenever *
- •
* for all .*
2.2 Parameterised families with variable translations
Suppose is a collection of non-singular matrices each satisfying Here denotes the operator norm induced by the Euclidean norm. Given a vector we can define an IFS to be the set of contractions
[TABLE]
Unlike in the previous section where we obtained a family of iterated function systems by varying the contraction ratio, here we obtain a family by varying the translation parameter . For each we denote the attractor by and the corresponding projection map from to by . The attractor is commonly referred to as a self-affine set.
This family of iterated function systems was introduced by Falconer in [19], and subsequently studied by Solomyak in [57], and later by Jordan, Pollicott, and Simon in [28]. For this family an important result is the following.
Theorem 2.5** (Falconer [19], Solomyak [57]).**
Assume the satisfy the additional hypothesis that for all . Then for Lebesgue almost every the attractor satisfies:
[TABLE]
Here is a quantity known as the affinity dimension. For its definition see [19]. Theorem 2.5 was originally proved by Falconer in [19] under the assumption for all . This upper bound was improved to by Solomyak in [57]. The bound is known to be optimal (see [14, 55]). An analogue of Theorem 2.5 for measures was obtained by Jordan, Pollicott, and Simon in [28]. A recent result of Bárány, Hochman, and Rapaport [5] significantly improves upon Theorem 2.5. They proved that we have under some very general assumptions on the and . In particular, their result gives rise to many explicit examples where equality is satisfied.
Given we let
[TABLE]
and
[TABLE]
denote the singular values of . The singular values of a non-singular matrix are the positive square roots of the eigenvalues of Alternatively they are the lengths of the semiaxes of the ellipse Given a -invariant ergodic probability measure then there exist positive constants such that for -almost every we have
[TABLE]
for all . We call the numbers the Lyapunov exponents of . The existence of Lyapunov exponents for -invariant ergodic measures was established in [28].
The theorem stated below is our main result for this family of iterated function systems.
Theorem 2.6**.**
Suppose for all . Then the following statements are true:
Let be a slowly decaying -invariant ergodic probability measure with and For Lebesgue almost every , for any the set has positive Lebesgue measure. 2. 2.
Let be the uniform Bernoulli measure and suppose there exists such that for any . If then for Lebesgue almost every , for any and , the set has positive Lebesgue measure. 3. 3.
Let be a slowly decaying -invariant ergodic probability measure and . Suppose that and one of the following three properties are satisfied:
- •
Each is a similarity.
- •
* and all the matrices are equal.*
- •
All the matrices are simultaneously diagonalisable.
Then for Lebesgue almost every , for any Lebesgue almost every is contained in 4. 4.
Let be the uniform Bernoulli measure and suppose there exists such that for any . Suppose that and one of the following three properties are satisfied:
- •
* is a similarity.*
- •
.
- •
The matrix is diagonalisable.
*Then for Lebesgue almost every , for any and , Lebesgue almost every is contained in *
The following corollary follows immediately from Theorem 2.6.
Corollary 2.7**.**
Suppose there exists and such that for all . Then if we have that for Lebesgue almost every , for any Lebesgue almost every is contained in the set
[TABLE]
The assumption appearing in Theorem 2.6 is necessary as the example below shows.
Example 2.8**.**
Consider the iterated function system where and . Whenever we can apply a change of coordinates and identify this iterated function system with For any there exists such that contains an exact overlap. Using this fact and our change of coordinates, it can be shown that has zero Lebesgue measure when is the Bernoulli measure and is any bounded function.
Even though Example 2.8 demonstrates the condition is essential, the author expects Theorem 2.6 to hold more generally. In this paper we prove a random version of Theorem 2.6 which supports this claim. This random version is based upon the randomly perturbed self-affine sets studied in [28]. Our setup is taken directly from [28].
Fix a set of matrices each satisfying and a vector . We obtain a randomly perturbed version of the IFS in the following way. Suppose that is an absolutely continuous distribution with density supported on a disc . The distribution gives rise to a random perturbation of via the equation
[TABLE]
where the coordinates of
[TABLE]
are i.i.d. with distribution . For notational convenience we enumerate the errors using the natural numbers. Let be an arbitrary bijection. We obtain a sequence of errors according to the rule
[TABLE]
Given we obtain a perturbed version of our original attractor defined via the equation
[TABLE]
where is some sufficiently large ball. We let be the projection map given by
[TABLE]
On we define the measure
[TABLE]
We may now define our limsup sets for these randomly perturbed attractors. Given and we define
[TABLE]
Here denotes the element of obtained by concatenating the finite word with the infinite sequence Given a slowly decaying measure , and we let
[TABLE]
The sets and serve as our analogues of and in this random setting. Note here that we have defined our limsup sets in terms of neighbourhoods of rather than In the deterministic setting considered above these quantities coincide. In the random setup it is not necessarily the case that The theorem stated below is the random analogue of Theorem 2.6. It suggests that one should be able to replace the assumption with some other reasonable conditions.
Theorem 2.9**.**
Fix a set of matrices each satisfying and . Then the following statements are true:
Let be a slowly decaying -invariant ergodic probability measure with and For -almost every for any the set has positive Lebesgue measure. 2. 2.
Let be the uniform Bernoulli measure and suppose there exists such that for all . If , then for -almost every , for any and the set has positive Lebesgue measure. 3. 3.
Let be a slowly decaying -invariant ergodic probability measure with and For -almost every , for any that equivalent to for some the set has positive Lebesgue measure. 4. 4.
Let be the uniform Bernoulli measure and suppose there exists such that for all . If , then for -almost every , for any and that is equivalent to for some the set has positive Lebesgue measure.
The reason we cannot obtain the full measure statements from Theorem 2.6 in our random setting is because of how is defined. In particular, cannot necessarily be expressed as finitely many scaled copies of itself like in the deterministic setting. The proof of statements and from Theorem 2.6 rely on the fact that the underlying attractor satisfies the equation .
2.3 A specific family of IFSs
We now introduce a family of iterated function systems for which we can make very precise statements. To each we associate the IFS:
[TABLE]
For each the corresponding attractor is . We denote the projection map from to by . For this family of iterated function systems we will be able to replace the almost every statements appearing in Theorems 2.2 and 2.6 with something more precise. The reason we can make these stronger statements is because separation properties for can be deduced from the continued fraction expansion of . Recall that for any there exists a unique sequence such that
[TABLE]
We call the sequence the continued fraction expansion of . Given with continued fraction expansion , for each we let
[TABLE]
We call the -th partial quotient of . We say that is badly approximable if the integers appearing in the continued fraction expansion of can be bounded from above.
The main result of this section is the following.
Theorem 2.10**.**
Let be the uniform Bernoulli measure. The following statements are true:
If then contains an exact overlap, and for any the set has Hausdorff dimension strictly less than . 2. 2.
If then there exists depending upon the continued fraction expansion of such that and for any Lebesgue almost every is contained in . 3. 3.
If is badly approximable, then for any and satisfying Lebesgue almost every is contained in 4. 4.
If and is not badly approximable, then there exists satisfying yet has zero Lebesgue measure for any . 5. 5.
Suppose is such that for any there exists for which the following inequality holds for sufficiently large:
[TABLE]
Then for any and Lebesgue almost every is contained in . 6. 6.
Suppose is an ergodic invariant measure for the Gauss map and satisfies
[TABLE]
Then for -almost every for any and Lebesgue almost every is contained in In particular, for Lebesgue almost every for any and , Lebesgue almost every is contained in .
We include the following corollary to emphasise the strong dichotomy that follows from statement and statement from Theorem 2.10.
Corollary 2.11**.**
Either is such that contains an exact overlap and for any
[TABLE]
or for any Lebesgue almost every is contained in
[TABLE]
Theorem 2.10 is stated in terms of the auxiliary sets rather than in terms of Where here the underlying measure is the uniform Bernoulli measure. Note however that if is a function that only depends upon the length of the word , then for some appropriate choice of . Combining this observation with the fact for any for this choice of , it follows that for this choice of . Therefore Theorem 2.10 can be reinterpreted in terms of the sets when only depends upon the length of the word.
2.3.1 New methods for distinguishing between the overlapping behaviour of IFSs
In this section we explain how Theorem 2.10 allows us to distinguish between iterated function systems in a way that is not available to us by simply studying properties of self-similar measures. We start this discussion by stating the following result that will follow from the proof of Theorem 2.10.
Theorem 2.12**.**
Let It is the case that either contains an exact overlap, or for infinitely many we have
[TABLE]
for any for distinct .
Theorem 2.12 effectively states that for this family of IFSs, we either have an exact overlap, or for infinitely many scales we exhibit the optimal level of separation. This level of separation can be seen to be optimal by the pigeonhole principle, which tells us that for any and there must exist distinct such that
[TABLE]
Because of the strong dichotomy demonstrated by Theorem 2.12, we believe that this family of IFSs will serve as a useful toy model for other problems.
For a probability vector we denote the corresponding self-similar measure for the IFS by . It follows from Theorem 2.12 and the work of Hochman [24, Theorem 1.1.] that the following theorem holds.
Theorem 2.13**.**
Either contains an exact overlap, or for any probability vector p we have
[TABLE]
The following theorem follows from the work of Shmerkin and Solomyak [53, Theorem A].
Theorem 2.14**.**
For every outside of a set of Hausdorff dimension [math], we have that is absolutely continuous whenever
[TABLE]
To apply Theorem A from [53] we have to check that a non-degeneracy condition is satisfied. Checking this condition holds is straightforward in our setting so we omit the details.
It is known that the set of badly approximable numbers has Hausdorff dimension and Lebesgue measure zero. Therefore, applying Theorem 2.13 and Theorem 2.14, it follows that there exists a badly approximable number and some that is not badly approximable, such that for any probability vector p we have
[TABLE]
and whenever
[TABLE]
the measures and are both absolutely continuous. As such, the overlapping behaviour of and are indistinguishable from the perspective of self-similar measures. However, we see from statement and statement of Theorem 2.10 that there exists such that has full Lebesgue measure for all , and has zero Lebesgue measure for all . Therefore, we see that by studying the metric properties of limsup sets we can distinguish between the overlapping behaviour of and . Studying the metric properties of limsup sets detects some of the finer details of how an iterated function system overlaps.
2.4 The CS property and absolute continuity.
We saw in the previous section that by studying IFSs using ideas from metric number theory, one can distinguish between IFSs in a way that is not available to us by simply studying pushforwards of Bernoulli measures. It is natural to wonder how Khintchine like behaviour relates to these measures. In this paper we show that there is a connection between a strong type of Khintchine like behaviour and the absolute continuity of these measures.
Given an IFS and a slowly decaying measure , we say that is consistently separated with respect to , or has the CS property with respect to , if there exists such that for any satisfying
[TABLE]
the set has positive Lebesgue measure. Using this terminology we see that statement and statement from Theorem 2.10 imply that an IFS has the CS property with respect to the Bernoulli measure if and only if is badly approximable. The use of the terminology consistently separated will become clearer in Section 6 (see Theorem 6.1). We prove the following result.
Theorem 2.15**.**
For a slowly decaying -invariant ergodic probability measure if has the CS property with respect to then the pushforward of is absolutely continuous.
We emphasise here that an IFS having the CS property with respect to and the pushforward of being absolutely continuous are not equivalent statements. There are many examples of and such that the pushforward of is absolutely continuous, yet does not have the CS property with respect to In particular, for the family of IFSs studied in the previous section, it can be shown that the pushforward of the uniform Bernoulli measure is absolutely continuous for any . However as remarked above, has the CS property with respect to this measure if and only if is badly approximable. We include several explicit examples of consistently separated iterated function systems in Section 9.
2.5 Overlapping self-conformal sets
Theorems 2.2, 2.6, and 2.10 are stated in terms of parameterised families of overlapping IFSs where one would expect that for a typical member of this family the corresponding attractor would have positive Lebesgue measure. In Theorem 1.4 the attractor can have arbitrary Hausdorff dimension, but we assume that the underlying IFS satisfies some separation hypothesis. None of these results cover the case when the IFS is overlapping and the attractor is not expected to have positive Lebesgue measure. The purpose of this section is to fill this gap for IFSs consisting of conformal mappings. We recall some background on this class of IFS below.
Let be an open set, a map is a conformal mapping if it preserves angles, or equivalently is a conformal mapping if the differential satisfies for all and . We call an IFS a conformal iterated function system on a compact set if each can be extended to an injective conformal contraction on some open connected neighbourhood that contains and
[TABLE]
Throughout this paper we will assume that the differentials are Hölder continuous, i.e., there exists and such that
[TABLE]
for all . If our IFS is a conformal iterated function system on some compact set, then we call the corresponding attractor a self-conformal set. Self-conformal sets are a natural generalisation of self-similar sets.
To any conformal IFS we associate the family of potentials given by
[TABLE]
Where here . We define the topological pressure of to be
[TABLE]
For more on topological pressure and thermodynamic formalism we refer the reader to [10] and [18]. It can be shown that for any conformal IFS, there exists a unique value of satisfying the equation We call this parameter the similarity dimension of and denote it by . When is a conformal IFS and satisfies the open set condition, it is known that . Importantly there exists a unique measure such that
[TABLE]
The pushforward of the measure which we denote by is a particularly useful tool for determining metric properties of the attractor . In particular, when satisfies the open set condition it can be shown that is equivalent to (see [38]). Note that when consists of similarities, i.e. , then is simply the Bernoulli measure corresponding to the probability vector where is the unique solution to the equation
Our main result for conformal iterated function systems is the following theorem.
Theorem 2.16**.**
If is a conformal iterated function system, then for any if is a decreasing function and satisfies
[TABLE]
then -almost every is an element of
As stated above, when satisfies the open set condition then is equivalent to it follows therefore that Theorem 2.16 implies Theorem 1.4. For our purposes the real value of Theorem 2.16 is demonstrated in the following corollary.
Corollary 2.17**.**
Let be a conformal iterated function system and suppose . Then for any if is a decreasing function and satisfies
[TABLE]
then has Hausdorff dimension equal to .
Corollary 2.17 effectively reduces the problem of determining the Hausdorff dimension of to determining whether Thankfully there are many results on the latter problem, and we can use these results together with Corollary 2.17 to deduce further statements. We mention here only one such statement for the sake of brevity. The following statement follows by combining Theorem 1.1 from [24] and Corollary 2.17.
Corollary 2.18**.**
Assume and consists solely of similarities. If
[TABLE]
where
[TABLE]
then for any if is a decreasing function and satisfies
[TABLE]
then has Hausdorff dimension equal to .
2.6 Structure of the paper
The rest of the paper is arranged as follows. In Section 3 we prove some general results that will allow us to prove our main theorems. In Section 4 we prove Theorems 2.2, 2.6, and 2.9. In Section 5 we prove Theorem 2.10. Section 6 is then concerned with the proof of Theorem 2.15, and in Section 7 we prove Theorem 2.16. In Section 8 we apply the mass transference principle of Beresnevich and Velani to show how one can use our earlier results to deduce results on the Hausdorff measure and Hausdorff dimension of certain when
[TABLE]
In Section 9 we include some explicit examples to accompany our main theorems. We conclude with some general discussion and pose some open questions in Section 10.
3 Preliminary results
3.1 A general framework
In this section we prove some useful preliminaries that will allow us to prove the main results of this paper. Throughout this section will denote a metric space equipped with some finite Borel measure , and will denote some compact subset of . For each we will assume that there exists a finite set of continuous functions For each we let
[TABLE]
Before stating our general result we need to introduce some notation. Given we say that is an -separated set if such that Given a finite set and we let
[TABLE]
We call a maximal -separated subset if is -separated and Clearly a maximal -separated subset always exists. Given a finite set and we will denote by an arbitrary choice of maximal -separated subset.
The proposition stated below is the main technical result of this section.
Proposition 3.1**.**
Suppose the following properties are satisfied:
- •
There exists such that
[TABLE]
- •
There exists such that and for all we have
[TABLE]
Then for -almost every for any the set
[TABLE]
has positive Lebesgue measure.
Recall that the set of functions was defined in (2.2).
Given and we let
[TABLE]
The following lemma shows that under the hypothesis of Proposition 3.1, a typical is contained in for a large set of for appropriate choices of and . This lemma will play an important role in Section 4 when we recover some results of Solomyak on the absolute continuity of Bernoulli convolutions, and on the Lebesgue measure of the attractor in the problem.
Lemma 3.2**.**
Assume there exists such that and for all we have
[TABLE]
Then
[TABLE]
Proof.
Observe that
[TABLE]
for all and . As a result of this inequality and our underling assumption, for any , , and , we have
[TABLE]
This in turn implies
[TABLE]
It follows that given we can pick and independent of such that
[TABLE]
Applying Fatou’s lemma we have
[TABLE]
Summarising the above, we have shown that for this choice of and we have
[TABLE]
For the purpose of obtaining a contradiction, suppose
[TABLE]
Then using the fact
[TABLE]
for all , we have
[TABLE]
This contradicts (3.2). Therefore (3.3) is not possible and we have that for any there exists such that
[TABLE]
Equation (3.4) in turn implies that for any we have
[TABLE]
One can see how (3.5) follows from (3.4) by first fixing and then applying (3.4) for a countable collection of strictly smaller than . Now intersecting over all we see that (3.5) implies the desired equality:
[TABLE]
∎
To prove Proposition 3.1 and many other results in this paper, we will rely upon the following useful lemma known as the generalised Borel-Cantelli Lemma.
Lemma 3.3**.**
Let be a finite measure space and be a sequence of sets such that Then
[TABLE]
Lemma 3.3 is due to Kochen and Stone [32]. For a proof of this lemma see either [23, Lemma 2.3] or [59, Lemma 5].
Proposition 3.1 will follow from the following proposition. This result will also be useful when it comes to proving some of our later results.
Proposition 3.4**.**
Let and Assume the following properties are satisfied:
- •
There exists such that
[TABLE]
- •
There exists and such that
[TABLE]
Then
[TABLE]
has positive Lebesgue measure.
Proof of Proposition 3.4.
We split our proof into individual steps for convenience.
**Step 1. Replacing our approximating function.
**Let and be fixed, and and be as in the statement of the proposition. We claim that
[TABLE]
This follows from our assumption
[TABLE]
and the following:
[TABLE]
Let us now define
[TABLE]
We claim that we still have
[TABLE]
If for finitely many then (3.6) would imply (3.7). Suppose therefore that for infinitely many . For such an we would have
[TABLE]
This lower bound is strictly positive and independent of . As such summing over it for infinitely many guarantees divergence. Therefore (3.7) holds.
Note that it follows from the definition of that we will have proved our result if we can show that
[TABLE]
**Step 2: Constructing our .
**Since for all , it follows that for any distinct we must have
[TABLE]
For each such that let
[TABLE]
We will show that
[TABLE]
Equation (3.10) implies (3.8), so to complete our proof it suffices to show that (3.10) holds. It follows from (3.7) and (3.9) that
[TABLE]
Equation (3.11) shows that our collection of sets satisfies the hypothesis of Lemma 3.3.
We record here for later use the following fact: for each such that we have
[TABLE]
Equation (3.12) follows from (3.9) and the fact that for each such that we have
[TABLE]
**Step 3: Bounding .
**Assume is such that is such that and Fix u\in S\big{(}Y_{n}(\omega),\frac{s}{R_{n}^{1/d}}\big{)}. We want to bound the quantity:
[TABLE]
If then every v\in S\big{(}Y_{m}(\omega),\frac{s}{R_{m}^{1/d}}\big{)} satisfying must also satisfy It follows therefore from (3.9) and a volume argument that
[TABLE]
If then every v\in S\big{(}Y_{m}(\omega),\frac{s}{R_{m}^{1/d}}\big{)} satisfying must also satisfy Since the elements of S\big{(}Y_{m}(\omega),\frac{s}{R_{m}^{1/d}}\big{)} are by definition separated by a factor it follows from a volume argument that
[TABLE]
Combining (3.13) and (3.14), we see that for any such that and such that we have
[TABLE]
We now use (3.15) to bound
[TABLE]
Summarising the above, we have shown that for any such that and such that we have:
[TABLE]
**Step 4. Applying Lemma 3.3.
**By Lemma 3.3, to prove that (3.10) holds, and to finish our proof, it suffices to show that
[TABLE]
This we do below. We start by separating terms:
[TABLE]
Focusing on the first term on the right hand side of (3.18), we know that
[TABLE]
by (3.11). Therefore, for all sufficiently large we have
[TABLE]
This implies that
[TABLE]
Focusing on the second term in (3.18), we have
[TABLE]
Focusing on the first term in the above, we see that
[TABLE]
Focusing on the second term, we have
[TABLE]
In the first equality above we used the assumption that and therefore by properties of geometric series
[TABLE]
This is the only point in the proof where we use the assumption .
Collecting the bounds obtained above, we see that
[TABLE]
Substituting the bounds (3.19) and (3.20) into (3.18), we see that (3.17) holds as required. This completes our proof.
∎
With Proposition 3.4 we can now prove Proposition 3.1.
Proof of Proposition 3.1.
Let
[TABLE]
Fix . For any , by definition there exists such that . It follows from the definition of that there exists such that
[TABLE]
In which case, by the definition of we must have
[TABLE]
Applying Proposition 3.4 it follows that
[TABLE]
has positive Lebesgue measure. Our result now follows since was arbitrary and we know by Lemma 3.2 that ∎
3.1.1 Verifying the hypothesis of Proposition 3.1.
To prove Theorems 2.2, 2.6 and 2.9, we will apply Proposition 3.1. Naturally to do so we need to verify the hypothesis of Proposition 3.1. The exponential growth condition on the number of elements in our set will be automatically satisfied. Verifying the second integral condition is more involved. We will show that this integral condition holds via a transversality argument. Unfortunately the quantity is not immediately amenable to transversality techniques. Instead we study the quantity:
[TABLE]
The following lemma allows us to deduce the integral bound appearing in Proposition 3.1 from a similar bound for .
Lemma 3.5**.**
Assume there exists satisfying such that for all we have
[TABLE]
Then for all we have
[TABLE]
Proof.
Let
[TABLE]
Since for any distinct the distance between and is at least , it follows that is a -separated set. Therefore
[TABLE]
Importantly we also have
[TABLE]
This follows because the map defined by is a surjective map.
Now suppose we have satisfying the hypothesis of our proposition. Then for any and we have
[TABLE]
This implies
[TABLE]
∎
3.1.2 The non-existence of a Khintchine like result
The purpose of this section is to prove the following proposition. It will be used in the proof of Theorem 2.10 and Theorem 2.15. It demonstrates that a lack of separation along a subsequence can lead to the non-existence of a Khintchine like result.
Proposition 3.6**.**
Let and suppose that for some we have
[TABLE]
Then there exists such that
[TABLE]
yet
[TABLE]
has zero Lebesgue measure.
Proof.
Let and be as above. By our assumption, there exists a strictly increasing sequence such that
[TABLE]
for all . By the definition of a maximal -separated set, we know that for each there exists such that It follows that
[TABLE]
We now define our function
[TABLE]
This function obviously satisfies
[TABLE]
By (3.24) and the definition of we see that
[TABLE]
So to prove our result it suffices to show that the right hand side of (3.25) is zero. This fact now follows from the Borel-Cantelli lemma and the following inequalities:
[TABLE]
∎
3.2 Full measure statements
The main result of the previous section was Proposition 3.1. This result provides sufficient conditions for us to conclude that for a parameterised family of points, almost surely each member of a class of limsup sets defined in terms of neighbourhoods of these points will have positive Lebesgue measure. We will eventually apply Proposition 3.1 to the sets defined in the introduction. Instead of just proving positive measure statements, we would like to be able to prove full measure results. The purpose of this section is to show how one can achieve this goal. Proposition 3.8 achieves this by imposing some extra assumptions on the function . Proposition 3.9 achieves this by imposing some stronger separation hypothesis.
The following lemma follows from Lemma 1 of [9]. It is a consequence of the Lebesgue density theorem.
Lemma 3.7** ([9]).**
The following statements are true:
Let be a sequence of points in and be two sequences of positive real numbers both converging to zero. If then
[TABLE] 2. 2.
Let be a sequence of balls in such that . Then
[TABLE]
Lemma 3.7 implies the following useful fact. If is equivalent to and has positive Lebesgue measure, then has positive Lebesgue measure. We will use this fact several times throughout this paper.
Lemma 3.7 will be used in the proof of the following proposition and in the proofs of our main theorems. Recall that we say that a function is weakly decaying if
[TABLE]
Proposition 3.8**.**
The following statements are true:
Assume is a collection of similarities with attractor . If is such that for some that is weakly decaying, then Lebesgue almost every is contained in . 2. 2.
Assume is an arbitrary IFS and there exists the pushforward of a -invariant ergodic probability measure satisfying . Then if is such that for some that is weakly decaying, then Lebesgue almost every is contained in .
Proof.
We prove each statement separately.
**Proof of statement 1.
**Let be an IFS consisting of similarities and suppose and satisfy the hypothesis of the proposition. Let
[TABLE]
It follows from Lemma 3.7 that
[TABLE]
We claim that
[TABLE]
To see that (3.26) holds, suppose otherwise and assume
[TABLE]
Moreover, let be a density point of
[TABLE]
Such a point has to exist by the Lebesgue density theorem.
Let be such that and let be arbitrary. We let be such that
[TABLE]
The parameter satisfies the following:
[TABLE]
and
[TABLE]
Using (3.27) and (3.28) we can now bound
[TABLE]
Observe
[TABLE]
Therefore
[TABLE]
This implies that cannot be a density point of
[TABLE]
and we may conclude that (3.26) holds.
We will now show that
[TABLE]
Let
[TABLE]
be arbitrary. Let and be such that
[TABLE]
Let
[TABLE]
Since is weakly decaying .
Now suppose is such that
[TABLE]
where
[TABLE]
Then
[TABLE]
It follows that for this choice of whenever
[TABLE]
we also have
[TABLE]
It follows from the definition of that has infinitely many solutions to (3.32), therefore has infinitely many solutions to (3.33) and . It follows now from (3.26) and (3.29) that Lebesgue almost every is contained in
**Proof of statement 2.
**Let be an IFS and be the pushforward of some -invariant ergodic probability measure We assume that assume . Let and satisfy the hypothesis of our proposition. Let be as in the proof of statement . It follows from our assumptions and Lemma 3.7 that . Since we also have . We will prove that
[TABLE]
By our assumption By the ergodicity of we have
[TABLE]
Now observe that
[TABLE]
Therefore (3.35) implies (3.34). Since it follows that
[TABLE]
We now let
[TABLE]
be arbitrary. Defining appropriate analogues of and as in the proof of statement it will follow that . Therefore
[TABLE]
Combining this fact with (3.36) completes the proof of statement . ∎
Proposition 3.8 is a useful technique for proving full measure statements, but there is an additional cost as we require the function to be weakly decaying. The following proposition requires no extra condition on the function , but does require some stronger separation assumptions. Before stating this proposition we recall some of our earlier definitions. Given a slowly decaying probability measure we define
[TABLE]
and
[TABLE]
Moreover, given we define
[TABLE]
Proposition 3.9**.**
Suppose is a collection of affine contractions and is the pushforward of a Bernoulli measure . Assume that one of following properties is satisfied:
- •
* consists solely of similarities.*
- •
* and all the matrices are equal.*
- •
All the matrices are simultaneously diagonalisable.
Let and suppose that for some there exists a subsequence satisfying
[TABLE]
Then and for any that satisfies
[TABLE]
we have that Lebesgue almost every is contained in
The proof of Proposition 3.9 is more involved than Proposition 3.8 and will rely on the following technical result.
Lemma 3.10**.**
Let be a self-similar measure. Then either or is singular. 2. 2.
Suppose is a collection of affine contractions and one of following properties is satisfied:
- •
* and all the matrices are equal.*
- •
All the matrices are simultaneously diagonalisable.
Then if is the pushforward of a Bernoulli measure we have either or is singular. 3. 3.
Let be an arbitrary iterated function system and be the pushforward of a -invariant ergodic probability measure . Then either or is singular (i.e. is of pure type).
Proof.
A proof of statement can be found in [40]. It makes use of an argument originally appearing in [36]. Statement was proved in [52, Section 4.4.] using ideas of Guzman [22] and Fromberg [37].
We could not find a proof of statement so we include one for completeness. Suppose that is not singular, then by the Lebesgue decomposition theorem where and Suppose that . Then there exists such that Since we may assume without loss of generality that Using the ergodicity of it follows from an analogous argument to that used in the proof of statement from Proposition 3.8 that Therefore we must have and by absolute continuity Since each is a contraction, implies that for all . This contradicts that Therefore we must have ∎
Only statement and statement from Lemma 3.10 will be needed in the proof of Proposition 3.9. Statement is needed in the proof of the following result which we formulate as generally as possible.
Proposition 3.11**.**
Let be the pushforward of a slowly decaying -invariant ergodic probability measure . If for some and we have
[TABLE]
then .
Proof.
We start our proof by remarking that for any ,
[TABLE]
where the convergence is meant with respect to the weak star topology111Equation (3.37) can be verified by checking that for each the measure is the pushforward of an appropriately chosen measure on and that this sequence of measures satisfies .. By our assumption, for some and there exists a sequence and such that
[TABLE]
for all . Define
[TABLE]
and
[TABLE]
Then
[TABLE]
By taking subsequences if necessary, we may also assume without loss of generality that there exists two finite measures and such that and Therefore by (3.37) we have . We will prove that and is absolutely continuous with respect to the Lebesgue measure. Since is either singular or absolutely continuous by Lemma 3.10, it will follow that .
It follows from the definition of that for any we have
[TABLE]
This implies that for any we have
[TABLE]
Using (3.38) and (3.39), we have that
[TABLE]
Therefore . Now we prove that is absolutely continuous. Fix an arbitrary open -dimensional cube we have
[TABLE]
In the last line we used (3.39). Since the elements of S\big{(}Y_{\mathfrak{m},n_{k}}(z),\frac{s}{R_{\mathfrak{m},n}^{1/d}}\big{)} are separated by a factor it follows from a volume argument that we must have
[TABLE]
Substituting this bound into (3.40) we have
[TABLE]
Letting , it follows that for any -dimensional cube we have
[TABLE]
Since is fixed must be absolutely continuous. This completes our proof. ∎
As well as Proposition 3.11 being used in our proof of Proposition 3.9, it can be seen as a new tool for proving that measures are absolutely continuous. Proposition 3.11 can be used in conjunction with Lemma 3.2 and Lemma 3.5 to recover known results on the absolute continuity of measures within a parameterised family. We include one such instance of this in Section 4, where we recover the well known result due to Solomyak that for almost every the unbiased Bernoulli convolution is absolutely continuous [58].
With these preliminary results we are now in a position to prove Proposition 3.9.
Proof of Proposition 3.9.
Let be an IFS satisfying one of our conditions and be the pushforward of a Bernoulli measure . Let and satisfy the hypothesis of our proposition. By an application of Proposition 3.11, we know that Moreover, by Lemma 3.10 we also know that .
To prove our result, it is sufficient to show that
[TABLE]
for any satisfying
[TABLE]
It will then follow from Lemma 3.7, and the fact that for any that (3.41) implies that Lebesgue almost every is contained in for any satisfying (3.42)
Our proof of (3.41) will follow from a similar type of argument to that given in the proof of Proposition 3.4. Where necessary to avoid repetition we will omit certain details. Our strategy for proving (3.41) holds is to prove that for Lebesgue almost every there exists such that for all sufficiently small we have
[TABLE]
Importantly will not depend upon . It follows then by an application of the Lebesgue density theorem that (3.43) implies (3.41). As in the proof of Proposition 3.4, we split our proof of (3.43) into smaller steps.
**Step . Local information.
**We have already established that Let denote the Radon-Nikodym derivative . For -almost every we must have . It follows now by the Lebesgue differentiation theorem, and the fact that that for Lebesgue almost every we have
[TABLE]
In what follows is a fixed element of satisfying this property. Let be such that for all we have
[TABLE]
Now using that is the weak star limit of the sequence of measures
[TABLE]
together with (3.44), we can assert that for each for sufficiently large we have
[TABLE]
By construction we know that each satisfies
[TABLE]
Therefore it follows from (3.45) that for all sufficiently large
[TABLE]
Let
[TABLE]
Since
[TABLE]
it follows from (3.46) that there exists such that for any we have
[TABLE]
Equation (3.47) shows that for each there is a large separated set that is local to .
We will prove that there exists such that
[TABLE]
Equation (3.48) implies (3.43). So to complete our proof it suffices to show that (3.48) holds.
For later use we note that
[TABLE]
Equation (3.49) is true because
[TABLE]
**Step Replacing our approximating function.
**Let
[TABLE]
For each we define the set
[TABLE]
By construction the balls in this union are disjoint. Therefore by (3.47), for each
[TABLE]
By a similar argument to that given in the proof of Proposition 3.4, it follows from (3.49) that we have
[TABLE]
Therefore, the assumptions of Lemma 3.3 are satisfied. We will use this lemma to show that
[TABLE]
Since
[TABLE]
because , we see that (3.52) implies (3.48). So verifying (3.52) will complete our proof.
**Step . Bounding .
**By an analogous argument to that given in the proof of Proposition 3.4, we can show that for any we have
[TABLE]
Using this estimate and (3.47), it can be shown that for any distinct we have
[TABLE]
**Step . Applying Lemma 3.3.
**Using (3.53), we can then replicate the arguments used in the proof of Proposition 3.4 to show that
[TABLE]
We emphasise here that the underlying constants in (3.54) do not depend upon . By (3.50) we have
[TABLE]
Applying Lemma 3.3 in conjunction with (3.54) and (3.55) yields
[TABLE]
for some that does not depend upon . Therefore (3.52) holds and we have completed our proof.
∎
4 Applications of Proposition 3.1
In this section we apply the results of Section 3 to prove Theorems 2.2, 2.6 and 2.9. We begin by briefly explaining why the exponential growth condition appearing in Proposition 3.1 will always be satisfied in our proofs.
Let be a slowly decaying probability measure supported on . We remark that each satisfies
[TABLE]
Recall that is defined in Section 1.3.2. Importantly the cylinders corresponding to elements of are disjoint, and we have . It follows from these observations that
[TABLE]
Similarly, if and for some for each , then
[TABLE]
Where the underlying constants depend upon but are independent of . In our proofs of Theorems 2.2, 2.6 and 2.9, it will be necessary to define an contained in whose union of cylinders has measure uniformly bounded away from zero. By the above discussion the exponential growth condition appearing in Proposition 3.1 will automatically be satisfied by .
4.1 Proof of Theorem 2.2
Before proceeding with our proof of Theorem 2.2 we recall some useful results from [58].
Lemma 4.1** (Lemma 2.1 [58]).**
For any there exists such that if , and then
[TABLE]
Lemma 4.1 has the following useful consequence.
Lemma 4.2**.**
Let and be as in Lemma 4.1. Then for any and such that , we have
[TABLE]
Where the underlying constant depends upon
Lemma 4.2 follows from the analysis given in Section 2.4. from [58]. Equipped with Lemma 4.2 and the results of Section 3, we can now prove Theorem 2.2.
Proof of Theorem 2.2.
We treat each statement in this theorem individually. We start with the proof of statement .
**Proof of statement .
**Let us start by fixing a slowly decaying -invariant ergodic probability measure with and Let be arbitrary. We now choose sufficiently small so that we have
[TABLE]
By the Shannon-McMillan-Breiman theorem, we know that for -almost every we have
[TABLE]
It follows from (4.2) and Egorov’s theorem, that there exists such that
[TABLE]
Let
[TABLE]
and
[TABLE]
Since
[TABLE]
it follows from the above that
[TABLE]
By the discussion at the beginning of this section we know that satisfies the exponential growth condition of Proposition 3.1. It also follows from this discussion that
[TABLE]
Recalling the notation used in Section 3, let
[TABLE]
The main step in our proof of statement is to show that
[TABLE]
We will then be able to employ the results of Section 3 to prove our theorem. Our proof of (4.5) is based upon an argument of Benjamini and Solomyak [6], which in turn is based upon an argument of Peres and Solomyak [41].
**Step 1. Proof of (4.5).
**Observe the following:
[TABLE]
In the penultimate line we used that for any we have .
Note that for any distinct we have
[TABLE]
Let Then
[TABLE]
for some satisfying . Therefore, for any distinct we have
[TABLE]
Where in the last line we used Lemma 4.2. Summarising the above, we have shown that
[TABLE]
Substituting (4.7) into (4.1) we obtain:
[TABLE]
By (4.1) we know that
[TABLE]
Therefore
[TABLE]
as required.
**Step 2. Applying (4.5).
**Combining (4.5) and Lemma 3.5 we obtain
[TABLE]
Therefore by Proposition 3.1, we know that for Lebesgue almost every the set
[TABLE]
has positive Lebesgue measure for any . Since was arbitrary, we can assert that for Lebesgue almost every for any the above set has positive Lebesgue measure. By (4.4) we know that . Which by the discussion given at the start of this section implies for each . Therefore by Lemma 3.7, we may conclude that for Lebesgue almost every for any the set has positive Lebesgue measure.
**Proof of statement 2.
**We start our proof of this statement by remarking that since is the uniform Bernoulli measure, we have for each . Since the words in have the same length and each similarity contracts by a factor , it can be shown that
[TABLE]
for all for any . Importantly this difference does not depend upon Therefore the sets and are translates of each other. In which case
[TABLE]
for any .
By (4.5), the assumptions of Proposition 3.1 are satisfied and by Lemma 3.2, for any for Lebesgue almost every given an we can pick such that
[TABLE]
If is such that (4.10) holds for a specific sequence then (4.9) implies that it must hold for all simultaneously. Therefore, we may assert that for Lebesgue almost every given an we can pick such that for any we have
[TABLE]
Examining the proof of Proposition 3.1, we see that (4.11) implies that for Lebesgue almost every for any and , the set
[TABLE]
has positive Lebesgue measure. In other words, for Lebesgue almost every for any and , the set has positive Lebesgue measure. Since was arbitrary we can conclude our result for Lebesgue almost every
**Proof of statement 3.
**By statement we know that for any for Lebesgue almost every for any the set has positive Lebesgue measure. It follows therefore by Lemma 3.7 that for any for Lebesgue almost every for any that is equivalent to for some the set has positive Lebesgue measure. Applying Proposition 3.8 we may conclude that for any for Lebesgue almost every for any Lebesgue almost every is contained in .
**Proof of statement 4.
**The proof of statement is analogous to the proof of statement . The only difference is that instead of using statement at the beginning we use statement . ∎
We now explain how Corollary 2.3 follows from Theorem 2.2.
Proof of Corollary 2.3.
Let us start by fixing to be . We remark that this function is an element of . This can be proved using the well known fact
[TABLE]
Let us now fix a Bernoulli measure as in the statement of Corollary 2.3. Observe that for any we have
[TABLE]
Using (4.12) and the fact that each satisfies it can be shown that each satisfies
[TABLE]
This implies that for any we have
[TABLE]
In other words, the function given by
[TABLE]
is equivalent to for our choice of . One can verify that our function is weakly decaying and hence Therefore by Theorem 2.2, for any for almost every Lebesgue almost every is contained in the set
∎
4.1.1 Bernoulli Convolutions
Given and , let be the distribution of the random sum
[TABLE]
where is chosen with probability , and is chosen with probability . When we simply denote by . We call a Bernoulli convolution. When we want to emphasise the case when we call the unbiased Bernoulli convolution. Importantly, for each the Bernoulli convolution is a self-similar measure for the iterated function system
The study of Bernoulli convolutions dates back to the and to the important work of Jessen and Wintner [27], and Erdős [15, 16]. When then is supported on a Cantor set and determining the dimension of is relatively straightforward. When the support of is the interval Analysing a Bernoulli convolution for is a more difficult task. The important problems in this area are:
- •
To classify those and such that
[TABLE]
- •
To classify those and such that .
Initial progress was made on the second problem by Erdős in [15]. He proved that whenever is the reciprocal of a Pisot number then . This result was later improved upon in two papers by Alexander and Yorke [1], and Garsia [21], who independently proved that when is the reciprocal of a Pisot number. Garsia in [20] also provided an explicit class of algebraic integers for which . The next breakthrough came in a result of Solomyak [58] who proved that with a density in for almost every . His proof relied on studying the Fourier transform of . A simpler proof of this result was subsequently obtained by Peres and Solomyak in [41]. This proof relied upon a characterisation of absolute continuity in terms of differentiation of measures (see [35]). Improvements and generalisations of this result appeared subsequently in [39], [42], and [46]. Over the last few years dramatic progress has been made on the problems listed above. In particular, Hochman in [24] proved that for a set of packing dimension [math], it is the case that if then we have equality in (4.13) for any . Building upon this result, Shmerkin in [51] proved that for every outside of a set of Hausdorff dimension zero. This result was later generalised to the case of general by Shmerkin and Solomyak in [53]. Similarly building upon the result of Hochman, Varju recently proved in [61] that whenever is a transcendental number. Varju has also recently provided new explicit examples of and such that (see [60]).
Theorem 2.2 can be applied to the IFS In [58] Solomyak proved that this was subsequently improved upon by Shmerkin and Solomyak in [54] who proved that Using this information we can prove the following result.
Theorem 4.3**.**
Let be given by . Then for Lebesgue almost every we have that for any Lebesgue almost every is contained in .
The proof of Theorem 4.3 is an adaptation of the proof of Corollary 2.3 and is therefore omitted.
As a by-product of our analysis we can recover the result of Solomyak that for Lebesgue almost every the unbiased Bernoulli convolution is absolutely continuous. Our approach does not allow us to assert anything about the density. However our approach does have the benefit of being particularly simple and intuitive. Instead of relying on the Fourier transform, differentiation of measures, or the advanced entropy methods of Hochman [24], the proof given below appeals to the fact that is of pure type and makes use of a decomposition argument due to Solomyak. For the sake of brevity, the proof below only focuses on the important features of the argument.
Theorem 4.4** (Soloymak [58]).**
For Lebesgue almost every we have .
Proof.
We split our proof into individual steps.
**Step 1. Proof that for Lebesgue almost every .
**Fix . We know by our proof of Theorem 2.2 that for any we have
[TABLE]
Combining (4.14) with Lemma 3.2, we may conclude that
[TABLE]
Here
[TABLE]
In particular, (4.15) implies that for Lebesgue almost every there exists and such that
[TABLE]
Applying Proposition 3.11, it follows that for Lebesgue almost every the measure is absolutely continuous. Since is arbitrary we know that for Lebesgue almost every the measure is absolutely continuous.
**Step 2. Proof that for Lebesgue almost every .
**Let denote the distribution of the random sum
[TABLE]
where each digit is chosen with probability . One can show that for some measure corresponding to the remaining terms (see [41, 58]). Since the convolution of an absolutely continuous measure with an arbitrary measure is still absolutely continuous, to prove for Lebesgue almost every , it suffices to shown that is absolutely continuous for Lebesgue almost every . Importantly can be realised as the self-similar measure for the iterated function system
[TABLE]
and the uniform Bernoulli measure. Because the translation parameter depends upon this family of iterated function systems does not immediately fall into the class considered by Theorem 2.2. However this distinction is only superficial, and one can adapt the argument used in the proof of (4.14) to prove that for any and we have
[TABLE]
The parameter comes from [58] and is a lower bound for the appropriate analogue of for the family of iterated function systems . Without going into details, it can be shown that appropriate analogues of Lemma 4.1 and Lemma 4.2 persist for this family of iterated function systems. These statements can then be used to deduce that (4.16) holds. By the arguments used in step , we can use (4.16) in conjunction with Lemma 3.2 and Proposition 3.11 to deduce that is absolutely continuous for Lebesgue almost every .
**Step 3. Proof that for Lebesgue almost every .
**Since we know by the two previous steps that for Lebesgue almost every the measure is absolutely continuous. For any for some we can express as for some measure (see [41, 58]). Since for Lebesgue almost every the measure is absolutely continuous, it follows that for Lebesgue almost every the measure is also absolutely continuous. Since it follows that is absolutely continuous for Lebesgue almost every . Importantly the intervals exhaust . It follows therefore that is absolutely continuous for Lebesgue almost every Our previous steps cover the interval so we may conclude that is absolutely continuous for Lebesgue almost every
∎
4.1.2 The problem
Let and
[TABLE]
is the attractor of the IFS . When the IFS satisfies the strong separation condition and one can prove that When the set is the interval . The two main problems in the study of are:
- •
Classify those such that
- •
Classify those such that has positive Lebesgue measure.
Initial progress on these problems was made by Pollicott and Simon in [45], Keane, Smorodinsky and Solomyak in [29], and Solomyak in [58]. In [45] it was shown that for Lebesgue almost every we have In [58] it was shown that for Lebesgue almost every the set has positive Lebesgue measure. It follows from the recent work of Hochman [24], and Shmerkin and Solomyak [53], that the set of exceptions for both of these statements has zero Hausdorff dimension.
In [58] it was shown that Using this information we can prove the following result.
Theorem 4.5**.**
Let be given by . Then for Lebesgue almost every we have that for any Lebesgue almost every is contained in
Just like the proof of Theorem 4.3, the proof of Theorem 4.5 is an adaptation of the proof of Corollary 2.3 and is therefore omitted.
As stated above, in [58] it was shown that for Lebesgue almost every the set has positive Lebesgue measure. This was achieved by proving supported an absolutely continuous self-similar measure. To the best of the author’s knowledge, all results establishing that has positive Lebesgue measure for some do so by proving that supports an absolutely continuous self-similar measure. It is interesting therefore to note that our methods yield a simple proof of the fact stated above without any explicit mention of a measure. In the proof below, we instead construct a subset of that has positive Lebesgue measure for Lebesgue almost every .
Theorem 4.6** (Solomyak [58]).**
For Lebesgue almost every the set has positive Lebesgue measure.
Proof.
Taking to be the sequence consisting of all zeros in our proof of Theorem 2.2, so that for all , it can be shown that for any we have
[TABLE]
Therefore by Lemma 3.2, we have
[TABLE]
This implies that for Lebesgue almost every there exists and such that for infinitely many we have
[TABLE]
Let be a satisfying (4.18) for infinitely many . For any satisfying (4.18) we must also have
[TABLE]
In which case it follows from (4.18) and (4.1.2) that
[TABLE]
In the penultimate equality we used that Lebesgue measure is continuous from above. In the final inequality we used that there are infinitely many such that (4.18) holds, and therefore infinitely many such that (4.1.2) holds.
Since
[TABLE]
it follows has positive Lebesgue measure. Since was arbitrary, it follows that for Lebesgue almost every the set has positive Lebesgue measure. Since was arbitrary we can upgrade this statement and conclude that for Lebesgue almost every the set has positive Lebesgue measure. ∎
4.2 Proof of Theorem 2.6
In this section we prove Theorem 2.6. Recall that in the setting of Theorem 2.6 we obtain a family of IFSs by first of all fixing a set of non-singular matrices each satisfying . For any we then define to be the IFS consisting of the contractions
[TABLE]
The parameter is allowed to vary. We denote the corresponding attractor by and the projection map from to by .
To prove Theorem 2.6 we will need a technical result due to Jordan, Pollicott, and Simon from [28]. It is rephrased for our purposes.
Lemma 4.7**.**
[28*, Lemma 7]**
Assume that for all and let be an arbitrary open ball in . Then for any two distinct sequences we have*
[TABLE]
With Lemma 4.7 we are now in a position to prove Theorem 2.6.
Proof of Theorem 2.6.
Let us start by fixing a set of non-singular matrices such that for all . We prove each statement appearing in this theorem individually.
**Proof of statement
**Instead of proving our result for Lebesgue almost every it is sufficient to prove our result for Lebesgue almost every where is an arbitrary ball in . In what follows we fix such a .
By the Shannon-McMillan-Breiman theorem, and the definition of the Lyapunov exponent, we know that for -almost every we have
[TABLE]
and for each
[TABLE]
Applying Egorov’s theorem, it follows that for any there exists such that the set of satisfying
[TABLE]
and
[TABLE]
for each for all has -measure strictly larger than . In what follows we will assume that has been picked to be sufficiently small so that we have
[TABLE]
Such an exists because of our underlying assumption .
For each let
[TABLE]
and
[TABLE]
It follows from the above that
[TABLE]
By the discussion given at the beginning of this section, we known satisfies the exponential growth condition of Proposition 3.1. It also follows from our construction that
[TABLE]
Let us now fix and let
[TABLE]
Our goal now is to prove the bound:
[TABLE]
Repeating the arguments given in the proof statement from Theorem 2.2, it can be shown that
[TABLE]
Applying the bound given by Lemma 4.7, we obtain
[TABLE]
We now substitute in the bounds provided by (4.20) and (4.21) to obtain
[TABLE]
In our penultimate equality we used (4.22) to assert that
[TABLE]
We have shown that (4.24) holds. It follows now from (4.24) and Lemma 3.5 that
[TABLE]
Therefore, by Proposition 3.1, we have that for Lebesgue almost every the set
[TABLE]
has positive Lebesgue measure for any . By (4.23) we know that Which by the discussion given at the beginning of this section implies for each . Combining this fact with Lemma 3.7 and the above, we can conclude that for Lebesgue almost every for any the set has positive Lebesgue measure.
**Proof of statement 2
**Under the assumptions of statement it can be shown that for any the difference is independent of for any . Therefore is a translation of for any . The proof of statement now follows by the same reasoning as that given in the proof of statement from Theorem 2.2.
**Proof of statement 3
**As in the proof of statement , it suffices to show that statement holds for Lebesgue almost every where is an arbitrary ball. We know by statement that for any for Lebesgue almost every , the set has positive Lebesgue measure for any . Applying Lemma 3.7 it follows that for any for Lebesgue almost every , the set has positive Lebesgue measure for any that is equivalent to for some . If each is a similarity then we apply the first part of Proposition 3.8 to assert that for any for Lebesgue almost every , for any Lebesgue almost every is contained in .
To prove statement in the case when and all the matrices are equal, and in the case when all the matrices are simultaneously diagonalisable, we will apply the second part of Proposition 3.8. We need to show that under either of these conditions, for Lebesgue almost every the measure the pushforward of our is equivalent to . Now let us assume our set of matrices satisfies either of these conditions. By (4.25) and Lemma 3.2 we know that
[TABLE]
In particular, this implies that for Lebesgue almost every there exists some such that
[TABLE]
for infinitely many . By Proposition 3.11 it follows that for Lebesgue almost every . By our hypothesis and Lemma 3.10 we can improve this statement to for Lebesgue almost every . Now applying Proposition 3.8 we can conclude that for any for Lebesgue almost every , for any Lebesgue almost every is contained in
**Proof of statement 4
**The proof of statement is an adaptation of statement where the role of statement is played by statement .
∎
The proof of Corollary 2.7 is analogous to the proof of Corollary 2.3 and is therefore omitted.
4.3 Proof of Theorem 2.9
The proof of Theorem 2.9 mirrors the proof of Theorem 2.6. As such we will only state the appropriate analogue of Lemma 4.7 and leave the details to the interested reader. The following lemma was proved in [28].
Lemma 4.8**.**
[28, Lemma 6]** Assume that for all . For any two distinct sequences we have
[TABLE]
5 A specific family of IFSs
In this section we focus on the following family of IFSs:
[TABLE]
where . We also fix throughout to be the uniform Bernoulli measure. To each we associate the continued fraction expansion and the corresponding sequence of partial quotients . In this section we will make use of the following well known properties of continued fractions.
- •
For any we have
[TABLE]
- •
If we set , then for any we have
[TABLE]
- •
If is such that is bounded, i.e. is badly approximable, then there exists such that for any we have
[TABLE]
- •
If then
[TABLE]
for any .
For a proof of these properties we refer the reader to [11] and [12].
Let us now remark that for any there exist two sequences satisfying
[TABLE]
Importantly for each the sequences and satisfying (5.5) are unique. What is more, for any there exists a unique such that and satisfy (5.5) for this choice of .
We separate our proof of Theorem 2.10 into individual propositions. Statement of Theorem 2.10 is contained in the following result.
Proposition 5.1**.**
* contains an exact overlap if and only if . Moreover if then for any the set has Hausdorff dimension strictly less than .*
Proof.
If contains an exact overlap then there exists distinct such that . By considering and if necessary, we can assume that Using (5.5) we see that the following equivalences hold:
[TABLE]
It follows from these equivalences that there is an exact overlap if any only if .
We now prove the Hausdorff dimension part of our proposition. By the first part we know that if and only if contains an exact overlap. It follows from the presence of an exact overlap that for each there exists such that for any . This in turn implies that for any we have for any . It follows now from this latter inequality that for an appropriate choice of for any we have
[TABLE]
For any and , the set of intervals
[TABLE]
forms a cover of . Now let be sufficiently large that
[TABLE]
It follows now that we have the following bound on the -dimensional Hausdorff measure of
[TABLE]
In the last line we used that to guarantee . Therefore for any .
∎
Adapting the proof of the first part of Proposition 5.1, we can show that the following simple lemma holds.
Lemma 5.2**.**
Let , and . For sufficiently large, there exists distinct such that
[TABLE]
if and only if there exists such that
[TABLE]
Lemma 5.2 will be used in the proofs of all the full measure statements in Theorem 2.10. It immediately yields the following proposition which corresponds to statement from Theorem 2.10.
Proposition 5.3**.**
If is badly approximable, then for any and satisfying we have that Lebesgue almost every is contained in .
Proof.
Since is badly approximable, we know by (5.3) that there exists such that
[TABLE]
for all . Equation (5.7) implies that for any we have
[TABLE]
Applying Lemma 5.2, we see that for any for all sufficiently large, if are distinct then
[TABLE]
Therefore, for any we have
[TABLE]
for all sufficiently large. Our result now follows by an application of Proposition 3.9. ∎
For our other full measure statements a more delicate analysis is required. We need to identify integers for which the set of images are well separated. This we do in the following two lemmas.
Lemma 5.4**.**
Let . For sufficiently large, if satisfies
[TABLE]
for some , then for any we have
[TABLE]
for distinct .
Proof.
Fix . If , then by (5.1) and (5.4), for all we have
[TABLE]
If as well, then the above implies that for all we have
[TABLE]
Applying Lemma 5.2 completes our proof. ∎
Lemma 5.4 demonstrates that if is strictly less than but close to some denominator arising from the partial quotients of , then at the -th level we have good separation properties. The following lemma demonstrates a similar phenomenon but instead relies upon the digits appearing in the continued fraction expansion. To properly states this lemma we need to define the following sequence. Given with corresponding sequence of partial quotients , we define the sequence of integers via the inequalities:
[TABLE]
Lemma 5.5**.**
Let . For sufficiently large, if is such that then for any we have
[TABLE]
for distinct .
Proof.
By (5.1), (5.2), and (5.4), we know that for any we have
[TABLE]
Now using our assumption we may conclude that for any we have
[TABLE]
Applying Lemma 5.2, we may conclude our proof. ∎
With Lemma 5.4 and Lemma 5.5 in mind we introduce the following definition. We say that is a good -level if either
[TABLE]
for some , or if
[TABLE]
It follows from Lemma 5.4 and Lemma 5.5 that if is a good -level then
[TABLE]
for any .
The following proposition implies statement from Theorem 2.10.
Proposition 5.6**.**
If then there exists depending upon the continued fraction expansion of such that and for any Lebesgue almost every is contained in
Proof.
Fix and let . For any it follows from the definition that is a good -level if satisfies
[TABLE]
For any sufficiently large there is clearly at least one value of satisfying (5.8). As such there are infinitely many good levels. Now let be a function satisfying and
[TABLE]
Now as remarked above, if is a good -level, then
[TABLE]
for any . We may now apply Proposition 3.9 and conclude that for any Lebesgue almost every is contained in for this choice of . ∎
In the proof of Proposition 5.6 we showed that if then for infinitely many we have
[TABLE]
Theorem 2.12 now follows from this observation and Proposition 5.1.
The following proposition implies statement from Theorem 2.10.
Proposition 5.7**.**
Suppose is such that for any there exists for which the following inequality holds for sufficiently large:
[TABLE]
Then for any and Lebesgue almost every is contained in .
Proof.
Fix satisfying the hypothesis of our proposition and . By definition, there exists such that for any satisfying we have
[TABLE]
Now let us fix to be sufficiently small so that
[TABLE]
for sufficiently large.
We observe that if is not a good -level then by (5.2) we must have
[TABLE]
Using (5.2) and an induction argument, one can also show that
[TABLE]
for all . Combining these observations, it follows that if and is not a good -interval, then there exists such that and . As such we have the bound
[TABLE]
By (5.2) we know that for any we have
[TABLE]
Substituting this bound into (5.11) and applying (5.10), we obtain
[TABLE]
for sufficiently large. It follows therefore that
[TABLE]
In which case, by (5.9) we have
[TABLE]
We know that for a good -level we have
[TABLE]
for all . Therefore combining (5.12) with Proposition 3.9 finishes our proof. ∎
The following proposition implies statement from Theorem 2.10.
Proposition 5.8**.**
Suppose is an ergodic invariant measure for the Gauss map, and satisfies
[TABLE]
Then for -almost every we have that for any and Lebesgue almost every is contained in In particular, for Lebesgue almost every we have that for any and , Lebesgue almost every is contained in .
Proof.
Let be a measure satisfying the hypothesis of our proposition. To prove the first part of our result we will show that -almost every satisfies the hypothesis of Proposition 5.7.
Recall that the Gauss map is given by
[TABLE]
It is well known that the dynamics of the Gauss map and the continued fraction expansion of a number are intertwined. In particular, it is known that
[TABLE]
By (5.2) we know that implies . Using (5.13) and this observation, we have that for any
[TABLE]
Where is given by
[TABLE]
By our assumptions on , we know that for any we can pick sufficiently large such that
[TABLE]
Assuming that we have picked such an sufficiently large, we know by the Birkhoff ergodic theorem that for -almost every we have
[TABLE]
Combining the above with (5.14) shows that -almost every satisfies the hypothesis of Proposition 5.7. Applying Proposition 5.7 completes the first half of our proof.
To deduce the Lebesgue almost every part of our proposition we remark that the Gauss measure given by
[TABLE]
is an ergodic invariant measure for the Gauss map and is equivalent to the Lebesgue measure restricted to . One can easily check that satisfies
[TABLE]
which clearly implies
[TABLE]
Applying the first part of this proposition completes the proof.
∎
The following proposition proves statement from Theorem 2.10.
Proposition 5.9**.**
Suppose is not badly approximable. Then there exists such that yet has zero Lebesgue measure for any .
Proof.
Let and suppose is not badly approximable. We will prove that for some we have
[TABLE]
for all . Proposition 3.6 then guarantees for each the existence of a satisfying such that has zero Lebesgue measure. What is not clear from the statement of Proposition 3.6 is whether there exists a which satisfies this property simultaneously for all . Examining the proof of Proposition 3.6, we see that the function that is constructed only depends upon the speed at which
[TABLE]
converges to zero along a subsequence. Since
[TABLE]
for any and , it is clear that the speed of convergence to zero along any subsequence is independent of . In particular, the sequence constructed in (3.23) is independent of the choice of . Therefore the constructed in Proposition 3.6 will work for all simultaneously. As such to prove our proposition it is sufficient to show that (5.15) holds for all .
It also follows from (5.16) that to prove there exists such that (5.15) holds for all , it suffices to prove that there exists such that (5.15) for a specific As such let us now fix . It can be shown that for any we have
[TABLE]
Since is not badly approximable, there exists a sequence such that for all . In which case, by (5.1) and (5.2) we know that
[TABLE]
for each . Without loss of generality we assume for all . This assumption will simplify some of our later arguments.
Define the sequence via the inequalities
[TABLE]
Consider the set of satisfying
[TABLE]
and
[TABLE]
Note that for any satisfying (5.19) and (5.20) we have
[TABLE]
and
[TABLE]
for all .
Given we let
[TABLE]
Equations (5.17) and (5.18) imply that for all we have
[TABLE]
Assume we have defined , we then define to be
[TABLE]
assuming the set we are taking the infimum over is non-empty. By an analogous argument to that given above, it can be shown that for all we have
[TABLE]
This process must eventually end yielding By our construction, we known that if satisfy (5.19) and (5.20), then there must exist such that
[TABLE]
It also follows from our construction that each interval contains at least distinct points of the form where and Since there are only such points we have
[TABLE]
We also have the bound
[TABLE]
Now let be a maximal separated subset of or equivalently of . Then we have
[TABLE]
If satisfy (5.19) and (5.20), then as stated above for some . Clearly a separated set can only contain one point from each interval Therefore
[TABLE]
Substituting the bounds (5.21), (5.22), and (5.24) into (5.23), we obtain
[TABLE]
Employing (5.18) and the fact we obtain
[TABLE]
Therefore
[TABLE]
and our proof is complete. ∎
6 Proof of Theorem 2.15
In this section we prove Theorem 2.15. We start with a reformulation of what it means for an IFS to be consistently separated with respect to a measure .
Theorem 6.1**.**
Let be a slowly decaying measure. An IFS has the CS property with respect to if and only if there exists and such that
[TABLE]
Proof.
Suppose that for any and we have
[TABLE]
Then by Proposition 3.6, Lemma 3.7, and the fact , for any there exists such that yet has zero Lebesgue measure. Therefore the IFS cannot satisfy the CS property with respect to . So we have shown the rightwards implication in our if and only if.
Now suppose that there exists and such that
[TABLE]
Then there exists such that for all sufficiently large we have
[TABLE]
Combining the fact that for together with Lemma 3.7, we see that Proposition 3.4 implies that the set has positive Lebesgue measure for any satisfying Therefore our IFS satisfies the CS property with respect to and we have proved the leftwards implication of our if and only if. ∎
The reformulation of the CS property provided by Theorem 6.1 better explains why we used the terminology consistently separated to describe this property.
With the reformulation provided by Theorem 6.1, we can give a short proof of Theorem 2.15.
Proof of Theorem 2.15.
Let be a slowly decaying -invariant ergodic probability measure. Suppose that , the pushforward of is not absolutely continuous. Then by Proposition 3.11, for any and we have
[TABLE]
By Theorem 6.1 it follows that the IFS does not satisfy the CS property with respect to . ∎
7 Proof of Theorem 2.16
In this section we prove Theorem 2.16. Recall that Theorem 2.16 relates to conformal iterated function systems. The parameter is the unique solution to
[TABLE]
Moreover, is the unique measure supported on satisfying
[TABLE]
To prove Theorem 2.16 we need to state some additional properties of the measure :
- •
Let and be such that . Then for any there exists such that
[TABLE]
- •
For any we have
[TABLE]
- •
For any we have
[TABLE]
- •
For any we have
[TABLE]
- •
There exists such that
[TABLE]
For a proof of these properties we refer the reader to [18], [38], and [48].
Before giving our proof we make an observation. Given we have the following equivalences:
[TABLE]
So the hypothesis of Theorem 2.16 can be restated in terms of the divergence of
Proof of Theorem 2.16.
We split our proof into individual steps.
**Step . Lifting to .
**Let us fix and satisfying the hypothesis of our theorem. Moreover, we let be a sequence such that . For any consider the ball
[TABLE]
By (7.1) we know that there exists such that
[TABLE]
and
[TABLE]
In what follows we let
[TABLE]
Equation (7.6) implies the following:
[TABLE]
To complete our proof it therefore suffices to show that
[TABLE]
Note that we have
[TABLE]
This is because of our underlying divergence assumption and the following:
[TABLE]
**Step 2. A density theorem for .
**To prove (7.8) we will make use of a density argument. Since we are working in we do not have the Lebesgue density theorem. Instead we have the statement: suppose satisfies then for -almost every we have
[TABLE]
One can see that this statement holds using the results of Rigot [47]. In particular, we can equip with a metric so that is doubling measure. We can then apply Theorem and Theorem from [47]. Using (7.10), we see that to prove (7.8), it suffices to show that for any there exists such that
[TABLE]
for all sufficiently large. The rest of the proof now follows from a similar argument to that given by the author in [2]. The difference being here we are now working in the sequence space rather than . We include the relevant details for the sake of completeness.
**Step 3. Defining and verifying the hypothesis of Lemma 3.3.
**Let us fix and . In what follows we let . For let
[TABLE]
and let
[TABLE]
Note that
[TABLE]
Therefore to prove (7.11), it is sufficient to prove that there exists independent of such that
[TABLE]
Note that
[TABLE]
This follows from
[TABLE]
In the last line we made use of our underlying hypothesis and the equivalence stated before our proof. Importantly we see that the collection of sets satisfies the hypothesis of Lemma 3.3.
**Step 4. Bounding
**To apply Lemma 3.3 we need to show that the following bound holds:
[TABLE]
Let be such that and . As a first step in our proof of (7.13) we will bound
[TABLE]
There are two cases that naturally arise, when and when Let us consider first the case If then there is at most one such that
[TABLE]
Moreover this must equal This gives us the bound:
[TABLE]
In the penultimate line we used that is decreasing. Thus we have shown that if then
[TABLE]
We now consider the case where In this case, if and
[TABLE]
we must have
[TABLE]
Using this observation we obtain:
[TABLE]
Thus we have shown that if then
[TABLE]
Combining (7.14) and (7.15) we obtain the bound
[TABLE]
Importantly this bound holds for all .
Applying (7.16) we obtain:
[TABLE]
We now analyse each term in (7) individually. Repeating the arguments given at the end of Step we can show that
[TABLE]
Focusing on the second term in (7) we obtain:
[TABLE]
In the last line we used that so can be bounded above by a constant independent of and .
We now focus on the third term in (7):
[TABLE]
Substituting (7.18), (7), and (7) into (7) we obtain
[TABLE]
Therefore (7.13) holds.
**Step 5. Applying Lemma 3.3.
**Since there exists such that Therefore for sufficiently large we have
[TABLE]
It follows now by (7.13), (7.18) and (7.21) that there exists some independent of such that
[TABLE]
Applying Lemma 3.3 it follows that
[TABLE]
This implies (7.12) and completes our proof.
∎
8 Applications of the mass transference principle
The main results of this paper give conditions ensuring a limsup set of the form or has positive or full Lebesgue measure. For these results it is necessary to assume that some appropriate volume sum diverges. If the relevant volume sum converged, then the limsup set in question would automatically have zero Lebesgue measure by the Borel-Cantelli lemma. It is still an interesting problem to determine the metric properties of a limsup set when the volume sum converges. Thankfully there is a powerful tool for determining the size of a limsup set when the volume sum converges. This tool is known as the mass transference principle and is due to Beresnevich and Velani [8]. We provide a brief account of this technique below.
We say that a set is Ahlfors regular if
[TABLE]
for all and Given and a ball we define
[TABLE]
The theorem stated below is a weaker version of a statement proved in [8]. It is sufficient for our purposes.
Theorem 8.1**.**
Let be Ahlfors regular and be a sequence of balls with radii converging to zero. Let and suppose that for any ball in we have
[TABLE]
Then, for any ball in
[TABLE]
Theorem 8.1 can be applied in conjunction with Theorems 2.2, 2.6 and 2.10, to prove many Hausdorff dimension results for the limsup sets and when the appropriate volume sum converges. We simply have to restrict to a subset of the parameter space where we know that the corresponding attractor will always be Ahlfors regular. For the sake of brevity we content ourselves with the following statement for the family of iterated function systems studied in Section 5. This statement is a consequence of Theorem 2.10 and Theorem 8.1.
Theorem 8.2**.**
Suppose then for any and we have
[TABLE]
and
[TABLE]
9 Examples
The purpose of this section is to provide some explicit examples to accompany the main results of this paper.
9.1 IFSs satisfying the CS property
Here we provide two classes of IFSs that satisfy the CS property with respect to some measure . These IFSs will have contraction ratios lying in a special class of algebraic integers known as Garsia numbers. A Garsia number is a positive real algebraic integer with norm whose Galois conjugates all have modulus strictly greater than . Examples of Garsia numbers include for any , and the appropriate root of . The lemma below is due to Garsia [20], for a short proof see [2].
Lemma 9.1**.**
Let be the reciprocal of a Garsia number. Then there exists such that for any two distinct we have
[TABLE]
Example 9.2**.**
Let be the Bernoulli measure and for each let the corresponding IFS be
[TABLE]
For any and it can be shown that
[TABLE]
Therefore by Lemma 9.1, if is the reciprocal of a Garsia number, for any and distinct we have
[TABLE]
It follows that for any we have
[TABLE]
for all . Applying Proposition 3.9 we see that for any and satisfying we have that Lebesgue almost every is contained in Therefore if is the reciprocal of a Garsia number, then the IFS has the CS property with respect to . This fact is a consequence of the main result of [3]. The proof given there relied upon certain counting estimates due to Kempton [30]. The argument given in the proof of Proposition 3.9 doesn’t rely on any such counting estimates. Instead we make use of the fact that the Bernoulli convolution is equivalent to the Lebesgue measure and is expressible as the weak star limit of weighted Dirac masses supported on elements of the set .
Example 9.3**.**
Let be the Bernoulli measure and let our IFS be
[TABLE]
where . For each the corresponding attractor is . If both and are reciprocals of Garsia numbers, then it follows from Lemma 9.1 that for some for any we have
[TABLE]
for distinct Therefore
[TABLE]
for any for all
Note that and each of our contractions have the same matrix part. Applying Proposition 3.9, we see that that for any and satisfying we have that Lebesgue almost every is contained in Therefore when are both reciprocals of Garsia numbers, the IFS satisfies the CS property with respect to . It is perhaps also worth mentioning that by Proposition 3.9, if both and are reciprocals of Garsia numbers, then the pushforward of is absolutely continuous.
9.2 The non-existence of Khintchine like behaviour without exact overlaps
In [2] the author asked whether the only mechanism preventing an IFS from observing some sort of Khintchine like behaviour was the presence of exact overlaps. The example below, which is based upon Example 1.2 from [25], shows that there are other mechanisms preventing Khintchine like behaviour.
Example 9.4**.**
Pick so that the IFS
[TABLE]
does not contain an exact overlap. Now consider the following IFS acting on :
[TABLE]
The attractor for is , where is the middle third Cantor set. Therefore . Since did not contain an exact overlap, it follows that also does not contain an exact overlap.
Let be such that
[TABLE]
So in particular we have
[TABLE]
If it were the case that our IFS exhibited Khintchine like behaviour, then with (9.1) in mind, at the very least we would expect that there exists such that the set
[TABLE]
has Hausdorff dimension equal to . We now show that in fact
Let
[TABLE]
Clearly has the middle third Cantor set as its attractor. We now make the simple observation that if satisfies for some for , then for some . This means that if for some then must be contained in one of horizontal strip of height and width . Such a strip can be covered by balls of diameter for some independent of . It follows that the set of satisfying for some can be covered by balls of diameter . For each let be such a collection of balls. By construction, for any the set is a cover of .
Now let
[TABLE]
Then
[TABLE]
In the final equality we used (9.2) to guarantee We have shown that for any . Therefore Since and we have as required.
Note that this example can easily be generalised to demonstrate a similar phenomenon when the underlying attractor has positive Lebesgue measure.
10 Final discussion and open problems
A number of problems and questions naturally arise from the results of this paper. The first and likely most difficult question is the following:
- •
Can one derive general, verifiable conditions for an IFS under which we can conclude it exhibits Khintchine like behaviour?
This question seems to be very difficult and appears to be out of reach of our current methods. As such it seems that a more reasonable immediate goal would be to prove results for general parameterised families of iterated function systems. One can define a parameterised family of iterated function systems in the following general way. Suppose that is an open subset of and for each we have an IFS given by
[TABLE]
where for each we have and For each we denote the attractor corresponding to this iterated function system by . We would like to be able to describe what, if any, Khintchine like behaviour is observed for for a typical . The methods of this paper do not extend to this general a setting and only work when some transversality condition is assumed. We expect that the conjecture stated below holds under some weak assumptions on the functions and
For a -invariant ergodic probability measure and a fixed we denote the corresponding Lyapunov exponents by
Conjecture 10.1**.**
Let be a slowly decaying -invariant ergodic probability measure and suppose that for Lebesgue almost every . Then the following statements hold:
- •
For Lebesgue almost every for any and Lebesgue almost every is contained in .
- •
For Lebesgue almost every for any there exists such that yet has zero Lebesgue measure.
Much of the analysis of this paper was concerned with the sequence
[TABLE]
where and is some slowly decaying -invariant ergodic probability measure. In fact each of our main results was obtained by deriving some quantitative information about the values this sequence takes for typical values of . The behaviour of this sequence provides another useful method for measuring how an IFS overlaps. For the parameterised families considered above, we conjecture that the statement below is true under some weak assumptions on the maps and
Conjecture 10.2**.**
Let be a slowly decaying -invariant ergodic probability measure and suppose that for Lebesgue almost every . Then for Lebesgue almost every , for any for sufficiently small we have
[TABLE]
One of the interesting ideas to arise from this paper is the notion of an IFS satisfying the CS property with respect to a measure . Proceeding via analogy with Theorem 2.10, we expect that given a measure , it is the case that within a parameterised family of IFSs the CS property will not typically be satisfied with respect to . Indeed if Conjecture 10.2 were true then this statement would follow from Proposition 3.6. That being said, we still expect that for a parameterised family of IFSs, it will often be the case that there exists a large subset of the parameter space where the IFS does satisfy the CS property with respect to . We conjecture that the statement below is true under some weak assumptions on the maps and
Conjecture 10.3**.**
Let be a slowly decaying -invariant ergodic probability measure and suppose that for Lebesgue almost every . Then there exists such that and for any the IFS satisfies the CS property with respect to .
Theorem 2.10 supports the validity of Conjectures 10.1, 10.2, and 10.3.
Theorem 2.15 states that satisfying the CS property with respect to implies the pushforward is absolutely continuous. The CS property appears to only be satisfied in exceptional circumstances. As such it is natural to wonder whether there exists a more easily verifiable condition phrased in terms of limsup sets, which implies the absolute continuity of . We pose the following question:
- •
Let be the pushforward of a measure . What is the smallest class of functions, such that if for some the set has positive Lebesgue measure for all belonging to this class, then will be absolutely continuous?
Much of the work presented in this paper is inspired by the classical theorem of Khintchine stated as Theorem 1.2 in our introduction. Along with Khintchine’s theorem, one of the first results encountered in a course on Diophantine approximation is the following result due to Dirichlet.
Theorem 10.4** (Dirichlet).**
For any and , there exists and such
[TABLE]
Therefore, for any there exists infinitely many satisfying
[TABLE]
For us the interesting feature of Dirichlet’s theorem lies in the fact that it is a statement for all . In our setting it is obvious that for any IFS , for any we have
[TABLE]
The results of this paper demonstrate that for many overlapping IFSs, given a then Lebesgue almost every point in can be approximated by images of infinitely often at a scale decaying to zero at an exponentially faster rate than . See for example Theorem 2.10 where Lebesgue almost every point can be approximated at the scale yet With Theorem 10.4 in mind, it is natural to wonder whether there exists conditions under which (10.2) can be improved upon.
- •
Can one construct an IFS for which there exists such that
[TABLE]
Alternatively one could ask whether there exists such that these sets differ by a finite or countable set.
We remark here that for the family of IFSs it can be shown that there exists and such that Lebesgue almost every can be approximated by images of at the scale yet there exists a set of positive Hausdorff dimension within that cannot be approximated by images of at a scale better than . For more details on this example we refer the reader to the discussion at the end of [3].
We conclude now by emphasising one of the technical difficulties that is present within this paper that is not present within similar works on this topic. In many situations, if and we have some method for measuring how evenly distributed a measure is with (examples of methods of measurement include: absolute continuity, entropy, and dimension), then often will be at least as evenly distributed as with respect to this method of measurement. One may in fact see a strict increase in how evenly distributed is with respect to this method of measurement (see for example [24, 51]). A useful feature of the pushforward of Bernoulli measures is that they are often equipped with some sort of convolution structure. In many papers this convolution structure and the idea described above can be exploited to obtain results (see for example [24, 49, 51, 53, 58, 60]). Within this paper, the relevant method for measuring how evenly distributed a measure is, is to study the sequence given by (10.1). On a technical level, one of the main difficulties for us is that this method of measurement does not behave well under convolution. This is easy to see with an example. Let be the Bernoulli measure and let our IFS be For this IFS the attractor is We denote the pushforward of by . It is easy to see that for any and , we have
[TABLE]
So exhibits an optimal level of separation. Now let and consider the IFS For this IFS the attractor is We denote the pushforward of for this IFS by . It is easy to see that for we also have the optimal level of separation described by (10.3). Consider the measure This measure is simply the pushforward of the Bernoulli measure with respect to the IFS
[TABLE]
i.e. the IFS studied in Theorem 2.10. Examining the proof of Proposition 5.1, we see that for any there exists such that for any and we have
[TABLE]
Equation (10.4) demonstrates that we no longer have the strong separation properties that we saw earlier for our two measures and . We have in fact seen that after convolving and there is a drop in how evenly distributed the resulting measure is within . One could view this failure to improve under convolution as a consequence of how sensitive our method of measurement is to exact overlaps.
Acknowledgments. The author would like to thank the anonymous referee for their valuable comments. The author would like to thank Tom Kempton and Boris Solomyak for providing some useful feedback on an initial draft, and Ariel Rapaport for pointing out the reference [52]. This research was supported by the EPSRC grant EP/M001903/1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. C. Alexander, J. A. Yorke, Fat baker’s transformations, Ergodic Theory Dynam. Systems 4 (1984), no. 1, 1–23.
- 2[2] S. Baker, An analogue of Khintchine’s theorem for self-conformal sets, Math. Proc. Cambridge Philos. Soc. 167(3), 567–597.
- 3[3] S. Baker, Approximation properties of β 𝛽 \beta -expansions, Acta Arith. 168 (2015), 269–287
- 4[4] S. Baker, Approximation properties of β 𝛽 \beta -expansion II, Ergodic Theory Dynam. Systems, 38(5), 1627–1641.
- 5[5] B. Bárány, M. Hochman, A. Rapaport, Hausdorff dimension of planar self-affine sets and measures, Invent. Math., 216, 601–659 (2019).
- 6[6] I. Benjamini, B. Solomyak, Spacings and pair correlations for finite Bernoulli convolutions, Nonlinearity 22 (2009), no. 2, 381–393.
- 7[7] V. Beresnevich, D. Dickinson, S. Velani, Measure theoretic laws for lim sup sets, Mem. Amer. Math. Soc. 179 (2006), no. 846, x+91 pp.
- 8[8] V. Beresnevich, S. Velani, A mass transference principle and the Duffin-Schaeffer conjecture for Hausdorff measures, Ann. of Math. (2) 164 (2006), no. 3, 971–992.
