Orthmodular lattices whose MacNeille completions are not orthomodular

The only known example of an orthomodular lattice (abbreviated: OML) whose MacNeille completion is not an OML has been noted independently by several authors, see Adams [1], and is based on a theorem of Ameniya and Araki [2]. This theorem states that for an inner product space V, if we consider the ortholattice ?(V,⊥) = {A \( \subseteq \) V: A = A ^⊥⊥} where A ^⊥ is the set of elements orthogonal to A, then ?(V,⊥) is an OML if and only if V is complete. Taking the orthomodular lattice L of finite or confinite dimensional subspaces of an incomplete inner product space V, the ortholattice ?(V,⊥) is a MacNeille completion of L which is not orthomodular. This does not answer the longstanding question Can every OML be embedded into a complete OML? as L can be embedded into the complete OML ?(V,⊥), where V is the completion of the inner product space V. Although the power of the Ameniya-Araki theorem makes the preceding example elegant to present, the ability to picture the situation is lost. In this paper, I present a simpler method to construct OMLs whose Macneille completions are not orthomodular. No use is made of the Ameniya-Araki theorem. Instead, this method is based on a construction introduced by Kalmbach [7] in which the Boolean algebras generated by the chains of a lattice are glued together to form an OML. A simple method to complete these OMLs is also given. The final section of this paper briefly covers some elementary properties of the Kalmbach construction. I have included this section because I feel that this construction may be quite useful for many purposes and virtually no literature has been written on it.     

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

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.     

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.     

Reducible classes of finite lattices

In this paper we study a notion of reducibility in finite lattices. An element x of a (finite) lattice L satisfying certain properties is deletable if L-x is a lattice satisfying the same properties. A class of lattices is reducible if each lattice of this class admits (at least) one deletable element (equivalently if one can go from any lattice in this class to the trivial lattice by a sequence of lattices of the class obtained by deleting one element in each step). First we characterize the deletable elements in a pseudocomplemented lattice what allows to prove that the class of pseudocomplemented lattices is reducible. Then we characterize the deletable elements in semimodular, modular and distributive lattices what allows to prove that the classes of semimodular and locally distributive lattices are reducible. In conclusion the notion of reducibility for a class of lattices is compared with some other notions like the notion of order variety.     

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.     

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.     

A cover-preserving embedding of semimodular lattices into geometric lattices

Extending former results by G. Grätzer and E.W. Kiss (1986) [5] and M. Wild (1993) [9] on finite (upper) semimodular lattices, we prove that each semimodular lattice L of finite length has a cover-preserving embedding into a geometric lattice G of the same length. The number of atoms of our G equals the number of join-irreducible elements of L.     

Different orthomodular orthocomplementations on a lattice

A new method for constructing separable Hilbert lattices is described. Examples of lattices are given that admit infinitely many different orthomodular orthocomplementations.     

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.     

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.     

Boolean products of lattices

A study is made of Boolean product representations of bounded lattices over the Stone space of their centres. Special emphasis is placed on relating topological properties such as clopen or regular open equalizers to their equivalent lattice theoretic counterparts. Results are also presented connecting various properties of a lattice with properties of its individual stalks.Research supported by the Natural Sciences and Engineering Research Council of Canada.Research supported by ONR Grant N00014-90-J-1008.     

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].     

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.     

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.     

Orthomodular lattices in ordered vector spaces

In a partly ordered space the orthogonality relation is defined by incomparability. We define integrally open and integrally semi-open ordered real vector spaces. We prove: if an ordered real vector space is integrally semi-open, then a complete lattice of double orthoclosed sets is orthomodular. An integrally open concept is closely related to an open set in the Euclidean topology in a finite dimensional ordered vector space. We prove: if V is an ordered Euclidean space, then V is integrally open and directed (and is also Archimedean) if and only if its positive cone, without vertex 0, is an open set in the Euclidean topology (and also the family of all order segments , a < b, is a base for the Euclidean topology). Received January 7, 2005; accepted in final form November 26, 2005.