A note on representation of lattices by weak congruences (Q1935014): Difference between revisions

This paper belongs to the longer series of results on weak congruences mainly obtained by B. Šešelja and A. Tepavčević; all these papers are given in the reference list. A \textit{weak congruence} on an algebra \(\mathcal{A}\) is a symmetric, transitive, compatible relation (``congruence without reflexivity''). Such relations form an algebraic lattice under inclusion. Assume we have an algebraic lattice \(\mathcal{L}\) which is isomorphic to the lattice of weak congruences of some algebra \(\mathcal{A}\). An element \(a\in\mathcal{L}\) which is then assigned to the diagonal congruence \(\Delta=\{(x,x):x\in\mathcal{A}\}\) is called \(\Delta\)-suitable. The problem to determine what are the \(\Delta\)-suitable elements in an algebraic lattice is connected with the (weak congruence) lattice representation problem and is still open. The authors present some results on \(\Delta\)-suitability which allow, e.g., to find such elements in complete atomic Boolean algebras and to obtain new \(\Delta\)-suitable elements using some special ones.