Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

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.     

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.     

Primes,irreducibles and extremal lattices

This paper studies certain types of join and meet-irreducibles called coprimes and primes. These elements can be used to characterize certain types of lattices. For example, a lattice is distributive if and only if every join-irreducible is coprime. Similarly, a lattice is meet-pseudocomplemented if and only if each atom is coprime. Furthermore, these elements naturally decompose lattices into sublattices so that often properties of the original lattice can be deduced from properties of the sublattice. Not every lattice has primes and coprimes. This paper shows that lattices which are long enough must have primes and coprimes and that these elements and the resulting decompositions can be used to study such lattices.The length of every finite lattice is bounded above by the minimum of the number of meet-irreducibles (meet-rank) and the number of join-irreducibles (join-rank) that it has. This paper studies lattices for which length=join-rank or length=meet-rank. These are called p-extremal lattices and they have interesting decompositions and properties. For example, ranked, p-extremal lattices are either lower locally distributive (join-rank=length), upper locally distributive (meet-rank=length) or distributive (join-rank=meet-rank=length). In the absence of the Jordan-Dedekind chain condition, p-extremal lattices still have many interesting properties. Of special interest are the lattices that satisfy both equalities. Such lattices are called extremal; this class includes distributive lattices and the associativity lattices of Tamari. Even though they have interesting decompositions, extremal lattices cannot be characterized algebraically since any finite lattice can be embedded as a subinterval into an extremal lattice. This paper shows how prime and coprime elements, and the poset of irreducibles can be used to analyze p-extremal and other types of lattices.The results presented in this paper are used to deduce many key properties of the Tamari lattices. These lattices behave much like distributive lattices even though they violate the Jordan-Dedekind chain condition very strongly having maximal chains that vary in length from N-1 to N(N-1)/2 where N is a parameter used in the construction of these lattices.     

Dilworth's principal elements

Principal elements were introduced in multiplicative lattices by R. P. Dilworth, following an earlier but less successful attempt in the joint work of Ward and Dilworth. As suggested by their name, principal elements are the analogue in multiplicative lattices of principal ideals in (commutative) rings. Principal elements are the cornerstone on which the theory of multiplicative lattices and abstract ideal theory now largely rests. In this paper, we obtain some new results regarding principal elements and extend some others. In addition, we try to convey what is known and what is not known about the subject. We conclude with a fairly extensive (but likely not exhaustive) bibliography on principal elements.Dedicated to R. P. DilworthPresented by E. T. Schmidt.     

A note on atomistic weak congruence lattices

It is proved that a codistributive element in an atomistic algebraic lattice has a complement, implying that kernels of the related homomorphisms coincide. Some applications to weak congruence lattices of algebras are presented. In particular, necessary and sufficient conditions under which the weak congruence lattice of an algebra is atomistic are given.     

Tarski's Fixpoint Lemma and combinatorial games

Using Tarski's Fixpoint Lemma for order preserving maps of a complete lattice into itself, a new, lattice theoretic proof is given for the existence of persistent strategies for combinatorial games as well as for games with a topological tolerance and games on lattices. Further, the existence of winning strategies is obtained for games on superalgebraic lattices, which includes the case of ordinary combinatorial games. Finally, a basic representation theorem is presented for those lattices.     

On geometric semilattices

We define geometric semilattices, a generalization of geometric lattices. The poset of independent sets of a matroid is another example. We prove several axiomatic and constructive characterizations, for example: geometric semilattices are those semilattices obtained by removing a principal filter from a geometric lattice. We also show that all geometric semilattices are shellable, unifying and extending several previous results.Partially supported by NSF grant MCS 81-03474.     

Constructions of S-lattices

We give a construction of lattices whose covering graphs can be oriented as a graded order with bottom v for any vertex v in the lattice.     

SPECTRAL PROPERTIES OF POSITIVE ELEMENTS IN BANACH LATTICE ALGEBRAS

Abstract

We prove that if a unital Banach lattice algebra has sufficiently many one-dimensional elements and if its unit element has sufficiently many components then its positive elements have spectral properties analogous to those of positive operators on Banach lattices. In particular, if a positive element is irreducible (in the sense that (1—e)xe > 0 for all components e of 1 satisfying 0 ≠ e ≠ 1) and compact, its spectral radius is positive and its spectrum shows cyclic behaviour.     

