The automorphism group of a function lattice: A problem of Jónsson and McKenzie

It is shown that Aut(L ^Q ) is naturally isomorphic to Aut(L) × Aut(Q) whenL is a directly and exponentially indecomposable lattice,Q a non-empty connected poset, and one of the following holds:Q is arbitrary butL is ajm-lattice,Q is finitely factorable and L is complete with a join-dense subset of completely join-irreducible elements, orL is arbitrary butQ is finite. A problem of Jónsson and McKenzie is thereby solved. Sharp conditions are found guaranteeing the injectivity of the natural mapv _P,Q from Aut(P) × Aut(Q) to Aut(P ^Q )P andQ posets), correcting misstatements made by previous authors. It is proven that, for a bounded posetP and arbitraryQ, the Dedekind-MacNeille completion ofP ^Q ,DM(P ^Q ), is isomorphic toDM(P)^Q. This isomorphism is used to prove that the natural mapv _P,Q is an isomorphism ifv _DM(P),Q is, reducing a poset problem to a more tractable lattice problem.Presented by B. Jonsson.The author would like to thank his supervisor, Dr. H. A. Priestley, for her direction and advice as well as his undergraduate supervisor, Prof. Garrett Birkhoff, and Dr. P. M. Neumann for comments regarding the paper. This material is based upon work supported under a (U.S.) National Science Foundation Graduate Research Fellowship and a Marshall Aid Commemoration Commission Scholarship.     

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.     

Almost distributive sublattices and congruence heredity

A congruence lattice L of an algebra A is hereditary if every 0-1 sublattice of L is the congruence lattice of an algebra on A. Suppose that L is a finite lattice obtained from a distributive lattice by doubling a convex subset. We prove that every congruence lattice of a finite algebra isomorphic to L is hereditary. Presented by E. W. Kiss. Received July 18, 2005; accepted in final form April 2, 2006.     

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     

N-free orders and minimal interval extensions

We investigate problems related to the set of minimal interval extensions of N-free orders. This leads us to a correspondence between this set for an arbitrary order and a certain set of its maximal N-free reductions. We also get a 1-1-correspondence between the set of linear extensions of an arbitrary order and the set of minimal interval extensions of the linegraph of that order. This has an algorithmic consequence, namely the problem of counting minimal interval extensions of an N-free order is #P-complete. Finally a characterization of all N-free orders with isomorphic root graph is given in terms of their lattice of maximal antichains; the lattices are isomorphic iff the root graphs agree.This work was supported by the PROCOPE Program. The first author is supported by the DFG.     

Lattices isomorphic with their free powers

For any N3 there exists a lattice L isomorphic with NL (the free product of its own N copies) but not isomorphic with kL for any k–2,...,N-1.     

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.     

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 complementary topologies and preorders

A topology on a set X is self complementary if there is a homeomorphic copy on the same set that is a complement in the lattice of topologies on X. The problem of characterizing finite self complementary topologies leads us to redefine the problem in terms of preorders (i.e. reflexive, transitive relations). A preorder P on a set X is self complementary if there is an isomorphic copy P of P on X that is arc disjoint to P (except for loops) and with the property that PP is strongly connected. We characterize here self complementary finite partial orders and self complementary finite equivalence relations.     

Fractional dimension of partial orders

Given a partially ordered setP=(X, ), a collection of linear extensions {L ₁,L ₂,...,L _r } is arealizer if, for every incomparable pair of elementsx andy, we havex<y in someL _i (andy<x in someL _j ). For a positive integerk, we call a multiset {L ₁,L ₂,...,L _t } ak-fold realizer if for every incomparable pairx andy we havex<y in at leastk of theL _i 's. Lett(k) be the size of a smallestk-fold realizer ofP; we define thefractional dimension ofP, denoted fdim(P), to be the limit oft(k)/k ask. We prove various results about the fractional dimension of a poset.Research supported in part by the Office of Naval Research.     

Posets isomorphic to their extensions

A standard extension for a poset P is a system Q of lower ends (descending subsets) of P containing all principal ideals of P. An isomorphism between P and Q is called recycling if [Y]Q for all YQ. The existence of such an isomorphism has rather restrictive consequences for the system Q in question. For example, if Q contains all lower ends generated by chains then a recycling isomorphism between P and Q forces Q to be precisely the system of all principal ideals. For certain standard extensions Q, it turns out that every isomorphism between P and Q (if there is any) must be recycling. Our results include the well-known fact that a poset cannot be isomorphic to the system of all lower ends, as well as the fact that a poset is isomorphic to the system of all ideals (i.e., directed lower ends) only if every ideal is principal.     

Convex partitions of a finite lattice

The purpose of this paper is to introduce the lattice of convex partitions for a lattice L. Then we will show some properties of this lattice. Finally, we will show that if the convex partition lattice of L is finite and modular if and only if L is a finite chain. Presented by R. McKenzie. Received December 16, 2004; accepted in final form March 7, 2006.     

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.     

Comparability invariance of the fixed point property

We show that the fixed point property is comparability invariant for finite ordered sets; that is, if P and Q are finite ordered sets with isomorphic comparability graphs, then P has the fixed point property if and only if Q does. In the process we give a characterization of comparability invariants which can also be used to give shorter proofs of some known results.     

Posets of copies of countable scattered linear orders

We show that the separative quotient of the poset 〈P(L),⊂〉$〈\mathbb{P}(L),\subset 〉$ of isomorphic suborders of a countable scattered linear order L is σ  -closed and atomless. So, under the CH, all these posets are forcing-equivalent (to (P(ω)/Fin)⁺${(P(\omega )/\mathrm{Fin})}^{+}$).     

Some aspects of (non) functoriality of natural discrete covers of locales

Abstract

The frame S_c(L) generated by closed sublocales of a locale L is known to be a natural Boolean (“discrete”) extension of a subfit L; also it is known to be its maximal essential extension. In this paper we first show that it is an essential extension of any L and that the maximal essential extensions of L and S_c(L) are isomorphic. The construction S_c is not functorial; this leads to the question of individual liftings of homomorphisms L → M to homomorphisms S_c(L) → S_c(M). This is trivial for Boolean L and easy for a wide class of spatial L, M . Then, we show that one can lift all h : L → 2 for weakly Hausdor? L (and hence the spectra of L and S_c(L) are naturally isomorphic), and finally present liftings of h : L → M for regular L and arbitrary Boolean M.     

Local separation in distributive semilattices

We introduce the Local Separation Property (LSP) for distributive semilattices. We show that LSP holds in many semilattices of the form Con_c A, where A is a lattice. On the other hand, we construct an abstract example of a distributive lattice without LSP. Our research is connected with the well known open problem whether every distributive algebraic lattice is isomorphic to the congruence lattice of some lattice. Received December 10, 2004; accepted in final form June 6, 2005.     

Weakening partial orderings to lattice and semilattice orderings

A partial ordering on a set P can be weakened to an upper or lower semilattice ordering, respectively a lattice ordering, if and only if P is filtered in the appropriate direction(s).This work was done while the author was partly supported by NSF contract DMS 85-02330.     

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.