Math 2.0

Order, lattices, ordered algebraic structures Distributive lattices Theorem

Priestley duality

Builds on Distributive latticePriestley spaceOrder filterUpper set

Statement

Let LL be a bounded distributive lattice. A prime filter of LL is a filter FF with 0∉F0 \notin F such that a∨b∈Fa \vee b \in F implies a∈Fa \in F or b∈Fb \in F. Let XLX_L be the set of prime filters of LL, ordered by inclusion. Give XLX_L the topology generated by the sets {F:a∈F}\set{F : a \in F} and {F:a∉F}\set{F : a \notin F} for a∈La \in L. For a Priestley space XX, let ClopUp(X)\mathrm{ClopUp}(X) be the lattice of subsets of XX that are clopen upper sets. Its meet and join are intersection and union.

  1. XLX_L is a Priestley space, and the map a↦{F∈XL:a∈F}a \mapsto \set{F \in X_L : a \in F} is an isomorphism of bounded lattices from LL onto ClopUp(XL)\mathrm{ClopUp}(X_L).
  2. For every Priestley space XX, the map x↦{U∈ClopUp(X):x∈U}x \mapsto \set{U \in \mathrm{ClopUp}(X) : x \in U} is a homeomorphism and order isomorphism from XX onto XClopUp(X)X_{\mathrm{ClopUp}(X)}.
  3. These constructions extend to a dual equivalence of categories. On one side are the bounded distributive lattices with bounded lattice homomorphisms; on the other, the Priestley spaces with continuous order-preserving maps. A homomorphism h ⁣:L→Mh \colon L \to M corresponds to the map XM→XLX_M \to X_L, G↦h−1(G)G \mapsto h^{-1}(G).

Remarks

The key input is the prime ideal theorem for distributive lattices: if a≰ba \not\le b, some prime filter contains aa and not bb. This gives the injectivity in part 1 and the separation axiom of XLX_L. Compactness of XLX_L comes from viewing XLX_L as a closed subspace of the product space {0,1}L\set{0, 1}^L.

Example: if LL is finite, the prime filters are the sets ↑j{\uparrow} j for jj join-irreducible, and XLX_L is a finite poset with the discrete topology. Then part 1 becomes Birkhoff's representation theorem up to reversing the order.

When LL is a Boolean algebra, every prime filter is an ultrafilter and the order on XLX_L is trivial. Then the duality restricts to Stone duality between Boolean algebras and Stone spaces.

Going deeper

For a student

Priestley duality is a widely used form of duality for distributive lattices. Homomorphisms turn into continuous order-preserving maps in the opposite direction, so algebraic questions become geometric ones. It extends Stone duality for Boolean algebras. Under it, Heyting algebras correspond to Esakia spaces, a special class of Priestley spaces. An equivalent version, due to Stone, uses spectral spaces instead of Priestley spaces.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Distributive lattice concept
  2. Order filter concept
  3. Priestley space concept
  4. Upper set concept
  5. Priestley duality statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Duality_theory_for_distributive_lattices
About this page
TagSA22SEC75K
URIm2://SA22SEC75K
Kindstatement, theorem
WritingW0 stub
MSC06D50, 06D05, 18F70
StatusThis copy of the site has no build data. Run m2 status SA22SEC75K.
AboutDistributive lattice, Priestley space
UsesDistributive lattice, Priestley space, Order filter, Upper set
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by