Next Article in Journal
Exploring the Dynamic Interplay: Carbon Credit Markets and Asymmetric Multifractal Cross-Correlations with Financial Assets
Previous Article in Journal
Stylized Facts of High-Frequency Bitcoin Time Series
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Iterated Relation Systems on Riemannian Manifolds

1
Key Laboratory of High Performance Computing and Stochastic Information Processing (HPCSIP), Ministry of Education of China, College of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
2
Beijing Institute of Mathematical Sciences and Applications, Huairou District, Beijing 101408, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(10), 637; https://doi.org/10.3390/fractalfract9100637
Submission received: 24 July 2025 / Revised: 29 August 2025 / Accepted: 6 September 2025 / Published: 29 September 2025

Abstract

For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as these fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we introduce the novel notion of iterated relation systems. We study the attractor of an iterated relation system and formulate a condition under which such an attractor can be identified with that of an associated graph-directed iterated function system. Using this method, we obtain dimension formulas for the attractor of an iterated relation system on locally Euclidean Riemannian manifolds, under the graph open set condition or the graph finite type condition. This method improves the one by Ngai and Xu, which relies on knowing the specific structure of the attractor. We also study fractals generated by iterated relation systems on Riemannian manifolds that are not locally Euclidean.

1. Introduction

Fractals in Riemannian manifolds, especially in Lie groups, Heisenberg groups, and projective spaces, have been studied extensively by many authors (see Strichartz [1], Balogh and Tyson [2], Barnsley and Vince [3], Hossain et al. [4,5], etc.). A basic theory of iterated function systems (IFSs) on Riemannian manifolds, including Hausdorff dimension, the weak separation condition (WSC), and the finite type condition (FTC), was established by Xu and the second author [6]. In [6], a method for computing the Hausdorff dimension of a certain fractal set in a flat torus is obtained; the fractal set can be identified with the attractor of some IFS on R 2 / Z 2 . However, this method is too cumbersome and is not easy to generalize. The purpose of this paper is to establish a new method that can be used to calculate the Hausdorff dimensions of more general fractal sets in Riemannian manifolds. Unlike fractal sets in R n , many interesting fractals in Riemannian manifolds cannot be described by an IFS. For example, the relations generating a Sierpinski gasket on a cylinder can be multivalued (see Example 4). Thangaraj et al. [7] studied fractals generated by multivalued functions in a metric space. Cui et al. [8] studied measures generated by nonautonomous iterated function systems consisting of expansive maps. Unlike mappings in these papers, relations that generate fractals considered in the present paper can be multivalued and expansive at the same time. To deal with the problem that the maps (or more precisely, relations) generating a fractal are multivalued and non-contractive, we introduce the notion of iterated relation systems (IRSs) (see Definition 1). We show that many interesting fractals can be described naturally by IRSs.
Let { R t } t = 1 N be an IRS on a nonempty compact subset of a topological space, and let K be the attractor of { R t } t = 1 N (see Definition 2). Then
K = t = 1 N R t ( K )
(see Proposition 2). However, in general, a nonempty compact set K satisfying (1) need not be unique and, therefore, need not be the attractor of { R t } t = 1 N ; Example A2 illustrates this. To study the uniqueness of K, we introduce the notion of a graph-directed iterated function system (GIFS) associated with an IRS (see Definition 4), and prove the uniqueness of K under the assumption that such a GIFS exists.
Since relations need not be single-valued or contractive, it might not be possible to construct a GIFS associated with an IRS (see Examples A3 and A4). Our first goal is to study, under suitable conditions, the existence of a GIFS associated with an IRS (see Theorem 1).
In Section 5, we study IRS attractors under the assumption that an associated GIFS satisfies (GOSC). Our second goal is to describe a method for computing the Hausdorff dimension of an IRS attractor in a Riemannian manifold under the assumption that an associated GIFS G exists and G satisfies (GOSC).
It is worth pointing out that Balogh and Rohner [9] extended the Moran–Hutchinson theorem (see [10]) to the more general setting of doubling metric spaces. Wu and Yamaguchi [11] generalized the results of Balogh and Rohner.
For IFSs on R n , the finite type was first introduced by Wang and the second author [12], and was extended to the general finite type condition independently by Jin and Yau [13], and Lau and the second author [14]. The graph finite type condition (GFTC) was extended to Riemannian manifolds by Xu and the second author [6]. In Section 6, we study IRS attractors under the assumption that a GIFS associated with an IRS satisfies (GFTC). Our third goal is to obtain a method for computing the Hausdorff dimension of the attractor that improves the one in [6].
Fractals on spheres have, in fact, been studied quite extensively, especially in connection with the stereographic metric and comparison of dimensions (see [15]), construction of fractal functions on the sphere (see [16,17]), and IFSs consisting of Möbius transformations (see [18]). In Section 7, we study fractals generated by IRSs on spheres. Computing the dimension of an attractor becomes substantially harder, as the sphere is not locally Euclidean. Nevertheless, we show in Example 6 how to obtain the box dimension.
This paper is organized as follows. In Section 2, we state our main theorems. In Section 3, we give the definition of an IRS and study the properties of its attractor. Section 4 is devoted to the proof of Theorem 1. In Section 5, we prove Theorems 2–3. We also construct an IRS satisfying the conditions of Theorem 3, and compute the Hausdorff dimension of the associated attractors. In Section 6, we prove Theorems 4–5 and provide examples to illustrate Theorem 5. In Section 7, we study fractals generated by iterated relation systems on S 2 , which is not locally Euclidean. Finally, a conclusion is given in Section 8.

2. Statement of Main Results

