{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "BS1RD4F5MD"
    }
  ],
  "body": "\n## Summary\n\nEvery [[partially ordered set|011C29Q1S1]] has a dual, obtained by reversing the order.\nEach order-theoretic notion has a dual notion: upper bound and lower bound, supremum and infimum, greatest and least element.\nThe duality principle says that a statement true for all posets stays true when every notion in it is replaced by its dual.\nThis halves the work in many proofs.\n\n## Explanations\n\n### L1 human\n\nTurn a picture of an order upside down, and you get another order: its dual.\nWhat was the top is now the bottom, and what was above is now below.\nSo every theorem about orders comes with a mirror theorem for free.\nFor example, the divisors of $12$ ordered by divisibility have greatest element $12$; in the dual order, $12$ is the least element.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "06A06"
    ],
    "name": "Duality in order theory",
    "same_as": {
      "wikidata": "Q554403",
      "wikipedia": "Duality (order theory)"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Duality_(order_theory)"
      }
    ],
    "tag": "MRYFDAG5G8"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/MRYFDAG5G8/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/MRYFDAG5G8.md",
  "msc": [
    "06A06"
  ],
  "name": "Duality in order theory",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/MRY/MRYFDAG5G8.md",
  "status": null,
  "tag": "MRYFDAG5G8",
  "uri": "m2://MRYFDAG5G8",
  "url": "https://tamnd.github.io/math2/wiki/duality-in-order-theory/",
  "writing": {
    "tag": "MRYFDAG5G8",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}
