{
  "aliases": [
    "least-upper-bound",
    "sup"
  ],
  "backlinks": [
    {
      "field": "uses",
      "target": "0565DC8RMK"
    },
    {
      "field": "uses",
      "target": "3TNVVAA1AG"
    },
    {
      "field": "uses",
      "target": "9D26WKTFPT"
    },
    {
      "field": "uses",
      "target": "9EABA9ZDZS"
    },
    {
      "field": "uses",
      "target": "9EE43J2W16"
    },
    {
      "field": "uses",
      "target": "A5D94C38HZ"
    },
    {
      "field": "uses",
      "target": "B1X92F7SJ6"
    },
    {
      "field": "uses",
      "target": "BD1CNVV5P0"
    },
    {
      "field": "uses",
      "target": "DDAHG7QRY8"
    },
    {
      "field": "uses",
      "target": "DQEW4MSD5H"
    },
    {
      "field": "uses",
      "target": "E9C6XXX0EE"
    },
    {
      "field": "uses",
      "target": "EGWG9RKDBQ"
    },
    {
      "field": "uses",
      "target": "F7YV441H6R"
    },
    {
      "field": "uses",
      "target": "FCSBB1HAHH"
    },
    {
      "field": "uses",
      "target": "HD8CK28AJC"
    },
    {
      "field": "uses",
      "target": "HSYGHAY6WE"
    },
    {
      "field": "uses",
      "target": "K2KQFX4GVF"
    },
    {
      "field": "uses",
      "target": "KR1F39C0SP"
    },
    {
      "field": "uses",
      "target": "MCDP25YMSE"
    },
    {
      "field": "uses",
      "target": "MV7ADC2DEH"
    },
    {
      "field": "uses",
      "target": "N2Q4RS43FD"
    },
    {
      "field": "uses",
      "target": "QSH01NSVXN"
    },
    {
      "field": "uses",
      "target": "RHXP3HA64M"
    },
    {
      "field": "uses",
      "target": "SYXSZD8EFK"
    },
    {
      "field": "uses",
      "target": "TAHM74ZNWB"
    },
    {
      "field": "uses",
      "target": "TMBCW25DZ4"
    },
    {
      "field": "uses",
      "target": "WH3Z5M5D2R"
    },
    {
      "field": "uses",
      "target": "ZDNBCXDGTA"
    },
    {
      "field": "defines",
      "target": "0BTMQ04556"
    }
  ],
  "body": "\n## Summary\n\nThe supremum of a set is its least upper bound.\nIt is an upper bound of the set that is less than or equal to every other upper bound.\nA set can have a supremum that is not an element of the set.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "aliases": [
      "least-upper-bound",
      "sup"
    ],
    "kind": "concept",
    "msc": [
      "06A06"
    ],
    "name": "Supremum",
    "sources": [
      {
        "locator": "Formal definition",
        "url": "https://en.wikipedia.org/wiki/Infimum_and_supremum"
      }
    ],
    "specializes": [
      "0S60DVMVPN"
    ],
    "tag": "0R3H5PANRQ"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0R3H5PANRQ/",
  "links": [
    {
      "field": "specializes",
      "target": "0S60DVMVPN"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0R3H5PANRQ.md",
  "msc": [
    "06A06"
  ],
  "name": "Supremum",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0R3/0R3H5PANRQ.md",
  "status": null,
  "tag": "0R3H5PANRQ",
  "uri": "m2://0R3H5PANRQ",
  "url": "https://tamnd.github.io/math2/wiki/supremum/",
  "writing": {
    "tag": "0R3H5PANRQ",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}