Order, lattices, ordered algebraic structures Definition
Algebraic lattice
Builds on Complete latticeCompact elementSupremum
Definition
Let be a complete lattice. It is an algebraic lattice, or compactly generated, if every is the supremum of the set of compact elements below it.
Remarks
Example: the lattice of subgroups of a group , whose compact elements are the finitely generated subgroups. Each subgroup is the join of the cyclic subgroups for . Non-example: the closed subsets of , ordered by inclusion, form a complete lattice in which the join of a family is the closure of its union. A nonempty closed set is not compact: pick ; the closed sets form a directed family whose join is , yet for every . So the only compact element is , and no nonempty closed set is a join of compact elements. Every algebraic lattice is a continuous lattice. Some authors do not require completeness and speak of algebraic posets or algebraic dcpos instead.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Compact element concept
- Complete lattice concept
- Supremum concept
- Algebraic lattice definition
Further reading
About this page
| Tag | HD8CK28AJC |
|---|---|
| URI | m2://HD8CK28AJC |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B23, 08A30 |
| Defines | Algebraic lattice |
| Uses | Complete lattice, Compact element, Supremum |
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.