This section contains the statements of our main theorems. The proofs of these theorems are presented later in the paper, as we need to first establish some basic theory.
Let # F be the cardinality of a set F. The definition of a finite family of contractions decomposed from { R t } t = 1 N and the definition of a good partition that appear in our first main theorem below are given in Definition 5.
Theorem 1.
Let X be a complete metric space, and let E 0 X be a nonempty compact set. Let { R t } t = 1 N ( N 1 ) be an IRS on E 0 . For any integer k 0 , let E k + 1 : = t = 1 N R t ( E k ) . Assume that { R t } t = 1 N satisfies the following conditions:
(a) 
There exists an integer k 0 1 such that for any t { 1 , , N } and any x E k 0 1 ,
# { R t ( x ) } < .
(b) 
For any t { 1 , , N } , if H t : = { x E k 0 1 : 2 # { R t ( x ) } < } Ø , we require that the following conditions are satisfied:
(i) 
r t : = R t | H t can be decomposed as a finite family of contractions { h t l , i : H t i h t l , i ( H t i ) } l = 1 , i = 1 n t , m t , where i = 1 m t H t i = H t , and r ˜ t : = R t | E k 0 1 H t can be decomposed as a finite family of contractions { h t 0 , i : J t i h t 0 , i ( J t i ) } i = 1 q t , where i = 1 q t J t i = E k 0 1 H t .
(ii) 
There exists a good partition on E k 0 with respect to some finite family of contractions decomposed from { R t } t = 1 N (not necessarily the one in ( i ) ).
Then there exists a GIFS associated to { R t } t = 1 N on E k 0 .
We give examples (see Examples A3–A6) to investigate the conditions in Theorem 1. Under the assumption that { R t } t = 1 N satisfies conditions (a) and (b) (i) in Theorem 1, we give a sufficient condition for the hypothesis (b) (ii) to be satisfied (see Theorem 6).
The construction of the incidence matrices that appear in Theorems 2–3 will be given in Section 5 (see (22)).
Theorem 2.
Let M be a complete n-dimensional smooth orientable Riemannian manifold that is locally Euclidean. Let { R t } t = 1 N be an IRS on a nonempty compact subset of M, and K be the associated attractor. Assume that there exists a GIFS G = ( V , E ) associated with { R t } t = 1 N , and assume that G consists of contractive similitudes. Suppose that G satisfies (GOSC). Let λ α be the spectral radius of the incidence matrix A α associated with G. Then
dim H ( K ) = α ,
where α is the unique number such that λ α = 1 .
The definitions of a simplified GIFS and a minimal simplified GIFS are given in Definitions 6 and 7, respectively.
Theorem 3. 
Let M, { R t } t = 1 N , K, and G = ( V , E ) be as in Theorem 2. Let G ^ = ( V ^ , E ^ ) be a minimal simplified GIFS associated with G. Assume that G ^ satisfies (GOSC). Let λ ^ α be the spectral radius of the incidence matrix A ^ α associated with G ^ .
(a) 
dim H ( K ) = α , where α is the unique real number such that λ ^ α = 1 .
(b) 
In particular, let G ^ = ( V ^ , E ^ ) be a minimal simplified GIFS associated with G and assume that G ^ consists of contractive similitudes { f t } t = 1 m . Suppose that # V ^ = 1 . If { f t } t = 1 m satisfies (OSC), then dim H ( K ) is the unique number α satisfying
t = 1 m ρ t α = 1 ,
where ρ t is the contraction ratio of f t .
The construction of the weighted incidence matrices that appear in the following theorems is given in Section 6.
Theorem 4. 
Let M, { R t } t = 1 N , K, and G = ( V , E ) be as in Theorem 2. Assume that G satisfies (GFTC). Let λ α be the spectral radius of the weighted incidence matrix A α associated with G. Then
dim H ( K ) = α ,
where α is the unique real number such that λ α = 1 .
Theorem 5. 
Let M, { R t } t = 1 N , K, and G = ( V , E ) be as in Theorem 2. Let G ^ = ( V ^ , E ^ ) be a minimal simplified GIFS associated with G. Assume that G ^ satisfies (GFTC). Let λ ^ α be the spectral radius of the weighted incidence matrix A ^ α associated with G ^ . Then
dim H ( K ) = α ,
where α is the unique real number such that λ ^ α = 1 .

3. Iterated Relation Systems

Throughout this paper, we let Σ : = { 1 , , N } , where N N . We first introduce the definition of an IRS.
Definition 1. 
Let T be a topological space and let E 0 T be a nonempty compact set. Let { R t } t = 1 N be a family of relations defined on E 0 . For any integer n 0 , let
E n + 1 : = t = 1 N R t ( E n ) .
We call { R t } t = 1 N an iterated relation system (IRS) if it satisfies the following conditions:
(a) 
for any nonempty compact set F E 0 and t Σ , R t ( F ) is a nonempty compact set;
(b) 
for any t Σ , R t ( E 0 ) E 0 .
Examples 1, 2–4, and 5–6 illustrate IRSs with various properties.
Proposition 1. 
Let T be a topological space, and let E 0 T be a nonempty compact set. Let { R t } t = 1 N be an IRS on E 0 . For any integer n 0 , let E n be defined as in (2). Then n = 0 E n is a nonempty compact set.
Proof. 
By Definition 1 (b), we have E 1 E 0 . Assume that E n + 1 E n for some n 0 . Then
E n + 2 = t = 1 N R t ( E n + 1 ) t = 1 N R t ( E n ) = E n + 1 .
Hence, for any n 0 , E n + 1 E n . We know that E 0 is a nonempty compact set. Assume that E n is a nonempty compact set for some n 1 . By Definition 1 (a), R t ( E n ) is a nonempty compact set for any t Σ . Hence, E n + 1 is a nonempty compact set. Therefore, { E n } n = 0 is a decreasing sequence of nonempty compact subsets of T. This proves the proposition.  □
Definition 2.
Let T, E 0 , and { R t } t = 1 N be as in Proposition 1. For any integer n 0 , let E n be defined as in (2). We call K : = n = 0 E n the invariant set or attractor of { R t } t = 1 N .
Next, we introduce the following condition, which we call Condition (C).
Definition 3. 
Let T, E 0 , and { R t } t = 1 N be as in Proposition 1. For any integer n 0 , let E n be defined as in (2). We say that { R t } t = 1 N satisfies Condition (C) if it has the following property.
(C) 
For any x E 0 , if there exist some l Σ , a subsequence { n k } of { n } , and y n k E n k satisfying x R l ( y n k ) R l ( E n k ) for all k 0 , then there exists a subsequence { y n k j } of { y n k } converging to some y n = 0 E n satisfying x R l ( y ) .
Condition (C) ensures that the inclusion K t = 1 N R t ( K ) holds.
Proposition 2. 
Let T, E 0 , and { R t } t = 1 N be defined as in Proposition 1. Let K be the attractor of { R t } t = 1 N .
(a) 
t = 1 N R t ( K ) K .
(b) 
If Condition (C) holds, then K t = 1 N R t ( K ) , and thus (1) holds.
Proof. 
(a) By the definition of K, for any n 0 , we have K E n . Hence, for any t Σ ,
R t ( K ) t = 1 N R t ( E n ) E n .
Thus, t = 1 N R t ( K ) n = 0 E n = K .
(b) We prove the following claims.
Claim 1. n = 0 t = 1 N R t ( E n ) t = 1 N n = 0 R t ( E n ) . Let x n = 0 t = 1 N R t ( E n ) . Then for any n 0 , there exists l n Σ such that x R l n ( E n ) . Hence there exist some l Σ and a subsequence { n k } of { n } such that x R l ( E n k ) for all k 0 . Let y n k E n k such that x R l ( y n k ) . By Condition (C), there exists a subsequence { y n k j } converging to some
y n = 0 E n satisfying x R l ( y ) n = 0 R l ( E n ) .
Therefore, x t = 1 N n = 0 R t ( E n ) .
Claim 2. t = 1 N n = 0 R t ( E n ) t = 1 N R t n = 0 E n . Let x t = 1 N n = 0 R t ( E n ) . Then there exists l Σ such that for any n 0 , x R l ( E n ) . Let y n E n such that x R l ( y n ) . By Condition (C), there exists a subsequence { y n k } converging to some
y n = 0 E n satisfying x R l ( y ) R l n = 1 E n .
Therefore, x t = 1 N R t ( n = 0 E n ) . By Claims 1 and 2, we have
K = n = 0 t = 1 N R t ( E n ) t = 1 N n = 0 R t ( E n ) t = 1 N R t n = 0 E n = t = 1 N R t ( K ) .
Using the result of (a), we have K = t = 1 N R t ( K ) . This proves (b).  □
If condition (C) is not assumed, Proposition 2 (b) may fail. We provide a counterexample in Appendix A (see Example A1). Also, for a general IRS, there could be more than one nonempty compact set K satisfying (1) (see Example A2).
In the next section, we study the uniqueness of a nonempty compact set K satisfying equality (1).

4. Associated Graph-Directed Iterated Function Systems

In this section, we let X be a complete metric space, E 0 X be a nonempty compact set and { R t } t = 1 N be an IRS on E 0 . We introduce the notion of a graph-directed iterated function system (GIFS) associated with { R t } t = 1 N , and prove Theorem 1.
A graph-directed iterated function system (GIFS) of contractions { f e } e E on X is an ordered pair G = ( V , E ) , where V = { 1 , , m } is the set of vertices and E is the set of all directed edges. We allow more than one edge between two vertices. A directed path in G is a finite string e = ( e 1 , , e q ) of edges in E such that the terminal vertex of each e i is the initial vertex of the edge e i + 1 . For such a path, denote the length of e by | e | = q . For any two vertices i , j V and any positive integer q, let E i , j be the set of all directed edges from i to j, E q i , j be the set of all directed paths of length q from i to j, E q be the set of all directed paths of length q, and E * be the set of all directed paths, i.e.,
E q : = i , j = 1 m E q i , j and E * : = q = 1 E q .
Then there exists a unique collection of nonempty compact sets { K ˜ i } i V satisfying
K ˜ i = j = 1 m e E i , j f e ( K ˜ j ) , i V
(see, e.g., [19,20]). Let K ˜ : = i = 1 m K ˜ i be the invariant set or attractor of the GIFS. Recall that a GIFS G = ( V , E ) is said to be strongly connected provided that for all i , j V , there exists a directed path from i to j.
Definition 4. 
Let X be a complete metric space and let E 0 X be a nonempty compact set. Let { R t } t = 1 N be an IRS on E 0 . For any integer k 0 , let E k + 1 be defined as in (2). We assume that there exists a finite integer k 0 0 such that E k 0 = j = 1 m W j , where each W j E k 0 is compact. Suppose that there exists a GIFS G = ( V , E ) of contractions { f e } e E , where V = { 1 , , m } , such that for any q 1 ,
t Σ q R t ( E k 0 ) = i , j = 1 m e E q i , j f e ( W j ) .
Then G is called a graph-directed iterated function system (GIFS) associated with { R t } t = 1 N on E k 0 . We call
K ˜ : = q = 1 i , j = 1 m e E q i , j f e ( W j )
the attractor generated by the GIFS G associated with { R t } t = 1 N .
We have the following proposition.
Proposition 3. 
Let X, E 0 , and { R t } t = 1 N be as in Definition 4. Let K be the attractor of { R t } t = 1 N . Assume that there exists a GIFS G = ( V , E ) associated with { R t } t = 1 N and assume that G consists of contractions { f e } e E . Let K ˜ be the attractor of G. Then K = K ˜ .
Proof. 
By Definition 4, for any q 1 , we have
q = 1 t Σ q R t ( E k 0 ) = q = 1 i , j = 1 m e E q i , j f e ( W j ) .
By Definition 1 and (4), we have
K = n = 0 E n + 1 = q = 1 E k 0 + q = q = 1 t Σ q R t ( E k 0 ) = q = 1 i , j = 1 m e E q i , j f e ( W j ) = K ˜ .
Proposition 4. 
Let X, E 0 , { R t } t = 1 N , and K be defined as in Definition 4. Assume that there exists a GIFS G = ( V , E ) associated with { R t } t = 1 N , and assume that G consists of contractions { f e } e E . Then there exists a unique nonempty compact set K satisfying (1).
Proof. 
Assume that there exists another nonempty compact set K 1 satisfying (1). Note that
K 1 = t 1 = 1 N t n = 1 N R t 1 R t n ( K 1 ) t 1 = 1 N t n = 1 N R t 1 R t n ( E 0 ) .
Hence
K 1 n = 1 t 1 = 1 N t n = 1 N R t 1 R t n ( E 0 ) = n = 1 E n = K .
Next, we show that K K 1 . We know that
K 1 = n = 1 t 1 = 1 N t n = 1 N R t 1 R t n ( K 1 ) .
For any e E , let ρ e be a contraction ratio of f e . Then for any x K 1 and for any integer m, n, where m > n > 0 , we have
| R t 1 R t m k 0 ( R t m k 0 + 1 R t m x ) R t 1 R t n k 0 ( R t n k 0 + 1 R t n x ) | = | f e j 1 f e j m k 0 ( R t m k 0 + 1 R t m x ) f e j 1 f e j n k 0 ( R t n k 0 + 1 R t n x ) | ρ e j 1 ρ e j n | E k 0 | .
Hence, lim n R t 1 R t n k 0 ( R t n k 0 + 1 R t n x ) exists. Thus, for any z K , there exists x * K 1 satisfying
z = lim n f e j 1 f e j n k 0 ( x * ) K 1 .
Therefore, K K 1 . This proves the proposition.  □
Let G = ( V , E ) be a GIFS of contractions { f e } e E . We say that { U i } i = 1 m is an invariant family under G if
e E i , j f e ( U j ) U i for all i , j { 1 , , m } .
Definition 5. 
Let X, E 0 , { R t } t = 1 N , and k 0 be defined as in Definition 4.
(a) 
Assume that conditions (i) and (ii) below hold.
(i) 
For any t Σ and x E k 0 1 , # { R t ( x ) } < .
(ii) 
For any t Σ , there exists F t i dom ( R t ) E k 0 1 such that for each l { 1 , , u t } and i { 1 , , v t } , there exists a contraction f t l , i : F t i f t l , i ( F t i ) , and the following holds
t = 1 N i = 1 v t R t ( F t i ) = t = 1 N l = 1 u t i = 1 v t f t l , i ( F t i ) .
Then we say that { f t l , i } t = 1 , l = 1 , i = 1 N , u t , v t is a finite family of contractions decomposed from { R t } t = 1 N and that each f t l , i is a branch of R t | F t i .
(b) 
Let W k 0 : = { W t α , β : t { 1 , , N } , α { 1 , , σ t } , β { 1 , , τ t } } be a collection of compact subsets of E k 0 satisfying
t = 1 N α = 1 σ t β = 1 τ t W t α , β = E k 0 .
Let F : = { g t l , α , β : W t α , β g t l , α , β ( W t α , β ) } t = 1 , l = 1 , α = 1 , β = 1 N , u t , σ t , τ t be a finite family of contractions decomposed from { R t } t = 1 N and composed of all the branches of R t | W t α , β . Fix t Σ . Assume that for any α { 1 , , σ t } and β { 1 , , τ t } , W t α , β is invariant under g t l , α , β for all l { 1 , , u t } . Then we call W k 0 a good partition of E k 0 with respect to { g t l , α , β } t = 1 , l = 1 , α = 1 , β = 1 N , u t , σ t , τ t .
Let Π t : = { 1 , , n t } , Δ t : = { 1 , , q t } , Λ t : = { 1 , , m t } and Ψ t i : = { 1 , , p t i } . We are now ready to prove Theorem 1, which is stated in Section 2.
Proof of Theorem 1.
To prove this theorem, we consider the following two cases.
Case 1. For any t Σ , H t = Ø . In this case, { R t } t = 1 N is an IFS. Hence, there exists a GIFS associated with { R t } t = 1 N on E k 0 , where k 0 0 .
Case 2. For some t Σ , H t Ø . In this case, in order to prove the existence of a GIFS associated with { R t } t = 1 N , we first prove the following five claims.
Claim 1. For any t Σ , R t ( E k 0 1 ) = l = 1 n t i = 1 m t h t l , i ( H t i ) ¯ i = 1 q t h t 0 , i ( J t i ) ¯ . By (b) (i), we have
R t ( E k 0 1 ) = l = 1 n t i = 1 m t h t l , i ( H t i ) i = 1 q t h t 0 , i ( J t i ) l = 1 n t i = 1 m t h t l , i ( H t i ) ¯ i = 1 q t h t 0 , i ( J t i ) ¯ .
Since R t ( E k 0 1 ) is compact, we have l = 1 n t i = 1 m t h t l , i ( H t i ) ¯ i = 1 q t h t 0 , i ( J t i ) ¯ R t ( E k 0 1 ) . This proves Claim 1.
Claim 2. For any t Σ , let
W ̲ t 0 , i : = h t 0 , i ( J t i ) ¯ , where i Δ t , and W ̲ t l , i : = h t l , i ( H t i ) ¯ , W ̲ t n t + 1 , i : = E k 0 H t i ¯ , where l Π t and i Λ t .
Then
E k 0 = t = 1 N i = 1 q t W ̲ t 0 , i ( l = 1 n t + 1 i = 1 m t W ̲ t l , i ) .
By Claim 1, we have
E k 0 = t = 1 N R t ( E k 0 1 ) = t = 1 N l = 1 n t i = 1 m t h t l , i ( H t i ) ¯ i = 1 q t h t 0 , i ( J t i ) ¯ = t = 1 N i = 1 q t W ̲ t 0 , i l = 1 n t i = 1 m t W ̲ t l , i .
Note that for any t Σ and i Λ t , we have W ̲ t n t + 1 , i = E k 0 H t i ¯ E k 0 . Hence, (5) holds.
Claim 3. For any t Σ and i Λ t , let { x n } be a convergent sequence in H t i . Then for any l Π t , the sequence { h t l , i ( x n ) } converges. If H t i is an open set, then we can extend h t l , i from H t i to H t i ¯ and let h ˜ t l , i : H t i ¯ W ̲ t l , i be defined as
h ˜ t l , i ( x ) : = h t l , i ( x ) , x H t i , lim n h t l , i ( x n ) , x H t i ¯ H t i ,
where for any x H t i ¯ H t i , x n x ( n ). Moreover, h ˜ t l , i is a surjection. In fact, by (b) (i), h t l , i is uniformly continuous on H t i . Hence, the sequence { h t l , i ( x n ) } converges, and thus we can define h t l , i ( x ) : = lim n h t l , i ( x n ) if x H t i ¯ H t i . Note that for any x H t i ¯ H t i , h t l , i ( x ) is independent of the choice of the sequence { x n } . Therefore, we can extend h t l , i from H t i to H t i ¯ and let h ˜ t l , i be defined as in (6). To show that h ˜ t l , i is a surjection, we let y W ̲ t l , i = h t l , i ( H t i ) ¯ . Then there exists a sequence { h t l , i ( x n ) } h t l , i ( H t i ) such that
lim n h t l , i ( x n ) = y .
We know that { x n } is bounded, and hence there exists a convergent subsequence { x n k } such that
lim n x n k = x H t i ¯ .
Note that
| h ˜ t l , i ( x ) y | | h ˜ t l , i ( x ) h t l , i ( x n k ) | + | h t l , i ( x n k ) y | .
Combining (b) (i) and the definition of h ˜ t l , i , we have for all δ > 0 , there exists N 1 N such that for all k > N 1 ,
| h t l , i ( x n k ) h ˜ t l , i ( x ) | < ε 2 .
By (7) and (8), we have lim k h t l , i ( x n k ) = y , and thus for any ε > 0 , there exists N 2 N such that for all k > N 2 ,
| h t l , i ( x n k ) y | < ε 2 .
Let N 3 : = max { N 1 , N 2 } . Then for any k > N 3 , (10) and (11) hold. By (9),
| h ˜ t l , i ( x ) y | < ε 2 + ε 2 = ε .
It follows that h ˜ t l , i ( x ) = y . This proves the Claim 3.
Claim 4. For any t Σ and i Δ t , let { x n } be a convergent sequence in J t i . Then the sequence { h t 0 , i ( x n ) } converges. If J t i is an open set, then we can extend h t 0 , i from J t i to J t i ¯ , and let h ˜ t 0 , i : J t i ¯ W ̲ t 0 , i be defined as
h ˜ t 0 , i ( x ) : = h t 0 , i ( x ) , x J t i , lim n h t l , i ( x n ) , x J t i ¯ J t i ,
where for any x J t i ¯ J t i , x n x when n . Moreover, h ˜ t 0 , i is a surjection. The proof of Claim 4 is similar to that of Claim 3; we omit the details.
Claim 5. For any t Σ ,
R t ( E k 0 ) = l = 1 n t i = 1 m t h ˜ t l , i E k 0 H t i ¯ i = 1 q t h ˜ t 0 , i E k 0 ( E k 0 H t i ) ¯ .
In fact, by using a method similar to that for Claim 1, we have, for any t Σ ,
R t ( E k 0 ) = l = 1 n t i = 1 m t h t l , i ( E k 0 H t i ) ¯ i = 1 q t h t 0 , i ( E k 0 ( E k 0 H t i ) ) ¯ .
As in the proof for Claim 3, for any t Σ , i Λ t , and l Π t , we have
h t l , i ( E k 0 H t i ) ¯ h ˜ t l , i ( E k 0 H t i ¯ ) .
By Claim 3, for any x ( E k 0 H t i ) H t i ,
h ˜ t l , i ( x ) = h t l , i ( x ) h t l , i ( E k 0 H t i ) h t l , i ( E k 0 H t i ) ¯ .
If x E k 0 H t i ¯ ( E k 0 H t i ) , then x H t i ¯ H t i . We know that there exists a sequence { x n } ( E k 0 H t i ) , converging to x, such that
h ˜ t l , i ( x ) = lim n h t l , i ( x n ) h t l , i ( E k 0 H t i ) .
Hence, for any t Σ , i Λ t , and l Π t ,
h ˜ t l , i ( E k 0 H t i ¯ ) h t l , i ( E k 0 H t i ) ¯ .
Combining (15) and (16), we have, for any t Σ , i Λ t , and l Π t ,
h ˜ t l , i ( E k 0 H t i ¯ ) = h t l , i ( E k 0 H t i ) ¯ .
By using a similar argument, we have, for any t Σ and i Δ t ,
h ˜ t 0 , i ( E k 0 ( E k 0 H t i ) ¯ ) = h t 0 , i ( E k 0 ( E k 0 H t i ) ) ¯ .
Combining (14), (17), and (18) proves (13).
Next, fix t Σ . By (b) (ii) and Claim 2, we can rename the nonempty elements in { W ̲ t l , i } t = 1 , l = 1 , i = 1 N , n t + 1 , m t and { W ̲ t 0 , i } t = 1 , i = 1 N , q t as W t s , i , where s and i satisfy the following conditions.
(1)
W t s , i E k 0 H t i ¯ , where s Ψ t i and i Λ t .
(2)
W t s , i J t i ¯ , where s { p t i + 1 , , p t i + h t i } and i Δ t .
(3)
{ W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i is invariant under g t 0 , s , i : = h ˜ t 0 , i | W t s , i , and { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i is invariant under g t l , s , i : = h ˜ t l , i | W t s , i , where l Π t .
Note that
E k 0 H t i ¯ = s = 1 p t i W t s , i and J t i ¯ = s = p t i + 1 p t i + h t i h ˜ t 0 , i ( W t s , i ) .
By (13), for any t Σ , we have
R t ( E k 0 ) = l = 1 n t i = 1 m t h ˜ t l , i E k 0 H t i ¯ i = 1 q t h ˜ t 0 , i E k 0 ( E k 0 H t i ) ¯ = l = 1 n t i = 1 m t s = 1 p t i h ˜ t l , i W t s , i i = 1 q t s = p t i + 1 p t i + h t i h ˜ t 0 , i W t s , i = l = 1 n t i = 1 m t s = 1 p t i g t l , s , i ( W t s , i ) i = 1 q t s = p t i + 1 p t i + h t i g t 0 , s , i ( W t s , i ) .
By the definitions of g t l , s , i and W t s , i , for fixed t, l, s, i, and g u : = g t l , s , i , W j : = W t s , i , we have
g u : W j W k , for j , k { 1 , , p } ,
where W k : = g t l , s , i ( W t s , i ) and u { 1 , , L } . Let V : = { 1 , , p } be a set of vertices, E k , j be the set of all edges from k to j, and E = k , j = 1 p E k , j be the set of all edges. Let
f e : = g u , e E k , j .
Then for any e E , f e is contractive. Hence, G : = ( V , E ) is a GIFS of contractions { f e } e E .
Finally, we show that G is a GIFS associated with { R t } t = 1 N on E k 0 . By (13) and the definition of g u , we have
t = 1 N R t ( E k 0 ) = u = 1 L j = 1 p g u ( W j ) u = L + 1 L j = p + 1 p g u ( W j ) = k , j = 1 p e E k , j f e ( W j ) .
Now we show by induction that for q 1 ,
t Σ q R t ( E k 0 ) = k , j = 1 p e E q k , j f e ( W j ) .
For q = 1 , (19) implies that (20) holds. Assume that (20) holds when q = q 0 . For q = q 0 + 1 ,
t Σ q 0 + 1 R t ( E k 0 ) = t 1 = 1 N R t 1 k , j = 1 p e E q 0 k , j f e ( W j ) = u = 1 L i = 1 m g u j = 1 p e E q 0 k , j f e ( W j ) u = L + 1 L i = m + 1 p g u j = 1 p e E q 0 k , j f e ( W j ) = k , s = 1 p e E s , k f e j = 1 p e E q 0 k , j f e ( W j ) ( by ( 19 ) ) = k , j = 1 p e E q 0 + 1 k , j f e ( W j ) .
Hence, (20) holds. By definition, G is a GIFS associated with { R t } t = 1 N on E k 0 , where k 0 1 . This proves Case 2. Combining Cases 1 and 2 completes the proof.  □
If condition (a) in Definition 5 is not satisfied, Theorem 1 may fail. We provide a counterexample in Appendix A (see Example A3). We show in Examples A4 and A5 that the conditions in Theorem 1 (b) (i) need not be satisfied. We also show in Example A6 that condition (b) (ii) in Theorem 1 may fail.
Theorem 6. 
Let X be a complete metric space and let E 0 X be a nonempty compact set. Let { R t } t = 1 N be an IRS on E 0 . For any integer k 0 , let E k + 1 be defined as in (2). Assume { R t } t = 1 N satisfies the following conditions.
(a) 
There exists an integer k 0 1 such that for any t Σ and any x E k 0 1 ,
# { R t ( x ) } < .
(b) 
For any t Σ , if H t : = { x E k 0 1 : 2 # { R t ( x ) } < } Ø , we require that the following conditions are satisfied.
(i) 
r t : = R t | H t can be decomposed as a finite family of contractions { h t l , i : H t i h t l , i ( H t i ) } l = 1 , i = 1 n t , m t , where i = 1 m t H t i = H t , and r ˜ t : = R t | E k 0 1 H t can be decomposed as a finite family of contractions { h t 0 , i : J t i h t 0 , i ( J t i ) } i = 1 q t , where i = 1 q t J t i = E k 0 1 H t .
(ii) 
There exist α , β Λ t or σ , τ Δ t such that for any l Π t and any i Λ t ,
h t l , i ( H t i ) ¯ H t α ¯ or h t l , i ( H t i ) ¯ J t σ ¯ ,
and for any i Δ t ,
h t 0 , i ( J t i ) ¯ H t β ¯ or h t 0 , i ( J t i ) ¯ J t τ ¯ .
Then there exists a GIFS associated with { R t } t = 1 N on E k 0 .
Proof. 
For any t Σ , let
W ̲ t 0 , i : = h t 0 , i ( J t i ) ¯ , where i Δ t , and W ̲ t l , i : = h t l , i ( H t i ) ¯ , W ̲ t n t + 1 , i : = E k 0 H t i ¯ , where l Π t and i Λ t .
Fix t Σ . By (b) (ii), we can rename the nonempty elements in { W ̲ t l , i } t = 1 , i = 1 , s = 1 N , n t + 1 , m t and { W t 0 , i } t = 1 , i = 1 N , q t as W t s , i , where s and i satisfy the following conditions:
(a)
W t s , i E k 0 H t i ¯ , where s Ψ t i and i Λ t ;
(b)
W t s , i J t i ¯ , where s { p t i + 1 , , p t i + h t i } and i Δ t .
Note that
E k 0 H t i ¯ = s = 1 p t i W t s , i and J t i ¯ = s = p t i + 1 p t i + h t i W t s , i .
For t Σ , l Π t , i Λ t , and s Ψ t i , let g t l , s , i : = h ˜ t l , i | W t s , i . For i Δ t and s { p t i + 1 , , p t i + h t i } , let g t 0 , s , i : = h ˜ t 0 , i | W t s , i . Here, h ˜ t l , i and h ˜ t 0 , i are defined as in (6) and (12), respectively. Then for any W t s , i , where t Σ , i Λ t , and s Ψ t i , there exists some W t s 0 , j , where j Λ t and s 0 Ψ t j , such that
g t l , s , i ( W t s , i ) W t s 0 , j .
Similarly, for any W t s , i , where t Σ , i Δ t , and s { p t i + 1 , , p t i + h t i } , there exists some W t s 0 , j , where j Δ t and s 0 { p t i + 1 , , p t i + h t i } , such that
g t 0 , s , i ( W t s , i ) W t s 0 , j .
Hence, { { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i , { W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i } is a good partition of E k 0 with respect to { { g t l , s , i } t = 1 , l = 1 , i = 1 , s = 1 N , n t , m t , p t i , { g t 0 , s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i } . By Theorem 1, there exists a GIFS associated with { R t } t = 1 N on E k 0 .  □
Definition 6. 
Let X be a complete metric space, and let G = ( V , E ) be a GIFS of contractions { f e } e E on X, where V : = { 1 , , p } and E is the set of all directed edges. Let { W j } j = 1 p be an invariant family under G. We call G ˜ = ( V ˜ , E ˜ ) a simplified graph-directed iterated function system associated with G, if G ˜ satisfies the following conditions.
(a) 
E ˜ E and { W ˜ j } j = 1 p ˜ { W j } j = 1 p , where p p ˜ .
(b) 
Let { f e } e E ˜ be contractions associated with G ˜ , and let { W ˜ j } j = 1 p ˜ be an invariant family under G ˜ . Then for any q 1 ,
i , j = 1 p e E q i , j f e ( W j ) = i , j = 1 p ˜ e E ˜ q i , j f e ( W ˜ j ) .
By Definition 6, we know that the attractor of G is equal to the attractor of G ˜ . Note that the simplified GIFS is not unique.
Definition 7. 
We say that a simplified GIFS G ^ composed of { W ^ j } j = 1 p ^ , { f e } e E ^ is a minimal simplified graph-directed iterated function system if among all simplified GIFSs G ˜ = ( V ˜ , E ˜ ) composed of { W ˜ j } j = 1 p ˜ , { f e } e E ˜ , we have p ^ p ˜ , and among all those simplified GIFSs with p ˜ = p ^ , we have # { f e } e E ^ # { f e } e E ˜ .
Proposition 5. 
Assume that { R t } t = 1 N satisfies the conditions of Theorem 1 and G = ( V , E ) is a GIFS associated with { R t } t = 1 N guaranteed by Theorem 1, where V = { 1 , , p } and G consists of contractions { f e } e E . Then there exists a minimal simplified GIFS G ^ = ( V ^ , E ^ ) associated with G.
Proof. 
Let { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i and { W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i be defined as in the proof of Theorem 1. For fixed t, s, i, we write W j : = W t s , i . Then
t = 1 N i = 1 m t s = 1 p t i W t s , i i = 1 q t s = p t i + 1 p t i + h t i W t s , i = j = 1 p W j .
Fix t Σ . For any W t s , i , where s Ψ t i and i Λ t , if there exists s 0 Ψ t i with s 0 s such that W t s , i W t s 0 , i , then we remove W t s , i . In particular, if W t s , i = W t s 0 , i , then we remove one of them. If there are multiple elements in { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i that are equal, then we keep one of them and remove the others. We rename the remaining { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i as W ˜ t s , i , where s { 1 , , p ˜ t i } and i { 1 , , m ˜ t } . We use a similar method to keep the elements in the set { W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i , and thus we rename the remaining { W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i as W ˜ t s , i , where s { p ˜ t i + 1 , , p ˜ t i + h ˜ t i } and i { 1 , , q ˜ t } . Note that
i = 1 m t s = 1 p t i W t s , i = i = 1 m ˜ t s = 1 p ˜ t i W ˜ t s , i and i = 1 q t s = p t i + 1 p t i + h t i W t s , i = i = 1 q ˜ t s = p ˜ t + 1 p ˜ t i + h ˜ t i W ˜ t s , i .
For any t Σ , we note that the number of elements removed from { W t s , i } t = 1 , i = 1 , s = 1 N , m t , p t i and { W t s , i } t = 1 , i = 1 , s = p t i + 1 N , q t , p t i + h t i is equal to the number of elements removed from { W j } j = 1 p . We rename the remaining { W j } j = 1 p as W ˜ j , where j { 1 , , p ˜ } . Note that
E k 0 = j = 1 p W j = j = 1 p ˜ W ˜ j = t = 1 N i = 1 m ˜ t s = 1 p ˜ t i W ˜ t s , i i = 1 q ˜ t s = p ˜ t i + 1 p ˜ t i + h ˜ t i W ˜ t s , i .
Let G ˜ = ( V ˜ , E ˜ ) be a GIFS of contractions { f e } e E ˜ , where V ˜ = { 1 , , p ˜ } , E ˜ E , and { W ˜ j } j = 1 p ˜ is an invariant family under G ˜ . For any e E E ˜ , f e ( W t s , i ) W t s , i . Note that there exist W ˜ t s , i and W ˜ t s , i such that W t s , i W ˜ t s , i and W t s , i W ˜ t s , i . Hence, e E ˜ . Therefore, we have E E ˜ E ˜ and
i , j = 1 p e E i , j f e ( W j ) = i , j = 1 p ˜ e E ˜ i , j f e ( W ˜ j ) .
By induction, for all q 1 , we have
i , j = 1 p e E q i , j f e ( W j ) = i , j = 1 p ˜ e E ˜ q i , j f e ( W ˜ j ) .
Therefore, G ˜ = ( V ˜ , E ˜ ) is a simplified GIFS associated with G.
Among all simplified GIFSs that have been constructed by the above process, we first select the subcollection with the smallest number of vertices. Then, among members of this subcollection, we further select the subfamily with the smallest number of contractions. Members of this subfamily are minimal simplified GIFSs associated with G, denoted G ^ = ( V ^ , E ^ ) .  □

5. Hausdorff Dimension of Graph Self-Similar Sets Without Overlaps

In this section, we give the definition of the graph open set condition (GOSC) and prove Theorems 2 and 3. Moreover, we give an example of an IRS that satisfies the conditions of Theorem 3 and compute the Hausdorff dimension of the corresponding attractor.
Definition 8. 
Let X be a complete metric space. Let { f t } t = 1 m be an IFS of contractions on X. We say that { f t } t = 1 m satisfies the open set condition (OSC) if there exists a nonempty bounded open set U on X such that
t = 1 m f t ( U ) U and f t 1 ( U ) f t 2 ( U ) = Ø for t 1 t 2 .
Definition 9. 
Let X be a complete metric space. Let G = ( V , E ) be a GIFS of contractions { f e } e E on X. We say that G satisfies the graph open set condition (GOSC) if there exists a family { U i } i = 1 m of nonempty bounded open sets on X such that for all i { 1 , , m } ,
(a) 
e E i , j f e ( U j ) U i ;
(b) 
f e ( U j 1 ) f e ( U j 2 ) = Ø , for all distinct e E i , j 1 and e E i , j 2 .
Definition 10. 
Let X be a complete metric space, and let { R t } t = 1 N be an IRS on a nonempty compact subset of X. Assume that there exists a GIFS G associated with { R t } t = 1 N , and assume that G consists of contractions. If G satisfies (GOSC), then we say that { R t } t = 1 N satisfies (GOSC) with respect to G. If G does not satisfy (GOSC), then we say that { R t } t = 1 N has overlaps with respect to G.
Let G = ( V , E ) be a GIFS of contractions { f e } e E on X. For any e E i , j , let ρ e be the contraction ratio of f e . Recall that an incidence matrix A α associated with G is an m × m matrix defined by
A α = [ ρ e α ] m × m ,
where for i , j V and e E i , j , ρ e = 0 .
We can now use the results in Section 4 to prove Theorem 2.
Proof of Theorem 2.
By Proposition 3, we know that G and { R t } t = 1 N have the same attractor. If G satisfies (GOSC), then G satisfies (GFTC). The proof follows by using the results of Theorem 1.6 in [6]; we omit the details.  □
For a connected Riemannian n-manifold, we denote the Riemannian distance by d M ( · , · ) . For ϵ > 0 , let
B ( p , ϵ ) : = { q M : d M ( p , q ) < ϵ } , p M .
Definition 11. 
Let M be a Riemannian n-manifold. A measure μ on M is said to satisfy a general doubling condition if there exist constants C ( 0 , ) and L ( 0 , + ] such that for any p M and any r , R satisfying 0 < r < R < L , one has
μ ( B ( p , R ) ) C R r n μ ( B ( p , r ) ) .
C is called a general doubling constant. If L = , we get the standard doubling condition.
Theorem 7.
(Bishop–Gromov volume comparison theorem, see, e.g., [21,22].) Let M be a complete n-dimensional Riemannian manifold whose Ricci curvature satisfies Ric ( n 1 ) ξ for some ξ R . Then
r Vol ( B ( p , r ) ) V ( ξ , n , r )
is a non-increasing function whose limit is 1 as r 0 , where V ( ξ , n , r ) denotes the volume of a ball of radius r in the constant curvature space form S ξ n .
By using Theorem 7, we have the following corollary.
Corollary 1. 
Let M be a complete n-dimensional Riemannian manifold whose Ricci curvature satisfies Ric ( n 1 ) ξ for some ξ R . Then the Riemannian volume measure in M satisfies a general doubling condition.
Proof. 
The proof of Corollary 1 is similar to that of the Remark on p. 7 in [23] and is omitted.  □
Lemma 1. 
Let M be a complete n-dimensional Riemannian manifold whose Ricci curvature satisfies Ric ( n 1 ) ξ for some ξ R . Let Ω M be a bounded open set. Let { V i } be a collection of disjoint open subsets of Ω such that each V i contains a ball of radius a 1 r and is contained in a ball of radius a 2 r . Then there exists a constant C such that any ball B of radius r diam ( Ω ) / ( 2 ( 1 + 2 a 2 ) ) intersects at most C of the V i ¯ .
Proof. 
We first claim that # { V i } = : N < . Suppose N = . Note that for any i,
B ( p i , a 1 r / 2 ) ¯ B ( p i , a 1 r ) V i .
Since the V i are disjoint, i = 1 B ( p i , a 1 r / 2 ) ¯ = i = 1 B ( p i , a 1 r / 2 ) ¯ is compact with { B ( p i , a 1 r ) } i = 1 being an open cover. By compactness, there exists a finite subcover { B ( p i k , a 1 r ) } k = 1 L . This is clearly a contradiction, and the claim is proved. Now let
Vol ( B ( p * , a 1 r ) ) : = min 1 i < N { Vol ( B ( p i , a 1 r ) ) } ,
where B ( p i , a 1 r ) V i . Suppose B ( p , r ) V ¯ i Ø . Then V i is contained in a ball concentric with B ( p , r + 2 a 2 r ) . Let q be the number of V i such that B ( p , r ) V ¯ i Ø and denote these V i ’s by V i 1 , , V i q . By summing volumes and using (24), we get
q Vol ( B ( p * , a 1 r ) ) j = 1 q Vol ( B ( p i j , a 1 r ) ) j = 1 q Vol ( V ¯ i j ) Vol ( B ( p , ( 1 + 2 a 2 ) r ) ) .
Hence,
q Vol ( B ( p , ( 1 + 2 a 2 ) r ) ) Vol ( B ( p , a 1 r ) ) · Vol ( B ( p , a 1 r ) ) Vol ( B ( p * , a 1 r ) ) .
Let K Ω ¯ denote the sectional curvature on Ω ¯ . Then there exist constants k 1 , k 2 such that k 1 K Ω ¯ k 2 . It is well-known that if the sectional curvatures of M are less than or equal to k, then for every p M , we have
Vol ( B ( p , r ) ) V ( k , n , r )
for all r min { inj ( p ) , π / k } , where inj ( p ) is the injectivity radius of M at p (see, e.g., Theorem III.4.2 in [24]). Hence,
Vol ( B ( p * , r ) ) V ( k 2 , n , r ) .
Combining (25) and the Bishop–Gromov volume comparison theorem, we have
Vol ( B ( p , r ) ) Vol ( B ( p * , r ) ) V ( ξ , n , r ) V ( k 2 , n , r ) .
Using the Maclaurin series of V ( ξ , n , r ) and V ( k 2 , n , r ) , we have
lim r 0 V ( ξ , n , r ) V ( k 2 , n , r ) = 1 ξ 6 ( n + 2 ) r 2 + O ( r 4 ) 1 k 2 6 ( n + 2 ) r 2 + O ( r 4 ) = 1 ,
i.e., for any ε > 0 , there exists δ > 0 such that for r ( 0 , δ ) ,
| V ( ξ , n , r ) V ( k 2 , n , r ) 1 | < ε .
Hence, there exists a constant C 2 > 1 such that for r ( 0 , δ ) , V ( ξ , n , r ) / V ( k 2 , n , r ) C 2 , and thus for r ( 0 , δ / a 1 ) ,
Vol ( B ( p , a 1 r ) ) Vol ( B ( p * , a 1 r ) ) C 2 .
Next, we consider the following cases.
Case 1. ξ < 0 and k 2 > 0 . Note that
Vol ( B ( p , r ) ) Vol ( B ( p * , r ) ) V ( ξ , n , r ) V ( k 2 , n , r ) = ω n 0 r ( sinh ( ξ t ) ξ ) n 1 d t ω n 0 r ( sin ( k 2 t ) k 2 ) n 1 d t
(see, e.g., p. 128 of [24]). Let
f ( r ) : = δ r ( sinh ( ξ t ) ξ ) n 1 d t δ r ( sin ( k 2 t ) k 2 ) n 1 d t .
Then g 1 ( t , r ) : = sinh ( ξ t ) ξ and g 2 ( t , r ) : = sin ( k 2 t ) k 2 are continuous functions of t on [ δ , r ] . Since g 1 , g 2 are continuous functions of r, and
lim ξ 0 sinh ( ξ t ) ξ = 1 0 and lim k 2 0 sin ( k 2 t ) k 2 = 1 0 ,
we see that f ( r ) is a continuous function of r on [ δ , a 1 diam ( Ω ) 2 ( 1 + 2 a 2 ) ] . Hence, there exists a constant C 3 such that f ( r ) C 3 , and thus for r [ δ / a 1 , diam ( Ω ) 2 ( 1 + 2 a 2 ) ] ,
V ( B ( p , a 1 r ) ) V ( B ( p * , a 1 r ) ) C 3 .
Combining (26) and (27), for r ( 0 , diam ( Ω ) 2 ( 1 + 2 a 2 ) ] , we have
V ( B ( p , a 1 r ) ) V ( B ( p * , a 1 r ) ) C 4 ,
where C 4 : = max { C 2 , C 3 } . Combining Corollary 1 and (28), we have
q C 1 + 2 a 2 a 1 n C 4 : = C 1 ,
where C 1 is a constant. The following cases can be proved using similar methods:
ξ < 0 , k 2 < 0 ; ξ > 0 , k 2 > 0 ; ξ < 0 , k 2 < 0 ; ξ = 0 , k 2 > 0 ; ξ = 0 , k 2 < 0 ; ξ > 0 , k 2 = 0 ; ξ < 0 , k 2 = 0 .
Combining the above eight cases, we have q C for some constant C .  □
We can now use the results in Section 4 and Lemma 1 to prove Theorem 3.
Proof of Theorem 3.
Combining Proposition 3 and Definition 6, we know that G and G ^ have the same attractor. If G ^ satisfies (GOSC), then G ^ satisfies (GFTC). By using the results of Theorem 1.6 in [6], we can prove (a). As M is locally Euclidean, the sectional curvature and the Ricci curvature of M are everywhere zero. By using the results of Lemma 1 and a similar method as in [25], we can prove (b); we omit the details.  □
In the rest of this section, we construct an example of an IRS satisfying Theorem 3 and compute the Hausdorff dimension of the associated attractor.
Example 1. 
Let C 2 : = S 1 × R 1 = ( cos θ , sin θ , z ) : θ [ π , π ] , z [ 0 , 2 π ] be a cylindrical surface. Let E 0 : = C 2 . For r [ 0 , π / 2 ) , let x : = ( cos θ , sin θ , z ) E 0 , H : = { ( 1 , 0 , z ) : z [ 0 , 2 π ] } , and { R t } t = 1 3 be an IRS on E 0 defined as
R 1 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) , x E 0 H , { ( 0 , 1 , z / 2 + π / 2 ) , ( 0 , 1 , z / 2 + π / 2 ) } x H ; R 2 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π r ) , x E 0 H , { ( 0 , 1 , z / 2 + π r ) , ( 0 , 1 , z / 2 + π r ) } x H ; R 3 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + r ) , x E 0 H , { ( 0 , 1 , z / 2 + r ) , ( 0 , 1 , z / 2 + r ) } x H .
Let K be the associated attractor (see Figure 1). Then
dim H ( K ) = log 3 log 2 = 1.58496
Proof of Example 1.
For any t { 1 , 2 , 3 } , by the definition of R t , we have H t 1 = H t : = { ( 1 , 0 , z ) : z [ 0 , 2 π ] } . Let r t : = R t | H t and r t ( H t ) = l = 1 2 h t l , 1 ( H t 1 ) . Then for any x H t 1 ,
h 1 1 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 1 2 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 2 1 , 1 ( x ) = ( 0 , 1 , z / 2 + π r ) , h 2 2 , 1 ( x ) = ( 0 , 1 , z / 2 + π r ) , h 3 1 , 1 ( x ) = ( 0 , 1 , z / 2 + r ) , h 3 2 , 1 ( x ) = ( 0 , 1 , z / 2 + r ) .
For any t { 1 , 2 , 3 } , let
J t 1 : = ( cos θ , sin θ , z ) : θ ( π , 0 ] , z [ 0 , 2 π ] and J t 2 : = ( cos θ , sin θ , z ) : θ ( 0 , π ) , z [ 0 , 2 π ] .
Then E 0 H t = i = 1 2 J t i . Let r ˜ t : = R t | E 0 H t and r ˜ t ( E 0 H t ) = i = 1 2 h t 0 , i ( J t i ) . Then for any x J t i , where i { 1 , 2 } ,
h 1 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) , h 2 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π r ) , h 3 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + r ) .
Hence, for any t { 1 , 2 , 3 } , h t l , 1 are contractions, where l { 1 , 2 } , and h t 0 , i are contractions, where i { 1 , 2 } . Moreover, for t = 1 , we have
h t 1 , 1 ( H t ) ¯ J t 2 ¯ , h t 2 , 1 ( H t ) ¯ J t 1 ¯ , h t 0 , 1 ( J t 1 ) ¯ J t 2 ¯ , h t 0 , 2 ( J t 2 ) ¯ J t 1 ¯ ;
for any t { 2 , 3 } , we have
h t 1 , 1 ( H t ) ¯ J t 1 ¯ , h t 2 , 1 ( H t ) ¯ J t 2 ¯ , h t 0 , i ( J t i ) ¯ J t i ¯ , where i { 1 , 2 } .
Hence, { R t } t = 1 3 satisfies the conditions of Theorem 6. By Theorem 6 and Proposition 5, we can find a minimal simplified GIFS G ^ = ( V ^ , E ^ ) with V ^ = { 1 , , 6 } and E ^ = { e 1 , , e 18 } (see Figure 2).
The invariant family { W ^ i } i = 1 6 is defined as
W ^ 1 : = { ( cos θ , sin θ , z ) : θ [ π , π / 2 ] , z [ π / 2 , 3 π / 2 ] } , W ^ 2 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , 0 ] , z [ π r , 2 π r ] } , W ^ 3 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , 0 ] , z [ r , π + r ] } , W ^ 4 : = { ( cos θ , sin θ , z ) : θ [ 0 , π / 2 ] , z [ π r , 2 π r ] } , W ^ 5 : = { ( cos θ , sin θ , z ) : θ [ 0 , π / 2 ] , z [ r , π + r ] } , W ^ 6 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , π ] , z [ π / 2 , 3 π / 2 ] } ,
while E ^ i , j , i , j { 1 , , 6 } , and the associated similitudes { f e } e E ^ are defined as
e 1 E ^ 1 , 4 , e 2 E ^ 1 , 5 , e 3 E ^ 1 , 6 , e 4 E ^ 2 , 1 , e 5 E ^ 2 , 2 , e 6 E ^ 2 , 3 , e 7 E ^ 3 , 1 , e 8 E ^ 3 , 2 , e 9 E ^ 3 , 3 , e 10 E ^ 4 , 4 , e 11 E ^ 4 , 5 , e 12 E ^ 4 , 6 , e 13 E ^ 5 , 4 , e 14 E ^ 5 , 5 , e 15 E ^ 5 , 6 , e 16 E ^ 6 , 1 , e 17 E ^ 6 , 2 , e 18 E ^ 6 , 3 ,
and
f e 1 : = h ˜ 1 0 , 2 | W ^ 4 , f e 2 : = h ˜ 1 0 , 2 | W ^ 5 , f e 3 : = h ˜ 1 0 , 2 | W ^ 6 , f e 4 : = h ˜ 2 0 , 1 | W ^ 1 , f e 5 : = h ˜ 2 0 , 1 | W ^ 2 , f e 6 : = h ˜ 2 0 , 1 | W ^ 3 , f e 7 : = h ˜ 3 0 , 1 | W ^ 1 , f e 8 : = h ˜ 3 0 , 1 | W ^ 2 , f e 9 : = h ˜ 3 0 , 1 | W ^ 3 , f e 10 : = h ˜ 2 0 , 2 | W ^ 4 , f e 11 : = h ˜ 2 0 , 2 | W ^ 5 , f e 12 : = h ˜ 2 0 , 2 | W ^ 6 , f e 13 : = h ˜ 3 0 , 2 | W ^ 4 , f e 14 : = h ˜ 3 0 , 2 | W ^ 5 , f e 15 : = h ˜ 3 0 , 2 | W ^ 6 , f e 16 : = h ˜ 1 0 , 1 | W ^ 1 , f e 17 : = h ˜ 1 0 , 1 | W ^ 2 , f e 18 : = h ˜ 1 0 , 1 | W ^ 3 ,
where h ˜ t l , i and h ˜ t 0 , i are defined as in (6) and (12), respectively.
Note that G ^ is strongly connected. Let
W ̲ 1 : = { ( cos θ , sin θ , z ) : θ ( π , π / 2 ) , z ( π / 2 + r , 3 π / 2 r ) } , W ̲ 2 : = { ( cos θ , sin θ , z ) : θ ( π / 2 , 0 ) , z ( 3 π / 2 2 r , 2 π 2 r ) } , W ̲ 3 : = { ( cos θ , sin θ , z ) : θ ( π / 2 , 0 ) , z ( 2 r , 2 r + π / 2 ) } , W ̲ 4 : = { ( cos θ , sin θ , z ) : θ ( 0 , π / 2 ) , z ( 3 π / 2 2 r , 2 π 2 r ) } , W ̲ 5 : = { ( cos θ , sin θ , z ) : θ ( 0 , π / 2 ) , z ( 2 r , 2 r + π / 2 ) } , W ̲ 6 : = { ( cos θ , sin θ , z ) : θ ( π / 2 , π ) , z ( π / 2 + r , 3 π / 2 r ) } .
Let
K ˜ i = j = 1 6 e E ^ i , j f e ( K ˜ j ) .
Then for i { 1 , , 6 } , U i : = W ̲ i K ˜ i is an open set. For all i { 1 , , 6 } , { f e } e E ^ satisfies
e E ^ i , j f e ( U j ) U i and f e 1 ( U j 1 ) f e 2 ( U j 2 ) = Ø , for e 1 E ^ i , j 1 and e 2 E ^ i , j 2 .
Hence, G ^ satisfies (GOSC). The weighted incidence matrix associated with G ^ is
A α = 1 2 α 0 0 0 1 1 1 1 1 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 1 1 1 1 1 1 0 0 0 .
The spectral radius of A ^ α is 3 ( 1 / 2 ) α . Therefore,
dim H ( K ) = log 3 log 2 = 1.58496

6. Hausdorff Dimension of Graph Self-Similar Sets with Overlaps

In this section, we study IRSs with overlaps (see Definition 10). We give the definition of the graph finite type condition (GFTC) and prove Theorems 4–5. Moreover, we illustrate our method for computing the Hausdorff dimension of the associated attractors using several examples.

6.1. Graph Finite Type Condition

For detailed definitions of the notation in this section, especially the definition of a sequence of nested index sets, the reduced graph, and the neighborhood of a vertex in the reduced graph, we refer the reader to [6,14]. Here we only give a very brief summary. Let G = ( V , E ) be a GIFS as described in Section 4. Let { M k } k = 0 be a sequence of nested index sets (see [14]), where M k E * and E * is defined as in Section 4. For i , j { 1 , , m } , let
M k i , j : = M k q 1 E q i , j = e = ( e 1 , , e q ) M k : e E q i , j for some q 1 .
Then M k = i , j = 1 m M k i , j . For e M k i , j , let f e : = f e 1 f e q , where each f e i is a contraction on G. Define
V k i , j : = ( f e , i , j , k ) , e M k i , j for i , j = 1 , , m , and V k : = i , j = 1 m V k i , j for k 1 .
For e M k i , j , we call ( f e , i , j , k ) a vertex and V : = k 0 V k the vertex set. Define a graph G : = ( V , E ) , where E is the set of all directed edges of V . Let G R = ( V R , E R ) be the reduced graph of G (see, e.g., [14] for the construction of G R ). Let G ^ : = ( V ^ , E ^ ) be a minimal simplified GIFS associated with G . We can use a similar method to construct a corresponding reduced GIFS G ^ R : = ( V ^ R , E ^ R ) . Two vertices v V k and v V k are equivalent, denoted v v , if # N ( v ) = # N ( v ) , where N ( v ) is a neighborhood of v (see, e.g., [14]), and τ = f v f v 1 : M M induces a bijection g τ : N ( v ) N ( v ) , which is defined as
g τ ( f u , i , j , k ) = ( τ f u , i , j , k ) ,
and satisfies the following conditions:
(a)
In (29), j = j .
(b)
For u N ( v ) and u N ( v ) satisfying g τ ( u ) = u , and for any integer l 1 , a directed path e E * satisfies ( f u f e , k + l ) V k + l if and only if it satisfies ( f u f e , k + l ) V k + l .
Let [ v ] denote the equivalence class of v . We call [ v ] the neighborhood type of v (with respect to U ), where U : = { U i } i = 1 m is an invariant family under G.
Definition 12. 
Let X be a complete metric space. Let G = ( V , E ) be a GIFS of contractions { f e } e E on X, where V = { 1 , , m } . If there exists an invariant family of nonempty bounded open sets U = { U i } i = 1 m with respect to some sequence of nested index sets { M k } k = 0 such that # V / : = { [ v ] U , v V } is a finite set, where ∼ is an equivalence relation on V , then we say that G = ( V , E ) satisfies the graph finite type condition (GFTC). We say that U is a finite type condition family.
Definition 13. 
Let X be a complete metric space. Let { R t } t = 1 N be an IRS on a nonempty compact subset of X. Assume that there exists a GIFS G associated with { R t } t = 1 N , and assume that G consists of contractions. If G satisfies (GFTC), then we say that { R t } t = 1 N satisfies (GFTC) with respect to G.
The following theorem is a direct generalization of Theorem 2.7 in [26]; it provides a sufficient condition for a GIFS to satisfy the finite type condition. Recall that an algebraic integer β > 1 is called a Pisot number if all of its algebraic conjugates are in modulus strictly less than one.
Theorem 8. 
Let M be a complete smooth n-dimensional Riemannian manifold that is locally Euclidean. Let G = ( V , E ) be a GIFS of contractive similitudes { f e } e E on M. Let { W i } i = 1 m be an invariant family of nonempty compact sets, and let U : = { U i } i = 1 m be an invariant family of nonempty bounded open sets with U ¯ i = W i , i = 1 , , m . For each similitude f e , e E , assume that there exists an isometry
g i : U i U i R n
such that for any e E , f e : = g i f e g i 1 is contractive similitude of the form
f e ( x ) = β n e R e ( x ) + b e ,
where E is a set of directed edges, β > 1 is a Pisot number, n e is a positive integer, R e is an orthogonal transformation, and b e R n . Assume that { R e } e E generates a finite group H and
H { b e | e E } r 1 Z [ β ] × × r n Z [ β ]
for some r 1 , , r n R . Then G is of finite type, and U is a finite type condition family of G.
Proof. 
By the assumptions, we let V : = { 1 , , m } be a set of vertices. Then G : = ( V , E ) is a GIFS of contractive similitudes { f e } e E on R n , and U : = { U i } i = 1 m is an invariant family of nonempty bounded open sets for G . By the results of Theorem 2.7 in [26], we have G is of finite type and U is a finite type condition family for G . Let v : = ( f e , i , j , k ) V be a vertex, e M ˜ k i , j , 1 i , j m , k 1 , and M ˜ k i , j ( E ) * is a sequence of nested index sets. Then { [ v ] U , v V } is a finite set. Let v : = ( f e , i , j , k ) V , where e M k i , j , 1 i , j m , and M k i , j E * is a sequence of nested index sets. It follows from the definition of f e that { [ v ] U , v V } = { [ v ] U , v V } is a finite set. This proves the proposition.  □
We let T 1 , , T m denote the collection of all distinct neighborhood types, with [ v root i ] , i = 1 , , m , being the neighborhood types of the root vertices. As in [14], for each α 0 , we define a weighted incidence matrix  A α = ( A α ( i , j ) ) i , j = 1 m as follows. Fix i ( 1 i m ) and a vertex v V R such that [ v ] = T i , let u 1 , , u m be the offspring of v in V R , and let k l , 1 l m , be the unique edge in G R connecting v to u l . Then we define
A α ( i , j ) : = { ρ k l α : v k l u l , [ u l ] = T j } .
Now we are ready to prove Theorems 4 and 5, which are stated in Section 2.
Proof f Theorem 4.
By Proposition 3, we know that G and { R t } t = 1 N have the same attractor. The proof follows by using the results of Theorem 1.6 in [6]; we omit the details.  □
Proof of Theorem 5.
Combining Proposition 3 and Definition 6, we know that the attractor of G is equal to that of G ^ . The proof follows by using the results of Theorem 4.  □

6.2. Examples

In this subsection, we give three examples of IRSs with overlaps that satisfy (GFTC).
Example 2. 
Let C 2 = ( cos θ , sin θ , z ) : θ [ π , π ] , z [ 0 , 2 π ] be a cylindrical surface. Let E 0 : = C 2 . For r [ 0 , π / 2 ) , we let x : = ( cos θ , sin θ , z ) and let { R t } t = 1 4 be an IRS on E 0 defined as
R 1 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) x E 0 { ( 1 , 0 , z ) : z [ 0 , 2 π ] } , { ( 0 , 1 , z / 2 + π / 2 ) , ( 0 , 1 , z / 2 + π / 2 ) } x { ( 1 , 0 , z ) : z [ 0 , 2 π ] } ; R 2 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π r ) x E 0 { ( 1 , 0 , z ) : z [ 0 , 2 π ] } , { ( 0 , 1 , z / 2 + π r ) , ( 0 , 1 , z / 2 + π r ) } x { ( 1 , 0 , z ) : z [ 0 , 2 π ] } ; R 3 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) x E 0 { ( 1 , 0 , z ) : z [ 0 , 2 π ] } , { ( 0 , 1 , z / 2 + π / 2 ) , ( 0 , 1 , z / 2 + π / 2 ) } x { ( 1 , 0 , z ) : z [ 0 , 2 π ] } ; R 4 ( x ) : = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + r ) x E 0 { ( 1 , 0 , z ) : z [ 0 , 2 π ] } , { ( 0 , 1 , z / 2 + r ) , ( 0 , 1 , z / 2 + r ) } x { ( 1 , 0 , z ) : z [ 0 , 2 π ] } .
Let K be the associated attractor (see Figure 3). Then
dim H ( K ) = log ( 2 + 2 ) log 2 = 1.77155
Proof of Example 2.
For any t { 1 , , 4 } , by the definition of R t , we have H t 1 = H t : = { ( 1 , 0 , z ) : z [ 0 , 2 π ] } . Let r t : = R t | H t and r t ( H t ) = l = 1 2 h t l , 1 ( H t 1 ) . Then for any x H t 1 ,
h 1 1 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 1 2 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 2 1 , 1 ( x ) = ( 0 , 1 , z / 2 + π r ) , h 2 2 , 1 ( x ) = ( 0 , 1 , z / 2 + π r ) , h 3 1 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 3 2 , 1 ( x ) = ( 0 , 1 , z / 2 + π / 2 ) , h 4 1 , 1 ( x ) = ( 0 , 1 , z / 2 + r ) , h 4 2 , 1 ( x ) = ( 0 , 1 , z / 2 + r ) .
For any t { 1 , , 4 } , by the definition of R t , we have
J t 1 : = ( cos θ , sin θ , z ) : θ ( π , 0 ] , z [ 0 , 2 π ] a n d J t 2 : = ( cos θ , sin θ , z ) : θ ( 0 , π ) , z [ 0 , 2 π ] .
Hence, E 0 H t = i = 1 2 J t i . Let r ˜ t : = R t | E 0 H t and r ˜ t ( E 0 H t ) = i = 1 2 h t 0 , i ( J t i ) . Then for any x J t i , where i { 1 , 2 } ,
h 1 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) , h 2 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π r ) , h 3 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + π / 2 ) , h 4 0 , i ( x ) = ( cos ( θ / 2 ) , sin ( θ / 2 ) , z / 2 + r ) .
Hence, for any t { 1 , , 4 } and l { 1 , 2 } , h t l , 1 are contractions, and for any i { 1 , 2 } , h t 0 , i are contractions. Moreover, for t = 1 , we have
h t 1 , 1 ( H t ) ¯ J t 2 ¯ , h t 2 , 1 ( H t ) ¯ J t 1 ¯ , h t 0 , 1 ( J t 1 ) ¯ J t 2 ¯ , h t 0 , 2 ( J t 2 ) ¯ J t 1 ¯ ;
for any t { 2 , 3 , 4 } ,
h t 1 , 1 ( H t ) ¯ J t 1 ¯ , h t 2 , 1 ( H t ) ¯ J t 2 ¯ , h t 0 , i ( J t i ) ¯ J t i ¯ , where i { 1 , 2 } .
Hence, { R t } t = 1 4 satisfies the conditions of Theorem 6. By Theorem 6 and Proposition 5, we can find a minimal simplified GIFS G ^ = ( V ^ , E ^ ) with V ^ = { 1 , , 8 } and E ^ = { e 1 , , e 32 } (see Figure 4).
The invariant family { W ^ i } i = 1 8 , the set of edges E ^ i , j and the associated similitudes { f e } e E ^ are defined as
W ^ 1 : = { ( cos θ , sin θ , z ) : θ [ π , π / 2 ] , z [ π / 2 , 3 π / 2 ] } , W ^ 2 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , 0 ] , z [ π r , 2 π r ] } , W ^ 3 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , 0 ] , z [ π / 2 , 3 π / 2 ] } , W ^ 4 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , 0 ] , z [ r , π + r ] } W ^ 5 : = { ( cos θ , sin θ , z ) : θ [ 0 , π / 2 ] , z [ π r , 2 π r ] } , W ^ 6 : = { ( cos θ , sin θ , z ) : θ [ 0 , π / 2 ] , z [ π / 2 , 3 π / 2 ] } , W ^ 7 : = { ( cos θ , sin θ , z ) : θ [ 0 , π / 2 ] , z [ r , π + r ] } , W ^ 8 : = { ( cos θ , sin θ , z ) : θ [ π / 2 , π ] , z [ π / 2 , 3 π / 2 ] } ,
e 1 E ^ 1 , 5 , e 2 E ^ 1 , 6 , e 3 E ^ 1 , 7 , e 4 E ^ 1 , 8 , e 5 E ^ 2 , 1 , e 6 E ^ 2 , 2 , e 7 E ^ 2 , 3 , e 8 E ^ 2 , 4 , e 9 E ^ 3 , 1 , e 10 E ^ 3 , 2 , e 11 E ^ 3 , 3 , e 12 E ^ 3 , 4 , e 13 E ^ 4 , 1 , e 14 E ^ 4 , 2 , e 15 E ^ 4 , 3 , e 16 E ^ 4 , 4 , e 17 E ^ 5 , 5 , e 18 E ^ 5 , 6 , e 19 E ^ 5 , 7 , e 20 E ^ 5 , 8 , e 21 E ^ 6 , 5 , e 22 E ^ 6 , 6 , e 23 E ^ 6 , 7 , e 24 E ^ 6 , 8 , e 25 E ^ 7 , 5 , e 26 E ^ 7 , 6 , e 27 E ^ 7 , 7 , e 28 E ^ 7 , 8 , e 29 E ^ 8 , 1 , e 30 E ^ 8 , 2 , e 31 E ^ 8 , 3 , e 32 E ^ 8 , 4 ,
and
f e 1 : = h ˜ 1 0 , 2 | W ^ 5 , f e 2 : = h ˜ 1 0 , 2 | W ^ 6 , f e 3 : = h ˜ 1 0 , 2 | W ^ 7 , f e 4 : = h ˜ 1 0 , 2 | W ^ 8 , f e 5 : = h ˜ 2 0 , 1 | W ^ 1 , f e 6 : = h ˜ 2 0 , 1 | W ^ 2 , f e 7 : = h ˜ 2 0 , 1 | W ^ 3 , f e 8 : = h ˜ 2 0 , 1 | W ^ 4 , f e 9 : = h ˜ 3 0 , 1 | W ^ 1 , f e 10 : = h ˜ 3 0 , 1 | W ^ 2 , f e 11 : = h ˜ 3 0 , 1 | W ^ 3 , f e 12 : = h ˜ 3 0 , 1 | W ^ 4 , f e 13 : = h ˜ 4 0 , 1 | W ^ 1 , f e 14 : = h ˜ 4 0 , 1 | W ^ 2 , f e 15 : = h ˜ 4 0 , 1 | W ^ 3 , f e 16 : = h ˜ 4 0 , 1 | W ^ 4 , f e 17 : = h ˜ 2 0 , 2 | W ^ 5 , f e 18 : = h ˜ 2 0 , 2 | W ^ 6 , f e 19 : = h ˜ 2 0 , 2 | W ^ 7 , f e 20 : = h ˜ 2 0 , 2 | W ^ 8 , f e 21 : = h ˜ 3 0 , 2 | W ^ 5 , f e 22 : = h ˜ 3 0 , 2 | W ^ 6 , f e 23 : = h ˜ 3 0 , 2 | W ^ 7 , f e 24 : = h ˜ 3 0 , 2 | W ^ 8 , f e 25 : = h ˜ 4 0 , 2 | W ^ 5 , f e 26 : = h ˜ 4 0 , 2 | W ^ 6 , f e 27 : = h ˜ 4 0 , 2 | W ^ 7 , f e 28 : = h ˜ 4 0 , 2 | W ^ 8 , f e 29 : = h ˜ 1 0 , 1 | W ^ 1 , f e 30 : = h ˜ 1 0 , 1 | W ^ 2 , f e 31 : = h ˜ 1 0 , 1 | W ^ 3 , f e 32 : = h ˜ 1 0 , 1 | W ^ 4 ,
where h ˜ t l , i and h ˜ t 0 , i are defined as in (6) and (12), respectively. Let { U i } i = 1 8 be an invariant family of nonempty bounded open sets with U ¯ i = W ^ i for i { 1 , , 8 } . By Theorem 8, G ^ is of finite type.
For convenience, we let f e i : = f i , i { 1 , , 32 } . Let M k : = { 1 , , 32 } k for k 0 . Let T 1 , , T 8 be the neighborhood types of the root neighborhoods [ U 1 ] , , [ U 8 ] , respectively. All neighborhood types are generated after two iterations. To construct the weighted incidence matrix in the minimal simplified reduced GIFS G ^ R . We note that
V 1 = { ( f 1 , 1 ) , , ( f 32 , 1 ) } .
Denote by v 1 , , v 32 the vertices in V 1 according to the above order. Then
[ v 5 ] = [ v 9 ] = [ v 13 ] = [ v 29 ] = T 1 and [ v 4 ] = [ v 20 ] = [ v 24 ] = [ v 28 ] = T 2 .
Let
T 9 : = [ v 6 ] = [ v 10 ] = [ v 14 ] = [ v 30 ] , T 10 : = [ v 7 ] = [ v 11 ] = [ v 15 ] = [ v 31 ] , T 11 : = [ v 8 ] = [ v 12 ] = [ v 16 ] = [ v 32 ] , T 12 : = [ v 1 ] = [ v 17 ] = [ v 21 ] = [ v 25 ] , T 13 : = [ v 2 ] = [ v 18 ] = [ v 22 ] = [ v 26 ] , T 14 : = [ v 3 ] = [ v 19 ] = [ v 23 ] = [ v 27 ] .
Then
T 1 T 2 + T 12 + T 13 + T 14 , T 2 T 1 + T 9 + T 10 + T 11 , T 3 T 1 + T 9 + T 10 + T 11 , T 4 T 1 + T 9 + T 10 + T 11 , T 5 T 2 + T 12 + T 13 + T 14 , T 6 T 2 + T 12 + T 13 + T 14 , T 7 T 2 + T 12 + T 13 + T 14 , T 8 T 1 + T 9 + T 10 + T 11 .
Since f 6 f 8 = f 7 f 6 , the edge e 6 e 8 is removed in G ^ R . v 6 generates three offspring
( f 6 f 5 , 2 ) , ( f 6 f 6 , 2 ) , ( f 6 f 7 , 2 ) V 2 ,
where [ ( f 6 f 5 , 2 ) ] = T 1 , [ ( f 6 f 6 , 2 ) ] = T 9 and [ ( f 6 f 7 , 2 ) ] = T 10 . Hence,
T 9 T 1 + T 9 + T 10 .
As f 7 f 8 = f 8 f 6 , the edge e 7 e 8 is removed in G ^ R . v 7 generates three offspring
( f 7 f 5 , 2 ) , ( f 7 f 6 , 2 ) , ( f 7 f 7 , 2 ) V 2 ,
with [ ( f 7 f 5 , 2 ) ] = T 1 , [ ( f 7 f 6 , 2 ) ] = T 9 and [ ( f 7 f 7 , 2 ) ] = T 10 . Thus
T 10 T 1 + T 9 + T 10 .
v 8 generates four offspring
( f 8 f 5 , 2 ) , ( f 8 f 6 , 2 ) , ( f 8 f 7 , 2 ) , ( f 8 f 8 , 2 ) V 2 ,
where [ ( f 8 f 5 , 2 ) ] = T 1 , [ ( f 8 f 6 , 2 ) ] = T 9 , [ ( f 8 f 7 , 2 ) ] = T 10 and [ ( f 8 f 8 , 2 ) ] = T 11 . Therefore,
T 11 T 1 + T 9 + T 10 + T 11 .
Using the same argument, we have
T 12 T 2 + T 12 + T 13 , T 13 T 2 + T 12 + T 13 , T 14 T 2 + T 12 + T 13 + T 14 .
Since no new neighborhood types are generated, we conclude that the G ^ R is of finite type. The weighted incidence matrix is
A ^ α = 1 2 α 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 .
The spectral radius λ ^ α of A ^ α is ( 2 + 2 ) / 2 α , and by Theorem 5,
dim H ( K ) = α = 1.77155 ,
where α is the unique solution of the equation λ ^ α = 1 .  □
The following remark explains why the computation of Example 2 is nontrivial, even thought the cylinder is locally Euclidean.
Remark 1. 
Let E 0 , { R t } t = 1 4 , and K be defined as in Example 2.
(1) 
There does not exist a global bi-Lipschitz map f : K f ( K ) [ 0 , 2 π ] × [ 0 , 2 π ] R 2 such that dim H ( K ) = dim H ( f ( K ) ) .
(2) 
Let F : = B R 2 ( 0 , 2 ) ¯ B R 2 ( 0 , 1 ) . One may try to construct a bi-Lipschitz map f : K f ( K ) F R 2 , where f : C 2 F . As f ( K ) might not be a self-similar set, it is not clear how to compute the Hausdorff dimension of f ( K ) .
(3) 
If K is has a neighborhood U C 2 on which there exists a local isometry mapping U to R n , then the problem is much easier; however, this is not the case for Example 2. In fact, although K can be covered by finitely or countably many coordinate charts and then pulled into the Euclidean space by isometries, the image of K in R n lacks a well-defined structure, and it is not clear how to find an IFS that generates it.
The following example is from Example 7.6 in [6]. Here, we use the method in the present paper to compute the Hausdorff dimension of the same fractal. The method here is more systematic.
Example 3. 
Let T 2 : = S 1 × S 1 be a flat 2-torus, viewed as [ 0 , 1 ] × [ 0 , 1 ] with opposite sides identified, and T 2 be endowed with the Riemannian metric induced from R 2 . We consider the following IFS with overlaps on R 2 :
g 1 ( x ) = 1 2 x + 0 , 1 4 , g 2 ( x ) = 1 2 x + 1 4 , 1 4 , g 3 ( x ) = 1 2 x + 1 2 , 1 4 , g 4 ( x ) = 1 2 x + 1 4 , 3 4 .
Let H : = ( { 0 } × [ 0 , 1 ] ) [ 0 , 1 ] × { 0 } . Iterations of { g t } t = 1 4 induce an IRS { R t } t = 1 4 on E 0 : = T 2 = R 2 / Z 2 , defined as
R 1 ( x ) : = 1 2 x + 0 , 1 4 , x E 0 H , 1 2 x + 0 , 1 4 , 1 2 x + 1 2 , 1 4 x { 0 } × [ 0 , 1 ] , 1 2 x + 0 , 1 4 , 1 2 x + 0 , 3 4 x [ 0 , 1 ] × { 0 } ; R 2 ( x ) : = 1 2 x + 1 4 , 1 4 , x E 0 H , 1 2 x + 1 4 , 1 4 , 1 2 x + 3 4 , 1 4 x { 0 } × [ 0 , 1 ] , 1 2 x + 1 4 , 1 4 , 1 2 x + 1 4 , 3 4 x [ 0 , 1 ] × { 0 } ;
R 3 ( x ) : = 1 2 x + 1 2 , 1 4 , x E 0 H , 1 2 x + 1 2 , 1 4 , 1 2 x + 1 , 1 4 x { 0 } × [ 0 , 1 ] , 1 2 x + 1 2 , 1 4 , 1 2 x + 1 2 , 3 4 x [ 0 , 1 ] × { 0 } ; R 4 ( x ) : = 1 2 x + 1 4 , 3 4 , x E 0 H , 1 2 x + 1 4 , 3 4 , 1 2 x + 3 4 , 3 4 x { 0 } × [ 0 , 1 / 2 ] , 1 2 x + 1 4 , 1 4 , 1 2 x + 3 4 , 1 4 x { 0 } × [ 1 / 2 , 1 ] , 1 2 x + 1 4 , 1 4 , 1 2 x + 1 4 , 3 4 x [ 0 , 1 ] × { 0 } .
Let K be the associated attractor. Then
dim H ( K ) = log ( 2 + 2 ) log 2 = 1.77155
Proof of Example 3.
The proof of this example is similar to that of Example 2; we only give an outline.
First, for any t { 1 , , 4 } , by the definition of R t , we let H t 1 = { 0 } × [ 0 , 1 / 2 ] , H t 2 = { 0 } × ( 1 / 2 , 1 ] , and H t 3 = [ 0 , 1 ] × { 0 } . Then H t = i = 1 3 H t i . Let r t : = R t | H t . Then r t ( H t ) = l = 1 2 i = 1 3 h t l , i ( H t i ) . For any t { 1 , , 4 } , let
J t 1 : = [ 0 , 1 ] × [ 0 , 1 / 2 ] and J t 2 : = [ 0 , 1 ] × [ 1 / 2 , 1 ] .
Hence, E 0 H t = i = 1 2 J t i . Let r ˜ t : = R t | E 0 H t . Then r ˜ t ( E 0 H t ) = i = 1 2 h t 0 , i ( J t i ) . We can show that for any t { 1 , , 4 } , h t l , i are contractions, where l , i { 1 , 2 } , and that for i { 1 , 2 } , h t 0 , i are contractions. Moreover, there exist α , β { 1 , 2 , 3 } or σ , τ { 1 , 2 } such that for any l { 1 , 2 } and any i { 1 , 2 , 3 } ,
h t l , i ( H t i ) ¯ H t α ¯ or h t l , i ( H t i ) ¯ J t σ ¯ ,
and for any i { 1 , 2 } ,
h t 0 , i ( J t i ) ¯ H t β ¯ or h t 0 , i ( J t i ) ¯ J t τ ¯ .
Hence, { R t } t = 1 4 satisfies the conditions of Theorem 6. By Theorem 6 and Proposition 5, we can obtain a minimal simplified GIFS G ^ = ( V ^ , E ^ ) where V ^ = { 1 , , 8 } and E ^ = { e 1 , , e 32 } , along with the invariant family i = 1 8 W ^ j and the associated similitudes { f e } e E ^ . Let { U i } i = 1 8 be an invariant family of nonempty bounded open sets with U ¯ i = W ^ i , i = 1 , , 8 . It follows from Theorem 8 that the system G ^ is of finite type.
Next, let T 1 , , T 8 be the neighborhood types of the root neighborhoods [ U 1 ] , , [ U 8 ] , respectively. All neighborhood types are generated after two iterations. The weighted incidence matrix happens to be the same as that in (31). Thus, the spectral radius λ ^ α of A ^ α is ( 2 + 2 ) / 2 α , and by Theorem 5, we have
dim H ( K ) = α = 1.77155 ,
where α is the unique solution of the equation λ ^ α = 1 .  □
Example 4. 
Let C 2 : = S 1 × R 1 = ( cos θ , sin θ , z ) : θ [ π , π ] , z [ 0 , 2 π ] be a cylindrical surface. Let
E 0 1 : = ( cos θ , sin θ , z ) : θ [ π , 0 ] , z [ 0 , 3 θ + 3 π ] , E 0 2 : = ( cos θ , sin θ , z ) : θ [ 0 , π ] , z [ 0 , 3 θ + 3 π ] ,
 and E 0 : = E 0 1 E 0 2 . Let ρ : = ( 5 1 ) / 2 , x : = ( cos θ , sin θ , z ) E 0 , and { R t } t = 1 4 be an IRS on E 0 , defined as
