Next Article in Journal
Extremal Solutions for a Caputo-Type Fractional-Order Initial Value Problem
Previous Article in Journal
The Influence of Lévy Noise and Independent Jumps on the Dynamics of a Stochastic COVID-19 Model with Immune Response and Intracellular Transmission
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Graph-Theoretic Characterization of Separation Conditions in Self-Affine Iterated Function Systems

1
Hongshen Honors School, Chongqing University, Chongqing 401331, China
2
College of Mathematics and Statistics, Key Laboratory of Nonlinear Analysis and Its Applications (Chongqing University), Ministry of Education, Chongqing University, Chongqing 401331, China
3
Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(5), 307; https://doi.org/10.3390/fractalfract9050307
Submission received: 4 April 2025 / Revised: 29 April 2025 / Accepted: 5 May 2025 / Published: 8 May 2025
(This article belongs to the Section Geometry)

Abstract

For a self-affine iterated function system (IFS) { f j } j = 1 N on R d defined by f j ( x ) = A 1 ( x + d j ) , where A is an expansive matrix and d j R d , we reveal a novel characterization of the open set and weak separation conditions through the bounded degree of the augmented tree induced by the IFS. Furthermore, the augmented tree is shown to be a Gromov hyperbolic graph, and its hyperbolic boundary is Hölder equivalent to the self-affine set generated by the IFS, establishing a canonical association between self-affine IFSs and Gromov hyperbolic graphs.
MSC:
Primary 28A80; Secondary 05C05; 20F65

1. Introduction

