Next Article in Journal
On the Integral of the Fractional Brownian Motion and Some Pseudo-Fractional Gaussian Processes
Previous Article in Journal
A New Method for De-Noising of Well Test Pressure Data Base on Legendre Approximation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Continuous Orbit Equivalence on Self-Similar Graph Actions

Department of Mathematics Education, Ewha Womans University, Seoul 03760, Korea
Mathematics 2019, 7(10), 990; https://doi.org/10.3390/math7100990
Submission received: 31 July 2019 / Revised: 12 October 2019 / Accepted: 16 October 2019 / Published: 18 October 2019

Abstract

:
For self-similar graph actions, we show that isomorphic inverse semigroups associated to a self-similar graph action are a complete invariant for the continuous orbit equivalence of inverse semigroup actions on infinite path spaces.

1. Introduction

Following the groundbreaking result of Giordano, Putnam, and Skau concerning orbit equivalence on Cantor minimal systems [1], Matsumoto [2] introduced the continuous orbit equivalence of one-sided subshifts of finite type. Recently, Matsumoto’s concept has been generalized to many different cases. Among these many generalizations, our interests lie in group actions and inverse semigroup actions on Cantor sets, defined by Li [3] and Cordeiro and Beuter [4], respectively.
Li [3] showed that the continuous orbit equivalence of graphs is equivalent to the continuous orbit equivalence of the actions of groups generated by the edge sets of graphs to the infinite path spaces of graphs. Furthermore, Cordeiro and Beuter [4] showed that the continuous orbit equivalence of graphs is equivalent to the continuous orbit equivalence of the actions of inverse semigroups that are naturally associated with graphs on the infinite path spaces of graphs. Combining these two results for graphs with mild restrictions, it follows that the continuous orbit equivalence of group actions is equivalent to that of inverse semigroup actions. For self-similar group cases, the author obtained positive results for group actions and inverse semigroup actions [5]. Thus, it is natural to ask whether we can extend the aforementioned equivalences between group actions and inverse semigroup actions to self-similar graph actions, which provided the motivation for the present study.
In this paper, we show that for self-similar graph actions and their inverse semigroups, the inverse semigroups are isomorphic if and only if their actions are continuous orbit equivalent (Theorem 2). For relations between group actions and inverse semigroup actions, we show that the transformation groupoid of the group action is a subgroupoid of the groupoid of germs of inverse semigroup actions. However, in reality, there is a significant obstacle to further extensions. We discuss some reasons behind this difficulty and directions for future steps.

2. Self-Similar Graph Actions