R 1 ( x ) : = ( cos ( ρ θ ρ 2 π ) , sin ( ρ θ ρ 2 π ) , ρ z ) , x E 0 { ( 1 , 0 , 0 ) } , { ( cos ( ρ 3 π ) , sin ( ρ 3 π ) , 0 ) , ( 1 , 0 , 0 ) } x = ( 1 , 0 , 0 ) ; R 2 ( x ) : = ( cos ( ρ θ + ρ 2 π ) , sin ( ρ θ + ρ 2 π ) , ρ z ) , x E 0 { ( 1 , 0 , 0 ) } , { ( 1 , 0 , 0 ) , ( cos ( ρ 3 π ) , sin ( ρ 3 π ) , 0 ) } x = ( 1 , 0 , 0 ) ; R 3 ( x ) : = ( cos ( ρ 2 θ ) , sin ( ρ 2 θ ) , ρ z + 3 ρ π ) , x E 0 { ( 1 , 0 , 0 ) } , { ( cos ( ρ 2 π ) , sin ( ρ 2 π ) , 3 ρ π ) , ( cos ( ρ 3 π ) , sin ( ρ 3 π ) , 3 ρ π ) } x = ( 1 , 0 , 0 ) .
Let K be the associated attractor (see Figure 5). Then
dim H ( K ) = 1.68239
The proof of this example is similar to that of Example 2 and is omitted.

