Normal submonoids and congruences on a monoid
Abstract
A notion of {\em normal submonoid} of a monoid is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set of normal submonoids of is a complete lattice. Joins are explicitly described, and the lattice is computed for the finite full transformation monoids , . It is also shown that is modular for a specific family of commutative monoids, including all Krull monoids, and that, as a join semilattice, embeds isomorphically onto a join subsemilattice of the lattice of congruences on . This leads to a new strategy for computing consisting of computing , and the lattices of the so called unital congruences on the quotients of modulo its normal submonoids. This provides a new perspective on Malcev computation of the congruences on .
Keywords
Cite
@article{arxiv.2210.08546,
title = {Normal submonoids and congruences on a monoid},
author = {Josep Elgueta},
journal= {arXiv preprint arXiv:2210.08546},
year = {2024}
}
Comments
23 pages