{
  "aliases": [
    "order-diagram"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nA Hasse diagram is a drawing of a finite [[partially ordered set|011C29Q1S1]].\nEach element is a point, and there is a line upward from $a$ to $b$ when $b$ covers $a$.\nThis means that $a \u003c b$ and no $c$ satisfies $a \u003c c \u003c b$.\nThen $a \\le b$ exactly when one can go from $a$ to $b$ by a path that goes only upward.\n\n## Remarks\n\nThe diagram does not draw the loops of reflexivity or the lines that transitivity implies.\nThe Hasse diagram of the power set of $\\{1, 2, 3\\}$ under $\\subseteq$ is the picture of a cube.\n\n## Explanations\n\n### L1 human\n\nA Hasse diagram is a minimal picture of an order.\nFor the divisors of $12$ under divisibility, put $1$ at the bottom and $12$ at the top.\nDraw a line from $2$ to $4$ and from $2$ to $6$.\nDo not draw a line from $2$ to $12$, because the path through $4$ already shows it.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "aliases": [
      "order-diagram"
    ],
    "kind": "concept",
    "msc": [
      "06A06"
    ],
    "name": "Hasse diagram",
    "same_as": {
      "wikidata": "Q901446",
      "wikipedia": "Hasse diagram"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Hasse_diagram"
      }
    ],
    "tag": "00EYM7MDKS",
    "uses": [
      "011C29Q1S1"
    ]
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/00EYM7MDKS/",
  "links": [
    {
      "field": "uses",
      "target": "011C29Q1S1"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/00EYM7MDKS.md",
  "msc": [
    "06A06"
  ],
  "name": "Hasse diagram",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/00E/00EYM7MDKS.md",
  "status": null,
  "tag": "00EYM7MDKS",
  "uri": "m2://00EYM7MDKS",
  "url": "https://math2.tamnd.com/wiki/hasse-diagram/",
  "writing": {
    "tag": "00EYM7MDKS",
    "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
      }
    ]
  }
}