Definition:Dedekind-MacNeille Completion
Jump to navigation
Jump to search
Definition
Let $\struct {S, \preceq}$ be an ordered set.
For a subset $A \subseteq S$, let $A_+$ and $A_-$ be the sets of all upper and lower bounds for $A$ in $S$, respectively.
This article, or a section of it, needs explaining. In particular: Review notation for upper and lower bounds You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Explain}} from the code. |
The Dedekind-MacNeille completion of $\struct {S, \preceq}$ is defined as the set:
- $\widehat S := \set {A \subseteq S: A = \paren {A_+}_-}$
ordered by inclusion ($\subseteq$).
This article, or a section of it, needs explaining. In particular: ordered by inclusion in this context - exactly how does this work? You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Explain}} from the code. |
Also see
This is not to be confused with the Dedekind completion.
Source of Name
This entry was named for Julius Wilhelm Richard Dedekind and Holbrook Mann MacNeille.