Order, lattices, ordered algebraic structures Complete lattices and completions Concept
Conditionally complete lattice
Summary
A conditionally complete lattice is a lattice in which every nonempty bounded-above subset has a supremum and every nonempty bounded-below subset has an infimum. It is the order-theoretic form of the completeness of the real numbers. Unlike a complete lattice, it need not have a least or a greatest element.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | CZPBQY67ZJ |
|---|---|
| URI | m2://CZPBQY67ZJ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06B23 |
| Specializes | Lattice |
| 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.