Search results
Results from the WOW.Com Content Network
In mathematics, a ranked poset is a partially ordered set in which one of the following (non-equivalent) conditions hold: it is a graded poset, or; a poset with the property that for every element x, all maximal chains among those with x as greatest element have the same finite length, or; a poset in which all maximal chains have the same ...
The rank is consistent with the covering relation of the ordering, meaning that for all x and y, if y covers x then ρ(y) = ρ(x) + 1. The value of the rank function for an element of the poset is called its rank. Sometimes a graded poset is called a ranked poset but that phrase has other meanings; see Ranked poset.
In this poset, 60 is an upper bound (though not a least upper bound) of the subset {,,,}, which does not have any lower bound (since 1 is not in the poset); on the other hand 2 is a lower bound of the subset of powers of 2, which does not have any upper bound. If the number 0 is included, this will be the greatest element, since this is a ...
Algebraic poset. A poset is algebraic if it has a base of compact elements. Antichain. An antichain is a poset in which no two elements are comparable, i.e., there are no two distinct elements x and y such that x ≤ y. In other words, the order relation of an antichain is just the identity relation. Approximates relation. See way-below relation.
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
For any poset, the set of all non-empty filters, ordered by subset inclusion, is a dcpo. Together with the empty filter it is also pointed. Together with the empty filter it is also pointed. If the order has binary meets , then this construction (including the empty filter) actually yields a complete lattice .
The poset of positive integers has deviation 0: every descending chain is finite, so the defining condition for deviation is vacuously true. However, its opposite poset has deviation 1. Let k be an algebraically closed field and consider the poset of ideals of the polynomial ring k[x] in one variable. Since the deviation of this poset is the ...
In mathematics, the poset topology associated to a poset (S, ≤) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of (S, ≤), ordered by inclusion. Let V be a set of vertices. An abstract simplicial complex Δ is a set of finite sets of vertices, known as faces , such that