1. Introduction
Taking tangents and obtaining information on an object by studying its small-scale structure is a classical idea in analysis. Much as tangent spaces can be used to study the local structure of differentiable manifolds, tangent measures can be used to study the local structure of a Radon measure
$\mu $
. Tangent measures are defined as the weak-
$^*$
accumulation points of the scenery of
$\mu $
at x, that is, the flow
$(\mu _{x,t})_{t \geq 0}$
, where
$$ \begin{align*}\mu_{x,t}(A) = \frac{\mu(e^{-t}A + x)}{\mu(B(x,e^{-t}))} \end{align*} $$
for measurable
$A \subseteq B(0,1)$
, and
$B(x,e^{-t})$
denotes the closed ball centred at x and of radius
$e^{-t}$
.
The collection of tangent measures around a point can be very large, making it difficult to infer from this collection any information on the original measure. For example, O’Neil [Reference O’Neil27] has shown that there exist Radon measures on
$\mathbb R^d$
which possess every non-zero Radon measure as a tangent measure, at almost every point. This raises the question whether some tangent measures are more relevant than others in terms of studying the structure of the original measure.
Recently, it has been observed that instead of individual tangent measures, it is often more useful to study the statistical behaviour of the scenery
$(\mu _{x,t})_{t \geq 0}$
. To establish these statistics, one views the scenery as the orbit of
$\mu $
under the continuous magnification operation at x. This idea gives rise to the notion of tangent distributions, defined as the accumulation points of the scenery flow
$$ \begin{align*}\bigg( \frac{1}{T} \int_0^T \delta[\mu_{x, t}]\,dt \bigg)_{T> 0}. \end{align*} $$
Here and throughout,
$\delta [y]$
denotes the Dirac measure at the point y. Tangent distributions at x are supported on the collection of all tangent measures at x, and are closely connected to Furstenberg’s CP-processes [Reference Furstenberg11] and their coordinate-independent generalizations, Hochman’s fractal distributions [Reference Hochman15]. The theory of tangent distributions was greatly developed by Hochman and Shmerkin in [Reference Hochman and Shmerkin18] and further by Hochman in [Reference Hochman15].
It is often possible to study the geometric properties of a measure by studying the structure of its tangent distributions. In particular, measures for which the scenery flow converges, as
$T \rightarrow \infty $
, to a common distribution at almost every point in their support, are geometrically much more regular than arbitrary measures. For example, they are always exact-dimensional [Reference Hochman15]. Measures of this kind are called uniformly scaling, a concept first introduced by Gavish [Reference Gavish13].
In recent years, certain dynamical properties of tangent distributions have proved to be a powerful tool in establishing fine-structure properties of fractal measures. For example, when the scenery flow converges to an ergodic fractal distribution (see Definition 5.1) at almost every point, as is often the case for uniformly scaling measures due to a remarkable result of Hochman [Reference Hochman15], the measure satisfies a strong version of the classical Marstrand projection theorem: if
$\mu $
is a uniformly scaling measure on
$\mathbb R^d$
generating an ergodic fractal distribution, then for every k and
$\varepsilon> 0$
there exists an open dense set
$\mathcal {U}_\varepsilon $
in the space of linear projections from
$\mathbb R^d$
to
$\mathbb R^k$
such that for all
$\pi \in \mathcal {U}_\varepsilon $
,
This is due to Hochman and Shmerkin [Reference Hochman and Shmerkin18, Theorem 8.2]. Here and in the sequel
$\dim $
refers to Hausdorff dimension.
In [Reference Ferguson, Fraser and Sahlsten8], Ferguson, Fraser and Sahlsten applied this projection theorem to prove Falconer’s distance set conjecture in some special cases: If
$\mu $
is a uniformly scaling measure which generates an ergodic fractal distribution and
$\mathcal {H}^1({\textrm {spt}}\,\mu )> 0$
, writing
for the distance set of the support of
$\mu $
, we have
This is [Reference Ferguson, Fraser and Sahlsten8, Theorem 1.7].
Another application of the uniform scaling property is found in the prevalence of normal numbers in the support of the measure. Recall that a number
$x \in [0,1]$
is a-normal if the sequence
$\lbrace a^k x \mod 1 \rbrace _{k \in \mathbb N}$
equidistributes for Lebesgue measure, and a measure
$\mu $
is called pointwise a-normal if
$\mu $
-almost every x is a-normal. In a breakthrough paper [Reference Hochman and Shmerkin19, Theorem 1.1], Hochman and Shmerkin established a condition for a uniformly scaling measure to be pointwise normal in terms of dynamical properties of its tangent distribution: if
$\mu $
is uniformly scaling, generates an ergodic fractal distribution P and the pure-point spectrum of P does not contain a non-zero integer multiple of
${1}/{\log a}$
, where
$a> 1$
is a Pisot number, then
$\mu $
is pointwise a-normal.
Motivated in part by this progression, much attention has lately been given to the problem of understanding the scenery flow for various classes of fractal measures, and whether they are uniformly scaling and generate ergodic fractal distributions. Examples of uniformly scaling measures include ergodic measures in the one-sided shift space [Reference Fraser and Pollicott10], the occupation measure on Brownian motion in dimension at least
$3$
[Reference Gavish13], self-affine measures on Bedford–McMullen-type carpets [Reference Ferguson, Fraser and Sahlsten8] and self-similar measures with the open set condition [Reference Gavish13]. Recall that a measure
$\mu $
on
$\mathbb R^d$
is self-similar if there exist a finite family of strictly contracting, angle-preserving affine maps
$\lbrace \varphi _i \rbrace _{i=1}^m$
and a probability vector
$(p_i)_{i=1}^m$
with positive entries such that
$$ \begin{align} \mu = \sum_{i=1}^m p_i \cdot \mu \circ \varphi_i^{-1}. \end{align} $$
For measures on
$\mathbb R$
that satisfy (1.3) for some equicontractive family
$\lbrace \varphi _i \rbrace _{i=1}^m$
, Feng [Reference Feng6] has shown that the open set condition can be relaxed to the strictly weaker finite-type condition. The separation conditions play crucial roles in [Reference Feng6, Reference Gavish13], and this gives rise to the natural question: are all self-similar measures uniformly scaling?
The main result of this paper, Theorem 1.1, provides an affirmative answer to this question under a separation condition called the weak separation condition. We say that the family
$\lbrace \varphi _i \rbrace _{i=1}^m$
(or the associated self-similar measure) in (1.3) satisfies the weak separation condition if the identity is not an accumulation point of the topological group generated by
$F^{-1} F$
, where F is the semigroup with identity generated by
$\lbrace \varphi _i \rbrace _{i=1}^m$
. (In §2, Definition 2.1, we adapt a different but equivalent characterization that is more explicitly reflected in the geometry of the self-similar measure.) We remark that this condition is strictly weaker than the conditions present in [Reference Feng6, Reference Gavish13]; see [Reference Hare, Hare and Rutar14, Reference Lau and Ngai25, Reference Zerner30] for discussion on the relationship between the three conditions.
Theorem 1.1. If
$\mu $
is a self-similar measure satisfying the weak separation condition, then
$\mu $
is uniformly scaling and generates an ergodic fractal distribution.
As an immediate application to the geometry of the measure, this allows us to deduce (1.1) and (1.2) for self-similar measures satisfying the weak separation condition. Combining Theorem 1.1 with the methods of Hochman and Shmerkin [Reference Hochman and Shmerkin19], we also obtain an application to their pointwise normality; see Corollary 5.4 in §5.
The idea in the proof of Theorem 1.1 is to approximate the flow
$(\mu _{x,t})_{t \geq 0}$
with another flow that behaves statistically in a manner similar to the orbit of a point in the underlying shift space. We construct this flow by first producing a fixed reference measure
$\nu $
on
$\mathbb R^d$
via the weak separation condition (in (3.4)). Then, drawing from certain recurrence properties in the underlying symbolic space, we may ensure that
$\mu _{x, t}$
is ‘close to’
$\nu $
for a large proportion of scales t, in a quite strong sense which also ensures that the magnifications of
$\mu _{x,t}$
are close to those of
$\nu $
. This is made precise in Propositions 3.3 and 3.4. We may then use tools from ergodic theory to deduce that the approximating flow equidistributes for a limiting measure on the space of measures independent of the point x. Finally, a compactness argument allows us to deduce the convergence of the scenery flow of
$\mu $
. It then follows immediately from results of Hochman that the generated distribution is an ergodic fractal distribution.
In the presence of the open set condition, approximating
$(\mu _{x,t})_{t \geq 0}$
with another flow is not necessary to gain access to tools from ergodic theory. Indeed, it follows from the open set condition and relation (1.3) that
$\mu $
is homogeneous (in the sense of Gavish [Reference Gavish13]), that is, any measure in the (weak-
$^*$
) closure of the family
$\lbrace \mu _{x,t}: x \in \mathbb R^d, t \geq 0 \rbrace $
equals a restriction of a scaled and translated copy of
$\mu $
itself. Drawing from the CP-process machinery of Furstenberg, Gavish [Reference Gavish13] showed that this closure always contains many uniformly scaling measures, in fact when
$\mu $
is any Radon measure on
$\mathbb R^d$
. Combining this with the homogeneity of
$\mu $
, Gavish concluded that self-similar measures with the open set condition are uniformly scaling.
Another argument was presented by Hochman in [Reference Hochman15] assuming the strong separation condition under which the measures in the sum of (1.3) have disjoint supports. In particular, if K denotes the support of
$\mu $
, then the map
$T: K \rightarrow K$
,
$x \mapsto \varphi _i^{-1}(x)$
, where
$1 \leq i \leq m$
is the unique number such that
$x\in \varphi _i(K)$
, is well defined and preserves
$\mu $
. As described in [Reference Hochman15, §4], the scenery flow of
$\mu $
now arises as a factor of a suspension flow of the dynamical system
$(K, \mu , T)$
(or of a certain skew-product dynamical system, when the linear parts of
$\varphi _i$
are not positive scalars). Applying tools from ergodic theory on this suspension flow allowed Hochman to establish the uniform scaling property for self-similar measures satisfying the strong separation condition.
Since a self-similar measure satisfying the weak separation condition is not necessarily homogeneous, nor is it in general preserved under any obvious map on
$\mathbb R^d$
, the existing arguments do not directly apply in our setting. On the other hand, our argument relies heavily on the weak separation condition in providing the reference measure
$\nu $
, which leaves open the question whether self-similar measures without this separation condition are uniformly scaling.
The paper is organized as follows. In §2 we set up our notation and recall the basic theory of dynamical systems and iterated function systems (IFSs). In §3 we prove Theorem 1.1 in the simplified case when the defining IFS consists of only homotheties, that is, functions composed of scaling and translation operations. Afterwards, we discuss the minor changes required to prove the general case. Section 4 is devoted to the proofs of Propositions 3.3 and 3.4, the main tools required in the proof of Theorem 1.1. In §5 we briefly discuss the second assertion of Theorem 1.1, a generalization of Theorem 1.1 for ergodic Markov measures, and its application to pointwise normality of self-similar measures.
2. Preliminaries
In this paper a measure always refers to a Radon measure on a metrizable topological space. For a compact subset A of a metric space X, write
$\mathcal {P}(A)$
for the space of probability measures on X for which
${\textrm {spt}}\,\mu \subseteq A$
. This space is endowed with the compact weak-
$^*$
topology which we metrize with the Prokhorov metric d. We use the notation
$\Vert \cdot \Vert $
to denote the total variation norm. It is well known that convergence in the metric induced by the total variation norm implies convergence in the Prokhorov metric. Finally, the Euclidean norm is denoted by
$|\cdot |$
and the supremum norm by
$\Vert \cdot \Vert _\infty $
.
For a measure
$\nu $
and all non-null measurable sets A, write
$\nu |_A: B \mapsto \nu ( B \cap A)$
for the restriction of
$\nu $
to A and
$\nu _A = \nu (A)^{-1} \nu |_A$
for the normalized restriction. For a
$\nu $
-measurable function f, write
$f\nu = \nu \circ f^{-1}$
for the image (or push-forward) measure, and if f is integrable, write
$f d\nu : A \mapsto \int \chi [A](x) f(x) \,d\nu (x)$
for the weighted measure, where
$\chi [A]$
stands for the indicator function of A.
2.1. The scenery flow
Following the notation of [Reference Hochman15], for
$t \geq 0$
and
$x \in \mathbb R^d$
, we write
$S_t: y \mapsto e^t y$
for the exponential scaling map and
$T_x: y \mapsto y-x$
for the translation which takes x to the origin. The function S induces an additive action of
$[0, +\infty )$
on
$\mathcal {P}(B(0,1))$
, given for every t by
$S_t^*: \nu \mapsto C (S_t \nu )|_{B(0,1)}$
, where C is such that
$S_t^* \nu $
is a probability measure. Here and throughout,
$B(0,1)$
denotes the closed unit ball. We sometimes refer to
$S^*$
as the ‘zoom-in’ operation and point out that in [Reference Hochman15] it was denoted by
$S^\square $
in order to emphasize restriction to
$B(0,1)$
. For the composed scaling and translation operation, we use the short-hand notation
Using the notation introduced, we recall the definition of the scenery flow of a measure
$\nu $
at a point
$x \in {\textrm {spt}}\,\nu $
as the flow
$$ \begin{align*}\bigg( \frac{1}{T} \int_0^T \delta[\nu_{x, t}]\,dt \bigg)_{T> 0}. \end{align*} $$
Note that this is a flow on
$\mathcal {P}(\mathcal {P}(B(0,1)))$
. The elements of
$\mathcal {P}(\mathcal {P}(B(0,1)))$
are termed distributions to emphasize that they are measures on the space of measures. The space of distributions is endowed with the weak-
$^*$
topology. As a consequence of the compactness of this topology, the set of accumulation points of the scenery flow at any point is non-empty. Recall that a measure
$\nu $
is termed uniformly scaling if there exists a distribution P such that the scenery flow of
$\nu $
converges to
$P \nu $
-almost everywhere, as
$T \rightarrow \infty $
.
2.2. The symbolic space
Let
$\Gamma = \lbrace 1, \ldots , m \rbrace $
be an alphabet with
$m \geq 2$
, and let
$\Phi = \lbrace \varphi _i \rbrace _{i \in \Gamma }$
be a finite family of contractions on
$\mathbb R^d$
. The family
$\Phi $
is called an iterated function system. It is well known (see, for example, [Reference Falconer4]) that there is a unique compact set K, called the attractor of
$\Phi $
, such that
If the functions
$\varphi _i$
are of the form
$\varphi _i(x) = \rho _i R_i x + a_i$
, where
$0 < \rho _i < 1$
,
$R_i$
is an orthogonal matrix on
$\mathbb R^d$
and
$a_i \in \mathbb R^d$
, the IFS
$\Phi $
is called self-similar and its attractor a self-similar set. Since our study does not depend on the coordinate basis of
$\mathbb R^d$
, in order to simplify notation we may and do suppose that
$0 \in K$
and
$K \subset B(0,1)$
, where the inclusion is strict.
Write
$\Gamma ^* = \bigcup _n \Gamma ^n$
for the set of finite vectors, or words, composed of elements of
$\Gamma $
. We usually denote finite words by characters
$\mathtt {a}$
,
$\mathtt {b}$
and
$\mathtt {c}$
. For a finite word
$\mathtt {a} = (i_0, i_1 ,\ldots , i_n) \in \Gamma ^*$
, write
$\varphi _{\mathtt {a}} =\varphi _{i_0} \circ \cdots \circ \varphi _{i_n}$
and
$K_{\mathtt {a}} = \varphi _{\mathtt {a}}(K)$
. The notation
$|\mathtt {a}|$
stands for the number of elements in the word
$\mathtt {a}$
and is called the length of
$\mathtt {a}$
. For finite words
$\mathtt {a}=(i_0, \ldots , i_n)$
and
$\mathtt {b}=(j_0, \ldots , j_m)$
, we let
$\mathtt {a} \mathtt {b}:=(i_0, \ldots , i_n, j_0, \ldots , j_m) \in \Gamma ^{|\mathtt {a}|+|\mathtt {b}|}$
denote their concatenation.
Elements of
$\Gamma ^{\mathbb N}$
are called infinite words and we often denote them by characters
$\mathtt {i}$
and
$\mathtt {j}$
. For a word
$\mathtt {i}$
, either infinite or of length
$|\mathtt {i}| \geq k$
, we write
$\mathtt {i}|_k \in \Gamma ^k$
for its projection to the first k coordinates. Given
$\mathtt {a} \in \Gamma ^*$
, we call elements of the set
$\lbrace \mathtt {b} \in \Gamma ^{\mathbb N} \cup \bigcup _{k \geq |\mathtt {a}|} \Gamma ^k: \mathtt {b}|_{|\mathtt {a}|} = \mathtt {a} \rbrace $
descendants of
$\mathtt {a}$
; the words
$\mathtt {a}|_k$
,
$k = 1, 2, \ldots , |\mathtt {a}|$
, are called the ancestors of
$\mathtt {a}$
. These notions extend in the obvious way to the sets
$K_{\mathtt {a}}$
and the functions
$\varphi _{\mathtt {a}}$
. For a finite word
$\mathtt {b} \in \Gamma ^*$
, we write
$[\mathtt {b}]$
for the cylinder set
$\lbrace \mathtt {i} \in \Gamma ^{\mathbb N}: \mathtt {i}|_{|\mathtt {b}|} = \mathtt {b} \rbrace $
. We also use the term ‘cylinder’ to refer to the sets
$K_{\mathtt {a}}$
. The collection of all cylinder sets generates the topology with which we equip
$\Gamma ^{\mathbb N}$
.
Let
$\sigma : (i_0, i_1 ,\ldots ) \mapsto (i_1, i_2, \ldots )$
denote the continuous left-shift on
$\Gamma ^{\mathbb N}$
. We say that a measure
$\nu $
on
$\Gamma ^{\mathbb N}$
is invariant with respect to
$\sigma $
if
$\sigma \nu = \nu $
, and ergodic if
$\nu (E) \in \lbrace 0,1 \rbrace $
for all sets E satisfying
$\sigma ^{-1}E = E$
.
It is sometimes convenient to consider the two-sided extension
$(\Gamma ^{\mathbb Z}, \sigma )$
of the dynamical system
$(\Gamma ^{\mathbb N}, \sigma )$
, where
$\sigma (\ldots , i_{-1}; i_0, i_1, \ldots ) = (\ldots , i_{0}; i_1, i_2, \ldots )$
is also used to denote the left-shift on
$\Gamma ^{\mathbb Z}$
which, we note, is now invertible. For
$\mathtt {i} = (\ldots , i_{-1}; i_0, i_1, \ldots ) \in \Gamma ^{\mathbb Z}$
and
$n \leq m \in \mathbb Z$
, write
$\mathtt {i}|_{n}^m = (i_n, i_{n+1} \ldots , i_{m-1}, i_m) \in \Gamma ^*$
and
$[\mathtt {i}]_n^m = \lbrace (\ldots , j_{-1};j_0, j_1 ,\ldots ) \in \Gamma ^{\mathbb Z}: (j_n, j_{n+1}, \ldots ,j_{m-1}, j_m) = \mathtt {i}|_n^m \rbrace $
. The topology of
$\Gamma ^{\mathbb Z}$
is again generated by the cylinder sets
$[\mathtt {i}]_n^m$
. There exists a natural bijection between the spaces of
$\sigma $
-invariant probability measures on
$\Gamma ^{\mathbb N}$
and
$\Gamma ^{\mathbb Z}$
, given by
$\nu \mapsto \nu ^*$
, where
$\nu ^*([\mathtt {i}]_n^m) = \nu ([\mathtt {i}|_{n}^m])$
for every
$\mathtt {i} \in \Gamma ^{\mathbb Z}$
and
$n \leq m$
. It is straightforward to check that this bijection maps ergodic measures to ergodic measures.
Write
$\pi $
for the surjective map
$\Gamma ^{\mathbb N} \rightarrow K$
,
which we call the natural projection. Slightly abusing notation, we often write
$T_{\mathtt {i}} := T_{\pi (\mathtt {i})}$
for the translation taking
$\pi (\mathtt {i})$
to the origin.
Fix a probability vector
$p = (p_i)_{i \in \Gamma }$
and write
$\bar {\mu } = p^{\mathbb N}$
for the associated Bernoulli measure on
$\Gamma ^{\mathbb N}$
. It is well known that the measure
$\pi \bar {\mu } =: \mu $
is a Radon measure supported on the self-similar set K and satisfies
This measure is called the self-similar measure associated to the vector p. Without loss of generality, we assume that p has strictly positive entries: those i with
$p_i = 0$
can be removed from
$\Gamma $
without affecting
$\mu $
, and if only one entry is positive,
$\mu $
is a point mass and trivially uniformly scaling.
2.3. The weak separation condition
To make the structure of self-similar sets and measures more tractable, there are numerous separation conditions one can impose on the defining IFS. These conditions are meant to limit the ways the cylinders
$K_{\mathtt {a}}$
can overlap with one another, making it easier to understand the geometric properties of self-similar measures by studying the dynamical system
$(\Gamma ^{\mathbb N}, \mu , \sigma )$
. Understanding the geometric properties of self-similar sets and measures without assuming any separation condition is an interesting and challenging problem in fractal geometry; see [Reference Hochman16, Reference Hochman, Sirakov, Ney de Souza and Viana17, Reference Shmerkin28, Reference Varjú29] and the references therein for some recent breakthroughs on the topic.
The weak separation condition was first introduced by Lau and Ngai in [Reference Lau and Ngai24, Definition 6.2], where the authors studied the multifractal formalism for self-similar measures satisfying the condition. It allows overlaps between the cylinders
$K_{\mathtt {a}}$
but in a certain limited manner: roughly speaking, for any
$r>0$
, any closed ball of radius r may intersect at most M distinct cylinders of diameter approximately r, for some M independent of r. We point out that no bound is imposed on the number of exact overlaps: given
$\mathtt {a} \in \Gamma ^*$
, there might be numerous words
$\mathtt {b} \in \Gamma ^*$
for which
$K_{\mathtt {a}} = K_{\mathtt {b}}$
. Before we formulate the separation condition precisely, some more notation is in order.
Let
$\Phi = \lbrace \varphi _i(x) = \rho _i R_i x + a_i \rbrace _{i \in \Gamma }$
be a self-similar IFS. For a finite word
$\mathtt {a} = (i_0, \ldots , i_{n}) \in \Gamma ^*$
, write
$\mathtt {a}^- = (i_0, \ldots , i_{n-1})$
,
$\rho _{\mathtt {a}} = \rho _{i_0} \cdots \rho _{i_n}$
,
$B_{\mathtt {a}} = \varphi _{\mathtt {a}}(B(0,1))$
, and denote
We call the collection
$\mathcal {N}(\mathtt {a})$
the neighbourhood system of
$\mathtt {a}$
. The sets
$\varphi _{\mathtt {a}} \circ f(K)$
,
$f \in \mathcal {N}(\mathtt {a})$
, are called the neighbours of
$K_{\mathtt {a}}$
.
Definition 2.1. The IFS
$\Phi $
satisfies the weak separation condition if
Remark 2.2. If K is not contained in an affine hyperplane and we write
$\mathcal {N}'(\mathtt {a}) = \lbrace f \in \mathcal {N}(\mathtt {a}): f(K) \cap {\textrm {int}}\, {\textrm {conv}}\,K \neq \emptyset \rbrace $
, where
${\textrm {int}}$
denotes the interior and
${\textrm {conv}}$
denotes the convex hull, then it is not difficult to see that (2.1) is equivalent to the condition
$\mathop {{\sup}}\limits _{\mathtt {a} \in \Gamma ^*} \# \mathcal {N}'(\mathtt {a}) < \infty $
. In factFootnote
1
, when
${\textrm {int}}\, {\textrm {conv}} K \neq \emptyset $
, it is an interesting question whether (2.1) is equivalent to the a-priori stronger condition
$$ \begin{align} \# \bigg( \bigcup_{\mathtt{a} \in \Gamma^*} \mathcal{N}'(\mathtt{a})\bigg) < \infty. \end{align} $$
This question was first raised by Lau and Ngai in [Reference Lau and Ngai25]. Some evidence for the equivalence was provided in [Reference Hare, Hare and Rutar14] where the authors showed that (2.1) implies (2.2) when
$K = [0,1]$
.
While appearing different in form, Definition 2.1 coincides with that of Lau and Ngai; this is proved in Zerner’s paper [Reference Zerner30, Theorem 1], where multiple equivalent formulations (including the one in the introduction) for the weak separation condition are listed. We refer the reader to [Reference Feng and Lau7, Reference Fraser, Henderson, Olson and Robinson9, Reference Käenmäki and Rossi21, Reference Lau and Wang26] for further results on the structure of weakly separated self-similar sets and measures.
In our study of the scenery flow, we aim to establish regularity in
$(\mu _{\mathtt {i}, t})_{t \geq 0}$
through the existence of a recurring neighbourhood system in the sequence
$(\mathcal {N}(\mathtt {i}|_k))_{k \in \mathbb N}$
. To study this recurrence with the help of the theory of dynamical systems, we let
$\mathtt {a}_0 \in \Gamma ^*$
be a word for which
and call the maximal neighbourhood (system) the collection
The following observation regarding the recurrence of
$\mathcal {N}_0$
in the zoom-in process was made by Feng and Lau in [Reference Feng and Lau7]; see Figure 1 for its geometric interpretation. It is one of the key tools in our proof.
Here
$\mathtt {c}_1, \mathtt {c}_2 \in \Gamma ^*$
. The neighbourhood system of any cylinder whose symbolic coding ends with
$\mathtt {a}_0$
is
$\mathcal {N}_0$
.

