Order, lattices, ordered algebraic structures Definition
Compact element
Definition
Let be a partially ordered set. An element is compact if for every directed subset that has a supremum in with , there is with .
Remarks
In a complete lattice , an element is compact if and only if for every with there is a finite with . Compact elements are also called finite elements, and in domain theory is compact exactly when for the way-below relation. Example: in the power set of a set , a finite set is compact. If for a directed family , each of the finitely many points of lies in some member of . Directedness then gives one member containing all of them. Non-example: in the power set of , the set is not compact. It is the union of the directed family of sets and lies in none of them. The least element, when it exists, is always compact.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Complete lattice concept
- Directed set concept
- Partial order concept
- Supremum concept
- Compact element definition
Further reading
About this page
| Tag | 3TNVVAA1AG |
|---|---|
| URI | m2://3TNVVAA1AG |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B23, 06B35 |
| Defines | Compact element |
| Uses | Partial order, Directed set, Supremum, Complete lattice |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.