On the set of principal congruences in a distributive congruence lattice of an algebra
arXiv:1705.10833
Abstract
Let be a subset of a finite distributive lattice . An algebra represents the inclusion by principal congruences if the congruence lattice of is isomorphic to and the ordered set of principal congruences of corresponds to under this isomorphism. If there is such an algebra for every subset containing , , and all join-irreducible elements of , then is said to be fully (A1)-representable. We prove that every fully (A1)-representable finite distributive lattice is planar and it has at most one join-reducible coatom. Conversely, we prove that every finite planar distributive lattice with at most one join-reducible coatom is fully chain-representable in the sense of a recent paper of G. Grätzer. Combining the results of this paper with another paper by the present author, it follows that every fully (A1)-representable finite distributive lattice is "fully representable" even by principal congruences of finite lattices. Finally, we prove that every chain-representable inclusion can be represented by the principal congruences of a finite (and quite small) algebra.
arXiv comment15 pages, 2 figures (Note that Section 5 and Proposition 5 are new.)