Order, lattices, ordered algebraic structures Definition
Ideal completion
Builds on Partial orderDirected setDirected-complete partial orderCompact elementLattice ideal
Definition
Let be a partially ordered set. An order ideal of is a subset such that:
- is nonempty;
- is a down-set: if and , then ;
- is directed: for all there is with and .
The ideal completion of is the set of all order ideals of , ordered by inclusion. It comes with the map from to .
Remarks
is a directed-complete partial order: the supremum of a directed family of ideals is its union. The map is an order embedding, and the principal ideals are exactly the compact elements of , so is an algebraic dcpo. When is a lattice, the order ideals are its lattice ideals and is an algebraic lattice if has a least element. Example: for , the ideals are the sets and itself, so . Non-example: in , the set is not an ideal, because but .
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Compact element concept
- Directed set concept
- Directed-complete partial order concept
- Lattice ideal concept
- Partial order concept
- Ideal completion definition
Further reading
About this page
| Tag | XQXBBDD5XB |
|---|---|
| URI | m2://XQXBBDD5XB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B23, 06B35 |
| Defines | Ideal completion |
| Uses | Partial order, Directed set, Directed-complete partial order, Compact element, Lattice ideal |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.