Order, lattices, ordered algebraic structures Distributive lattices Theorem
Priestley duality
Builds on Distributive latticePriestley spaceOrder filterUpper set
Statement
Let be a bounded distributive lattice. A prime filter of is a filter with such that implies or . Let be the set of prime filters of , ordered by inclusion. Give the topology generated by the sets and for . For a Priestley space , let be the lattice of subsets of that are clopen upper sets. Its meet and join are intersection and union.
- is a Priestley space, and the map is an isomorphism of bounded lattices from onto .
- For every Priestley space , the map is a homeomorphism and order isomorphism from onto .
- 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 corresponds to the map , .
Remarks
The key input is the prime ideal theorem for distributive lattices: if , some prime filter contains and not . This gives the injectivity in part 1 and the separation axiom of . Compactness of comes from viewing as a closed subspace of the product space .
Example: if is finite, the prime filters are the sets for join-irreducible, and is a finite poset with the discrete topology. Then part 1 becomes Birkhoff's representation theorem up to reversing the order.
When is a Boolean algebra, every prime filter is an ultrafilter and the order on 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
- no evidence level
- Distributive lattice concept
- Order filter concept
- Priestley space concept
- Upper set concept
- Priestley duality statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | SA22SEC75K |
|---|---|
| URI | m2://SA22SEC75K |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 06D50, 06D05, 18F70 |
| Status | This copy of the site has no build data. Run m2 status SA22SEC75K. |
| About | Distributive lattice, Priestley space |
| Uses | Distributive lattice, Priestley space, Order filter, Upper set |
| Changed | 2 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.