Simplicial elimination schemes,extremal lattices and maximal antichain lattices

Fix a partial order P=(X, <). We first show that bipartite orders are sufficient to study structural properties of the lattice of maximal antichains. We show that all orders having the same lattice of maximal antichains can be reduced to one representative order (called the poset of irreducibles by Markowsky [14]). We then define the strong simplicial elimination scheme to characterize orders which have distributive lattice of maximal antichains. The notion of simplicial elimination corresponds to the decomposition process described in [14] for extremal lattices. This notion leads to simple greedy algorithms for distributivity checking, lattice recognition and jump number computation. In the last section, we give several algorithms for lattices and orders.     

Graded left modular lattices are supersolvable

We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [MT] by combining results of McNamara [Mc] and Liu [Li]. As part of our proof, we show that the maximum graded quotient of the free product of a chain and a single-element lattice is finite and distributive.Received May 24, 2004; accepted in final form October 12, 2004.     

Prime elements from prime ideals

The prime ideal theorem for distributive lattices (PIT) is shown to imply that any complete distributive lattice with a compact unit has a prime element, which is then used to deduce from PIT that (1) every nontrivial ring with unit has a prime ideal, and (2) every Wallman locale is spatial.     

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.     

On forbidden configurations for strong posets

The concept of strong elements in posets is introduced. Several properties of strong elements in different types of posets are studied. Strong posets are characterized in terms of forbidden structures. It is shown that many of the classical results of lattice theory can be extended to posets. In particular, we give several characterizations of strongness for upper semimodular (USM) posets of finite length. We characterize modular pairs in USM posets of finite length and we investigate the interrelationships between consistence, strongness, and the property of being balanced in USM posets of finite length. In contrast to the situation in upper semimodular lattices, we show that these three concepts do not coincide in USM posets.     

Back-and-forth for systems of antichains

We consider the distributive lattice of all the antichains over a root-system. The main result shows that the first-order theory of the former is determined by that of the latter. It is also shown that this kind of distributive lattices can be thought of as a generalization of that of atomic Boolean algebras.     

Noetherian lattices in which every element is a product of primary elements

We characterize those Noetherian lattices in which every element is a product of primary elements.     

s-Prime elements in multiplicative lattices

Let be aC-lattice which is strong join principally generated. In this paper, we consider prime elements of for which every semiprimary element is primary. We show, for example, that a compact nonmaximal primep with this property is principal. We also show that if every primepm has this property, then is either a one dimensional domain or a primary lattice. It follows that if every primep satisfies the property, and if there are only a finite number of minimal primes in , then is the finite direct product of one-dimensional domains and primary lattices.     

A Simplicial elimination scheme for ⋀-semidistributive lattices and interval collapsing

The purpose of this paper is first to show that -semidistributive lattices can be characterized by a simplicial elimination scheme in the same sense as upper locally distributive lattices or antimatroids. Secondly, we show that this elimination scheme leads to an interval collapsing algorithm and a constructing algorithm for semidistributive lattices.     

Insertion of lattice-valued and hedgehog-valued functions

Problems of inserting lattice-valued functions are investigated. We provide an analogue of the classical insertion theorem of Lane [Proc. Amer. Math. Soc. 49 (1975) 90-94] for L-valued functions where L is a ?-separable completely distributive lattice (i.e. L admits a countable join-dense subset which is free of completely join-irreducible elements). As a corollary we get an L-version of the Katětov-Tong insertion theorem due to Liu and Luo [Topology Appl. 45 (1992) 173-188] (our proof is different and much simpler). We show that ?-separable completely distributive lattices are closed under the formation of countable products. In particular, the Hilbert cube is a ?-separable completely distributive lattice and some join-dense subset is shown to be both order and topologically isomorphic to the hedgehog J(ω) with appropriately defined topology. This done, we deduce an insertion theorem for J(ω)-valued functions which is independent of that of Blair and Swardson [Indian J. Math. 29 (1987) 229-250]. Also, we provide an iff criterion for inserting a pair of semicontinuous function which yields, among others, a characterization of hereditarily normal spaces.