On an order based construction of a groupoid from an inverse semigroup

Mathematics – Operator Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages

Scientific paper

We present a construction, which assigns two groupoids, $\Gugamma$ and $\Gmgamma$, to an inverse semigroup $\Gamma$. By definition, $\Gmgamma$ is a subgroupoid (even a reduction) of $\Gugamma$. The construction unifies known constructions for groupoids. More precisely, the groupoid $\Gugamma$ is shown to be isomorphic to the universal groupoid of $\Gamma$ introduced by Paterson. For $\Gamma$ arising from graphs resp. tilings, the groupoid $\Gmgamma$ is the graph groupoid introduced by Kumjian et al. resp. the tiling groupoid introduced by Kellendonk. We obtain a characterisation of open invariant sets in $\Gmgamma^{(0)}$ in terms of certain order ideals of $\Gammanull$ for a large class of $\Gamma$ (including those arising from graphs and from tilings). If $\Gmgamma$ is essentially principal this gives a characterization of the ideal structure of $\Cred(\Gmgamma)$ by a theory of Renault. In particular, we then obtain necessary and sufficient conditions on $\Gamma$ for simplicity of $\Cred(\Gmgamma)$. Our approach relies on a detailed analysis of the order structure of $\Gamma$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On an order based construction of a groupoid from an inverse semigroup does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On an order based construction of a groupoid from an inverse semigroup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On an order based construction of a groupoid from an inverse semigroup will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-418802

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.