We review the properties of self-similar graph actions defined by Exel and Pardo [6]. All the material in this section is taken from works [6,7,8].
Suppose that E = ( E 0 , E 1 , d , r ) is a directed graph, where E 0 is the set of vertices, E 1 is the set of edges, d is the domain map, and r is the range map. A directed graph E is called finite if E 0 and E 1 are finite sets. For a natural number n, a path of length n in E is a finite sequence of the form
a = a 1 a 2 a n ,
where a i E 1 and r ( a i ) = d ( a i + 1 ) for every i. The domain and range of a are defined by d ( a ) = d ( a 1 ) and r ( a ) = r ( a n ) , respectively. A vertex v E 0 is considered as a path of length 0, with d ( v ) = r ( v ) = v . If a and b are paths such that r ( a ) = d ( b ) , then we denote the path obtained by juxtaposing a and b by a b . We use | a | to denote the length of a. For every non-negative integer n, we denote the set of paths of length n in E by E n and define E = n 0 E n . The set of right-infinite paths of the form a 1 a 2 is denoted by E ω .
The product topology of a discrete set E is defined on E ω . The cylinder set Z ( a ) for each a E is defined by
Z ( a ) = { ξ E ω : ξ = x 1 x 2 such that x 1 x | a | = a } .
Then, the collection of all such cylinder sets forms a basis for the product topology on E ω .
An automorphism of a directed graph E is a bijective map τ : E 0 ˙ E 1 E 0 ˙ E 1 , such that τ ( E i ) E i for i = 0 , 1 , d τ = τ d , and r τ = τ r on E 1 . An action of a group G on a directed graph E is a group homomorphism from G to the group of all automorphisms of E. To simplify the notation, we will adopt the shorthand notation
τ g ( ξ ) = g ( ξ ) .
A self-similar graph action ( G , E , ϕ ) consists of a directed graph E and an action of a group G on E by automorphisms, with a one-cocycle ϕ : G × E 1 G , such that for all g , h G and e E 1 ,
ϕ ( g h , e ) = ϕ ( g , h ( e ) ) ϕ ( h , e ) .
As Exel and Pardo showed in ([6] Proposition 2.4), the G action and one-cocycle extend to E via the inductive formula
g ( e 1 e 2 ) = g ( e 1 ) ϕ ( g , e 1 ) ( e 2 )
for e 1 , e 2 E 1 with r ( e 1 ) = d ( e 2 ) , so that we have
g ( a b ) = g ( a ) ϕ ( g , a ) ( b )
for every a , b E with r ( a ) = d ( b ) . In addition, the G action induces an action of G on E ω given by
g ( x 1 x 2 ) = g ( x 1 x n ) ϕ ( g , x 1 x n ) ( x n + 1 ) .
It is not difficult to obtain the following properties of restrictions. For g , h G and a , b E with r ( a ) = d ( b ) ,
ϕ ( g , a b ) = ϕ ( ϕ ( g , a ) , b ) , ϕ ( g h , a ) = ϕ ( g , h ( a ) ) ϕ ( h , a ) , ϕ ( g , a ) 1 = ϕ ( g 1 , g a ) .
A self-similar graph action ( G , E , ϕ ) is called pseudo-free if for any ( g , e ) G × E 1 satisfying g e = e and ϕ ( g , e ) = 1 , it holds that g = 1 . We say that the G action on E ω is topologically free if { ξ E ω : g ( ξ ) ξ } is dense in E ω for every 1 g G . A path a = a 1 a n in E is said to have an entry if there is at least one i { 1 , , n } such that r 1 ( d ( a i ) ) has more than one element.
Assumption 1.
In this study, we assume the following,
1.
Every group is a finitely generated countable group,
2.
every graph is a connected finite directed graph with the properties that every circuit has an entry and d 1 ( v ) and r 1 ( v ) are nonempty sets for every vertex,
3.
every finite path has an entry,
4.
our self-similar graph action ( G , X , ϕ ) is pseudo-free, and
5.
the G action on X ω is topologically free.

Inverse Semigroups and Groupoids

