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.     

Pseudo-Complementation on Almost Distributive Lattices

The concept of a pseudo-complementation * on an almost distributive lattice (ADL) with 0 is introduced and it is proved that it is equationally definable. A one-to-one correspondence between the pseudo-complementations on an ADL L with 0 and maximal elements of L is obtained. It is also proved that L* = {a*|a L} is a Boolean algebra which is independent (upto isomorphism) of the pseudo-complementation * on L.AMS Subject Classification (1991): 06D99 06D15     

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

Automorphism groups of finite distributive lattices with a given sublattice of fixed points

For a latticeL, aL is a fixed point ofL if and only iff(a)=a for every automorphismf ofL. Let Aut (L) andS (L) denote the group of automorphisms ofL and the sublattice of fixed points ofL, respectively. It is shown that ifG is a finite group other thanZ ₂ ² ,Z ₂ ³ ,Z ₂ ⁴ ,Z ₃ ² or the quaternion group of order 8 andL is a finite automorphism free distributive lattice that is not near Boolean then there is a finite distributive latticeL such that Aut (L)G andS(L)L.The support of the National Research Council of Canada is gratefully acknowledged.     

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.     

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

Identities of cofinal sublattices

If V is a variety of lattices and L a free lattice in V on uncountably many generators, then any cofinal sublattice of L generates all of V. On the other hand, any modular lattice without chains of order-type +1 has a cofinal distributive sublattice. More generally, if a modular lattice L has a distributive sublattice which is cofinal modulo intervals with ACC, this may be enlarged to a cofinal distributive sublattice. Examples are given showing that these existence results are sharp in several ways. Some similar results and questions on existence of cofinal sublattices with DCC are noted.This work was done while the first author was partly supported by NSF contract MCS 82-02632, and the second author by an NSF Graduate Fellowship.     

Combinatorial partitions of finite posets and lattices —Ramsey lattices

It is proved that for every finite latticeL there exists a finite latticeL such that for every partition of the points ofL into two classes there exists a lattice embeddingf:LL such that the points off(L) are in one of the classes.This property is called point-Ramsey property of the class of all finite lattices. In fact a stronger theorem is proved which implies the following: for everyn there exists a finite latticeL such that the Hasse-diagram (=covering relation) has chromatic number >n. We discuss the validity of Ramseytype theorems in the classes of finite posets (where a full discussion is given) and finite distributive lattices. Finally we prove theorems which deal with partitions of lattices into an unbounded number of classes.Presented by G. Grätzer.     

A class of algebrasA with SubA anti-isomorphic to ConA

It is proved that for a finite non-empty latticeL satisfying (L, ) (L, ), Sub (L, , 0) is anti-isomorphic to Con (L, , 0).Presented by I. Rosenberg.     

Birkhoff Centre of a Poset

In this paper, it is proved that the Boolean centre of a semigroup S with sufficiently many commuting idempotents is isomorphic to the inverse limit of the directed family of Birkhoff centres (or Boolean centres) of a class of bounded semigroups. The Birkhoff centre is defined for any poset and proved that it is a relatively complemented distributive lattice whenever it is nonempty. It is observed that for a semilattice S, the Birkhoff centres as a semigroup and as a poset coincide. Also it is observed that for a Lattice (L, , ), the Birkhoff centres of the semilattices (L, ) and (L, ) coincide with the Birkhoff centre of L. Finally it is proved that for a lattice (L, , ), the Boolean centres of the semilattices (L, ) and (L, ) coincide with the Boolean centre of L.AMS Subject classification (1991): 06A12, 20M15     

Factorization along commutative subspace lattices

A positive invertible operatorT is said to be factorable along a commutative subspace latticeL if there is an invertible operatorA inAlg L whose inverse is also inAlg L and such thatT=A*A. We investigate a number of conditions that are equivalent to factorability of a given operator along a latticeL. As a byproduct, we derive a condition that guarantees that the latticeT L, defined as {range(TE) E L} is commutative. Applications are suggested to the particular case of factoringL functions via analytic Toeplitz operators on the polydisc.     

On the lattice formed by all normal subloops of a finite loop

All normal subloops of a loopG form a modular latticeL _n (G). It is shown that a finite loopG has a complemented normal subloop lattice if and only ifG is a direct product of simple subloops. In particular,L _n (G) is a Boolean algebra if and only if no two isomorphic factors occurring in a decomposition ofG are abelian groups. The normal subloop lattice of a finite loop is a projective geometry if and only ifG is an elementary abelianp-group for some primep.     