7. IRSs on Riemannian Manifolds That Are Not Locally Euclidean

In this section, we give two examples of IRSs on S 2 , which is not locally Euclidean.
Definition 14. 
Let X be a complete metric space and let E 0 X be a nonempty compact set. Let { R i } i = 1 N be an IRS on E 0 . Let K be the associated attractor. We say that { R i } i = 1 N satisfies the strong separation condition (SSC) if R i ( K ) R j ( K ) = Ø for all i j .
Definition 15. 
Let M be a complete n-dimensional Riemannian manifold, and let K be a non-empty bounded subset in M. Let
N δ ( K ) : = the smallest number of sets of diameter at most δ needed to cover K .
The upper and lower box dimensions of K are defined respectively as
dim ¯ B ( K ) = lim ¯ δ 0 + log N δ ( K ) log δ and dim ̲ B ( K ) = lim ̲ δ 0 + log N δ ( K ) log δ .
If the two are equal, the common value, denoted by dim B ( K ) , is called the box dimension of K.
Example 5.
Let E 0 = S 2 : = ( cos ϕ cos θ , cos ϕ sin θ , sin ϕ ) : θ [ π , π ] , ϕ [ π / 2 , π / 2 ] be a 2-sphere, where θ is the azimuthal angle and ϕ is the polar angle. For points on E 0 , we compress their polar angles by 1/4 and their azimuthal angles by 1/7. Denote the resulting map by R 1 . We rotate the image of R 1 about the z-axis by 2 π / 7 , 4 π / 7 , 6 π / 7 , 2 π / 7 , 4 π / 7 , and 6 π / 7 to obtain R 2 , R 3 , R 4 , R 5 , R 6 , and R 7 , respectively. We rotate the image of R 1 about the y-axis by 5 π / 21 and 5 π / 21 to get R 8 and R 9 , respectively. Then { R t } t = 1 9 is an IRS on E 0 and is post critically finite (see, e.g., [27]). The attractor is shown in Figure 6.
The following example illustrates how to obtain the box dimension of an IRS attractor.
Example 6.
Let E 0 = S 2 and let S + 2 : = { ( x , y , z ) : x 0 } . We use the following two different parameterizations for S 2 and S + 2 :
{ ( θ , ϕ ) : = ( cos ϕ cos θ , cos ϕ sin θ , sin ϕ ) : θ [ π , π ] , ϕ [ π / 2 , π / 2 ] } for S 2 , { ( θ ˜ , ϕ ˜ ) : = ( cos ϕ ˜ cos θ ˜ , sin ϕ ˜ , cos ϕ ˜ sin θ ˜ ) : θ ˜ [ π / 2 , π / 2 ] , ϕ ˜ [ π / 2 , π / 2 ] } for S + 2 .
Here, we continue to call θ, θ ˜ azimuthal angles, and ϕ, ϕ ˜ polar angles (see Figure 7). Let R 1 be a relation obtained as follows. First, compress the azimuthal angle θ by 1/6 using a relation which we denote by f 1 . Next, we compose f 1 with a compression f ˜ 1 of the azimuthal angle θ ˜ by 1/6 to obtain R 1 . We compose R 1 with rotations about the z-axis by 5 π / 6 and 5 π / 6 to obtain R 2 and R 3 , respectively. We compose R 1 with rotations about the y-axis by π / 4 and π / 4 to get R 4 and R 5 , respectively. { R t } t = 1 5 is an IRS on E 0 and satisfies (SSC) (see Figure 8). The images of E 0 under the iterations of { R t } t = 1 5 are closed regions enclosed by the red curves in Figure 8. Let K be the associated attractor. Then
dim B ( K ) = log 5 log 6 0.898244 .
Proof of Example 6.
Let G 1 1 be the region in the middle of Figure 8a enclosed by the blue curves, where the two curves on the left and right are, respectively,
( π / 6 , ϕ ) : ϕ tan 1 3 3 2 , tan 1 3 3 2 and ( π / 6 , ϕ ) : ϕ tan 1 3 3 2 , tan 1 3 3 2 ,
and the two curves on the top and bottom are
( π / 12 , ϕ ˜ ) : ϕ ˜ sin 1 1 25 12 3 , sin 1 1 25 12 3 and ( π / 12 , ϕ ˜ ) : ϕ ˜ sin 1 1 25 12 3 , sin 1 1 25 12 3 ,
respectively. We rotate G 1 1 about the z-axis by 5 π / 6 and 5 π / 6 to obtain G 1 2 and G 1 3 , respectively. We rotate G 1 1 about the y-axis by π / 4 and π / 4 to get G 1 4 and G 1 5 , respectively. Note that for each t, R t ( E 0 ) G 1 t and the boundary of G 1 1 intersects that of R t ( E 0 ) at exactly four points (see Figure 8a). To compute the box dimension of K, we define a sequence { G n } of covers of K as follows. Let G 1 : = t = 1 5 G 1 t . For all n 2 , define
G n t 1 t n : = R t ( G n 1 t 1 t n 1 ) , t 1 , , t n { 1 , , 5 } and G n : = t 1 , , t n = 1 5 G n t 1 t n .
We need to compute the maximum diameter of the sets in each cover.
First, we find the maximum horizontal compression ratio. Let A = ( θ , ϕ ) and B = ( θ , ϕ ) be two points in G 1 4 , where θ > 0 . Then A : = f 1 ( A ) = ( θ / 6 , ϕ ) and B : = f 1 ( B ) = ( θ / 6 , ϕ ) . Let d E and d M denote the Euclidean and Riemannian distances, respectively. Then d E ( A , B ) = 2 cos ϕ sin θ . Hence
d E ( A , B ) d E ( A , B ) = sin ( θ / 6 ) sin θ .
Now let θ and ϕ vary while fixing the Euclidean distance between A ( θ , ϕ ) and B ( θ , ϕ ) . Note that the larger the value of | ϕ | (the absolute value of the latitude of A and B), the larger the value of θ . To prove that as ϕ [ 0 , π / 2 ) increases, the ratio d E ( A , B ) / d E ( A , B ) also increases, define f ( x ) : = sin ( x / 6 ) / sin x , where x ( 0 , π / 2 ) . Note that
f ( x ) = ( sin x cos ( x / 6 ) ) / 6 sin ( x / 6 ) cos x sin 2 x and d d x ( sin x cos ( x / 6 ) 6 sin ( x / 6 ) cos x ) = 35 6 sin ( x / 6 ) sin x > 0 .
Hence, f ( x ) is increasing. Therefore, as the latitude increases while keeping the distance between A ( θ , ϕ ) and B ( θ , ϕ ) fixed, the value of θ increases, and thus the ratio d E ( A , B ) / d E ( A , B ) increases. Let
h ( ϕ 1 ) : = tan 1 2 cos ϕ 1 6 cos ϕ 1 2 2 sin ϕ 1 .
A direct calculation shows that the right boundary curve of G 1 4 is
h ( ϕ 1 ) , sin 1 6 cos ϕ 1 + 2 2 sin ϕ 1 4 : ϕ 1 tan 1 3 3 2 , tan 1 3 3 2 .
We can prove that for ϕ 1 [ tan 1 ( 3 3 / 2 ) , tan 1 ( 3 3 / 2 ) ] , h ( ϕ 1 ) is increasing. Thus the maximum value of θ and ϕ for the points in G 1 4 are, respectively,
tan 1 2 3 3 0.839876 and sin 1 3 ( 3 1 ) 50 24 3 0.857731 .
Hence the maximum value of d E ( A , B ) / d E ( A , B ) is c h , 1 , where
c h , 1 : = 7 3 3 sin 1 6 tan 1 2 3 3 0.187389 .
Let ( θ n , ϕ n ) : = f 1 n ( A ) , where A G 1 4 . Then lim n θ n = 0 . Thus,
lim n sin ( θ n / 6 ) sin θ n = 1 6 < c h , 1 .
If A , B G 1 G 1 4 , similar arguments show that the maximum horizontal compression ratio is c h , 1 .
Next, we find the maximum vertical compression ratio. Let A ˜ = ( θ ˜ , ϕ ˜ ) and B ˜ = ( θ ˜ , ϕ ˜ ) be two points in G 1 1 , where θ ˜ > 0 . When the azimuthal angle θ ˜ is compressed by 1/6 in the vertical direction, the images of A ˜ and B ˜ are A ˜ = ( θ ˜ / 6 , ϕ ˜ ) and B ˜ = ( θ ˜ / 6 , ϕ ˜ ) , respectively. Hence, d E ( A ˜ , B ˜ ) / d E ( A ˜ , B ˜ ) = sin ( θ ˜ / 6 ) / sin θ ˜ . For points ( θ ˜ , ϕ ˜ ) in G 1 1 , as one varies ϕ ˜ while keeping θ ˜ constant so that ( θ ˜ , ϕ ˜ ) remains within G 1 1 , the maximum possible values of θ ˜ and ϕ ˜ are, respectively,
π / 12 0.261799 and sin 1 1 25 12 3 0.508719 .
Thus the maximum value of d E ( A ˜ , B ˜ ) / d E ( A ˜ , B ˜ ) is
c v , 1 : = 2 2 sin ( π / 72 ) 3 1 0.168532 < c h , 1 .
Let ( θ ˜ n , ϕ ˜ n ) : = f ˜ 1 n ( A ˜ ) , where A ˜ G 1 1 . Then lim n θ ˜ n = 0 . Thus,
lim n sin ( θ ˜ n / 6 ) sin θ ˜ n = 1 6 < c v , 1 .
For A , B G 1 G 1 1 , similar arguments show that the maximum vertical compression ratio is c v , 1 . Let c h , n and c v , n be the horizontal and vertical compression ratios of the n t h iteration, respectively. Using a similar proof as that for n = 1 , we have c v , n < c h , n for any n 2 .
Finally, fix t { 1 , , 5 } . For any two points C 1 : = ( θ 1 , ϕ 1 ) and D 1 : = ( θ 2 , ϕ 2 ) in G 1 t , where θ 1 θ 2 or ϕ 1 ϕ 2 , let C 1 D 1 F 1 be a Euclidean right triangle with F 1 E 0 . Then d E ( C 1 , D 1 ) = d E 2 ( C 1 , F 1 ) + d E 2 ( D 1 , F 1 ) . Let C 2 : = R t ( C 1 ) , D 2 : = R t ( D 1 ) , and F 2 : = R t ( F 1 ) . Then C 2 D 2 F 2 is also a Euclidean right triangle. Hence
d E ( C 2 , D 2 ) c h , 1 2 d E 2 ( C 1 , F 1 ) + c v , 1 2 d E 2 ( D 1 , F 1 ) c h , 1 d E ( C 1 , D 1 ) .
Let C n + 1 and D n + 1 denote the n t h iterates, under R t , of the points C 1 and D 1 , respectively. Then
d E ( C n + 1 , D n + 1 ) c h , 1 c h , n d E ( C 1 , D 1 ) .
In view of (33), { c h , n } is monotone decreasing and tends to 1 / 6 as n tends to infinity. Let diam E ( G n t ) and diam M ( G n t ) denote the diameters of G n t in the Euclidean and Riemannian metrics, respectively. Define
δ E , n : = max { diam E ( G n t 1 t n ) : t 1 , , t n { 1 , , 5 } } and δ M , n : = max { diam M ( G n t 1 t n ) : t 1 , , t n { 1 , , 5 } } .
By (34), there exist constants κ 1 , κ 2 > 0 such that
κ 1 1 6 n δ E , n κ 2 ( c h , 1 c h , n ) ,
where the first inequality can be obtained easily. Let O be the the center of E 0 . For any A , B E 0 , let α : = A O B . Then
d M ( A , B ) = α 2 sin ( α / 2 ) d E ( A , B ) .
Let α n : = C n O D n and α n + 1 : = C n + 1 O D n + 1 . Combining (35) and (36), we have
κ 1 α n 2 sin ( α n / 2 ) 1 6 n δ M , n = α n 2 sin ( α n / 2 ) δ E , n κ 2 α n 2 sin ( α n / 2 ) ( c h , 1 c h , n ) .
Note that α 0 as n, the level of iteration, tends to infinity. Thus,
lim n α n 2 sin ( α n / 2 ) = 1 .
By the definition of { R t } t = 1 5 , K can be covered by a minimum of 5 n sets (say, the G n t ’s), each with Riemannian diameter no more than δ M , n . Hence N δ M , n ( K ) = 5 n . Using the fact that the sequence { δ M , n } is slowly decreasing, we have
dim ¯ B ( K ) = lim ¯ n log 5 n log δ M , n lim n log 5 n log κ 1 log α n 2 sin ( α n / 2 ) log ( 1 / 6 ) n ( by ( 37 ) ) = log 5 log 6 0.898244 ( by ( 38 ) ) .
Similarly, we have dim ̲ B ( K ) log 5 / log 6 . On the other hand, for any ϵ > 0 , we let
δ n : = κ 2 α n 2 sin ( α n / 2 ) 1 6 + ϵ n .
Then, in view of (34) and (37), for all n sufficiently large,
δ n κ 2 α n 2 sin ( α n / 2 ) ( c h , 1 c h , n ) δ M , n
and hence N δ n ( K ) 5 n . Thus,
dim ¯ B ( K ) = lim ¯ n log N δ n ( K ) log δ n lim n log 5 n log κ 2 log α n 2 sin ( α n / 2 ) log ( 1 / 6 + ϵ ) n = log 5 log ( 1 / 6 + ϵ ) .
Letting ϵ 0 yields dim ¯ B ( K ) log 5 / log 6 . Similarly, we have dim ̲ B ( K ) log 5 / log 6 . This completes the proof.  □

