Moran’s Theorem is one of the milestones in Fractal Geometry. It allows the calculation of the similarity dimension of any (strict) self-similar set lying under the open set condition. Throughout a new fractal dimension we provide in the context of fractal structures, we generalize such a classical result for attractors which are required to satisfy no separation properties.
In this paper, we revisit a classical problem in Fractal Geometry from the viewpoint of fractal structures: how to calculate the similarity dimension of the attractor of an iterated function system. A solution for such a problem requires the open set condition to be satisfied by the corresponding iterated function system. Such a condition tries to control the overlapping among the self-similar copies of the whole attractor.
We have to trace back to the forties to find out the key result that allows the effective calculation of the similarity dimension of (strict) self-similar sets from their similarity ratios. It was proved by Australian mathematician P.A.P. Moran, a Besicovitch pupil at Cambridge (c.f. [12, Theorem II]).
A new viewpoint regarding fractals arises from Asymmetric Topology. In fact, a fractal structure is a kind of uniformity which provides better approaches of a space as deeper levels in its structure are explored.
In this article, we prove a generalized Moran’s Theorem for attractors which, unlike Moran’s Theorem, are not required to be under the open set condition.
The structure of this paper is as follows. In Section 2, we provide all the mathematical background to make this article self-contained. This includes the basics on IFS-attractors, the open set condition, fractal structures, and a brief description regarding both the Hausdorff and box dimensions. Section 3 explains how classical box dimension can be generalized by fractal dimension III in the context of fractal structures. Section 4 contains a generalized Moran’s Theorem (c.f. Theorem 4.1), and finally, Section 5 summarizes the main conclusions(c.f. Theorem 5.1).
Preliminaries
IFS-attractors
Let k ≥ 2. By an iterated function system (IFS), we shall understand a finite collection of similitudes on , , where each self-map fi satisfies the identity
ci ∈ (0, 1) is the similarity ratio of fi, and d refers to the Euclidean distance. Then there exists a unique compact (nonempty) subset satisfying the next Hutchinson’s equation (c.f. [10]):
is called the attractor (also the self-similar set generated by ) and consists of (smaller) self-similar copies of the whole attractor , also known as pre-fractals of (c.f. [6]). In fact, , for all i = 1, …, k. We also denote , and so on. In general, we will follow the notation used in Bandt’s paper, c.f. [3]: let and Σ = {1, …, k} be a finite alphabet. Moreover, let Σn = {i = i1 ⋯ in : ij ∈ Σ, j = 1, …, n} be the collection of all n-length words from Σ. Further, we also write fi = fi1 ∘ ⋯ ∘ fin, ci = ci1 ⋯ cin, and . Accordingly, Equation (1) can be rewritten as . Letting n→ ∞, the so-called address map stands as a continuous map from Σ∞, the set consisting of all infinite length words (sequences), onto the attractor .
The open set condition
The open set condition (OSC) was first provided by P.A.P. Moran in [12] to prove that the Hausdorff measure of any attractor is positive. Interestingly, Schief proved in [14] its reciprocal: a positive Hausdorff measure implies the OSC. We say that an IFS is under the OSC if there exists a nonempty open subset (sometimes called a feasible open set, c.f. [3]) such that the (i = 1, …, k) are pairwise disjoint with all of them contained in , i.e., , for all i ≠ j.
On the other hand, observe that the feasible open set and the attractor may be disjoint. In these situations, the OSC may be too weak to prove theoretical results regarding the fractal dimension of . In this way, Lalley strengthened the definition of the OSC in the following sense [11]: the strong open set condition (SOSC) is fulfilled if it is also satisfied that . It is worth pointing out that Schief also proved that the OSC and the SOSC are equivalent on Euclidean subsets (c.f. [14, Theorem 2.2]).
Fractal structures
The concept of a fractal structure was first introduced by Bandt and Retta in [4], and formalized afterwards by Arenas and Sánchez-Granero in [1] to characterize non-Archimedeanly quasi-metrizable spaces. They play a relevant role in asymmetric topology and constitute an ideal context where new models of fractal dimension can be provided (c.f. [7]). A family Γ of subsets of X is said to be a covering (of X) if X = ∪ {A : A ∈ Γ}. Let Γ1 and Γ2 be two coverings of X. By Γ1 ≺ Γ2, we understand that Γ1 is a refinement of Γ2, i.e., for all A ∈ Γ1, there exists B ∈ Γ2 such that A ⊆ B. In addition, Γ1 ≺≺ Γ2 means that Γ1 ≺ Γ2, and also that for all B ∈ Γ2, B = ∪ {A ∈ Γ1 : A ⊆ B}. Thus, a fractal structure on X is a countable family of coverings such that Γn+1 ≺≺ Γn, for all . Covering Γn is called level n of Γ.
To simplify, we shall allow that a set can appear twice or more in a level of a fractal structure. A fractal structure is finite if all its levels are finite coverings.
It is worth pointing out that there exists a natural fractal structure for each attractor. Its description can be stated as follows.
Definition 2.1. (c.f. [2], Definition 4.4) Let be an IFS whose attractor is . The natural fractal structure on as a self-similar set is the countable family of coverings , where .
Equivalently, the levels of the natural fractal structure on as a self-similar set can be described as , and Γn+1 = {fi (A) : A ∈ Γn, i ∈ Σ}.
On the other hand, it holds that any Euclidean space can be always endowed with a natural fractal structure whose levels are given by (c.f. [9, Definition 3.1]):
where i = 1, …, d. Note that such a fractal structure is a tiling consisting of 2-n-cubes on .
The Hausdorff and box dimensions
Let (X, ρ) be a metric space. Along the sequel, diam (A) will denote the diameter of any subset A of X, i.e., diam (A) = sup {ρ (x, y) : x, y ∈ A}. Moreover, let F ⊆ X and δ > 0. By a δ-cover of F, we shall understand a countable family of subsets {Ui : i ∈ I} such that F ⊆ ∪ i∈IUi with diam (Ui) ≤ δ. In addition, let be the collection of all δ-covers of F and define
Hence, always exists and is called the (s-dimensional) Hausdorff measure of F. It allows to define the Hausdorff dimension of F as the (unique) critical point s ≥ 0 where “jumps” from ∞ to zero, i.e., . In particular,
Though the Hausdorff dimension is the most accurate model of fractal dimension since its definition is based on a measure, the box dimension is more appropriate to be applied in empirical contexts. The (lower/upper) box dimension of is defined by the following (lower/upper) limit:
where is the number of δ-cubes that intersect F. A δ-cube in is a set of the form }. In particular, we can choose δ = 2-n. It is worth mentioning that can be calculated by one of the expressions displayed in [6, Equivalent definitions 3.1]. In particular, can be chosen as the smallest number of sets of diameter ≤δ that cover F.
Generalizing box dimension by fractal dimension III
In this section, we explain how to generalize the classical box dimension on Euclidean subsets from the viewpoint of fractal structures. To deal with, we shall define a fractal dimension model for fractal structures and prove that if the natural fractal structure for Euclidean subsets is fixed, then both dimensions coincide.
Let Γ be a fractal structure. We define as the collection of all the elements in level n of Γ that intersect a given subset F of X, diam (Γn) = sup {diam (A) : A ∈ Γn}, and .
Definition 3.1. (c.f. [8], Definition 4.2) Let Γ be a fractal structure on a metric space (X, ρ), F be a subset of X, assume that diam (F, Γn) →0, and define by
where . Moreover, let . The fractal dimension III of F is given as the (unique) non-negative real number such that
It is worth pointing out that fractal dimension III always exists, since the sequence is monotonic in . We assume that inf∅ = ∞ in Definition 3.1. For instance, if there exists F ⊂ X such that , then we have .
Observe that the condition diam (F, Γn) →0, though necessary in previous Definition 3.1, is not too restrictive.
Remark 3.2. Let be any attractor endowed with its natural fractal structure as a self-similar set. Then since decreases geometrically.
The following result gives a handier expression to deal with the effective calculation of fractal dimension III.
Theorem 3.3. (c.f. [8], Theorem 4.7) Let Γ be a fractal structure on a metric space (X, ρ), F be a subset of X, and assume that exists, where . Then
Next, we show that fractal dimension III generalizes box dimension. To deal with, we will prove even a more general result, aimed by the next Euclidean property: for each δ > 0 and all Euclidean subset F with diam (F) ≤ δ, there are at most 3dδ-cubes in that are intersected by F. This fact motivates the following definition.
Definition 3.4. Let Γ be a fractal structure on a metrizable space X and F be a subset of X. We say that Γ is under the κ-condition if there exists a natural number κ such that for all , every subset A of X with diam (A) ≤ diam (F, Γn) intersects at most to κ elements in level n of Γ.
Hence, the following result can be stated.
Theorem 3.5. (c.f. [8], Theorem 4.17) Let Γ be a fractal structure under the κ-condition on a metric space (X, ρ) and F be a subset of X. Moreover, assume that there exists dim B (F). If for all it holds that diam (A) = diam (F, Γn) with diam (F, Γn) → 0, then the fractal dimension III of F equals the box dimension of F, i.e., .
The next corollary follows immediately from Theorem 3.5.
Corollary 3.6. (c.f. [8], Theorem 4.15) Let endowed with its natural fractal structure as a Euclidean subset. Assume that there exists dim B (F). Then .
To justify that, just notice that the natural fractal structure on any Euclidean subset consists of 2-n-diameter elements in level n of Γ.
A Moran’s Theorem for fractal dimension III
Moran’s Theorem is a milestone in Fractal Geometry. It was first contributed by P.A.P. Moran (1946), who required the pre-fractals of an attractor not to overlap among them (which is equivalent to require to satisfy the OSC), to prove that the Hausdorff dimension of follows as the (unique) solution of an equation only involving the similarity ratios ci associated with each . However, it is worth pointing out that such a result still remains quite powerful, since without a wide amount of effort, the Hausdorff dimension of a wide class of self-similar sets can be easily calculated. Next, we recall that classical result.
Moran’s Theorem (1946).Let be an IFS whose attractor is . Let ci be the similarity ratio associated with each similarity , and assume that is under the OSC. If α is the solution of the equation , then , and .
The unique (positive) solution of is called the similarity dimension of . Along the sequel, the similarity dimension of an IFS-attractor will be denoted by α. Thus, we always have . A proof for Moran’s Theorem can be found in Falconer’s book (c.f. [6, Subsection 9.2]), though the reader may check that the proof regarding a lower bound of the Hausdorff dimension becomes quite awkward. Moreover, whether the OSC is not fulfilled by , then the calculation of the Hausdorff dimension of becomes harder and only some partial results are known (c.f., e.g., [5, 13]). However, even in that case, it holds that both the box and the Hausdorff dimensions of can be approximated by fractal dimension III, which still equals the similarity dimension. Next, we provide the main theoretical result in this section, which provides a generalized version of the classical Moran’s Theorem in terms of fractal dimension III.
Theorem 4.1. (c.f. [8], Theorem 4.20 and Corollary 4.22) Let be an IFS whose associated attractor is . Assume that ci is the similarity ratio associated with each similarity and let Γ be the natural fractal structure on as a self-similar set. If α is the similarity dimension of , then
and .
In addition, if is under the OSC, then . Also, .
Proof. Firstly, it is clear that the attractor is the unique non-empty compact subset of satisfying the following Hutchinson’s equation:
Hence,
Notice that . Further, let α ≥ 0 be such that . In addition, observe that ci is the similarity ratio associated with fi. Thus, for all i ∈ Σl. It is also worth pointing out that
for all i = i1 ⋯ il ∈ Σl. Accordingly, for all , the following calculations hold: Thus, , since .
In addition, if is under the OSC, then Moran’s Theorem and Theorem 4.1 (i) lead to , i.e., the fractal dimension III of equals its similarity dimension. Moreover, that value of α also equals both the box and the Hausdorff dimensions of . In fact, the next chain of inequalities is satisfied: .
To conclude the proof, just observe that , where by Theorem 4.1 (i) and (due to Moran’s Theorem). Accordingly, Theorem 4.1 (ii) follows. □
Thus, Theorem Theorem 4.1 (i) becomes useful to calculate the fractal dimension of IFS-attractors. Interestingly, it does not require the corresponding IFS to be under the OSC for fractal dimension III calculation purposes.
Conclusion
Next, we summarize all the results contained in this paper.
Theorem 5.1.Let be an IFS and its attractor. Moreover, let Γ be the natural fractal structure on as a self-similar set and ci be the similarity ratio associated with each similarity . Consider the following statements:
SOSC.
OSC.
.
, where α is the similarity dimension of .
The next chain of implications and equivalences stands:
It is worth pointing out that the implication (iv) ⇒ (iii) is not true, in general, due to a counterexample provided by Mattila (c.f. [14]).
Footnotes
Acknowledgements
The authors acknowledge the partial support of grants No. 19219/PI/14 from Fundación Séneca of Región de Murcia and No. MTM2014-51891-P from Spanish Ministry of Economy and Competitiveness.
References
1.
ArenasF.G. and Sánchez-GraneroM.A., A characterization of non-Archimedeanly quasimetrizable spaces, Rend Istit Mat Univ Trieste30(suppl.) (1999), 21–30.
2.
ArenasF.G. and Sánchez-GraneroM.A., A characterization of self-similar symbolic spaces, Mediterranean Journal of Mathematics9(4) (2012), 709–728.
3.
BandtC., HungN.V. and RaoH., On the open set condition for self-similar fractals, Proceedings of the American Mathematical Society134(5) (2005), 1369–1374.
4.
BandtC. and RettaT., Topological spaces admitting a unique fractal structure, Fundamenta Mathematicae141(3) (1992), 257–268.
5.
DengQ.R., HardingJ. and HuT.Y., Hausdorff dimension of self-similar sets with overlaps, Science in China Series A: Mathematics52(1) (2009), 119–128.
6.
FalconerK., Fractal geometry. Mathematical Foundations and Applications, 1st ed., John Wiley & Sons, Ltd., Chichester, 1990.
7.
Fernández-MartínezM., A survey on fractal dimension for fractal structures, Applied Mathematics and Nonlinear Sciences1(2) (2016), 437–472.
8.
Fernández-MartínezM. and Sánchez-GraneroM.A., Fractal dimension for fractal structures: A Hausdorff approach, Topology and its Applications159(7) (2012), 1825–1837.
9.
Fernández-MartínezM. and Sánchez-GraneroM.A., Fractal dimension for fractal structures, Topology and its Applications163 (2014), 93–111.
10.
HutchinsonJ.E., Fractals and self-similarity, Indiana University Mathematics Journal30(5) (1981), 713–747.
11.
LalleyS.P., The packing and covering functions of some selfsimilar fractals, Indiana University Mathematics Journal37(3) (1988), 699–710.
12.
MoranP.A.P., Additive functions of intervals and Hausdorff measure, Mathematical Proceedings of the Cambridge Philosophical Society42(1) (1946), 15–23.
13.
NgaiS.-M. and WangY., Hausdorff dimension of self-similar sets with overlaps, Journal of the London Mathematical Society63(3) (2001), 655–672.
14.
SchiefA., Separation properties for self-similar sets, Proceedings of the American Mathematical Society122(1) (1994), 111–115.