Sublattices of lattices of order-convex sets. I: The main representation theorem (Q1882895)

Given a partially ordered set \(P\), a subset \(S \subseteq P\) is said to be order-convex if whenever \(x, z \in S\), \(y \in P\), and \(x \leq y \leq z\), one has \(y \in S\). The collection of such subsets of \(P\) partially ordered by inclusion is the lattice of order-convex subsets of \(P\), denoted by Co\((P)\). It is shown that the lattices \(L\) for which there exists a partially ordered set \(P\) such that \(L\) is a sublattice of Co\((P)\) are precisely the lattices satisfying three lattice identities. These identities are introduced in this paper and denoted (S), (U), and (B). Additionally, it is shown that for any finite lattice satisfying (S), (U), and (B) there exists a finite partially ordered set \(P\) such that \(L\) is a sublattice of Co\((P)\); and a quadratic bound for the minimum cardinality of such a \(P\) in terms of the number of join-irreducible elements of \(L\) is given. Certain other special properties that the poset \(P\) may have are described. For example, it is shown that if \(P\) does not have as a sublattice any ``crown'', then Co\((P)\) satisfies a certain quasi-identity, which is given. For Part II see Int. J. Algebra Comput. 13, 543--564 (2003; Zbl 1053.06005).