Order, lattices, ordered algebraic structures Definition
Bounded poset
Definition
Let be a partially ordered set. The poset is bounded when it has a greatest element and a least element , that is, for all .
Remarks
The positive divisors of , ordered by divisibility, form a bounded poset with and , since and for each divisor . The poset is not bounded: it has neither a greatest nor a least element. The interval in has the top but no bottom, so it is not bounded. For a subset of , being bounded usually means something weaker: having an upper bound and a lower bound in . The elements and are unique when they exist, by antisymmetry. A bounded poset with one element has .
Reading path
To understand this page from the ground up, read these 18 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Greatest element definition
- Least element definition
- Bounded poset definition
Further reading
About this page
| Tag | SZ9X10ATEK |
|---|---|
| URI | m2://SZ9X10ATEK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Bounded poset |
| Uses | Partial order, 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.