Order, lattices, ordered algebraic structures Distributive lattices Theorem
Esakia duality
Builds on Heyting algebraEsakia spacePriestley dualityEquivalence of categories
Statement
Let be a continuous order-preserving map between Esakia spaces. Call an Esakia morphism if for all and with there is with and . Let be the category of Heyting algebras with homomorphisms that preserve , , , and . Let be the category of Esakia spaces with Esakia morphisms. Then is dually equivalent to , that is, is equivalent to the opposite category of .
- A Heyting algebra goes to the set of prime filters of , ordered by inclusion. Its topology is generated by the sets and for .
- An Esakia space goes to the Heyting algebra of its clopen up-sets, with .
- The map is an isomorphism from onto the clopen up-sets of .
Remarks
The theorem refines Priestley duality between bounded distributive lattices and Priestley spaces. A Heyting algebra is in particular a bounded distributive lattice, and the extra structure of the implication matches exactly the condition that is clopen for clopen . A lattice homomorphism between Heyting algebras preserves exactly when its dual map satisfies the lifting condition above. For a finite Heyting algebra the topology is discrete, and the theorem says that finite Heyting algebras are the algebras of up-sets of finite posets.
Going deeper
For a student
The points of the dual space are the prime filters, which play the role of possible worlds in Kripke semantics. The duality turns subalgebras into images of Esakia morphisms and homomorphic images into closed up-sets, which makes it a working tool in the study of intermediate logics. It is one member of the family of Stone-type dualities, next to Stone duality for Boolean algebras and Priestley duality for distributive lattices.
Reading path
To understand this page from the ground up, read these 9 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Distributive lattice concept
- Equivalence of categories concept
- Esakia space concept
- Heyting algebra concept
- Order filter concept
- Priestley space concept
- Upper set concept
- Priestley duality statement
- Esakia duality statement
Further reading
About this page
| Tag | CD9Y7YP4EJ |
|---|---|
| URI | m2://CD9Y7YP4EJ |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 06D20, 06D50, 03G10 |
| Status | This copy of the site has no build data. Run m2 status CD9Y7YP4EJ. |
| About | Heyting algebra, Esakia space |
| Uses | Heyting algebra, Esakia space, Priestley duality, Equivalence of categories |
| Same as |
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
No page links to this page yet.