{
  "aliases": null,
  "backlinks": [
    {
      "field": "about",
      "target": "2PYAZX5VD4"
    },
    {
      "field": "about",
      "target": "5DFMMGGD9Y"
    },
    {
      "field": "about",
      "target": "D39NBQH3H6"
    },
    {
      "field": "about",
      "target": "PT67C5ANSD"
    },
    {
      "field": "about",
      "target": "YBNZWCG8AC"
    },
    {
      "field": "about",
      "target": "ZCDWXVMDFN"
    },
    {
      "field": "uses",
      "target": "2PYAZX5VD4"
    },
    {
      "field": "uses",
      "target": "4DRPG6VR70"
    },
    {
      "field": "uses",
      "target": "58MV5BK731"
    },
    {
      "field": "uses",
      "target": "5DFMMGGD9Y"
    },
    {
      "field": "uses",
      "target": "6F4JHFDM19"
    },
    {
      "field": "uses",
      "target": "7H0E1ZBWTB"
    },
    {
      "field": "uses",
      "target": "ATJXGC4KCG"
    },
    {
      "field": "uses",
      "target": "BETJYRCRJB"
    },
    {
      "field": "uses",
      "target": "BFV3MKCBHZ"
    },
    {
      "field": "uses",
      "target": "BH8R1M1KVF"
    },
    {
      "field": "uses",
      "target": "BTCXG67H69"
    },
    {
      "field": "uses",
      "target": "CCQ0QVJY4R"
    },
    {
      "field": "uses",
      "target": "D39NBQH3H6"
    },
    {
      "field": "uses",
      "target": "ET5G9CT0RC"
    },
    {
      "field": "uses",
      "target": "GQB3AS4WKQ"
    },
    {
      "field": "uses",
      "target": "H5DEZ7Q1A6"
    },
    {
      "field": "uses",
      "target": "HN5A4M2GE8"
    },
    {
      "field": "uses",
      "target": "KNP5ZEQ458"
    },
    {
      "field": "uses",
      "target": "KPNY26EKNP"
    },
    {
      "field": "uses",
      "target": "NHVQ6G3Z85"
    },
    {
      "field": "uses",
      "target": "PBYCBVG5CG"
    },
    {
      "field": "uses",
      "target": "PEDBPRSV9V"
    },
    {
      "field": "uses",
      "target": "PF5HS26Q0H"
    },
    {
      "field": "uses",
      "target": "PK3RPS6EF4"
    },
    {
      "field": "uses",
      "target": "PT67C5ANSD"
    },
    {
      "field": "uses",
      "target": "SJDZH6V0BC"
    },
    {
      "field": "uses",
      "target": "T06PG3RWC0"
    },
    {
      "field": "uses",
      "target": "TN1X6FNT87"
    },
    {
      "field": "uses",
      "target": "TQ2TZDMAPA"
    },
    {
      "field": "uses",
      "target": "V3RCQ1J2VV"
    },
    {
      "field": "uses",
      "target": "WRZA1VYGB6"
    },
    {
      "field": "uses",
      "target": "YBNZWCG8AC"
    },
    {
      "field": "uses",
      "target": "ZBVJ4B41AX"
    },
    {
      "field": "uses",
      "target": "ZCDWXVMDFN"
    },
    {
      "field": "instance_of",
      "target": "5DYYRZWER6"
    },
    {
      "field": "instance_of",
      "target": "ADEXY830S8"
    },
    {
      "field": "instance_of",
      "target": "P9PYM71GMM"
    },
    {
      "field": "instance_of",
      "target": "ZSA992C21V"
    },
    {
      "field": "specializes",
      "target": "7E6FXTGH2Y"
    },
    {
      "field": "specializes",
      "target": "9V4PR1RVXW"
    },
    {
      "field": "specializes",
      "target": "BZXHGNGQAX"
    },
    {
      "field": "specializes",
      "target": "F39N9NBFPZ"
    },
    {
      "field": "specializes",
      "target": "F60PD912D5"
    },
    {
      "field": "specializes",
      "target": "YVJ15PGKDM"
    },
    {
      "field": "specializes",
      "target": "Z5SA6A67KF"
    },
    {
      "field": "defines",
      "target": "XNTJTH6ACN"
    }
  ],
  "body": "\n## Summary\n\nA convex polytope is the [[convex hull|0FQSDC2EQ2]] of finitely many points of $\\R^n$.\nEquivalently, it is a bounded set cut out by finitely many linear inequalities.\nConvex polygons, convex polyhedra such as the cube and the regular tetrahedron, and their analogues in higher dimensions are convex polytopes.\nThey are the basic objects of polyhedral combinatorics and of linear programming, where the feasible region of a bounded problem is a convex polytope.\n\n## Explanations\n\n### L1 human\n\nHammer a few nails into a board and stretch a rubber band around them all: the region inside the band is a convex polygon.\nA convex polytope is the same idea in any dimension: the smallest convex set containing a finite list of points.\nIt has flat sides, straight edges and finitely many corners.\nFor example, the unit square is the convex hull of the four points $(0, 0)$, $(1, 0)$, $(0, 1)$ and $(1, 1)$.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "52B11"
    ],
    "name": "Convex polytope",
    "same_as": {
      "wikidata": "Q4129097",
      "wikipedia": "Convex polytope"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Convex_polytope"
      }
    ],
    "specializes": [
      "02AS45T3H9"
    ],
    "tag": "300K6CB1KH"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/300K6CB1KH/",
  "links": [
    {
      "field": "specializes",
      "target": "02AS45T3H9"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/300K6CB1KH.md",
  "msc": [
    "52B11"
  ],
  "name": "Convex polytope",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/300/300K6CB1KH.md",
  "status": null,
  "tag": "300K6CB1KH",
  "uri": "m2://300K6CB1KH",
  "url": "https://tamnd.github.io/math2/wiki/convex-polytope/",
  "writing": {
    "tag": "300K6CB1KH",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}