Boolean inverse semigroups and their type monoids

From MaRDI portal





The paper focuses on two main aspects: First, an introduction to techniques for studying (fundamental, simple, semisimple, finite) Boolean inverse semigroups; second, the study of the type monoid of a Boolean inverse semigroup. A \textit{Boolean inverse semigroup} is an inverse semigroup \(S\) with zero such that \((E(S), \leq)\) is a generalized Boolean algebra (i.e. a relatively complemented distributive lattice) and any two elements \(a, b\in S\) have a join \(a\vee b\) in \(S\) provided that \(a^{-1}b\) and \(ab^{-1}\) are idempotents. Let \(S\) be a Boolean inverse semigroup and Int\((S):= E(S)/\mathcal{D}\vert_{E(S)}\). \(\mathrm{Int}(S)\) can be equipped with a partial operation \(\oplus\) by \([e]\oplus[f]= [e'\oplus f']\), where \(e'\in[e]\) and \(f'\in[f]\) are such that \(e'\perp f'\). The \textit{type monoid} \(\mathrm{Typ}(S)\) of \(S\) is defined as the commutative monoid freely generated by the set \(\{\overline{e}: [e]\in\mathrm{Int}(S)\}\).\N\NA direct proof is presented that \(\mathrm{Typ}(S)\) is isomorphic to the type monoid \(\mathrm{Typ}(M_{\omega}(S))\) = \(\mathrm{Int}(M_{\omega}(S))\) of the Boolean inverse semigroup \(M_{\omega}(S)\) of generalized rook matrices over \(S\) (that is, matrices over \(S\) with rows and columns indexed by \(\mathbb{N}\), which have only finitely many non-zero entries satisfying certain additional conditions).\N\NThe canonical map from \(\mathrm{Typ}(S)\) to the monoid associated with the Steinberg algebra \(K\langle S\rangle\) is presented and the authors prove that if \(S\) is locally matricial (it is a finite direct product of finite symmetric inverse monoids), then this map is an isomorphism.\N\NLet now \(I(\Gamma)\) be a graph inverse semigroup assigned to a row-finite graph \(\Gamma\) (each vertex in \(\Gamma\) emits only a finite number of edges) and \(M_{\Gamma}\) the abelian monoid given by the generators \(\{a_v: v\in \Gamma_0\}\) with certain defining relations. It is proved that \(\mathrm{Typ}(\mathcal{B}_{\mathrm{tight}}(I(\Gamma)))\) is canonically isomorphic to the graph monoid \(M_{\Gamma}\), where \(\mathcal{B}_{\mathrm{tight}}(I(\Gamma))\) is the tight Booleanization of \(I(\Gamma)\).\N\NFor the entire collection see [Zbl 1566.16001].



Cites work









This page was built for publication: Boolean inverse semigroups and their type monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890359)