|
|
|
|
ideal completion of a poset
|
(Definition)
|
|
|
Let be a poset. Consider the set
of all order ideals of .
Proof. We shall list, and when necessary, prove the following series of facts which ultimately prove the main assertion. For convenience, write
 .
is a poset with defined by set theoretic inclusion.
- For any
,
.
can be embedded in . The function defined by
is order preserving and one-to-one. If , and , then , hence
. If
, we have that and , so , since is antisymmetric.
is a dcpo. Suppose is a directed set in . Let
. For any , and for some ideals . As is directed, there is such that
and
. So and hence there is
such that and . This shows that is directed. Next, suppose and . Then for some , so
as well. This shows that is a down set. So is an ideal of :
.
- For every
,
is a compact element of . If
, where is directed in , then
, or
, which implies for some ideal . Therefore
, and
is way below itself:
is compact.
is an algebraic dcpo. Let . Let
. For any , there is such that and . This shows that
and
in , so that is directed. It is easy to see that
. Since is a join of a directed set consisting of compact elements, is algebraic.
This completes the proof. 
Definition.
is called the ideal completion of .
Remarks.
- In general, the ideal completion of a poset is not a complete lattice. It is complete in the sense of being directed complete. This is different from another type of completion, called the MacNeille completion of
, which is a complete lattice.
- If
is an upper semilattice, then so is
. In fact, the join of any non-empty family of ideals exists. Furthermore, if has a bottom element 0, then
is a complete lattice.
Proof. Let  be a non-empty family of ideals in  . Let  be the set of  consisting of all finite joins of elements of those ideals in  , and
 . Clearly,  is a lower set. For every  , we have  such that  and  . Since  and  are both finite joins of elements of those ideals in  , so is  . Since
 and
 ,  is directed. If  is any ideal larger than any of the ideals in  , clearly
 , since  is directed. So
 . Therefore,
 .
If , then
, the bottom of
, is the join of the empty family of ideals in . By this entry,
is a complete lattice. 
- If
is a lower semilattice, then so is
.
Proof. Let  be two ideals in  and  . By definition,  and  are non-empty, so let  and  . As  is a lower
semilattice,
 exists and  and  . So
 , and that  is non-empty. If
 , then
 or  . Similarly  . Therefore
 and  is a lower set. If  , then there is  and  such that
 . So
 and  is directed. This means that
 . 
- 1
- G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove, D. S. Scott, Continuous Lattices and Domains, Cambridge University Press, Cambridge (2003).
|
"ideal completion of a poset" is owned by CWoo.
|
|
(view preamble)
Cross-references: lower semilattice, lower set, finite, bottom, upper semilattice, MacNeille completion, completion, type, directed complete, complete lattice, completes, algebraic, join, easy to see, compact, way below, implies, compact element, down set, directed set, dcpo, antisymmetric, one-to-one, order, function, inclusion, series, necessary, algebraic dcpo, order ideals, poset
There is 1 reference to this entry.
This is version 5 of ideal completion of a poset, born on 2007-05-06, modified 2007-07-25.
Object id is 9340, canonical name is IdealCompletionOfAPoset.
Accessed 700 times total.
Classification:
| AMS MSC: | 06A06 (Order, lattices, ordered algebraic structures :: Ordered sets :: Partial order, general) | | | 06A12 (Order, lattices, ordered algebraic structures :: Ordered sets :: Semilattices) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|