Global Information Lookup Global Information

Duality theory for distributive lattices information


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.

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,[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 : 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.[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:

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.

  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)

and 22 Related for: Duality theory for distributive lattices information

Request time (Page generated in 0.8478 seconds.)

Duality theory for distributive lattices

Last Update:

mathematics, duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley...

Word Count : 599

Distributive lattice

Last Update:

of lattices preserves the lattice structure, it will consequently also preserve the distributivity (and thus be a morphism of distributive lattices). Distributive...

Word Count : 2053

Complemented lattice

Last Update:

called an orthomodular lattice. In bounded distributive lattices, complements are unique. Every complemented distributive lattice has a unique orthocomplementation...

Word Count : 876

Priestley space

Last Update:

play a fundamental role in the study of distributive lattices. In particular, there is a duality ("Priestley duality") between the category of Priestley spaces...

Word Count : 1091

Introduction to Lattices and Order

Last Update:

Boolean algebras and the duality theory for distributive lattices. Two appendices provide background in topology needed for the final chapter, and an...

Word Count : 816

Stone duality

Last Update:

representation of distributive lattices via ordered topologies: Priestley's representation theorem for distributive lattices. Many other Stone-type dualities could...

Word Count : 2289

List of dualities

Last Update:

wavelet Duality (optimization) Duality (order theory) Duality of stereotype spaces Duality (projective geometry) Duality theory for distributive lattices Dualizing...

Word Count : 483

List of order theory topics

Last Update:

Completeness (order theory) Dense order Distributivity (order theory) modular lattice distributive lattice completely distributive lattice Ascending chain...

Word Count : 396

Order theory

Last Update:

This condition is called distributivity and gives rise to distributive lattices. There are some other important distributivity laws which are discussed...

Word Count : 4508

Semilattice

Last Update:

frames and frame-homomorphisms, and from the category of distributive lattices and lattice-homomorphisms, have a left adjoint. Directed set – Mathematical...

Word Count : 2397

Distributive property

Last Update:

In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x ⋅ ( y + z...

Word Count : 2998

Glossary of order theory

Last Update:

that are not already complete lattices. Completely distributive lattice. A complete lattice is completely distributive if arbitrary joins distribute over...

Word Count : 4210

Esakia duality

Last Update:

category of Heyting algebras is dually equivalent to the category of Heyting spaces. Duality theory for distributive lattices Esakia, Leo (1974). "Topological...

Word Count : 302

Skew lattice

Last Update:

lattices are symmetric and can be shown to form a variety. Unlike lattices, they need not be distributive, and conversely. Distributive skew lattices...

Word Count : 5159

Heyting algebra

Last Update:

are distributive lattices. Every Boolean algebra is a Heyting algebra when a → b is defined as ¬a ∨ b, as is every complete distributive lattice satisfying...

Word Count : 6241

Algebra over a field

Last Update:

commutative, left distributivity and right distributivity are equivalent, and, in this case, only one distributivity requires a proof. In general, for non-commutative...

Word Count : 2913

Modular lattice

Last Update:

(see below) emphasizes that modular lattices form a variety in the sense of universal algebra. Modular lattices arise naturally in algebra and in many...

Word Count : 2403

Equivalence of categories

Last Update:

case of Stone duality is Birkhoff's representation theorem stating a duality between finite partial orders and finite distributive lattices. In pointless...

Word Count : 1988

Complete lattice

Last Update:

lattices may be incomplete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices,...

Word Count : 2594

Riesz space

Last Update:

x^{-}\leq y^{-}.} Every Riesz space is a distributive lattice; that is, it has the following equivalent properties: for all x , y , z ∈ X {\displaystyle x,y...

Word Count : 5296

Monotonic function

Last Update:

(1971). Lattice theory: first concepts and distributive lattices. ISBN 0-7167-0442-0. Pemberton, Malcolm; Rau, Nicholas (2001). Mathematics for economists:...

Word Count : 2400

Total order

Last Update:

(1971). Lattice theory: first concepts and distributive lattices. W. H. Freeman and Co. ISBN 0-7167-0442-0 Halmos, Paul R. (1968). Naive Set Theory. Princeton:...

Word Count : 3094

PDF Search Engine © AllGlobal.net