{
  "id": "enwiki-001360404056",
  "slug": "partially-ordered-set",
  "title": "Partially ordered set",
  "qid": "",
  "lead": "In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\\leq) consisting of a set X (called the ground set of P ) and a partial order \\leq on X . When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset.",
  "body": "In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\\leq) consisting of a set X (called the ground set of P ) and a partial order \\leq on X . When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Antisymmetry: if a \\leq b and b \\leq a then a = b , i.e. no two distinct elements precede each other. Transitivity: if a \\leq b and b \\leq c then a \\leq c . A non-strict partial order is also known as an antisymmetric preorder. Strict and non-strict partial orders on a set P are closely related. A non-strict partial order \\leq may be converted to a strict partial order by removing all relationships of the form a \\leq a; that is, the strict partial order is the set where \\Delta_P := \\{ (p, p) : p \\in P \\} is the identity relation on P \\times P and \\;\\setminus\\; denotes set subtraction. Conversely, a strict partial order P may be converted to a non-strict partial order by adjoining all relationships of that form; that is, \\leq\\; := \\;\\Delta_P\\; \\cup \\; is a non-strict partial order. Thus, if \\leq is a non-strict partial order, then the corresponding strict partial order a Conversely, if \\leq is the reflexive closure given by: a \\leq b \\text{ if } a Another way of defining a partial order, found in computer science, is via a notion of comparison. Specifically, given \\leq, as defined previously, it can be observed that two elements x and y may stand in any of four mutually exclusive relationships to each other: either , or , or , or x and y are incomparable. This can be represented by a function \\text{compare}: P \\times P \\to \\{ ,=,\\vert \\} that returns one of four codes when given two elements. This definition is equivalent to a partial order on a setoid, where equality is taken to be a defined equivalence relation rather than set equality. Wallis defines a more general notion of a partial order relation as any homogeneous relation that is transitive and antisymmetric. This includes both reflexive and irreflexive partial orders as subtypes. A finite poset can be visualized through its Hasse diagram. Specifically, taking a strict partial order relation (P, , a directed acyclic graph (DAG) may be constructed by taking each element of P to be a node and each element of to be an edge. The transitive reduction of this DAG is then the Hasse diagram. Similarly this process can be reversed to construct strict partial orders from certain DAGs. In contrast, the graph associated to a non-strict partial order has self-loops at every node and therefore is not a DAG; when a non-strict order is said to be depicted by a Hasse diagram, actually the corresponding strict order is shown. In the latter case, is necessarily injective, since f(x) = f(y) implies x \\leq y \\text{ and } y \\leq x and in turn x = y according to the antisymmetry of \\leq. If an order-embedding between two posets S and T exists, one says that S can be embedded into T. If an order-embedding f : S \\to T is bijective, it is called an order isomorphism, and the partial orders and are said to be isomorphic. Isomorphic orders have structurally similar Hasse diagrams (see Fig.&nbsp;7a). It can be shown that if order-preserving maps f : S \\to T and g : T \\to U exist such that g \\circ f and f \\circ g yields the identity function on S and T, respectively, then S and T are order-isomorphic. For example, a mapping f : \\N \\to \\mathbb{P}(\\N) from the set of natural numbers (ordered by divisibility) to the power set of natural numbers (ordered by set inclusion) can be defined by taking each number to the set of its prime divisors. It is order-preserving: if divides , then each prime divisor of is also a prime divisor of . However, it is neither injective (since it maps both 12 and 6 to \\{2, 3\\} ) nor order-reflecting (since 12 does not divide 6). Taking instead each number to the set of its prime power divisors defines a map g : \\N \\to \\mathbb{P}(\\N) that is order-preserving, order-reflecting, and hence an order-embedding. It is not an order-isomorphism (since it, for instance, does not map any number to the set \\{4\\} ), but it can be made one by restricting its codomain to g(\\N). Fig.&nbsp;7b shows a subset of \\N and its isomorphic image under . The construction of such an order-isomorphism into a power set can be generalized to a wide class of partial orders, called distributive lattices; see Birkhoff's representation theorem. A poset P^*=(X^*, \\leq^*) is called a subposet of another poset P=(X, \\leq) provided that X^* is a subset of X and \\leq^* is a subset of \\leq . The latter condition is equivalent to the requirement that for any x and y in X^* (and thus also in X ), if x \\leq^* y then x \\leq y . If P^* is a subposet of P and furthermore, for all x and y in X^* , whenever x \\leq y we also have x \\leq^* y , then we call P^* the subposet of P induced by X^* , and write P^* = P[X^*] . Every poset (and every preordered set) may be considered as a category where, for objects x and y, there is at most one morphism from x to y. More explicitly, let if (and otherwise the empty set) and (y, z) \\circ (x, y) = (x, z). Such categories are sometimes called thin. Posets are equivalent to one another if and only if they are isomorphic. In a poset, the smallest element, if it exists, is an initial object, and the largest element, if it exists, is a terminal object. Also, every preordered set is equivalent to a poset. Finally, every subcategory of a poset is isomorphism-closed. If P is a partially ordered set that has also been given the structure of a topological space, then it is customary to assume that \\{ (a,b) : a \\le b \\} is a closed subset of the topological product space P \\times P. Under this assumption partial order relations are well behaved at limits in the sense that if \\lim_{i \\to \\infty} a_i = a, and \\lim_{i \\to \\infty} b_i = b, and for all i, a_i \\leq b_i, then a \\leq b. Using the interval notation, the property \"a is covered by b\" can be rephrased equivalently as [a, b] = \\{a, b\\}. This concept of an interval in a partial order should not be confused with the particular class of partial orders known as the interval orders.",
  "categories": [
    "115986874",
    "20351862",
    "23118434",
    "23603337",
    "28269685",
    "29264832",
    "44446176",
    "81199107"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1360404056",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1782021476.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001360404056",
    "type": "webpage",
    "title": "Partially ordered set",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/partially-ordered-set",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001360404056",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1360404056",
    "note": "Immutable snapshot enwiki-001360404056"
  }
}