{
  "aliases": [
    "bottom-element",
    "greatest-and-least-elements",
    "largest-element",
    "largest-member",
    "least-and-greatest-elements",
    "lowest-element",
    "top-element"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, especially in order theory, the **greatest element** of a subset $S$ of a [[partially ordered set|0QV2JS9RJ3]] (poset) is an element of $S$ that is greater than every other element of $S$. The term **least element** is defined dually, that is, it is an element of $S$ that is smaller than every other element of $S.$\n",
  "commit": "1696dfa6ac9eeb239262bb8121a4817855ba7e8d",
  "front": {
    "aliases": [
      "bottom-element",
      "greatest-and-least-elements",
      "largest-element",
      "largest-member",
      "least-and-greatest-elements",
      "lowest-element",
      "top-element"
    ],
    "inventory": [
      "8PBMB3RTGB"
    ],
    "kind": "concept",
    "name": "Greatest element and least element",
    "same_as": {
      "wikidata": "Q1196892",
      "wikipedia": "Greatest element and least element"
    },
    "sources": [
      {
        "locator": "Greatest element and least element",
        "mention": "wikipedia://en/663041",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:663041@r1320031333"
      }
    ],
    "tag": "M3VR2FMG97"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/M3VR2FMG97/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/M3VR2FMG97.md",
  "msc": null,
  "name": "Greatest element and least element",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/M3V/M3VR2FMG97.md",
  "status": null,
  "tag": "M3VR2FMG97",
  "uri": "m2://M3VR2FMG97",
  "url": "https://math2.tamnd.com/wiki/greatest-element-and-least-element/",
  "writing": {
    "tag": "M3VR2FMG97",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}
