Affine complete distributive lattices

We prove a characterization theorem for affine complete distributive lattices. To do so we introduce the notions of almost principal ideal and almost principal.This research was supported by GA SAV Grant 362/93.     

Bigeneration in complete lattices and principal separation in ordered sets

By a recent observation of Monjardet and Wille, a finite distributive lattice is generated by its doubly irreducible elements iff the poset of all join-irreducible elements has a distributive MacNeille completion. This fact is generalized in several directions, by dropping the finiteness condition and considering various types of bigeneration via arbitrary meets and certain distinguished joins. This leads to a deeper investigation of so-called L-generators resp. C-subbases, translating well-known notions of topology to order theory. A strong relationship is established between bigeneration by (minimal) L-generators and so-called principal separation, which is defined in order-theoretical terms but may be regarded as a strong topological separation axiom. For suitable L, the complete lattices with a smallest join-dense L-subbasis consisting of L-primes are the L-completions of principally separated posets.     

Affine completions of distributive lattices

For any distributive lattice L we construct its extension ((L)) with the property that every isotone compatible function on L can be interpolated by a polynomial of ((L)). Further, we characterize all extensions with this property and show that our construction is in some sense the simplest possible.This research was supported by the GA SAV Grant 1230/95.     

On isotone functions with the Substitution Property in distributive lattices

A universal algebra isaffine complete if all functions satisfying the Substitution Property are polynomials (composed of the basic operations and the elements of the algebra). In 1962, the first author proved that a bounded distributive lattice is affine complete if and only if it does not contain a proper Boolean interval. Recently, M. Ploica generalized this result to arbitrary distributive lattices.In this paper, we introduce a class of functions on a latticeL, we call themID-polynomials, that derive from polynomials on the ideal lattice (resp., dual ideal lattice) ofL; they are isotone functions and satisfy the Substitution Property. We prove that for a distributive latticeL, all unary functions with the Substitution Property are ID-polynomials if and only ifL contains no proper Boolean interval.The research of the first author was supported by the NSERC of Canada. The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

Transversals of families in complete lattices,and torsion in product modules

Suppose L is a complete lattice containing no copy of the power-set 2 and no uncountable well-ordered chains. It is shown that for any family of nonempty subsets , one can choose elements p _i X _i so that _A p _i majorizes all elements of all but finitely many of the X _i . Ring-theoretic consequences are deduced: for instance, the direct product of a family of torsion modules over a commutative Noetherian integral domain R is torsion if and only if some element of R annihilates all but finitely many of the modules.     

Infinite independent sets in distributive lattices

We show that a poset P contains a subset isomorphic to if and only if the poset J(P) consisting of ideals of P contains a subset isomorphic to the power set of κ. If P is a join-semilattice this amounts to the fact that P contains an independent set of size κ. We show that if κ := ω and P is a distributive lattice, then this amounts to the fact that P contains either or as sublattices, where Γ and Δ are two special meet-semilattices already considered by J. D. Lawson, M. Mislove and H. A. Priestley.Dedicated to the memory of Ivan RivalReceived April 22, 2003; accepted in final form July 11, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Sublattices of complete lattices with continuity conditions

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice Id S of S is both algebraic and dually algebraic. Furthermore, if there are no infinite D-sequences in J(S), then Id S can be embedded into a direct product of finite lower bounded lattices. We also find a system of infinitary identities that characterize sublattices of complete, lower continuous, and join-semidistributive lattices. These conditions are satisfied by any (not necessarily finitely generated) lower bounded lattice and by any locally finite, join-semidistributive lattice. Furthermore, they imply M. Erné’s dual staircase distributivity.On the other hand, we prove that the subspace lattice of any infinite-dimensional vector space cannot be embedded into any ℵ₀-complete, ℵ₀-upper continuous, and ℵ₀-lower continuous lattice. A similar result holds for the lattice of all order-convex subsets of any infinite chain.Dedicated to the memory of Ivan RivalReceived April 4, 2003; accepted in final form June 16, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Binary hyperidentities of lattices

Summary An equational identity of a given type involves two kinds of symbols: individual variables and the operation symbols. For example, the distributive identity: x (y + z) = x y + x z has three variable symbols {x, y, z} and two operation symbols {+, }. Here the variables range over all the elements of the base set while the two operation symbols are fixed. However, we shall say that an identity ishypersatisfied by a varietyV if, whenever we also allow the operation symbols to range over all polynomials of appropriate arity, the resulting identities are all satisfied byV in the usual sense. For example, the ring of integers Z; +, satisfies the above distributive law, but it does not hypersatisfy the same formal law because, e.g., the identityx + (y z) = (x + y) (x + z) is not valid. By contrast, is hypersatisfied by the variety of all distributive lattices and is thus referred to as a distributive latticehyperidentity. Thus a hyperidentity may be viewed as an equational scheme for writing a class of identities of a given type and the original identities themselves are obtained as special cases by substituting specific polynomials of appropriate arity for the operation symbols in the scheme. In this paper, we provide afinite equational scheme which is a basis for the set of all binary lattice hyperidentities of type 2, 2, .This research was supported by the NSERC operating grant # 8215     

Congruence lattices of function lattices

