6.7 Dedekind-MacNeille completion

The Dedekind-MacNeille completion is a powerful tool in order theory, extending partially ordered sets into complete lattices. It preserves existing order relations while introducing new elements to fill gaps, ensuring every subset has both a supremum and infimum.

This completion process, developed by Dedekind and MacNeille, generalizes Dedekind's work on cuts in rational numbers. It embeds the original set into the smallest possible complete lattice, maintaining existing bounds and forming a dense subset within the completion.

Definition of Dedekind-MacNeille completion

• Fundamental concept in order theory provides a method to extend partially ordered sets into complete lattices
• Preserves existing order relations while introducing new elements to fill gaps in the original structure
• Plays a crucial role in understanding the relationships between different types of ordered structures

Concept of completion

Top images from around the web for Concept of completion

• 

  fractals - Supremum of all y-coordinates of the Mandelbrot set - Mathematics Stack Exchange View original

  Is this image relevant?

• 

  Partially ordered set - Wikipedia View original

  Is this image relevant?

• 

  Lattice (order) - Wikipedia View original

  Is this image relevant?

• 

  fractals - Supremum of all y-coordinates of the Mandelbrot set - Mathematics Stack Exchange View original

  Is this image relevant?

• 

  Partially ordered set - Wikipedia View original

  Is this image relevant?

1 of 3

Top images from around the web for Concept of completion

• 

  fractals - Supremum of all y-coordinates of the Mandelbrot set - Mathematics Stack Exchange View original

  Is this image relevant?

• 

  Partially ordered set - Wikipedia View original

  Is this image relevant?

• 

  Lattice (order) - Wikipedia View original

  Is this image relevant?

• 

  fractals - Supremum of all y-coordinates of the Mandelbrot set - Mathematics Stack Exchange View original

  Is this image relevant?

• 

  Partially ordered set - Wikipedia View original

  Is this image relevant?

1 of 3

• Process of adding elements to a partially ordered set to create a complete lattice
• Ensures every subset has both a supremum (least upper bound) and an infimum (greatest lower bound)
• Maintains the original order relations of the initial set while introducing new elements
• Results in a minimal complete lattice containing the original partially ordered set

Historical background

• Developed by Richard Dedekind and Holbrook Mann MacNeille in the early 20th century
• Built upon Dedekind's work on cuts in the rational numbers to define real numbers
• Extended by MacNeille to generalize the concept to arbitrary partially ordered sets
• Formalized the notion of completion for partially ordered sets beyond just the real numbers

Properties of Dedekind-MacNeille completion

Universality

• Unique up to isomorphism for any given partially ordered set
• Embeds the original partially ordered set into the smallest possible complete lattice
• Preserves all existing suprema and infima from the original set
• Allows for a canonical representation of any partially ordered set as a complete lattice

Preservation of existing bounds

• Maintains all existing least upper bounds and greatest lower bounds from the original set
• Ensures that the completion process does not alter the relationships between elements already present
• Preserves the order-theoretic structure of the original partially ordered set
• Guarantees that any existing complete sublattices remain intact in the completion

Density in completion

• Original partially ordered set forms a dense subset within its Dedekind-MacNeille completion
• Every element in the completion can be approximated by elements from the original set
• Allows for the representation of new elements as limits of sequences from the original set
• Provides a connection between the discrete nature of the original set and the continuous aspects of the completion

Construction process

Cuts in partially ordered sets

• Generalizes Dedekind's concept of cuts in the rational numbers to arbitrary partially ordered sets
• Defines cuts as pairs of subsets that partition the original set based on order relations
• Identifies gaps in the original structure where new elements need to be introduced
• Forms the basis for creating new elements in the completion process

Upper and lower sets

• Upper set (upset) contains all elements greater than or equal to a given element
• Lower set (downset) consists of all elements less than or equal to a given element
• Used to define cuts and identify potential new elements in the completion
• Helps in understanding the order structure and relationships between elements

Galois connection

