Normal submonoids and congruences on a monoid
Abstract
A notion of normal submonoid of a monoid M is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set NorSub(M) of normal submonoids of M is a complete lattice. Joins are explicitly described, and the lattice is computed for the finite full transformation monoids Tn, n≥ 1. It is also shown that NorSub(M) 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 Cong(M) of congruences on M. This leads to a new strategy for computing Cong(M) consisting of computing NorSub(M), and the lattices of the so called unital congruences on the quotients of M modulo its normal submonoids. This provides a new perspective on Malcev computation of the congruences on Tn.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.