Canonical extensions, free completely distributive lattices, and complete retracts

2021 ◽  
Vol 82 (4) ◽  
Author(s):  
Guram Bezhanishvili ◽  
John Harding ◽  
Mamuka Jibladze
2018 ◽  
Vol 28 (03) ◽  
pp. 521-541 ◽  
Author(s):  
W. Morton ◽  
C. J. van Alten

It is known that a poset can be embedded into a distributive lattice if, and only if, it satisfies the prime filter separation property. We describe here a class of “prime filter completions” for posets with the prime filter separation property that are completely distributive lattices generated by the poset and preserve existing finite meets and joins. The free completely distributive lattice generated by a poset can be obtained through such a prime filter completion. We also show that every completely distributive completion of a poset with the prime filter separation property is representable as a canonical extension of the poset with respect to some set of filters and ideals. The connections between the prime filter completions and canonical extensions are described and yield the following corollary: the canonical extension of any distributive lattice is the free completely distributive lattice generated by the lattice. A construction that is a variant of the prime filter completion is given that can be used to obtain the free distributive lattice generated by a poset. In addition, it is shown that every distributive lattice extension of the poset can be represented by such a construction. Finally, we show that a poset with the prime filter separation property and the free distributive lattice generated by it generates the same free completely distributive lattice.


1983 ◽  
Vol 26 (4) ◽  
pp. 446-453
Author(s):  
G. Gierz ◽  
J. D. Lawson ◽  
A. R. Stralka

AbstractA lattice is said to be essentially metrizable if it is an essential extension of a countable lattice. The main result of this paper is that for a completely distributive lattice the following conditions are equivalent: (1) the interval topology on L is metrizable, (2) L is essentially metrizable, (3) L has a doubly ordergenerating sublattice, (4) L is an essential extension of a countable chain.


1999 ◽  
Vol 143 (1-3) ◽  
pp. 339-350 ◽  
Author(s):  
M.C. Pedicchio ◽  
R.J. Wood

2007 ◽  
Vol 15 (3) ◽  
pp. 225-241 ◽  
Author(s):  
B. A. Davey ◽  
M. Haviar ◽  
H. A. Priestley

1985 ◽  
Vol 32 (3) ◽  
pp. 361-374 ◽  
Author(s):  
Gerhard Gierz ◽  
Albert R. Stralka

The salient feature of the essential completion process is that for most common distributive lattices it will yield a completely distributive lattice. In this note it is shown that for those distributive lattices which have at least one completely distributive essential extension the essential completion is minimal among the completions by infinitely distributive lattices. Thus in its setting the essential completion of a distributive lattice behaves in much the some way as the one-point compactification of locally compact topological space does in its setting.


Sign in / Sign up

Export Citation Format

Share Document