Suppose that ( G , E , ϕ ) is a self-similar graph action. An inverse semigroup S G , E of ( G , E , ϕ ) is defined as follows ([6] §4),
S G , E = { ( a , g , b ) E × G × E : r ( a ) = g ( r ( b ) ) } { 0 } ,
with the binary operation defined by
( a , g , b ) ( c , h , d ) = ( a g ( e ) , ϕ ( g , e ) h , d ) if c = b e , ( a , g ϕ ( h 1 , e ) 1 , d h 1 ( e ) ) if b = c e , 0 otherwise ,
and the unitary adjoint operation defined by
( a , g , b ) = ( b , g 1 , a ) .
Then, S G , E is an inverse semigroup containing zero, whose idempotent semi-lattice is given by
E G , E = { ( a , 1 , a ) : a E } { 0 } .
The inverse semigroup S G , E has a canonical action on E ω in terms of partial homeomorphisms: The domain of ( a , g , b ) is
Z ( b ) = { b ξ E ω : ξ E ω }
and
( a , g , b ) : b ξ a g ( ξ ) .
We note that 0 S G , E is the empty map.
Now, we briefly describe groupoids of germs of inverse semigroups and groups. Let X be a locally compact Hausdorff space and S an inverse semigroup (or a group) acting on X. Then, consider a set Ω = { ( s , x ) S × X : x Dom ( s ) } , and define an equivalence relation on Ω by ( s , x ) ( t , y ) if and only if x = y and s and t coincide on a neighborhood of x. The equivalence class of every ( s , x ) Ω is called the germ of s at x, denoted by [ s , x ] . The set of every germ is a groupoid, called the groupoid of germs of S on X, whose operations are given by
d ( [ s , x ] ) = x , r ( [ s , x ] ) = s x , [ s , x ] 1 = [ s , s x ] ( or [ s 1 , s x ] when S is a group ) .
The unit space is identified with X. When two germs [ s , x ] and [ t , y ] satisfy x = t y , their product is defined as
[ s , x ] [ t , y ] = [ s t , y ] .
A basis for a topology is given by the collection of sets of the form
[ s , U ] = { [ s , x ] : s S , U X is open , x U Dom ( s ) } .
The groupoid of germs of the S G , E action on E ω is denoted by C G , E , and called the Cuntz–Pimsner groupoid of ( G , E , ϕ ) .
We recall that an inverse semigroup S has an order relation defined by
s t s = t s s for all s , t S .
An inverse semigroup S is said to be E -unitary (or 0-E-unitary in [9]) if for any s S and a nonzero idempotent e of S, e s implies that s is idempotent ([9] Chapter 9). When S is an E -unitary inverse semigroup acting on a topological space, the action is called topologically free if for every non-idempotent element s S , the set of fixed points for s has an empty interior ([10] Proposition 4.4).
Remark 1.
Under our Assumptions, the following properties hold.
1.
The inverse semigroup S G , E is E -unitary, by ([6] Proposition 5.8).
2.
The S G , E -action on E ω is topologically free by ([6] Corollary 14.13).
3.
In [6], Exel and Pardo considered a different notion of groupoids of germs; however, fortunately, their definition and the one given above coincide. See ([6] §14) for further details.
4.
The groupoid of germs C G , E is Hausdorff by ([6] Proposition 12.1), essentially principal by ([10] Theorem 4.7), and trivially étale and locally compact with a second countable unit space.

Orbit Equivalence of Self-Similar Graph Actions

We review the notions of orbit equivalence for group actions and inverse semigroup actions. See [3,4] for further details.
We consider two self-similar graph actions, ( G , E , ϕ ) and ( H , F , ψ ) , satisfying our assumptions, with corresponding right-infinite path spaces E ω and F ω and inverse semigroups S G , E and S H , F , respectively. For the next definition, we let
S G , E E ω = { ( s , ξ ) : s S G , E , ξ E ω , ξ Dom ( s ) } .
Definition 1
([4] Definition 8.1). The partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) are said to be continuously orbit equivalent if there exist a homeomorphism
f : E ω F ω
and continuous maps
a : S G , E E ω S H , F and b : S H , F F ω S G , E
such that
f ( s ( ξ ) ) = a ( s , ξ ) f ( ξ ) and f 1 ( t ( η ) ) = b ( t , η ) f 1 ( η )
for all s S G , E , ξ Dom ( s ) , t S H , F , and η Dom ( t ) .
Remark 2.
If the semigroup actions on right-infinite path spaces are topologically free, then the continuous maps a and b are uniquely determined. See ([3] Remark 2.7) for a complete explanation.
Theorem 1
([4] Theorem 8.15). Suppose that ( G , E , ϕ ) and ( H , F , ψ ) are self-similar graph actions with corresponding partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) and Cuntz–Pimsner groupoids C G , E and C H , F , respectively. Then, the following statements are equivalent.
1.
The partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) are continuously orbit equivalent.
2.
The Cuntz–Pimsner groupoids C G , E and C H , F are topologically isomorphic.
3.
There is a diagonal-preserving isomorphism between the groupoid algebras C ( C G , E ) and C ( C H , F ) .

3. Continuous Orbit Equivalences

