Abstract
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower $t$ and lower $k$. Three classes of completely regular semigroups, namely semigroups for which $\text{ker}\sigma$ is a cryptogroup, semigroups for which $\text{ker}\nu$ is a cryptogroup and semigroups for which $\kappa$ is over rectangular bands, are studied. $((\omega_t)_k)_t$, $((\mathcal{D}_t)_k)_t$ and $((\omega_k)_t)_k$ are found to be the least congruences on $S$ such that the quotient semigroups are semigroups for which $\text{ker}\sigma$ is a cryptogroup, $\text{ker}\nu$ is a cryptogroup and $\kappa$ is over rectangular bands, respectively. The results obtained present a response to three problems in Petrich and Reilly’s textbook “Completely Regular Semigroups”.
Introduction
In the theory of semigroups, a completely regular semigroup is defined as a semigroup that is a union of its subgroups. These structures are of significant interest due to their rich algebraic properties and their decomposition into simpler components. A primary tool for investigating the structure of a completely regular semigroup $S$ is the study of its congruence lattice, denoted by $\mathcal{C}(S)$. Congruences are equivalence relations that respect the semigroup operation, allowing for the construction of quotient semigroups that simplify the original structure while preserving essential algebraic properties.
The Kernel-Trace Framework
The "kernel-trace" approach is a powerful methodology for analyzing congruences on completely regular semigroups. Every congruence $\rho$ on $S$ is uniquely determined by its kernel ($\text{ker}\rho$, the set of elements related to some idempotent) and its trace ($\text{tr}\rho$, the restriction of $\rho$ to the set of idempotents $E(S)$).
Two fundamental operators are defined on the congruence lattice to navigate this structure:
- Lower $k$ operator ($\rho \mapsto \rho_k$): The smallest congruence having the same kernel as $\rho$.
- Lower $t$ operator ($\rho \mapsto \rho_t$): The smallest congruence having the same trace as $\rho$.
By starting with the universal relation $\omega$ (where all elements are related) and iteratively applying these operators, researchers can map out a "min-network" of congruences corresponding to various important classes of semigroups, such as groups, bands, and Clifford semigroups.
The Min-Network of Congruences
The relationships between these congruences and the resulting semigroup classes are visualized through a Hasse diagram of the congruence lattice. Figure 1 illustrates a portion of this min-network, showing how operators like $\omega_t$ (the least group congruence $\sigma$) and $\omega_k$ (the least band congruence $\beta$) serve as starting points for further structural refinement.
Main Results: Solving the Petrich-Reilly Problems
The primary contribution of this work is the identification of the "least congruences" for three specific classes of semigroups that were previously uncharacterized. These results provide definitive solutions to Problems VII.3.13 (i), (ii), and (iii) in the classic textbook by Petrich and Reilly (1999).
1. Semigroups where $\text{ker}\sigma$ is a cryptogroup
A semigroup is a cryptogroup if Green's relation $\mathcal{H}$ is a congruence. The authors demonstrate that the least congruence for the class where the kernel of the least group congruence $\sigma$ is a cryptogroup is obtained by the sequence $((\omega_t)_k)_t$.
2. Semigroups where $\text{ker}\nu$ is a cryptogroup
For the class where the kernel of the least Clifford congruence $\nu$ is a cryptogroup, the least congruence is identified as $((\mathcal{D}_t)_k)_t$. This characterization bridges the gap between Clifford semigroups and more complex cryptic structures.
3. Semigroups where $\kappa$ is over rectangular bands
The relation $\kappa$ is a specific congruence related to the kernel-trace decomposition. The least congruence for the class where $\kappa$ is over rectangular bands is found to be $((\omega_k)_t)_k$.
Conclusion
This research completes a significant portion of the map of the congruence lattice for completely regular semigroups. By resolving long-standing problems from the literature, it reinforces the utility of the kernel-trace approach and provides a foundation for future studies into more granular classifications of semigroups. The predictable symmetry found in the min-network suggests that similar iterated operator techniques might eventually be extended to the broader and more challenging class of regular semigroups.
Summary updated