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

Lattice uniformities on pseudo-D-lattices

Let L be a pseudo-D-lattice. We prove that the lattice uniformities on L which make uniformly continuous the operations of L are uniquely determined by their system of neighbourhoods of 0 and form a distributive lattice. Moreover we prove that every such uniformity is generated by a family of weakly subadditive [0,+∞]-valued functions on L.     

Consistent lattices and Steinitz spaces

It is well-known that a finite lattice L is isomorphic to the lattice of flats of a matroid if and only if L is geometric. A result due to Edelman (see [1], Theorem 3.3) states that a lattice is meet-distributive if and only if it is isomorphic to the lattice of all closed sets of a convex geometry. In this note we prove that a finite lattice is the lattice of closed sets of a closure space with the Steinitz exchange property if and only if it is a consistent lattice. Received February 28, 1997; accepted in final form February 2, 1998.     

Towards an axiomatization of orderings

A set of six axioms for sets of relations is introduced. All well-known sets of specific orderings, such as linear and weak orderings, satisfy these axioms. These axioms impose criteria of closedness with respect to several operations, such as concatenation, substitution and restriction. For operational reasons and in order to link our results with the literature, it is shown that specific generalizations of the transitivity condition give rise to sets of relations which satisfy these axioms. Next we study minimal extensions of a given set of relations which satisfy the axioms. By this study we come to the fundamentals of orderings: They appear to be special arrangements of several types of disorder. Finally we notice that in this framework many new sets of relations have to be regarded as a set of orderings and that it is not evident how to minimize the number of these new sets of orderings.Symbol Table U universe (infinite countable) - D set of possible domains (finite and non-empty subsets of U) - R set of all considered relations - A empty relation on A - Id A identity relation on A - All A all relation on A - c complement operator (see Definition 2.1) - v converse operator (see Definition 2.1) - s symmetric part (see Definition 2.1) - asymmetric part (see Definition 2.1) - n non-diagonal part (see Definition 2.1) - r reflexive closure (see Definition 2.1) We gratefully acknowledge the support by the Co-operation Centre of Tilburg and Eindhoven Universities.     

Lebesgue decomposition and bartle—dunford—schwartz theorem in pseudo-D-lattices

Let L be a pseudo-D-lattice. We prove that the exhaustive lattice uniformities on L which makes the operations of L uniformly continuous form a Boolean algebra isomorphic to the centre of a suitable complete pseudo-D-lattice associated to L. As a consequence, we obtain decomposition theorems—such as Lebesgue and Hewitt—Yosida decompositions—and control theorems—such as Bartle—Dunford—Schwartz and Rybakov theorems—for modular measures on L.     

Some new characterizations of pointfree pseudocompactness

Abstract

By [3], a frame L is pseudocompact iff every ??-sequence in L joining to the top terminates. Here it is shown, for any completely regular L, that pseudocompactness is also equivalent to (i) the analogous condition for ?-sequences, (ii) the countable almost compactness of L, (iii) the almost compactness of CozL as a σ-frame and (iv) the condition that every countably based proper filter in L clusters. Further we establish the zero-dimensional counterparts of the above, concerning the integer valued notion of pseudocompactness. Finally, we add to this a characterization of pseudocompactness in terms of uniformities.     

Quasiorders and Sublattices of Distributive Lattices

We study the lattice of all (0,1)-sublattices of a distributive lattice L, using certain compatible quasiorders on the Priestley space of L as our principal tool. Special emphasis is put on the case of finite L, where epic sublattices, Frattini sublattices and covers are considered in some detail. We hope to demonstrate that quasiorders may serve as a concept suitable to unify the many different representations of sublattices of L which are found in the literature.     

Lattices of quotients of completely distributive lattices

In this paper, we consider the complete lattice Q(L) of all quotients of a completely distributive lattice L. We show that Q(L) is not a completely distributive lattice even for L a completely distributive algebraic lattice. Some necessary and sufficient conditions for Q(L) to be a completely distributive lattice are given. Received February 26, 2003; accepted in final form January 17, 2005.     

