Lattices freely generated by an order and preserving certain bounds (Q412015): Difference between revisions

The paper presents a description of a lattice freely generated by a given partially ordered set \(Q\), preserving chosen (finite) meets and joins. The elements of this lattice can be expressed by lattice terms with variables from \(Q\). The order relation between such terms is determined by a recursive algorithm with five basic rules: four of them are the well-known Whitman conditions, while the last one uses special ideals and filters, called upper and lower covers. This construction was presented by \textit{R. A. Dean} [Can. J. Math. 16, 136--148 (1964; Zbl 0122.25801)]. The contribution of the present paper lies in a simpler and more natural proof, especially the use of upper and lower covers.