Order polytope

In mathematics, the order polytope of a finite partially ordered set is a convex polytope defined from the set. The points of the order polytope are the monotonic functions from the given set to the unit interval, its vertices correspond to the upper sets of the partial order, and its dimension is the number of elements in the partial order. The order polytope is a distributive polytope, meaning that coordinatewise minima and maxima of pairs of its points remain within the polytope.

The order polytope of a partial order should be distinguished from the linear ordering polytope, a polytope defined from a number ${\displaystyle n}$ as the convex hull of indicator vectors of the sets of edges of ${\displaystyle n}$-vertex transitive tournaments. ^[1]

Definition and example

A partially ordered set is a pair ${\displaystyle (S,\leq )}$ where ${\displaystyle S}$ is an arbitrary set and ${\displaystyle \leq }$ is a binary relation on pairs of elements of ${\displaystyle S}$ that is reflexive (for all ${\displaystyle x\in S}$, ${\displaystyle x\leq x}$), antisymmetric (for all ${\displaystyle x,y\in S}$ with ${\displaystyle x\neq y}$ at most one of ${\displaystyle x\leq y}$ and ${\displaystyle y\leq x}$ can be true), and transitive (for all ${\displaystyle x,y,z\in S}$, if ${\displaystyle x\leq y}$ and ${\displaystyle y\leq z}$ then ${\displaystyle x\leq z}$).

A partially ordered set ${\displaystyle (S,\leq )}$ is said to be finite when ${\displaystyle S}$ is a finite set. In this case, the collection of all functions ${\displaystyle f}$ that map ${\displaystyle S}$ to the real numbers forms a finite-dimensional vector space, with pointwise addition of functions as the vector sum operation. The dimension of the space is just the number of elements of ${\displaystyle S}$. The order polytope is defined to be the subset of this space consisting of functions ${\displaystyle f}$ with the following two properties: ^{[2] [3]}

• For every ${\displaystyle x\in S}$, ${\displaystyle 0\leq f(x)\leq 1}$. That is, ${\displaystyle f}$ maps the elements of ${\displaystyle S}$ to the unit interval.
• For every ${\displaystyle x,y\in S}$ with ${\displaystyle x\leq y}$, ${\displaystyle f(x)\leq f(y)}$. That is, ${\displaystyle f}$ is a monotonic function

For example, for a partially ordered set consisting of two elements ${\displaystyle x}$ and ${\displaystyle y}$, with ${\displaystyle x\leq y}$ in the partial order, the functions ${\displaystyle f}$ from these points to real numbers can be identified with points ${\displaystyle (f(x),f(y))}$ in the Cartesian plane. For this example, the order polytope consists of all points in the ${\displaystyle (x,y)}$-plane with ${\displaystyle 0\leq x\leq y\leq 1}$. This is an isosceles right triangle with vertices at (0,0), (0,1), and (1,1).

Vertices and facets

The vertices of the order polytope consist of monotonic functions from ${\displaystyle S}$ to ${\displaystyle \{0,1\}}$. That is, the order polytope is an integral polytope; it has no vertices with fractional coordinates. These functions are exactly the indicator functions of upper sets of the partial order. Therefore, the number of vertices equals the number of upper sets. ^[2]

The facets of the order polytope are of three types: ^[2]

• Inequalities ${\displaystyle 0\leq f(x)}$ for each minimal element ${\displaystyle x}$ of the partially ordered set,
• Inequalities ${\displaystyle f(y)\leq 1}$ for each maximal element ${\displaystyle y}$ of the partially ordered set, and
• Inequalities ${\displaystyle f(x)\leq f(y)}$ for each two distinct elements ${\displaystyle x,y}$ that do not have a third distinct element ${\displaystyle z}$ between them; that is, for each pair ${\displaystyle (x,y)}$ in the covering relation of the partially ordered set.

The facets can be considered in a more symmetric way by introducing special elements ${\displaystyle \bot }$ below all elements in the partial order and ${\displaystyle \top }$ above all elements, mapped by ${\displaystyle f}$ to 0 and 1 respectively, and keeping only inequalities of the third type for the resulting augmented partially ordered set. ^[2]

