Representing a monotone map by principal lattice congruences
For a lattice L, let Princ (L) denote the ordered set of principal congruences of L. In a pioneering paper, G. Grätzer proved that bounded ordered sets (in other words, posets with 0 and 1) are, up to isomorphism, exactly the Princ (L) of bounded lattices L. Here we prove that for each 0-separating boundpreserving monotone map ψ between two bounded ordered sets, there are a lattice L and a sublattice K of L such that, in essence, ψ is the map from Princ (K) to Princ (L) that sends a principal congruence to the congruence it generates in the larger lattice.
Key words and phrasesprincipal congruence lattice congruence ordered set order poset quasi-colored lattice preordering quasiordering monotone map
Mathematics Subject Classification06B10
Unable to display preview. Download preview PDF.
- 1.G. Czédli, The ordered set of principal congruences of a countable lattice, algebra universalis, to appear; see also at http://www.math.u-szeged.hu/~czedli/
- 3.G. Czédli, Representing some families of monotone maps by principal lattice congruences, Algebra Universalis, submitted in April, 2015.Google Scholar
- 4.K. P. Bogart, R. Freese and J. P. S. Kung (editors), The Dilworth Theorems. Selected papers of Robert P. Dilworth, Birkhäuser Boston, Inc. (Boston, MA, 1990), xxvi+465 pp. ISBN: 0-8179-3434-7Google Scholar
- 5.G. Grätzer, The Congruences of a Finite Lattice. A Proof-by-picture Approach, Birkhäuser (Boston, 2006).Google Scholar