{
  "id": "hasse-diagram",
  "title": "Hasse Diagram",
  "lang": "en",
  "source_lang": "en",
  "summary": "A Hasse diagram represents a partially ordered set by drawing only its immediate order relations, with greater elements placed above smaller ones.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Order diagram",
    "Poset diagram"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/hasse-diagram/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/hasse-diagram/",
      "json": "https://aiwiki.page/zh/hasse-diagram.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A Hasse diagram is a graphical representation of a partially ordered set, or poset, in which elements are shown as vertices and immediate order relations are shown as upward connections. Relations that follow by transitivity are omitted, as are the reflexive relations connecting each element to itself. For a finite poset, the entire order can be recovered from the diagram by following upward paths. Named after the German mathematician Helmut Hasse, these diagrams are widely used in order theory, combinatorics, and abstract algebra."
    },
    {
      "heading": "Definition",
      "text": "A partially ordered set consists of a set \\(P\\) and a binary relation \\(\\leq\\) that is reflexive, antisymmetric, and transitive. Write \\(x<y\\) when \\(x\\leq y\\) and \\(x\\neq y\\).\n\nAn element \\(y\\) covers an element \\(x\\), written \\(x\\lessdot y\\), if\n\n\\[x<y \\quad\\text{and there is no }z\\in P\\text{ such that }x<z<y.\\]\n\nThus, a cover is an immediate step in the order, not necessarily an immediate step in a numerical scale.\n\nA Hasse diagram is drawn according to three conventions:\n\n- Each element of \\(P\\) is represented by a vertex.\n- A connection is drawn between \\(x\\) and \\(y\\) exactly when \\(y\\) covers \\(x\\).\n- If \\(y\\) covers \\(x\\), then \\(y\\) is placed higher than \\(x\\).\n\nConnections are commonly straight line segments, although upward curves may also be used. Arrowheads are unnecessary because the upward direction indicates increasing order.\n\nFor a finite poset,\n\n\\[x\\leq y \\quad\\Longleftrightarrow\\quad x=y\\text{ or there is an upward path from }x\\text{ to }y.\\]\n\nThe word upward is essential: a path that alternates between upward and downward steps does not establish an order relation between its endpoints."
    },
    {
      "heading": "Reading a diagram",
      "text": "The vertical placement of vertices supports the drawing convention, but height alone does not determine comparability. One vertex may lie above another without an upward path connecting them.\n\nSeveral important order-theoretic features can be read from a finite Hasse diagram:\n\n- A minimal element has no element strictly below it; it has no downward cover connection.\n- A maximal element has no element strictly above it; it has no upward cover connection.\n- A least element lies below every element.\n- A greatest element lies above every element.\n\nMinimal and least are not interchangeable. A poset can have several minimal elements, but it can have at most one least element. The corresponding distinction holds between maximal and greatest elements.\n\nA chain is a subset whose elements are pairwise comparable. An antichain is a subset whose distinct elements are pairwise incomparable. Vertices placed on the same horizontal level are necessarily incomparable under the usual upward drawing convention, but an antichain need not be drawn on a single level.\n\nCrossing lines do not indicate an additional element or connection unless a vertex is explicitly marked at the crossing."
    },
    {
      "heading": "Examples",
      "text": "A finite total order\n\nFor the set \\(\\{1,2,3,4\\}\\) with its ordinary numerical order, the diagram is a vertical chain:\n\n4\n|\n3\n|\n2\n|\n1\n\nOnly consecutive elements are connected. Although \\(1<3\\) and \\(1<4\\), those relations already follow from upward paths and therefore receive no separate edges.\n\nSubsets ordered by inclusion\n\nConsider the power set of \\(\\{a,b\\}\\), ordered by set inclusion:\n\n    {a,b}\n     / \\\n   {a} {b}\n     \\ /\n      ∅\n\nThe bottom vertex is the empty set, and the top vertex is \\(\\{a,b\\}\\). The sets \\(\\{a\\}\\) and \\(\\{b\\}\\) are incomparable.\n\nMore generally, for subsets of a finite set, \\(B\\) covers \\(A\\) precisely when \\(B\\) is obtained from \\(A\\) by adding one element. Subsets are therefore naturally arranged in levels according to their cardinality. This order forms a finite Boolean algebra.\n\nDivisibility\n\nLet\n\n\\[P=\\{1,2,3,6,12\\},\\]\n\nwith \\(a\\leq b\\) defined to mean that \\(a\\) divides \\(b\\). Its cover relations are\n\n\\[1\\lessdot2,\\qquad 1\\lessdot3,\\qquad 2\\lessdot6,\\qquad 3\\lessdot6,\\qquad 6\\lessdot12.\\]\n\nHere \\(2\\) and \\(3\\) are incomparable even though \\(2<3\\) in the ordinary numerical order. The relation represented is divisibility, not numerical magnitude.\n\nCover relations also depend on the underlying set. Within this \\(P\\), \\(12\\) covers \\(6\\). Within the smaller divisibility poset \\(\\{1,12\\}\\), \\(12\\) covers \\(1\\), because no intermediate element belongs to that poset."
    },
    {
      "heading": "Connection with directed graphs",
      "text": "Orienting every connection upward produces a directed acyclic graph. A directed cycle would contradict the strict increase required along each edge.\n\nFor a finite poset, the directed cover graph is the transitive reduction of the directed graph containing an edge \\(x\\to y\\) for every strict relation \\(x<y\\). Transitive reduction removes edges whose reachability is already supplied by longer directed paths. For finite directed acyclic graphs, this reduction is unique.\n\nConversely, any finite directed acyclic graph defines a partial order by reachability, together with equality. However, the graph is itself a Hasse diagram only after redundant edges have been removed and its vertices have been arranged consistently with the order.\n\nThe underlying undirected graph alone generally does not determine the poset. The upward orientation is part of the information conveyed by a Hasse diagram."
    },
    {
      "heading": "Lattices and algebraic applications",
      "text": "A lattice is a poset in which every pair \\(x,y\\) has a greatest lower bound, called its meet \\(x\\wedge y\\), and a least upper bound, called its join \\(x\\vee y\\).\n\nIn a Hasse diagram, common upper bounds are vertices reachable upward from both elements. Their join, when it exists, is the least such upper bound. The meet is defined dually using common lower bounds. These are order-theoretic properties, not measurements of geometric distance in the drawing.\n\nFor the subset example,\n\n\\[A\\wedge B=A\\cap B, \\qquad A\\vee B=A\\cup B.\\]\n\nFor the positive divisors of a fixed positive integer, ordered by divisibility, the meet is the greatest common divisor and the join is the least common multiple.\n\nOther important uses include displaying subgroup inclusion in group theory, inclusion among ideals in ring theory, and refinement relations among set partitions. Such diagrams can reveal intermediate structures and whether particular elements are comparable."
    },
    {
      "heading": "Construction and layout",
      "text": "For a finite poset whose full order relation is known, a direct construction examines every strict pair \\(x<y\\). The pair is retained as an edge only if there is no \\(z\\) satisfying\n\n\\[x<z<y.\\]\n\nA straightforward implementation uses \\(O(n^3)\\) time for \\(n\\) elements when individual order tests take constant time. Other methods can exploit graph structure or a more compact representation of the order.\n\nOnce the cover relations are established, a layout must place every upper endpoint above its lower endpoint. Different drawings can represent exactly the same poset: horizontal positions, edge lengths, and angles are normally not mathematical data.\n\nSome posets admit a rank function that increases by one along every cover relation, allowing vertices to be placed in natural horizontal layers. Not every finite poset admits such a ranking. Nevertheless, every finite poset can be drawn with all cover edges directed upward.\n\nAvoiding edge crossings is a separate problem. A Hasse diagram may require crossings, and planarity of its underlying undirected graph does not by itself guarantee a crossing-free drawing that also respects the upward order."
    },
    {
      "heading": "Infinite posets and limitations",
      "text": "The cover relation exists for infinite posets as well, but it need not determine the entire order.\n\nFor example, the integers under their usual order form an infinite chain in which \\(n+1\\) covers \\(n\\). Every strict comparison can still be represented by a finite sequence of cover steps.\n\nBy contrast, the rational numbers under their usual order have no cover relations: whenever \\(x<y\\), another rational number lies strictly between them. A graph showing only covers would therefore contain no edges despite the order being total.\n\nThus, the familiar recovery rule using finite upward paths always works for finite posets, but requires additional conditions in infinite cases. It holds, for example, when every interval\n\n\\[[x,y]=\\{z\\in P:x\\leq z\\leq y\\}\\]\n\nis finite.\n\nEven for finite orders, large diagrams can become difficult to interpret. They are effective representations of immediate order structure, but their usefulness depends on size, labeling, and layout."
    }
  ],
  "links": [
    "partial-order",
    "combinatorics",
    "abstract-algebra",
    "binary-relation",
    "power-set",
    "subset",
    "empty-set",
    "boolean-algebra",
    "directed-acyclic-graph",
    "greatest-common-divisor",
    "group-theory",
    "ring-mathematics",
    "set-partition",
    "integer",
    "rational-number"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}