Order, lattices, ordered algebraic structures Definition
Dedekind–MacNeille completion
Builds on Partial orderUpper boundComplete latticeDedekind cutExtended real number line
Definition
Let be a partially ordered set. For , let be the set of upper bounds of in and the set of lower bounds of in . The Dedekind–MacNeille completion of is the set ordered by inclusion, together with the map , .
Remarks
is a complete lattice, whose meets are intersections, and is an order embedding: if and only if . The image of is join-dense and meet-dense: each element of is a supremum and an infimum of elements of . These properties characterize up to isomorphism, and it embeds in every complete lattice that contains as an ordered subset. Example: for , the sets are , , and the sets for . So is the extended real line, and its proper nonempty elements are closely related to Dedekind cuts. Non-example: in , the set is not in , because is the set of nonnegative rationals and .
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Complete lattice concept
- Dedekind cut concept
- Extended real number line object
- Partial order concept
- Upper bound concept
- Dedekind–MacNeille completion definition
Further reading
About this page
| Tag | DNBS22EV21 |
|---|---|
| URI | m2://DNBS22EV21 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B23, 06A06 |
| Defines | Dedekind–MacNeille completion |
| Uses | Partial order, Upper bound, Complete lattice, Dedekind cut, Extended real number line |
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.