Order, lattices, ordered algebraic structures Definition
Bounded lattice
Builds on LatticeGreatest elementLeast element
Definition
A bounded lattice is a lattice that has a greatest element and a least element. The greatest element is written or , and the least element is written or .
Algebraic form: a bounded lattice is a lattice with two elements such that and for all .
Remarks
The two forms agree: for all says for all , and says . Then also and . Example: the power set of a set , ordered by , is a bounded lattice with and . Every subset satisfies . Non-example: is a lattice with and , but it has no greatest element. Every finite nonempty lattice is bounded, with and , the join and the meet of all its elements.
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
- Greatest element concept
- Lattice concept
- Least element concept
- Bounded lattice definition
Further reading
About this page
| Tag | HBSWH80PVB |
|---|---|
| URI | m2://HBSWH80PVB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B05 |
| Defines | Bounded lattice |
| Uses | Lattice, Greatest element, Least element |
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.