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.     

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.     

Orthomodular semilattices

We present a simple equational characterization of (meet) semilattices with 0 where for each element p the interval [0,p] is an orthomodular lattice or an ortholattice possibly satisfying the compatibility condition.     

On the congruence problem in infinite dimensional sesquilinear spaces

If two subspaces V and V of a sesquilinear space E are congruent (i.e., there is an isometry : E E with (V)=V) then their corresponding quadratic lattices V(V, E) and V(V, E) are isomorphic. It is shown that the converse holds for important types of sesquilinear spaces E, provided that dim(E) ₃. However, the converse generally fails if dim(E) ₃.     

Critical points between varieties generated by subspace lattices of vector spaces

We denote by the semilattice of all compact congruences of an algebra A. Given a variety V of algebras, we denote by the class of all semilattices isomorphic to for some A∈V. Given varieties V and W of algebras, the critical point of V under W is defined as . Given a finitely generated variety V of modular lattices, we obtain an integer ?, depending on V, such that for any n≥? and any field F.In a second part, using tools introduced in Gillibert (2009) [5], we prove that:

     

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.     

On polyvectors of vector spaces and hyperplanes of projective Grassmannians

We investigate relationships between polyvectors of a vector space V, alternating multilinear forms on V, hyperplanes of projective Grassmannians and regular spreads of projective spaces. Suppose V is an n-dimensional vector space over a field F and that A_n-1,k(F) is the Grassmannian of the (k − 1)-dimensional subspaces of PG(V) (1  ? k ? n − 1). With each hyperplane H of A_n-1,k(F), we associate an (n − k)-vector of V (i.e., a vector of ∧^n−kV) which we will call a representative vector of H. One of the problems which we consider is the isomorphism problem of hyperplanes of A_n-1,k(F), i.e., how isomorphism of hyperplanes can be recognized in terms of their representative vectors. Special attention is paid here to the case n = 2k and to those isomorphisms which arise from dualities of PG(V). We also prove that with each regular spread of the projective space PG(2k-1,F), there is associated some class of isomorphic hyperplanes of the Grassmannian A_2k-1,k(F), and we study some properties of these hyperplanes. The above investigations allow us to obtain a new proof for the classification, up to equivalence, of the trivectors of a 6-dimensional vector space over an arbitrary field F, and to obtain a classification, up to isomorphism, of all hyperplanes of A_5,3(F).     

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.     

Mappings and Prohorov spaces

We consider completely regular Hausdorff spaces. In this paper we investigate the space of probability Radon measures P(X) on a space X and the property to be a Prohorov space. We prove that the space P(X) is sieve-complete if and only if X is sieve-complete. Every mapping generates the mapping . Some properties of the mapping P(φ) are studied. In particular, we investigate under which conditions the open continuous image of a Prohorov space is Prohorov.     

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.     

Function spaces from core compact coherent spaces to continuous B-domains

It is proved in this paper that for a continuous B-domain L, the function space [X→L] is continuous for each core compact and coherent space X. Further, applications are given. It is proved that:

(1)

the function space from the unit interval to any bifinite domain which is not an L-domain is not Lawson compact;

(2)

the Isbell and Scott topologies on [X→L] agree for each continuous B-domain L and core compact coherent space X.

     

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.     

Comparability graphs of lattices

A theorem of N. Terai and T. Hibi for finite distributive lattices and a theorem of Hibi for finite modular lattices (suggested by R.P. Stanley) are equivalent to the following: if a finite distributive or modular lattice of rank d contains a complemented rank 3 interval, then the lattice is (d+1)-connected.In this paper, the following generalization is proved: Let L be a (finite or infinite) semimodular lattice of rank d that is not a chain (d∈N₀). Then the comparability graph of L is (d+1)-connected if and only if L has no simplicial elements, where z∈L is simplicial if the elements comparable to z form a chain.     

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.     

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.     

Positive semidefinite quadratic forms on unitary matrices

Let

     

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.     

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.     

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.     

When do abstract bases generate continuous lattices and L-domains

In this note, the new concepts of C-bases (resp., BC-bases, L-bases) which are special kinds of abstract bases are introduced. It is proved that the round ideal completion of a C-basis (resp., BC-basis, L-basis) is a continuous lattice (resp., bc-domain, L-domain). Furthermore, representation theorems of continuous lattices (resp., bc-domains, L-domains) by means of the round ideal completions of C-bases (resp., BC-bases, L-bases) are obtained. Supported by the NSF of China (10371106, 60774073) and by the Fund (S0667-082) from Nanjing University of Aeronautics and Astronautics.