In this section, we improve Theorem 1 by showing that isomorphic inverse semigroups of self-similar graph actions are also a complete invariant of the topological orbit equivalence of inverse semigroup actions. For this purpose, we will prove that isomorphic inverse semigroups implies isomorphic Cuntz-Pimsner groupoids (Proposition 1) and that continuous orbit equivalence induces continuous orbit equivalence (Proposition 2).
Recall in [11] that the respective inverse semigroups S G , E and S H , F of the self-similar graph actions ( G , E , ϕ ) and ( H , Y , ψ ) are isomorphic if there exists a homeomorphism f : E ω F ω , such that
f S G , E f 1 = { f α f 1 : α S G , E } = S H , F .
Proposition 1.
Suppose that ( G , E , ϕ ) and ( H , F , ψ ) are self-similar graph actions with corresponding inverse semigroups S G , E and S H , F and Cuntz–Pimsner groupoids C G , E and C H , F , respectively. If S G , E and S H , F isomorphic, then C G , E and C H , F are isomorphic as topological groupoids.
Proof. 
Suppose that S G , E is isomorphic to S H , F and that f : E ω E ω is the homeomorphism defined above. Then, we define f ˜ : C G , E C H , F by
[ α , ξ ] [ f α f 1 , f ( ξ ) ] .
First, we need to show that f ˜ is well defined. If [ α , ξ ] = [ β , ξ ] holds in C G , E , then there exists a neighborhood U of ξ in E ω such that α | U = β | U . We recall that f is a homeomorphism, and so f ( U ) is a neighborhood of f ( ξ ) . Thus, we have
f α f 1 | f ( U ) = f α | U = f β | U = f β f 1 | f ( U ) ,
implying that [ f α f 1 , f ( ξ ) ] = [ f β f 1 , f ( ξ ) ] . Therefore, f ˜ is a well-defined map.
Conversely, if we have [ f α f 1 , f ( ξ ) ] = [ f β f 1 , f ( ξ ) ] , then f ( ξ ) = f ( η ) , implying that ξ = η as f is a homeomorphism. Therefore, there exists a neighborhood V of f ( ξ ) = f ( η ) such that
f α | f 1 ( V ) = f α f 1 | V = f β f 1 | V = f β | f 1 ( V ) .
Again, f is a homeomorphism, implying that f 1 ( V ) is a neighborhood of ξ and
α | f 1 ( V ) = β | f 1 ( V ) .
Thus, f ˜ is an injection.
For every [ γ , ζ ] C H , F , it is easy to see that [ f 1 γ f , f 1 ( ζ ) ] C G , E and
f ˜ ( [ f 1 γ f , f 1 ( ζ ) ] ) = [ γ , ζ ] .
Therefore, f ˜ is a surjection.
If [ α , ξ ] and [ β , η ] are composable in C G , E with
ξ = β ( η ) and [ α , ξ ] · [ β , η ] = [ α β , η ] ,
then f ( ξ ) = f β ( η ) implies that [ f α f 1 , f ( ξ ) ] and [ f β f 1 , f ( η ) ] are composable in C H , F , and
f ˜ ( [ α , ξ ] ) · f ˜ ( [ β , η ] ) = [ f α f 1 , f ( ξ ) ] · [ f β f 1 , f ( η ) ] = [ f α f 1 f β f 1 , f ( η ) ] = [ f α β f 1 , f ( η ) ] = f ˜ ( [ α β , η ] ) = f ˜ ( [ α , ξ ] · [ β , η ] ) .
Therefore, f ˜ is a groupoid homomorphism.
To show that f ˜ is continuous, let [ γ , V ] be a base element of the germ topology on C H , F . Because V is an open set in F ω , f 1 ( V ) is an open set in E ω , and
f ˜ 1 ( [ γ , V ] ) = [ f 1 γ f , f 1 ( V ) ]
is a base element of the germ topology of C G , E . Thus, f ˜ is a continuous map, and by the same argument so is f ˜ 1 . Therefore, f ˜ is a continuous isomorphism, and C G , E and C H , F are isomorphic as topological groupoids. □
Lemma 1.
Every compact open subset of E ω is a disjoint union of cylinder sets.
Proof. 
Let U be a compact open subset of E ω . Then, the open condition implies that U is a union of cylinder sets, say U = Z ( u a ) , because the collection of cylinder sets is a base of the topology on E ω . Therefore, { Z ( u a ) } is an open covering of a compact set U, and there exists a finite subcover { Z ( u 1 ) , , Z ( u n ) } .
If there exist u i and u j such that u j = u i v for some v E , then Z ( u j ) Z ( u i ) implies that we can remove Z ( u j ) from the finite subcover { Z ( u 1 ) , , Z ( u n ) } . Therefore, without loss of generality, for any two u i and u j we may say that u j u i v for any v E . Thus, the finite subcover { Z ( u 1 ) , , Z ( u n ) } is a disjoint collection. Then U Z ( u i ) Z ( u a ) = U implies that U is a disjoint union of cylinder sets. □
Lemma 2.
Let ( G , E , ϕ ) and ( H , F , ψ ) be self-similar graph actions such that their partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) are continuously orbit equivalent by f : E ω F ω , a : S G , E E ω S H , F , and b : S H , F F ω S G , E . Then, for every ( u , g , v ) S G , E and ξ = v η E ω , there exists a neighborhood U of ξ such that a is a constant map on U.
Proof. 
Let f : E ω F ω , a : S G , E E ω S H , F , and b : S H , F F ω S G , E be as in Definition 1. For a fixed ( u , g , v ) S G , E and ξ = v η E ω , we can find a neighborhood U of ξ such that
a ( ( u , g , v ) , ζ ) = a ( ( u , g , v ) , ξ )
for every ζ U .
Because Z ( v ) is a compact open set in E ω , f ( Z ( v ) ) is also a compact open set in F ω , because f is a homeomorphism. Then, Lemma 1 implies that there exist finitely many disjoint cylinder sets Z ( x i ) F ω such that
f ( Z ( v ) ) = Z ( x i ) .
Therefore, there exists a unique element x { x 1 , x n } such that
f ( ξ ) = f ( v η ) Z ( x ) .
On the other hand, we recall that ( u , g , v ) S G , E is a partial homeomorphism on E ω whose domain is Z ( v ) . Therefore, f ( u , g , v ) ( Z ( v ) ) is a compact open set in F ω , and we can choose finitely many disjoint cylinder sets Z ( y j ) F ω , such that
f ( u , g , v ) ( Z ( v ) ) = Z ( y j ) .
Let y be the unique element in { y 1 , y m } such that
f ( u , g , v ) ( ξ ) = f ( u , g , v ) ( v η ) = f ( u g ( η ) ) Z ( y ) .
Then, continuous orbit equivalence implies that there exists a unique h H such that
f ( u , g , v ) ( ξ ) = a ( ( u , g , v ) , ξ ) f ( ξ ) = ( y , h , x ) f ( ξ ) .
We define
U = f 1 ( Z ( x ) ) ( v , g 1 , u ) f 1 ( y , h , x ) ( Z ( x ) ) .
It is easy to observe that U is an open set because Z ( x ) is an open set, f is a homeomorphism and ( u , g , v ) = ( v , g 1 , u ) and ( y , h , x ) are partial homeomorphisms on their domains. Moreover, f ( ξ ) Z ( x ) and f ( u , g , v ) ( ξ ) ( y , h , x ) ( Z ( x ) ) imply that U is a neighborhood of ξ .
Now, we show that a : S G , E E ω S H , F is a constant map on U. For every ζ U , we have
f ( ζ ) Z ( x ) and f ( u , g , v ) ( ζ ) = a ( ( u , g , v ) , ζ ) f ( ζ ) ( y , h , x ) Z ( x ) .
Thus, we obtain
a ( ( u , g , v ) , ζ ) = ( y , h , x ) = a ( ( u , g , v ) , ξ )
for every ζ U , and a is a constant map on U. □
We present some observations from Lemma 2.
Remark 3.
1.
Fix ( u , g , v ) S G , E and consider any ξ Z ( v ) . We let U ξ be the neighborhood of ξ given in Lemma 2. Then, { U ξ : ξ Z ( v ) } is an open cover of Z ( v ) , and the compactness of Z ( v ) implies that there exists a finite subcover { U 1 , , U n } .
If U i U j , then for ζ U i U j , we have
( y i , h i , x i ) f ( ζ ) = f ( u , g , v ) ( ζ ) = ( y j , h j , x j ) f ( ζ ) .
Thus, topological freeness of the action (see Remark 1 and Remark 2) implies
( y i , h i , x i ) = ( y j , h j , x j )
so that we have U i = U j from the construction of U in Lemma 2. Hence, we can remove U j from the finite cover, and we may say that { U 1 , , U n } is a disjoint collection.
2.
Let Z ( v ) = U i . For the fixed ( u , g , v ) S G , E , we have families { ( u , g , v ) U i } S G , E and { ( y i , h i , x i ) } S H , F such that for every ζ U i ,
f ( u , g , v ) ( ζ ) = f ( u , g , v ) U i ( ζ ) = ( y i , h i , x i ) f ( ζ ) .
Proposition 2.
Let ( G , E , ϕ ) and ( H , F , ψ ) be self-similar graph actions with corresponding partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) , respectively. If the partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) are continuously orbit equivalent, then the inverse semigroups S G , E and S H , F are isomorphic.
Proof. 
Let f : E ω F ω be as in Definition 1. Then, we will show that f S G , E f 1 = S H , F . Instead of a general element ( u , g , v ) in S G , E , we consider ( u , g , v ) U i S G , E and ( y i , h i , x i ) S H , F . Then, Lemma 2 and Remark 3 imply that
f ( u , g , v ) U i f 1 = ( y i , h i , x i ) S H , F .
A similar argument shows that f 1 ( y , h , x ) V j f = ( u j , g j , v j ) S G , E . Therefore, we have that f S G , E f 1 = S H , F , and S G , E is isomorphic to S H , F . □
Combining the above results, we obtain a generalization of Theorem 1.
Theorem 2.
Suppose that ( G , E , ϕ ) and ( H , F , ψ ) are self-similar graph actions with corresponding partial dynamical systems ( S G , E , E ω ) and ( S H , F , F ω ) and Cuntz–Pimsner groupoids C G , E and C H , F , respectively. Then, the following are equivalent.
1.
S G , E is isomorphic to S H , F .
2.
( S G , E , E ω ) is continuously orbit equivalent to ( S H , F , F ω ) .
3.
C G , E is topologically isomorphic to C H , F .
4.
( C ( C G , E ) , C ( E ω ) ) is isomorphic to ( ( C ( C H , F ) , C ( F ω ) ) .

A Remark on GROUP actions

We recall that self-similar groups and self-similar graph actions consider group actions on path spaces of graphs. We briefly examine the continuous orbit equivalence of group actions.
For a G action on the path space E ω , the transformation groupoid is considered rather than the groupoid of germs. The transformation groupoid T ( G , E ω ) of a G action on E ω is given by the set G × E ω = { ( g , ξ ) } , with the multiplication
( h , η ) · ( g , ξ ) = ( h g , ξ ) if η = g ( ξ ) .
Definition 2
([3] Definition 2.5). The group actions on path spaces ( G , E ω ) and ( H , F ω ) are said to be continuously orbit equivalent if there exists a homeomorphism f : E ω F ω and continuous maps a : G × E ω H and b : H × F ω G , such that
f ( g ( ξ ) ) = a ( g , ξ ) f ( ξ ) and f 1 ( h ( η ) ) = b ( h , η ) f 1 ( η )
for all g G , h H , ξ E ω and η F ω .
Theorem 3
([3] Theorem 1.2). Suppose that ( G , E , ϕ ) and ( H , F , ψ ) are self-similar graph actions. Then, the following are equivalent.
1.
The G action on E ω and H action on F ω are continuously orbit equivalent.
2.
The transformation groupoids T ( G , E ω ) and T ( H , F ω ) are topologically isomorphic.
3.
There exists a *-isomorphism ϕ : C ( E ω ) r G C ( F ω ) r H with ϕ ( C ( E ω ) ) = C ( F ω ) .
For a self-similar graph action ( G , E ) , every g G may be considered as
g = ( , g , ) .
Therefore, G is a subsemigroup of the inverse semigroup S G , E , and it would be reasonable to expect that some relations exist between group actions and inverse semigroup actions. However, it turns out that it is not easy to obtain any reasonable relations.
In the case of self-similar groups, with the aid of the recurrent condition, the continuous orbit equivalence of inverse semigroup actions implies the continuous orbit equivalence of group actions. Moreover, the converse also holds when shift maps and the homeomorphism on infinite path spaces commute [5].
For self-similar graph actions, it is difficult to define a condition similar to the recurrent condition. One reason for the difficulty is that, although in self-similar groups the initial and terminal vertices of a finite path are the same, in self-similar graph actions they may not be. Although Exel and Pardo [6] introduced related concepts called G-transitivity and weak G-transitivity, these are not direct generalizations of the recurrent condition.
Still, there exists a subgroupoid relation between the transformation groupoid and the groupoid of germs of a G action.
Proposition 3.
Let ( G , E ) be a self-similar graph action. Then, the transformation groupoid T ( G , E ω ) of the G action on E ω is isomorphic to a subgroupoid of C G , E .
Proof. 
For any ( g , ξ ) T ( G , X ) , let a be a prefix of ξ , i.e., ξ = a η for some η E ω . We define α : T ( G , E ω ) C G , E by
( g , ξ ) [ ( g ( a ) , ϕ ( g , a ) , a ) , ξ ] C G , E .
Then, we have [ ( g ( a ) , ϕ ( g , a ) , a ) , ξ ] C G , E , because
| a | = | g ( a ) | and g ( ξ ) = g ( a η ) = g ( a ) ϕ ( g , a ) ( η ) .
First, we need to show that α is well defined. Let b be another prefix of ξ , such that ξ = b ζ for some ζ E ω , and show that
( g ( a ) , ϕ ( g , a ) , a ) = ( g ( b ) , ϕ ( g , b ) , b )
on a neighborhood of ξ . Assume that | a | > | b | , so that a = b c for some c E . Then,
g ( a ) = g ( b c ) = g ( b ) ϕ ( g , b ) ( c ) and ϕ ( g , b c ) = ϕ ( ϕ ( g , b ) , c )
implying that for every ζ = a μ = b c ν Z ( a )
( g ( b ) , ϕ ( g , b ) , b ) ( b c ν ) = g ( b ) · ϕ ( g , b ) ( c ν ) = g ( b ) · ϕ ( g , b ) ( c ) · ϕ ( ϕ ( g , b ) , c ) ( ν ) = g ( b c ) · ϕ ( g , b c ) ( ν ) = ( g ( b c ) , ϕ ( g , b c ) , b c ) ( b c ν ) = ( g ( a ) , ϕ ( g , a ) , a ) ( a μ ) .
Therefore, we have that ( g ( a ) , ϕ ( g , a ) , a ) = ( g ( b ) , ϕ ( g , b ) , b ) on Z ( a ) , and so
[ ( g ( a ) , ϕ ( g , a ) , a ) , ξ ] = [ ( g ( b ) , ϕ ( g , b ) , b ) , ξ ] .
Thus, α is a well-defined map.
Let ( g , ξ ) , ( h , η ) T ( G , E ω ) be composable, implying that
ξ = h ( η ) and ( g , ξ ) · ( h , η ) = ( g h , η ) .
Then, for η = a ζ and some a E and ζ E ω , we have
ξ = h ( η ) = h ( a ζ ) = h ( a ) ϕ ( h , a ) ( ζ )
and
α ( ( g , ξ ) · ( h , η ) ) = α ( g h , η ) = [ ( g h ( a ) , ϕ ( g h , a ) , a ) , η ] = [ ( g h ( a ) , ϕ ( g , h ( a ) ) ϕ ( h , a ) , a ) , η ] = [ ( g h ( a ) , ϕ ( g , h ( a ) ) , h ( a ) ) , h ( a ) ϕ ( h , a ) ( ζ ) ] · [ ( h ( a ) , ϕ ( h , a ) , a ) , η ] = [ ( g ( h ( a ) ) , ϕ ( g , h ( a ) ) , h ( a ) ) , ξ ] · [ ( h ( a ) , ϕ ( h , a ) , a ) , η ] = α ( g , ξ ) · α ( h , η ) .
Thus, α is a groupoid homomorphism.
To show that α is injective, let α ( g , ξ ) = α ( h , η ) , and show that ( g , ξ ) = ( h , η ) . For ξ = a μ and η = b ν ,
[ ( g ( a ) , ϕ ( g , a ) , a ) , ξ ] = α ( g , ξ ) = α ( h , η ) = [ ( h ( b ) , ϕ ( h , b ) , b ) , η ]
induces that ξ = η . Then, the well-definedness of α implies that we may choose a = b such that for every μ = a ν Z ( a ) it holds that
( g ( a ) , ϕ ( g , a ) , a ) ( μ ) = g ( a ) ϕ ( g , a ) ( ν ) = g ( μ ) = h ( μ ) = h ( a ) ϕ ( h , a ) ( ν ) = ( h ( a ) , ϕ ( h , a ) , a ) ( μ ) .
Therefore, we have that g = h on Z ( a ) . Because we assumed that the G action on E ω is topologically free, g = h on Z ( a ) implies that g = h on E ω , and α is injective. Therefore, T ( G , E ω ) is isomorphic to a subgroupoid of C G , E . □

Funding

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2018R1D1A1B07048313).