8. Conclusions

Fractals on Riemannian manifolds generated by non-contractive or multivalued relations cannot be described by iterated function systems. We introduce the notion of an iterated relation system to describe these fractals. To compute the Hausdorff dimension of an IRS attractor, we introduce the notion of a graph-directed iterated function system associated with an IRS and prove that the IRS attractor can be identified with the attractor of the associated GIFS. In addition, we formulate conditions under which a GIFS associated with an IRS exists. This allows us to obtain a formula for the Hausdorff dimension of an IRS attractor on a locally Euclidean Riemannian manifold, under either the graph open set condition or the graph finite type condition. Finally, we illustrate how to obtain the box dimension of an IRS attractor on S 2 .

Author Contributions

Conceptualization, J.L., S.-M.N. and L.O.; methodology, J.L., S.-M.N. and L.O.; software, S.-M.N. and L.O.; validation, S.-M.N. and L.O.; formal analysis, S.-M.N. and L.O.; investigation, J.L., S.-M.N. and L.O.; writing—original draft preparation, J.L. and L.O.; writing—review and editing, S.-M.N. and L.O.; supervision, S.-M.N.; project administration, S.-M.N.; funding acquisition, S.-M.N. All authors have read and agreed to the published version of the manuscript.

Funding

The authors are supported in part by the National Natural Science Foundation of China, grant 12271156, and the Construct Program of the Key Discipline in Hunan Province.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

