Commutator-finite orthomodular lattices

The class of orthomodular lattices which have only finitely many commutators is investigated. The following theorems are proved: contains the block-finite orthomodular lattices. Every irreducible element of is simple. Every element of is a direct product of a Boolean algebra and finitely many simple orthomodular lattices. The irreducible elements of which are modular, or are M-symmetric with at least one atom, have height two or less.     

MacNeille completions of lattice expansions

There are two natural ways to extend an arbitrary map between (the carriers of) two lattices, to a map between their MacNeille completions. In this paper we investigate which properties of lattice maps are preserved under these constructions, and for which kind of maps the two extensions coincide. Our perspective involves a number of topologies on lattice completions, including the Scott topologies and topologies that are induced by the original lattice. We provide a characterization of the MacNeille completion in terms of these induced topologies. We then turn to expansions of lattices with additional operations, and address the question of which equational properties of such lattice expansions are preserved under various types of MacNeille completions that can be defined for these algebras. For a number of cases, including modal algebras and residuated (ortho)lattice expansions, we provide reasonably sharp sufficient conditions on the syntactic shape of equations that guarantee preservation. Generally, our results show that the more residuation properties the primitive operations satisfy, the more equations are preserved. Received August 21, 2005; accepted in final form October 17, 2006.     

Lattice uniformities and modular functions on orthomodular lattices

It is shown that the lattice of all exhaustive lattice uniformities on an orthomodular latticeL is isomorphic to the centre of a natural completion (of a quotient) ofL, and is thus a complete Boolean algebra. This is applied to prove a decomposition theorem for exhaustive modular functions on orthomodular lattices, which generalizes Traynor's decomposition theorem [14].     

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.     

Completions of orthomodular lattices II

If is a variety of orthomodular lattices generated by a set of orthomodular lattices having a finite uniform upper bound om the length of their chains, then the MacNeille completion of every algebra in again belongs to .The author gratefully acknowledges the support of NSERC.     

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.     

Congruence kernels of orthomodular implication algebras

Abstracting from certain properties of the implication operation in Boolean algebras leads to so-called orthomodular implication algebras. These are in a natural one-to-one correspondence with families of orthomodular lattices. It is proved that congruence kernels of orthomodular implication algebras are in a natural one-to-one correspondence with families of compatible p-filters on the corresponding orthomodular lattices.     

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.     

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.     

Completions of orthomodular lattices

If K is a variety of orthomodular lattices generated by a finite orthomodular lattice the MacNeille completion of every algebra in K again belongs to K.     

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.     

Partial matrices whose completions have ranks bounded below

A partial matrix over a field F is a matrix whose entries are either elements of F or independent indeterminates. A completion of such a partial matrix is obtained by specifying values from F for the indeterminates. We determine the maximum possible number of indeterminates in a partial m×n matrix whose completions all have rank at least equal to a particular k, and we fully describe those examples in which this maximum is attained. Our main theoretical tool, which is developed in Section 2, is a duality relationship between affine spaces of matrices in which ranks are bounded below and affine spaces of matrices in which the (left or right) nullspaces of elements possess a certain covering property.     

Lattice-ordered groups whose lattices of convex l-subgroups guarantee noncommutativity

Paul Conrad has asked whether for every lattice-ordered group G, there exists an Abelian N sharing its lattice C(G) of convex l-subgroups, i.e., such that C(N)C(G). Several counter-examples are exhibited, including all free l-groups of uncountably infinite rank. Also, for A() the l-group of order-automorphisms of the real line , it is shown that any N sharing its C would have to be an l-subgroup of the l-group C() of continuous real-valued functions-and that C(C())C(A()).This work was done while the author was spending a most enjoyable year at Boise State University.     

ACI-matrices all of whose completions have the same rank

We characterize the ACI-matrices all of whose completions have the same rank, determine the largest number of indeterminates in such partial matrices of a given size, and determine the partial matrices that attain this largest number.     

Strictly locally order affine complete lattices

We call a latticeL strictly locally order-affine complete if, given a finite subsemilatticeS ofL ⁿ, every functionf: S L which preserves congruences and order, is a polynomial function. The main results are the following: (1) all relatively complemented lattices are strictly locally order-affine complete; (2) a finite modular lattice is strictly locally order-affine complete if and only if it is relatively complemented. These results extend and generalize the earlier results of D. Dorninger [2] and R. Wille [9, 10].     

Orthomodular lattices from 3-dimensional quadratic spaces

If E is a vector space over a field K, then any regular symmetric bilinear form on E induces a polarity on the lattice of all subspaces of E. In the particular case where E is 3-dimensional, the set of all subspaces M of E such that both M and are not N-subspaces (which, in most cases, is equivalent to saying that M is nonisotropic), ordered by inclusion and endowed with the restriction of the above polarity, is an orthomodular lattice T(E, ). We show that if K is a proper subfield of K, with K F₂, and E a 3-dimensional K -subspace of E such that the restriction of to E × E is, up to multiplicative constant, a bilinear form on the K -space E , then T(E , ) is isomorphic to an irreducible 3-homogeneous proper subalgebra of T(E, ). Our main result is a structure theorem stating that, when K is not of characteristic 3, the converse is true, i.e., any irreducible 3-homogeneous proper subalgebra of T(E, ) is of this form. As a corollary, we construct infinitely many finite orthomodular lattices which are minimal in the sense that all their proper subalgebras are modular. In fact, this last result was our initial aim in this paper.Received June 4, 2003; accepted in final form May 18, 2004.     

Infinite joins that are finitely join-irreducible

Complete lattices are studied which contain an element u which is not the join of a finite set of smaller elements, but is the join of all elements <u.This work was done while the first author was partly supported by NSF contract DMS 85-02330; during the completion of the article the second author was partly supported by NSF grant DMS 88-07043.     

Partitioning Boolean lattices into chains of subsets

We prove that the Boolean lattice of all subsets of an n-set can be partitioned into chains of size four if and only if n9.Research supported in part by N.S.F. grant DMS-8401281.Research supported in part by N.S.F. grant DMS-8406451.