Let A be a d × d matrix with real entries that is expansive, i.e., all the eigenvalues of A have moduli > 1 . Given an integer N > 1 , let D = { d 1 , d 2 , , d N } R d be a set of N vectors. Define affine contracting functions on R d as follows:
f j ( x ) = A 1 ( x + d j ) , j = 1 , , N .
The family of functions { f j } j = 1 N is called a self-affine iterated function system (IFS) [1]. According to Hutchinson’s theorem [2], there exists a unique, nonempty, compact set K : = K ( A , D ) that satisfies the following:
K = j = 1 N f j ( K ) = A 1 ( K + D ) .
The compact set K is canonically termed a self-affine set or an attractor of the IFS. When N = | det ( A ) | holds and K possesses a nonempty interior, the attractor is classified as a self-affine tile [3], characterized by its capacity to tessellate the ambient space through translational copies. In a specialized case where the linear component A constitutes a similitude satisfying A 1 = r R with 0 < r < 1 (scaling factor) and an orthonormal matrix R, the system { f j } j = 1 N is designated as a self-similar IFS, and its attractor K accordingly becomes a self-similar set.
Both the IFS and its attractor are the main research objects of fractal geometry and dynamical systems. Let Σ * : = n = 0 Σ n be the symbolic space associated with the IFS, where Σ = { 1 , , N } and Σ 0 = . Then, write the following:
D 1 = D , D n = D + A D n 1 , n 2 , and D = n = 1 D n .
If u = i 1 i n Σ * , we assume f u = f i 1 f i n for the sake of simplicity. Then, we consider f u ( x ) = A n ( x + d u ) with the following:
d u = d i n + A d i n 1 + + A n 1 d i 1 D n .
Next, write K u : = f u ( K ) = A n ( K + d u ) . By iterating (2), the self-affine set K is of the following form for any n 1 :
K = u Σ n f u ( K ) = A n ( K + D n ) .
The symbolic space Σ * naturally inherits a tree structure through standard word concatenation, where we denote the vertical edge set by E v . This construction explicitly reveals ( Σ * , E v ) as an N-ary tree. Such a combinatorial structure plays a crucial role in calculating the Hausdorff dimension of the associated attractor K (see [1,2,4]).
In the current field of fractal geometry, the open set condition is perhaps one of the most fundamental and useful separation conditions to track the iteration rules. The IFS { f j } j = 1 N is said to satisfy the open set condition (OSC) [1,2], if there is a nonempty, bounded, open set U R d such that j = 1 N f j ( U ) U and f i ( U ) f j ( U ) = for all i j . If the additional condition U K holds, we say that the IFS satisfies the strong open set condition (SOSC).
Self-similar IFSs with the OSC can be handled easily, and the Hausdorff dimension of self-similar sets can be calculated accurately. In particular, Schief [4] proved a well-known result regarding the characterization of the OSC in self-similar IFSs. Recently, Fu, Gabardo, and Qiu [5] extended Schief’s result and obtained a generalization on self-affine IFSs by replacing the Euclidean metric with a quasi-metric d w introduced by He and Lau [6]. Under the quasi-metric d w (see details in Section 2), the self-affine IFS (1) exhibited a similarity structure as
d w ( A 1 x , A 1 y ) = q 1 d d w ( x , y ) , x , y R d ,
where q = | det A | > 1 . It allowed for better dimensional estimates of K through the generalized Hausdorff measure H w s and the generalized Hausdorff dimension dim H w (please refer to [6] for definitions).
Theorem 1
([5,6]). Let the IFS { f j } j = 1 N be as in (1), then the following are equivalent:
(i) 
the OSC holds;
(ii) 
the SOSC holds;
(iii) 
H w s ( K ) > 0 , where s = d log N / log q ;
(iv) 
# D n = N n for all n 1 and D is uniformly discrete, i.e. there exists δ > 0 such that d u d v > δ for any d u d v D .
When the OSC fails for an IFS, iterations inevitably generate overlaps, and the resulting attractor K exhibits intricate geometric complexity. To address this challenge, the weak separation condition (WSC) introduced by Lau and Ngai [7] (see also [8]) serves as a pivotal tool for analyzing self-similar IFSs with overlaps. While weaker than the OSC, the WSC retains key analytical properties (e.g., controlled overlapping scales) and maintains the tractability of the iterative process.
Deng [9] generalized the concept of WSC as follows: A self-affine IFS { f j } j = 1 N satisfies the WSC if, for every bounded set D R d , there exists γ > 0 such that
# f u : u Σ n , x f u ( D ) < γ for all x R d and n 1 .
This condition effectively quantifies overlapping multiplicity while accommodating affine distortions. A systematic exposition of the OSC, WSC, and other separation conditions and their relationships was comprehensively presented in the survey paper [10].
Theorem 2
([9]). Let the IFS { f j } j = 1 N be as in (1), then the following are equivalent:
(i) 
the WSC holds;
(ii) 
there exists δ > 0 such that for any d u , d v D n , n 1 , either d u = d v or d u d v > δ ;
(iii) 
for any given bounded subsets D 1 , D 2 R d , there exists γ > 0 such that # { d u : u Σ n , ( D 1 + x ) ( D 2 + d u ) } < γ for all x R d and n 1 ;
(iv) 
for any c > 0 , there exists a constant β ( c ) such that for any integer n 1 and any bounded set D R d with diameter c r n ,
# { f u : u Σ n , x f u ( D ) } < β ( c ) .
Motivated by the previous works, we propose a novel characterization of the OSC and WSC in a self-affine IFS through graph-theoretic invariants. Before presenting our main theorems, we need some notation on graphs.
For an N-ary tree ( Σ * , E v ) , we define horizontal edges as follows:
E h = { ( u , v ) Σ n × Σ n : u v ,   d w ( K u , K v ) ρ r n ,   n 1 }
where d w ( E , F ) = inf { d w ( x , y ) : x E , y F } , r = q 1 d , and ρ > 0 is a constant. Let E = E v E h . Then, the graph G : = ( Σ * , E ) is an augmented tree (see Definition 2). The concept of augmented tree was initially introduced by Kaimanovich [11] to study the Sierpinski graph. Later, Lau and Wang [12] developed his idea into a large class of self-similar sets.
If the IFS in (1) satisfies the OSC, by Theorem 1, d u d v holds for any distinct u , v Σ * . If the IFS does not satisfy the OSC, it may occur that d u = d v for u v Σ * . In this case, we may modify the augmented tree ( Σ * , E ) by identifying u , v for d u = d v , and let G be the quotient space of the graph G = ( Σ * , E ) . The detailed modification can be found in Section 3.
A graph ( X , E ) is of bounded degree if sup { deg ( x ) : x X } < , where deg ( x ) = # { y : ( x , y ) E } is the total number of edges joining x.
Theorem 3.
Let the IFS be as in (1). Then, we have the following:
(i) 
The OSC holds if and only if the graph G is of bounded degree.
(ii) 
The WSC holds if and only if the quotient space G is of bounded degree.
The idea of the proof is based on graph theory and the iteration rule of an IFS under the quasi-metric d w . We provide an example (see Example 1) to illustrate the conclusion.
Recently, Gromov hyperbolicity andthe hyperbolic boundaries of augmented trees induced by self-similar IFSs have attracted considerable attention (see [11,12,13,14,15,16,17]). However, there are very few related studies on self-affine IFSs. In the second part of this paper, we demonstrate that the augmented tree G inherently possesses Gromov hyperbolicity. This enables the establishment of a canonical association between self-affine IFSs and Gromov hyperbolic graphs, notably achieved without imposing separation conditions.
Theorem 4.
For any IFS as in (1), the augmented tree G : = ( Σ * , E ) is always a Gromov hyperbolic graph (see Definition 1).
Moreover, the hyperbolic boundary G is Hölder equivalent to the self-affine set K, that is, there exists a homeomorphism ψ : G K such that the following can be obtained::
C 1 d w ψ ( η ) , ψ ( ξ ) θ τ α ( η , ξ ) C d w ψ ( η ) , ψ ( ξ ) , η , ξ G ,
where C > 0 , α = log q d τ , q = | det A | and θ τ is a visual metric on G.
The paper is organized as follows: Section 2 describes the basic definitions and properties of Gromov hyperbolic graphs and augmented trees induced by IFSs. Section 3 is devoted to establishing Theorem 3 (by proving Theorems 5 and 6) and Theorem 4.

