Congruence networks for strong semilattices of regular simple semigroups (Q1328244)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Congruence networks for strong semilattices of regular simple semigroups
scientific article

    Statements

    Congruence networks for strong semilattices of regular simple semigroups (English)
    0 references
    0 references
    7 March 1995
    0 references
    Let \({\mathcal C}(S)\) denote the congruence lattice of a given semigroup \(S\). If for any equivalence relation \(\mathcal R\) on \({\mathcal C}(S)\) every \(\mathcal R\)- class has greatest and least elements, there are two operations on \({\mathcal C}(S)\): \(R\) and \(r\), where \(\rho R\) and \(\rho r\) are the greatest and the least elements \(\mathcal R\)-related to \(\rho\), respectively. If \(S\) is a regular semigroup, then there are two such equivalence relations \(\mathcal K\) and \(\mathcal T\): \(\lambda {\mathcal K} \rho \Leftrightarrow \text{ker }\lambda = \text{ker }\rho\), \(\lambda{\mathcal T}\rho \Leftrightarrow \text{tr }\lambda = \text{tr }\rho\) and four corresponding operations \(K\), \(k\), \(T\), \(t\). If \(S\) is a strong semilattice \(Y\) of regular simple semigroups \(S_ \alpha\), \(\alpha \in Y\), with structure homomorphisms \(\varphi_{\alpha \beta} : S_ \alpha \to S_ \beta\), \(\alpha \geq \beta\), then every congruence relation \(\rho\) is uniquely determined by the pair \((\xi, (\rho_ \alpha)_{\alpha \in Y})\), where \(\xi \in {\mathcal C}(Y)\) and \(\rho_ \alpha \in {\mathcal C}(S_ \alpha)\). This correspondence is one- to-one, and \(\xi = \text{gl }\rho\), \((\rho_ \alpha) _{\alpha \in Y} = \text{loc }\rho\). So there are two equivalence relations on \({\mathcal C}(S)\) \(\mathcal G\) and \(\mathcal L\): \(\lambda {\mathcal G} \rho \Leftrightarrow \text{gl }\lambda = \text{gl }\rho\), \(\lambda {\mathcal L} \rho \Leftrightarrow \text{loc }\lambda = \text{loc }\rho\), and four corresponding operators: \(L\), \(l\), \(G\), \(g\). Let \(\Lambda = \{K,k,T,t\}\) and \(A = \{G,g,L,l\}\). The author is interested in the semigroups \(A^*\) and \(\Gamma^*\) generated by \(A\) and \(\Gamma\) respectively. The sets \(\rho A^*\) and \(\rho \Gamma^*\) of congruences are called the networks of \(\rho\). Results: The semigroup \(A^*\) is represented by means of generators and relations and networks \(\rho A^*\) are characterized, the values of \(k\) and \(t\) are computed, and the values of \(T\) and \(K\) are computed in the case when \(S\) is a normal cryptogroup (a normal band of groups).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    congruence lattices
    0 references
    equivalence relations
    0 references
    regular semigroups
    0 references
    strong semilattices
    0 references
    regular simple semigroups
    0 references
    networks
    0 references
    generators and relations
    0 references
    normal cryptogroups
    0 references
    normal band of groups
    0 references
    0 references