Orbit equivalence of higher-rank graphs
Toke Meier Carlsen
Department of Science and Technology
University of the Faroe Islands
Vestara Bryggja 15
FO-100 Tórshavn
Faroe Islands
[email protected]
and
James Rout
School of Mathematics and Statistics
University of New South Wales
Kensington
NSW 2052
Australia
[email protected]
Abstract.
We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We show that there is a continuous orbit equivalence between two finitely-aligned higher-rank graphs that preserves the periodicity of boundary paths if and only if the boundary path groupoids are isomorphic, and characterise continuous orbit equivalence, eventual one-sided conjugacy, and two-sided conjugacy of higher-rank graphs in terms of the C∗-algebras and the Kumjian–Pask algebras of the higher-rank graphs.
Key words and phrases:
Higher-rank graph; orbit equivalence; conjugacy; multi-dimensional shift space; groupoid; k-graph C∗-algebra; Kumjian–Pask algebra
2010 Mathematics Subject Classification:
Primary: 46L55; Secondary: 37A55, 37B10, 16S99, 22A22
1. Introduction
Matsumoto introduced and studied continuous orbit equivalence for irreducible one-sided shifts of finite type in [16]. He showed that one-sided shifts XA and XB are continuously orbit equivalent for finite irreducible {0,1}-matrices A and B that are not permutations if and only if there is an isomorphism between the corresponding Cuntz–Krieger algebras OA and OB that preserves the diagonal subalgebra. Brownlowe, Carlsen and Whittaker extended continuous orbit equivalence to boundary path spaces of arbitrary directed graphs in [5]. They used groupoid techniques to show that if arbitrary directed graphs E and F are continuously orbit equivalent, then there is a diagonal-preserving isomorphism between the corresponding graph C∗-algebras C∗(E) and C∗(F). Moreover, they showed that the converse holds provided that the graphs both satisfy condition (L).
Arklint, Eilers and Ruiz in [3] and Carlsen and Winger in [11], independently and using different methods, showed that arbitrary graphs E and F are continuously orbit equivalent by an equivalence that maps eventually periodic points to eventually periodic points if and only if there is a diagonal-preserving isomorphism between C∗(E) and C∗(F). Continuous orbit equivalence has also been characterised in terms of diagonal-preserving isomorphisms of Leavitt path algebras. This follows from the work of Brown, Clark and an Huef for row-finite graphs [4] and Carlsen and Rout for arbitrary graphs [8].
Matsumoto proved in [17] that if A and B are finite irreducible {0,1}-matrices that are not permutations matrices, then the one-sided shifts of finite type XA and XB are eventually conjugate if and only if there is an isomorphism between the Cuntz–Krieger algebras OA and OB that preserves the diagonal subalgebra and intertwines the gauge actions of OA and OB. This result was generalised by Carlsen and Rout to arbitrary graphs in [7], and an analogous result for Leavitt path algebras was proved in [8].
In [7] and [8], diagonal-preserving stable isomorphisms of graph graph C∗-algebras and Leavitt path algebras was characterised in terms of stable isomorphisms of the corresponding boundary path groupoids and it was shown that the two-sided shifts of finite type of two finite graphs with no sinks and no sources are conjugate if and only if there is a diagonal-preserving gauge-invariant isomorphism between the stabilised graph C∗-algebras, and if and only if there is a diagonal-preserving graded isomorphism between the stabilised Leavitt path algebras.
Higher-rank graphs or k-graphs are combinatorial objects that generalise directed graphs. These were introduced by Kumjian and Pask in [14] in order to model the higher-rank Cuntz–Krieger algebras of Robertson and Steger [23]. Kumjian and Pask originally associated a C∗-algebra C∗(Λ) to a row-finite k-graph Λ without sources. Raeburn, Sims and Yeend then associated C∗-algebras to larger classes of k-graphs in [20] and [21]. The largest class is that of finitely-aligned k-graphs. Farthing, Muhly and Yeend showed that the C∗-algebra of a finitely-aligned k-graph can also be realised as the groupoid C∗-algebra of the boundary path groupoid GΛ in [13]. The algebraic analogues of k-graph C∗-algebras are the Kumjian–Pask algebras KP(Λ). These were introduced for row-finite k-graphs Λ without sources by Aranda Pino, Clark, an Huef and Raeburn in [2]. Clark and Pangalela recently associated Kumjian–Pask algebras to finitely-aligned k-graphs in [12]. They showed that KP(Λ) can also be realised as the Steinberg algebra of the boundary path groupoid GΛ.
The results of this paper
In this paper, we use groupoid methods to study continuous orbit equivalence of finitely-aligned k-graphs (of possibly different rank) as well as eventually one-sided conjugacy of finitely-aligned k-graphs (of the same rank) and two-sided conjugacy of row-finite k-graphs (of the same rank) with finitely many vertices and no sinks or sources.
In Section 3, we characterise continuous orbit equivalence between a finitely-aligned k1-graph Λ1 and a finitely-aligned k2-graph Λ2 in terms of groupoid isomorphisms of the boundary path groupoids GΛ1 and GΛ2. To do this, we recall the periodicity group of a boundary path and introduce a period-preserving condition for continuous orbit equivalence. We show that Λ1 and Λ2 are continuously orbit equivalent by an equivalence that is period-preserving if and only if the associated boundary path groupoids GΛ1 and GΛ2 are isomorphic (Proposition 3.8).
We combine this with results about groupoid C∗-algebras in [10] and Steinberg algebras in [8] and [24] to see that Λ1 and Λ2 are continuously orbit equivalence by an equivalence that is period-preserving if and only if C∗(Λ1) and C∗(Λ2) are isomorphic by a diagonal-preserving isomorphism if and only if the Kumjian–Pask algebras KP(Λ1) and KP(Λ2) are isomorphic by a diagonal-preserving ring-isomorphism (Corollary 3.13).
We give examples of k-graphs of different rank that are continuously orbit equivalent (Example 3.3), and we give an example of 2-graphs whose boundary path spaces are homeomorphic but not continuously orbit equivalent (Remark 3.15).
In Theorem 4.2, we show that finitely-aligned k-graphs Λ1 and Λ2 are eventually one-sided conjugate if and only if C∗(Λ1) and C∗(Λ2) are isomorphic by a diagonal-preserving isomorphism that intertwines the gauge actions if and only if KP(Λ1) and KP(Λ2) are isomorphic by a diagonal-preserving ring-isomorphism that preserves the Zk-grading.
We then use the results of [9] to characterise diagonal-preserving stable isomorphisms of k-graph C∗-algebras and Kumjian–Pask algebras in terms of stable isomorphisms of the corresponding boundary path groupoids (Corollary 5.4).
Finally, we show in Theorem 6.1 that the two-sided multi-dimensional shift spaces associated to row-finite k-graphs Λ1 and Λ2 with finitely many vertices and no sinks or sources are conjugate if and only if C∗(Λ1) and C∗(Λ2) are stably isomorphic by a diagonal-preserving isomorphism that intertwines the gauge actions if and only if KP(Λ1) and KP(Λ2) are stably isomorphic by a diagonal-preserving isomorphism that preserves the Zk-grading.
2. Preliminaries
For the benefit of the reader, we recall the definitions of higher-rank graphs, their C∗-algebras and Kumjian–Pask algebras, their boundary path spaces and boundary path groupoids.
Let N be the set of positive integers together with [math], and let k be a positive integer. We regard Nk as a semigroup with identity [math]. We write n∈Nk as n=(n1,…,nk). We use ≤ for the partial order on Nk given by m≤n if mi≤ni for all 1≤i≤k. For m,n∈Nk, we write n∨m for their coordinate-wise maximum and n∧m for their coordinate-wise minimum.
2.1. Higher-rank graphs and their C∗-algebras and Kumjian–Pask algebras
A higher-rank graph or k-graph is a countable small category Λ:=(obj(Λ),mor(Λ),r,s) together with a functor d:Λ→Nk satisfying the factorisation property: for every λ∈Λ and m,n∈Nk with d(λ)=m+n, there are unique elements μ,ν∈Λ with d(μ)=m and d(ν)=n such that λ=μν. We then write λ(0,m):=μ and λ(m,m+n)=ν.
Example 2.1** ([20, Example 2.2.(ii)]).**
For k∈N and m∈(N∪{∞})k, define Ωk,m:={(p,q)∈Nk×Nk:p≤q≤m}. This is a k-graph with Ωk,m0={p∈Nk:p≤m}, r(p,q)=p, s(p,q)=q, d(p,q)=q−p and composition defined by (p,q)(q,r)=(p,r). We write Ωk,∞ for the k-graph Ωk,(∞,…,∞) introduced in [14, Example 1.7 (ii)].
For n∈Nk, we define Λn:={λ∈Λ:d(λ)=n}. We regard the elements of Λn as paths of length n, and the elements of Λ0 as vertices. The uniqueness of the factorisation property allows us to identify obj(Λ) with Λ0. For λ∈Λ, we refer to r(λ) as the range of λ and s(λ) as the source of λ. For v∈Λ0 and E⊆Λ, we define vE:={λ∈E:r(λ)=v} and Ev:={λ∈E:s(λ)=v}, and we define λE:={λμ:μ∈s(λ)E} and Eλ:={μλ:μ∈Er(λ)}. A vertex v∈Λ0 is called a source if vΛm=∅ for some m∈Nk, and called a sink if Λmv=∅ for some m∈Nk. A k-graph Λ is called row-finite if for each m∈Nk and v∈Λ0 the set vΛm is finite.
For λ,μ∈Λ, we say that τ∈Λ is a minimal common extension of λ and μ if d(τ)=d(λ)∨d(μ) and τ(0,d(λ))=λ and τ(0,d(μ))=μ. We write MCE(λ,μ) for the collection of all minimal common extensions of λ and μ. We then define Λmin(λ,μ):={(ρ,τ)∈Λ×Λ:λρ=μτ∈MCE(λ,μ)}. A k-graph Λ is called finitely-aligned if for all λ,μ∈Λ, the set Λmin(λ,μ) is finite (possibly empty). A set E⊆vΛ is said to be exhaustive if for every λ∈vΛ, there exists μ∈E such that Λmin(λ,μ)=∅.
We recall the C∗-algebra associated to a finitely-aligned k-graph introduced by Raeburn, Sims and Yeend in [21].
Definition 2.2** ([21, Definition 2.5]).**
Let Λ be a finitely-aligned k-graph. A Cuntz–Krieger Λ-family is a collection {Sλ:λ∈Λ} of partial isometries in a C∗-algebra A satisfying
- (1)
{Sv:v∈Λ0} is a collection of mutually orthogonal projections;
2. (2)
SλSμ=Sλμ whenever s(λ)=r(μ);
3. (3)
Sλ∗Sμ=∑(α,β)∈Λmin(λ,μ)SαSβ∗ for all λ,μ∈Λ; and
4. (4)
∏λ∈E(Sv−SλSλ∗)=0 for all v∈Λ0 and finite exhaustive E⊂vΛ.
Given a finitely-aligned k-graph Λ, there is a C∗-algebra C∗(Λ) generated by a Cuntz–Krieger Λ-family {sλ:λ∈Λ} which is universal in the following sense: for any Cuntz–Kriger Λ-family {Sλ:λ∈Λ} in a C∗-algebra A, there is a unique homomorphism πS:C∗(Λ)→A such that πS(sλ)=Sλ for all λ∈Λ. By [21, Lemma 2.7], C∗(Λ)=span{sλsμ∗:λ,μ∈Λ,s(λ)=s(μ)}. The diagonal subalgebra of C∗(Λ) is given by D(Λ):=span{sμsμ∗:μ∈Λ}. In this paper, all isomorphisms of k-graph C∗-algebras are ∗-isomorphisms. For a finitely-aligned k1-graph Λ1 and a finitely-aligned k2-graph Λ2, we say that an isomorphism ϕ:C∗(Λ1)→C∗(Λ2) is diagonal-preserving if ϕ(D(Λ1))=D(Λ2).
We recall the Kumjian–Pask algebra associated to a finitely-aligned k-graph Λ introduced by Clark and Pangalela in [12]. For each λ∈Λ∖Λ0, we define a ghost path by a formal symbol λ∗. For v∈Λ0, we define v∗:=v, and extend r and s to the collection of ghost paths by setting r(λ∗):=s(λ) and s(λ):=r(λ∗). Composition of ghost paths is defined by λ∗μ∗:=(μλ)∗. The factorisation property of Λ induces a similar factorisation property on the collection of ghost paths.
Definition 2.3** ([12, Definition 3.1]).**
Let Λ be a finitely-aligned k-graph, and R a commutative ring with unit. A Kumjian–Pask Λ-family {Sλ,Sμ∗:λ,μ∈Λ} in an R-algebra A consists of a function S:Λ∪{μ∗:μ∈Λ∖Λ0}→A satisfying
- (1)
{Sv:v∈Λ0} is a collection of mutually orthogonal idempotents;
2. (2)
SλSμ=Sλμ and Sμ∗Sλ∗=S(λμ)∗ whenever s(λ)=r(μ);
3. (3)
Sλ∗Sμ=∑(α,β)∈Λmin(λ,μ)SαSβ∗ for all λ,μ∈Λ; and
4. (4)
∏λ∈E(Sv−SλSλ∗)=0 for all v∈Λ0 and finite exhaustive E⊂vΛ.
Given a finitely-aligned k-graph and a commutative ring R with unit, there is an R-algebra KPR(Λ) generated by a Kumjian–Pask Λ-family {sλ,sμ∗:λ,μ∈Λ} which is universal in the following sense: for any Kumjian–Pask Λ-family {Sλ,Sμ∗:λ,μ∈Λ} in an R-algebra A, there is a unique R-algebra homomorphism πS:KPR(Λ)→A such that πS(sλ)=Sλ and πS(sμ∗)=Sμ∗ for all λ,μ∈Λ (see [12, Theorem 3.7]). By [12, Proposition 3.3], KPR(Λ)=spanR{sλsμ∗:λ,μ∈Λ,s(λ)=s(μ)}. The diagonal subalgebra of KPR(Λ) is given by DR(Λ):=spanR{sμsμ∗:μ∈Λ}. In this paper, we will consider both ring-isomorphisms and ∗-algebra-isomorphisms of Kumjian–Pask algebras. For a finitely-aligned k1-graph Λ1 and a finitely-aligned k2-graph Λ2, we say that an isomorphism ϕ:KPR(Λ1)→KPR(Λ2) is diagonal-preserving if ϕ(DR(Λ1))=DR(Λ2).
2.2. The boundary path groupoid of a higher-rank graph
A boundary path of a k-graph Λ is a degree-preserving functor x:Ωk,m→Λ such that for every n∈Nk with n≤m and every finite exhaustive subset E⊂x(n,n)Λ, there exists λ∈E such that x(n,n+d(λ))=λ (see [13, Definition 5.10]). We write ∂Λ for the set of all boundary paths. This is called the boundary path space of Λ. We extend r and d to boundary paths x:Ωk,m→Λ by setting r(x):=x(0,0) and d(x):=m. Note that for v∈Λ0, the set v∂Λ:={x∈∂Λ:r(x)=v} is nonempty (see [13, Lemma 5.15]). For m∈Nk, we let ∂Λ≥m:={x∈∂Λ:d(x)≥m} and we let σΛm:∂Λ≥m→∂Λ be the shift map defined by σΛm(x)(p,q)=x(p+m,q+m) for p,q∈Nk with p≤q≤d(x)−m (see [28, Notation 5.1 and Lemma 5.13(1)]). We implicitly assume that x∈∂Λ≥m whenever we write σΛm(x). For λ∈Λ and x∈s(λ)∂Λ, there exists λx∈∂Λ such that x=σΛd(λ)(λx) and λ=(λx)(0,d(λ)) (see [26, Proposition 3.0.11]). Define λ∂Λ:={λx:x∈s(λ)∂Λ}. We also write ZΛ(λ):=λ∂Λ. For a finite nonexhaustive subset G⊆s(λ)Λ, we define
[TABLE]
The sets ZΛ(λ∖G) form a basis for a locally compact Hausdorff topology on ∂Λ, and each ZΛ(λ∖G) is compact in this topology.
We recall the boundary path groupoid GΛ of a k-graph Λ as defined in [28, Definition 4.8] (see also [12, Example 5.2]).
The boundary path groupoid GΛ is given by
[TABLE]
with partially-defined product (x1,m1,y1)(y1,m2,y2)↦(x1,m1+m2,y2), inverse operation (x,m,y)↦(y,−m,x), and range and source maps r(x,m,y):=x and s(x,m,y):=y. We identify the boundary path space ∂Λ with the unit space GΛ0 via the map x→(x,0,x).
We describe a topology on GΛ making it a locally compact, Hausdorff and ample groupoid (see [13, Proposition 6.5 and Proposition 6.8]). Write Λ∗sΛ:={(λ,μ)∈Λ×Λ:s(λ)=s(μ)}. For (λ,μ)∈Λ∗sΛ and a finite nonexhaustive subset G⊆s(λ)Λ, we write
[TABLE]
and
[TABLE]
The sets ZΛ(λ∗sμ∖G) form a basis for a second-countable, Hausdorff topology on GΛ, and each ZΛ(λ∗sμ∖G) is a compact open bisection. The relative topology on GΛ0 agrees with the topology on ∂Λ.
The C∗-algebras of finitely-aligned k-graphs can be realised as the groupoid C∗-algebras of the boundary path groupoid, and the Kumjian–Pask algebras as the Steinberg algebras of the boundary path groupoid. More specifically, if Λ is a finitely-aligned k-graph, then by [13, Theorem 6.13], there is an isomorphism π:C∗(Λ)→C∗(GΛ) satisfying π(sλ)=1ZΛ(λ∗ss(λ)) for all λ∈Λ. Similarly, if R is a commutative ring with unit, then by [12, Proposition 5.4] there is an isomorphism πT:KPR(Λ)→AR(GΛ) such that πT(sλ)=1ZΛ(λ∗ss(λ)) and πT(sλ∗)=1ZΛ(s(λ)∗sλ) for λ∈Λ. The isomorphism π carries D(Λ) to C0(GΛ0) viewed as a subalgebra of C∗(GΛ), and likewise the isomorphism πT carries DR(Λ) to AR(GΛ0) viewed as a subalgebra of AR(GΛ). It follows from results about groupoid C∗-algebras in [10] that the diagonal-preserving isomorphisms of k-graph C∗-algebras are characterised in terms of isomorphisms of the corresponding boundary path groupoids. Similarly, it follows from results about Steinberg algebras in [8] that the ring-isomorphisms and ∗-algebra-isomorphisms of Kumjian–Pask algebras are also characterised in terms of isomorphisms of the corresponding boundary path groupoids.
We now describe another basis for the topology on GΛ that will be useful in the proofs of Lemma 2.5 and Theorem 4.2. For m,n∈Nk, U is an open subset of ∂Λ≥m such that σΛm is injective on U, and V is an open subset of ∂Λ≥n such σΛn is injective on V and σΛm(U)=σΛn(V), we define
[TABLE]
Lemma 2.4**.**
Let Λ be a finitely-aligned k-graph. The sets Z(U,m,n,V) form a basis for the topology of GΛ.
Proof.
Suppose that m,n∈Nk, U is an open subset of ∂Λ≥m such that σΛm is injective on U, and V is an open subset of ∂Λ≥n such that σΛn is injective on V and σΛm(U)=σΛn(V). Define
[TABLE]
We claim that Z(U,m,n,V)=⋃(λ,μ,ν,G)∈AZΛ(μλ∗sνλ∖G), and is thus open in GΛ. It is clear that ⋃(λ,μ,ν,G)∈AZΛ(μλ∗sνλ∖G)⊆Z(U,m,n,V). For the other direction, let (x,m−n,y)∈Z(U,m,n,V). Define μ:=x(0,m) and ν=y(0,n), and choose λ∈Λ and a finite nonexhaustive subset G⊆s(λ)Λ such that σΛm(x)=σΛn(y)∈Z(λ∖G)⊆σΛm(U)=σΛn(V). Then (x,m−n,y)∈ZΛ(μλ∗sνλ∖G)⊆Z(U,m,n,V). Hence Z(U,m,n,V)⊆⋃(λ,μ,ν,G)∈AZΛ(μλ∗sνλ∖G), proving the claim.
Conversely, if (λ,μ)∈Λ∗sΛ and G is a finite nonexhaustive subset of s(λ)Λ, then ZΛ(λ∗sμ∖G)=Z(ZΛ(λ∖G),d(λ),d(μ),ZΛ(μ∖G)), so the sets Z(U,m,n,V) form a basis for the topology of GΛ.
∎
The following lemma will be useful for characterising continuous orbit equivalence in the next section. Fix a total order ⪯ on Nk such that m≤n implies that m⪯n. For example, we could let ⪯ be the lexicograpical order. Now, let Λ be a finitely-aligned k-graph, and define lΛ:GΛ→Nk by
[TABLE]
where the minimum is taken with respect to ⪯.
Lemma 2.5**.**
Let Λ be a finitely-aligned k-graph. Then lΛ:GΛ→Nk is continuous.
Proof.
Suppose that (xi,ni,yi)i∈N→(x,n,y) in GΛ. We will first show that l(xi,ni,yi)⪯l(x,n,y) for large i. Choose p≥l(x,n,y), an open subset U of ∂Λ≥p, and an open subset V of ∂Λ≥p−n such that (x,n,y)∈Z(U,p,p−n,V). Then (xi,ni,yi)∈Z(U,p,p−n,V) for large i. Let q=p−l(x,n,y). Then
[TABLE]
for large i. Since σΛq is a local homeomorphism and
[TABLE]
it follows that σΛl(x,n,y)(xi)=σΛl(x,n,y)−n(yi) for large i, so l(xi,ni,yi)⪯l(x,n,y) for large i. We now show that limi→∞l(xi,ni,yi)=l(x,n,y). Since there are only finitely many l∈Nk for which l⪯l(x,n,y), it suffices to show that if l(xi,ni,yi)=l for infinitely many i, then l(x,n,y)⪯l. So suppose l(xi,ni,yi)=l for infinitely many i. Since limi→∞ni=n, it follows that l≥n. Furthermore, since σΛl(xi)=σΛl−ni(yi) for infinitely many i, and limi→∞xi=x, limi→∞ni=n, and limi→∞yi=y, we see that σΛl(x)=σΛl−n(y). Hence l(x,n,y)⪯l as desired.
∎
3. Continuous orbit equivalence
In this section, we introduce the notion of continuous orbit equivalence of finitely-aligned k-graphs, and characterise continuous orbit equivalence of k-graphs in terms of isomorphisms of boundary path groupoids. We then use results of [8] and [10] to characterise continuous orbit equivalence of k-graphs in terms of diagonal-preserving isomorphisms of k-graph C∗-algebras and also in terms of diagonal-preserving ring-isomorphisms and ∗-algebra-isomorphisms of Kumjian–Pask algebras.
Definition 3.1**.**
Let Λ be a finitely-aligned k-graph. The orbit of x∈∂Λ is given by
[TABLE]
Let k1,k2∈N, and let Λ1 be a finitely-aligned k1-graph and Λ2 a finitely-aligned k2-graph. An orbit equivalence between Λ1 and Λ2 is a homeomorphism h:∂Λ1→∂Λ2 such that h(orbΛ1(x1))=orbΛ2(h(x1)) for all x1∈∂Λ1.
Suppose that h:∂Λ1→∂Λ2 is an orbit equivalence. For m1∈Nk1 and x1∈∂Λ1≥m1, we have that h(σΛ1m1(x1))∈orbΛ2(h(x1)), so there are fm1(x1), gm1(x1)∈Nk1 such that
[TABLE]
Similarly, for m2∈Nk2 and x2∈∂Λ2≥m2, we have that h−1(σΛ2m2(x2))∈orbΛ1(h−1(x2)), so there are im2(x2), jm2(x2)∈Nk2 such that
[TABLE]
Definition 3.2**.**
If fm1(x1), gm1(x1), im2(x2), jm2(x2) can be chosen such that fm1, gm1:∂Λ1≥m1→Nk1 and im2, jm2:∂Λ2≥m2→Nk2 are continuous for all m1∈Nk1 and all m2∈Nk2, and such that
[TABLE]
for m1, n1∈Nk1 and x1∈∂Λ1≥m1+n1, and
[TABLE]
for n1,n2∈Nk2 and x2∈∂Λ2≥n1+n2, then we say that h is a continuous orbit equivalence, that Λ1 and Λ2 are continuously orbit equivalent, and that the family
[TABLE]
is a family of continuous cocycles for h.
Example 3.3**.**
Let k1,k2∈N and let Λ1:=Ωk1,∞ and Λ2:=Ωk2,∞. Note that the range maps ri:∂Λi→Nki are bijections for i=1,2. If ϕ:Nk1→Nk2 is a bijection, then there is a homeomorphism h:∂Λ1→∂Λ2 such that r2∘h=ϕ∘r1. We claim that h is a continuous orbit equivalence with family of continuous cocycles given by fm1(x1):=ϕ(r1(x1)) and gm1(x1):=ϕ(r1(x1)+m1) for m1∈Nk1 and x1∈∂Λ1≥m1, and im2(x2):=ϕ−1(r2(x2)) and jm2(x2):=ϕ−1(r2(x2)+m2) for m2∈Nk2 and x2∈∂Λ2≥m2.
To check the claim, first note that ri(σΛimi(xi))=ri(xi)+mi for i∈{1,2}, mi∈Nki and xi∈∂Λi≥mi. Using this at the first and fifth equalities, we calculate
[TABLE]
so (3.1) is satisfied since r2 is bijective. A similar calculation shows that (3.2) is satisfied. Straightforward calculations show that (3.3) and (3.4) are also satisfied.
It follows from [14, Example 1.7 (ii)] that C∗(Ωki,∞)≅C∗(Ωk2,∞) and D(Ωk1,∞)≅D(Ωk2,∞).
Since we aim to characterise continuous orbit equivalence for arbitrary finitely-aligned higher-rank graphs, we need to consider the periodicity of boundary paths.
Definition 3.4**.**
Let Λ be a finitely-aligned k-graph and let x∈∂Λ. We define the periodicity group Per(x) of x by
[TABLE]
Similarly, we define the inner-peridocity group IP(x) of x by
[TABLE]
Remark 3.5**.**
We denote by Iso(GΛ):={η∈GΛ:s(η)=r(η)} the isotropy groupoid of GΛ and by Iso(GΛ)∘ its interior. It is not hard to check that Iso(GΛ)={(x,n,x):x∈∂Λ and n∈Per(x)} and Iso(GΛ)∘={(x,n,x):x∈∂Λ and n∈IP(x)}.
The following definition describes when a continuous orbit equivalence preserves the periodicity of boundary paths. This definition will become clear in light of Lemma 3.10.
Definition 3.6**.**
If h:∂Λ1→∂Λ2 is a continuous orbit equivalence with a family of continuous cocycles {fm1, gm1, im2, jm2:m1∈Nk1, m2∈Nk2} satisfying
[TABLE]
for every x1∈∂Λ1, and
[TABLE]
for every x2∈∂Λ2, then we say that h is period-preserving.
We will see that the following type of continuous orbit equivalence is characterised by diagonal-preserving graded isomorphisms of Kumjian–Pask algebras which motivates the terminology.
Definition 3.7**.**
Let Γ be a discrete group and let η1:Λ1→Γ and η2:Λ2→Γ be functors. We say that a continuous orbit equivalence h:∂Λ1→∂Λ2 is Γ-graded if there is a family of continuous cocycles {fm1, gm1, im2, jm2:m1∈Nk1, m2∈Nk2} for h such that
[TABLE]
for every m1∈Nk1 and every x1∈∂Λ1≥m1, and
[TABLE]
for every m2∈Nk2 and every x2∈∂Λ2≥m2.
We now state the main result of this section. If Γ is a discrete group and η:Λ→Γ is a functor, then we denote by cη the continuous cocycle cη:GΛ→Γ defined by cη(μx,d(μ)−d(ν),νx)=η(μ)η(ν)−1.
Proposition 3.8**.**
Let Γ be a discrete group, Λ1 a finitely-aligned k1-graph, Λ2 a finitely-aligned k2-graph, η1:Λ1→Γ and η2:Λ2→Γ functors, and h:∂Λ1→∂Λ2 a homeomorphism. The following are equivalent.
- (1)
There is an isomorphism ϕ:GΛ1→GΛ2 such that cη2∘ϕ=cη1 and ϕ(x1,0,x1)=(h(x1),0,h(x1)) for all x1∈∂Λ1.
2. (2)
The homeomorphism h is a Γ-graded, period-preserving continuous orbit equivalence.
3. (3)
The homeomorphism h is a Γ-graded continuous orbit equivalence with a family of continuous cocycles {fm1, gm1, im2, jm2:m1∈Nk1, m2∈Nk2} satisfying
[TABLE]
for every x1∈∂Λ1, and
[TABLE]
for every x2∈∂Λ2.
To prove Proposition 3.8 we need two lemmas but first we give a corollary. A finitely-aligned k-graph is called aperiodic if for each v∈Λ0, there exists a boundary path x∈v∂Λ such that for all λ,μ∈∂Λv, λ=μ implies that λx=μx. By [12, Proposition 6.3], Λ is aperiodic if and only if GΛ is topologically principal in the sense that the set of units x∈G0 such that {η∈Iso(GΛ):s(η)=x}={(x,0,x)} is dense in G0.
Corollary 3.9**.**
If Λ1 and Λ2 are aperiodic finitely-aligned higher-rank graphs, then any continuous orbit equivalence h:∂Λ1→∂Λ2 is period-preserving.
Proof.
Let i∈{1,2} and xi∈∂Λi. By Remark 3.5 we have {η∈Iso(GΛi)∘:s(η)=xi}={(xi,ni,xi):ni∈IP(xi)}. Since GΛi is topologically principal it follows that IP(xi)={0}. So (3.9) and (3.10) are satisfied trivially. The result now follows from (3) ⟹ (2) of Proposition 3.8
∎
Lemma 3.10**.**
Let Λ1 be a finitely-aligned k1-graph and Λ2 a finitely-aligned k2-graph, and suppose h:∂Λ1→∂Λ2 is a continuous orbit equivalence which has a family of continuous cocycles {fm1, gm1, im2, jm2:m1∈Nk1, m2∈Nk2}. There is a continuous groupoid homomorphism ϕ:GΛ1→GΛ2 such that
[TABLE]
for m1,n1∈Nk1, m1−n1=l1, x1∈∂Λ1≥m1, y1∈∂Λ1≥n1, and σΛ1m1(x1)=σΛ1n1(y1).
Proof.
If m1,n1∈Nk1, x1∈∂Λ1≥m1, y1∈∂Λ1≥n1, σΛ1m1(x1)=σΛ1n1(y1), then using (3.1) at the first and third equalities, we calculate
[TABLE]
Hence (h(x1),gm1(x1)−fm1(x1)−gn1(y1)+fn1(y1),h(y1))∈GΛ2.
We claim that if x1,y1∈∂Λ1, m1,n1,m1′,n1′∈Nk1, σΛ1m1(x1)=σΛ1n1(y1), σΛ1m1′(x1)=σΛ1n1′(y1), and m1−n1=m1′−n1′, then
[TABLE]
To prove the claim, write pm:=gm−fm for m∈Nk1. By (3.3), we have that
[TABLE]
Similarly, pm1′+n1(x1)−pn1′+n1(y1)=pm1′(x1)−pn1′(y1), so
[TABLE]
proving the claim. Thus, there is a well-defined map ϕ:GΛ1→GΛ2 such that (3.11) holds for m1,n1∈Nk1, m1−n1=l1, x1∈∂Λ1≥m1, y1∈∂Λ1≥n1, σΛ1m1(x1)=σΛ1n1(y1). It is straight-forward to check that ϕ is a continuous groupoid homomorphism.
∎
Lemma 3.11**.**
Let Λ1 be a finitely-aligned k1-graph and Λ2 a finitely-aligned k2-graph, and suppose h:∂Λ1→∂Λ2 is a continuous orbit equivalence which has a family of continuous cocycles {fm1, gm1, im2, jm2:m1∈Nk1, m2∈Nk2}. For each x1∈∂Λ1, there is a group homomorphism ϕPer(x1):Per(x1)→Per(h(x1)) such that
[TABLE]
for m1−n1∈Per(x1). Moreover, ϕPer(x1) restricts to a group homomorphism ϕIP(x1):IP(x1)→IP(h(x1)).
If (3.5) holds, then ϕPer(x1) is surjective, and if in addition (3.6) holds for x2=h(x1), then ϕPer(x1) is an isomorphism.
If (3.9) holds, then ϕIP(x1) is surjective, and if in addition (3.10) holds for x2=h(x1), then ϕIP(x1) is an isomorphism.
Proof.
Fix x1∈∂Λ1. Since Per(x1)={n1∈Zk1:(x1,n1,x1)∈GΛ1} and Per(h(x1))={n2∈Zk2:(h(x1),n2,h(x1))∈GΛ2}, it follows from Lemma 3.10 that there is a group homomorphism ϕPer(x1):Per(x1)→Per(h(x1)) satisfying (3.12) for m1−n1∈Per(x1).
Suppose m1−n1∈IP(x1). Then there is an open neighbourhood U1 of x1 such that σΛ1m1(y1)=σΛ1n1(y1) for all y1∈U1. Choose an open neighbourhood U1′ of x1 such that U1′⊆U1, fm1(y1)=fm1(x1), gm1(y1)=gm1(x1), fn1(y1)=fn1(x1), and gn1(y1)=gn1(x1) for every y1∈U1′. Choose l2∈Nk2 such that m2:=gm1(x1)−fm1(x1)+l2∈Nk2 and n2:=gn1(x1)−fn1(x1)+l2∈Nk2. Then h(U1′) is an open neighbourhood of h(x1) and
[TABLE]
for every x2∈h(U1′). This shows that ϕPer(x1)(m1−n1)=m2−n2∈IP(h(x1)). Thus, ϕPer(x1) restricts to a group homomorphism ϕIP(x1):IP(x1)→IP(h(x1)).
It is clear that if (3.5) holds, then ϕPer(x1) is surjective. If in addition (3.6) holds for x2=h(x1), then we have a surjective group homomorphism ϕPer(h(x1))′:Per(h(x1))→Per(x1). It follows that the rank of Per(x1) is equal to the rank of Per(h(x1)). Since Per(h(x1)) is a free abelian group, it follows that ϕPer(x1):Per(x1)→Per(h(x1)) is an isomorphism.
It is clear that if (3.9) holds, then ϕIP(x1) is surjective. If in addition (3.10) holds for x2=h(x1), then a similar argument to the one in the previous paragraph shows that ϕIP(x1) is an isomorphism.
∎
For a finitely-aligned k-graph Λ, we denote by cΛ the continuous cocycle cΛ:GΛ→Zk defined by cΛ(x,m,y)=m.
Proof of Proposition 3.8..
(1)⟹ (2) and (3): Suppose ϕ:GΛ1→GΛ2 is an isomorphism such that cη2∘ϕ=cη1 and ϕ(x1,0,x1)=(h(x1),0,h(x1)) for all x1∈∂Λ1. Recall the continuous function lΛ of Lemma 2.5. For m1∈Nk1, we define gm1:∂Λ1≥m1→Nk1 by
[TABLE]
and fm1:∂Λ1≥m1→Nk1 by
[TABLE]
It follows from the continuity of lΛ1, ϕ and cΛ2 that fm1 and gm1 are continuous. Similarly, for m2∈Nk2, we define jm2:∂Λ2≥m2→Nk2 by
[TABLE]
and im2:∂Λ2≥m2→Nk2 by
[TABLE]
It follows from the continuity of lΛ2, ϕ−1 and cΛ1 that im2 and jm2 are continuous.
We check that fm1(x1) and gm1(x1) satisfy (3.1) for m1∈Nk and x1∈∂Λ1≥m1. Write l:=lΛ2(ϕ(x1,m1,σΛ1m1(x1))) and c:=cΛ2(ϕ(x1,m1,σΛ1m1(x1))). We have ϕ(x1,0,x1)=(h(x1),0,h(x1)), so it follows that (h(x1),c,h(σΛ1m1(x1)))=ϕ(x1,m1,σΛ1m1(x1)))∈GΛ2. Thus
[TABLE]
We check that (3.3) is satisfied for m1,n1∈Nk and x1∈∂Λ1≥m1+n1. We calculate
[TABLE]
We check that (3.5) is satisfied for x1∈∂Λ1. If m1−n1∈Per(x1), then
[TABLE]
Since ϕ(x1,0,x1)=(h(x1),0,h(x1)), it follows that cΛ2(ϕ(x1,m1−n1,x1))∈Per(h(x1)). For the other containment, suppose that m2−n2∈Per(h(x1)). Since ϕ is an isomorphism with ϕ(x1,0,x1)=(h(x1),0,h(x1)), it follows that there exists m1−n1∈Per(x1) such that m2−n2=cΛ2(ϕ(x1,m1−n1,x1)), so (3.5) holds. A similar argument shows that (3.9) also holds.
We check that (3.7) is satisfied for x1∈∂Λ1 and m1∈Nk. Let l and c be as in the second paragraph. Using cη2∘ϕ=cη1 and σΛ2l(h(x1))=σΛ2l−c(h(σΛ1m1(x1))) at the second equality, we calculate
[TABLE]
Similar calculations show that im2 and jm2 satisfy (3.2), (3.4), (3.6), (3.8), and (3.10).
(2)⟹(1): Suppose {fm,gm,in,jn:m∈Nk1, n∈Nk2} is a family of continuous cocycles for h such that (3.5), (3.6), (3.7), and (3.8) hold. By Lemma 3.10 there is a continuous groupoid homomorphism ϕ:GΛ1→GΛ2 such that
[TABLE]
for m1,n1∈Nk1, x1∈∂Λ1≥m1, y1∈∂Λ1≥n1, σΛ1m1(x1)=σΛ1n1(y1), and m1−n1=l1. We will show that ϕ is bijective, and thus an isomorphism.
To see that ϕ is injective, fix (x1,l1,y1),(x1′,l1′,y1′)∈GΛ1 such that ϕ(x1,l1,y1)=ϕ(x1′,l1′,y1′). Since h is a homeomorphism, it follows that x1=x1′ and y1=y1′. It remains to show that l1=l1′. Observe that
[TABLE]
Let ϕPer(x1) be the group homomorphism from Per(x1) to Per(h(x1)) constructed in Lemma 3.11. By the definitions of ϕ and ϕPer(x1), we have that
[TABLE]
Since ϕPer(x1) is an isomorphism, we conclude that l1−l1′=0, and thus that (x1,l1,y1)=(x1′,l1′,y1′), showing that ϕ is injective.
To see that ϕ is surjective, fix (x2,l2,y2)∈GΛ2. Denote by ϕ′ the continuous groupoid homomorphism obtained by applying Lemma 3.10 to h−1:∂Λ2→∂Λ1 and the family {im2,jm2, fm1, gm1:m2∈Nk2, m1∈Nk1}. Then ϕ(ϕ′(x2,l2,y2))=(x2,l2′,y2) for some l2′∈Zk2. Let ϕPer(h−1(x2)) be the group homomorphism from Per(h−1(x2)) to Per(x2) constructed in Lemma 3.11. Since ϕPer(h−1(x2)) is an isomorphism, it follows that there is an l1∈Per(h−1(x2)) such that ϕPer(h−1(x2))(l1)=l2−l2′. We then have that
[TABLE]
showing that ϕ is surjective.
Since ϕPer(x) is a group isomorphism, we have that ϕ(x,0,x)=(h(x),0,h(x)) for x∈∂Λ1. Finally, we check that cη2∘ϕ=cη1. Fix (x,l,y)∈GΛ1 with l=m−n. Using the factorisation property at the third equality and (3.7) at the fourth, we calculate
[TABLE]
(3)⟹(1): Suppose {fm,gm,in,jn:m∈Nk1, n∈Nk2} is a family of continuous cocycles for h such that (3.7), (3.8), (3.9), and (3.10) hold. Let ϕ:GΛ1→GΛ2 be the continuous groupoid homomorphism obtained by Lemma 3.10. We aim to show that ϕ is bijective.
To see that ϕ is injective, fix (x1,l1,y1),(x1′,l1′,y1′)∈GΛ1 such that ϕ(x1,l1,y1)=ϕ(x1′,l1′,y1′). Since h is a homeomorphism, it follows that x1=x1′ and y1=y1′. It remains to show that l1=l1′. We begin by noting that as in the proof of (2) ⟹ (1), ϕ(x1,l1−l1′,x1)=(h(x1),0,h(x1)). Since GΛ2 is étale, its unit space GΛ20 is open in GΛ2, and therefore contained in Iso(GΛ2)∘, the interior of the isotropy groupoid. Since ϕ is a continuous groupoid homomorphism and h is a homeomorphism, it follows that ϕ−1(Iso(GΛ2))⊆Iso(GΛ1) and ϕ−1(Iso(GΛ2)∘)⊆Iso(GΛ1)∘. In particular, (x1,l1−l1′,x1)=ϕ−1(h(x1),0,h(x1))∈Iso(GΛ1)∘, so l1−l1′∈IP(x1) by Remark 3.5. Let ϕIP(x1) be the group homomorphism from IP(x1) to IP(h(x1)) constructed in Lemma 3.11. By the definitions of ϕ and ϕIP(x1), we have that
[TABLE]
Since ϕIP(x1) is an isomorphism, we conclude that l1=l1′, showing that ϕ is injective.
To see that ϕ is surjective, fix (x2,l2,y2)∈GΛ2. Denote by ϕ′ the continuous groupoid homomorphism obtained by applying Lemma 3.10 to h−1:∂Λ2→∂Λ1 and the family {im2,jm2, fm1, gm1:m2∈Nk2, m1∈Nk1}. Then ϕ(ϕ′(x2,l2,y2))=(x2,l2′,y2) for some l2′∈Zk2, and ϕ(ϕ′(x2,l2,y2))(y2,−l2,x2)=(x2,l2′−l2,x2)∈Iso(GΛ2). Since (x2,l2,y2)∈GΛ2 is fixed, we have that ϕ(ϕ′(ζ))ζ−1∈Iso(GΛ2) for every ζ∈GΛ2. Now, we claim that (x2,l2′−l2,x2)∈Iso(GΛ2)∘. Since GΛ2 is étale, it follows from the continuity of ϕ and ϕ′ that there is an open bisection A⊆GΛ2 that contains (x2,l2,y2) such that ϕ(ϕ′(ζ))ζ−1=(r(ζ),l2′−l2,r(ζ)) for every ζ∈A. Since {ϕ(ϕ′(ζ))ζ−1:ζ∈A} is an open subset of Iso(GΛ2), it follows that (x2,l2′−l2,x2)∈Iso(GΛ2)∘. Hence l2′−l2∈IP(x2) by Remark 3.5. Let ϕIP(h−1(x2)) be the group homomorphism from IP(h−1(x2)) to IP(x2) constructed in Lemma 3.11. Since ϕIP(h−1(x2)) is an isomorphism, it follows that there is an l1∈IP(h−1(x2)) such that ϕIP(h−1(x2))(l1)=l2−l2′. We then have that
[TABLE]
showing that ϕ is surjective.
As in the last paragraph of the proof of (2) ⟹ (1), ϕ(x,0,x)=(h(x),0,h(x)) for x∈∂Λ1 and cη2∘ϕ=cη1.
∎
We now apply results about groupoid C∗-algebras [10] and Steinberg algebras [8] to obtain the following two corollaries. For a discrete group Γ and a functor η:Λ→Γ, we denote by δη:C∗(Λ)→C∗(Λ)⊗C∗(Γ) the unique coaction satisfying δη(sλ)=sλ⊗η(λ) for λ∈Λ.
Corollary 3.12**.**
Let Γ be a discrete group and let R be a reduced indecomposable commutative ring with unit. Let Λ1 be a finitely-aligned k1-graph, Λ2 a finitely-aligned k2-graph, and let η1:Λ1→Γ and η2:Λ2→Γ be functors. The following are equivalent.
- (1)
There is an isomorphism ϕ:GΛ1→GΛ2 such that cη2∘ϕ=cη1.
2. (2)
There is a diagonal-preserving isomorphism ψ:C∗(Λ1)→C∗(Λ2) such that δη2(ψ(a))=(ψ⊗Id)(δη1(a)) for a∈C∗(Λ).
3. (3)
There is a Γ-graded diagonal-preserving ring-isomorphism from KPR(Λ1) onto KPR(Λ2).
4. (4)
There is a Γ-graded diagonal-preserving ∗-algebra-isomorphism from KPR(Λ1) onto KPR(Λ2).
5. (5)
There is a Γ-graded, period-preserving, continuous orbit equivalence h:∂Λ1→∂Λ2.
Proof.
The equivalence of (1) and (5) follows from Proposition 3.8. For i=1,2 and x∈∂Λi, the isotropy group (GΛi)xx is either trivial or isomorphic to Zki, so (1) and (2) are equivalent by [10, Theorem 6.2], and (1), (3), and (4) are equivalent by [24, Proposition 2.1 and Theorem 5.7] and an argument similarly to the one used to prove [8, Theorem 3.1].
∎
Corollary 3.13**.**
Let R be a reduced indecomposable commutative ring with unit, let Λ1 be a finitely-aligned k1-graph, and let Λ2 a finitely-aligned k2-graph. The following are equivalent.
- (1)
The topological groupoids GΛ1 and GΛ2 are isomorphic.
2. (2)
There is a diagonal-preserving ∗-isomorphism from C∗(Λ1) onto C∗(Λ2).
3. (3)
There is a diagonal-preserving ring-isomorphism from KPR(Λ1) onto KPR(Λ2).
4. (4)
*There is a diagonal-preserving ∗-algebra-isomorphism from KPR(Λ1) onto *
KPR(Λ2).
5. (5)
There is a period-preserving continuous orbit equivalence h:∂Λ1→∂Λ2.
Proof.
The result follows from Corollary 3.12 by letting Γ be the trivial group.
∎
We now show that there are 2-graphs whose boundary path spaces are homeomorphic but not continuously orbit equivalent.
Lemma 3.14**.**
If Λ1 and Λ2 are 2-graphs with the same skeleton, then ∂Λ1≅∂Λ2.
Proof.
Fix a boundary path x1:Ω2,m→Λ1 of degree m∈(N∪{∞})2. Then x1 is uniquely determined by a path in the skeleton of Ω2,m such that the edges alternate between red and blue edges; this same path in the skeleton also uniquely determines a boundary path x2:Ω2,m→Λ2 of degree m. A path λ1∈Λ1m is identified with a path λ2∈Λ2m in the same way. Thus there is a degree-preserving bijective map ϕ:∂Λ1∪Λ1→∂Λ2∪Λ2 such that ϕ(λ1x)=ϕ(λ1)ϕ(x) for λ1∈Λ1 and x∈Λ1∪∂Λ1 with s(λ1)=r(x). We check that ϕ is a homeomorphism. If λ1∈Λ1 and x1,x2∈Z(λ1), then (ϕ(x1))(0,d(λ1))=(ϕ(x2))(0,d(λ1)), so there exists λ2∈Λ2d(λ1) such that ϕ(ZΛ1(λ1))⊆ZΛ2(λ2). If G1⊆s(λ1)Λ1 is a finite subset, then there is a finite subset G2⊆s(λ2)Λ2 such that ϕ(∪ν∈G1ZΛ1(λ1ν1))⊆∪ν2∈G2ZΛ2(λ2ν2), so ϕ(ZΛ1(λ1∖G1))⊆ZΛ2(λ2∖G2). Suppose that G1 is nonexhaustive and choose α1∈s(λ1)Λ1 such that Λ1min(α1,β1)=∅ for every β1∈G1. To show that G2 is nonexhaustive, suppose for a contradiction that there exist β2∈G2 and (ρ2,τ2)∈Λ2min(ϕ(α1),β2). Then (ϕ−1(ρ2),ϕ−1(τ2))∈Λ1min(α1,β1), a contradiction. Finally, the same argument gives that, if μ2∈Λ2 and if G2⊆s(λ2)Λ2 is a finite nonexhaustive subset, then there is a μ1∈Λ1 and a finite nonexhaustive subset G1⊆s(λ1)Λ1 such that ϕ−1(ZΛ2(μ2∖G2))⊆ZΛ1(μ1∖G1).
∎
Remark 3.15**.**
In [14, Section 6] it is shown that there are 2-graphs described by the same skeleton but different factorisation rules that are not isomorphic and whose C∗-algebras are not isomorphic. In particular, [14, Example 6.1] presents 2-graphs Λ1 and Λ2 described by the same skeleton such that C∗(Λ1)≅O2≅O2⊗C(T)≅C∗(Λ2). Thus there are 2-graphs whose boundary path spaces are homeomorphic by Lemma 3.14 but are not continuously orbit equivalent by Corollary 3.13.
4. Eventual one-sided conjugacy
In this section, we generalise the 1-graph result [7, Theorem 4.1] by showing that two finitely-aligned k-graphs Λ1 and Λ2 are eventually one-sided conjugate if and only if the boundary path groupoids GΛ1 and GΛ2 are isomorphic by a groupoid isomorphism that preserves the standard cocycle.
Let Λ be a finitely-aligned k-graph and let R be a commutative ring with unit. There is a Zk-grading of KPR(Λ) given by KPR(Λ)n={sμsλ∗:μ,ν∈Λ, d(μ)−d(ν)=n}, for n∈Zk, there is a gauge action γΛ of Tk on C∗(Λ) given by γzΛ(sλ)=zd(λ)sλ, for z∈Tk and λ∈Λ, and there is a groupoid cocycle cΛ:GΛ→Zk given by cΛ(x,n,y)=n for (x,n,y)∈GΛ.
Definition 4.1**.**
Let Λ1 and Λ2 be finitely-aligned k-graphs. We say that ∂Λ1 and ∂Λ2 are eventually one-sided conjugate if there is a homeomorphism h:∂Λ1→∂Λ2 and for each m∈Nk there are continuous maps fm:∂Λ1≥m→Nk and gm:∂Λ2≥m→Nk satisfying
[TABLE]
for x∈∂Λ1≥m, and
[TABLE]
for y∈∂Λ2≥m. We say that such a homeomorphism h is an eventual one-sided conjugacy.
In particular, if ∂Λ1 and ∂Λ2 are conjugate, in the sense that there is a homeomorphism h:∂Λ1→∂Λ2 such that h∘σΛ1m=σΛ2m∘h for all m∈Nk, then they are eventually conjugate.
Theorem 4.2**.**
Let Λ1 and Λ2 be finitely-aligned k-graphs and let R be a reduced indecomposable commutative ring with unit. The following are equivalent.
- (1)
There is an isomorphism ϕ:GΛ1→GΛ2 such that cΛ2∘ϕ=cΛ1.
2. (2)
There is a diagonal-preserving isomorphism ψ:C∗(Λ1)→C∗(Λ2) such that γzΛ2∘ψ=ψ∘γzΛ1 for all z∈Tk.
3. (3)
*There is a Zk-graded diagonal-preserving isomorphism from KPR(Λ1) onto *
KPR(Λ2).
4. (4)
There is a Zk-graded diagonal-preserving ∗-isomorphism from KPR(Λ1) onto KPR(Λ2).
5. (5)
There is an eventual one-sided conjugacy h:∂Λ1→∂Λ2.
Proof.
By letting k1=k=k2, Γ=Zk, and η1=d=η2, we obtain the equivalence of (1)-(4) from Corollary 3.12. We show that (1) and (5) are equivalent. Our proof follows the proof of the 1-graph case in [7, Theorem 4.1].
(5) ⟹ (1): Suppose h:∂Λ1→∂Λ2 is an eventual one-sided conjugacy. For each (x,m−n,y)∈GΛ1, define ϕ(x,m−n,y):=(h(x),m−n,h(y)). To see that this gives a well-defined map ϕ:GΛ1→GΛ2, observe that
[TABLE]
so (h(x),m−n,h(y))∈GΛ2. It is routine to check that ϕ is an isomorphism and it is clear that cΛ2∘ϕ=cΛ1.
(1) ⟹ (5): Suppose ϕ:GΛ1→GΛ2 is an isomorphism such that cΛ2(ϕ(η))=cΛ1(η) for η∈GΛ1. Then the restriction of ϕ to GΛ10 is a homeomorphism onto GΛ20. Since the map x↦(x,0,x) is a homeomorphism from ∂Λ1 onto GΛ10, and y↦(y,0,y) is a homeomorphism from ∂Λ2 onto GΛ20, it follows that there is a homeomorphism h:∂Λ1→∂Λ2 such that ϕ((x,0,x))=(h(x),0,h(x)) for all x∈∂Λ1. Since cΛ2(ϕ(η))=cΛ2(η) for all η∈GΛ1, it follows that ϕ((x,n,y))=(h(x),n,h(y)) for all (x,n,y)∈GΛ1. Fix m∈Nk and λ∈Λ1m. Then A:=Z\big{(}Z_{\operatorname{\Lambda_{1}}}(\lambda),m,0,Z_{\operatorname{\Lambda_{1}}}(s(\lambda))\big{)} is a compact open subset of cΛ1−1(m), so ϕ(A) is a compact open subset of cΛ2−1(m). It follows from Lemma 2.4, that there exist an n∈N, mutually disjoint open subsets U1,…,Un of ∂Λ2, mutually disjoint open subsets V1,…,Vn of ∂Λ2, and f1,…,fn∈Nk such that
[TABLE]
Define fλ:Z(λ)→Nk by fλ(x)=fi for x∈h−1(Ui). Then fλ is continuous and σΛ2fλ(x)(h(σΛ1m(x)))=σΛ2fλ(x)+m(h(x)) for x∈Z(λ). By repeating this construction for each λ∈Λ1m, we get a continuous map fm:∂Λ1≥m→Nk such that σΛ2fm(x)(h(σΛ1m(x)))=σΛ2fm(x)+m(h(x)) for all x∈∂Λ1≥m. Applying the same construction gives a continuous map gm:∂Λ2≥m→N such that σΛ1gm(y)(h−1(σΛ2m(y)))=σΛ1gm(y)+m(h−1(y)) for all y∈∂Λ2≥m. Hence h is an eventual one-sided conjugacy. ∎
5. Stable isomorphism
In this section, we characterise stable isomorphism of the C∗-algebras and Kumjian–Pask algebras of finitely-aligned k-graphs in terms of isomorphisms of boundary path groupoids by applying results about groupoid C∗-algebras and Steinberg algebras [8, 9, 10]. We first study the stabilisation of k-graphs (see [25] for the 1-graph case).
Definition 5.1**.**
Let Λ be a finitely-aligned k-graph. The stabilisation of Λ, denoted by SΛ, is the k-graph obtained by attaching a copy of Ωk,∞ to each vertex. We identify each v∈Λ0 with the vertex (0,0) in the copy of Ωk,∞ corresponding to v.
Denote by R the full countable equivalence relation R=N×N, regarded as a discrete principal groupoid with unit space N. Similarly, for k∈N, denote by Rk the full countable equivalence relation Rk=Nk×Nk, regarded as a discrete principal groupoid with unit space Nk.
Lemma 5.2**.**
Let Λ be a finitely-aligned k-graph. Then GSΛ≅GΛ×R.
Proof.
We first show that GSΛ≅GΛ×Rk and then show that Rk≅R. Note that for each n∈Nk, there is a unique μn∈Ωk,∞ such that r(μn)=(n,n) and s(μn)=(0,0). For each v∈Λ0, write μn,v for μn in the copy of Ωk,∞ attached to v. Then ∂(SΛ)={μn,r(x)x:x∈∂Λ,n∈Nk} and has a basis consisting of compact open sets of the form ZSΛ(μn,r(λ)λ∖G). The map ϕ:∂Λ×Nk→∂(SΛ) defined by ϕ((x,n))=μn,r(x)x restricts to a continuous bijection of ZSΛ(μn,r(λ)λ∖G) onto the compact open set ZΛ(λ∖G)×{n}, so ϕ is a homeomorphism. It is routine to check that
[TABLE]
defines a groupoid isomorphism from GΛ×Rk to GSΛ. To see that Rk≅R, let ϕ be any bijection from Nk to N. Then (m,n)↦(ϕ(m),ϕ(n)) is an isomorphism from Rk to R.
∎
We denote by K the compact operators on ℓ2(N), and by C the maximal abelian subalgebra of K consisting of diagonal operators. For a commutative ring R with unit, we denote by M∞(R) the ring of finitely supported, countable infinite square matrices over R, and by D∞(R) the abelian subring of M∞(R) consisting of diagonal matrices.
Remark 5.3**.**
Let Λ be a finitely-aligned k-graph and R a commutative ring with unit. It follows from Lemma 5.2 that C∗(SΛ)≅C∗(Λ)⊗K and KPR(SΛ)≅KPR(Λ)⊗M∞(R). Hence the class of k-graph C∗-algebras and the class of Kumjian–Pask algebras are closed under stabilisation.
We now apply results of [8, 9, 10]. We first recall some definitions. Let G be an ample groupoid with unit space G0. If X is a subset of G0, then we let G∣X:=s−1(X)∩r−1(X), and say that X is G-full (or just full) if r(s−1(X))=G0. Two ample groupoids G1 and G2 are Kakutani equivalent if, for i=1,2, there is a Gi-full clopen subset Xi⊆Gi0 such that G1∣X1 and G2∣X2 are isomorphic (see [9] and [18]). We say that G1 and G2 are groupoid equivalent if there is a G1–G2 equivalence in the sense of [19, Definition 2.1].
For a finitely-aligned k1-graph and a finitely-aligned k2-graph, we say that an isomorphism ϕ:C∗(Λ1)⊗K→C∗(Λ2)⊗K is diagonal-preserving if ϕ(D(Λ1)⊗C)=D(Λ2)⊗C. Likewise, we say that an isomorphism ϕ:KPR(Λ1)⊗M∞(R)→KPR(Λ2)⊗M∞(R) is diagonal-preserving if ϕ(DR(Λ1)⊗D∞(R))=DR(Λ2)⊗D∞(R).
For a ring A, we denote by M(A) the multiplier ring of A (see for example [1]).
Corollary 5.4**.**
Let R be a reduced indecomposable commutative ring with unit, let Λ1 be a finitely-aligned k1-graph, and let Λ2 a finitely-aligned k2-graph. The following are equivalent.
- (1)
The groupoids GSΛ1 and GSΛ2 are isomorphic.
2. (2)
The groupoids GΛ1×R and GΛ2×R are isomorphic.
3. (3)
The groupoids GΛ1 and GΛ2 are Kakutani equivalent.
4. (4)
The groupoids GΛ1 and GΛ2 are groupoid equivalent.
5. (5)
There is a diagonal-preserving isomorphism from C∗(SΛ1) onto C∗(SΛ2).
6. (6)
There is a diagonal-preserving ring-isomorphism from KPR(SΛ1) onto KPR(SΛ2).
7. (7)
There is a diagonal-preserving ∗-algebra-isomorphism from KPR(SΛ1) onto KPR(SΛ2).
8. (8)
There is a period-preserving continuous orbit equivalence h:∂(SΛ1)→∂(SΛ2).
9. (9)
There is a diagonal-preserving ∗-isomorphism from C∗(Λ1)⊗K onto C∗(Λ2)⊗K.
10. (10)
For i=1,2, there is a projection pi∈M(D(Λi)) such that pi is full in C∗(Λi) and an isomorphism from ψ:p1C∗(Λ1)p1→p2C∗(Λ2)p2 such that ψ(p1D(Λ1))=p2D(Λ2).
11. (11)
*There is a diagonal-preserving ring-isomorphism from KPR(Λ1)⊗M∞(R) onto *
KPR(Λ2)⊗M∞(R).
12. (12)
For i=1,2, there is an idempotent pi∈M(DR(Λi)) such that pi is full in KPR(Λi), and a ring-isomorphism from ψ:p1KPR(Λ1)p1→p2KPR(Λ2)p2 such that ψ(p1DR(Λ1))=p2DR(Λ2).
13. (13)
There is a diagonal-preserving ∗-algebra-isomorphism from KPR(Λ1)⊗M∞(R) onto KPR(Λ2)⊗M∞(R).
14. (14)
*For i=1,2, there is a projection pi∈M(DR(Λi)) such that pi is full in KPR(Λi) and a ∗-algebra-isomorphism ψ:p1KPR(Λ1)p1→p2KPR(Λ2)p2 such that *
ψ(p1DR(Λ1))=p2DR(Λ2).
Proof.
The equivalence of (1) and (2) follows from Lemma 5.2. The equivalence of (2)-(4) is an application of [9, Theorem 3.2]. The equivalence of (1) and (5)-(8) follows from Corollary 3.13. For i=1,2 and x∈∂Λi, we have that (GΛi)xx is either trivial or isomorphic to Zki, so the equivalence of (2)-(4) and (11)-(14) follows from [24, Proposition 2.1 and Theorem 5.7] and an argument similarly to the one used to prove [8, Corollary 3.12], and the equivalence of (2)-(4) and (9)-(10) is an application of [10, Corollary 11.3].
∎
6. Two-sided conjugacy
In this section, we generalise the 1-graph result [7, Theorem 5.1] by showing that the two-sided multi-dimensional shift spaces associated to row-finite k-graphs Λ1 and Λ2 with finitely many vertices and no sinks or sources are conjugate if and only if the boundary path groupoids GSΛ1 and GSΛ2 are isomorphic by a cocycle-preserving isomorphism.
Let Λ be a finitely-aligned k-graph, let Γ be a discrete group, and let η:Λ→Γ be a functor. If λ∈SΛ, then either λ∈Λ, or there is a unique λ1∈Λ and a unique λ2 in the copy of Ωk,∞ corresponding to the vertex r(λ1) such that λ=λ2λ1. We write ηΛ for the functor from SΛ to Zk given by ηΛ(λ)=d(λ) for λ∈Λ, and ηΛ(λ)=d(λ1) for λ∈SΛ∖Λ.
Let Ωk be the k-graph Ωk:={(m,n)∈Zk×Zk:m≤n} with degree map d:Ωk→Nk defined by d(m,n)=n−m, and range and source maps r,s defined by r(m,n)=(m,m) and s(m,n)=(n,n). If Λ is row-finite and has finitely many vertices and no sinks or sources, then we write XΛ for the space of all k-graph morphisms from Ωk to Λ. We equip XΛ with the topology generated by subsets of the form
[TABLE]
where (m,n)∈Ωk and λ∈Λn−m. For m∈Zk, we denote by σΛm the homeomorphism from XΛ to itself given by
[TABLE]
for x∈XΛ and (p,q)∈Ωk.
If G is a groupoid, Γ is a discrete group, and c:G→Γ is a cocycle, then we write cˉ for the cocycle from G×R to Γ given by cˉ(ζ1,ζ2)=c(ζ1).
Theorem 6.1**.**
Let Λ1 and Λ2 be finitely-aligned k-graphs and let R be a reduced indecomposable commutative ring with unit. The following are equivalent.
- (1)
There is an isomorphism ϕ:GSΛ1→GSΛ2 such that cηΛ2∘ϕ=cηΛ1.
2. (2)
There is an isomorphism ϕ:GΛ1×R→GΛ2×R such that cˉΛ2∘ϕ=cˉΛ1.
3. (3)
There is a diagonal-preserving ∗-isomorphism ψ:C∗(Λ1)⊗K→C∗(Λ2)⊗K such that (γzΛ2⊗Id)∘ψ=ψ∘(γzΛ1⊗Id) for all z∈Tk.
4. (4)
There is a Zk-graded diagonal-preserving ring-isomorphism ψ:KPR(Λ1)⊗M∞(R)→KPR(Λ2)⊗M∞(R).
5. (5)
There is a Zk-graded diagonal-preserving ∗-algebra-isomorphism ψ:KPR(Λ1)⊗M∞(R)→KPR(Λ2)⊗M∞(R).
Moreover, if Λ1 and Λ2 are row-finite and have finitely many vertices and no sinks or sources, then (1)-(5) are equivalent to the following.
- (6)
There is a homeomorphism h:XΛ1→XΛ2 such that σΛ2m(h(x))=h(σΛ1m(x)) for all m∈Nk and all x∈XΛ1.
Proof.
For i=1,2, let κi:GSΛi→GΛi×R be the isomorphism of Lemma 5.2. We have that cˉΛi((x,m,y),(p,q))=m=cηΛi(μp,r(x)x,m+p−q,μq,r(y)y), so cˉΛi∘κi=cηΛi. It follows that (1) and (2) are equivalent. The equivalence of (2), (4) and (5) follows from [24, Proposition 2.1 and Theorem 5.7] and an argument similarly to the one used to prove [8, Theorem 3.11]. The equivalence of (2) and (3) follows from [10, Corollary 11.3]. It remains to show that (1) and (6) are equivalent when Λ1 and Λ2 are row-finite k-graphs that have finitely many vertices and no sinks or sources. Our proof follows the proof of the 1-graph case in [7, Theorem 5.1]. We identify ∂(SΛ) with ∂Λ×Nk via the isomorphism used in the proof of Lemma 5.2 given by μr(x),nx→(x,n), where x∈∂Λ and n∈Nk.
(1) ⟹ (6): Suppose Φ:GSΛ1→GSΛ2 is an isomorphism satisfying cηΛ2(Φ(γ))=cηΛ1(γ) for γ∈GSΛ1. For x∈Λ1∞, we have (x,0)∈(SΛ1)∞ and ((x,0),0,(x,0))∈GSΛ1. Since Φ is cocycle-preserving, we have Φ((x,0),0,(x,0))=((y,p),0,(y,p)) for some uniquely determined y∈Λ2∞ and p∈Nk. Define ψ:Λ1∞→Λ2∞ by ψ(x):=y. Since Φ is continuous, the map (x,0)↦(y,p) is continuous, so ψ is also continuous.
Fix m∈Nk. We have ((x,0),m,(σΛ1m(x),0))∈GSΛ1 for x∈Λ1∞. Since Φ is cocycle-preserving, there exist p,q∈Nk such that
[TABLE]
Hence there exists l∈Nk such that σΛ2l+m(ψ(x))=σΛ2l(ψ(σΛ1m(x))); let l(x)∈Nk be such that l(x)≤l for all l∈Nk satisfying this identity. We check that l:Λ1∞→Nk is continuous. Suppose (xi)i∈N in Λ1∞ converges to x. Then Φ((xi,0),m,(σΛ1m(xi),0))→Φ((x,0),m,(σΛ1m(x),0)) since Φ is continuous and ψ(xi)→ψ(x) and ψ(σΛ1m(xi))→ψ(σE(x)) since ψ is continuous. It follows that there is an N∈N such that for i≥N, we have that σΛ2l(x)+m(ψ(xi))=σΛ2l(x)(ψ(σΛ1(xi))) and either l(x)=0 or σΛ2l(x)(ψ(xi))=σΛ2l(x)−1(ψ(σΛ1(xi))). Hence l(xi)=l(x) for i≥N.
Since Λ1∞ is compact, it follows that there is an L∈Nk such that σΛ2L+m(ψ(x))=σΛ2L(ψ(σΛ1m(x))) for all x∈Λ1∞. Define φ:=σΛ2L∘ψ:Λ1∞→Λ2∞. Then φ is continuous and satisfies φ∘σΛ1m=σΛ2m∘φ.
Now, define φ:XΛ1→XΛ2 by (φ(x))(p,∞)=φ(x(p,∞)) for x∈XΛ1 and p∈Zk. Since φ∘σΛ1m=σΛ2m∘φ for all m∈Nk, it follows that φ is well-defined. It is routine to check that φ is continuous and that φ∘σΛ1m=σΛ2m∘φ for all m∈Nk. We will show that φ is bijective. It will then follow that φ is a conjugacy and thus that XΛ1 and XΛ2 are conjugate.
We first show that φ is injective. Take x,x′∈Λ1∞ such that φ(x)=φ(x′), and choose p,p′∈Nk such that Φ((x,0),0,(x,0))=((ψ(x),p),0,(ψ(x),p)) and Φ((x′,0),0,(x′,0))=((ψ(x′),p′),0,(ψ(x′),p′)). Since
σΛ2L(ψ(x))=σΛ2L(ψ(x′)),
it follows that ((ψ(x),p),p−p′,(ψ(x′),p′))∈GSΛ2 and thus that
[TABLE]
It follows that there is an n∈Nk such that σΛ1n(x)=σΛ1n(x′). Let n((x,x′)) be such that n((x,x′))≤n for all n∈Nk such that σΛ1n(x)=σΛ1n(x′). An argument similar to the one used to prove that l:Λ1∞→N is continuous, shows that
[TABLE]
is continuous. Since {(x,x′)∈Λ1∞×Λ1∞:φ(x)=φ(x′)} is closed in Λ1∞×Λ1∞ and thus compact, there exists N∈N such that σΛ1N(x)=σΛ1N(x′) for all x,x′∈Λ1∞ satisfying φ(x)=φ(x′). The injectivity of φ follows.
Next, we show that φ is surjective. Suppose y∈Λ2∞. Then
[TABLE]
for some x∈Λ1∞ and some n∈Nk. Choose p∈Nk such that
[TABLE]
Since ((x,0),−n,(x,n))∈GSΛ1 and Φ((x,0),−n,(x,n))=((ψ(x),m),m,(y,0)), it follows that there exists j∈Nk such that σΛ2j(ψ(x))=σΛ2j(y). An argument similar to the one used in the previous paragraph, then shows that there exists J∈Nk such that for each y∈Λ2∞ there is an x∈Λ1∞ such that σΛ2J(ψ(x))=σΛ2J(y). The surjectivity of φ follows.
(6) ⟹ (1): Suppose there is a conjugacy h:XΛ1→XΛ2. Then there is an l∈N such that if x,x′∈XΛ1 satisfy x(0,n)=x′(0,n) for all n∈Nk, then (h(x))(0,n)=(h(x′))(0,n) for all n∈Nk, and if y,y′∈XΛ2 satisfy y(0,n)=y′(0,n) for all n∈Nk, then (h−1(y))(0,n)=(h−1(y′))(0,n) for all n≥l. It follows that there is a continuous map π:Λ1∞→Λ2∞ such that (π(x(0,∞)))(0,n)=(h(x))(0,n) for x∈XΛ1 and n∈Nk. Then π is surjective, π∘σΛ1m=σΛ2m∘π for all m∈Nk, and if π(x)=π(x′) for x,x′∈Λ1∞, then σΛ1l(x)=σΛ1l(x′).
It follows from the continuity of π and the compactness of Λ1∞ that we can choose L≥l such that if x(0,L)=x′(0,L), then (π(x))(0,l)=(π(x′))(0,l). Define an equivalence relation ∼ on ΛL by λ∼μ if there are x∈Z(λ) and x′∈Z(μ) such that π(x)=π(x′) (that ∼ is transitive follows from the fact that if λ,μ,η∈Λ1L, x,x′∈Λ1∞, and π(λx)=π(μx) and π(μx′)=π(ηx′), then π(λx′)=π(ηx′)). Then π(x)=π(x′) if and only if x(0,L)∼x′(0,L) and σΛ1l(x)=σΛ1l(x′).
For each equivalence class B∈Λ1L/∼ choose a partition {Aλ:λ∈B} of Nk and bijections fλ:Aλ→Nk. The map ψ:(x,n)↦(π(x),fx(0,L)−1(n)) is then a homeomorphism from (SΛ1)∞→(SΛ2)∞. It is routine to check that
[TABLE]
is a groupoid isomorphism from GSΛ1 to GSΛ2 satisfying cηΛ2(Φ(γ))=cηΛ1(γ) for γ∈GSΛ1. ∎
Acknowledgements
JR is grateful for financial support from R. Hazrat (WSU), D. Pask (UoW) and A. Sims (UoW) via their jointly held ARC grant DP150101598, O. Shalit (Technion), the Institute of Mathematics and its Applications at the University of Wollongong, and his father Don. JR is grateful for the hospitality of the Carlsen family and G. Restorff while visiting and attending a workshop at the Faroe Islands.