2. Augmented Tree Induced by IFS

Following the notation in graph theory, let ( X , E ) be a connected graph, where X is a countably infinite set of vertices and E X × X stands for the set of edges. Let π ( x , y ) denote a geodesic path from x to y in X, i.e., a path connecting x , y with the shortest length. Denote the distance between x and y as d ( x , y ) . The degree of a vertex x is defined by deg ( x ) = # { y : ( x , y ) E } , the total number of edges connecting x. A graph ( X , E ) is of a bounded degree if sup { deg ( x ) : x X } < .
The bounded degree of a graph is an important tool for studying the random walks on graphs; however, it should be distinguished from another concept, “locally finite”. A graph is said to be locally finite if every vertex has finite degree (i.e., deg ( x ) < ).
Fix a vertex o in X as a root of the graph. Let | x | = d ( o , x ) denote the distance from the root o to the vertex x. | x | = n means that x is located on the n-th level of the graph. A graph is called a tree if any pair of vertices can be connected by a unique path.
Definition 1
([18]). A graph ( X , E ) is called a Gromov hyperbolic graph, if there exists δ 0 satisfying the following for all x , y , z X :
| x y | min { | x z | , | z y | } δ
where | x y | is the Gromov product of x and y defined by the following:
| x y | : = 1 2 ( | x | + | y | d ( x , y ) ) .
If ( X , E ) is a Gromov hyperbolic graph, we may choose a number τ > 0 such that exp ( 3 δ τ ) < 2 . Define a function on X × X as follows:
θ τ ( x , y ) = exp ( τ | x y | ) x y 0 x = y .
The function θ τ is equivalent to a metric [19]. Hence, it can be treated as a visual metric for convenience. Let X ¯ be the θ τ -completion of X. We call X = X ¯ X the hyperbolic boundary of the Gromov hyperbolic graph X.
Let X be a tree with a root o. It can be easily seen that X is a Gromov hyperbolic graph with δ = 0 , and the hyperbolic boundary is a Cantor set. We use E v to denote the set of edges of X (v for vertical), and X n = { x X : | x | = n } the n-th level of X. Let x 1 be the father of x, i.e., if x X n for n 1 , then there exists a unique x 1 X n 1 such that ( x 1 , x ) E v . Inductively, we can define x m = ( x ( m 1 ) ) 1 as the m-th generation ancestor of x. If every vertex has N offspring, we would call ( X , E v ) an N-ary tree.
Definition 2
([11]). Let ( X , E v ) be a tree with a root o, and let E h ( X × X ) { ( x , x ) : x X } be symmetric. If E h satisfies the following:
( x , y ) E h | x | = | y | ,   a n d   e i t h e r   x 1 = y 1 o r ( x 1 , y 1 ) E h ,
where E = E v E h , we would call ( X , E ) an augmented tree. We call elements in E h horizontal edges.
Moreover, if ( X , E v ) is an N-ary tree, we would call ( X , E ) an N-ary augmented tree.
In general, the geodesic paths from x to y in an augmented tree ( X , E ) are not unique. However, there always exists a canonical geodesic of the following form:
π ( x , y ) = π ( x , u ) π ( u , v ) π ( v , y )
where π ( x , u ) , π ( v , y ) are vertical paths; and π ( u , v ) is a horizontal path (see Figure 1). One or two parts may vanish in the canonical form. For any geodesic π ( x , y ) , the distance from the root o to the geodesics satisfy the following: d ( o , π ( u , v ) ) d ( o , π ( x , y ) ) . Trivially, the Gromov product of x , y can be calculated as follows:
| x y | = h l / 2
where h , l are the level and length of the horizontal part of the canonical geodesic π ( x , y ) , respectively.
Lemma 1
([12]). An augmented tree is a Gromov hyperbolic graph if and only if there exists κ > 0 such that the length of any horizontal geodesic is bounded by κ.
A sequence { x n } n = 0 X is called a geodesic ray and denoted by π ( x 0 , x 1 , ) , if x 0 = o , | x n | = n and ( x n , x n + 1 ) E v . It is useful to identify η X with equivalent rays that converge to η . Two geodesic rays π ( x 0 , x 1 , ) and π ( y 0 , y 1 , ) are called equivalent [19] if and only if there is L > 0 such that
d ( x n , y n ) L
for all but finitely many n. Moreover, the Gromov product can be extended to the boundary X by assuming the following:
| η ξ | = inf { lim n | x n y n | }
where η , ξ X ; and the infimum has taken over all geodesic rays π ( x 0 , x 1 , ) and π ( y 0 , y 1 , ) , converging to η and ξ , respectively.
Given an expansive d × d matrix A with | det A | = q > 1 , the matrix A can define a pseudo-norm w on R d , which satisfies the following fundamental properties:
Proposition 1
([6]). (i) w ( x ) = w ( x ) and w ( x ) 0 , where w ( x ) = 0 if and only if x = 0 ;
(ii) 
w ( A x ) = q 1 d w ( x ) w ( x ) , x R d ;
(iii) 
there is C > 0 , such that for any x , y R d , w ( x + y ) C max { w ( x ) , w ( y ) } .
The w induces a w-distance, as follows:
d w ( x , y ) = w ( x y ) , x , y R d .
It is easy to verify that ( R d , d w ) is a complete quasi-metric space [20]. Moreover, we can define the w-ball B w ( z , r ) = { x : d w ( z , x ) r } ; the w-diameter of a set diam w ( E ) = sup { d w ( x , y ) : x , y E } ; and the w-distance between two sets d w ( E , F ) = inf { d w ( x , y ) : x E , y F } .
Let the IFS { f j } j = 1 N be as in (1); Proposition 1 (ii) tells us the following:
d w ( f j ( x ) , f j ( y ) ) = q 1 d d w ( x , y ) , x , y R d .
Hence, every f j can be regarded as a contracting similitude with contraction ratio r : = q 1 d in the quasi-metric space ( R d , d w ) . Let Σ = { 1 , , N } and Σ * : = n = 0 Σ n be the symbolic space, where Σ 0 = . There is a natural tree structure on Σ * by the standard concatenation of words, and we denote the edge set by E v . That is, ( u , v ) E v if and only if there exists Σ such that u = v or v = u .
Let K be the self-affine set as in (2), and let K u : = f u ( K ) , u Σ * be as in the introduction. Then, we define a set of horizontal edges on Σ * as follows:
E h = { ( u , v ) Σ n × Σ n : u v ,   d w ( K u , K v ) ρ r n , n 1 }
where r = q 1 d < 1 is the contraction ratio of the IFS under quasi-metric d w ; and ρ > 0 is a constant.
Let E = E v E h . It follows from Definition 2 that the graph G : = ( Σ * , E ) is an augmented tree induced by the IFS { f j } j = 1 N in the sense of Kaimanovich.
Lemma 2.
Let { f j } j = 1 N the IFS as in (1). Suppose that the induced augmented tree ( X , E ) is of bounded degree, then f u f v for any u v Σ * .
Proof. 
If otherwise, there are u v Σ * such that f u = f v . For any k 1 , denote as follows:
G k = { x = x 1 x k : x i = u or v , i = 1 , , k } .
Then, f x = f y for all x , y G k . Hence, ( x , y ) E h for all x , y G k , yielding that
deg ( x ) 2 k 1 , for all x G k .
This contradicts the assumption that ( Σ * , E ) is of bounded degree. □
Lemma 3
([20]). If the IFS in (1) satisfies the OSC, then we obtain the following:
(*) for any c > 0 , there exists β ( c ) such that for any n 1 , and any w-ball D with radius c r n in R d , we have # { u Σ n : K u D } β ( c ) .

