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
is a directed graph, where
is the set of vertices,
is the set of edges,
d is the domain map, and
r is the range map. A directed graph
E is called
finite if
and
are finite sets. For a natural number
n, a path of length
n in
E is a finite sequence of the form
where
and
for every
i. The domain and range of
a are defined by
and
, respectively. A vertex
is considered as a path of length 0, with
. If
a and
b are paths such that
, then we denote the path obtained by juxtaposing
a and
b by
. We use
to denote the length of
a. For every non-negative integer
n, we denote the set of paths of length
n in
E by
and define
. The set of right-infinite paths of the form
is denoted by
.
The product topology of a discrete set
E is defined on
. The cylinder set
for each
is defined by
Then, the collection of all such cylinder sets forms a basis for the product topology on .
An automorphism of a directed graph
E is a bijective map
, such that
for
,
, and
on
. 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
A
self-similar graph action consists of a directed graph
E and an action of a group
G on
E by automorphisms, with a
one-cocycle , such that for all
and
,
As Exel and Pardo showed in ([
6] Proposition 2.4), the
G action and one-cocycle extend to
via the inductive formula
for
with
, so that we have
for every
with
. In addition, the
G action induces an action of
G on
given by
It is not difficult to obtain the following properties of restrictions. For and with ,
A self-similar graph action is called pseudo-free if for any satisfying and , it holds that . We say that the G action on is topologically free if is dense in for every . A path in is said to have an entry if there is at least one such that 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 and are nonempty sets for every vertex,
- 3.
every finite path has an entry,
- 4.
our self-similar graph action is pseudo-free, and
- 5.
the G action on is topologically free.
Inverse Semigroups and Groupoids
Suppose that
is a self-similar graph action. An inverse semigroup
of
is defined as follows ([
6] §4),
with the binary operation defined by
and the unitary adjoint operation defined by
Then,
is an inverse semigroup containing zero, whose idempotent semi-lattice is given by
The inverse semigroup
has a canonical action on
in terms of partial homeomorphisms: The domain of
is
and
We note that 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
, and define an equivalence relation on
by
if and only if
and
s and
t coincide on a neighborhood of
x. The equivalence class of every
is called the germ of
s at
x, denoted by
. The set of every germ is a groupoid, called the groupoid of germs of
S on
X, whose operations are given by
The unit space is identified with
X. When two germs
and
satisfy
, their product is defined as
A basis for a topology is given by the collection of sets of the form
The groupoid of germs of the action on is denoted by , and called the Cuntz–Pimsner groupoid of .
We recall that an inverse semigroup
S has an order relation defined by
An inverse semigroup
S is said to be
-unitary (or 0-
E-unitary in [
9]) if for any
and a nonzero idempotent
e of
S,
implies that
s is idempotent ([
9] Chapter 9). When
S is an
-unitary inverse semigroup acting on a topological space, the action is called
topologically free if for every non-idempotent element
, 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 is -unitary, by ([6] Proposition 5.8). - 2.
The -action on 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 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,
and
, satisfying our assumptions, with corresponding right-infinite path spaces
and
and inverse semigroups
and
, respectively. For the next definition, we let
Definition 1 ([
4] Definition 8.1).
The partial dynamical systems and are said to be continuously orbit equivalent if there exist a homeomorphismand continuous mapssuch thatfor all , , , and . 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 and are self-similar graph actions with corresponding partial dynamical systems and and Cuntz–Pimsner groupoids and , respectively. Then, the following statements are equivalent.- 1.
The partial dynamical systems and are continuously orbit equivalent.
- 2.
The Cuntz–Pimsner groupoids and are topologically isomorphic.
- 3.
There is a diagonal-preserving isomorphism between the groupoid algebras and .
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
and
of the self-similar graph actions
and
are isomorphic if there exists a homeomorphism
, such that
Proposition 1. Suppose that and are self-similar graph actions with corresponding inverse semigroups and and Cuntz–Pimsner groupoids and , respectively. If and isomorphic, then and are isomorphic as topological groupoids.
Proof. Suppose that
is isomorphic to
and that
is the homeomorphism defined above. Then, we define
by
First, we need to show that
is well defined. If
holds in
, then there exists a neighborhood
U of
in
such that
. We recall that
f is a homeomorphism, and so
is a neighborhood of
. Thus, we have
implying that
. Therefore,
is a well-defined map.
Conversely, if we have
, then
, implying that
as
f is a homeomorphism. Therefore, there exists a neighborhood
V of
such that
Again,
f is a homeomorphism, implying that
is a neighborhood of
and
Thus, is an injection.
For every
, it is easy to see that
and
Therefore, is a surjection.
If
and
are composable in
with
then
implies that
and
are composable in
, and
Therefore, is a groupoid homomorphism.
To show that
is continuous, let
be a base element of the germ topology on
. Because
V is an open set in
,
is an open set in
, and
is a base element of the germ topology of
. Thus,
is a continuous map, and by the same argument so is
. Therefore,
is a continuous isomorphism, and
and
are isomorphic as topological groupoids. □
Lemma 1. Every compact open subset of is a disjoint union of cylinder sets.
Proof. Let U be a compact open subset of . Then, the open condition implies that U is a union of cylinder sets, say , because the collection of cylinder sets is a base of the topology on . Therefore, is an open covering of a compact set U, and there exists a finite subcover .
If there exist and such that for some , then implies that we can remove from the finite subcover . Therefore, without loss of generality, for any two and we may say that for any . Thus, the finite subcover is a disjoint collection. Then implies that U is a disjoint union of cylinder sets. □
Lemma 2. Let and be self-similar graph actions such that their partial dynamical systems and are continuously orbit equivalent by , , and . Then, for every and , there exists a neighborhood U of ξ such that a is a constant map on U.
Proof. Let
,
, and
be as in Definition 1. For a fixed
and
, we can find a neighborhood
U of
such that
for every
.
Because
is a compact open set in
,
is also a compact open set in
, because
f is a homeomorphism. Then, Lemma 1 implies that there exist finitely many disjoint cylinder sets
such that
Therefore, there exists a unique element
such that
On the other hand, we recall that
is a partial homeomorphism on
whose domain is
. Therefore,
is a compact open set in
, and we can choose finitely many disjoint cylinder sets
, such that
Let
y be the unique element in
such that
Then, continuous orbit equivalence implies that there exists a unique
such that
It is easy to observe that U is an open set because is an open set, f is a homeomorphism and and are partial homeomorphisms on their domains. Moreover, and imply that U is a neighborhood of .
Now, we show that
is a constant map on
U. For every
, we have
Thus, we obtain
for every
, and
a is a constant map on
U. □
We present some observations from Lemma 2.
Remark 3. - 1.
Fix and consider any . We let be the neighborhood of ξ given in Lemma 2. Then, is an open cover of , and the compactness of implies that there exists a finite subcover .
If , then for , we have Thus, topological freeness of the action (see Remark 1 and Remark 2) impliesso that we have from the construction of U in Lemma 2. Hence, we can remove from the finite cover, and we may say that is a disjoint collection. - 2.
Let . For the fixed , we have families and such that for every ,
Proposition 2. Let and be self-similar graph actions with corresponding partial dynamical systems and , respectively. If the partial dynamical systems and are continuously orbit equivalent, then the inverse semigroups and are isomorphic.
Proof. Let
be as in Definition 1. Then, we will show that
. Instead of a general element
in
, we consider
and
. Then, Lemma 2 and Remark 3 imply that
A similar argument shows that . Therefore, we have that , and is isomorphic to . □
Combining the above results, we obtain a generalization of Theorem 1.
Theorem 2. Suppose that and are self-similar graph actions with corresponding partial dynamical systems and and Cuntz–Pimsner groupoids and , respectively. Then, the following are equivalent.
- 1.
is isomorphic to .
- 2.
is continuously orbit equivalent to .
- 3.
is topologically isomorphic to .
- 4.
is isomorphic to .