Cancellable elements of the lattice of monoid varieties
Abstract
The set of all cancellable elements of the lattice of semigroup varieties has recently been shown to be countably infinite. But the description of all cancellable elements of the lattice MON of monoid varieties remains unknown. This problem is addressed in the present article. The first example of a monoid variety with modular but non-distributive subvariety lattice is first exhibited. Then a necessary condition of the modularity of an element in MON is established. These results play a crucial role in the complete description of all cancellable elements of the lattice MON. It turns out that there are precisely five such elements.
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.