Über Homologiegruppen von Faserbündeln

Let L be a distributive lattice with 0 and C (L) be its lattice of congruences. The skeleton, SC (L), of C (L) consists of all those congruences which are the pseudocomplements of members of C (L), and is a complete BOOLEan lattice. An ideal is the kernel of a skeletal congruence if and only if it is an intersection of relative annihilator ideals, i.e. ideals of the form <r, s>j={x∈L: xΔr≤s} for suitable r, s∈L. The set KSC (L) of all such kernels forms an upper continuous distributive lattice and the map a ? (a={x∈L: x≤a} is a lower regular joindense embedding of L into KSC (L). The relationship between SC (L) and KSC (L) leads to numerous characterizations of disjunctive and generalized BOOLEan lattices. In particular, a distributive lattice L is disjunctive (generalized Boolean) if and only if the map Θ ? ker Θ is a lattice-isomorphism of SC (L) onto KSC (L), whose inverse is the map J ? Θ (J)** (the map J ? Θ(J)). In addition, a study of KSC (L) leads to new simple proofs of results on the completions of special classes of lattices.     

Darstellung durch Spinorgeschlechter ternärer quadratischer formen

Let V be a regular ternary quadratic space over the algebraic number field F, L a lattice on V over the maximal order o of F. A number a, which is represented by all completions L_p, is not necessarily represented by L itself, but only by a lattice in the genus of L. We determine in which cases such a number is not represented by all spinor genera in the genus. Theorem 1 repeats the known [8,3] necessary conditions for this, which show that this behaviour is exceptional. They are sharpened in Theorem 2 to a necessary and sufficient condition in terms of certain groups Θ(L_p, a) (Definition 1). These groups are computed in Theorems 3 and 4 for nondyadic and 2-adip p. Some applications are given in the last section: We give new proofs (and in one case a correction) of results from [5] on the numbers represented by some genera of positive definite ternaries.     

On the number of join-irreducibles in a congruence representation of a finite distributive lattice

For a finite lattice L, let $ \trianglelefteq_L $ denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form $ \trianglelefteq_L $, as follows: Theorem. Let $ \trianglelefteq $ be a quasi-ordering on a finite set P. Then the following conditions are equivalent:(i) There exists a finite lattice L such that $ \langle J(L), \trianglelefteq_L $ is isomorphic to the quasi-ordered set $ \langle P, \trianglelefteq \rangle $.(ii) $ |\{x\in P|p \trianglelefteq x\}| \neq 2 $, for any $ p \in P $.For a finite lattice L, let $ \mathrm{je}(L) = |J(L)|-|J(\mathrm{Con} L)| $ where Con L is the congruence lattice of L. It is well-known that the inequality $ \mathrm{je}(L) \geq 0 $ holds. For a finite distributive lattice D, let us define the join- excess function:$ \mathrm{JE}(D) =\mathrm{min(je} (L) | \mathrm{Con} L \cong D). $We provide a formula for computing the join-excess function of a finite distributive lattice D. This formula implies that $ \mathrm{JE}(D) \leq (2/3)| \mathrm{J}(D)|$ , for any finite distributive lattice D; the constant 2/3 is best possible.A special case of this formula gives a characterization of congruence lattices of finite lower bounded lattices.Dedicated to the memory of Gian-Carlo Rota     

Jordan triple derivations on J-subspace lattice algebras

Let L be a J-subspace lattice on a Banach space X and Alg L the associated J-subspace lattice algebra. Let A be a standard operator subalgebra (i.e., it contains all finite rank operators in AlgL) of AlgL and M■B(X) the Alg L-bimodule. It is shown that every linear Jordan triple derivation from A into M is a derivation, and that every generalized Jordan (triple) derivation from A into M is a generalized derivation.     

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.     

The M3[D] construction and n-modularity

In 1968, Schmidt introduced the M ₃[D] construction, an extension of the five-element modular nondistributive lattice M ₃ by a bounded distributive lattice D, defined as the lattice of all triples satisfying . The lattice M ₃[D] is a modular congruence-preserving extension of D.? In this paper, we investigate this construction for an arbitrary lattice L. For every n > 0, we exhibit an identity such that is modularity and is properly weaker than . Let M _n denote the variety defined by , the variety of n-modular lattices. If L is n-modular, then M ₃[L] is a lattice, in fact, a congruence-preserving extension of L; we also prove that, in this case, Id M ₃[L] M ₃[Id L]. ? We provide an example of a lattice L such that M ₃[L] is not a lattice. This example also provides a negative solution to a problem of Quackenbush: Is the tensor product of two lattices A and B with zero always a lattice. We complement this result by generalizing the M ₃[L] construction to an M ₄[L] construction. This yields, in particular, a bounded modular lattice L such that M ₄ L is not a lattice, thus providing a negative solution to Quackenbush’s problem in the variety M of modular lattices.? Finally, we sharpen a result of Dilworth: Every finite distributive lattice can be represented as the congruence lattice of a finite 3-modular lattice. We do this by verifying that a construction of Gr?tzer, Lakser, and Schmidt yields a 3-modular lattice. Received May 26, 1998; accepted in final form October 7, 1998.     

On the lattice of n-filters of an LM n -algebra

For an n-valued Łukasiewicz-Moisil algebra L (or LM _n -algebra for short) we denote by F _n (L) the lattice of all n-filters of L. The goal of this paper is to study the lattice F _n (L) and to give new characterizations for the meet-irreducible and completely meet-irreducible elements on F _n (L).      

Indecomposable matrices over a distributive lattice

In this paper, the concepts of indecomposable matrices and fully indecomposable matrices over a distributive lattice L are introduced, and some algebraic properties of them are obtained. Also, some characterizations of the set F _n (L) of all n × n fully indecomposable matrices as a subsemigroup of the semigroup H _n (L) of all n × n Hall matrices over the lattice L are given.     

Fuzzy prime Boolean filters and their operations in IMT L-algebras

Some characterizations of fuzzy prime Boolean filters of IMT L-algebras are given. The lattice operations and the order-reversing involution on the set PB(M) of all fuzzy prime Boolean filters of IMT L-algebras are defined. It is showed that the set PB(M) endowed with these operations is a complete quasi-Boolean algebra (a distributive complete lattice with an order-reversing involution). It is derived that the algebra M=F, which is the set of all cosets of F, is isomorphic to the Boolean algebra {0; 1} if F is a fuzzy prime Boolean filter. By introducing an adjoint pair on PB(M), it is proved that the set PB(M) is also a residuated lattice.     

On the algebra associated with a geometric lattice

Let L be a geometric lattice. Following P. Orlik and L. Solomon, Combinatorics and topology of complements of hyperplanes, Invent. math. 56 (1980), 167–189, we associate with L a graded commutative algebra A(L). In this paper we introduce a new invariant ψ of the algebra A(L) which suffices to distinguish algebras for which all other known invariants coincide. This result is applied to the study of arrangements of complex hyperplanes, with L being the intersection lattice. In this case A(L) is isomorphic to the cohomology algebra of the associated hyperplane complement. The goal is to find examples of arrangements with non-isomorphic lattices but homotopy equivalent complements. The invariant introduced here effectively narrows the list of candidates. Nevertheless, we exhibit combinatorially inequivalent arrangements for which all known invariants, including ψ, coincide.     

Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices

Let be a {0, 1}-homomorphism of a finite distributive lattice D into the congruence lattice Con L of a rectangular (whence finite, planar, and semimodular) lattice L. We prove that L is a filter of an appropriate rectangular lattice K such that ConK is isomorphic with D and is represented by the restriction map from Con K to Con L. The particular case where is an embedding was proved by E.T. Schmidt. Our result implies that each {0, 1}-lattice homomorphism between two finite distributive lattices can be represented by the restriction of congruences of an appropriate rectangular lattice to a rectangular filter.