Thefunction lattice L ^P is the lattice of all isotone maps from a posetP into a latticeL.D. Duffus, B. Jónsson, and I. Rival proved in 1978 that for afinite poset P, the congruence lattice ofL ^P is a direct power of the congruence lattice ofL; the exponent is |P|.This result fails for infiniteP. However, utilizing a generalization of theL ^P construction, theL[D] construction (the extension ofL byD, whereD is a bounded distributive lattice), the second author proved in 1979 that ConL[D] is isomorphic to (ConL) [ConD] for afinite lattice L.In this paper we prove that the isomorphism ConL[D](ConL)[ConD] holds for a latticeL and a bounded distributive latticeD iff either ConL orD is finite.The research of the first author was supported by the NSERC of Canada.The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

Many varieties of lattices with nonsurjective epimorphisms

We use dominions to show that many varieties of lattices have nonsurjective epimorphisms. The variety D of distributive lattices is treated in detail. We show that the dominion in D of a sublattice is the closure of M under relative complementation in L. This dominion is also the largest sublattice of L in which M is epimorphically embedded. In any variety of lattices larger than D, the dominion of M in L is just M. Received May 1, 2001; accepted in final form October 4, 2005.     

Join-semidistributive lattices and convex geometries

We introduce the notion of a convex geometry extending the notion of a finite closure system with the anti-exchange property known in combinatorics. This notion becomes essential for the different embedding results in the class of join-semidistributive lattices. In particular, we prove that every finite join-semidistributive lattice can be embedded into a lattice S_P(A) of algebraic subsets of a suitable algebraic lattice A. This latter construction, S_P(A), is a key example of a convex geometry that plays an analogous role in hierarchy of join-semidistributive lattices as a lattice of equivalence relations does in the class of modular lattices. We give numerous examples of convex geometries that emerge in different branches of mathematics from geometry to graph theory. We also discuss the introduced notion of a strong convex geometry that might promise the development of rich structural theory of convex geometries.     

Notes on locally order-polynomially complete lattices

No Abstract. .Dedicated to the memory of Ivan RivalReceived December 1, 2002; accepted in final form June 16, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Relative separation in distributive congruence lattices

In [5] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in Now we generalize these results using the concept of relatively separable sets (with respect to subsets) and apply them to some lattice varieties.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived November 29, 2002; accepted in final form August 19, 2004.     

Finite modular congruence lattices

We consider the variety of modular lattices generated by all finite lattices obtained by gluing together some M₃’s. We prove that every finite lattice in this variety is the congruence lattice of a suitable finite algebra (in fact, of an operator group). Received February 26, 2004; accepted in final form December 16, 2004.     

Remarks on Priestley duality for distributive lattices

The notion of a Priestley relation between Priestley spaces is introduced, and it is shown that there is a duality between the category of bounded distributive lattices and 0-preserving join-homomorphisms and the category of Priestley spaces and Priestley relations. When restricted to the category of bounded distributive lattices and 0-1-preserving homomorphisms, this duality yields essentially Priestley duality, and when restricted to the subcategory of Boolean algebras and 0-preserving join-homomorphisms, it coincides with the Halmos-Wright duality. It is also established a duality between 0-1-sublattices of a bounded distributive lattice and certain preorder relations on its Priestley space, which are called lattice preorders. This duality is a natural generalization of the Boolean case, and is strongly related to one considered by M. E. Adams. Connections between both kinds of dualities are studied, obtaining dualities for closure operators and quantifiers. Some results on the existence of homomorphisms lying between meet and join homomorphisms are given in the Appendix.     

Priestley duality for order-preserving maps into distributive lattices

The category of bounded distributive lattices with order-preserving maps is shown to be dually equivalent to the category of Priestley spaces with Priestley multirelations. The Priestley dual space of the ideal lattice L of a bounded distributive lattice L is described in terms of the dual space of L. A variant of the Nachbin-Stone-ech compactification is developed for bitopological and ordered spaces. Let X be a poset and Y an ordered space; X ^Y denotes the poset of continuous order-preserving maps from Y to X with the discrete topology. The Priestley dual of L ^P is determined, where P is a poset and L a bounded distributive lattice.     

Tensor products of contexts and complete lattices

Although the categoryCLC of complete lattices and complete homomorphisms does not possess arbitrary coproducts, we show that the tensor product introduced by Wille has the universal property of coproducts for so-called distributing families of morphisms (and only for these). As every family of morphisms into a completely distributive lattice is distributing, this includes the known fact that in the category of completely distributive lattices, arbitrary coproducts exist and coincide with the tensor products. Since the definition of tensor products is based on the notion of contexts and their concept lattices, many results on tensor products extend from complete lattices to contexts. Thus we introduce two kinds of tensor products for arbitrary families of contexts, a partial and a complete one, and establish universal properties of these tensor products.Presented by B. Jonsson.     

Tensorial decomposition of concept lattices

A tensor product for complete lattices is studied via concept lattices. A characterization as a universal solution and an ideal representation of the tensor products are given. In a large class of concept lattices which contains all finite ones, the subdirect decompositions of a tensor product can be determined by the subdirect decompositions of its factors. As a consequence, one obtains that the tensor product of completely subdirectly irreducible concept lattices of this class is again completely subdirectly irreducible. Finally, applications to conceptual measurement are discussed.Dedicated to Ernst-August Behrens on the occasion of his seventieth birthday.     

Planar lattices are lexicographically shellable

The special properties of planar posets have been studied, particularly in the 1970's by I. Rival and others. More recently, the connection between posets, their corresponding polynomial rings and corresponding simplicial complexes has been studied by Stanley and others. This paper, using work of Björner, provides a connection between the two bodies of work, by characterizing when planar posets are Cohen-Macaulay. Planar posets are lattices when they contain a greatest and a least element. We show that a finite planar lattice is lexicographically shellable and therefore Cohen-Macaulay iff it is rank-connected.