3. Proof of Main Results

Theorem 5.
The IFS in (1) satisfies the OSC if and only if the graph G : = ( Σ * , E ) is of bounded degree.
Proof. 
If the OSC holds, for any u Σ * with | u | = n , then u Σ n and diam w ( K u ) = r n diam w ( K ) , where r = q 1 d . Let D be a w-ball, with the center at a point in K u and the radius ( diam w ( K ) + 2 ρ ) r n . For any horizontal edge ( u , v ) E h , we have v Σ n and d w ( K u , K v ) ρ r n . Hence, K v D . It follows from Lemma 3 that
# { v Σ n : ( u , v ) E h } β ( 2 ρ + diam w ( K ) ) .
Since ( Σ * , E v ) is an N-ary tree, there are at most N + 1 terms v such that ( u , v ) E v is a vertical edge. Thus, the degree of u is as follows:
deg ( u ) N + 1 + β ( 2 ρ + diam w ( K ) ) ,
proving that ( X , E ) is of bounded degree.
On the contrary, first of all, we claim that the condition (*) in Lemma 3 is true. Otherwise, there is c > 0 ; for any β > 0 , there is n 1 and a w-ball D with radius c r n , as follows:
# { u Σ n : K u D } > β .
Let X n , D = { u Σ n : K u D } and let
D = u X n , D K u .
It follows that
diam w ( D ) 2 diam w ( K ) r n + 2 c r n = 2 ( diam w ( K ) + c ) r n .
Select a family of open ball sets { D 1 , , D k 0 } with radius 1 2 ρ r n to cover D , where k 0 is independent of n and ρ is a constant in the definition of E h . According to the pigeonhole principle, there exists a ball D i 0 that intersects at least β : = [ β k 0 ] (the largest integer β k 0 ) sets of K u , u X n , D , say, K u 1 , K u 2 , , K u β . This implies that, for any integers i , j [ 1 , β ] , d w ( K u i , K u j ) ρ r n . By (6), ( u i , u j ) E h ( i j ) , hence
deg ( u i ) β 1 i = 1 , , β .
Since β can be sufficiently large, β can also be sufficiently large. It contradicts the assumption of bounded degree. We have proven the claim.
Finally, we show that the OSC is satisfied by constructing the desired open set. For the IFS in (1), take an open ball D R d satisfying K j = 1 N f j ( D ) D . The above claim allows us to yield the following:
γ = sup n 1 max u Σ n # { f v : v Σ n , f u ( D ) f v ( D ) } < .
Hence, there are u 1 , , u γ Σ n for some n 1 such that f u 1 ( D ) f u i ( D ) and f u i ’s are distinct. Let
U = v Σ * f v u 1 ( D ) .
It suffices to show that U is the open set defining the OSC. Clearly, U D is open and bounded and j = 1 N f j ( U ) U . If the union is not disjointed, then there exists two distinct i 0 , j 0 such that f i 0 ( U ) f j 0 ( U ) . From the definition of U, it follows that there are v 1 , v 2 Σ * , which can be expressed as follows:
f i 0 v 1 u 1 ( D ) f j 0 v 2 u 1 ( D ) .
Without loss of generality, we may assume that the two words i 0 v 1 u 1 , j 0 v 2 u 1 lie in the same level, say Σ n 1 (otherwise, we can choose a prefix of the longer one).
{ f v : v Σ n 1 , f i 0 v 1 u 1 ( D ) f v ( D ) } { f i 0 v 1 u i : i = 1 , , γ } { f j 0 v 2 u 1 } .
It follows from Lemma 2 that the right-hand side set contains γ + 1 different functions, which contradicts the maximality of γ . We have completed the proof. □
In the absence of the OSC, we need to modify the graph G = ( Σ * , E ) as follows. First, we define a relation ∼ on the symbolic space Σ * . For u , v Σ * , denote by u v if f u = f v . Trivially, ∼ is an equivalence relation. Let Σ * / be the quotient of Σ * and [ u ] the equivalence class containing u . In this situation, ( u , v ) E v if and only if there exist i [ u ] , j [ v ] and some Σ , such that j = i or i = j . We call G : = ( Σ * / , E ) the quotient space of the graph G = ( Σ * , E ) . Subsequently, we still consider u as [ u ] for convenience. It should be mentioned that we have G = G if the OSC holds.
Theorem 6.
The IFS in (1) satisfies the WSC if and only if the quotient space G : = ( Σ * / , E ) is of bounded degree.
Proof. 
The proof of sufficiency is analogous to that of Theorem 5, so we only need to show the necessity. For any [ u ] Σ * / with | u | = n , then u Σ n . Let D u be the ( ρ r n ) -neighborhood of K u , as follows:
D u = { x R d : d w ( x , K u ) ρ r n } .
By the definition of horizontal edge set, for any ( u , v ) E h , we have d w ( K u , K v ) ρ r n , that means K v D u . It is easy to verify the following:
diam w ( D u ) diam w ( K u ) + 2 ρ r n = ( diam w ( K ) + 2 ρ ) r n .
By (3), we have the following:
# { v Σ * / : ( u , v ) E h } β ( diam w ( K ) + 2 ρ ) .
For the vertical edges ( u , v ) E v , we have | v | = | u | + 1 or | v | = | u | 1 , and K u K v D u K v . By using (3) again, we have the following:
# { v Σ * / : ( u , v ) E v } β ( r ( diam w ( K ) + 2 ρ ) ) + β ( r 1 ( diam w ( K ) + 2 ρ ) ) .
Therefore, combining the horizontal and vertical edges, we can draw the following conclusion:
deg ( u ) β ( diam w ( K ) + 2 ρ ) + β ( r ( diam w ( K ) + 2 ρ ) ) + β ( r 1 ( diam w ( K ) + 2 ρ ) ) ,
and G is of bounded degree. □
Example 1.
Let A = 4 0 0 3 , and D , D be two digit sets as follows:
D = { d 1 , d 2 , d 3 , d 4 } = 0 0 , 1 1 , 2 1 , 3 2 , D = { d 1 , d 2 , d 3 , d 4 } = 0 0 , 3 / 4 2 / 3 , 2 1 , 3 2 .
Define one IFS { f i } i = 1 4 as f i ( x ) = A 1 ( x + d i ) (see Figure 2a) and the other IFS { g i } i = 1 4 as g i ( x ) = A 1 ( x + d i ) (see Figure 2b).
It is easy to verify that the IFS { f i } i = 1 4 satisfies the OSC by taking the interior of the unit square as the open set, and the graph G = ( Σ * , E ) as of bounded degree. In fact, for any vertex x Σ * , the corresponding small rectangle f x ( [ 0 , 1 ] 2 ) intersects at most 8 rectangles with the same size; hence, by the definition of the augmented tree, x has 1 father, 4 children, and at most 8 neighbors. Consequently, we have
deg ( x ) 1 + 4 + 8 = 11 .
According to Theorem 2, we know that the IFS { g i } i = 1 4 satisfies the WSC, but not the OSC. Hence, the graph G = ( Σ * , E ) is not of bounded degree by Theorem 5. It can also be verified immediately. For x = 14 , y = 21 , we have g x = g y (see Figure 2b). For any k 1 , let G k = { u = x 1 x k : x i = x or y , i = 1 , , k } . It follows that g u = g v for any u , v G k . Thus, the degree of the vertex u G k Σ * is at least 2 k 1 . Therefore, G = ( Σ * , E ) is not of bounded degree.
On the other hand, if we consider x = { 14 , 21 } as an equivalence class, i.e., a vertex in the quotient space Σ * / . Theorem 6 implies that G : = ( Σ * / , E ) is of bounded degree.
Proof of Theorem 4. 
We first prove that the graph G = ( Σ * , E ) is a Gromov hyperbolic graph by contradiction. Suppose G is not hyperbolic, then by Lemma 1, for any integer m 1 , there exists a horizontal geodesic π ( u 0 , u 1 , , u 3 m ) with u i Σ n for some n 1 . The length of the geodesic is 3 m . We can find another path p ( u 0 , u 0 1 , , o , , u 3 m 1 , u 3 m ) from u 0 to u 3 m , where o is the root of G. It follows that 3 m 2 n , then m < n . We consider the set { u 0 m , u 1 m , , u 3 m m } , which is the m-th generation ancestor of π ( u 0 , u 1 , , u 3 m ) . Definition 2 implies that either u i m = u i + 1 m or ( u i m , u i + 1 m ) E h . Hence, there exists a shortest horizontal path, say, p ( v 0 , , v l ) , joining u 0 m and u 3 m m , where v 0 = u 0 m , v l = u 3 m m , and v j { u 0 m , u 1 m , , u 3 m m } , i = 0 , 1 , , l (see Figure 3). Therefore, we obtain a new path from u 0 to u 3 m as follows:
π ( u 0 , u 0 1 , , u 0 m ) p ( v 0 , , v l ) π ( u 3 m m , , u 3 m 1 , u 3 m ) .
By the property of geodesic, the length of path p ( v 0 , , v l ) is as follows:
l = | p ( v 0 , , v l ) | 3 m 2 m = m .
Through the following:
E = i = 0 3 m K u i , E = i = 0 l K v i ,
we can estimate the w-diameters of E and E . Since u i Σ n and ( u i , u i + 1 ) E h , we have diam w ( K u i ) r n diam w ( K ) and d w ( K u i , K u i + 1 ) ρ r n . Hence, we determine the following:
diam w ( E ) i = 0 3 m diam w ( K u i ) + i = 0 3 m 1 d w ( K u i , K u i + 1 ) ( 3 m + 1 ) r n diam w ( K ) + 3 m ρ r n < ( 3 m + 1 ) ( diam w ( K ) + ρ ) r n .
Since for any v j , there is i satisfying v j = u i m , it follows that K u i K v j , and E K v j . Then, considering the following:
diam w ( E ) diam w ( E ) + 2 max 0 i l { diam w K v i } < ( 3 m + 1 ) ( diam w ( K ) + ρ ) r n + 2 diam w ( K ) r n m ,
we can choose m sufficiently large such that ( 3 m + 1 ) ( diam w ( K ) + ρ ) r m < diam w ( K ) . It is straightforward to obtain the following:
diam w ( E ) < 3 diam w ( K ) r n m .
Let E 0 = A n m E , then there exists a ball B with radius 3 diam w ( K ) such that
E 0 = i = 0 l A n m K v i B .
Let a j A n m K v j , j = 1 , , l and let l = [ l 2 ] , the largest integer that is not greater than l 2 . By assumption, p ( v 0 , , v l ) is the shortest horizontal path from v 0 to v l . Hence, ( v i , v j ) E h for any j > i + 1 . It follows that d w ( K v i , K v j ) > ρ r n m , as well as the following:
d w ( a i , a j ) d w ( A n m K v i , A n m K v j ) > ρ .
By applying the pigeonhole principle, the ball B contains at least l + 1 points a 0 , a 2 , , a 2 l such that the w-distance between any two of them is at least ρ . By (7), we have l + 1 m 2 , which is impossible, as m can be taken arbitrarily large. Hence, we have proven the hyperbolicity of G.
For any point η G , we let π [ u 0 , u 1 , ] be a geodesic ray representing η . Define a map ψ : G K as follows:
ψ ( η ) = lim n f u n ( x 0 ) .
for some x 0 K . The bijection of ψ follows from [12] or [14] immediately. It remains to verify the Hölder inequality (4).
Let η = π [ u 0 , u 1 , ] , ξ = π [ v 0 , v 1 , ] be two different geodesic rays. There is a canonical bilateral geodesic ζ connecting η and ξ , as follows:
ζ = π [ , v n + 1 , v n , t 1 , , t l , u n , u n + 1 , ]
where v n , t 1 , , t l , u n lie in the same level, say, Σ n . Thus, we can deduce the following:
d w ( f v n ( x 0 ) , f u n ( x 0 ) ) ( l + 2 ) r n diam w ( K ) + ( l + 1 ) ρ r n .
Note that for any m 0 , we have :
ψ ( ξ ) K v n + m K v n and ψ ( η ) K u n + m K u n .
which implies that
d w ( ψ ( η ) , f u n ( x 0 ) ) r n diam w ( K ) , d w ( ψ ( ξ ) , f v n ( x 0 ) ) r n diam w ( K ) .
By making use of Proposition 1 (iii) twice, we can conclude the following:
d w ( ψ ( η ) , ψ ( ξ ) ) = w ( ψ ( η ) f u n ( x 0 ) + f u n ( x 0 ) f v n ( x 0 ) + f v n ( x 0 ) ψ ( ξ ) ) C 0 r n ,
where C 0 > 0 is a constant.
By (5) and (9), the Gromov product | η ξ | = n l + 1 2 . Thus, we have the following:
θ τ ( η , ξ ) = exp ( τ | η ξ | ) = exp { τ ( n 1 2 ( l + 1 ) ) } .
By Lemma 1, the length l + 1 of the horizontal geodesic π [ v n , t 1 , , t l , u n ] is bounded by κ . It implies that there is C 1 > 0 , resulting in the following:
C 1 exp ( τ n ) θ τ ( η , ξ ) C 1 exp ( τ n ) .
Hence, we determine the following:
d w ( ψ ( η ) , ψ ( ξ ) ) C 2 θ τ α ( η , ξ )
where C 2 > 0 , α = log q d τ .
On the other hand, it is clear that ( v n + 1 , u n + 1 ) E h . Then, d w ( K v n + 1 , K u n + 1 ) > ρ r n + 1 . Using (10) again, there is C 3 > 0 , allowing us to achieve the following:
d w ( ψ ( η ) , ψ ( ξ ) ) d w ( K v n + 1 , K u n + 1 ) ρ r exp ( τ n α ) C 3 θ τ α ( η , ξ ) .
Therefore, we obtain (4) and complete the proof. □

