Inverse monoids and rational subsets of related groups (Q1206788)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inverse monoids and rational subsets of related groups |
scientific article |
Statements
Inverse monoids and rational subsets of related groups (English)
0 references
1 April 1993
0 references
For a monoid \(S\), the family of rational subsets of \(S\), \(\text{Rat}(S)\), is the least subset of the power set of \(S\), \(P(S)\), containing the empty set and \(\{s\}\) for each \(s \in S\), which is closed under finite unions, set products and submonoid generation (denoted by \(*\)). For a set \(X\) and relations \(T\) on \((X\cup X^{-1})^*\), we say that the inverse monoid \(M\) is presented by the generators \(X\) and the relations \(T\), if \(M = (X \cup X^{-1})^* / \tau\), where \(\tau\) is the congruence generated by \(T \cup S\), and \(S\) is the Wagner congruence. We shall denote \(M\) by \(\text{Inv}\langle X \mid T\rangle\). We shall also denote a group given by the generators \(X\) and relations \(T\) by \(\text{Gp}\langle X \mid T\rangle\). We note the following relationship between \(\text{Inv}\langle X \mid T\rangle\) and \(\text{Gp}\langle X\mid T\rangle\): The maximal group homomorphic image of \(M = \text{Inv}\langle X \mid T\rangle\) is the group \(G = \text{Gp}\langle X \mid T\rangle\). Let \(G\) be a group and let \(\text{Gen}(G)=\{g_ k\}_{k \in K}\) be a set of generators of \(G\). A generator sequence is an element of the free involutory monoid over \(\text{Gen}(G)\), and we denote such a sequence by \(s = (s_ 1, s_ 2, \dots, s_ p)\). We denote the set of all the generator sequences by \(S\) and we recall that \(S\) is equipped with an associative multiplication defined by concatenation, and a group-like involution. The natural extension of the inclusion map from \(\text{Gen}(G)\) into \(G\) is denoted by \([S]\); so for \(s = (s_ 1, s_ 2, \dots, s_ p) \in S\) \([s] = s_ 1 s_ 2 \dots s_ p\). The prefix sequence of \(s\) is the set \(p(s) = \{1,s_ 1,s_ 1s_ 2,s_ 1 s_ 2s_ 3,\dots,s_ 1s_ 2 \dots s_{p - 1},[s]\}\). We now define a map from \(S\) to \(P(G) \times G\) by \(s \mapsto (p(s)N, [s])\), and we denote the image of this map by \(R(G,N)\). Theorem 2.2. \(R(G,N)\) is an \(E\)-unitary inverse monoid with the maximal group homomorphic image \(G\). Moreover \(R(G,N)\) is generated, as an inverse monoid, by the elements \((p(g)N,g)\), where \(g \in \text{Gen}(G)\).
0 references
generators and relations
0 references
rational subsets
0 references
inverse monoids
0 references
congruences
0 references
generator sequences
0 references
free involutory monoids
0 references
prefix sequences
0 references
\(E\)- unitary inverse monoids
0 references