This paper constructs and analyzes the tight groupoid of inverse semigroups from left cancellative small categories, providing insights into their $C^*$-algebras' structure, simplicity, and amenability.
Contribution
It introduces a path model for the filter space, computes the tight groupoid, and characterizes simplicity and amenability of the associated $C^*$-algebras.
Findings
01
Representation of $C^*$-algebras as groupoid algebras
02
Criteria for simplicity of the $C^*$-algebras
03
Conditions for amenability of the tight groupoid
Abstract
We fix a path model for the space of filters of the inverse semigroup SΛ associated to a left cancellative small category Λ. Then, we compute its tight groupoid, thus giving a representation of its C∗-algebra as a (full) groupoid algebra. Using it, we characterize when these algebras are simple. Also, we determine amenability of the tight groupoid under mild, reasonable hypotheses.
Equations299
Λ−1:={α∈Λ:∃β∈Λ such that αβ=s(β)}.
Λ−1:={α∈Λ:∃β∈Λ such that αβ=s(β)}.
αs(α)=α=ββ′=αα′β′.
αs(α)=α=ββ′=αα′β′.
α∨β:={the minimal extensions of α and β}.
α∨β:={the minimal extensions of α and β}.
I(X):={f:Y→Z:Y,Z⊆X and f is a bijection },
I(X):={f:Y→Z:Y,Z⊆X and f is a bijection },
g∘f:f−1(ran(f)∩dom(g))⟶g(ran(f)∩dom(g)),
g∘f:f−1(ran(f)∩dom(g))⟶g(ran(f)∩dom(g)),
f∗:=f−1:ran(f)⟶dom(f).
f∗:=f−1:ran(f)⟶dom(f).
σα=σατασαandτα=τασατα,
σα=σατασαandτα=τασατα,
SΛ:=⟨σα,τα:α∈Λ⟩.
SΛ:=⟨σα,τα:α∈Λ⟩.
s(βiγ)=αiγ=αj=s(βj).
s(βiγ)=αiγ=αj=s(βj).
TΛ={i=1⋁nταiσβi:{ταiσβi}i=1n⊂SΛ are pairwise compatible}.
TΛ={i=1⋁nταiσβi:{ταiσβi}i=1n⊂SΛ are pairwise compatible}.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
The tight groupoid of the inverse semigroups of left cancellative small categories.
We fix a path model for the space of filters of the inverse semigroup SΛ associated to a left cancellative small category Λ. Then, we compute its tight groupoid, thus giving a representation of its C∗-algebra as a (full) groupoid algebra. Using it, we characterize when these algebras are simple. Also, we determine amenability of the tight groupoid under mild, reasonable hypotheses.
Key words and phrases:
Left cancellative small category, inverse semigroup, tight representation, tight groupoid, groupoid C∗-algebra
2010 Mathematics Subject Classification:
Primary: 46L05; Secondary: 46L80, 46L55, 20L05
The second-named author was partially supported by PAI III grant FQM-298 of the Junta de Andalucía, and by the DGI-MINECO and European Regional Development Fund, jointly, through grant MTM2017-83487-P
Introduction
In [15], Spielberg described a new method of defining C∗-algebras from oriented combinatorial data, generalizing the construction of algebras from directed graphs, higher-rank graphs, and (quasi-)ordered groups. To this end, he introduced categories of paths –i.e. cancellative small categories with no (nontrivial) inverses– as a generalization of higher rank graphs, as well as ordered groups.The idea is to start with a suitable combinatorial object and define a C∗-algebra directly from what might be termed the generalized symbolic dynamics that it induces. Associated to the underlying symbolic dynamics, he present a natural groupoid derived from this structure. The construction also gives rise to a presentation by generators and relations, tightly related to the groupoid presentation. In [16] he showed that most of the results hold when relaxing the conditions, so that right cancellation or having no (nontrivial) inverses are taken out of the picture.
In [2], Bédos, Kaliszewski, Quigg and Spielberg use Spielberg’s construction to extend the notion of self-similar graph introduced in [10] –they termed it as “Exel-Pardo systems”– to the context of actions of group (potentially, of groupoids) on left cancellative small categories. To this end, they use a Zappa-Szép product construction, and studied the representation theory for the Spielberg algebras of the new left cancellative small category associated to this Zappa-Szép product.
In the present paper, we study Spielberg construction, using a groupoid approach based in the Exel’s tight groupoid construction [7]. To this end, we study various inverse semigroups associated to a left cancellative small category (see e.g. [6]), we compute a “path-like” model for their tight groupoids, and we study the basic properties of its tight groupoid. Also, we show that the tight groupoid for these inverse semigroups coincide with Spielberg’s groupoid [14]. With this tools at hand, we are able to characterize simplicity for the algebras associated to finitely aligned left cancellative small categories, and in particular in the case of Exel-Pardo systems. Finally, we give, under mild and necessary hypotheses, a characterization of amenability for such groupoid.
The contents of this paper can be summarized as follows: In Section 1 we recall some known facts about small categories and inverse semigroups. In Section 2 we study basic properties of the inverse semigroups SΛ and TΛ associated to a left cancellative small category Λ. Section 3 is devoted to study filters on a left cancellative small category and their path models. Section 4 deals with defining actions of SΛ on filter spaces, and we picture their tight groupoids. In Section 5 we show that the tight groupoid of SΛ is isomorphic (as topological groupoid) to the Spielberg’s groupoid on Λ. Groupoid properties characterizing simplicity on the associated algebras are stated in Section 6. Section 7 is centered in analyzing Zappa-Szép products, introduced in [2] to generalize self-similar graphs of [10], from our particular perspective. We close the paper studying, in Section 8, the amenability of the tight groupoid of Zappa-Szép products.
1. Basic facts.
In this section we collect all the background we need for the rest of the paper.
1.1. Small categories
Given a small category Λ, we will denote by Λ∘ the class of its objects, and we will identify Λ∘ with the identity morphisms, so that Λ∘⊆Λ. Given α∈Λ, we will denote by s(α):=dom(α)∈Λ∘ and r(α):=ran(α)∈Λ∘. The invertible elements of Λ are
[TABLE]
Definition 1.1**.**
Given a small category Λ, and let α,β,γ∈Λ:
(1)
Λ is left cancellative if αβ=αγ then β=γ,
2. (2)
Λ is right cancellative if βα=γα then β=γ,
3. (3)
Λhas no inverses if αβ=s(β) then α=β=s(β).
A category of paths is a small category that is right and left cancellative and has no inverses.
Notice that if Λ is either left or right cancellative, then the only idempotents in Λ are Λ∘. Indeed, if αα=α, since α=r(α)α=αs(α) we have that α=s(α) or α=r(α).
Definition 1.2**.**
Let Λ be a small category. Given α,β∈Λ, we say that βextends α (equivalently α is an initial segments of β) if there exists γ∈Λ such that β=αγ. We denote by [β]={α∈Λ:α is an initial segment of β}. We write α≤β if α∈[β].
Lemma 1.3**.**
Let Λ be a small category. Then
(1)
the relation ≤ is reflexive and transitive,
2. (2)
if Λ is left cancellative with no inverses, then ≤ is a partial order.
Proof.
(1) Clearly α=αs(α), so α extends itself. If β=αα′ (α≤β) and γ=ββ′ (β≤γ), then γ=αα′β′ (α≤γ).
(2) Suppose that α=ββ′ (β≤α) and β=αα′ (α≤β). Then,
[TABLE]
Thus, by left cancellation we have that s(α)=α′β′, whence since Λ has no inverses it follows that α′,β′∈Λ∘.
∎
Let Λ be a LCSC, and let α,β∈Λ. Then the following are equivalent:
(1)
α≈β,
2. (2)
αΛ=βΛ,
3. (3)
[α]=[β].
Notation 1.6**.**
Let Λ be a LCSC. Given α,β∈Λ, we say :
(1)
α⋒β if and only if αΛ∩βΛ=∅,
2. (2)
α⊥β if and only if αΛ∩βΛ=∅.
Definition 1.7**.**
Let Λ be a LCSC, and let F⊂Λ. The elements of ⋂γ∈FγΛ are the common extensions of F. A common extension ε of F is minimal if for any common extension γ with ε∈γΛ we have that γ≈ε.
When Λ has no inverses, given F⊆Λ and given any minimal common extension ε of F, if γ is common extension of F with ε∈γΛ then γ=ε. We will denote by
[TABLE]
Notice that if α∨β=∅ then α⋒β, but the converse fails in general.
Definition 1.8**.**
A LCSC Λ is finitely aligned if for every α,β∈Λ there exists a finite subset Γ⊂Λ such that αΛ∩βΛ=⋃γ∈ΓγΛ.
When Λ is a finitely aligned LCSC, we can always assume that α∨β=Γ where Γ is a finite set of minimal common extensions of α and β.
1.2. Inverse semigroups
Definition 1.9**.**
A semigroup S is an inverse semigroup if for every s∈S there exists a unique s∗∈S such that s=ss∗s and s∗=s∗ss∗.
Equivalently, S is an inverse semigroup if and only if the subsemigroup E(S):={e∈S:e2=e} of idempotents of S is commutative [12, Theorem 1.1.3].
A monoid is a semigroup with unit. We say that a semigroup S has zero if there exists 0∈S such that 0s=s0=0 for every s∈S.
Definition 1.10**.**
Given a set X, we define the (symmetric) inverse semigroup on X as
[TABLE]
endowed with operation
[TABLE]
and involution
[TABLE]
Notice that I(X) has unit IdX:X→X and zero being the empty map 0:∅→∅.
The Wagner-Preston Theorem [12, Theorem 1.5.1] guarantees that every inverse semigroup is a ∗-subsemigroup of I(X) for some suitable set X.
Definition 1.11**.**
Let S be an inverse semigroup, and let E(S) be its subsemigroup of idempotents. Given e,f∈E(S), we say that e≤f if and only if e=ef. We extend this relation to a partial order as follows: given s,t∈S, we say that s≤t if and only if s=ss∗t=ts∗s.
Definition 1.12**.**
We say that s,t∈S are compatible, denoted by s∼t, if both s∗t and st∗ belong to E(S).
This concept will be essential to understand various properties.
Let Σ⊆S. If ⋁α∈Σα∈S, then the elements of Σ are pairwise compatible.
We say that S is (finitely) distributive if whenever Σ is a (finite) subset of S and s∈S, if ⋁α∈Σα∈S then ⋁α∈Σsα∈S and s(⋁α∈Σα)=⋁α∈Σsα.
We will say that S is (finitely) complete if for every (finite) subset Σ⊆S of pairwise compatible elements we have that ⋁α∈Σα∈S.
The symmetric inverse monoid I(X) is complete and distributive [12, Proposition 1.2.1(i-ii)]. But this property is not necessarily inherited by its inverse subsemigroups. Indeed, the point is that given Σ⊆S a set of pairwise compatible elements, and s∈S:
(1)
Not necessarily ⋁α∈Σα∈S,
2. (2)
even if ⋁α∈Σα∈S, it can happen that ⋁α∈Σsα∈/S.
To understand when f,g∈I(X) are compatible elements, and describe who is f∨g∈I(X), we address the reader to Lawson’s monograph [12, Proposition 1.2.1].
2. The semigroups SΛ and TΛ
Given a LCSC Λ, we will define some inverse semigroups associated to Λ.
Definition 2.1**.**
Let Λ be a LCSC. For any α∈Λ, we define two elements of I(Λ):
(1)
σα:αΛ→s(α)Λ given by αβ↦β,
2. (2)
τα:s(α)Λ→αΛ given by β↦αβ.
Clearly σα is injective, and since Λ is left cancellative so is τα.
Moreover,
[TABLE]
for every α∈Λ.
Definition 2.2**.**
Given a LCSC Λ, we define the semigroup
[TABLE]
Lemma 2.3**.**
Let Λ be a LCSC. Then SΛ is an inverse semigroup.
Proof.
It is clear, since I(Λ) is an inverse semigroup, and SΛ⊆I(Λ) is closed under composition and inverses.
∎
In order to better understand its structure, we will need to consider finite aligned LCSC. First, we introduce a definition.
Definition 2.4**.**
Let Λ be a finitely aligned LCSC, and let s∈SΛ. We say that a presentation s=⋁i=1nταiσβi is irredundant if for all 1≤i=j≤n we have αi∈[αj] and βi∈[βj].
Remark 2.5**.**
Let s=⋁i=1nταiσβi∈SΛ, and suppose that for all 1≤i=j≤n we have βi∈[βj].
Now suppose that there exists 1≤i=j≤n with αi≤αj, so there exists γ∈Λ such that αiγ=αj. Then we have that
[TABLE]
But since s:⋃i=1ndom(σβi)→⋃i=1nran(ταi) is a bijection, we have that βiγ=βj, so βi≤βj, a contradiction. Thus, s is irredundant. Similarly it can be proved that s is irredundant if and only if for all 1≤i=j≤n we have αi∈[αj].
If Λ is a finite aligned LCSC, then every f∈SΛ is the supremum of a finite family of elements of the form τασβ with α,β∈Λ and s(α)=s(β). Moreover, if such a decomposition is irredundant, then is unique (up to permutation).
Notice that, given any finite family {α1,…,αn}⊂Λ, the elements {ταiσαi}i=1n⊂SΛ are pairwise compatible, so that ⋁i=1nταiσαi∈I(Λ), but not necessarily to SΛ. Thus, in order to do some essential arguments we need to consider a new object.
Definition 2.7**.**
Let Λ be a finitely aligned LCSC. We define
[TABLE]
Clearly, by Lemma 2.6SΛ⊆TΛ⊂I(Λ). Moreover, by [12, Proposition 1.4.20 & Proposition 1.4.17], TΛ is closed by composition and inverses, and moreover, is finitely distributive. Thus,
Lemma 2.8**.**
Let Λ be a finitely aligned LCSC. Then, TΛ is an inverse semigroup containing SΛ. Moreover, TΛ is the smallest finitely complete, finitely distributive, inverse semigroup containing SΛ.
Now, we will proceed to understand who are the elements in E(TΛ) and the order relation.
Lemma 2.9**.**
Let Λ be a finitely aligned LCSC. Then e∈E(TΛ) if and only if e=⋁i=1nταiσαi for some α1,…,αn∈Λ.
Proof.
Let e∈E(TΛ), then e=⋁i=1nταiσβi.
By [12, Proposition 1.4.17], e∗=e=⋁i=1nτβiσαi, and
[TABLE]
Thus, ⋁i=1nτβiσβi=⋁i=1nταiσβi. But then given 1≤i≤n, we have that
[TABLE]
as desired.
∎
Proposition 2.10**.**
Let Λ be a finitely aligned LCSC, and let e=⋁i=1nταiσαi, f=⋁j=1mτβjσβj be idempotents of either SΛ or TΛ (written in irredundant form). Then, the following are equivalent:
(1)
e≤f,
2. (2)
for each 1≤k≤n, there exists 1≤l≤m such that βl≤αk.
Proof.
For (1) implies (2), let e,f∈E(TΛ) with e≤f. Then, e=⋁i=1nταiσαi and f=⋁j=1mτβjσβj. Fix any 1≤k≤n. Then,
ταkσαk≤e≤f if and only if
[TABLE]
Since TΛ is finitely distributive, we have that
[TABLE]
Without loss of generality, we can assume that the decomposition is irredundant (by using the reduction argument in the proof of [15, Theorem 6.3]. By Lemma 2.6, there exist 1≤l≤m and ε^∈αk∨βl such that ταkσαk=ταkσαk(ε^)σβlσβl(ε^), whence αk=αkσαk(ε^)=βlσβl(ε^). Thus, βl is an initial segment of αk if and only if βl≤αk if and only if βl∈[αk].
For (2) implies (1), if βl≤αk, then ταkσαk≤τβlσβl≤f. Since this is true for all 1≤k≤n, we have that e≤f, as desired.
Notice that, even we need TΛ to argue, the conclusion works for SΛ too.
∎
By an analog argument, we have the following result, extending Proposition 2.10 to any couple of elements of SΛ.
Proposition 2.11**.**
Let Λ be a finitely aligned LCSC, and let s=⋁i=1nταiσβi, t=⋁j=1mτγjσδj be elements of either SΛ or TΛ (written in irredundant form). Then, the following are equivalent:
(1)
s≤t,
2. (2)
for each 1≤k≤n, there exists 1≤l≤m such that αk=γlϵ and βk=δlϵ for some ϵ∈s(γl)Λ.
Now, we will connect SΛ with the semigroups appearing in [6, 15, 16].
Definition 2.12**.**
Let Λ be a small category. A zigzag is an even tuple of the form
[TABLE]
with αi,βi∈Λ, r(αi)=r(βi) for every 1≤i≤n and s(αi+1)=s(βi) of every 1≤i<n. We will denote by ZΛ the set of zigzags of Λ. Given ξ∈ZΛ, we define s(ξ)=s(βn), r(ξ)=s(α1) and ξ=(βn,αn,…,β1,α1).
Every ξ∈ZΛ defines a zigzag map φξ∈I(Λ) by
[TABLE]
We will denote Z(Λ)={φξ:ξ∈ZΛ}.
Remark 2.13**.**
(1)
For every α∈Λ we can define ξα:=(r(α),α). Notice that φξα=τα and φξα=σα.
2. (2)
Z(Λ) is closed by concatenation, and φξ1∘φξ2=φξ1ξ2.
3. (3)
If Λ is a LCSC, then Z(Λ) is an inverse semigroup. Moreover, Z(Λ)=SΛ.
Proof.
First part is a consequence of Remark 2.13(2-3). For the second part, Remark 2.13(1-3) implies that SΛ⊆Z(Λ). On the other side, for every ξ∈ZΛ we have that φξ∈SΛ, so that Z(Λ)⊆SΛ.
∎
Hence, when working with Z(Λ), we benefit of results in previous sections.
3. Filters on LCSC
Let Λ be a LCSC. We denote by E:=E(SΛ) the semilattice of idempotents of the inverse semigroup SΛ.
Definition 3.1**.**
A nonempty subset η of E is a filter if:
(1)
e∈η, f∈E and e≤f, then f∈η,
2. (2)
e,f∈η then ef∈η.
The set of filters of E is denoted by E^0. We can endow E^0 with a topology, as follows.
Definition 3.2**.**
For any X,Y⊂E finite subsets, define
[TABLE]
Then
[TABLE]
is a basis for a topology of E^0, under which E^0 is Hausdorff and locally compact space (See e.g.[9]).
Definition 3.3**.**
A filter η∈E^0 is an ultrafilter if it is not properly contained in another filter. Equivalently, η is maximal among the filters, partially ordered by inclusion.
A filter η∈E^0 is an ultrafilter if and only if e∈E and ef=0 for every f∈η implies e∈η.
We denote by E^∞ the subspace of ultrafilters of E^0. Usually, E^∞ is not closed in E^0.
Definition 3.5**.**
We define E^tight as the closure of E^∞ in E^0. A filter in E^tight is called tight filter.
In order to characterize tight filters,we need to introduce some known concepts.
Definition 3.6**.**
Given X,Y⊂E finite sets, we define
[TABLE]
Definition 3.7**.**
Given a subset F of E, a outer cover for F is a subset Z⊂E such that for every f∈F there exists z∈Z such that zf=0. Moreover, Z is a cover for F if Z is an outer cover for F with Z⊆F.
Given an idempotent e∈E, we say that Z⊆E is a cover for e if Z is a cover for the set {f∈E:f≤e}.
A filter η∈E^0 is tight if and only if for every X,Y⊂E finite sets and for every finite cover Z of EX,Y, η∈U(X,Y) implies Z∩η=∅.
3.1. Path models
Viewing some examples of LCSC, as graphs and k-graphs, we are interested in obtain practical models of ultrafilters and tight filters. These models should behave, somehow, as paths in a graph.
To guarantee that every filter has a such a path model, we introduce a restriction on Λ.
Definition 3.9**.**
Let Λ be a finitely aligned LCSC. We say that a filter η∈E0 enjoys condition (∗) if given ⋁i=1nταiσαi∈η, then there exists 1≤j≤n such that ταjσαj∈η.
Notice that, if Λ is singly aligned, then every filter enjoy condition (∗) (see e.g. [5, Proposition 3.5]).
Before showing how to construct the path model of η, let us show that there exist filters where this property always holds.
Lemma 3.10**.**
Let Λ be a finitely aligned LCSC. Then, any η∈E^tight satisfies condition (∗).
Proof.
Let e∈η. By Lemmas 2.6 and 2.9, e=⋁i=1nταiσαi. Define X={e}, Y=∅ and Z={ταiσαi}i=1n. Since e=⋁i=1nταiσαi≥ταjσαj for every 1≤j≤n, it is clear that Z⊂EX,Y. Also, if 0=f≤e=⋁i=1nταiσαi, then fταjσαj=0 for every 1≤j≤n will imply that
[TABLE]
a contradiction. Hence, Z is a finite cover of EX,Y. Clearly, η∈U(X,Y).
Thus, η∈E^tight implies η∩Z=∅ by Lemma 3.8, i.e. there exists 1≤j≤n such that ταjσαj∈η.
∎
Corollary 3.11**.**
If Λ is a finitely aligned LCSC, then every η∈E^∞ satisfies condition (∗).
Now, we proceed to introduce a set of paths.
Definition 3.12**.**
Let Λ be a finitely aligned LCSC. A nonempty subset F of Λ is:
(1)
Hereditary, if α∈Λ, β∈F and α≤β implies α∈F,
2. (2)
(upwards) directed, α,β∈F implies that there exists γ∈F with α,β≤γ.
We denote Λ∗ the set of nonempty, hereditary, directed subsets of Λ.
Notice that, if F∈Λ∗, there exists a unique v∈Λ0 such that F⊂vΛ. Indeed, given any α,β∈F, there exists γ∈F with γ≥α,β, i.e., γ=αα^=ββ^ for some α^,β^∈Λ. Thus, v=r(α) for any α∈F is the desired element.
Definition 3.13**.**
Given η∈E^0, we define
[TABLE]
Lemma 3.14**.**
Let Λ be a finitely aligned LCSC. For every η∈E^0 satisfying condition (∗) we have that Δη∈Λ∗.
Proof.
By condition (∗), Δη=∅. Set α∈Λ, β∈Δη such that α≤β. Then τβσβ≤τασα. Since τβσβ∈η and η is a filter, we have that τασα∈η, whence α∈Δη.
Finally, suppose α,β∈Δη. Then τασα,τβσβ∈η, so that τασατβσβ=⋁ε∈α∨βτεσε∈η. By condition (∗) there exists δ∈(α∨β)∩Δη, and since τδσδ≤τασα,τβσβ we have that α,β≤δ∈Δη, as desired.
∎
Definition 3.15**.**
If Λ is a finitely aligned LCSC, we define
[TABLE]
Thus,
Corollary 3.16**.**
If Λ is a finitely aligned LCSC, then
[TABLE]
is a well-defined map.
Now, we will construct an inverse for this map.
Definition 3.17**.**
Given F∈Λ∗, we define
[TABLE]
Lemma 3.18**.**
If Λ is a finitely aligned LCSC, then for every F∈Λ∗ we have that ηF∈E∗.
Proof.
Since F=∅, the set {τασα:α∈F}⊆ηF, whence ηF=∅. Set e∈ηF, f∈E such that e≤f. By hypothesis there exists α∈F such that τασα≤e≤f then f∈ηF.
Now set e,f∈ηF. Then, there exists α,β∈F such that τασα≤e, τβσβ≤f. Since F is directed, there exists γ∈F with α,β≤γ. Thus, τγσγ≤τασατβσβ≤ef, whence ef∈ηF.
Finally, if f∈ηF, then there exists α∈F such that f≥τασα. If f=⋁j=1mτβjσβj (written in irredundant form), by Proposition 2.10 there exists 1≤i≤m such that τβiσβi≥τασα. Since ηF∈E^0, we have that τβiσβi∈ηF. Hence, ηF satisfies condition (∗), so we are done.
∎
Corollary 3.19**.**
If Λ is a finitely aligned LCSC, then
[TABLE]
is a well-defined map.
Lemma 3.20**.**
If Λ is a finitely aligned LCSC, then Φ and Ψ are naturally inverse bijections.
Proof.
Let η∈E^0, and compute
[TABLE]
Thus, Ψ∘Φ(η)⊆η. On the reverse sense, if e∈η and e=⋁i=1nταiσαi, by condition (∗) there exists 1≤j≤n such that ταjσαj∈η. Thus, αj∈Δη and e≥ταjσαj, whence e∈Ψ∘Φ(η), and so Ψ∘Φ(η)⊇η.
Conversely, given F∈Λ∗, compute
[TABLE]
Clearly, Φ∘Ψ(F)⊆F. On the reverse sense, if α∈F then τασα∈ηF, and thus α∈Λ and τασα≥τβσβ for some β∈F, whence α∈Φ∘Ψ(F). Thus, F=Φ∘Ψ(F).
∎
3.2. Topology of Λ∗
Before tracking E^∞ and E^tight through Ψ, we need to consider a suitable topology defined on Λ∗.
Definition 3.21**.**
Let Λ be a finitely aligned LCSC. Then given X,Y⊂Λ finite sets, we define
[TABLE]
We will endow a topology on Λ∗, with a basis of open sets
[TABLE]
On the other side, since E∗⊆E^0, we can equip E∗ with the induced topology. To simplify, we also use U(X,Y) (see Definition 3.2) to denote the basic open sets of the topology for E∗. Since both E∞ and Etight are subspaces of E∗, in particular the closure of E∞ in E^0 coincides with the closure of E∞ in E∗.
We will show that Φ and Ψ are continuous (and thus homeomorphism) with these topologies on E∗ and Λ∗.
Lemma 3.22**.**
Let Λ be a finitely aligned LCSC. Then,
[TABLE]
is a basis for the topology of E∗.
Proof.
Let e,f1,…,fn∈E, and consider the basic open set U(X,Y) where X={e} and Y={fi}i=1n. Set e=⋁i=1nταiσαi, fi=⋁j=1miτβi,jσβi,j for 1≤i≤m. Define Σ:={τβi,jσβi,j}i=1,…,mj=1,…,mi. Now, given η∈U(X,Y), we have that e∈η and η∩Y=∅.
Since η enjoys condition (∗), there exists 1≤j≤n such that ταjσαj∈η. If η∩Σ=∅, then there exists τβi,jσβi,j∈η, whence fi≥τβi,jσβi,j∈η, and thus η∩Y=∅, a contradiction.
Hence, there exists 1≤j≤n such that η∈U({ταjσαj},Σ).
Conversely, if there exists 1≤j≤n such that η∈U({ταjσαj},Σ), then ταjσαj≤e, and since ταjσαj∈η we have that e∈η. Also, if η∩Y=∅, then there exists 1≤k≤m such that fk∈η. By condition (∗), there exists 1≤l≤mk such that τβk,lσβk,l∈η, whence η∩Σ=∅, a contradiction. Thus, η∈U(X,Y), and then U(X,Y)=⋃i=1nU({ταiσαi},Σ), so we are done.
∎
As a consequence, we have
Lemma 3.23**.**
Let Λ be a finitely aligned LCSC. Then Φ and Ψ are homeomorphisms.
Proof.
By Lemma 3.20, both are injections. Since they are mutually inverses, it is enough to show that they are open maps. We will show that for Φ (the proof for Ψ is analog). We denote by BΛ={τασα:α∈Λ}⊂E. By Lemma 3.22, TE={U(X,Y):X,Y⊂BΛ finite sets} is a basis for the topology of E∗. Now, given a finite set E⊂BΛ, we define E^={α∈Λ:τασα∈E}⊂Λ. Fix U(X,Y)∈TE for some finite sets X,Y⊂BΛ, and compute
[TABLE]
Since Φ is a bijection, η∩Y=∅ if and only if Δη∩Y^=∅, and τασα∈η if and only if α∈Δη, whence
[TABLE]
Since Φ is a bijection
[TABLE]
Thus, Φ is open, as desired.
∎
Now, we will identify both Φ(E^∞) and Φ(E^tight) in an intrinsic way. To this end, we will use a key result from [15].
Let Λ be a countable finitely aligned LCSC. If C⊂Λ is a directed subset and β∈Λ is such that β⋒α for every α∈C, then there exists C~⊂Λ directed subset such that {β}∪C⊆C~. Moreover, if C is hereditary, then so is C~.
Definition 3.25**.**
Given Λ a LCSC, we say that C∈Λ∗ is maximal if whenever C⊂D with D∈Λ∗ we have that D=Λ. We will denote Λ∗∗:={C∈Λ∗:C is maximal}.
Lemma 3.26**.**
Let Λ be a countable, finitely aligned LCSC. Then given η∈E^0 the following statements are equivalent:
(1)
η∈E^∞,
2. (2)
Δη∈Λ∗∗.
Proof.
(1)⇒(2). First, if β∈Λ and β⋒α for every α∈Δη, we will see that β∈Δη. Notice that β⋒α for every α∈Δη if and only if τασατβσβ=0 for every α∈Δη. Now, let e=⋁i=1nταiσαi∈η. By Corollary 3.11, there exists 1≤j≤n such that ταjσαj∈η, whence αj∈Δη. Thus,
τβσβe≥τβσβταjσαj=0. Since η∈E^∞, Lemma 3.4 implies that τβσβ∈η, and thus β∈Δη.
Now, suppose C∈Λ∗ and Δη⊂C. If β∈C∖Δη, since C is directed we have that β⋒α for every α∈Δη, whence by Lemma 3.4β∈Δη. Thus, Δη is maximal.
(2)⇒(1). Set F∈Λ∗∗, and take ηF∈E∗. First, pick β∈Λ such that τβσβe=0 for every e∈ηF. In particular, τβσβτασα=0 for every α∈F, whence β⋒α for every α∈F. By Lemma 3.24 there exists F~∈Λ∗ such that F∪{β}⊂F~. Since F is maximal, β∈F, and thus τβσβ∈ηF. Now, let f∈E with fe=0 for every e∈ηF. By Lemmas 2.6 and 2.9 we have f=⋁i=1nτβiσβi, whence for every α∈F
[TABLE]
Suppose that for each 1≤i≤n there exists αi∈F such that αi∨βi=∅. Define g:=τα1σα1⋯ταnσαn∈ηF. Since F is directed, there exists γ∈F with {α1,…,αn}≤γ, whence τγσγ≤g. Thus,
[TABLE]
a contradiction.
Thus, there exists 1≤j≤n such that α∨βj=∅ for every α∈F. Thus, βj∈F by the previous argument, and hence ηF∋τβjσβj≤f, so that f∈ηF. Then, ηF∈E^∞, as desired.
∎
Notice that this means that Φ(E^∞)=Λ∗∗. Since Φ is continuous and E^tight=E^∞∥⋅∥E∗ we have that
[TABLE]
[TABLE]
Now, we will introduce a couple of definitions for tight hereditary directed subsets of Λ, and we will show that they are equivalent.
First definition is just the translation of Lemma 3.8 to the context of Λ∗, we need to recover, and extend, the concept from [15].
Definition 3.27**.**
Let Λ be a LCSC and α∈Λ. A subset F⊂r(α)Λ is exhaustive with respect to α if for every γ∈αΛ there exists a β∈F with β⋒γ. We denote FE(α) the collection of finite sets of r(α)Λ that are exhaustive with respect to α.
Notice that exhaustive sets corresponds to covers.
Definition 3.28**.**
Let Λ be a LCSC and v∈Λ0. Then, C∈vΛ∗ is tight if for every α∈C, every {β1,…,βn}∩C=∅ and any finite exhaustive set Z of αΛ∖⋃i=1nβiΛ we have that C∩Z=∅. We denote by Λtight the set of tight hereditary directed sets.
Now we introduce the new definition.
Definition 3.29**.**
Let Λ be a LCSC and v∈Λ0. We say that C∈vΛ∗ is E-tight if for every α∈C and every finite set F of Λ with C∩F=∅, there exists D∈Λ∗∗ with α∈D and D∩F=∅. We denote by ΛE−t the set of E-tight hereditary directed sets.
We have that ΛE−t=Φ(E^tight). Now,
Lemma 3.30**.**
Let Λ be a LCSC. Then ΛE−t=Λtight.
Proof.
First we prove ΛE−t⊆Λtight. Let C∈ΛE−t and let Y={y1,…,yn}⊂Λ be a finite set with C∩Y=∅. Let α∈C and take any finite exhaustive set Z={z1,…,zm}⊂αΛ∖⋃i=1nyiΛ. Suppose that Z∩C=∅. By assumption there exists D∈Λ∗∗ with α∈D and D∩{Y∪Z}=∅. Since Y∩D=∅, Z∩D=∅ and D is maximal, by Lemma 3.24 there exist xy1,…,xyn∈D with xyi⊥yi for every 1≤i≤n, and xz1,…,xzm∈D with xzj⊥zj for every 1≤j≤m. Therefore, since D is a directed set, there exists w∈D with xyi≤w for 1≤i≤n, xzj≤w for 1≤j≤m and α≤w. Observe that w∈/yiΛ, because otherwise yiΛ∩xyiΛ=∅ for every 1≤i≤n, a contradiction. Thus, w∈αΛ∖⋃i=1nyiΛ, and since Z is an exhaustive set of αΛ∖⋃i=1nyiΛ, there exists zk∈Z such that w⋒zk. But then xzk⋒zk, a contradiction.
Now we will prove ΛE−t⊇Λtight. Let C∈vΛ∗ be tight, α∈C, and let F={β1,…,βn}⊂Λ such that F∩C=∅. Let Ψ(C)=ηC={e∈E:τγσγ≤e for some γ∈C}. Then, τασα∈ηC and τβiσβi∈/ηC for every 1≤i≤n, so ηC∈U(X,Y) where X={τασα} and Y={τβiσβi}i=1n. Let Z={τγjσγj}j=1m be any finite cover of EX,Y, whence {γj}j=1m⊆αΛ∖⋃i=1nβiΛ is a finite exhaustive set. Therefore, by hypothesis, there exists 1≤k≤m such that γk∈C, and hence τγkσγk∈ηC, so Z∩ηC=∅. But then, by Lemma 3.8, it follows that ηC is a tight filter. Since E^tight is the closure of E^∞, there exists ξ∈E^∞ such that ξ∈U(X,Y). But then Φ(ξ)=Δξ∈Λ∗∗ by Lemma 3.26, with α∈Δξ and Δξ∩F=∅, as desired.
∎
Example 3.31**.**
Let E=(E0,E1,r,s) be a directed graph. A finite path α of E of length n≥1 is a sequence α1⋯αn where αi∈E1 for 1≤i≤n such that s(αi)=r(αi+1) for 1≤i≤n−1. Given a path of length n we define s(α)=s(αn) and r(α)=r(α1). We denote by En be the sets of paths of length n. If we define the paths of length [math] by E0, and we denote by E∗=⋃i=0∞Ei the set of all finite paths of E.
An infinite path α=α1α2⋯ of E is an infinite sequence of edges αi∈E1 such that r(αi+1)=s(αi) for every i≥1. We denote by E∞ the set of infinite paths. A singular vertex of E is a vertex v∈E0 such that ∣r−1(v)∣∈{0,∞}. We denote by Esing0 the set of singular vertices of E, we denote by Esource0={v∈E0:r−1(v)=∅} and by Einf0={v∈E0:∣r−1(v)∣=∞}. Thus, Esing0=Esource0∪Einf0.
Then we define Λ to be the singly aligned LCSC given by the set of finite paths E∗. Given a path α∈E∗ of length n we define Eα={α1⋯αi:1≤i≤n}, where Ev={v} for v∈E0. Moreover given an infinite path α∈E∞ we define Eα={α1⋯αi:i≥1}. It is straightforward to prove that
[TABLE]
Now, given α∈E∗ of length n with r(α)∈Esing0, let k≤n and β1,…,βm⊆E∗∖Eα. If s(α)∈Esource0, then Eα trivially belongs to ΛE−t. Suppose that s(α)∈Einf0. Since s(α) is an infinite emitter, we have that there exists e∈r−1(s(α)) such that e is not contained in any path of β1,…,βm. Now, let γ be a path containing αe that is either infinite or s(γ)∈Esource0. Then, α1⋯αk∈Eγ and Eγ∩{β1,…,βm,}=∅. Thus, Eα∈ΛE−t. Conversely, given α∈E∗ of length n with s(α)∈E0∖Esing0, then Y={αe:e∈r−1(s(α))} is a finite set, and given any Eγ containing α must contain αe for some e∈r−1(s(α)). Thus, Eα∈/ΛE−t, and consequently Λ∗∗⊊Λtight.
4. Actions of SΛ
4.1. Basic definitions
We first recall the basic elements about partial actions of inverse semigroups on E^0 and some subspaces of it. For further references see [9].
Definition 4.1**.**
Let S be an inverse semigroup, let E:=E(S) be its semilattice of idempotents and let E^0 be the locally compact Hausdorff space of filters on E. Given any s∈S and any η∈E^0 with s∗s∈η, we define
[TABLE]
which is a filter containing ss∗. This defines a partial action of S on E^0. For each s∈S, the domain of s⋅ is
[TABLE]
and the range of s⋅ is Dss∗:=U({ss∗},∅). Thus, s⋅ acts by local homeomorphisms. In particular s⋅ is continuous.
Since s⋅η∈E^∞ for every η∈E^∞ [9, Proposition 3.5], we have that s⋅η∈E^tight for every η∈E^tight [7, Proposition 12.11].
Now, we specialize to the case of SΛ, when Λ is a finite aligned LCSC and η∈E∗, the reason being that we are interested in define an action of SΛ on Λ∗, using the homeomorphisms defined in the previous section. The essential step to be covered is to show that the action defined on E^0 restricts to E∗.
First, we need to prove a couple of results.
Lemma 4.2**.**
Let Λ be a finitely aligned LCSC. Let s=⋁i=1nταiσβi∈SΛ be irredundant. Then, for any 1≤i=j≤n such that βiΛ∩βjΛ=∅ and for any η∈βiΛ∩βjΛ we have that ταiσβi(η)=ταjσβj(η).
Proof.
Since s∈SΛ, ταiσβi and ταjσβj are compatible. Thus,
[TABLE]
is an idempotent, whence by Lemma 2.9 we have that αiσβi(ε)=αjσβj(ε) for every ε∈βi∨βj. Since η∈βiΛ∩βjΛ, there exists ε∈βi∨βj such that
[TABLE]
Hence,
[TABLE]
∎
Lemma 4.3**.**
Let Λ be a finitely aligned LCSC. Let s=⋁i=1nταiσβi∈SΛ be irredundant. If e=⋁i=1kτβiσβi∈SΛ for any 1≤k≤n, then se=⋁i=1kταiσβi in SΛ.
Proof.
By hypothesis, βi≰βj whenever i=j. Fix 1≤k≤n, and set t=⋁i=1kταiσβi∈TΛ. Now, se∈SΛ, and we have that
[TABLE]
Let us prove that se=t as function in I(Λ); if so, then we conclude se=t∈SΛ. We will compute the image of any element in dom(se). Pick any 1≤i≤k, 1≤j≤n. Then, we have two options:
(1)
βiΛ∩βjΛ=∅: in this case, τβiσβj=0, and thus ταiσβiτβjσβj=ταiσβi(βj)=0.
2. (2)
βiΛ∩βjΛ=⋃ε∈βi∨βjεΛ: in this case
[TABLE]
Thus, given any ε∈βi∨βj and any δ∈s(ε)Λ, we have that ταiσβiτβjσβj(εδ)=ταiσβi(εδ).
Applying Lemma 4.2, we conclude that se=t, as desired.
∎
Lemma 4.4**.**
Let Λ be a finite aligned LCSC, let η∈E∗ and s∈SΛ. Then, s⋅η∈E∗.
Proof.
As noticed before, s⋅η∈E^0. Since s acts on η, we have s∗s∈η and ss∗∈s⋅η. If e∈η, then s∗se∈η. Hence, without lost of generality, we can assume that e=s∗se, whence s∗(ses∗)s=e. Moreover, since η∈E∗, we can assume that e=τγσγ for some γ∈Λ.
Now, take s=⋁i=1nταiσβi. By [12, Proposition 1.4.17(1)],
[TABLE]
Since e≤s∗s, by Proposition 2.11 there exists 1≤j≤n such that βj≤γ, i.e. γ=βjβj. By Lemma 4.3, se=ταjβjσγ, whence ses∗=se(se)∗=ταjβjσαjβj.
Now, given any idempotent f=⋁k=1mτδkσδk, by Proposition 2.11 we have that sτγσγs∗≤f if and only if there exists 1≤k≤m such that δk≤αjβj∈Δs⋅ξ. Then, δk∈Δs⋅ξ, and thus τδkσδk∈s⋅ξ. Hence, s⋅ξ satisfies condition (∗), as desired.
∎
By restricting our attention to E∗, we will use the notation Ds∗s and Dss∗ to refer to the domain and range of the action of an element s∈SΛ on E∗. Then, given s∈SΛ, we can write (in a unique way up to irredundacy) s=⋁i=1nταiσβi by Lemma 2.6, so that s∗s=⋁i=1nτβiσβi by Lemma 2.9, and thus Ds∗s⊆⋃i=1nDτβiσβi. On the other side, if τβiσβi∈η for some 1≤i≤n, then τβiσβi≤s∗s implies that s∗s∈η, whence ⋃i=1nDτβiσβi⊆Ds∗s. Thus, ⋃i=1nDτβiσβi=Ds∗s. Analogously, ⋃i=1nDταiσαi=Dss∗.
4.2. The partial action on Λ∗.
Since we have an homeomorphism Ψ:E∗→Λ∗ with inverse Ψ (Lemma 3.23) we can transfer the action of SΛ on E∗ to Λ∗. First we will fix the domain and range.
Definition 4.5**.**
Let s=τασβ∈SΛ. Then, we define
[TABLE]
and
[TABLE]
Given s=⋁i=1nταiσβi we can define
[TABLE]
The sets Es∗s and Ess∗ are the natural candidates for being the domain and range of the partial action of SΛ on Λ∗.
Next step is to define the action. We will start by defining the action in the particular case of s=τασβ. In this case, F∈Eβ if and only if β∈F. Then we define
[TABLE]
where [δ] is the set of initial segments of δ∈Λ, who clearly belong to Λ∗. Indeed:
(1)
τασβ(β)=α, thus, τασβ⋅F=∅.
2. (2)
Set η1,η2∈τασβ⋅F, this means that there exist γ1,γ2 extensions of β with γ1,γ2∈F such that ηi≤ασβ(γi) for i=1,2. Since F is directed, β≤γ1,γ2≤δ for some δ∈F. Thus,
[TABLE]
3. (3)
If δ∈τασβ⋅F and η≤δ, then there exists γ≥β and γ∈F such that η≤δ≤ασβ(γ), so that η∈τασβ⋅F.
Moreover, τασβ⋅F∈Eα. Thus, in this case we have that
[TABLE]
is a well-defined map.
Now, set s=⋁i=1nταiσβi∈SΛ, with
[TABLE]
By Lemma 1.13, ταiσβi and ταjσβj are compatible for 1≤i,j≤n, and then ταiσβiτβjσαj and τβiσαiταjσβj are idempotents in SΛ.
For every 1≤i≤n and every F∈Eβi, we can define
[TABLE]
The only point to be checked is that, if F∈Eβi∩Eβj for 1≤i=j≤n, then ταiσβi⋅F=ταjσβj⋅F. To check this observe that, if F∈Eβi∩Eβj, then we have that βi,βj∈F∈Λ∗. Thus, there exists γ∈F with βi,βj≤γ. Without lost of generality we can assume that γ=βi∨βj. Then, γ=βiσβi(γ)=βjσβj(γ). But
[TABLE]
so that for every ε∈βi∨βj we have that αiσβi(ε)=αjσβj(ε). In particular, for the γ above, we have that αiσβi(γ)=αjσβj(γ). Hence,
[TABLE]
that is ταiσβi⋅F=ταjσβj⋅F, as desired.
Because of this fact, we can define the map
[TABLE]
as follows: given F∈Es∗s=⋃i=1nEβi we can assume, after re-indexing, that β1,…,βk∈F and βk+1,…,βn∈/F. Thus,
[TABLE]
4.3. The Key Lemma.
Now, we will prove a result, essential to fix the dictionary.
Lemma 4.6**.**
Let Λ be a finitely aligned LCSC. Then, for every s∈SΛ and any η∈Ds∗s∩E∗ we have that s⋅Δη=Δs⋅η.
Proof.
Given any s∈SΛ, we have that s=⋁i=1nταiσβi, so that s∗s=⋁i=1τβiσβi and Ds∗s=⋃i=1nDτβiσβi.
By the previous arguments, we can restrict the action of s on Ds∗s to an action of s^i:=ταiσβi on Dτβiσβi for each particular filter η∈Dτβiσβi. Hence, we can reduce the question to the case s=τασβ, s∗s=τβσβ and η∈Dτβσβ.
First observe that
[TABLE]
Since η satisfies condition (∗), if e=⋁i=1nτγiσγi, then there exists 1≤j≤n such that τγjσγj∈η, whence
[TABLE]
Now, τασβτγσγτβσα=⋁ϵ∈β∨γτασβ(ϵ)σασβ(ϵ). Since τβσβ∈η, we have that β∈Δη. Hence, there exists ϵ∈(β∨γ)∩Δη. Thus,
[TABLE]
for some ϵ∈(β∨γ)∩Δη, and thus
[TABLE]
Given f=⋁i=1nτδiσδi, since s⋅η∈E∗ by Lemma 4.4, then by Proposition 2.10 we have that f≥τασβ(γ)σασβ(γ) if and only if there exists 1≤k≤n such that δk≤ασβ(γ) for some γ∈Δη with β≤γ. Hence, we have that
[TABLE]
Thus,
[TABLE]
as desired.
∎
Corollary 4.7**.**
Let Λ be a countable, finite aligned LCSC. Then given s∈SΛ:
(1)
s⋅* restricts to an action on Λ∗∗,*
2. (2)
s⋅* restricts to an action on Λtight.*
Proof.
Lemma 4.6 shows that for every s∈SΛ and for every η∈Ds∗s we have that s⋅Φ(η)=Φ(s⋅η).
For (1) since Φ(E^∞)=Λ∗∗, for any F∈Λ∗∗ we have that ηF=Ψ(F)∈E^∞, so that
[TABLE]
For (2) since s⋅ is continuous and Λtight=Λ∗∗∥⋅∥Λ∗ the result derives from (1).
∎
4.4. The tight groupoid.
Given an action of an inverse semigroup S on a locally compact Hausdorff space X, we can associate to it a groupoid as follows: Consider S×X:={(s,x):x∈Ds∗s} with
(1)
d(s,x)=x and r(s,x)=s⋅x,
2. (2)
(s,x)⋅(t,y) is defined if t⋅y=x, and then (s,x)⋅(t,y)=(st,y),
3. (3)
(s,x)−1=(s∗,s⋅x) .
We say that (s,x)∼(t,y) if and only if x=y and there exists e∈E(S) with x∈De and se=te. This is an equivalence relation, compatible with the groupoid structure. Thus, we define S⋊X:=S×X/∼, with the induced operations defined above. Moreover, (S⋊X)(0)=X.
Now to define the topology on S⋊X, given s∈S and U⊆Ds∗s an open set, the subset
[TABLE]
gives us a basis for S⋊Xunder which it is a locally compact étale groupoid.
When X=E^tight, S⋊X is the tight groupoid of the inverse semigroup, denote by Gtight(S). For extra information see for example [9].
We will show a nice description of Gtight(SΛ).
Lemma 4.8**.**
Let Λ be a finitely aligned LCSC. Let s=⋁i=1nταiσβi∈SΛ and let ξ∈Ds∗s. Suppose that βk∈Δξ for some 1≤k≤n. Then [ταkσβk,ξ]=[s,ξ]∈Gtight(SΛ). In particular
[TABLE]
Proof.
Let s=⋁i=1nταiσβi∈SΛ and let [s,ξ]∈Gtight(SΛ). Then by definition [s,ξ]=[se,ξ] for any e∈ξ. Let 1≤k≤n such that βk∈Δξ, whence e=ταkσβk∈ξ. Then by Lemma 4.3 we have that se=ταkσβk. Thus, [s,ξ]=[ταkσβk].
Finally, given any [s,ξ]∈Gtight(SΛ) with s=⋁i=1nταiσβi and ξ∈E^tight, there exists βk∈Δξ, since ξ satisfies condition (∗). So by the above [s,ξ]=[ταkσβk,ξ].
∎
Now we are ready to prove the following result.
Lemma 4.9**.**
Let Λ be a finite aligned LCSC. Then, Gtight(SΛ) is topologically isomorphic to SΛ⋊Λtight.
Proof.
Since Φ:E^tight→Λtight is a homeomorphism and for every s∈SΛ and η∈E^tight, we have that s⋅Φ(η)=Φ(s⋅η), we conclude that the map
[TABLE]
is a groupoid isomorphism.
Now set s,t∈SΛ, η∈Ds∗s∩Dt∗t and e∈E(SΛ) with η∈De and se=te. Then, Φ(η)∈Es∗s∩Et∗t and Δη∈Ee, so that
[TABLE]
Consequently, the isomorphism ρ induces an isomorphism
[TABLE]
Finally, given any s∈SΛ and U⊆Ds∗s open subset, we have that Φ(U)⊆Es∗s is an open set and ρ^(Θ(s,U))=Θ(s,Φ(U)). Thus, ρ^ is a homeomorphism.
∎
We are ready to show when this groupoid is Hausdorff. First, we need to recall some known facts.
Definition 4.10**.**
A poset is a weak semilattice if the intersection of principal downsets is finitely generated as a downset.
In the case of Λ being right cancellative, Λ can be seen as a subsemigroup of SΛ via the natural map α↦τα. Hence, when Λ is a left and right cancellative small category, we have the following result.
Let S be a countable inverse semigroup. If S is Hausdorff, then so is Gtight(S).
Thus,
Corollary 4.14**.**
If Λ is a countable, finite aligned left and right cancellative small category, then Gtight(SΛ)≅SΛ⋊Λtight is Hausdorff.
Proof.
The conclusion follows by Lemma 4.9 and Corollary 4.13.
∎
If Λ fails to be right cancellative, Corollary 4.14 would fail in general.
4.5. Universal tight representations.
In this subsection we quickly revisit the results proved in [6], just fixing the essential hypotheses required to guarantee that these results hold.
First, notice that the results of [6, Sections 1.1 and 2] do not require Λ to be other than LCSC. In particular, the key result is [6, Proposition 3.4], that works correctly for SΛ.
Second, to apply the results of [6, Section 3], we only need to fix the following facts:
(1)
As noticed in [16, Remark before Theorem 10.10], the result required to prove [6, Theorem 3.7] (namely, [15, Theorem 8.2]) do not depend on the amenability of Spielberg’s groupoid G∣∂Λ. Thus,
2. (2)
Given Λ a (countable) finitely aligned LCSC, we define:
(a)
C∗(Λ) is the universal C∗-algebra generated by a family {Tα:α∈Λ} satisfying:
(i)
Tα∗Tα=Ts(α).
2. (ii)
TαTβ=Tαβ if s(α)=r(β).
3. (iii)
TαTα∗TβTβ∗=⋁γ∈α∨βTγTγ∗.
4. (iv)
Tv=⋁α∈FTαTα∗ for every v∈Λ0 and for all F⊂vΛ finite exhaustive set.
2. (b)
Given any unital commutative ring R, we define RΛ the R-algebra generated by a family {Tα:α∈Λ} satisfying:
(i)
Tα∗Tα=Ts(α).
2. (ii)
TαTβ=Tαβ if s(α)=r(β).
3. (iii)
TαTα∗TβTβ∗=⋁γ∈α∨βTγTγ∗.
4. (iv)
Tv=⋁α∈FTαTα∗ for every v∈Λ0 and for all F⊂vΛ finite exhaustive set.
In order to relate these algebras with the associated tight groupoid, we need to show that the natural representations π:SΛ→C∗(Λ) and π:SΛ→RΛ are universal tight. With respect to its tighness, Donsig and Millan [6, Theorem 3.7] showed that these representations are cover-to-joint, and the concluded that they are tight. As recently observed by Exel [8], that could fail, so that there is an slight imprecision in the proof of [6, Theorem 2.2]. Fortunately, Exel solved this problem [8, Corollary 5.2, Theorem 6.1], so that the conclusion remains true. Hence, by [16, Theorem 10.15] and [6, Theorem 3.7], we have the following result.
Proposition 4.15**.**
Let Λ be a (countable) finitely aligned LCSC. Then:
(1)
The natural semigroup homomorphism
[TABLE]
is a universal tight representation of SΛ in the category of C∗-algebras.
2. (2)
For any unital commutative ring R, the natural semigroup homomorphism
[TABLE]
is a universal tight representation of SΛ in the category of R-algebras.
Hence, because of [7, Theorem 13.3], Proposition 4.11 and [18, Corollary 5.3], we have
Theorem 4.16**.**
Let Λ be a (countable) finitely aligned LCSC. Then:
(1)
C∗(Λ)≅C∗(Gtight(SΛ)).
2. (2)
For any unital commutative ring R, RΛ≅AR(Gtight(SΛ)).
5. Spielberg’s groupoid
In [14] Spielberg defines a groupoid G∣∂Λ for a category of paths Λ. We will show that this groupoid is topologically isomorphic to Gtight(SΛ).
First, Spielberg defines a topology in Λ∗ that coincides with the topology we introduce in the definition 3.21. Indeed, for α∈Λ and β1,…,βn∈αΛ∖{α}, and setting E=αΛ∖⋃i=1nβiΛ we have that
[TABLE]
Therefore, we have that ∂Λ=Λ∗∗=Λtight.
Next result is a refined version of [15, Lemma 4.12].
Lemma 5.1**.**
Let Λ be a finitely aligned LCSC. Let F,G∈Λ∗ and α,β∈Λ such that τα⋅F=τβ⋅G. Then there exists δ∈F and γ∈G such that αδ=βγ.
Proof.
Let δ′∈F, then αδ′∈τβ⋅G. By definition, there exists γ′∈G such that αδ′≤βγ′. Then, there is η∈Λ such that αδ′η=βγ′. Now, there exists ξ∈F such that βγ′≤αξ, and hence there is η′∈Λ such that βγ′η′=αξ, whence αδ′ηη′=αξ. Now, by left cancellation, we have that δ′ηη′=ξ, so δ′η≤ξ∈F. Then, since F is hereditary, it follows that δ′η∈F too. If we define δ:=δ′η and γ:=γ′, we are done.
∎
Now, we recall the definition of Spielberg’s groupoid associated to a small category (see e.g. [14, pp. 729-730]). We start defining an equivalence relation on Λ×Λ×Λ∗ by saying that (α,β,F)∼(α′,β′,F′) if there exist G∈Λ∗, γ,γ′∈Λ such that F=τγ⋅G, F′=τγ′⋅G, αγ=α′γ′ and βγ=β′γ′. Denote G=Λ×Λ×Λ∗/∼. Now, we define a partial operation on G. To this end, fix the set of composable pairs
[TABLE]
and define [α,β,F]−1=[β,γ,F]. Given a pair ([α,β,F],[γ,δ,G])∈G(2) we define the multiplication by
[TABLE]
where ξ∈F and η∈G are the elements given in Lemma 5.1 such that βξ=γη, and H=σξ⋅F=ση⋅G. Finally, the sets [α,β,U]:={[α,β,F]:F∈U} for U an open subset of Λ∗ forms a basis for the topology of G, under which G is an étale groupoid. By Corollary 4.7, we have that G∣∂Λ={[α,β,F]∈G:F∈Λtight}.
Proposition 5.2**.**
Let Λ be a countable, finitely aligned LCSC. Then the map
[TABLE]
is an isomorphism of topological groupoids.
Proof.
First, let (α,β,F)∼(α′,β′,F′), that this, there exist G∈Λ∗, γ,γ′∈Λ such that F=τγ⋅G, F′=τγ′⋅G, αγ=α′γ′ and βγ=β′γ′. Then
[TABLE]
Now, βγ∈τβ⋅F=τβ′⋅F′, and
[TABLE]
Hence, (τασβ,τβ⋅F)∼(τα′σβ′,τβ′⋅F′), and thus, Φ is a well-defined map.
Suppose that ([α,β,X],[γ,δ,Y]) is a composable pair in G∣∂Λ. Since τβ⋅X=τγ⋅Y, by [15, Lemma 4.12] there exist ξ,η∈Λ, and Z∈Λtight such that X=τξ⋅Z, Y=τη⋅Z and βξ=γη. Then, Φ([α,β,X])=[τασβ,τβ⋅X], Φ([γ,δ,Y])=[τγσδ,τδ⋅Y], and Φ([α,β,X][γ,δ,Y])=Φ([αξ,δη,Z])=[ταξσδη,τδη⋅Z]. Notice that, since τγσδ⋅(τδ⋅Y)=τγ⋅Y=τγη⋅Z=τβξ⋅Z=τβ⋅X, we can compute
[TABLE]
On one side, τδ⋅Y=τδη⋅Z. On the other side, since βξ=γη, we have [τασβ,τβ⋅X]=[ταξσβξ,τβξ⋅Z], [τγσδ,τδ⋅Y]=[τγησδη,τδη⋅Z], and thus
[TABLE]
Since ταξσβξτγησδη=ταξσγητγησδη=ταξσδη, we have
[TABLE]
So, Φ is a groupoid homomorphism.
Suppose that [α,β,X],[γ,δ,Y] in G∣∂Λ such that
[TABLE]
Then, τβ⋅X=τδ⋅Y. By Lemma 5.1, there exist ξ∈X,η∈Y such that βξ=δη. Then, the idempotent e=τβξσβξ=τδησδη lies in the right domain, and since [τασβ,τβ⋅X]=[τγσδ,τδ⋅Y], left cancellation give us
ταξσβξ=τασβ⋅e=τγσδ⋅e=τγησγη. Thus, ταξ=τγη, whence αξ=γη, and hence [α,β,X]=[γ,δ,Y]. So, Φ is injective.
Finally, let [τασβ,F]∈SΛ⋊Λtight. Then Φ([α,β,σβ⋅F])=[τασβ,τβ⋅(σβ⋅F)]=[α,β,τβσβ⋅F]. But since β∈F it follows that τβσβ⋅F=F, so Φ is exhaustive, and hence Φ is a topological groupoid isomorphism.
∎
6. Simplicity
In [15, Section 10] are given conditions in a category of paths Λ for G∣∂Λ being topologically free, minimal and locally contractive, but right-cancellation of Λ is crucial in the proofs therein. We are going to use the isomorphism in Proposition 5.2 and the characterization of these properties given in [9], to extend Spielberg results in [15, Section 10] to finitely aligned LCSC.
Definition 6.1**.**
Let S be an inverse semigroup, and let s∈S. Given an idempotent e∈E such that e≤s∗s, we will say that:
(1)
e is fixed under s, if se=e,
2. (2)
e is weakly-fixed under s, if (sfs∗)f=0, for every non-zero idempotent f≤e.
Definition 6.2**.**
Given an action α:S↷X, let s∈S, and let x∈Ds∗s.
(1)
αs(x)=x, we will say that x is a fixed point for s. We denote by Fs the set of fix points for s.
2. (2)
If there exists e∈E, such that e≤s, and x∈De, we will say that x is a trivially fixed point for s.
3. (3)
We say that α is a topologically free action, if for every s in S, the interior of the set of fixed points for s consists of trivial fixed points.
Given an action α:S↷X, the groupoid S⋊X is effective if and only if the action α is topologically free [9, Theorem 4.7].
Remark 6.3**.**
Let Λ be a finitely aligned LCSC, and let SΛ↷E^tight be the associated action. Let s∈SΛ, and ξ∈Ds∗s∩E^tight. If s=⋁i=1nταiσβi, then s∗s=⋁i=1nτβiσβi∈ξ. Since ξ satisfy condition (∗), there exists 1≤j≤n such that τβjσβj∈ξ. Let C∈Λtight such that ξ=ηC. Then we have that βj∈C. By the definition of the action SΛ↷Λtight we have that s⋅C=ταjσβj⋅C, and hence s⋅ξ=ταjσβj⋅ξ. Thus, without lost of generality, we can assume that s=ταjσβj.
Theorem 6.4**.**
Let Λ be a countable, finitely aligned LCSC. If either Gtight(SΛ) is Hausdorff or E^∞=E^tight, then the following are equivalent:
(1)
Gtight(SΛ)* is effective.*
2. (2)
For every s∈SΛ, and for every e∈EΛ which is weakly-fixed under s, there exists a finite cover for e consisting of fixed idempotents.
3. (3)
Given α,β∈Λ with r(α)=r(β) and s(α)=s(β), if αδ⋒βδ for every δ∈s(α)Λ then there exists F∈FE(s(α)) such that αγ=βγ for every γ∈F.
Proof.
The equivalence of (1) and (2) follows from Lemma 4.9 and Corollary 4.14 and [9, Theorem 4.10, Theorem 3.16 and Theorem 4.7].
We assume (3), and we will prove that condition (iii) of [9, Theorem 4.10] holds. Let s=⋁i=1nταiσβi∈SΛ, and let ξ∈E^∞∩Ds∗s with s⋅ξ=ξ and ξ∈(Fs)∘. Let s∗s=⋁i=1nτβiσβi. From Remark 6.3, there exist C∈Λ∗∗ such that ξ=ηC, and 1≤j≤n such that ξ∈Dτβjσβj and s⋅ξ=τβjσβj⋅ξ. Now, by [9, Proposition 2.5] there exists e=⋁k=1mτγkσγk∈ξ with e≤s∗s such that ξ∈De∩E^∞⊆(Fs)∘. Since ξ satisfies condition (∗) there exists 1≤k≤m such that τγkσγk∈ξ, whence ξ∈Dτγkσγk∩E^∞⊆(Fs)∘. Then, without lost of generality, we can assume that s=τασβ, s∗s=τβσβ, ξ=ηC with C∈Λ∗∗, β∈C, and there exists γ∈C with τγσγ≤τβσβ such that ξ∈Dτγσγ⊆(Fs)∘. Then γ=βγ^ for some γ^∈Λ, and since by hypothesis τασβ⋅C=C, we have that τασβ(βγ^)=αγ^∈C . Now, by [9, Lemma 4.9], Dτγσγ⊆Fs is equivalent to τγσγ being weakly fixed under τασβ. But this means for every δ∈s(γ^)Λ we have that
[TABLE]
By hypothesis, there exists F∈FE(s(γ^)) such that αγ^δ=βγ^δ for every δ∈F. We claim that there exists δ^∈F such that αγ^δ^=βγ^δ^∈C. Indeed, since αγ^∈C, we have that E:=σαγ^⋅C∈Λ∗∗⊆Λtight, ηE∈U(τs(γ^)σs(γ^),∅) and {τδσδ:δ∈F} is a cover of U(τs(γ^)σs(γ^),∅). Since ηE is a tight filter (because E^∞⊆E^tight) there exists δ^∈F with τδ^σδ^∈ηE. Then, δ^∈E=σαγ^⋅C and hence αγ^δ^∈C, as desired.
Now, we define g:=ταγ^δ^σαγ^δ^∈EΛ. Then, 0=ταγ^δ^σαγ^δ^≤τασβ and ξ=ηC∈Dταγ^δ^σαγ^δ^. Therefore, ξ is trivially fixed by s. Thus, condition (iii) of [9, Theorem 4.10] is satisfied, and since either Gtight(SΛ) is Hausdorff or E^∞=E^tight, then condition (2) is satisfied by [9, Theorem 4.10], as desired.
Finally, let us assume (2). Let α,β∈Λ with r(α)=r(β) and s(α)=s(β) and satisfying that αδ⋒βδ for every δ∈s(α), then the idempotent e=τβσβ is weakly fixed under s:=τασβ, so by hypothesis there exists a finite cover Z of e consisting of fixed idempotents under s. Then there exists a finite set F⊆s(β)Λ such that Z={τβγσβγ}. Since the idempotents of Z are fixed under s, we have that
[TABLE]
for every γ∈F. Thus, αγ=βγ for every γ∈F.
But Z is a cover of τβσβ, and hence for every δ∈s(β)Λ there exists γ∈F such that τβδσβδ⋅τβγσβγ=0, but this means that βδ⋒βγ, and hence δ⋒γ by left-cancellation. Thus, F∈FE(s(β)), as desired.
∎
Remark 6.5**.**
Observe that if Λ has right cancellation, condition (3) in Theorem 6.4 reduces to aperiodicity as defined in [15, Definition 10.8]
If Λ is a countable, finitely aligned LCSC, then the following statements are equivalent:
(1)
Gtight(SΛ)* is minimal.*
2. (2)
For every nonzero e,f∈EΛ, there are s1,…,sn∈SΛ, such that {sifsi∗}i=1n is an outer cover for e.
3. (3)
For every α,β∈Λ there exists F∈FE(α) such that for each γ∈F, s(β)Λs(γ)=∅.
Proof.
By [9, Theorem 5.5] it is enough to prove the equivalence of conditions (2) and (3).
First, we will prove (3)⇒(2). Without lost of generality, we can assume that e=τασα and f=τβσβ. By hypothesis there exists F={γ1,…,γn}∈FE(α) such that for each i there exists δi∈s(β)Λs(γi). If we define si:=τγiσβδi for every 1≤i≤n, we have that {sifsi∗}i=1n={τγiσγi}i=1n, that is a cover for e.
(2)⇒(3). Let e=τασα and f=τβσβ. By assumption there exist s1,…,sn such that {sifsi∗}i=1n is an outer cover of e. Without lost of generality we can assume that n=1, so s:=s1=⋁i=1mτγiσδi, and hence sfs∗ is an outer cover of e. But
[TABLE]
Since Λ is finitely aligned β∨δi is finite for every 1≤i≤m, and so the set {γiσδi(εi):1≤i≤m,εi∈β∨δi}∈FE(α). Finally, observe that since εi∈β∨δi it follows that s(β)Λs(εi)=∅, but s(εi)=s(γiσδi(εi)).
∎
Then, we have the following result
Theorem 6.7**.**
Let Λ be a countable, finitely aligned LCSC. If either Gtight(SΛ) is Hausdorff or E^∞=E^tight, then the following statements are equivalent:
(1)
C∗(Λ)* is simple.*
2. (2)
For any field K, KΛ is simple.
3. (3)
The following properties hold:
(a)
Given α,β∈Λ with r(α)=r(β) and s(α)=s(β), if αδ⋒βδ for every δ∈s(α)Λ then there exists F∈FE(s(α)) such that αγ=βγ for every γ∈F.
2. (b)
For every α,β∈Λ there exists F∈FE(α) such that for each γ∈F, s(β)Λs(γ)=∅.
Proof.
By Theorem 4.16, C∗(Λ)≅C∗(Gtight(SΛ)), and for any field K, KΛ≅AK(Gtight(SΛ)). By Theorem 6.4, condition (2(a)) is equivalent to Gtight(SΛ) being effective, and by Theorem 6.6, condition (2(b)) is equivalent to Gtight(SΛ) being minimal. Then, (1)⇔(3) by [3, Theorem 5.1], while (2)⇔(3) by [18, Theorem 3.5].
∎
7. Zappa-Szép products of LCSC categories
In this section we will analyze the notion of Zappa-Szép products of LCSC categories, introduced in [2], inspired in the construction of self-similar graphs defined in [9].
Let Λ be a finitely aligned LCSC and let G be a discrete group (with unit 1G). We will use multiplicative notation for the group operation.
We say that the group G acts on Λ by permutations when
[TABLE]
For the rest of the section we will assume that G acts by permutations on Λ.
A cocyle for the action of G on Λ is a function φ:G×Λ→G satisfying the cocyle identity
[TABLE]
In particular the cocycle identity says that φ(1G,α)=1G for every α∈Λ.
Definition 7.1**.**
A map φ:G×Λ→Λ is a category cocycle if for all g∈G, v∈Λ0, and α,β∈Λ with s(α)=r(β) we have
(1)
φ(g,v)=g,
2. (2)
φ(g,α)⋅r(α)=g⋅r(α),
3. (3)
g⋅(αβ)=(g⋅α)(φ(g,α)⋅β),
4. (4)
φ(g,αβ)=φ(φ(g,α),β).
We call (Λ,G,φ) a category system.
Definition 7.2**.**
Let (Λ,G,φ) be a category system. We will denote by Λ⋊φG the small category with
[TABLE]
and r,s:Λ⋊φG→(Λ⋊φG)0 defined by
[TABLE]
Moreover for (α,g),(β,h) with s(α,g)=r(β,h) we have that
[TABLE]
We will call Λ⋊φG the Zappa-Szép product of (Λ,G,φ).
It was proved that Λ⋊φG is left cancellative whenever Λ is left cancellative [2, Proposition 3.5], and as observe in [2, Remnark 3.9] the elements of the form (v,g) where v∈Λ0 and g∈G are units of Λ⋊φG. Then given (α,g)∈Λ⋊φG and h∈G we have that
[TABLE]
so (α,g)≈(α,h).
Moreover, Λ⋊φG is finitely aligned (singly aligned) whenever Λ is finitely aligned (singly aligned) [2, Proposition 3.12]. In particular,
[TABLE]
Definition 7.3**.**
A category system (Λ,G,φ) is called pseudo free if, whenever g⋅α=α and φ(g,α)=1G, then g=1G.
Let (Λ,G,φ) be a pseudo free category system. Then, for all g1,g2∈G, and α∈Λ, one has that
[TABLE]
Remark 7.5**.**
Given a (Λ,G,φ) where Λ is a right cancellative category, it may happen that Λ⋊φG fails to satisfy right cancellation. Given (α,a),(β,b) and (γ,g) in Λ⋊φG we have that
(α,a)(γ,g)=(β,b)(γ,g) if and only if α(a⋅γ)=β(b⋅γ) and φ(a,γ)=φ(b,γ). In particular, the system is pseudo free if and only if Λ⋊φG is right cancellative.
Remark 7.6**.**
Let (Λ,G,φ), and let F={(γ1,h1),…,(γn,hn)}⊆Λ⋊φG. Then given (α,g)∈Λ⋊φG. we have that F∈FE(α,g) of Λ⋊φG if and only if {γ1,…,γn}∈FE(α) of Λ.
By the above remark the following results are a direct translation of Theorem 6.4 and 6.6.
Proposition 7.7**.**
Let (Λ,G,φ) be a category system. If either Gtight(SΛ⋊φG) is Hausdorff or E^∞=E^tight, then the following is equivalent:
(1)
Gtight(SΛ⋊φG)* is effective,*
2. (2)
Given (α,a),(β,b)∈Λ⋊φG with r(α,a)=r(β,b) and s(α,a)=s(β,b), if (α,a)(δ,d)⋒(β,b)(δ,d) for every (δ,d)∈s((α,a))(Λ⋊φG) then there exists F∈FE(s(α,a)) such that (α,a)(γ,d)=(β,b)(γ,d) for every (γ,d)∈F.
3. (3)
Given α,β∈Λ, a,b∈G with r(α)=r(b) and a−1⋅s(α)=b−1⋅s(β), if α(a⋅δ)⋒β(b⋅δ) for every δ∈(a−1⋅s(α))Λ then there exists F∈FE(a−1⋅s(α)) such that α(a⋅γ)=β(b⋅γ) and φ(a,γ)=φ(b,γ) for every γ∈F.
Proposition 7.8**.**
If (Λ,G,φ) is a category system, then the following statements are equivalent:
(1)
Gtight(SΛ⋊φG)* is minimal.*
2. (2)
For every (α,a),(β,b)∈Λ⋊φG there exists F∈FE((α,a)) such that for each (γ,g)∈F, s(β,b)(Λ⋊φG)s(γ,g)=∅.
3. (3)
For every α,β∈Λ there exists F∈FE(α) such that for each γ∈F, there exist g∈G with s(β)Λ(g⋅s(γ))=∅.
Then, by an analog argument to that of Theorem 6.7, we have the following result
Theorem 7.9**.**
Let (Λ,G,φ) be a category system such that Λ and G are countable. If either Gtight(SΛ⋊φG) is Hausdorff or E^∞=E^tight, then the following statements are equivalent:
(1)
C∗(SΛ⋊φG)* is simple.*
2. (2)
For any field K, KSΛ⋊φG is simple.
3. (3)
The following properties hold:
(a)
Given α,β∈Λ, a,b∈G with r(α)=r(b) and a−1⋅s(α)=b−1⋅s(β), if α(a⋅δ)⋒β(b⋅δ) for every δ∈(a−1⋅s(α))Λ then there exists F∈FE(a−1⋅s(α)) such that α(a⋅γ)=β(b⋅γ) and φ(a,γ)=φ(b,γ) for every γ∈F.
2. (b)
For every α,β∈Λ there exists F∈FE(α) such that for each γ∈F, there exist g∈G with s(β)Λ(g⋅s(γ))=∅.
To end this section, we will have a look on the case of Λ=E∗, where E is a countable graph. When G is a countable discrete group and E is a countable graph, there is a definition of self-similar graph extending that of [10] (see [11, Definition 2.2]). In fact, as shown in [11, Theorem 3.2], the case of arbitrary graphs can be reduced to the case of row-finite graphs with no sources or sinks up to Morita equivalence (of both algebras and groupoids); in this case, most of the properties enjoyed by the system are analog to these found in the finite case.
In order to fix the relation between Gtight(SG,E) and Gtight(SE∗⋊φG), we first need to state the relation between SG,E and SE∗⋊φG. On one side, we have
[TABLE]
On the other side,
[TABLE]
Since (x,g)∈(E∗⋊φG)−1 for all x∈E0, g∈G, we have that
[TABLE]
Moreover, since E∗ is singly aligned, then so is E∗⋊φG by [2, Proposition 3.12(ii)]. Thus, by [5, Theorem 3.2],
[TABLE]
Hence, the map
[TABLE]
is a well-defined, onto ∗-semigroup homomorphism. Let us characterize when π is injective. To this end, take (α,g,β),(γ,h,δ)∈SG,E such that
[TABLE]
Being both equal functions, they must have the same domain, i.e. (β,1G)(E∗⋊φG)=(δ,1G)(E∗⋊φG). Since (E∗⋊φG)−1=E0×G, we conclude that β=δ. Moreover, τ(α,g)=τ(γ,h) on their common domain, so that for every λ∈(g−1⋅s(α))E∗ and for every ℓ∈G we have
[TABLE]
Since the self-similar action of G on E∗ preserves lengths of paths, we conclude that α=γ, and that for every λ∈(g−1⋅s(α))E∗ we have g⋅λ=h⋅λ and φ(g,λ)=φ(h,λ). Thus, the existence of nontrivial kernel for π is equivalent to the existence of g∈G, α∈E∗ such that for all λ∈s(α)E∗ satisfies g⋅λ=λ and φ(g,λ)=1G; in other words, injectivity of π is equivalent to the fact that the self-similar action of G on E∗ is faithful on vertex-based trees of E. Notice that if (E,G,φ) is pseudo free, then the above condition is trivially fulfilled, so that π will be an isomorphism in this case. Moreover, being E∗⋊φG singly aligned, we have that it is right cancellative exactly when (E,G,φ) is pseudo free. In this case, not only SG,E≅SE∗⋊φG, but also they are weak semilattices by Proposition 4.11, so that their associated tight groupoids are Hausdorff by Corollary 4.14.
Now, we proceed to look at the relation between the corresponding tight groupoids Gtight(SG,E) and Gtight(SE∗⋊φG). First, notice that the idempotent semilattices of SE, SG,E and SE∗⋊φG coincide, so that the spaces of filters, ultrafilters and tight filters are the same (up to natural isomorphism). Additionally, the partial actions SG,E↷E^0 and SE∗⋊φG↷E^0 are π-equivariant; also, the germ relation is compatible with π. Thus, π induces a continuous, open, onto groupoid homomorphism
[TABLE]
Using the Morita equivalence reduction [11, Theorem 3.2], we can assume that E is row-finite with no sources or sinks, whence E^∞=E^tight=E∞; let us reduce to this case, in order to simplify the computations. We now will show that Φ is injective. To this end, let [α,g,β;η]∈kerΦ. This means that τ(α,g)σ(β,1G) is an idempotent. According to the computations done before, this happens exactly when α=β and for every λ∈s(α)E∗ we have that g⋅λ=λ and φ(g,λ)=1G. Pick λ any initial segment in η∈E∞. Notice that λ∈s(α)E∗, and thus (αλ,1G,αλ)∈αη (seen as a filter), while
[TABLE]
Hence, by the germ relation, if η=λη^, then
[TABLE]
Thus, Φ is a homeomorphism and an isomorphism of groupoids. This guarantees that, independently of the choice for representing the self-similar graph system (G,E,φ), their associated tight groupoids -and hence their algebras- are the same.
8. Amenability
Now we are going to study a case where we can deduce amenability of Gtight(SΛ⋊φG) assuming that Gtight(SΛ) and G are amenable. Let Λ be a finitely aligned LCSC, and let Γ be a subsemigroup of a group Q.
Let Γ be a semigroup with unit element 1Q. A Γ-graph is a LCSC Λ together with a map, called the degree map, d:Λ→Γ, such that:
(1)
d(αβ)=d(α)d(β) for every α,β∈Λ with s(α)=r(β),
2. (2)
for every α∈Λ and γ1,γ2∈Γ with d(α)=γ1γ2, there are unique α1,α2∈Λ with s(α1)=r(α2), d(αi)=γi for i=1,2, such that α=α1α2 (unique factorization property).
Observe that if Λ is a Γ-graph, the unique factorization property implies that Λ is right and left cancellative category, and does not have inverses.
Given two elements γ1,γ2∈Γ
[TABLE]
Lemma 8.2**.**
Let Λ be a Γ-graph. Let α,β∈Λ with α⋒β. Then α≤β if and only if d(α)≤d(β). In particular α=β whenever d(α)=d(β).
Proof.
Let α,β∈Λ, and let ε∈α∨β, so there are δ,η∈Λ such that ε=αδ=βη.
Assume that d(α)≤d(β). So by the unique factorization property there exists γ,γ′∈Λ such that γγ′=β and d(γ)=d(α). But then
[TABLE]
Thus, by the unique factorization property α=γ, and hence α≤β, as desired.
Finally, if d(α)=d(β) then α≤β and β≤α. But since Λ has no inverses, it follows that α=β.
∎
Definition 8.3**.**
Let (Λ,G,φ) be a category system, where Λ is a Γ-graph. We say that Γ is compatible with respect to (Λ,G,φ), if d(g⋅α)=d(α) for every g∈G and α∈Λ (G-invariant).
Let Λ be a Γ-graph compatible with respect to (Λ,G,φ). Observe that since τ(α,g)σ(α,g)=τ(α,1G)σ(α,1G) for every (α,g)∈Λ⋊φG,
the set of idempotents EΛ=EΛ⋊φG coincide, and hence so does their spaces of tight filters. We will denote by E^tight the space of tight filters of EΛ and EΛ⋊φG. By Lemma 4.3,
[TABLE]
and
[TABLE]
[TABLE]
Then, we will think of Gtight(SΛ) as an open subgroupoid of Gtight(SΛ⋊φG) via the map [τασβ,ξ]↦[τ(α,1G)σ(β,1G),ξ].
The following remark is going to be used repeatedly during the rest of the paper sometimes without mention it.
Remark 8.4**.**
Let (α,a),(β,b)∈Λ⋊φG, and suppose that (α,a)≤(β,b), then there exists (δ,d)∈Λ⋊φG with r(δ,d)=s(α,a), that is, r(δ)=a−1⋅s(α) such that
[TABLE]
Whence α(a⋅δ)=β and b=φ(a,δ)d. Hence, a⋅δ=σα(β) by left cancellation, so δ=a−1⋅σα(β) and d=φ(a,a−1⋅σα(β))−1b=φ(a−1,σα(β))b because of the cocycle identity. Therefore,
(α,a)≤(β,b) if and only if α≤β, and then we have that
[TABLE]
Lemma 8.5**.**
Let Λ be a Γ-graph compatible with respect to (Λ,G,φ), then the map
[TABLE]
is a well defined continuous groupoid homomorphism. In particular, d restricts to Gtight(SΛ).
Proof.
First we will prove that d is well defined. Let [s,ξ]=[t,ξ] in Gtight(SΛ⋊φG), that is, there exists f∈ξ such that sf=tf. Without lost of generality we can assume that s=τ(α,a)σ(β,b), t=τ(δ,d)σ(η,c), and f=τ(γ,1G)σ(γ,1G) with α,β,γ∈Δξ such that α,β≤γ. Then, by Remark 8.4, we have that
[TABLE]
and
[TABLE]
But sf=tf, so then
[TABLE]
Therefore, by the G-invariance of d we have that
[TABLE]
is equal to
[TABLE]
Hence, d([τασβ,ξ])=d(α)d(β)−1=d(δ)d(η)−1=d([τδση,ξ]), so d is well-defined.
Now, let [s,ξ],[t,ξ′]∈Gtight(SΛ⋊φG) such that ξ=t⋅ξ′. If s=τ(α,a)σ(β,b) and t=τ(δ,d)σ(η,c), then
[s,ξ]⋅[t,ξ′]=[st,ξ′]. Observe that, since β,δ∈Δξ, by Lemma 8.2 there exists only one element ε∈(β∨δ)∩Δξ. We define f=τ(ε,1G)σ(ε,1G). We have that ξ=t⋅ξ′, that means
[TABLE]
But ε∈Δξ, that is ε≤δ(dc−1⋅ν) for some ην∈Δξ′, and hence
[TABLE]
As d(δ)≤d(ε), we have d(δ)≤d(ε)≤d(δ)d(ν).
Therefore, there exists g,h∈Γ such that d(ε)=d(δ)g and gh=d(ν). Now, by the unique factorization, there exist unique elements ν1,ν2∈Λ such that ν1ν2=ν and d(ν1)=g and d(ν2)=h. But ην1∈Δξ′, so t(ην1)=δ(dc−1⋅ν1), and d(δ(dc−1⋅ν1))=d(δ)g=d(ε). Hence by Lemma 8.2 we have that ε=δ(dc−1⋅ν1).
Then ft=t⋅τ(ην1,1G)σ(ην1,1G), so [s,ξ]=[sf,ξ] and [t,ξ′]=[ft,ξ′]. So, we can assume that β=δ, and hence d([s,ξ])=d(α)d(β)−1 and d([t,ξ′])=d(β)d(η)−1. Thus,
[TABLE]
Therefore,
[TABLE]
Thus, d is a morphism of groupoids.
Finally, given g∈Γ, we have that
[TABLE]
that is an open. Thus, d is continuous.
∎
Let d:Gtight(SΛ⋊φG)→Γ be the cocycle defined in Lemma 8.5, and let us define
[TABLE]
It is an open subgroupoid of Gtight(SΛ⋊φG).
Now in order to be able to decompose the groupoid HΛ⋊φG as a union of more treatable groupoids, we need to impose some conditions on the semigroup Γ.
Definition 8.6**.**
Let Γ⊆Q be a subsemigroup of a group Q with Γ∩Γ−1=1Q. We say that Γ is a join-semilattice if given g1,g2∈Γ
[TABLE]
exists an it is unique. We will denote it by g1∨g2.
We now assume that Γ is a join-semilattice. Then, given g∈Γ, we define
[TABLE]
We claim that HΛ⋊φG(g) is an open subgroupoid of HΛ⋊φG. Let [τ(α,a)σ(β,b),ξ],[τ(δ,d)σ(η,c),ξ′]∈HΛ⋊φG(g) two composable elements with g1:=d(β)=d(α)≤g and g2:=d(δ)=d(η)≤g. Since β,δ∈Δξ we have that there exists ε∈(β∨δ)∩Δξ, and g1,g2≤d(ε). Since Γ is a join-semilattice we have that g1∨g2≤d(ε). Then by the unique factorization property there exists ε1,ε2∈Λ with d(ε1)=g1∨g2 and ε=ε1ε2. Then ε1∈Δξ and hence by Lemma
8.2 we have that β,δ≤ε1. Then as shown in the proof of Lemma 8.5 we can find elements [τ(α′,a′)σ(ε,b′),ξ],[τ(ε,d′)σ(η′,c′),ξ′]∈HΛ⋊φG with [τ(α,a)σ(β,b),ξ]=[τ(α′,a′)σ(ε,b′),ξ] and [τ(δ,d)σ(η,c),ξ′]=[τ(ε,d′)σ(η′,c′),ξ′], and the product
[TABLE]
Therefore, HΛ⋊φG(g1∨g2)⊆HΛ⋊φG(g), as desired.
Moreover, as a consequence of the above computation, given g1,g2≤g we have that HΛ⋊φG(g1)HΛ⋊φG(g2)⊆HΛ⋊φG(g). Then, if Γ is countable, there exists an ascending sequence of elements g1,g2,…∈Γ such that for every g∈Γ there exists n∈N with g≤gn. Whence, HΛ⋊φG=⋃i=1∞HΛ⋊φG(gi).
The next step will be to define a cocycle of the groupoids HΛ⋊φG(g) onto G. In order to do that we will need to make the following assumption in the Γ-graph Λ.
Definition 8.7**.**
Let Λ be a Γ-graph. Then Λ satisfies property (★) if given F∈Δtight and g∈Γ, then there exists a unique β∈F with d(β)≤g such that whenever α∈F satisfies d(α)≤g, we have that α≤β.
We can give some condition on Γ to guarantee that every Γ-graph satisfies condition (★).
Proposition 8.8**.**
Let Λ be a Γ-graph, and assume every bounded ascending sequence of elements of Γ stabilizes. Then Λ satisfies property (★).
Proof.
We define Fg:={β∈F:d(β)≤g}. Observe that given α,β∈Fg with d(β)≤d(α), then d(α∨β)=d(α)∨d(β)=d(α)≤g, hence α∨β∈Fg, and the unique factorization property says that α=α∨β, and hence β≤α. So it is enough to prove that there exists α∈Fg such that d(β)≤d(α) for every β∈Fg.
Let α0∈F, and let β∈Fd with d(β)≰d(α0). If such β does not exists, then we are done. Otherwise, d(α0∨β)=d(α0)∨d(β)≤g, and hence α0∨β∈Fg, with d(α0)<d(α0∨β), because if d(α0)=d(α0∨β) then α0=α0∨β by Lemma 8.2. Let us define α1:=α0∨β, so
d(α0)<d(α1). Now if in this way we could construct an infinite sequence α0,α1,α2,…∈Fg such that \d(αi)<d(αi+1), then this will contradict the hypothesis. Then will be n such that d(β)≤d(αn) for every β∈Fg, and so α:=αn, and we are done.
∎
Example 8.9**.**
Every Nk-graph Λ satisfies property (★).
Now we are ready to define the promised cocyle.
Proposition 8.10**.**
Let Λ be a Γ-graph compatible with respect to a pseudo free system (Λ,G,φ), and suppose that Λ satisfies property (★). Then for every g∈Γ there exists a continuous groupoid homomorphism
[TABLE]
Proof.
Let [s,ξ]∈HΛ⋊φG(g). By property (★) there exists β∈Δξ such that δ≤β for every δ∈Δξ with d(δ)≤g. If we define f=τ(β,e)σ(β,e), then we have that [s,ξ]=[sf,ξ] whenever s=τ(α,a)σ(δ,b) with d(δ)≤g, and
[TABLE]
Thus, without lost of generality, any element [s,ξ]∈HΛ⋊φG(g) has a representative of the form [τ(α,a)σ(β,b),ξ], where β is the unique maximal element in Δξ satisfying d(β)≤g given by property (★).
Under this choice of representative, we define t(g):HΛ⋊φG(g)→G by the rule
[TABLE]
Let us check that t(g) is well defined. To this end, let [s,ξ] and [s′,ξ] in HΛ⋊φG(g) with [s,ξ]=[s′,ξ]. By the above argument, we can assume that s=τ(α,a)σ(β,b) and s′=τ(α′,a′)σ(β,b′).
Let h=τ(ββ′,1G)σ(ββ′,1G) for some β′ such that ββ′∈Δξ and sh=s′h. Then,
[TABLE]
Therefore we have that
[TABLE]
and by left cancellation we have that
[TABLE]
Hence, by Proposition 7.4, ab−1=a′b′−1. Thus, t(g) is well-defined.
Now, given a composable pair [s,ξ],[t,ξ′], we can choose representatives s=[τ(α,a)σ(β,b),ξ] and t=[τ(γ,c)σ(β′,b′),ξ′] with β,β′ unique maximal elements in Δξ,Δξ′ (respectively) satisfying d(β),d(β′)≤g given by property (★). Since ξ=t⋅ξ′, we have that γ∈Δξ, whence γ=β∨γ by property (★). Thus, the computation performed in Lemma 8.5 do not require replace β by any element δ with d(δ)>g, and thus this argument shows that t(g) is a continuous groupoid homomorphism.
∎
Proposition 8.11**.**
Let Λ be a Γ-graph compatible with respect to a pseudo free system (Λ,G,φ), and suppose that Λ satisfies property (★), with G and Q countable amenable groups. Moreover, assume that Γ is a join-semilattice. If the kernel of the map d:Gtight(SΛ)→Q is amenable, then Gtight(SΛ⋊φG) is amenable.
Proof.
By [13, Corollary 4.5] it is enough to prove that HΛ⋊φG is an amenable groupoid. As observe above HΛ⋊φG=⋃n=1∞HΛ⋊φG(gn) where HΛ⋊φG(gn) are open subgroupoids with HΛ⋊φG(gn)⊆HΛ⋊φG(gn+1) and (HΛ⋊φG(gn))(0)=(HΛ⋊φG(gn+1))(0). Then by [1, Section 5.2(c)] it is enough to prove that the groupoids HΛ⋊φG(gn) are amenable for every n. But now
[TABLE]
Therefore since (d)−1(1Q) is amenable by assumption, then (t(gn))−1(1G) is amenable. So using again [13, Corollary 4.5] we have that HΛ⋊φG(gn) is amenable, as desired.
∎
Next step will prove to prove that the kernel of the map d:Gtight(SΛ)→Q is amenable. In order to do that we will prove that the groupoid Gtight(SΛ) is isomorphic to the semigroup action groupoid of the Γ-graph Λ defined in [13, Section 5]. This semigroup action groupoid has also a canonical cocyle c onto Q which kernel is amenable. Now we will prove that the kernel of c is isomorphic to the kernel of d. First we introduce the semigroup action groupoid.
Definition 8.12**.**
Let X be a set and Γ⊆Q be a semigroup of a group Q containing the identity 1Q. A left action of Γ on X consists of a subset Γ⋆X of Γ×X and a map T:Γ⋆X→X sending (g,x)↦g⋅x, such that:
(1)
for all x∈X, (e,x)∈Γ⋆X and e⋅x=x;
2. (2)
for all (g,h,x)∈Γ×Γ×X, (gh,x)∈Γ⋆X if and only if (h,x)∈Γ⋆X and (g,h⋅x)∈Γ⋆X, if this holds, g⋅(h⋅x)=(gh)⋅x.
For all g∈Γ, we define U(g):={x:(g,x)∈Γ⋆X} and V(g)={g⋅x:(g,x)∈Γ⋆X} and Tg:U(g)→V(g) the map such that Tg(x)=g⋅x. The triple (X,Γ,T) is called a semigroup action.
Definition 8.13**.**
A semigroup action (X,Γ,T) is called directed if for all g,h∈Γ such that U(g)∩U(h)=∅ there exists r∈Γ with g,h≤r such that U(g)∩U(h)=U(r).
When (X,Γ,T) is a directed semigroup action it is defined the groupoid
[TABLE]
Let X be a locally compact Hausdorff space such that U(g) and V(g) are open subsets of X for every g∈Γ, and Tg:U(g)→V(g) is a local homeomorphism.
Given g,h∈Γ, A,B subsets of X, we define
[TABLE]
The family B of subsets Z(A,g,h,B), with A⊆U(g) and B⊆U(h) open subsets, such that (Tg)∣A and (Th)∣B are injective, and Tg(A)=Th(B), forms a basis for the topology of G(X,Γ,T). With this topology G(X,Γ,T) is a locally compact étale groupoid.
Now recall by Lemma 8.2, that given g∈Γ and F∈Δ∗, F∩d−1(g) is either empty or contains just one element. Then we can define the following.
Definition 8.14**.**
Let Λ be a Γ-graph. Then
[TABLE]
and given (g,ξ)∈Γ⋆E^tight, we define Tg(ξ)=σα⋅ξ, where α∈Δξ with d(α)=g.
[TABLE]
Let Λ be a Γ-graph with Γ a join-semilattice, because of the factorization property we have that d(α∨β)=d(α)∨d(β), and hence
[TABLE]
Thus, the semigroup action (E^tight,Γ,T) is directed.
Proposition 8.15**.**
Let Λ be a Γ-graph with Γ being join-semilattice. Then the map
[TABLE]
is an isomorphism of topological groupoids.
Proof.
First observe that Φ is well-defined because of Lemma 8.5, and it is then clearly a groupoid homomorphism. That Φ is a bijection follows from the definition of the inverse Φ−1:G(E^tight,Γ,T)→Φ:Gtight(SΛ) by Φ−1(ξ,gh−1,ξ′)=[τασβ,ξ], where β is the unique element in Δξ with d(β)=h and α is the unique element in Δξ′ with d(α)=g given by Lemma 8.2.
Now observe that the sets of the form Z(τασβ(Dτβσβ),g,h,Dτβσβ) for g,h∈Γ, β∈d−1(h) and α∈d−1(g)∩Λs(β) forms a basis for the topology of G(E^tight,Γ,T). But Φ−1(Z(τασβ(Dτβσβ),g,h,Dτβσβ))=[τασβ,Dτβσβ], thus Φ is continuous and also open.
∎
Given a directed semigroup action (X,Γ,T), there exists a natural groupoid homomorphism c:G(E^tight,Γ,T)→Γ defined by c(x,gh−1,yu)=gh−1 [13, Proposition 5.12], and it is clear that Φ intertwines c and d, that is, c∘Φ=d. Therefore c−1(1Q) and d−1(1Q) are isomorphic as topological groupoids. But in the proof of [13, Theorem 5.13] it is proved that c−1(1Q) is amenable, whence d−1(1Q) is amenable too.
Theorem 8.16**.**
Let Λ be a Γ-graph compatible with respect to a pseudo free system (Λ,G,φ), and suppose that Λ satisfies property (★), with G and Q countable amenable groups. Moreover, assume that Γ is a join-semilattice. Then Gtight(SΛ⋊φG) is amenable.
Acknowledgments
Part of this work was done during visits of the second author to the Institutt for Matematiske Fag, Norges Teknisk-Naturvitenskapelige Universitet (Trondheim, Norway), and during an stage of both authors to the ICMAT (Universidad Autónoma de Madrid, Spain) as part of the Thematic Research Program: Operator Algebras, Groups and Applications to Quantum Information in 2019, and the work was significantly supported by the research environment and facilities provided there. Both authors thank the centers for their kind hospitality.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] C. Anantharaman-Delaroche, J. Renault, Amenable groupoids. , Monographies de L’Enseignement Mathématique [Monographs of L’Enseignement Mathématique], 36. L’Enseignement Mathématique, Geneva, 2000. 196 pp. ISBN: 2-940264-01-5
2[2] E. Bédos, S. Kaliszewski, J. Quigg and J. Spielberg, On finitely aligned left cancellative small categories, Zappa-Szép products and Exel-Pardo algebras , Theor. Appl. Categ. 33 (2018), Paper no. 42, 1346–1406.
3[3] J.H. Brown, L.O. Clark, C. Farthing and A. Sims, Simplicity of algebras associated to étale groupoids , Semigroup Forum 88 (2014), 433–452.
4[4] N. Brownlowe, D. Pask, J. Ramagge, D. Robertson, M.F. Whittaker, Zappa-Szép product groupoids and C ∗ superscript 𝐶 C^{*} -blends , Semigroup Forum 94 (2017), 500–519.
5[5] A.P. Donsig, J. Gensler, H. King, D. Milan and R. Wdowinski, On zigzag maps and the path category of an inverse semigroup . ar Xi V:1811.04124 v 1.
6[6] A.P. Donsig and D. Milan, Joins and covers in inverse semigroups and tight C ∗ superscript 𝐶 C^{*} -algebras , Bull. Aust. Math. Soc. 90 (2014), no. 1, 121–133.
7[7] R. Exel, Inverse semigroup and combinatorial C ∗ superscript 𝐶 C^{*} -algebras , Bull. Braz. Math. Soc. 39 (2) (2008), 191–313.
8[8] R. Exel, Tight and cover-to-joint representations of semilattices and inverse semigroups , ar Xiv:1903.02911 v 1.