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.     

On the nonexistence of free complete distributive lattices

We prove that there is no free object over a countable set in the category of complete distributive lattices with homomorphisms preserving binary meets and arbitrary joins.     

Orthomodular lattices and permutable congruences

If a variety of ortholattices is congruence-permutable, then we prove that it is a variety of orthomodular lattices.Dedicated to the memory of Ivan RivalReceived October 7, 2003; accepted in final form July 12, 2004.This revised version was published online in August 2005 with a corrected cover date.     

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.     

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.     

On modular lattices generated by chains

We describe the free modular lattice generated by two chains and a single point, under the assumption that there are few meets. Received February 11, 2005; accepted in final form August 11, 2005.     

Self-dual bases for varieties of orthomodular lattices

For any finitely based variety of orthomodular lattices, we determine the sizes of all equational bases that are both irredundant and self-dual.     

Nearlattices

By a nearlattice is meant a join-semilattice where every principal filter is a lattice with respect to the induced order. Alternatively, a nearlattice can be described as an algebra with one ternary operation satisfying eight simple identities. Hence, the class of nearlattices is a variety. We characterize nearlattices every sublattice of which is distributive. Then we introduce the so-called section pseudocomplementation on nearlattices which can also be characterized by identities.     

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.     

Counting formulas for glued lattices

A tolerance relation of a lattice L, i.e., a reflexive and symmetric relation of L which is compatible with join and meet, is called glued if covering blocks of have nonempty intersection. For a lattice L with a glued tolerance relation we prove a formula counting the number of elements of L with exactly k lower (upper) covers. Moreover, we prove similar formulas for incidence structures and graphs and we give a new proof of Dilworth's covering theorem.     

Cancellative residuated lattices

Cancellative residuated lattices are natural generalizations of lattice-ordered groups ( -groups). Although cancellative monoids are defined by quasi-equations, the class of cancellative residuated lattices is a variety. We prove that there are only two commutative subvarieties of that cover the trivial variety, namely the varieties generated by the integers and the negative integers (with zero). We also construct examples showing that in contrast to -groups, the lattice reducts of cancellative residuated lattices need not be distributive. In fact we prove that every lattice can be embedded in the lattice reduct of a cancellative residuated lattice. Moreover, we show that there exists an order-preserving injection of the lattice of all lattice varieties into the subvariety lattice of .We define generalized MV-algebras and generalized BL-algebras and prove that the cancellative integral members of these varieties are precisely the negative cones of -groups, hence the latter form a variety, denoted by . Furthermore we prove that the map that sends a subvariety of -groups to the corresponding class of negative cones is a lattice isomorphism from the lattice of subvarieties of to the lattice of subvarieties of . Finally, we show how to translate equational bases between corresponding subvarieties, and briefly discuss these results in the context of R. McKenzies characterization of categorically equivalent varieties.     

On context patterns associated with concept lattices

In this paper, we consider the following reconstruction problem: Given two ordered sets (G, ) and (M, ) representing join- and meet-irreducible elements, respectively together with three relationsJ,, onG×M modelling comparability (gm) and maximal noncomparability with respect tog (gm, butgm*) and with respect tom (gm, butgm*). We determine necessary and sufficient conditions for the existence of a finite latticeL and injections :GJ(L) and :MM(L) such that the given order relations and the abstract relations coincide with the one induced by the latticeL.     

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.     

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.     

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.     

Matchings and radon transforms in lattices. I. Consistent lattices

An element in a lattice is join-irreducible if x=ab implies x=a or x=b. A meet-irreducible is a join-irreducible in the order dual. A lattice is consistent if for every element x and every join-irreducible j, the element xj is a join-irreducible in the upper interval [x, î]. We prove that in a finite consistent lattice, the incidence matrix of meet-irreducibles versus join-irreducibles has rank the number of join-irreducibles. Since modular lattices and their order duals are consistent, this settles a conjecture of Rival on matchings in modular lattices.     

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.     

Dualisability versus residual character: A theorem and a counterexample

We show that a finite algebra must be inherently non-dualisable if the variety that it generates is both residually large and congruence meet-semidistributive. We also give the first example of a finite dualisable algebra that generates a variety that is residually large.     

Intervals in lattices of quasiorders

We investigate the structure of intervals in the lattice of all closed quasiorders on a compact or discrete space. As a first step, we show that if the intervalI has no infinite chains then the underlying space may be assumed to be finite, and in particular,I must be finite, too. We compute several upper bounds for its size in terms of its heighth, which in turn can be computed easily by means of the least and the greatest element ofI. The cover degreec of the interval (i.e. the maximal number of atoms in a subinterval) is less than 4h. Moreover, ifc4(n–1) thenI contains a Boolean subinterval of size 2 ⁿ , and ifI is geometric then it is already a finite Boolean lattice. While every finite distributive lattice is isomorphic to some interval of quasiorders, we show that a nondistributive finite interval of quasiorders is neither a vertical sum nor a horizontal sum of two lattices, with exception of the pentagon. Many further lattices are excluded from the class of intervals of quasiorders by the fact that no join-irreducible element of such an interval can have two incomparable join-irreducible complements. Up to isomorphism, we determine all quasiorder intervals with less than 9 elements and all quasiorder intervals with two complementary atoms or coatoms.