Part of this work was carried out while the third author was visiting Beijing Institute of Mathematical Sciences and Applications (BIMSA). She thanks the institute for its hospitality and support. The authors are grateful to the anonymous reviewers for some helpful comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Some Examples

Examples in this section are designed to illustrate some definitions and conditions in Section 2, Section 3 and Section 4.
The following counterexample shows that Proposition 2 (b) fails if Condition (C) is not assumed.
Example A1. 
Let E 0 : = { 0 , 1 } { 1 / 2 n : n N + } , and let R 1 be an IRS on E 0 defined as
R 1 ( x ) : = 1 , x = 0 , { 0 , 1 / 2 n + 1 } , x = 1 / 2 n , where n N + , 1 , x = 1 .
Then E n = { 0 , 1 } { 1 / 2 k : k n + 1 } , where n N + . Let x = 0 E 0 , y n k = 1 / 2 k E n k , and 0 R 1 ( y n k ) , where k n + 1 and n N + . Then { y n k } converges to y : = 0 , but x R 1 ( y ) = { 1 } . Hence, R 1 does not satisfy Condition (C). Moreover, we have K : = n = 0 E n = { 0 , 1 } and R 1 ( K ) = { 1 } . Hence, K R 1 ( K ) .
For a general IRS, there could be more than one nonempty compact set K satisfying (1). The following example illustrates this.
Example A2. 
Let E 0 : = [ 0 , 1 ] R , and let { R t } t = 1 2 be an IRS on E 0 defined as
R 1 ( x ) : = ( 3 / 4 ) x ; R 2 ( x ) : = 0 , x = 0 , ( 1 / 4 ) x + 3 / 4 , 0 < x < 1 , { 3 / 4 , 1 } , x = 1 .
Then there exist at least two nonempty compact sets K satisfying Equation (1).
Proof of Example A2.
We know that E 0 = [ 0 , 1 ] , …, E n = [ 0 , 1 ] . Hence, K = [ 0 , 1 ] . By Proposition 2, we have K = t = 1 2 R t ( K ) . Now let K ˜ = { 0 } . Note that
{ 0 } = R 1 { 0 } R 2 { 0 } .
Then K ˜ = t = 1 2 R t ( K ˜ ) , which completes the proof.  □
We give a counterexample to show that Theorem 1 fails if condition (a) in Definition 5 is not satisfied.
Example A3.
Let E 0 : = [ 0 , 1 ] , and let { R t } t = 1 2 be an IRS on E 0 defined as
R 1 ( x ) : = ( 1 / 3 ) x + 2 / 3 ; R 2 ( x ) : = ( 1 / 3 ) x , 0 x 1 , { 1 / 2 p : p N } , x = 0 .
Then # { R 2 ( 0 ) } = . Thus, there does not exist any (finite) GIFS associated with { R t } t = 1 2 .
Examples A4 and A5 show that the condition (b) (i) in Theorem 1 need not be satisfied.
Example A4.
Let E 0 : = [ 0 , 1 ] . Let { R t } t = 1 2 be an IRS on E 0 defined as
R 1 ( x ) : = { x , x + 1 / 4 } , x [ 0 , 1 / 2 ] , ( 1 / 2 ) x + 1 / 4 , x ( 1 / 2 , 1 ] ; R 2 ( x ) : = x / 2 .
Then H 1 = [ 0 , 1 / 2 ] , and thus for any x H 1 ,
h 1 1 , 1 ( x ) = x and h 1 2 , 1 ( x ) = x + 1 / 4 .
Therefore, h 1 1 , 1 and h 1 2 , 1 are not contractions.
Example A5.
Let E 0 : = [ 0 , 1 ] . For any i N + , let F i : = [ 1 ( 1 / 2 2 i 2 ) , 1 ( 1 / 2 2 i 1 ) ] , and define
f 1 , i ( x ) : = 1 2 x + 2 2 i 1 2 2 2 i and f 2 , i ( x ) : = 1 3 x + 2 2 i + 1 8 3 · 2 2 i for x F i .
Note that
f 1 , i ( F i ) = 1 2 + 2 2 i 1 4 2 2 i , 1 2 + 2 2 i 1 3 2 2 i F i and f 2 , i ( F i ) = 1 3 + 2 2 i + 1 12 3 · 2 2 i , 1 3 + 2 2 i + 1 10 3 · 2 2 i F i ,
where i N + (see Figure A1). Let R 1 be an IRS on E 0 defined as
R 1 ( x ) : = { f 1 , i ( x ) , f 2 , i ( x ) } , x F i , i N + , x / 4 , x E 0 ( i F i { 1 } ) , { 0 , 1 } , x = 1 .
Then H 1 = ( i = 1 F i ) { 1 } , and r 1 : = R 1 | H 1 cannot be decomposed as a finite family of contractions.
Figure A1. The sets E 1 = R 1 ( E 0 ) and H 1 = ( i = 1 F i ) { 1 } in Example A5.
Figure A1. The sets E 1 = R 1 ( E 0 ) and H 1 = ( i = 1 F i ) { 1 } in Example A5.
Fractalfract 09 00637 g0a1
Proof of Example A5.
By the definition of R 1 , we have H 1 = ( i = 1 F i ) { 1 } . We prove the following claim.
Claim 1. For any i , j N + , let f : F i F j f ( F i F j ) be a function decomposed from R 1 . Then f is not contractive. To prove this claim, we let x 1 : = 1 ( 1 / 2 2 i 2 ) F i and x 2 : = 1 ( 1 / 2 2 j 2 ) F j . Then
f ( x 1 ) = 1 1 2 2 i 2 and f ( x 2 ) = 1 1 2 2 j 2 .
Note that
d ( f ( x 1 ) , f ( x 2 ) ) = | 1 2 2 i 2 1 2 2 j 2 | = d ( x 1 , x 2 ) .
Thus, f is not a contraction. Next, suppose that r 1 = R 1 | H 1 can be decomposed as a finite family of contractions { h 1 l , s : H 1 s h 1 l , s ( H 1 s ) } l = 1 , s = 1 n , m . Then there would exist at least one H 1 s such that
i = q F i H 1 s for some q 1 , and h 1 l , s | i = q F i is contractive .
This contradicts Claim 1 and proves that r 1 cannot be decomposed as a finite family of contractions.  □
The following example shows that condition (b) (ii) in Theorem 1 need not be satisfied.
Example A6.
Let E 0 : = [ 0 , 1 ] . For any i N + , let
F i : = 1 1 2 i 1 , 1 3 5 · 2 i 1 , I i : = 1 3 5 · 2 i 1 , 1 1 2 i ,
and let
f ( x ) : = 5 8 x + 3 8 + 3 5 · 2 i + 2 , x F i .
Note that
f ( F i ) = 1 11 5 · 2 i + 1 , 1 3 5 · 2 i I i F i + 1
(see Figure A2). Let R 1 be an IRS on E 0 defined as
R 1 ( x ) : = f ( x ) , x / 20 , x F i , i N + , x / 20 , x i = 1 I i , { 1 / 20 , 1 } , x = 1 .
Let E 1 : = R 1 ( E 0 ) . Then there does not exist a good partition of E 1 .
Figure A2. The sets H 1 = ( i = 1 F i ) { 1 } and E 0 H 1 = i = 1 I i in Example A6. { d j i } i , j N + represents the set of division points in E 1 . Note that for all i N + , # { d j i : j N + } = .
Figure A2. The sets H 1 = ( i = 1 F i ) { 1 } and E 0 H 1 = i = 1 I i in Example A6. { d j i } i , j N + represents the set of division points in E 1 . Note that for all i N + , # { d j i : j N + } = .
Fractalfract 09 00637 g0a2
Proof of Example A6.
By the definition of R 1 , we have H 1 1 = i = 1 F i , H 1 2 = { 1 } , and J 1 1 = i = 1 I i . Thus, for any i N + ,
h 1 1 , 1 ( x ) = f ( x ) , x F i ; h 1 2 , 1 ( x ) = x / 20 , x H 1 1 ; h 1 1 , 2 ( x ) = 1 / 20 , x = 1 ; h 1 2 , 2 ( x ) = 1 , x = 1 ; h 1 0 , 1 ( x ) = x / 20 , x J 1 1 .
Hence, for l, k { 1 , 2 } , h 1 0 , 1 and h 1 l , k are contractions. For any i N + , let
d 1 i : = 1 1 2 i and { d j i } : = h 1 1 , 1 1 ( d j 1 i + 1 ) h 1 1 , 1 ( F i ) , j = 2 , 3 ,
be a family of division points in h 1 1 , 1 ( F i ) . Then for any j { 2 , 3 , } ,
d j 1 i + 1 h 1 1 , 1 ( F i + 1 ) and F i + 1 h 1 1 , 1 ( F i ) .
Hence, for any i , j N + , { d j i } = h 1 1 , 1 1 ( d j 1 i + 1 ) h 1 1 , 1 ( F i ) Ø . Next, we show that for any i N + , d j i is an increasing function of j. By the definition of h 1 1 , 1 , we have d 1 i < d 2 i , where i N + , and h 1 1 , 1 1 is an increasing function on h 1 1 , 1 ( H 1 1 ) . Assume that for any i N + and j = n , we have d n i < d n + 1 i . Then
h 1 1 , 1 1 ( d n i ) < h 1 1 , 1 1 ( d n + 1 i ) .
We let j = n + 1 and let
{ d n + 1 i } = h 1 1 , 1 1 ( d n i + 1 ) h 1 1 , 1 ( F i ) and { d n + 2 i } : = { h 1 1 , 1 1 d n + 1 i + 1 ) h 1 1 , 1 ( F i ) .
Then by (A1), d n + 1 i < d n + 2 i . By induction, for any i N + , d j i is an increasing function of j. Hence, for any i N + , # { d j i : j N + } = . It follows that for any i N + ,
h 1 1 , 1 ( F i ) = 1 11 5 · 2 i + 1 , d 1 i [ d 1 i , d 2 i ] [ d 2 i , d 3 i ] = : W 1 1 , i , 1 W 1 1 , i , 2 W 1 1 , i , 3 = j = 1 W 1 1 , i , j .
Note that for any i N + and j = 2 , 3 , , we have W 1 1 , i , 1 I i and W 1 1 , i , j F i + 1 .
Claim 1. For any i N + and any j { 2 , 3 , } , let
W 1 i , t : = W 1 1 , i , 1 W 1 1 , i , j and g 1 1 , 1 , i , t : = h 1 1 , 1 | W 1 i , t .
Then g 1 1 , 1 , i , t is not contractive. In fact, for any x W 1 1 , i , 1 and any y W 1 1 , i , j , we have d ( x , y ) 1 / 4 , while d ( g 1 1 , 1 , i , t ( x ) , g 1 1 , 1 , i , t ( y ) ) 13 / 20 . This proves Claim 1.
Claim 2. Fix i N + . For any p , q N + with p < q , let
W 1 i , s : = W 1 1 , i , p W 1 1 , i , q and g 1 1 , 1 , i , s : = h 1 1 , 1 | W 1 i , s .
Then it is not possible for g 1 1 , 1 , i , s to be contractive and W 1 i , s to be invariant under g 1 1 , 1 , i , s . In fact, suppose that g 1 1 , 1 , i , s is contractive and W 1 i , s is invariant under g 1 1 , 1 , i , s . By the definitions of W 1 1 , i , p and W 1 1 , i , q , we have
W 1 1 , i , p W 1 1 , i + 1 , p 1 and W 1 1 , i , q W 1 1 , i + 1 , q 1 .
Hence, g 1 1 , 1 , i , s 1 is contractive, and W 1 i + 1 , s 1 : = W 1 1 , i + 1 , p 1 W 1 1 , i + 1 , q 1 is invariant under g 1 1 , 1 , i , s 1 . Since
W 1 1 , i + 1 , p 1 W 1 1 , i + 2 , p 2 and W 1 1 , i + 1 , q 1 W 1 1 , i + 2 , q 2 .
Hence, g 1 1 , 1 , i , s 2 is contractive, and W 1 i + 2 , s 2 : = W 1 1 , i + 2 , p 2 W 1 1 , i + 2 , q 2 is invariant under g 1 1 , 1 , i , s 2 . Continue this process. We see that g 1 1 , 1 , i , s p + 1 is contractive, and W 1 i + p 1 , s p + 1 : = W 1 1 , i + p 1 , 1 W 1 1 , i + p 1 , q p + 1 is invariant under g 1 1 , 1 , i , s p + 1 . This contradicts Claim 1. This proves Claim 2. Let
W 1 2 , 1 , 1 : = h 1 2 , 1 ( H 1 1 ) , W 1 1 , 2 , 2 : = h 1 1 , 2 ( H 1 2 ) , W 1 2 , 2 , 2 : = h 1 2 , 2 ( H 1 2 ) , and W 1 0 , 1 , 1 : = h 1 0 , 1 ( J 1 1 ) ¯ .
Therefore, we can extend h 1 0 , 1 from J 1 1 to J 1 1 ¯ and let h ˜ 1 0 , 1 : J 1 1 ¯ W 1 0 , 1 , 1 be defined as h ˜ 1 0 , 1 ( x ) : = x / 20 . Hence,
E 1 = h ˜ 1 0 , 1 ( J 1 1 ¯ ) l = 1 2 k = 1 2 h 1 l , k ( H 1 k ) = W 1 0 , 1 , 1 i , j N + W 1 1 , i , j W 1 2 , 1 , 1 W 1 1 , 2 , 2 W 1 2 , 2 , 2 .
We assume that { W 1 s , t } s = 1 , t = 1 p , n is a good partition of E 1 with respect to
{ g 1 l , s , t , k } l = 0 , k = 1 , s = 1 , t = 1 2 , 2 , p , n , where g 1 l , k , s , t : = h 1 l , k | W 1 s , t .
Then there exists at least one W 1 α , β , where α { 1 , , p } and β { 1 , , n } , such that for any i N + ,
j = q 1 W 1 1 , i , j W 1 α , β for some q 1 1 .
This contradicts Claim 2 and proves that there does not exist a good partition of E 1 .  □