Conflicts of Interest

The author declares no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Giordano, T.; Putnam, I.; Skau, C. Topological orbit equivalence and C*-crossed products. J. Reine Angew. Math. 1995, 469, 51–111. [Google Scholar]
  2. Matsumoto, K. Orbit equivalence of topological Markov shifts and Cuntz-Krieger algebras. Pac. J. Math. 2010, 246, 199–225. [Google Scholar] [CrossRef]
  3. Li, X. Continuous orbit equivalence rigidity. Erg. Theory Dyn. Syst. 2018, 38, 1543–1563. [Google Scholar] [CrossRef]
  4. Cordeiro, L.G.; Beuter, V. The dynamics of partial inverse semigroup actions. J. Pure Appl. Algebra 2020, 224, 917–957. [Google Scholar] [CrossRef]
  5. Yi, I. Continuous Orbit Equivalences on Self-Similar Groups. Submitted for Publication.
  6. Exel, R.; Pardo, E. Self-similar graphs a unified treatment of Katsura and Nekrashevych C*-algebras. Adv. Math. 2017, 306, 1046–1129. [Google Scholar] [CrossRef]
  7. Nekrashevych, V. Self-Similar Groups; Math. Surveys and Monographs; American Mathematical Society: Providence, RI, USA, 2005; Volume 117. [Google Scholar]
  8. Nekrashevych, V. C*-algebras and self-similar groups. J. Reine Angew. Math. 2009, 630, 59–123. [Google Scholar] [CrossRef]
  9. Lawson, M.V. Inverse Semigroups, The Theory of Partial Symmetries; World Scientific: Singapore, 1998. [Google Scholar]
  10. Exel, R.; Pardo, E. The tight groupoid of an inverse semigroup. Semigroup Forum 2016, 92, 274–303. [Google Scholar] [CrossRef]
  11. Brownlowe, N.; Carlsen, T.; Sims, A.; Whittaker, M. Graph algebras and orbit equivalence. Erg. Theory Dyn. Syst. 2017, 37, 389–417. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Yi, I. Continuous Orbit Equivalence on Self-Similar Graph Actions. Mathematics 2019, 7, 990. https://doi.org/10.3390/math7100990

AMA Style

Yi I. Continuous Orbit Equivalence on Self-Similar Graph Actions. Mathematics. 2019; 7(10):990. https://doi.org/10.3390/math7100990

Chicago/Turabian Style

Yi, Inhyeop. 2019. "Continuous Orbit Equivalence on Self-Similar Graph Actions" Mathematics 7, no. 10: 990. https://doi.org/10.3390/math7100990

APA Style

Yi, I. (2019). Continuous Orbit Equivalence on Self-Similar Graph Actions. Mathematics, 7(10), 990. https://doi.org/10.3390/math7100990

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop