Modular elements in the lattice of monoid varieties

The paper studies the modular elements of the lattice \(\mathbb{MON}\) of all monoid varieties. Recall that an element \(x\) of a lattice \(L\) is called modular if \(L\) contains no five-element sublattice isomorphic to the pentagon in which \(x\) corresponds to the lonely midpoint.\N\NThe author presents a complete countably infinite list of monoid varieties that are modular elements of the lattice \(\mathbb{MON}\). The main result provides several equivalent characterizations of modular monoid varieties. More precisely, for a monoid variety \(\mathbf{V}\), it is shown that the following conditions are equivalent: \(\mathbf{V}\) is a modular element of the lattice \(\mathbb{MON}\); \(\mathbf{V}\) is either the variety \(\mathbb{MON}\) itself or satisfies certain identities specified in the theorem; and \(\mathbf{V}\) coincides with one of the explicitly listed varieties appearing in the theorem.\N\NThe author also notes that, in general, the set of modular elements of a lattice need not form a sublattice. However, the main theorem shows that the set of all modular elements of the lattice \(\mathbb{MON}\) does form a sublattice. Moreover, all proper monoid varieties that are modular elements in \(\mathbb{MON}\) constitute an order ideal of \(\mathbb{MON}\).

Cites work

This page was built for publication: Modular elements in the lattice of monoid varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285733)