Duality theory for distributive lattices

Last updated

In mathematics, duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley spaces, spectral spaces, and pairwise Stone spaces. This duality, which is originally also due to Marshall H. Stone, [1] generalizes the well-known Stone duality between Stone spaces and Boolean algebras.

Contents

Let L be a bounded distributive lattice, and let X denote the set of prime filters of L. For each a∈L, let φ+(a) = {x∈X : a ∈ x}. Then (X,τ+) is a spectral space, [2] where the topology τ+ on X is generated by {φ+(a) : a∈L}. The spectral space (X, τ+) is called the prime spectrum of L.

The map φ+ is a lattice isomorphism from L onto the lattice of all compact open subsets of (X,τ+). In fact, each spectral space is homeomorphic to the prime spectrum of some bounded distributive lattice. [3]

Similarly, if φ−(a) = {x∈X : a ∉ x} and τ− denotes the topology generated by {φ−(a) : a∈L}, then (X,τ−) is also a spectral space. Moreover, (X,τ+,τ−) is a pairwise Stone space. The pairwise Stone space (X,τ+,τ−) is called the bitopological dual of L. Each pairwise Stone space is bi-homeomorphic to the bitopological dual of some bounded distributive lattice. [4]

Finally, let ≤ be set-theoretic inclusion on the set of prime filters of L and let τ = τ+∨τ−. Then (X,τ,≤) is a Priestley space. Moreover, φ+ is a lattice isomorphism from L onto the lattice of all clopen up-sets of (X,τ,≤). The Priestley space (X,τ,≤) is called the Priestley dual of L. Each Priestley space is isomorphic to the Priestley dual of some bounded distributive lattice. [5]

Let Dist denote the category of bounded distributive lattices and bounded lattice homomorphisms. Then the above three representations of bounded distributive lattices can be extended to dual equivalence [6] between Dist and the categories Spec, PStone, and Pries of spectral spaces with spectral maps, of pairwise Stone spaces with bi-continuous maps, and of Priestley spaces with Priestley morphisms, respectively:

Duality for bounded distributive lattices DL Duality.png
Duality for bounded distributive lattices

Thus, there are three equivalent ways of representing bounded distributive lattices. Each one has its own motivation and advantages, but ultimately they all serve the same purpose of providing better understanding of bounded distributive lattices.

See also

Notes

  1. ↑ Stone (1938)
  2. ↑ Stone (1938), Johnstone (1982)
  3. ↑ Stone (1938), Johnstone (1982)
  4. ↑ Bezhanishvili et al. (2010)
  5. ↑ Priestley (1970)
  6. ↑ Bezhanishvili et al. (2010)

Related Research Articles

In mathematics, more specifically in functional analysis, a Banach space is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and is complete in the sense that a Cauchy sequence of vectors always converges to a well-defined limit that is within the space.

In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set union and intersection. Indeed, these lattices of sets describe the scenery completely: every distributive lattice is—up to isomorphism—given as such a lattice of sets.

In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement for filters on sets is known as the ultrafilter lemma. Other theorems are obtained by considering different mathematical structures with appropriate notions of ideals, for example, rings and prime ideals, or distributive lattices and maximal ideals. This article focuses on prime ideal theorems from order theory.

In mathematics, the Gelfand representation in functional analysis is either of two things:

In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they form a natural generalization of Stone's representation theorem for Boolean algebras. These concepts are named in honor of Marshall Stone. Stone-type dualities also provide the foundation for pointless topology and are exploited in theoretical computer science for the study of formal semantics.

In topology and related areas of mathematics, a Stone space, also known as a profinite space or profinite set, is a compact totally disconnected Hausdorff space. Stone spaces are named after Marshall Harvey Stone who introduced and studied them in the 1930s in the course of his investigation of Boolean algebras, which culminated in his representation theorem for Boolean algebras.

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum and a unique infimum. An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor.

In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and lattice theory.

In mathematics, a spectral space is a topological space that is homeomorphic to the spectrum of a commutative ring. It is sometimes also called a coherent space because of the connection to coherent topoi.

In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a certain field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of the 20th century. The theorem was first proved by Marshall H. Stone. Stone was led to it by his study of the spectral theory of operators on a Hilbert space.

In mathematics, a representation theorem is a theorem that states that every abstract structure with certain properties is isomorphic to another structure.

In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most famous and long-standing open problems in lattice theory; it had a deep impact on the development of lattice theory itself. The conjecture that every distributive lattice is a congruence lattice is true for all distributive lattices with at most ℵ1 compact elements, but F. Wehrung provided a counterexample for distributive lattices with ℵ2 compact elements using a construction based on Kuratowski's free set theorem.

In mathematics, a commutation theorem for traces explicitly identifies the commutant of a specific von Neumann algebra acting on a Hilbert space in the presence of a trace.

In mathematics, Birkhoff's representation theorem for distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations correspond to unions and intersections of sets. Here, a lattice is an abstract structure with two binary operations, the "meet" and "join" operations, which must obey certain axioms; it is distributive if these two operations obey the distributive law. The union and intersection operations, in a family of sets that is closed under these operations, automatically form a distributive lattice, and Birkhoff's representation theorem states that every finite distributive lattice can be formed in this way. It is named after Garrett Birkhoff, who published a proof of it in 1937.

In mathematics and particularly in topology, pairwise Stone space is a bitopological space which is pairwise compact, pairwise Hausdorff, and pairwise zero-dimensional.

In mathematics, a Priestley space is an ordered topological space with special properties. Priestley spaces are named after Hilary Priestley who introduced and investigated them. Priestley spaces play a fundamental role in the study of distributive lattices. In particular, there is a duality between the category of Priestley spaces and the category of bounded distributive lattices.

In mathematics, Esakia spaces are special ordered topological spaces introduced and studied by Leo Esakia in 1974. Esakia spaces play a fundamental role in the study of Heyting algebras, primarily by virtue of the Esakia duality—the dual equivalence between the category of Heyting algebras and the category of Esakia spaces.

In mathematics, Esakia duality is the dual equivalence between the category of Heyting algebras and the category of Esakia spaces. Esakia duality provides an order-topological representation of Heyting algebras via Esakia spaces.

In the theory of C*-algebras, the universal representation of a C*-algebra is a faithful representation which is the direct sum of the GNS representations corresponding to the states of the C*-algebra. The various properties of the universal representation are used to obtain information about the ideals and quotients of the C*-algebra. The close relationship between an arbitrary representation of a C*-algebra and its universal representation can be exploited to obtain several criteria for determining whether a linear functional on the algebra is ultraweakly continuous. The method of using the properties of the universal representation as a tool to prove results about the C*-algebra and its representations is commonly referred to as universal representation techniques in the literature.

Introduction to Lattices and Order is a mathematical textbook on order theory by Brian A. Davey and Hilary Priestley. It was published by the Cambridge University Press in their Cambridge Mathematical Textbooks series in 1990, with a second edition in 2002. The second edition is significantly different in its topics and organization, and was revised to incorporate recent developments in the area, especially in its applications to computer science. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.