Duality theory for distributive lattices

Duality theory for distributive lattices

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 generalizes the well-known Stone duality between Stone spaces and Boolean algebras.

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 : ax} . Then (X,τ+) is a spectral space,[1] 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.[2]

Similarly, if φ(a) = {x X : ax} 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.[3]

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.[4]

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[5] 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:

Spec, Pries and Pstone are isomorphic, all three are dually equivalent to Dist
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 (1937), Johnstone (1982)
  2. ^ Stone (1937), Johnstone (1982)
  3. ^ Bezhanishvili et al. (2010)
  4. ^ Priestley (1970)
  5. ^ Bezhanishvili et al. (2010)

References

  • Priestley, H. A. (1970). Representation of distributive lattices by means of ordered Stone spaces.Bull. London Math. Soc., (2) 186–190.
  • Priestley, H. A. (1972). Ordered topological spaces and the representation of distributive lattices. Proc. London Math. Soc., 24(3) 507–530.
  • Stone, M. (1937). Topological representation of distributive lattices and Brouwerian logics. Casopis Pest. Mat. Fys.}, 67 1–25.
  • Cornish, W. H. (1975). On H. Priestley's dual of the category of bounded distributive lattices. Mat. Vesnik, 12(27) (4) 329–332.
  • M. Hochster (1969). Prime ideal structure in commutative rings. Trans. Amer. Math. Soc., 142 43–60
  • Johnstone, P. T. (1982). Stone spaces. Cambridge University Press, Cambridge. ISBN 0-521-23893-5.
  • Jung, A. and Moshier, M. A. (2006). On the bitopological nature of Stone duality. Technical Report CSR-06-13, School of Computer Science, University of Birmingham.
  • Bezhanishvili, G., Bezhanishvili, N., Gabelaia, D., Kurz, A. (2010). Bitopological duality for distributive lattices and Heyting algebras. Mathematical Structures in Computer Science, 20.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Distributive lattice — In mathematics, distributive lattices are lattices for 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… …   Wikipedia

  • Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… …   Wikipedia

  • Stone duality — 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… …   Wikipedia

  • Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …   Wikipedia

  • Distributivity (order theory) — In the mathematical area of order theory, there are various notions of the common concept of distributivity, applied to the formation of suprema and infima. Most of these apply to partially ordered sets that are at least lattices, but the concept …   Wikipedia

  • Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be …   Wikipedia

  • Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia

  • Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… …   Wikipedia

  • List of eponyms (L-Z) — An eponym is a person (real or fictitious) whose name has become identified with a particular object or activity. NOTOC Here is a list of eponyms:A–K L M N–O P Q–R S T U–V W X–ZL* Rudolf Laban choreographer, created labanotation. * Ferruccio… …   Wikipedia

  • Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”