More generally, with the same augmentation by ${\displaystyle \bot }$ and ${\displaystyle \top }$, the faces of all dimensions of the order polytope correspond 1-to-1 with quotients of the partial order. Each face is congruent to the order polytope of the corresponding quotient partial order. ^[2]

Volume and Ehrhart polynomial

The order polytope of a linear order is a special type of simplex called an order simplex or orthoscheme. Each point of the unit cube whose coordinates are all distinct lies in a unique one of these orthoschemes, the order simplex for the linear order of its coordinates. Because these order simplices are all congruent to each other and (for orders on ${\displaystyle n}$ elements) there are ${\displaystyle n!}$ different linear orders, the volume of each order simplex is ${\displaystyle 1/n!}$. ^{[2] [3]} More generally, an order polytope can be partitioned into order simplices in a canonical way, with one simplex for each linear extension of the corresponding partially ordered set. ^[2] Therefore, the volume of any order polytope is ${\displaystyle 1/n!}$ multiplied by the number of linear extensions of the corresponding partially ordered set. ^{[2] [3]} This connection between the number of linear extensions and volume can be used to approximate the number of linear extensions of any partial order efficiently (despite the fact that computing this number exactly is #P-complete) by applying a randomized polynomial-time approximation scheme for polytope volume. ^[4]

The Ehrhart polynomial of the order polytope is a polynomial whose values at integer values ${\displaystyle x}$ give the number of integer points in a copy of the polytope scaled by a factor of ${\displaystyle x}$. For the order polytope, the Ehrhart polynomial equals (after a minor change of variables) the order polynomial of the corresponding partially ordered set. This polynomial encodes several pieces of information about the polytope including its volume (the leading coefficient of the polynomial and its number of vertices (the sum of coefficients). ^{[2] [3]}

Continuous lattice

By Birkhoff's representation theorem for finite distributive lattices, the upper sets of any partially ordered set form a finite distributive lattice, and every finite distributive lattice can be represented in this way. ^[5] The upper sets correspond to the vertices of the order polytope, so the mapping from upper sets to vertices provides a geometric representation of any finite distributive lattice. Under this representation, the edges of the polytope connect comparable elements of the lattice.

If two functions ${\displaystyle p}$ and ${\displaystyle q}$ both belong to the order polytope of a partially ordered set ${\displaystyle (S,\leq )}$, then the function ${\displaystyle p\wedge q}$ that maps ${\displaystyle x}$ to ${\displaystyle \min(p(x),q(x))}$, and the function ${\displaystyle p\vee q}$ that maps ${\displaystyle x}$ to ${\displaystyle \max(p(x),q(x))}$ both also belong to the order polytope. The two operations ${\displaystyle \wedge }$ and ${\displaystyle \vee }$ give the order polytope the structure of a continuous distributive lattice, within which the finite distributive lattice of Birkhoff's theorem is embedded. That is, every order polytope is a distributive polytope. The distributive polytopes with all vertex coordinates equal to 0 or 1 are exactly the order polytopes. ^[6]

References

1. Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard (1985), "Facets of the linear ordering polytope", Mathematical Programming , 33 (1): 43–60, doi:10.1007/BF01582010, MR   0809748, S2CID   21071064
2. Stanley, Richard P. (1986), "Two poset polytopes", Discrete & Computational Geometry , 1 (1): 9–23, doi: 10.1007/BF02187680 , MR   0824105
3. Stanley, Richard (2011), Enumerative Combinatorics, Volume 1, second edition, version of 15 July 2011 (PDF), pp. 571–572, 645
4. Brightwell, Graham; Winkler, Peter (1991), "Counting linear extensions", Order , 8 (3): 225–242, doi:10.1007/BF00383444, MR   1154926, S2CID   119697949
5. Birkhoff, Garrett (1937), "Rings of sets", Duke Mathematical Journal, 3 (3): 443–454, doi:10.1215/S0012-7094-37-00334-X
6. Felsner, Stefan; Knauer, Kolja (2011), "Distributive lattices, polyhedra, and generalized flows", European Journal of Combinatorics, 32 (1): 45–59, doi: 10.1016/j.ejc.2010.07.011 , MR   2727459 . See in particular Remark 11, p. 53.