Math 2.0

Order, lattices, ordered algebraic structures Definition

Dedekind–MacNeille completion

Builds on Partial orderUpper boundComplete latticeDedekind cutExtended real number line

Definition

Let (P,≤)(P, \le) be a partially ordered set. For A⊆PA \subseteq P, let AuA^u be the set of upper bounds of AA in PP and AlA^l the set of lower bounds of AA in PP. The Dedekind–MacNeille completion of PP is the set DM⁡(P)={A⊆P:(Au)l=A},\operatorname{DM}(P) = \set{A \subseteq P : (A^u)^l = A}, ordered by inclusion, together with the map ι ⁣:P→DM⁡(P)\iota \colon P \to \operatorname{DM}(P), ι(x)={y∈P:y≤x}\iota(x) = \set{y \in P : y \le x}.

Remarks

DM⁡(P)\operatorname{DM}(P) is a complete lattice, whose meets are intersections, and ι\iota is an order embedding: x≤yx \le y if and only if ι(x)⊆ι(y)\iota(x) \subseteq \iota(y). The image of ι\iota is join-dense and meet-dense: each element of DM⁡(P)\operatorname{DM}(P) is a supremum and an infimum of elements of ι(P)\iota(P). These properties characterize DM⁡(P)\operatorname{DM}(P) up to isomorphism, and it embeds in every complete lattice that contains PP as an ordered subset. Example: for P=ℚP = \Q, the sets A=(Au)lA = (A^u)^l are ∅\varnothing, ℚ\Q, and the sets {q∈ℚ:q≤r}\set{q \in \Q : q \le r} for r∈ℝr \in \R. So DM⁡(ℚ)\operatorname{DM}(\Q) is the extended real line, and its proper nonempty elements are closely related to Dedekind cuts. Non-example: in ℚ\Q, the set A={q∈ℚ:q<0}A = \set{q \in \Q : q < 0} is not in DM⁡(ℚ)\operatorname{DM}(\Q), because AuA^u is the set of nonnegative rationals and (Au)l={q:q≤0}≠A(A^u)^l = \set{q : q \le 0} \ne A.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Complete lattice concept
  2. Dedekind cut concept
  3. Extended real number line object
  4. Partial order concept
  5. Upper bound concept
  6. Dedekind–MacNeille completion definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Dedekind%E2%80%93MacNeille_completion
About this page
TagDNBS22EV21
URIm2://DNBS22EV21
Kinddefinition
WritingW0 stub
MSC06B23, 06A06
DefinesDedekind–MacNeille completion
UsesPartial 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.