Finite distributive lattices are congruence lattices of almost-geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.     

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.     

Poset algebras over well quasi-ordered posets

A new class of partial order-types, class is defined and investigated here. A poset P is in the class iff the poset algebra F(P) is generated by a better quasi-order G that is included in L(P). The free Boolean algebra F(P) and its free distributive lattice L(P) have been defined in [ABKR]. The free Boolean algebra F(P) contains the partial order P and is generated by it: F(P) has the following universal property. If B is any Boolean algebra and f is any order-preserving map from P into a Boolean algebra B, then f can be extended to a homomorphism of F(P) into B. We also define L(P) as the sublattice of F(P) generated by P. We prove that if P is any well quasi-ordering, then L(P) is well founded, and is a countable union of well quasi-orderings. We prove that the class is contained in the class of well quasi-ordered sets. We prove that is preserved under homomorphic image, finite products, and lexicographic sum over better quasi-ordered index sets. We prove also that every countable well quasi-ordered set is in . We do not know, however if the class of well quasi-ordered sets is contained in . Additional results concern homomorphic images of posets algebras. The third author was supported by the following institutions: Israel Science Foundation (postdoctoral positions at Ben Gurion University 2000–2002), The Fields Institute (Toronto 2002–2004), and by The Nato Science Fellowship (University Paris VII, CNRS-UMR 7056, 2004).     

The lattice of idempotent distributive semiring varieties

A solution is given for the word problem for free idempotent distributive semirings. Using this solution the latticeL (ID) of subvarieties of the variety ID of idempotent distributive semirings is determined. It turns out thatL (ID) is isomorphic to the direct product of a four-element lattice and a lattice which is itself a subdirect product of four copies of the latticeL(B) of all band varieties. ThereforeL(ID) is countably infinite and distributive. Every subvariety of ID is finitely based. Project supported by the National Natural Science Foundation of China (Grant No. 19761004) and the Provincial Applied Fundamental Research Foundation of Yunnan (96a001z).     

Algebraic aspects of generalized approximation spaces

The concept of approximation spaces is a key notion of rough set theory, which is an important tool for approximate reasoning about data. This paper concerns algebraic aspects of generalized approximation spaces. Concepts of R-open sets, R-closed sets and regular sets of a generalized approximation space (U,R) are introduced. Algebraic structures of various families of subsets of (U,R) under the set-inclusion order are investigated. Main results are: (1) The family of all R-open sets (respectively, R-closed sets, R-clopen sets) is both a completely distributive lattice and an algebraic lattice, and in addition a complete Boolean algebra if relation R is symmetric. (2) The family of definable sets is both an algebraic completely distributive lattice and a complete Boolean algebra if relation R is serial. (3) The collection of upper (respectively, lower) approximation sets is a completely distributive lattice if and only if the involved relation is regular. (4) The family of regular sets is a complete Boolean algebra if the involved relation is serial and transitive.     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley’s <Emphasis Type="Italic">Enumerative Combinatorics</Emphasis>

A distributive lattice L with 0 is finitary if every interval is finite. A function f:₀₀ is a cover function for L if every element with n lower covers has f(n) upper covers. All non-decreasing cover functions have been characterized by the author ([2]), settling a 1975 conjecture of Richard P. Stanley. In this paper, all finitary distributive lattices with cover functions are characterized. A problem in Stanleys Enumerative Combinatorics is thus solved. 2000 Mathematics Subject Classification. 06A07, 06B05, 06D99, 11B39     

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

Let _i(L), _i(L^*) denote the successive minima of a latticeL and its reciprocal latticeL ^*, and let [b₁,..., b _n ] be a basis ofL that is reduced in the sense of Korkin and Zolotarev. We prove that and, where and _j denotes Hermite's constant. As a consequence the inequalities are obtained forn7. Given a basisB of a latticeL in ^m of rankn andx ^m , we define polynomial time computable quantities(B) and(x,B) that are lower bounds for ₁(L) and(x,L), where(x,L) is the Euclidean distance fromx to the closest vector inL. If in additionB is reciprocal to a Korkin-Zolotarev basis ofL ^*, then ₁(L) _n ^* (B) and.The research of the second author was supported by NSF contract DMS 87-06176. The research of the third author was performed at the University of California, Berkeley, with support from NSF grant 21823, and at AT&T Bell Laboratories.