{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $f \\colon X \\to Y$ be a continuous order-preserving map between [[Esakia spaces|996BWM6ZQ7]].\nCall $f$ an *Esakia morphism* if for all $x \\in X$ and $y \\in Y$ with $f(x) \\le y$ there is $z \\in X$ with $x \\le z$ and $f(z) = y$.\nLet $\\mathbf{HA}$ be the category of [[Heyting algebras|NG943XNQWH]] with homomorphisms that preserve $0$, $1$, $\\wedge$, $\\vee$ and $\\to$.\nLet $\\mathbf{Esa}$ be the category of Esakia spaces with Esakia morphisms.\nThen $\\mathbf{HA}$ is dually equivalent to $\\mathbf{Esa}$, that is, $\\mathbf{HA}$ is [[equivalent|K7A04ZBD92]] to the opposite category of $\\mathbf{Esa}$.\n\n1. A Heyting algebra $H$ goes to the set $X_H$ of prime filters of $H$, ordered by inclusion.\nIts topology is generated by the sets $\\set{P : a \\in P}$ and $\\set{P : a \\notin P}$ for $a \\in H$.\n2. An Esakia space $X$ goes to the Heyting algebra of its clopen up-sets, with $U \\to V = X \\setminus {\\downarrow}(U \\setminus V)$.\n3. The map $a \\mapsto \\set{P \\in X_H : a \\in P}$ is an isomorphism from $H$ onto the clopen up-sets of $X_H$.\n\n## Remarks\n\nThe theorem refines [[Priestley duality|SA22SEC75K]] between bounded distributive lattices and Priestley spaces.\nA Heyting algebra is in particular a bounded distributive lattice, and the extra structure of the implication matches exactly the condition that ${\\downarrow} C$ is clopen for clopen $C$.\nA lattice homomorphism between Heyting algebras preserves $\\to$ exactly when its dual map satisfies the lifting condition above.\nFor 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.\n\n## Explanations\n\n### L1 human\n\nEvery Heyting algebra can be rebuilt from a space of points with an order and a topology.\nAlgebra questions about Heyting algebras then turn into geometric questions about these spaces, and back.\nSince Heyting algebras model intuitionistic logic, the theorem links the algebraic and the relational pictures of that logic.\n\n### L2 human\n\nThe points of the dual space are the prime filters, which play the role of possible worlds in [[Kripke semantics|NGHWZ9Y7ZV]].\nThe 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.\nIt is one member of the family of Stone-type dualities, next to [[Stone duality|B9T33D5MJK]] for Boolean algebras and [[Priestley duality|SA22SEC75K]] for distributive lattices.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "NG943XNQWH",
      "996BWM6ZQ7"
    ],
    "kind": "statement",
    "msc": [
      "06D20",
      "06D50",
      "03G10"
    ],
    "name": "Esakia duality",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q5396694",
      "wikipedia": "Esakia duality"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Esakia_duality"
      }
    ],
    "tag": "CD9Y7YP4EJ",
    "uses": [
      "NG943XNQWH",
      "996BWM6ZQ7",
      "SA22SEC75K",
      "K7A04ZBD92"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/CD9Y7YP4EJ/",
  "links": [
    {
      "field": "about",
      "target": "NG943XNQWH"
    },
    {
      "field": "about",
      "target": "996BWM6ZQ7"
    },
    {
      "field": "uses",
      "target": "NG943XNQWH"
    },
    {
      "field": "uses",
      "target": "996BWM6ZQ7"
    },
    {
      "field": "uses",
      "target": "SA22SEC75K"
    },
    {
      "field": "uses",
      "target": "K7A04ZBD92"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/CD9Y7YP4EJ.md",
  "msc": [
    "06D20",
    "06D50",
    "03G10"
  ],
  "name": "Esakia duality",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/CD9/CD9Y7YP4EJ.md",
  "status": null,
  "tag": "CD9Y7YP4EJ",
  "uri": "m2://CD9Y7YP4EJ",
  "url": "https://tamnd.github.io/math2/wiki/esakia-duality/",
  "writing": {
    "tag": "CD9Y7YP4EJ",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}