• Establishes a relationship between upper and lower sets in the construction process
• Defines a pair of order-preserving functions between the power sets of the original set and its dual
• Plays a crucial role in identifying the elements of the Dedekind-MacNeille completion
• Ensures that the resulting structure satisfies the properties of a complete lattice

Relationship to other completions

Dedekind cuts vs Dedekind-MacNeille

• Dedekind cuts specifically deal with completing the rational numbers to obtain the real numbers
• Dedekind-MacNeille completion generalizes this concept to arbitrary partially ordered sets
• Both methods involve identifying gaps in the original structure and filling them with new elements
• Dedekind-MacNeille completion provides a more versatile framework applicable to a wider range of mathematical structures

Comparison with ideal completion

• Ideal completion focuses on completing a partially ordered set using ideals (downward-closed subsets)
• Dedekind-MacNeille completion uses both upper and lower sets to construct new elements
• Ideal completion may result in a larger structure compared to Dedekind-MacNeille completion
• Dedekind-MacNeille completion provides a more compact representation while still achieving completeness

Applications in order theory

Embedding partial orders

• Allows for the representation of any partially ordered set within a complete lattice
• Facilitates the study of partially ordered sets using tools and theorems from lattice theory
• Enables the extension of order-theoretic properties from finite to infinite structures
• Provides a framework for analyzing the relationships between different types of ordered structures

Lattice theory connections

• Bridges the gap between partially ordered sets and complete lattices
• Allows for the application of lattice-theoretic concepts to a wider range of ordered structures
• Facilitates the study of distributive and modular lattices in relation to their completions
• Provides insights into the structure and properties of various types of lattices

Examples of Dedekind-MacNeille completion

Real numbers from rationals

• Completes the rational numbers $\mathbb{Q}$ to obtain the real numbers $\mathbb{R}$
• Introduces irrational numbers to fill the gaps between rational numbers
• Demonstrates how Dedekind cuts can be used to construct a complete ordered field
• Illustrates the density property of rationals within the real number line

Completion of Boolean algebras

• Transforms a Boolean algebra into a complete Boolean algebra
• Introduces new elements to represent infinite meets and joins
• Preserves the complementation and distributive properties of the original Boolean algebra
• Results in a structure where every subset has both a supremum and an infimum

Theoretical implications

Canonical extension

• Provides a standard way to extend partially ordered sets to complete lattices
• Allows for the study of properties that are preserved or introduced during the completion process
• Facilitates the comparison of different partially ordered sets through their completions
• Serves as a foundation for generalizing concepts from finite to infinite structures

Algebraic properties

• Investigates how algebraic operations and identities are affected by the completion process
• Studies the preservation of distributivity, modularity, and other lattice properties
• Examines the relationship between the algebraic structure of the original set and its completion
• Provides insights into the behavior of algebraic operations in complete lattices

Limitations and considerations

Non-distributive lattices

• Dedekind-MacNeille completion may not preserve distributivity in non-distributive lattices
• Requires careful analysis of the resulting structure when dealing with non-distributive input
• May lead to unexpected properties in the completed lattice compared to the original structure
• Necessitates alternative approaches or modifications when distributivity is crucial

Infinite partially ordered sets

• Completion process can significantly increase the cardinality of infinite sets
• May introduce computational challenges when dealing with uncountable completions
• Requires careful consideration of set-theoretic assumptions and axioms
• Necessitates the use of advanced techniques from set theory and topology in some cases

Advanced topics

Dedekind-MacNeille completion in category theory

• Generalizes the concept of completion to categorical settings
• Explores the functorial properties of Dedekind-MacNeille completion
• Investigates the relationship between completion and other categorical constructions
• Provides a framework for studying completions in more abstract mathematical contexts

Generalizations to other structures

• Extends the idea of completion to other mathematical structures beyond partially ordered sets
• Explores completions in metric spaces, topological spaces, and algebraic structures
• Investigates the connections between different types of completions across various domains
• Provides insights into the universal properties and characteristics of completion processes in mathematics