4. Conclusions

In this paper, we demonstrate the close relationship between a self-affine IFS and an augmented tree induced by the IFS. First, we propose a novel characterization of the OSC and WSC in the IFS by using the bounded degree of the augmented tree, providing a unified framework to analyze separation properties of IFSs via graph-theoretic invariants. Second, we show that the augmented tree is a Gromov hyperbolic graph, and its hyperbolic boundary is Hölder equivalent to the self-affine set generated by the IFS, establishing a canonical association between self-affine IFSs and Gromov hyperbolic graphs.

Author Contributions

Conceptualization, J.L. and Y.W.; Methodology, M.-Q.B. and Y.W.; Writing—original draft, M.-Q.B. and Y.W.; Writing—review & editing, M.-Q.B. and J.L.; Supervision, J.L.; Project administration, J.L. All authors have read and agreed to the published version of the manuscript.

Funding

The research was supported by the Natural Science Foundation of Chongqing (No. CSTB2023NSCQ-MSX0553).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest..

References

  1. Falconer, K.J. Fractal Geometry: Mathematical Foundations and Applications, 2nd ed.; Wiley: Hoboken, NJ, USA, 2003. [Google Scholar]
  2. Hutchinson, J.E. Fractals and self-similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  3. Lagarias, J.C.; Wang, Y. Self-affine tiles in Rn. Adv. Math. 1996, 121, 21–49. [Google Scholar] [CrossRef]
  4. Schief, A. Separation properties for self-similar sets. Proc. Am. Math. Soc. 1994, 122, 111–115. [Google Scholar] [CrossRef]
  5. Fu, X.Y.; Gabardo, J.P.; Qiu, H. Open set condition and pseudo Hausdorff measure of self-affine IFSs. Nonlinearity 2020, 33, 2592–2614. [Google Scholar] [CrossRef]
  6. He, X.G.; Lau, K.S. On a generalized dimension of self-affine fractals. Math. Nachr. 2008, 281, 1142–1158. [Google Scholar] [CrossRef]
  7. Lau, K.S.; Ngai, S.M. Multifractal measures and a weak separation condition. Adv. Math. 1999, 141, 45–96. [Google Scholar] [CrossRef]
  8. Zerner, M.P.W. Weak separation properties for self-similar sets. Proc. Amer. Math. Soc. 1996, 124, 3529–3539. [Google Scholar] [CrossRef]
  9. Deng, Q.R. Absolute continuity of vector-valued self-affine measures. J. Math. Anal. Appl. 2008, 342, 1250–1264. [Google Scholar] [CrossRef]
  10. Deng, Q.R.; Lau, K.S.; Ngai, S.M. Separation conditions for iterated function systems with overlaps. In Fractal Geometry and Dynamical Systems in Pure and Applied Mathematics I: Fractals in Pure Mathematics; Contemporary Mathematics 600; American Mathematical Society: Providence, RI, USA, 2013; pp. 1–20. [Google Scholar]
  11. Kaimanovich, V.A. Random walks on Sierpiński graphs: Hyperbolicity and stochastic homogenization. In Fractals in Graz 2001; Trends in Mathematics; Birkhäuser: Basel, Switzerland, 2003; pp. 145–183. [Google Scholar]
  12. Lau, K.S.; Wang, X.Y. Self-similar sets as hyperbolic boundaries. Indiana Univ. Math. J. 2009, 58, 1777–1795. [Google Scholar] [CrossRef]
  13. Kong, S.L.; Lau, K.S.; Y, X. Wang, Gromov hyperbolic graphs arising from iterations. Adv. Math. 2021, 389, 107908. [Google Scholar] [CrossRef]
  14. Lau, K.S.; Wang, X.Y. On hyperbolic graphs induced by iterated function systems. Adv. Math. 2017, 313, 357–378. [Google Scholar] [CrossRef]
  15. Luo, J.J. Self-similar sets, simple augmented trees, and their Lipschitz equivalence. J. Lond. Math. Soc. 2019, 99, 428–446. [Google Scholar] [CrossRef]
  16. Luo, J.J.; Lau, K.S. Lipschitz equivalence of self-similar sets and hyperbolic boundaries. Adv. Math. 2013, 235, 555–579. [Google Scholar] [CrossRef]
  17. Wang, X.Y. Graphs induced by iterated function systems. Math. Z. 2014, 277, 829–845. [Google Scholar] [CrossRef]
  18. Gromov, M. In Essays in Group Theory; Hyperbolic groups. Springer: New York, NY, USA, 1987; Volume 8, pp. 75–263, Mathematical Sciences Research Institute Publications. [Google Scholar]
  19. Woess, W. Random Walks on Infinite Graphs and Groups; Cambridge Tracts in Mathematics 138; Cambridge University Press: Cambridge, UK, 2000. [Google Scholar]
  20. Luo, J.J. On the Lipschitz equivalence of self-affine sets. Math. Nachr. 2019, 292, 1032–1042. [Google Scholar] [CrossRef]
