| Compact Element |
Article Index for Compact |
Website Links For Compact |
Information AboutCompact Element |
| CATEGORIES ABOUT COMPACT ELEMENT | |
| order theory | |
|
Compact elements are important in s. FORMAL DEFINITION For some partially ordered set (''P'',≤) an element ''c'' of ''P'' is called ''compact'' (or ''finite'') if it satisfies one of the following equivalent conditions:
If the poset ''P'' additionally is a Join-semilattice (i.e. if it has binary suprema) then these conditions are equivalent to the following statement:
Using the definitions of the involved concepts these equivalences are easily verified. For the case of the join-semilattices note that any set can be turned into a directed set with the same supremum by closing under finite (non-empty) suprema. When considering Directed Complete Partial Order s or Complete Lattice s the additional requirements that the specified suprema exist can of course be dropped. Note also that a join-semilattice which is directed complete is almost a complete lattice (possibly lacking a Least Element ) -- see Completeness (order Theory) for details. If it exists, the least element of a poset is always compact. It may well be that this is the only compact element, as the example of the Real unit interval {Link without Title} shows. EXAMPLES
LITERATURE Compact elements are standard. See the literature given for Order Theory and Domain Theory . |
|
|