References

  1. Strichartz, R.S. Self-similarity on nilpotent Lie groups. Contemp. Math. 1992, 140, 123–157. [Google Scholar]
  2. Balogh, Z.M.; Tyson, J.T. Hausdorff dimensions of self-similar and self-affine fractals in the Heisenberg group. Proc. Lond. Math. Soc. 2005, 91, 153–183. [Google Scholar] [CrossRef]
  3. Barnsley, M.F.; Vince, A. Real projective iterated function systems. J. Geom. Anal. 2012, 22, 1137–1172. [Google Scholar] [CrossRef]
  4. Hossain, A.; Akhtar, M.N.; Navascués, M.A. Fractal dimension of fractal functions on the real projective plane. Fractal Fract. 2023, 7, 510. [Google Scholar] [CrossRef]
  5. Hossain, A.; Akhtar, M.N.; Navascués, M.A. Fractal interpolation on the real projective plane. Numer. Algorithms 2024, 96, 557–582. [Google Scholar] [CrossRef]
  6. Ngai, S.-M.; Xu, Y.Y. Separation conditions for iterated function systems with overlaps on Riemannian manifolds. J. Geom. Anal. 2023, 33, 262. [Google Scholar] [CrossRef]
  7. Thangaraj, C.; Easwaramoorthy, D.; Selmi, B.; Chamola, B.P. Generation of fractals via iterated function system of Kannan contractions in controlled metric space. Math. Comput. Simul. 2024, 222, 188–198. [Google Scholar] [CrossRef]
  8. Cui, M.; Selmi, B.; Li, Z. Expansive measures of nonautonomous iterated function systems. Qual. Theory Dyn. Syst. 2025, 24, 60. [Google Scholar] [CrossRef]
  9. Balogh, Z.M.; Rohner, H. Self-similar sets in doubling spaces. Ill. J. Math. 2007, 51, 1275–1297. [Google Scholar] [CrossRef]
  10. Hutchinson, J.E. Fractals and self-similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  11. Wu, D.; Yamaguchi, T. Hausdorff dimension of asymptotic self-similar sets. J. Geom. Anal. 2017, 4, 339–368. [Google Scholar] [CrossRef]
  12. Ngai, S.-M.; Wang, Y. Hausdorff dimension of self-similar sets with overlaps. J. Lond. Math. Soc. 2001, 2, 655–672. [Google Scholar] [CrossRef]
  13. Jin, N.; Yau, S.S.T. General finite type IFS and M-matrix. Commun. Anal. Geom. 2005, 13, 821–843. [Google Scholar]
  14. Lau, K.-S.; Ngai, S.-M. A generalized finite type condition for iterated function systems. Adv. Math. 2007, 208, 647–671. [Google Scholar] [CrossRef]
  15. Akhtar, M.N.; Hossain, A. Stereographic metric and dimensions of fractals on the sphere. Results Math. 2022, 77, 213. [Google Scholar] [CrossRef]
  16. Akhtar, M.N.; Prasad, M.G.P.; Navascués, M.A. More general fractal functions on the sphere. Mediterr. J. Math. 2019, 16, 134. [Google Scholar] [CrossRef]
  17. Navascués, M.A. Fractal functions on the sphere. J. Comput. Anal. Appl. 2007, 9, 257–270. [Google Scholar]
  18. Vince, A. Möbius iterated function systems. Trans. Amer. Math. Soc. 2013, 365, 491–509. [Google Scholar] [CrossRef]
  19. Mauldin, R.D.; Williams, S.C. Hausdorff dimension in graph directed constructions. Trans. Amer. Math. Soc. 1988, 309, 811–829. [Google Scholar] [CrossRef]
  20. Edgar, G.A. Measure, Topology, and Fractal Geometry; Springer: New York, NY, USA, 2008. [Google Scholar]
  21. Petersen, P. Riemannian Geometry; Graduate Texts in Mathematics; Springer: Cham, Switzerland, 2006; Volume 171. [Google Scholar]
  22. Jost, J. Riemannian Geometry and Geometric Analysis; Universitext; Springer: Cham, Switzerland, 2017. [Google Scholar]
  23. Hebey, E. Sobolev Spaces on Riemannian Manifolds; Springer: Berlin/Heidelberg, Germany, 1996. [Google Scholar]
  24. Chavel, I. Riemannian Geometry: A Modern Introduction; Cambridge University Press: Cambridge, UK, 2006. [Google Scholar]
  25. Falconer, K.J. Fractal Geometry: Mathematical Foundations and Applications, 2nd ed.; John Wiley: Hoboken, NJ, USA, 2014. [Google Scholar]
  26. Das, M.; Ngai, S.-M. Graph-directed iterated function systems with overlaps. Indiana Univ. Math. J. 2004, 53, 109–134. [Google Scholar] [CrossRef]
  27. Kigami, J. Analysis on Fractals; Cambridge University Press: Cambridge, UK, 2001. [Google Scholar]