Lemma 2.3. For any
$\mathtt {c} \in \Gamma ^*$
,
where we write
$\varphi _{\mathtt {c} \mathtt {a}_0} \mathcal {N}_0 = \lbrace \varphi _{\mathtt {c} \mathtt {a}_0} \circ f: f \in \mathcal {N}_0 \rbrace $
.
Proof We have
$$ \begin{align*} &\lbrace \varphi_{\mathtt{b}}: \mathtt{b} \in \Gamma^*,\ \rho_{\mathtt{b}} \leq \rho_{\mathtt{c} \mathtt{a}_0} \leq \rho_{\mathtt{b}^-},\ K_{\mathtt{b}} \cap B_{\mathtt{c} \mathtt{a}_0} \neq \emptyset \rbrace \\ &\quad\supset \lbrace \varphi_{\mathtt{c} \mathtt{a}}: \mathtt{a} \in \Gamma^*,\ \rho_{\mathtt{c} \mathtt{a}} \leq \rho_{\mathtt{c} \mathtt{a}_0} \leq \rho_{\mathtt{c} \mathtt{a}^-},\ K_{\mathtt{c} \mathtt{a}} \cap B_{\mathtt{c} \mathtt{a}_0} \neq \emptyset \rbrace\\ &\quad= \lbrace \varphi_{\mathtt{c}} \circ \varphi_{\mathtt{a}_0} \circ \varphi_{\mathtt{a}_0}^{-1} \circ \varphi_{\mathtt{a}}: \mathtt{a} \in \Gamma^*,\ \rho_{\mathtt{a}} \leq \rho_{ \mathtt{a}_0} \leq \rho_{\mathtt{a}^-},\ K_{ \mathtt{a}} \cap B_{\mathtt{a}_0} \neq \emptyset \rbrace \\ &\quad=\varphi_{\mathtt{c} \mathtt{a}_0} \mathcal{N}_0. \end{align*} $$
This is equivalent to
Recall from (2.3) and (2.4) that
$\mathcal {N}_0$
has cardinality at least that of the right-hand side of (2.5). Hence (2.5) holds with equality.
3. The scenery flow
For simplicity, we first prove the following special case of Theorem 1.1, and afterwards discuss the minor modifications required in the proof in order to lift these restrictions on the IFS.
Theorem 3.1. If
$\Phi = \lbrace \phi _i(x) = \rho x + a_i\rbrace _{i \in \Gamma }$
is an IFS of equicontractive homotheties on
$\mathbb R^d$
satisfying the weak separation condition, then any self-similar measure
$\mu $
associated to
$\Phi $
is uniformly scaling.
In the setting of Theorem 3.1, the neighbourhood system of a finite word
$\mathtt {a} \in \Gamma ^*$
assumes the slightly simplified form
If
$(r_n)_{n \in \mathbb N} \subseteq [0, +\infty )$
is a sequence such that
then the sequence
$$ \begin{align} \bigg( \frac{1}{r_n} \int_0^{r_n} \delta[\mu_{\mathtt{i}, t}] \,dt \bigg)_{n \in \mathbb N} \end{align} $$
is asymptotic to the scenery flow of
$\mu $
at
$\pi (\mathtt {i})$
. Our strategy is for every
$\varepsilon> 0$
and almost every
$\mathtt {i} \in \Gamma ^{\mathbb N}$
to choose the numbers
$r_n = r_n(\mathtt {i})$
in such a way that the tail of (3.2) is within Prokhorov distance
$\varepsilon $
from a distribution
$P_\varepsilon $
independent of
$\mathtt {i}$
. Provided that
$(r_n)_{n \in \mathbb N}$
also satisfies (3.1), it follows that tail of the scenery flow is within distance
$2\varepsilon $
from
$P_\varepsilon $
. Taking
$\varepsilon \rightarrow 0$
along a countable sequence and using the compactness of the space of distributions, we then obtain a set of full
$\mu $
-measure in which the scenery flow converges.
To find a distribution
$P_\varepsilon $
which nearly captures the statistics of the scenery of
$\mu $
, we want to approximate
$(\mu _{\mathtt {i}, t})_{t \geq 0}$
with a flow whose dynamics can be more easily traced back to
$(\Gamma ^{\mathbb N}, \bar {\mu }, \sigma )$
. Since our prior hope of accomplishing this is to use the recurrence of
$\mathcal {N}_0$
in
$(\mathcal {N}(\mathtt {i}|_k))_{k \in \mathbb N}$
which follows from the recurrent visits of
$(\sigma ^k \mathtt {i})_{k \in \mathbb N}$
in
$[\mathtt {a}_0]$
, our first task is to exhibit the scenery measures using the neighbourhood systems appearing around
$\pi (\mathtt {i})$
. The following representation is immediate from the self-similarity of
$\mu $
; recall that
$T_{\mathtt {i}}$
denotes the translation
$x \mapsto x - \pi (\mathtt {i})$
.
Lemma 3.2. Let
$\mathtt {i} \in \Gamma ^{\mathbb N}$
. For every
$k \in \mathbb N$
, there exists a probability vector
$(q_f(\mathtt {i}|_k)) _{f \in \mathcal {N}(\mathtt {i}|_k)}$
such that
$$ \begin{align*}\mu_{\mathtt{i}, t} = S_{t+ k \log \rho}^* T_{\sigma^k \mathtt{i}} \sum_{f \in \mathcal{N}(\mathtt{i}|_k)} q_f(\mathtt{i}|_k) \cdot f \mu \end{align*} $$
whenever
$t> 0$
is such that
$B(\pi (\mathtt {i}), e^{-t}) \subseteq B_{\mathtt {i}|_k}$
.
Proof An elementary calculation shows that
Since we suppose that
$B(\pi (\mathtt {i}), e^{-t}) \subseteq B_{\mathtt {i}|_k}$
, using self-similarity, (3.3) and the additivity of the action induced by
$S^*$
, we can write
$$ \begin{align*} \mu_{\mathtt{i}, t} &= S_{t+k\log \rho}^* S_{k \log \rho^{-1}} T_{\mathtt{i}} \sum_{\mathtt{a} \in \Gamma^k,\ K_{\mathtt{a}} \cap B_{\mathtt{i}|_k} \neq \emptyset} p_{\mathtt{a}} \cdot \varphi_{\mathtt{a}} \mu\\ &= S^*_{t+ k\log\rho} T_{\sigma^k \mathtt{i}} \sum_{\mathtt{a} \in \Gamma^k,\ K_{\mathtt{a}} \cap B_{\mathtt{i}|_k} \neq \emptyset} p_{\mathtt{a}} \cdot (\varphi_{\mathtt{i}|_k}^{-1} \circ \varphi_{\mathtt{a}}) \mu, \end{align*} $$
and using the definition of
$\mathcal {N}(\mathtt {i}|_k)$
, the sum in this representation can be reordered as
$$ \begin{align*}\sum_{f \in \mathcal{N}(\mathtt{i}|_k)} \bigg( \sum_{\mathtt{a} \in \Gamma^k,\ \varphi_{\mathtt{i}|_k}^{-1} \circ\varphi_{\mathtt{a}} = f} p_{\mathtt{a}} \bigg) \cdot f \mu. \end{align*} $$
Normalizing gives the statement.
Motivated by the recurrence of
$\mathcal {N}_0$
in
$(\mathcal {N}(\mathtt {i}|_k))_{k \in \mathbb N}$
and the prescribed representation for the scenery measures, we define the measure
$$ \begin{align} \nu = \sum_{f \in \mathcal{N}_0} f \mu. \end{align} $$
This is the recurring ‘frame’ to which we compare the scenery measures. Indeed, for those k for which
$\mathcal {N}(\mathtt {i}|_k) = \mathcal {N}_0$
, Lemma 3.2 tells us that
$\mu _{\mathtt {i}, t} \ll \nu _{\sigma ^k \mathtt {i}, t+k\log \rho }$
with density
$\zeta = \zeta (\mathtt {i}|_k)$
determined by the weights
$q_f(\mathtt {i}|_k)$
. While the exact form of the density depends on the entirety of
$\mathtt {i}|_k$
, the content of the following proposition is that much less information on
$\mathtt {i}|_k$
is required to control
$\zeta (\mathtt {i}|_k)$
at a sufficient level.
Proposition 3.3. There exist a finite word
$\mathtt {b}_0 \in \Gamma ^*$
and a family of
$\nu $
-integrable functions
$\lbrace \zeta _h: h \in \mathcal {F} \subseteq \mathcal {N}_0\rbrace $
, each bounded from below by a constant
$C_h> 0$
, such that for almost every
$\mathtt {i} \in \Gamma ^{\mathbb N}$
and all
$k \in \mathbb N$
for which
$\sigma ^{k-|\mathtt {a}_0 \mathtt {b}_0|} \mathtt {i} \in [\mathtt {a}_0 \mathtt {b}_0]$
, there exists a function
$\zeta = \zeta (\mathtt {i}|_k)$
which is a convex combination of the functions
$\zeta _h$
such that
for any
$t> 0$
satisfying
$B(\pi (\mathtt {i}), e^{-t}) \subseteq B_{\mathtt {i}|_{k}}$
.
The proof requires some geometric work and can be found in §4.
We write
for the countable collection of all functions given by Proposition 3.3. Note that as a bounded subset of the linear span of a finite family of functions, the closure of
$\mathcal {W}$
is compact in the topology induced by the supremum norm. Combining this compactness with an application of the Lebesgue–Besicovitch differentiation theorem and some elementary continuity properties of
$\zeta \mapsto (\zeta d\nu )_{\mathtt {i}, t}$
we can deduce the following proposition.
Proposition 3.4. For all
$\varepsilon> 0$
, there exist a set
$\mathcal {J} = \mathcal {J}(\varepsilon ) \subseteq \Gamma ^{\mathbb N}$
and an integer
$N = N(\varepsilon )$
such that
$\bar {\mu }(\mathcal {J})> 0$
and, for any
$\zeta \in \mathcal {W}$
and every
$\mathtt {i} \in \mathcal {J}$
,
$$ \begin{align} d \bigg( \frac{1}{T} \int_0^{T} \delta[\mu_{\mathtt{i},t}]\,dt,\ \frac{1}{T} \int_0^{T} \delta[(\zeta d\nu)_{\mathtt{i},t}] \,dt \bigg) < \varepsilon \end{align} $$
for all
$T \geq N$
.
The proof can be found in §4.
These propositions together give us a way to approximate the statistics of
$(\mu _{\mathtt {i}, t})_{t \geq 0}$
using only the statistics of the recurrence of
$(\sigma ^k \mathtt {i})_{k \in \mathbb N}$
in
$[\mathtt {a}_0 \mathtt {b}_0]$
.
3.1. The sequence
$(r_n)_n$
Let
$\varepsilon> 0$
. We now move on to defining the distribution of the random sequence
$(r_n)_{n \in \mathbb N} $
; recall (3.2) and the discussion thereafter. Let
$\mathtt {b}_0$
be the finite word given by Proposition 3.3, and let
$\mathcal {J} = \mathcal {J}(\varepsilon )$
be the set given by Proposition 3.4. Since everything we define in the following depends on the set
$\mathcal {J}$
and hence on
$\varepsilon $
, we suppress this dependence from our notation.
We will first define, for almost every
$\mathtt {i} \in \Gamma ^{\mathbb N}$
, a sequence
$(t_n)_{n \in \mathbb N} \subseteq \mathbb N$
such that for every n,
-
(i)
$\sigma ^{t_n} \mathtt {i} \in \mathcal {J}$
and -
(ii)
$\sigma ^{t_n - |\mathtt {a}_0 \mathtt {b}_0|} \mathtt {i} \in [\mathtt {a}_0 \mathtt {b}_0]$
.
In particular, the sequence
$(\sigma ^{t_n} \mathtt {i})_n$
must also include some information on the ‘past’ of each element. One way to deal with this is to consider the two-sided extension of the space
$\Gamma ^{\mathbb N}$
. Since there is a natural bijection between the spaces of invariant measures on
$\Gamma ^{\mathbb N}$
and
$\Gamma ^{\mathbb Z}$
, it is convenient to denote the extended Bernoulli measure on
$\Gamma ^{\mathbb Z}$
also by
$\bar {\mu }$
. Since the natural projection
$\pi $
extends to
$\Gamma ^{\mathbb Z}$
by
$\mathtt {i} \mapsto \pi (\mathtt {i}^+)$
, where
$(\cdot )^+$
denotes the projection to the positive coordinates, and both the Bernoulli measure and the extended one project onto the self-similar measure
$\mu $
, we do not usually make a distinction between one-sided and two-sided infinite words.
We let
and define the sequence
$(t_n)_{n \in \mathbb N}$
as the return times of
$\mathtt {i}$
to the set
$\mathcal {J}'$
: write
for the time of first visit in
$\mathcal {J}'$
, defined
$\bar {\mu }$
-almost everywhere, and set
$$ \begin{align*} t_0 &= 0, \\ t_n(\mathtt{i}) &= t_{n-1}(\mathtt{i}) + \tau(\sigma^{t_{n-1}} \mathtt{i})\quad \text{for}\ n \geq 1. \end{align*} $$
Note that
$\bar {\mu }(\mathcal {J}')> 0$
. We also point out the following lemma.
Lemma 3.5. The function
$\tau $
is
$\bar {\mu }$
-integrable over
$\mathcal {J}'$
.
Proof Since
$\bar {\mu }$
is ergodic, this is implied by Kac’s theorem [Reference Kac20, Theorem 2].
Finally, define
$$ \begin{align*} r_n(\mathtt{i}) &= \inf \lbrace r\geq 0: B(\pi(\mathtt{i}), e^{-r}) \subseteq B_{\mathtt{i}|_{t_{n}(\mathtt{i})} } \rbrace \\ &= t_n(\mathtt{i}) \log \rho^{-1} + \alpha_0(\sigma^{t_n(\mathtt{i})} \mathtt{i}). \end{align*} $$
Here
is the correction that arises because the natural projections of
$\mathtt {j} \in \Gamma ^{\mathbb N}$
are not necessarily in the ‘centre’ of
$B(0,1)$
. Since we suppose that K is strictly included in
$B(0,1)$
, for a large enough integer M, we have
$\alpha _0(\mathtt {j}) \in [0, M]$
for all
$\mathtt {j}\in \Gamma ^{\mathbb N}$
.
Let N be the integer given by Proposition 3.4. Note that since we have
$$ \begin{align*} r_{n+1}(\mathtt{i})-r_n(\mathtt{i}) &= (t_{n+1}(\mathtt{i}) - t_{n}(\mathtt{i})) \log \rho^{-1} + \alpha_0(\sigma^{t_{n+1}} \mathtt{i}) - \alpha_0(\sigma^{t_n} \mathtt{i}) \\ &\geq \log \rho^{-1} - M, \end{align*} $$
by replacing the alphabet
$\Gamma $
with a high-level iteration
$\Gamma ^{\lceil (M+N)/\log \rho ^{-1}\rceil }$
we can suppose that the difference
$r_{n+1}(\mathtt {i}) - r_n(\mathtt {i}) \geq N$
for almost every
$\mathtt {i} \in \mathcal {J}'$
. We will later see that this sequence satisfies condition (3.1).
We are now ready to prove Theorem 3.1.
3.2. Proof of Theorem 3.1
In the proof, we require the following application of Birkhoff’s ergodic theorem. We postpone its short proof to the end of the section.
Claim 3.6. For any
$\bar {\mu }$
-integrable (distribution- or real-valued) g and almost every
$\mathtt {i}$
,
$$ \begin{align*}\lim_{n \rightarrow \infty} \frac{1}{n} \sum_{k=0}^{n-1} g(\sigma^{t_k} \mathtt{i}) = \int g \,d\bar{\mu}_{\mathcal{J}'}. \end{align*} $$
Define the functions
$\psi , \eta $
for
$\bar {\mu }$
-almost every
$\mathtt {j}$
by
$$ \begin{align} &\psi: \mathtt{j} \mapsto \int_{\alpha_0(\mathtt{j})}^{\tau(\mathtt{j}) \log \rho^{-1} + \alpha_0(\sigma^{\tau(\mathtt{j})}\mathtt{j})} \delta[\mu_{\mathtt{j}, t}]\,dt, \nonumber\\ &\eta: \mathtt{j} \mapsto \tau(\mathtt{j})\log \rho^{-1} + \alpha_0(\sigma^{\tau(\mathtt{j})}\mathtt{j}) - \alpha_0(\mathtt{j}). \end{align} $$
The measurability of these functions is standard, and integrability over
$\mathcal {J}'$
follows from that of
$\tau $
(Lemma 3.5) and the assumption
$\alpha _0(\mathcal {J}) \subseteq [0,M]$
.
Proof Proof of Theorem 3.1
Now let
$\mathtt {i}\in \bigcup _{n=0}^\infty \sigma ^{-n} \mathcal {J}'$
be such that Claim 3.6 holds for the functions
$\psi $
and
$\eta $
. The set of these words has full
$\bar {\mu }$
-measure. Since the scale at which we start the zoom-in process has no effect on the generated distribution, we may suppose that
$\mathtt {i} \in \mathcal {J}'$
. To make the notation clearer, from now on we suppress the dependence of
$r_k$
and
$t_k$
on
$\mathtt {i}$
. Recall that the set
$\mathcal {J}'$
was defined so that whenever
$\mathtt {i} \in \mathcal {J}'$
, we have
$\mathtt {i}^+ \in \mathcal {J}$
and
$(\sigma ^{-|\mathtt {a}_0 \mathtt {b}_0|} \mathtt {i})^+ \in [\mathtt {a}_0 \mathtt {b}_0]$
.
We can now write sequence (3.2) as
$$ \begin{align} \frac{1}{r_n} \int_{0}^{r_n} \delta[\mu_{\mathtt{i},t}]\,dt &= \frac{1}{r_n} \sum_{k=0}^{n-1} \int_{r_{k}}^{r_{k+1}} \delta[\mu_{\mathtt{i},t}]\,dt\nonumber\\ &= \frac{1}{r_n}\sum_{k=0}^{n-1} \int_{t_k \log \rho^{-1} + \alpha_0(\sigma^{t_k}\mathtt{i})}^{t_{k+1} \log \rho^{-1}+ \alpha_0 (\sigma^{t_{k+1}} \mathtt{i})} \delta[(\zeta(\mathtt{i}|_k)\,d\nu)_{\sigma^{t_k} \mathtt{i}, t+t_k\log \rho}]\,dt\nonumber\\ &= \frac{1}{r_n} \sum_{k=0}^{n-1}\int_{\alpha_0(\sigma^{t_k} \mathtt{i})}^{\tau(\sigma^{t_k} \mathtt{i}) \log \rho^{-1} + \alpha_0(\sigma^{t_{k+1}} \mathtt{i})} \delta[(\zeta(\mathtt{i}|_k)\,d\nu)_{\sigma^{t_k} \mathtt{i}, t}]\,dt, \end{align} $$
using Proposition 3.3 and writing out the definitions of
$r_k$
in the second equality, and performing a change of variable
$t \mapsto t - t_k \log \rho $
in the last one. Combining this with Proposition 3.4, we get that
$$ \begin{align} d \bigg( \frac{1}{r_n} \int_{0}^{r_n} \delta[\mu_{\mathtt{i},t}]\,dt,\ \frac{1}{r_n} \sum_{k=0}^{n-1}\int_{\alpha_0(\sigma^{t_k} \mathtt{i})}^{\tau(\sigma^{t_k} \mathtt{i}) \log \rho^{-1} + \alpha_0(\sigma^{t_{k+1}} \mathtt{i})} \delta[\mu_{\sigma^{t_k} \mathtt{i}, t}]\,dt\bigg) < \varepsilon \end{align} $$
for all large enough n. Write
$$ \begin{align*}Q_n := \frac{1}{r_n} \sum_{k=0}^{n-1}\int_{\alpha_0(\sigma^{t_k} \mathtt{i})}^{\tau(\sigma^{t_k} \mathtt{i}) \log \rho^{-1} + \alpha_0(\sigma^{t_{k+1}} \mathtt{i})} \delta[\mu_{\sigma^{t_k} \mathtt{i}, t}]\,dt. \end{align*} $$
Using the functions
$\psi $
and
$\eta $
defined in (3.6), we have for
$Q_n$
the representation
$$ \begin{align*} Q_n &= \frac{1}{\sum_{k=0}^{n-1} (r_{k+1} - r_k)} \sum_{k=0}^{n-1} \psi(\sigma^{t_k} \mathtt{i}) = \bigg(\frac{1}{({1}/{n})\sum_{k=0}^{n-1} \eta(\sigma^{t_k} \mathtt{i})}\bigg) \bigg(\frac{1}{n}\sum_{k=0}^{n-1} \psi(\sigma^{t_k} \mathtt{i})\bigg). \end{align*} $$
It follows from Claim 3.6 that the sequence
$(Q_n)_{n \in \mathbb N}$
converges to a limiting distribution
$P_\varepsilon $
as
$n\rightarrow \infty $
. Combining this with (3.8), it follows that there exists an integer
$n_\varepsilon $
such that
$$ \begin{align*} d \bigg( \frac{1}{r_n} \int_{0}^{r_n} \delta[\mu_{\mathtt{i},t}]\,dt,\ P_\varepsilon\bigg) < 2\varepsilon\quad \text{for all}\ n \geq n_\varepsilon. \end{align*} $$
Since Claim 3.6 applied for
$\eta $
shows that
$$ \begin{align*}\lim_{n \rightarrow \infty} \frac{r_n}{n} = \lim_{n \rightarrow \infty} \frac{1}{n} \sum_{k=0}^{n-1} \eta(\sigma^{t_k} \mathtt{i}) = \int \eta \,d\bar{\mu}_{\mathcal{J}'} \in (0, +\infty), \end{align*} $$
it follows that the sequence
$$ \begin{align*}\bigg( \frac{1}{r_n} \int_{0}^{r_n} \delta[\mu_{\mathtt{i},t}]\,dt \bigg)_{n \in \mathbb N} \end{align*} $$
is asymptotic to the scenery flow of
$\mu $
at
$\pi (\mathtt {i})$
.
We have now found, for every
$\varepsilon> 0$
, a distribution
$P_{\varepsilon }$
and an integer
$T_\varepsilon $
such that for almost every
$\mathtt {i}$
,
$$ \begin{align} d \bigg( \frac{1}{T} \int_0^T \delta[\mu_{\mathtt{i}, t}] \,dt, P_{\varepsilon} \bigg) < 2\varepsilon\quad \text{for all}\ T \geq T_\varepsilon. \end{align} $$
Letting
$\varepsilon \rightarrow 0$
along a countable sequence and taking the intersection of the sets of full
$\bar {\mu }$
-measure in which (3.9) holds, we obtain a set of full measure in which (3.9) holds for every
$\varepsilon $
. Using the compactness of
$\mathcal {P}(\mathcal {P}(B(0,1)))$
, it follows that the scenery flow of
$\mu $
converges almost everywhere. Moreover, since the distributions
$P_\varepsilon $
are independent of
$\mathtt {i}$
, so is the limit of the scenery flow. This concludes the proof of Theorem 3.1.
Proof Proof of Claim 3.6
Note first that the claim is equivalent to
$$ \begin{align} \lim_{n \rightarrow \infty} \frac{1}{\bar{\mu}(\mathcal{J}')n} \sum_{k=0}^{\lfloor \bar{\mu}(\mathcal{J}')n \rfloor} g(\sigma^{t_k} \mathtt{i}) = \int g \,d\bar{\mu}_{\mathcal{J}'}. \end{align} $$
Using Birkhoff’s ergodic theorem for
$\sigma $
and
$\chi [\mathcal {J}']$
in the form
we see that the sequence on the left-hand side of (3.10) is asymptotic to the sequence
$$ \begin{align*}\frac{1}{\bar{\mu}(\mathcal{J}')n} \sum_{k=0}^{\#\lbrace 0 \leq \ell \leq n-1: \sigma^\ell \mathtt{i} \in \mathcal{J}' \rbrace}g(\sigma^{t_k} \mathtt{i}). \end{align*} $$
Now, using the fact that
$\sigma ^\ell \mathtt {i} \in \mathcal {J}'$
if and only if
$\ell = t_k$
for some k, which follows from the definition of
$(t_k)_k$
as the return times to the set
$\mathcal {J}'$
, we can write
$$ \begin{align*}\frac{1}{\bar{\mu}(\mathcal{J}')n} \sum_{k=0}^{\#\lbrace 0 \leq \ell \leq n-1: \sigma^\ell \mathtt{i} \in \mathcal{J}' \rbrace}g(\sigma^{t_k} \mathtt{i}) = \frac{1}{\bar{\mu}(\mathcal{J}')}\frac{1}{n} \sum_{\ell=0}^{n-1} \chi[\mathcal{J}'](\sigma^\ell \mathtt{i}) g(\sigma^\ell \mathtt{i}). \end{align*} $$
Finally, using Birkhoff’s ergodic theorem for
$\chi [\mathcal {J}'] g$
and
$\sigma $
, we obtain (3.10).
3.3. On the proof of Theorem 1.1
In the proof of Theorem 3.1 it was assumed that the IFS
$\Phi $
consists of equicontractive homotheties. Only minor modifications in the proof are required in order to dispose of this requirement. We provide an overview of the modifications needed; details are left to the interested reader. For now, suppose that
$\Psi = \lbrace \varphi _i(x) = \rho _i R_i x + a_i \rbrace _{i \in \Gamma }$
is a self-similar IFS satisfying the weak separation condition and
$\mu $
is an associated self-similar measure.
In Proposition 3.3, to obtain the stated identity we need to replace the measure
$(\zeta d\nu )_{\sigma ^k, t+k\log \rho }$
by
$(R_{\mathtt {i}|_k}(\zeta d \nu ))_{\sigma ^k \mathtt {i}, t + \log \rho _{\mathtt {i}|_k}}$
, where
$R_{\mathtt {i}|_k}$
is the matrix component of
$\varphi _{\mathtt {i}|_k}$
. The statement of Proposition 3.4 extends as it is for distributions generated by
$R\nu $
and
$R (\zeta d\nu )$
, for any orthogonal matrix R.
In the ergodic-theoretic part of §3.2, one must take into account the additional dynamics coming from the matrix components of the similarities. Instead of the system
$(\Gamma ^{\mathbb N}, \bar {\mu }, \sigma )$
, we need to consider the skew-product
$(\Gamma ^{\mathbb N} \times G, \bar {\mu } \times \gamma , F)$
, where G is the closure of the topological group generated by the matrix components of
$\varphi _i$
,
$\gamma $
is the right-invariant Haar measure on G and F is the transformation
$(\mathtt {i}, R) \mapsto (\sigma \mathtt {i}, R \cdot R_{\mathtt {i}|_1})$
. The ergodicity of this kind of skew-product system is due to Kakutani [Reference Kakutani and Neyman22]. Going through §3 with these modifications, one sees that for
$\gamma $
-almost every R, the measure
$R \mu $
is uniformly scaling. This property is clearly preserved under action by
$R^{-1}$
.
The fact that
$\mu $
generates an ergodic fractal distribution is immediate from the results of Hochman [Reference Hochman15]. Since some additional terminology needs to be introduced before the short deduction, we postpone it to §5 in order not to disrupt the main line of argument behind the uniform scaling property.
4. The scenery of the self-similar measure
In this section we prove Propositions 3.3 and 3.4. Although the proofs are written in the setting of Theorem 3.1 for the sake of notational simplicity, after modifying the statements of the propositions according to the highlights in §3.3, the arguments extend with little work to the setting of Theorem 1.1.
We adopt the notation
for every
$\mathtt {a} \in \Gamma ^*$
, for the ‘symbolic magnifications’ of the self-similar measure.
4.1. Proof of Proposition 3.3
Recall Lemma 3.2 and that our motivation is to find a way to describe the probability vector
$(q_f(\mathtt {i}|_k))_{f \in \mathcal {N}(\mathtt {i}|_k)}$
without requiring information on the entirety of the word
$\mathtt {i}|_k$
. Recall also the choice of the word
$\mathtt {a}_0$
from (2.3) and the definition of the maximal neighbourhood
$\mathcal {N}_0$
from (2.4). Through the work in this subsection, we will find a finite word
$\mathtt {b}_0$
such that for any
$\mathtt {c} \in \Gamma ^*$
,
$\mathcal {N}(\mathtt {c} \mathtt {a}_0 \mathtt {b}_0) = \mathcal {N}_0$
and the weights
$q_f(\mathtt {c} \mathtt {a}_0 \mathtt {b}_0)$
,
$f \in \mathcal {N}_0$
, are bounded from below by a constant independent of
$\mathtt {c}$
.
The key geometric observation in the proof is the following claim which provides us with the word
$\mathtt {b}_0$
.
Claim 4.1. There exist a finite word
$\mathtt {b}_0$
and a collection
$\mathcal {F} \subseteq \mathcal {N}_0$
such that
$\mathcal {N}(\mathtt {b}_0) = \mathcal {N}_0$
and,
-
(i) for every
$h \in \mathcal {F}$
, every neighbour of
$K_{\mathtt {b}_0}$
is a descendant of
$h(K)$
, that is, there exists a word
$\mathtt {b}_h \in \Gamma ^*$
such that
$h \circ \varphi _{\mathtt {b}_h} = \varphi _{\mathtt {b}_0}$
and
$\mathcal {N}(\mathtt {b}_h) = \mathcal {N}_0$
, and -
(ii) for every
$h \in \mathcal {N}_0 \setminus \mathcal {F}$
,
$B_{\mathtt {b}_0} \cap h(K) = \emptyset $
.
Proof In the case where
$K_{\mathtt {a}_0} \cap h(K) = \emptyset $
for every
$h \in \mathcal {N}_0 \setminus \lbrace {\textrm {Id}} \rbrace $
the claim is close to trivial: set
$\mathcal {F} = \lbrace {\textrm {Id}} \rbrace $
and choose
$\mathtt {b}_0 \in \Gamma ^*$
in such a way that
$B_{\mathtt {b}_0} \cap \bigcup _{h \in \mathcal {N}_0 \setminus \mathcal {F}} h(K) = \emptyset $
, as we may since the union is closed.
Suppose then that
$K_{\mathtt {a}_0} \cap h_1(K) \neq \emptyset $
for some
$h_1 \in \mathcal {N}_0 \setminus \lbrace {\textrm {Id}} \rbrace $
. The set
$\mathcal {F}$
and the word
$\mathtt {b}_0$
are now found through the following recursive construction. First, we claim that a descendant of
$h_1(K)$
overlaps exactly with a descendant of K.
Claim 4.2. There exist finite words
$\mathtt {b}, \mathtt {c} \in \Gamma ^*$
such that
Proof Proof of Claim 4.2
Since we assume
$K_{\mathtt {a}_0} \cap h_1(K) \neq \emptyset $
, there exists
$\mathtt {c} \in \Gamma ^{|\mathtt {a}_0|}$
such that
$h_1(K_{\mathtt {c}}) \cap K_{\mathtt {a}_0} \neq \emptyset $
. Because
$h_1 \in \mathcal {N}_0 = \mathcal {N}(\mathtt {a}_0)$
, by definition of
$\mathcal {N}$
there exists
$\mathtt {a} \in \Gamma ^{|\mathtt {a}_0|}$
such that
$h_1 = \varphi _{\mathtt {a}_0}^{-1} \circ \varphi _{ \mathtt {a}}$
, so we have
Mapping both sets by
$\varphi _{\mathtt {a}_0}$
, we can use Lemma 2.3 to deduce that
$\varphi _{\mathtt {a}\mathtt {c}} \in \varphi _{\mathtt {a}_0 \mathtt {a}_0} \mathcal {N}_0$
, or equivalently,
$h_1 \circ \varphi _{\mathtt {c}} \in \varphi _{\mathtt {a}_0}\mathcal {N}_0$
.
Since
$\mathcal {N}_0$
consists of functions of the form
$\varphi _{\mathtt {a}_0}^{-1} \circ \varphi _{\mathtt {b}}$
for
$\mathtt {b} \in \Gamma ^{|\mathtt {a}_0|}$
, there exists
$\mathtt {b}$
such that
$h_1 \circ \varphi _{\mathtt {c}} = \varphi _{\mathtt {a}_0} \circ \varphi _{\mathtt {a}_0}^{-1} \circ \varphi _{\mathtt {b}} = \varphi _{\mathtt {b}}$
. The claim is satisfied by the words
$\mathtt {b}$
and
$\mathtt {c}$
.
Write
$\mathtt {b}_1 := \mathtt {b}$
and
$\mathtt {c}_{1,1} := \mathtt {c}$
for the words
$\mathtt {b}$
and
$\mathtt {c}$
given by Claim 4.2.
Suppose now that for an integer
$n \geq 1$
and every
$1 \leq k \leq n$
we have found functions
$h_k$
and words
$\mathtt {b}_n, \mathtt {c}_{n,k}$
such that
$\varphi _{\mathtt {b}_n} = h_{k} \circ \varphi _{\mathtt {c}_{n,k}}$
for every k. Now, if there exists a function
$h_{n+1} \in \mathcal {N}_0 \setminus \lbrace {\textrm {Id}}, h_1, \ldots , h_n \rbrace $
for which
$K_{\mathtt {b}_n\mathtt {a}_0} \cap h_{n+1}(K) \neq \emptyset $
, proceed as in the proof of Claim 4.2 with
$\mathtt {a}_0$
replaced by
$\mathtt {b}_n \mathtt {a}_0$
to find words
$\mathtt {b}, \mathtt {c}$
such that
$\varphi _{\mathtt {b}_n \mathtt {b}} = h_{n+1} \circ \varphi _{\mathtt {c}} = h_k \circ \varphi _{\mathtt {c}_{n,k} \mathtt {b}}$
for every
$1 \leq k \leq n$
; the latter equality follows from the hypothesis on
$\mathtt {b}_n$
and
$\mathtt {c}_{n, k}$
. Set
$\mathtt {b}_{n+1} := \mathtt {b}_n \mathtt {b}$
,
$\mathtt {c}_{n+1, n+1} := \mathtt {c}$
and
$\mathtt {c}_{n+1, k} := \mathtt {c}_{n, k} \mathtt {b}$
for each
$1 \leq k \leq n$
.
Continue this process until we have reached an integer
$n < \# \mathcal {N}_0$
for which either
$\mathcal {N}_0 = \lbrace {\textrm {Id}}, h_1, \ldots , h_n \rbrace $
or
$K_{\mathtt {b}_n\mathtt {a}_0} \cap h(K) = \emptyset $
for each
$h \in \mathcal {N}_0 \setminus \lbrace {\textrm {Id}}, h_1, \ldots , h_n \rbrace $
. Write
$\mathcal {F} = \lbrace {\textrm {Id}}, h_1, \ldots , h_n \rbrace $
and note that by construction of
$\mathcal {F}$
, for every
$h \in \mathcal {F}$
there exists
$\mathtt {b}_h' \in \Gamma ^*$
such that
$\varphi _{\mathtt {b}_n} = h \circ \varphi _{\mathtt {b}_h'}$
. By passing onto a descendant of
$\mathtt {b}_n$
we may assume that
$B_{\mathtt {b}_n} \cap \bigcup _{h \in \mathcal {N}_0 \setminus \mathcal {F}} h(K)=\emptyset $
since the union is closed. Finally, set
$\mathtt {b}_0 = \mathtt {b}_n \mathtt {a}_0$
and
$\mathtt {b}_h = \mathtt {b}_h' \mathtt {a}_0$
for each
$h \in \mathcal {F}$
to obtain the claim.
Proof Proof of Proposition 3.3
We first consider the claimed representation for symbolic magnifications of
$\mu $
. Using self-similarity, we first write
$$ \begin{align*}(\varphi_{\mathtt{i}|_k}^{-1}\mu)|_{B(0,1)} = \varphi_{\mathtt{i}|_k}^{-1} \sum_{\mathtt{a} \in \Gamma^k,\ K_{\mathtt{a}} \cap B_{\mathtt{i}|_k} \neq \emptyset} p_{\mathtt{a}} \cdot (\varphi_{\mathtt{a}} \mu)|_{B(0,1)}. \end{align*} $$
Using the equality
$\lbrace \varphi _{\mathtt {a}}: \mathtt {a} \in \Gamma ^k,\ K_{\mathtt {a}} \cap B_{\mathtt {i}|_k} \rbrace = \varphi _{\mathtt {i}|_k} \mathcal {N}_0$
which is Lemma 2.3, we can write the above measure as
$$ \begin{align} \sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{a} \in \Gamma^k,\ \varphi_{\mathtt{a}} = \varphi_{\mathtt{i}|_k} \circ f} p_{\mathtt{a}} \bigg)\cdot (f \mu)|_{B(0,1)}. \end{align} $$
Recall that k is such that
$\sigma ^{k-|\mathtt {a}_0 \mathtt {b}_0|} \mathtt {i} \in [\mathtt {a}_0 \mathtt {b}_0]$
. Writing
$k' = k - |\mathtt {b}_0|$
, we further reorder the above sum using the following claim. It is a simple consequence of Claim 4.1 and says that each neighbour of
$K_{\mathtt {i}|_k}$
is a descendant of
$\varphi _{\mathtt {i}|_{k'}} \circ h(K)$
if and only if
$h \in \mathcal {F}$
.
Claim 4.3. For each
$f \in \mathcal {N}_0$
, we may write
where the union is disjoint. In particular, note that
$\mathtt {b}$
and
$\mathtt {c}$
can be chosen independently of each other.
Proof Proof of Claim 4.3
First we observe that
$\varphi _{\mathtt {i}|_k} \circ f(K)$
coincides with a descendant of
$K_{\mathtt {i}|_{k'}}$
. Indeed, because
$\mathtt {i}|_k = \mathtt {i}|_{k'} \mathtt {b}_0$
, this is equivalent to
$\varphi _{\mathtt {b}_0} \circ f(K)$
coinciding with a descendant of K, which in turn follows by Lemma 2.3 because
$f \in \mathcal {N}_0 = \mathcal {N}(\mathtt {b}_0)$
. From this we can deduce that, in particular, any ancestor of
$\varphi _{\mathtt {i}|_k} \circ f(K)$
must intersect
$B_{\mathtt {i}|_{k'}}$
. Using this and the fact that
$\varphi _i$
are similarities, we may write
$$ \begin{align*} \lbrace \mathtt{a}: \varphi_{\mathtt{a}} = \varphi_{\mathtt{i}|_k}\circ f \rbrace &= \lbrace (\mathtt{b}, \mathtt{c}) \in \Gamma^{k'} \times \Gamma^{|\mathtt{b}_0|}: K_{\mathtt{b} \mathtt{c}} = \varphi_{\mathtt{i}|_k} \circ f(K)\rbrace \\ &=\lbrace (\mathtt{b}, \mathtt{c}) \in \Gamma^{k'} \times \Gamma^{|\mathtt{b}_0|}: K_{\mathtt{b}} \cap B_{\mathtt{i}|_{k'}} \neq \emptyset,\ K_{\mathtt{b} \mathtt{c}} = \varphi_{\mathtt{i}|_k} \circ f(K) \rbrace. \end{align*} $$
On the other hand, because
$\mathcal {N}(\mathtt {i}|_{k'})=\mathcal {N}_0$
, each neighbour of
$K_{\mathtt {i}|_{k'}}$
coincides with
$\varphi _{\mathtt {i}|_{k'}} \circ h(K)$
for some
$h \in \mathcal {N}_0$
, by Lemma 2.3. Finally, by the properties of
$\mathtt {b}_0$
given by Claim 4.1, as a neighbour of
$K_{\mathtt {i}|_k}$
the set
$\varphi _{\mathtt {i}|_{k}}\circ f(K)$
coincides with a descendant of
$\varphi _{\mathtt {i}|_{k'}} \circ h(K)$
for each
$h \in \mathcal {F}$
, and for
$h \not \in \mathcal {F}$
,
Thus, we may write
$$ \begin{align*} &\lbrace (\mathtt{b}, \mathtt{c}) \in \Gamma^{k'} \times \Gamma^{|\mathtt{b}_0|}: K_{\mathtt{b}} \cap B_{\mathtt{i}|_{k'}} \neq \emptyset,\ K_{\mathtt{b} \mathtt{c}} = \varphi_{\mathtt{i}|_k} \circ f(K) \rbrace \\ &\quad\ =\ \bigcup_{h \in \mathcal{F}} \lbrace (\mathtt{b}, \mathtt{c}) \in \Gamma^{k'} \times \Gamma^{|\mathtt{b}_0|}: K_{\mathtt{b}} = \varphi_{\mathtt{i}|_{k'}} \circ h(K),\ \varphi_{\mathtt{i}|_{k'}} \circ h \circ \varphi_{\mathtt{c}}(K) = \varphi_{\mathtt{i}|_k} \circ f(K) \rbrace. \end{align*} $$
Using the fact that
$\varphi _i$
are similarities, the above can again be written as
$$ \begin{align*} &\bigcup_{h \in \mathcal{F}} \lbrace \mathtt{b} \mathtt{c}\in \Gamma^*: \varphi_{\mathtt{b}} = \varphi_{\mathtt{i}|_{k'}} \circ h,\ \varphi_{\mathtt{i}|_{k'}} \circ h \circ \varphi_{\mathtt{c}} = \varphi_{\mathtt{i}|_{k'} \mathtt{b}_0} \circ f \rbrace \\ &\quad\ =\bigcup_{h \in \mathcal{F}} \lbrace \mathtt{b} \mathtt{c}\in \Gamma^*: \varphi_{\mathtt{b}} = \varphi_{\mathtt{i}|_{k'}} \circ h,\ h \circ \varphi_{\mathtt{c}} = \varphi_{\mathtt{b}_0} \circ f \rbrace, \end{align*} $$
which is what was claimed.
Using Claim 4.3, we write the sum (4.2) as
$$ \begin{align} &\sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{a} \in \Gamma^k,\ \varphi_{\mathtt{a}} = \varphi_{\mathtt{i}|_k}\circ f} p_{\mathtt{a}} \bigg) \cdot (f \mu)|_{B(0,1)}\nonumber\\ &\quad=\sum_{h \in \mathcal{F}} \sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{b} \mathtt{c} \in \Gamma^*,\ \varphi_{\mathtt{b}} = h\circ\varphi_{\mathtt{i}|_{k'}},\ h\circ\varphi_{\mathtt{c}} = \varphi_{\mathtt{b}_0}\circ f} p_{\mathtt{b}\mathtt{c}} \bigg) \cdot (f \mu)|_{B(0,1)}\nonumber\\ &\quad=\sum_{h \in \mathcal{F}} \tilde{q}_h(\mathtt{i}|_k)\sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{c} \in \Gamma^*,\ h\circ\varphi_{\mathtt{c}} = h \circ \varphi_{\mathtt{b}_h}\circ f} p_{\mathtt{c}} \bigg) \cdot( f \mu)|_{B(0,1)}\nonumber \\ &\quad=\sum_{h \in \mathcal{F}} \tilde{q}_h(\mathtt{i}|_k) \sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{c} \in \Gamma^*,\ \varphi_{\mathtt{c}} = \varphi_{\mathtt{b}_h}\circ f} p_{\mathtt{c}} \bigg) \cdot (f \mu)|_{B(0,1)} \end{align} $$
where
$$ \begin{align*}\tilde{q}_h(\mathtt{i}|_k) = \sum_{\mathtt{b} \in \Gamma^{k'},\ \varphi_{\mathtt{b}} = h \circ\varphi_{\mathtt{i}|_{k'}}} p_{\mathtt{b}}. \end{align*} $$
In the third row, we have summed over
$\mathtt {b} \in \Gamma ^{k'}$
for every fixed
$\mathtt {c}$
and used the equality
$\varphi _{\mathtt {b}_0} = h \circ \varphi _{\mathtt {b}_h}$
for every
$h \in \mathcal {F}$
, given by Claim 4.1.
Define now the functions
$$ \begin{align*}\zeta_h = \sum_{f \in \mathcal{N}_0} \bigg( \sum_{\mathtt{c} \in \Gamma^*,\ \varphi_{\mathtt{c}} = \varphi_{\mathtt{b}_h}\circ f} p_{\mathtt{c}} \bigg) \cdot \frac{d (f\mu)|_{B(0,1)}}{d\nu} \end{align*} $$
for
$h \in \mathcal {F}$
, where the last expression denotes the Radon–Nikodym derivative of
$(f\mu )|_{B(0,1)}$
with respect to
$\nu $
. Because
$\mathcal {N}(\mathtt {b}_h) = \mathcal {N}_0$
, for every
$h \in \mathcal {F}$
we have
$$ \begin{align*}\zeta_h(x) \geq C_h := \min_{f \in \mathcal{N}_0} \sum_{\mathtt{c} \in \Gamma^*,\ \varphi_{\mathtt{c}} = \varphi_{\mathtt{b}_h}\circ f} p_{\mathtt{c}}>0 \end{align*} $$
for
$\nu $
-almost every
$x \in \bigcup _{f \in \mathcal {N}_0} f(K) \cap B(0,1)$
. Normalizing the coefficients
$\tilde {q}_h(\mathtt {i}|_k)$
in (4.3), writing
$(q_h(\mathtt {i}|_k))_{h \in \mathcal {F}}$
for the obtained probability vector and defining
$\zeta := \zeta (\mathtt {i}|_k) = \sum _{h \in \mathcal {F}} q_h(\mathtt {i}|_k) \zeta _h$
, we obtain from (4.3) the representation
An elementary calculation shows that
$S_{k\log \rho ^{-1}} T_{\mathtt {i}} = T_{\sigma ^k \mathtt {i}} \varphi _{\mathtt {i}|_k}^{-1}$
. For any
$t> 0$
for which
$B(\pi (\mathtt {i}), e^{-t}) \subseteq B_{\mathtt {i}|_k}$
, we have, using (4.4),
$$ \begin{align*} \mu_{\mathtt{i}, t} &= S^*_{t + k\log \rho} S_{-k \log \rho} T_{\mathtt{i}} \mu \\ &= S_{t+k \log \rho}^* T_{\sigma^k \mathtt{i}} \mu_{\mathtt{i}|_k}\\ &= (\zeta d\nu)_{\sigma^k \mathtt{i}, t + k\log \rho} \end{align*} $$
which is what was claimed.
4.2. Proof of Proposition 3.4
Proposition 3.4 is a consequence of the uniform continuity of the function
$\zeta \mapsto (\zeta d\nu )_{\mathtt {i}, t}$
which is established in the following lemmas.
The first lemma is a simple application of the Lebesgue–Besicovitch differentiation theorem.
Lemma 4.4. If
$\eta $
and
$\gamma $
are Radon measures and
$0 \neq \eta \ll \gamma $
, then for
$\eta $
-almost every x,
Proof See [Reference Hochman15, Proposition 3.8].
Recall that the set
$\mathcal {W}$
consists of all the functions
$\zeta = \zeta (\mathtt {i}|_k)$
given by Proposition 3.3 for
$\mathtt {i} \in \Gamma ^{\mathbb N}$
,
$k \in \mathbb N$
, and that
$\zeta \geq C := \min _{h \in \mathcal {F}} C_h> 0$
for each
$\zeta \in \mathcal {W}$
. Write
$$ \begin{align*}\mathcal{A} = \bigcap_{\zeta \in \mathcal{W}} \lbrace \mathtt{i} \in \Gamma^{\mathbb N}: \lim_{t \rightarrow \infty} \Vert \mu_{\mathtt{i}, t} - (\zeta d\nu)_{\mathtt{i}, t} \Vert = 0 \rbrace. \end{align*} $$
Since
$\mu \ll \zeta d\nu $
and
$\mathcal {W}$
is countable, we deduce from Lemma 4.4 that
$\bar {\mu }(\mathcal {A}) = 1$
. In the following, the lower bound for the functions in
$\mathcal {W}$
comes to play: while the previous lemma asserts that
$\mu _{\mathtt {i}, t}$
and
$(\zeta d\nu )_{\mathtt {i}, t}$
have similar asymptotic behaviour in t, the following two lemmas show that this similarity is actually uniform over
$\mathcal {W}$
, when
$\mathtt {i}$
is given.
Lemma 4.5. For
$\mathtt {i} \in \mathcal {A}$
and
$t \geq 0$
, the function
$f^{\mathtt {i}, t}: \mathcal {W} \rightarrow \mathbb R$
,
is continuous (when
$\mathcal {W}$
is equipped with the metric induced by the supremum norm) and the modulus of continuity is independent of
$\mathtt {i}$
and t.
Proof Fix
$\mathtt {i}$
and t. Let
$\varepsilon> 0$
be given and let
$\delta> 0$
be such that whenever
$\zeta _1 ,\zeta _2 \in \mathcal {W}$
and
$\Vert \zeta _1 - \zeta _2 \Vert _\infty < \delta $
, we have
$\zeta _i \in [(1-\varepsilon ) \zeta _j, (1 + \varepsilon ) \zeta _j]$
for
$i, j \in \lbrace 1, 2 \rbrace $
. Choosing such a
$\delta $
is possible because the functions
$\zeta _1, \zeta _2$
are bounded from below by
$C> 0$
.
Now, if
$\Vert \zeta _1 - \zeta _2\Vert _\infty < \delta $
, we have for
$i, j \in \lbrace 1,2\rbrace $
and all measurable
$A \subseteq B(0,1)$
,
$$ \begin{align*} (\zeta_i d\nu)_{\mathtt{i}, t}(A) - (\zeta_j d\nu)_{\mathtt{i}, t}(A) &= \frac{\int_{e^{-t}A + \pi(\mathtt{i})} \zeta_i \,d\nu}{\int_{B(\pi(\mathtt{i}), e^{-t})} \zeta_i \,d\nu} - \frac{\int_{e^{-t}A + \pi(\mathtt{i})} \zeta_j \,d\nu}{\int_{B(\pi(\mathtt{i}), e^{-t})} \zeta_j \,d\nu} \\ &\leq \frac{\int_{e^{-t}A + \pi(\mathtt{i})} ((1+\varepsilon)\zeta_i - (1-\varepsilon)\zeta_i) \,d\nu}{\int_{B(\pi(\mathtt{i}), e^{-t})} (1+\varepsilon)\zeta_i \,d\nu} \\ &\leq \frac{2\varepsilon}{1+\varepsilon}. \end{align*} $$
Thus
Since
$\varepsilon $
was arbitrary and
$\delta $
depends only on
$\varepsilon $
and C, this completes the proof.
Lemma 4.6. Let X be a subset of a compact metric space and let f be a function on
$X \times \mathbb R$
such that
$x \mapsto f(x,t)$
is continuous, with modulus of continuity independent of t, and for every x,
$\lim _{t \rightarrow \infty } f(x,t) = 0$
. Then for every
$\varepsilon> 0$
,
Proof Suppose otherwise, that there exists
$c> 0$
with the property that for every
$n \in \mathbb N$
, there exist
$x_n \in X$
and
$t_n \geq n$
such that
$f(x_n, t_n)> c$
. Let
$(y_n)_{n \in \mathbb N} \subseteq X$
be a Cauchy subsequence of
$(x_n)_{n \in \mathbb N}$
. Now, for every
$\delta> 0$
there exist
$N, M \in \mathbb N$
such that
$|y_n - y_N| < \delta $
,
$f(y_N, t_n) < c/2$
and
$f(y_n, t_n)> c$
for all
$n \geq M$
. Since the continuity of
$x \mapsto f(x, t)$
was assumed to be uniform in t, this is a contradiction.
We are now able to deduce Proposition 3.4.
Proof Proof of Proposition 3.4
As a closed and bounded subset of the linear span of a finite family of functions, the closure of
$\mathcal {W}$
is compact. For
$\mathtt {i} \in \mathcal {A}$
and
$t> 0$
, let
$f^{\mathtt {i},t}$
denote the function of Lemma 4.5. Now, for each
$\mathtt {i} \in \mathcal {A}$
and
$\varepsilon> 0$
, apply Lemma 4.6 for the function
$(\zeta , t) \mapsto f^{\mathtt {i}, t}(\zeta )$
to obtain the existence of an integer
$N(\mathtt {i}, \varepsilon ) < \infty $
such that
$\Vert \mu _{\mathtt {i}, t} - (\zeta d\nu )_{\mathtt {i}, t} \Vert < \varepsilon $
for every
$\zeta \in \mathcal {W}$
and
$t \geq N(\mathtt {i}, \varepsilon )$
. Since
$\bar {\mu }( \bigcup _{N \in \mathbb N} \lbrace \mathtt {i} \in \mathcal {A}: N(\mathtt {i}, \varepsilon ) \leq N \rbrace ) = \bar {\mu }(\mathcal {A}) =1$
, we may choose an integer
$N'$
so that if
$\mathcal {J} = \lbrace \mathtt {i} \in \Gamma ^{\mathbb N}: \Vert \mu _{\mathtt {i}, t} - (\zeta d\nu )_{\mathtt {i}, t}\Vert < \varepsilon \ \text {for all}\ t \geq N' \rbrace $
, we have
$\bar {\mu }(\mathcal {J})> 0$
.
To obtain the statement of the proposition, choose N large enough with respect to
$N'$
that
$$ \begin{align*}d \bigg( \frac{1}{T} \int_0^T \delta[\mu_{\mathtt{i}, t}]\,dt,\ \frac{1}{T} \int_0^T \delta[(\zeta d\nu)_{\mathtt{i}, t}] \,dt \bigg) < \varepsilon \end{align*} $$
for all
$T \geq N$
and
$\mathtt {i} \in \mathcal {J}$
. That such an N exists can be easily seen from the definition of the Prokhorov metric.
5. Discussion
We now recall the definition of a fractal distribution, and afterwards provide the short deduction of the second assertion of Theorem 1.1.
Following the terminology of Hochman from [Reference Hochman15], fractal distributions are distributions which are
$S^*$
-invariant and possess a spatial invariance property called quasi-Palm. They generalize the notion of CP-distributions introduced by Furstenberg to a coordinate-free setting, and, in the context of scenery flows, the well-known principle of Preiss that ‘tangent measures to tangent measures are tangent measures’.
Definition 5.1. Let P be a distribution on the space of probability measures on
$B(0,1)$
. We say that P is quasi-Palm if for any measurable
$\mathcal {A}$
,
$P(\mathcal {A}) = 1$
if and only if for every
$r> 0$
, P-almost every
$\nu $
satisfies
for
$\nu $
-almost every x with
$B(x,e^{-r}) \subseteq B(0,1)$
.
A fractal distribution is a distribution which is
$S^*$
-invariant and quasi-Palm. If the distribution is also ergodic with respect to
$S^*$
, we say that it is an ergodic fractal distribution.
Remark 5.2. This definition coincides with Hochman’s definition of a restricted fractal distribution in [Reference Hochman15], and this particular formulation was used by Hochman and Shmerkin in [Reference Hochman and Shmerkin19]. The definition of a fractal distribution in [Reference Hochman15] considers distributions supported on all Radon measures of
$\mathbb R^d$
whose support contains the origin, and does not require the condition
$B(x, e^{-r}) \subseteq B(0,1)$
. Since we only consider distributions arising from the scenery flow, the restricted versions are more relevant in our context. However, since it was shown in [Reference Hochman15] that each restricted fractal distribution extends uniquely to a fractal distribution on the space of all Radon measures, the results of [Reference Hochman15] that we use also apply with the above definition.
We will now explain how to deduce the second assertion of Theorem 1.1 from the results of [Reference Hochman15]. Suppose that
$\mu $
is a self-similar measure satisfying the hypothesis of Theorem 3.1. With the modifications highlighted in §3.3, the following goes through also in the setting of Theorem 1.1.
Let P denote the limit of the scenery flow of
$\mu $
. It is due to Hochman [Reference Hochman15, Theorem 1.7] that P is a fractal distribution. It is not difficult to see from the representation (3.7) that P gives positive mass to the closed set
for large enough R. In particular, there exists an ergodic component
$P'$
of P which gives positive mass to the set (5.1). Because ergodic components of fractal distributions are also fractal distributions by [Reference Hochman15, Theorem 1.3],
$P'$
is an ergodic fractal distribution. From the ergodic theorem and the quasi-Palm property it is not difficult to see that typical measures for
$P'$
are uniformly scaling and generate
$P'$
. In particular, a measure in the set (5.1) generates
$P'$
. Finally, since each of these measures contains as an absolutely continuous component a translated and scaled copy of
$\mu $
, Lemma 4.4 allows us to deduce that the distribution generated by
$\mu $
also equals
$P'$
. In particular,
$\mu $
generates an ergodic fractal distribution.
Remark 5.3. It suffices to consider any accumulation point of the scenery flow in place of P in the preceding paragraph. This way, after observing from (3.7) that an accumulation point is supported on measures of the form (5.1), one can infer another proof of Theorem 1.1 that relies on the deep results of [Reference Hochman15] instead of the more hands-on geometric analysis of Proposition 3.3.
5.1. Projections of Markov measures
Theorem 1.1 extends to natural projections of ergodic Markov measures on
$\Gamma ^{\mathbb N}$
. Write
$\bar {\mu }$
for such a measure on
$\Gamma ^{\mathbb N}$
and
$\mu :=\pi \bar {\mu }$
for its natural projection on the self-similar set. We go through the main observations one must make in addition to those in the Bernoulli case; details are left to the interested reader.
Let
$\Sigma \subseteq \Gamma ^{\mathbb N}$
denote the subshift of finite type associated to
$\bar {\mu }$
, and
$\Sigma ^*$
the collection of its finite words. First we note that
$\#\lbrace \mu ^{\mathtt {a}}:= \pi (\bar {\mu }_{[\mathtt {a}]}): \mathtt {a} \in \Sigma ^* \rbrace \leq (\#\Gamma )^2 < \infty $
and that for any
$\mathtt {b} \in \Sigma ^*$
,
$\mu ^{\mathtt {a} \mathtt {b}} = \mu ^{\mathtt {c} \mathtt {b}}$
for all
$\mathtt {a}, \mathtt {c} \in \Sigma ^*$
for which
$\mathtt {a} \mathtt {b}, \mathtt {c} \mathtt {b} \in \Sigma ^*$
. These are immediate from the Markov property of
$\bar {\mu }$
. The definition of the neighbourhood system of
$\mathtt {a} \in \Sigma ^*$
is replaced by
Arguing in a manner similar to in the proof of Lemma 2.3, using the weak separation condition and finiteness of the collection
$\mathcal {M} := \lbrace \mu ^{\mathtt {a}}: \mathtt {a} \in \Sigma ^* \rbrace $
, we see that there exists a word
$\mathtt {a}_0' \in \Sigma ^*$
such that for any
$\mathtt {b}$
for which
$\mathtt {b} \mathtt {a}_0' \in \Sigma ^*$
,
$\mathcal {N}(\mathtt {b} \mathtt {a}_0') = \mathcal {N}(\mathtt {a}_0') =: \mathcal {N}_0$
and
Recall (4.1) for the definition of the symbolic magnifications
$\mu _{\mathtt {a}}$
. The equivalence (5.2) follows from the condition
$\mathcal {N}(\mathtt {b} \mathtt {a}_0') = \mathcal {N}(\mathtt {a}_0')$
when
$\bar {\mu }$
is Bernoulli, and allows us to compare the scenery measures to the uniform ‘frame’
$\nu := \mu _{\mathtt {a}_0'}$
as in the case of the Bernoulli measure. Now, if the collection
$\mathcal {F} \subseteq \mathcal {N}_0$
and the words
$\mathtt {b}_h, \mathtt {b}_0 \in \Sigma ^*$
are as in Claim 4.1, we can go through the proof of Proposition 3.3 to obtain the same result with
$\zeta (\mathtt {i}|_k)$
being a convex combination of the functions
$0<\zeta _h^\eta = ({d\eta _{\mathtt {b}_h}})/{d\nu }<\infty $
, where
$h \in \mathcal {F}$
and
$\eta \in \mathcal {M}$
is such that
$\eta _{\mathtt {b}_h} \neq 0$
. The ergodic-theoretic work in §3.2 also goes through, as all properties of Bernoulli measures we use are shared by ergodic Markov measures. The ergodicity of the skew-product system we require in the rotating case follows from [Reference Kim23, Theorem 2.2].
5.2. Pointwise normality
In [Reference Hochman and Shmerkin19, Theorem 1.4], Hochman and Shmerkin proved that if
$\Phi = \lbrace \varphi _i(x) = \rho _i x + a_i \rbrace _{i \in \Gamma }$
is a self-similar IFS on the real line with the open set condition and if
$s>1$
is a Pisot number such that
${\log s}/{\log \rho _i} \not \in \mathbb Q$
for some
$i \in \Gamma $
, then any self-similar measure associated to
$\Phi $
is pointwise s-normal. The open set condition was required partly because of the uniform scaling assumption.
Combining Theorem 1.1 with the methods of Hochman and Shmerkin, we obtain the following corollary.
Corollary 5.4. Let
$\Phi = \lbrace \varphi _i(x) = \rho _i x + a_i \rbrace _{i \in \Gamma }$
be a self-similar IFS on
$\mathbb R$
satisfying the weak separation condition, and let
$\mu $
be a self-similar measure associated to
$\Phi $
. If
$s> 1$
is a Pisot number and
${\log s}/{\log \rho _i} \not \in \mathbb Q$
for some
$i \in \Gamma $
, then
$\mu $
is pointwise s-normal.
Proof In the proof of [Reference Hochman and Shmerkin19, Theorem 1.4], the open set condition was only used to deduce that (i)
$\mu $
is uniformly scaling and generates an ergodic fractal distribution P, and (ii) given an eigenfunction of P, the phase measure of
$\mu $
is an atom. Recall [Reference Hochman and Shmerkin19, Section 4.3] for the definitions of an eigenfunction and a phase measure. Since (i) is true by Theorem 1.1, we will only explain how to deduce that the phase measure of
$\mu $
is an atom in the setting of Corollary 5.4; after this, the proof proceeds exactly as the proof of [Reference Hochman and Shmerkin19, Theorem 1.4].
It follows from [Reference Hochman and Shmerkin19, Proposition 4.15] that given any eigenfunction, the phase measure of P-almost every
$\eta $
is an atom. Since P gives positive mass to the set (5.1), it follows that for some
$\zeta \in \overline {\mathcal {W}}, \mathtt {i} \in \Gamma ^{\mathbb N}$
and
$t \geq 0$
, the phase measure of
$\eta = \zeta \,d\nu _{\mathtt {i}, t}$
is an atom. Since
$\mu _{\mathtt {i}, t} \ll \eta $
, using the self-similarity of
$\mu $
we find a linear map f such that
$f\mu \ll \eta $
. By [Reference Hochman and Shmerkin19, Corollary 4.17, part 1], the phase measure of
$f\mu $
is also an atom, and by applying [Reference Hochman and Shmerkin19, Corollary 4.17, part 2] to the image of
$f\mu $
through
$f^{-1}$
, we deduce that the phase measure of
$\mu $
is also an atom.
We remark that refinements of [Reference Hochman and Shmerkin19, Theorem 1.4] have been obtained by Algom, Rodriguez Hertz and Wang [Reference Algom, Rodriguez Hertz and Wang1] for self-similar measures with the Rajchman property, and by Dayan, Ganguly and Weiss [Reference Dayan, Ganguly and Weiss2] for certain self-similar measures defined by contractions with integer contraction ratios. While these works cover a large class of self-similar measures outside the assumptions of Hochman and Shmerkin, it is nevertheless not difficult to construct self-similar measures which satisfy the assumptions of Corollary 5.4 but do not satisfy the assumptions of [Reference Hochman and Shmerkin19, Theorem 1.4], [Reference Algom, Rodriguez Hertz and Wang1] or [Reference Dayan, Ganguly and Weiss2]. Consider, for example, the Bernoulli convolution
$\nu _\rho $
, that is, the self-similar measure associated to the IFS
$\lbrace x \mapsto \rho x -1, x\mapsto \rho x + 1\rbrace $
with the uniform probability vector. It is well known that when
$0 < \rho < 1$
is such that
$\rho ^{-1}$
is a Pisot number,
$\nu _{\rho }$
is not a Rajchman measure [Reference Erdös3] but it satisfies the weak separation condition [Reference Garsia12, Reference Lau and Ngai24]. By Corollary 5.4,
$\nu _\rho $
is pointwise s-normal for any Pisot
$s> 1$
such that
${\log s}/{\log \rho } \not \in \mathbb Q$
.
5.3. Prospects
5.3.1. Weaker separation conditions
In our proof of Theorem 1.1, the weak separation condition played a crucial role in providing the reference measure
$\nu $
in (3.4). A natural question is whether the statement of the theorem holds in the presence of weaker separation conditions, for example, the asymptotic weak separation condition introduced in [Reference Feng5].
Question 5.5. Let
$\Phi = \lbrace \varphi _i \rbrace _{i \in \Gamma }$
be a self-similar IFS satisfying the asymptotic weak separation condition, that is,
Are self-similar measures associated to
$\Phi $
uniformly scaling?
This condition lacks the existence of a maximal neighbourhood system, instead allowing the cardinalities of the neighbourhood systems to grow subexponentially in n. As a consequence, it is much more difficult to understand the dynamic behaviour of the sequence
$(\mathcal {N}(\mathtt {i}|_k))_{k \in \mathbb N}$
for any
$\mathtt {i} \in \Gamma ^{\mathbb N}$
, and it seems that substantial refinements are required in our argument for one to be able to say anything about the scenery flow under this condition.
5.3.2. A description of the tangent distribution
In our proof of Theorem 1.1, the tangent distribution of
$\mu $
arises from a limiting argument. Therefore, it would be interesting to find a description of the tangent distribution for at least one explicit self-similar measure which satisfies the weak separation condition but not the open set condition. This would require describing the distribution of the sequence
$(\zeta (\mathtt {i}|_k))_{k \in \mathbb N}$
in (3.7) in more detail than is required for the approximation (3.8).
Acknowledgements
The research for this project has been supported by the Academy of Finland. I am grateful to my supervisors Ville Suomala and Meng Wu for their helpful comments and suggestions, and to the referee for their suggestions which greatly helped improve the quality of the paper.




