Math 2.0

Order, lattices, ordered algebraic structures Distributive lattices Theorem

Esakia duality

Builds on Heyting algebraEsakia spacePriestley dualityEquivalence of categories

Statement

Let f ⁣:X→Yf \colon X \to Y be a continuous order-preserving map between Esakia spaces. Call ff an Esakia morphism if for all x∈Xx \in X and y∈Yy \in Y with f(x)≤yf(x) \le y there is z∈Xz \in X with x≤zx \le z and f(z)=yf(z) = y. Let 𝐇𝐀\mathbf{HA} be the category of Heyting algebras with homomorphisms that preserve 00, 11, ∧\wedge, ∨\vee and →\to. Let 𝐄𝐬𝐚\mathbf{Esa} be the category of Esakia spaces with Esakia morphisms. Then 𝐇𝐀\mathbf{HA} is dually equivalent to 𝐄𝐬𝐚\mathbf{Esa}, that is, 𝐇𝐀\mathbf{HA} is equivalent to the opposite category of 𝐄𝐬𝐚\mathbf{Esa}.

  1. A Heyting algebra HH goes to the set XHX_H of prime filters of HH, ordered by inclusion. Its topology is generated by the sets {P:a∈P}\set{P : a \in P} and {P:a∉P}\set{P : a \notin P} for a∈Ha \in H.
  2. An Esakia space XX goes to the Heyting algebra of its clopen up-sets, with U→V=X∖↓(U∖V)U \to V = X \setminus {\downarrow}(U \setminus V).
  3. The map a↦{P∈XH:a∈P}a \mapsto \set{P \in X_H : a \in P} is an isomorphism from HH onto the clopen up-sets of XHX_H.

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 ↓C{\downarrow} C is clopen for clopen CC. A lattice homomorphism between Heyting algebras preserves →\to 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
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. Equivalence of categories concept
  3. Esakia space concept
  4. Heyting algebra concept
  5. Order filter concept
  6. Priestley space concept
  7. Upper set concept
  8. Priestley duality statement
  9. Esakia duality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Esakia_duality
About this page
TagCD9Y7YP4EJ
URIm2://CD9Y7YP4EJ
Kindstatement, theorem
WritingW0 stub
MSC06D20, 06D50, 03G10
StatusThis copy of the site has no build data. Run m2 status CD9Y7YP4EJ.
AboutHeyting algebra, Esakia space
UsesHeyting 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.