{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nFor a complete lattice, arbitrary subsets have both infima and suprema and thus infinitary meet and join operations are available. Several extended notions of distributivity can thus be described. For example, for the **infinite distributive law**, finite meets may distribute over arbitrary joins, i.e.\n\n$$x \\wedge \\bigvee S = \\bigvee \\{ x \\wedge s \\mid s \\in S \\}$$\n\nmay hold for all elements *x* and all subsets *S* of the lattice. Complete lattices with this property are called **frames**, **locales** or **complete Heyting algebras**. They arise in connection with pointless topology and Stone duality. This distributive law *is not equivalent* to its dual statement\n\n$$x \\vee \\bigwedge S = \\bigwedge \\{ x \\vee s \\mid s \\in S \\}$$\n\nwhich defines the class of dual frames or complete co-Heyting algebras.\n\nNow one can go even further and define orders where arbitrary joins distribute over arbitrary meets. Such structures are called completely distributive lattices. However, expressing this requires formulations that are a little more technical. Consider a doubly indexed family {*x*\u003csub\u003e*j*,*k*\u003c/sub\u003e | *j* in *J*, *k* in *K*(*j*)} of elements of a complete lattice, and let *F* be the set of choice functions *f* choosing for each index *j* of *J* some index *f*(*j*) in *K*(*j*). A complete lattice is **completely distributive** if for all such data the following statement holds:\n\n$$\\bigwedge_{j\\in J}\\bigvee_{k\\in K(j)} x_{j,k} = \\bigvee_{f\\in F}\\bigwedge_{j\\in J} x_{j,f(j)}$$\n\nComplete distributivity is again a self-dual property, i.e. dualizing the above statement yields the same class of complete lattices. Completely distributive complete lattices (also called *completely distributive lattices* for short) are indeed highly special structures. See the article on completely distributive lattices.\n",
  "commit": "1696dfa6ac9eeb239262bb8121a4817855ba7e8d",
  "front": {
    "inventory": [
      "YN2ZTAHKWX"
    ],
    "kind": "statement",
    "name": "Distributivity laws for complete lattices",
    "role": "proposition",
    "sources": [
      {
        "locator": "Distributivity (order theory), section Distributivity laws for complete lattices",
        "mention": "wikipedia://en/616019#PQ26",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:616019@r1291705765"
      }
    ],
    "tag": "EERJWF32AF"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/EERJWF32AF/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/EERJWF32AF.md",
  "msc": null,
  "name": "Distributivity laws for complete lattices",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/EER/EERJWF32AF.md",
  "status": null,
  "tag": "EERJWF32AF",
  "uri": "m2://EERJWF32AF",
  "url": "https://math2.tamnd.com/wiki/distributivity-laws-for-complete-lattices/",
  "writing": {
    "tag": "EERJWF32AF",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}