Figure 1. Canonical geodesic.
Figure 1. Canonical geodesic.
Fractalfract 09 00307 g001
Figure 2. First iteration of two IFSs.
Figure 2. First iteration of two IFSs.
Fractalfract 09 00307 g002
Figure 3. The two paths from u 0 to u 3 m .
Figure 3. The two paths from u 0 to u 3 m .
Fractalfract 09 00307 g003
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

Bai, M.-Q.; Luo, J.; Wu, Y. Graph-Theoretic Characterization of Separation Conditions in Self-Affine Iterated Function Systems. Fractal Fract. 2025, 9, 307. https://doi.org/10.3390/fractalfract9050307

AMA Style

Bai M-Q, Luo J, Wu Y. Graph-Theoretic Characterization of Separation Conditions in Self-Affine Iterated Function Systems. Fractal and Fractional. 2025; 9(5):307. https://doi.org/10.3390/fractalfract9050307

Chicago/Turabian Style

Bai, Ming-Qi, Jun Luo, and Yi Wu. 2025. "Graph-Theoretic Characterization of Separation Conditions in Self-Affine Iterated Function Systems" Fractal and Fractional 9, no. 5: 307. https://doi.org/10.3390/fractalfract9050307

APA Style

Bai, M.-Q., Luo, J., & Wu, Y. (2025). Graph-Theoretic Characterization of Separation Conditions in Self-Affine Iterated Function Systems. Fractal and Fractional, 9(5), 307. https://doi.org/10.3390/fractalfract9050307

Article Metrics

Back to TopTop