Bimonotone linear inequalitites and sublattices of Rn

A bimonotone linear inequality is a linear inequality with at most two nonzero coefficients that are of opposite signs (if both different from zero). A linear inequality defines a halfspace that is a sublattice of Rn (a subset closed with respect to componentwise maximum and minimum) if and only if it is bimonotone. Veinott has shown that a polyhedron is a sublattice if and only if it can be defined by a finite system of bimonotone linear inequalities, whereas Topkis has shown that every sublattice of Rn (and of more general product lattices) is the solution set of a system of nonlinear bimonotone inequalities. In this paper we prove that a subset of Rn is the solution set of a countable system of bimonotone linear inequalities if and only if it is a closed convex sublattice. Similarly, we note that a subset of Rn is closed and convex if and only if it is the solution set of a countable system of linear inequalities. We also present necessary and/or sufficient conditions for a sublattice to be the intersection of the cartesian product of its projections on the coordinate axes with the solution set of a (possibly infinite) system of bimonotone linear inequalities. We provide explicit constructions of such systems of bimonotone linear inequalities under certain assumptions on the sublattice. We obtain Veinott’s polyhedral representation theorem and a 0–1 version of Birkhoff’s Representation Theorem as corollaries. We also point out a few potential pitfalls regarding properties of sublattices of Rn.