Ranked partially ordered set Created 2026-10-20 Updated 2026-11-05
A ranked partially ordered set has an integer-valued rank function of a partially ordered set that increases by one whenever covers , meaning with no element strictly between them. For finite orders with minimal elements, one commonly normalizes every minimal element to rank zero. Conventions about requiring all maximal chains to have the same length should be stated separately.
In the Boolean lattice, : a covering step adds one element. In the positive divisors of ordered by divisibility, is the number of prime factors counted with multiplicity. Rank levels organize an order into layers and allow questions about its Sperner property.
Sperner property Created 2026-10-20 Updated 2026-11-05
A finite ranked partially ordered set has the Sperner property if its largest antichain has the same size as its largest rank level. Each level is already an antichain, so the property says that mixing different ranks cannot produce a larger one.
The Boolean lattice of all subsets of an -element set, ordered by inclusion and ranked by subset size, has this property by Sperner's theorem. Its largest antichain has size . For , the three singletons form a largest antichain. General ranked orders need not have the property, making it a substantive extremal condition.