Figure 1. Figures for Example 1 with r = π / 4 . (ac) are drawn on R 2 and shrunk by 2 π . (a) The first iteration of E 0 under { R t } t = 1 3 , where R 1 ( E 0 ) consists of the left and right rectangles, R 2 ( E 0 ) is the top square, and R 3 ( E 0 ) is the bottom square. (b) Vertices of the GIFS associated with { R t } t = 1 3 . (c) The first iteration of the vertices under the GIFS. (d,e) The attractor of { R t } t = 1 3 .
Figure 1. Figures for Example 1 with r = π / 4 . (ac) are drawn on R 2 and shrunk by 2 π . (a) The first iteration of E 0 under { R t } t = 1 3 , where R 1 ( E 0 ) consists of the left and right rectangles, R 2 ( E 0 ) is the top square, and R 3 ( E 0 ) is the bottom square. (b) Vertices of the GIFS associated with { R t } t = 1 3 . (c) The first iteration of the vertices under the GIFS. (d,e) The attractor of { R t } t = 1 3 .
Fractalfract 09 00637 g001
Figure 2. The GIFS associated with { R t } t = 1 3 in Example 1.
Figure 2. The GIFS associated with { R t } t = 1 3 in Example 1.
Fractalfract 09 00637 g002
Figure 3. Figures for Example 2 with r = π / 4 . (a,b) are drawn on R 2 and shrunk by 2 π . (a) The first iteration of E 0 under { R t } t = 1 4 , where R 1 ( E 0 ) consists of the left and right rectangles, R 2 ( E 0 ) is the top square, R 3 ( E 0 ) is the middle square, and R 4 ( E 0 ) is the bottom square. (b) Vertices of the GIFS associated with { R t } t = 1 4 . (c,d) The attractor of { R t } t = 1 4 .
Figure 3. Figures for Example 2 with r = π / 4 . (a,b) are drawn on R 2 and shrunk by 2 π . (a) The first iteration of E 0 under { R t } t = 1 4 , where R 1 ( E 0 ) consists of the left and right rectangles, R 2 ( E 0 ) is the top square, R 3 ( E 0 ) is the middle square, and R 4 ( E 0 ) is the bottom square. (b) Vertices of the GIFS associated with { R t } t = 1 4 . (c,d) The attractor of { R t } t = 1 4 .
Fractalfract 09 00637 g003
Figure 4. The GIFS associated with { R t } t = 1 4 in Example 2.
Figure 4. The GIFS associated with { R t } t = 1 4 in Example 2.
Fractalfract 09 00637 g004
Figure 5. The attractor of { R t } t = 1 3 in Example 4.
Figure 5. The attractor of { R t } t = 1 3 in Example 4.
Fractalfract 09 00637 g005
Figure 6. The attractor of { R t } t = 1 9 in Example 5.
Figure 6. The attractor of { R t } t = 1 9 in Example 5.
Fractalfract 09 00637 g006
Figure 7. The polar and azimuthal angles in the two parameterizations in Example 6.
Figure 7. The polar and azimuthal angles in the two parameterizations in Example 6.
Fractalfract 09 00637 g007
Figure 8. The IRS { R t } t = 1 5 in Example 6. Regions enclosed by the red curves are images of E 0 under the iterations of { R t } t = 1 5 . (a) The first iteration. G 1 1 , G 1 4 , and G 1 5 denote the middle, top, and bottom blue regions enclosed by the blue curves, respectively ( G 1 2 and G 1 3 not shown). (b) The second iteration. Figures (c,d) show rough approximations to the front and back of the attractor.
Figure 8. The IRS { R t } t = 1 5 in Example 6. Regions enclosed by the red curves are images of E 0 under the iterations of { R t } t = 1 5 . (a) The first iteration. G 1 1 , G 1 4 , and G 1 5 denote the middle, top, and bottom blue regions enclosed by the blue curves, respectively ( G 1 2 and G 1 3 not shown). (b) The second iteration. Figures (c,d) show rough approximations to the front and back of the attractor.
Fractalfract 09 00637 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, J.; Ngai, S.-M.; Ouyang, L. Iterated Relation Systems on Riemannian Manifolds. Fractal Fract. 2025, 9, 637. https://doi.org/10.3390/fractalfract9100637

AMA Style

Liu J, Ngai S-M, Ouyang L. Iterated Relation Systems on Riemannian Manifolds. Fractal and Fractional. 2025; 9(10):637. https://doi.org/10.3390/fractalfract9100637

Chicago/Turabian Style

Liu, Jie, Sze-Man Ngai, and Lei Ouyang. 2025. "Iterated Relation Systems on Riemannian Manifolds" Fractal and Fractional 9, no. 10: 637. https://doi.org/10.3390/fractalfract9100637

APA Style

Liu, J., Ngai, S.-M., & Ouyang, L. (2025). Iterated Relation Systems on Riemannian Manifolds. Fractal and Fractional, 9(10), 637. https://doi.org/10.3390/fractalfract9100637

Article Metrics

Back to TopTop