Order, lattices, ordered algebraic structures Definition
Completely distributive lattice
Definition
Let be a complete lattice. Let be a set, let be a family of sets, and let for and . Let be the set of choice functions on with for every . The lattice is completely distributive if for all such data
Remarks
Example: the power set of a set . A point lies in if and only if for each there is with . This is membership in the right side, where the axiom of choice picks . Non-example: the lattice of open subsets of is a frame but not completely distributive. Take , , and . The left side is . Each meet on the right is the interior of an intersection and never contains , so the right side is . Complete distributivity is self-dual: the condition is equivalent to the same identity with and exchanged. Every completely distributive lattice is a distributive lattice.
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
- Complete lattice concept
- Distributive lattice concept
- Power set concept
- Completely distributive lattice definition
Further reading
About this page
| Tag | W91HFP63SN |
|---|---|
| URI | m2://W91HFP63SN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06D10, 06B23 |
| Defines | Completely distributive lattice |
| Uses | Complete lattice, Distributive lattice, Power set |
| 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.