Sublattices of product spaces: Hulls, representations and counting

The Cartesian product of lattices is a lattice, called a product space, with componentwise meet and join operations. A sublattice of a lattice L is a subset closed for the join and meet operations of L. The sublattice hull  LQLQ of a subset Q of a lattice is the smallest sublattice containing Q. We consider two types of representations of sublattices and sublattice hulls in product spaces: representation by projections and representation with proper boundary epigraphs. We give sufficient conditions, on the dimension of the product space and/or on the sublattice hull of a subset Q  , for LQLQ to be entirely defined by the sublattice hulls of the two-dimensional projections of Q  . This extends results of Topkis (1978) and of Veinott [Representation of general and polyhedral subsemilattices and sublattices of product spaces, Linear Algebra Appl. 114/115 (1989) 681–704]. We give similar sufficient conditions for the sublattice hull LQLQ to be representable using the epigraphs of certain isotone (i.e., nondecreasing) functions defined on the one-dimensional projections of Q  . This also extends results of Topkis and Veinott. Using this representation we show that LQLQ is convex when Q is a convex subset in a vector lattice (Riesz space), and is a polyhedron when Q   is a polyhedron in RnRn.We consider in greater detail the case of a finite product of finite chains (i.e., totally ordered sets). We use the representation with proper boundary epigraphs and provide upper and lower bounds on the number of sublattices, giving a partial answer to a problem posed by Birkhoff in 1937. These bounds are close to each other in a logarithmic sense. We define a corner representation of isotone functions and use it in conjunction with the representation with proper boundary epigraphs to define an encoding of sublattices. We show that this encoding is optimal (up to a constant factor) in terms of memory space. We also consider the sublattice hull membership problem   of deciding whether a given point is in the sublattice hull LQLQ of a given subset Q. We present a good characterization   and a polynomial time algorithm for this sublattice hull membership problem. We construct in polynomial time a data structure for the representation with proper boundary epigraphs, such that sublattice hull membership queries may be answered in time logarithmic in the size |Q||Q| of the given subset.