Persistence of Banach lattices under nonlinear order isomorphisms

Ordered vector spaces E and F are said to be order isomorphic if there is a (not necessarily linear) bijection \(T: E\rightarrow F\) such that \(x\ge y\) if and only if \(Tx \ge Ty\) for all \(x,y \in E\). We investigate some situations under which an order isomorphism between two Banach lattices implies the persistence of some linear lattice structure. For instance, it is shown that if a Banach lattice E is order isomorphic to C(K) for some compact Hausdorff space K, then E is (linearly) isomorphic to C(K) as a Banach lattice. Similar results hold for Banach lattices order isomorphic to \(c_{0}\), and for Banach lattices that contain a closed sublattice order isomorphic to \(c_{0}\).     

Tight embedding of modular lattices into partition lattices: progress and program

A famous Theorem of Pudlak and T?ma states that each finite lattice L occurs as sublattice of a finite partition lattice. Here we derive, for modular lattices L, necessary and sufficient conditions for cover-preserving embeddability. Aspects of our work relate to Bjarni Jónsson.     

A proof of Frankl’s union-closed sets conjecture for dismantlable lattices

For a lattice L, let Princ(L) denote the ordered set of principal congruences of L. In a pioneering paper, G. Grätzer characterized the ordered set Princ(L) of a finite lattice L; here we do the same for a countable lattice. He also showed that every bounded ordered set H is isomorphic to Princ(L) of a bounded lattice L. We prove a related statement: if an ordered set H with a least element is the union of a chain of principal ideals (equivalently, if 0 \({\in}\) H and H has a cofinal chain), then H is isomorphic to Princ(L) of some lattice L.     

On lattices embeddable into subsemigroup lattices. III: Nilpotent semigroups

We prove that the class of the lattices embeddable into subsemigroup lattices of n-nilpotent semigroups is a finitely based variety for all n < ω. Repnitski? showed that each lattice embeds into the subsemigroup lattice of a commutative nilsemigroup of index 2. In this proof he used a result of Bredikhin and Schein which states that each lattice embeds into the suborder lattices of an appropriate order. We give a direct proof of the Repnitski? result not appealing to the Bredikhin-Schein theorem, so answering a question in a book by Shevrin and Ovsyannikov.     

Meet-irreducible congruence lattices

The system of all congruences of an algebra (A, F) forms a lattice, denoted \({{\mathrm{Con}}}(A, F)\). Further, the system of all congruence lattices of all algebras with the base set A forms a lattice \(\mathcal {E}_A\). We deal with meet-irreducibility in \(\mathcal {E}_A\) for a given finite set A. All meet-irreducible elements of \(\mathcal {E}_A\) are congruence lattices of monounary algebras. Some types of meet-irreducible congruence lattices were described in Jakubíková-Studenovská et al. (2017). In this paper, we prove necessary and sufficient conditions under which \({{\mathrm{Con}}}(A, f)\) is meet-irreducible in the case when (A, f) is an algebra with short tails (i.e., f(x) is cyclic for each \(x \in A\)) and in the case when (A, f) is an algebra with small cycles (every cycle contains at most two elements).     

Relative Projectivity and Transferability for Partial Lattices

A partial lattice P is ideal-projective, with respect to a class \(\mathcal {C}\) of lattices, if for every \(K\in \mathcal {C}\) and every homomorphism φ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f:P→K for φ that are also homomorphisms of partial lattices. This extends the traditional concept of (sharp) transferability of a lattice with respect to \(\mathcal {C}\). We prove the following: (1) A finite lattice P, belonging to a variety \(\mathcal {V}\), is sharply transferable with respect to \(\mathcal {V}\) iff it is projective with respect to \(\mathcal {V}\) and weakly distributive lattice homomorphisms, iff it is ideal-projective with respect to \(\mathcal {V}\), (2) Every finite distributive lattice is sharply transferable with respect to the class \(\mathcal {R}_{\text {mod}}\) of all relatively complemented modular lattices, (3) The gluing D ₄ of two squares, the top of one being identified with the bottom of the other one, is sharply transferable with respect to a variety \(\mathcal {V}\) iff \(\mathcal {V}\) is contained in the variety \(\mathcal {M}_{\omega }\) generated by all lattices of length 2, (4) D ₄ is projective, but not ideal-projective, with respect to \(\mathcal {R}_{\text {mod}}\) , (5) D ₄ is transferable, but not sharply transferable, with respect to the variety \(\mathcal {M}\) of all modular lattices. This solves a 1978 problem of G. Grätzer, (6) We construct a modular lattice whose canonical embedding into its ideal lattice is not pure. This solves a 1974 problem of E. Nelson.     

Chromatic number and subtrees of graphs

Let G and H be two graphs. We say that G induces H if G has an induced subgraph isomorphic to H: A. Gyárfás and D. Sumner, independently, conjectured that, for every tree T. there exists a function f _T ; called binding function, depending only on T with the property that every graph G with chromatic number f _T (ω(G)) induces T. A. Gyárfás, E. Szemerédi and Z. Tuza confirmed the conjecture for all trees of radius two on triangle-free graphs, and H. Kierstead and S. Penrice generalized the approach and the conclusion of A. Gyárfás et al. onto general graphs. A. Scott proved an interesting topological version of this conjecture asserting that for every integer k and every tree T of radius r, every graph G with ω(G) ? k and sufficient large chromatic number induces a subdivision of T of which each edge is subdivided at most O(14 ^r-1(r - 1)!) times. We extend the approach of A. Gyárfás and present a binding function for trees obtained by identifying one end of a path and the center of a star. We also improve A. Scott's upper bound by modifying his subtree structure and partition technique, and show that for every integer k and every tree T of radius r, every graph with ω(G) ? k and sufficient large chromatic number induces a subdivision of T of which each edge is subdivided at most O(6 ^r?2) times.     

Unbounded disjointness preserving linear functionals and operators

Let E and F be Banach lattices. We show first that the disjointness preserving linear functionals separate the points of any infinite dimensional Banach lattice E, which shows that in this case the unbounded disjointness preserving operators from \({E\to F}\) separate the points of E. Then we show that every disjointness preserving operator \({T:E\to F}\) is norm bounded on an order dense ideal. In case E has order continuous norm, this implies that every unbounded disjointness preserving map \({T:E\to F}\) has a unique decomposition T = R + S, where R is a bounded disjointness preserving operator and S is an unbounded disjointness preserving operator, which is zero on a norm dense ideal. For the case that E = C(X), with X a compact Hausdorff space, we show that every disjointness preserving operator \({T:C(X)\to F}\) is norm bounded on a norm dense sublattice algebra of C(X), which leads then to a decomposition of T into a bounded disjointness preserving operator and a finite sum of unbounded disjointness preserving operators, which are zero on order dense ideals.     

Universal varieties of quasi-Stone algebras

In this paper, we are mainly concerned with semicontinuity of complete lattices and their distributive reflections, introduced by Rav in 1989. We prove that for a complete lattice L, the distributive reflection L_d is isomorphic to the lattice of all radicals determined by principal ideals of L in the set-inclusion order, obtaining a method to depict the distributive reflection of a given lattice. It is also proved that if a complete lattice L is semicontinuous and every semiprime element x ∈ L is the largest in d(x), then L_d is continuous whenever the distributive reflector d is Scott continuous. We construct counterexamples to confirm a conjecture and solve two open problems posed by Zhao in 1997.     

Inflation of Finite Lattices Along All-or-nothing Sets

We introduce a new generalization of Alan Day’s doubling construction. For ordered sets \(\mathcal {L}\) and \(\mathcal {K}\) and a subset \(E \subseteq \ \leq _{\mathcal {L}}\) we define the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) arising from inflation of \(\mathcal {L}\) along E by \(\mathcal {K}\). Under the restriction that \(\mathcal {L}\) and \(\mathcal {K}\) are finite lattices, we find those subsets \(E \subseteq \ \leq _{\mathcal {L}}\) such that the ordered set \(\mathcal {L} \star _{E} \mathcal {K}\) is a lattice. Finite lattices that can be constructed in this way are classified in terms of their congruence lattices.A finite lattice is binary cut-through codable if and only if there exists a 0?1 spanning chain \(\left \{\theta _{i}\colon 0 \leq i \leq n \right \}\) in \(Con(\mathcal {L})\) such that the cardinality of the largest block of ?? _i /?? _i?1 is 2 for every i with 1≤i≤n. These are exactly the lattices that can be constructed by inflation from the 1-element lattice using only the 2-element lattice. We investigate the structure of binary cut-through codable lattices and describe an infinite class of lattices that generate binary cut-through codable varieties.     

A selfdual embedding of the free lattice over countably many generators into the three-generated one

By a 1941 result of Whitman, the free lattice FL(3) = FL(x, y, z) includes a sublattice FL(ω) freely generated by infinitely many elements. Let δ denote the unique dual automorphism of FL(x, y, z) that acts identically on the set {x, y, z} of generators. We prove that FL(x, y, z) has a sublattice S isomorphic to FL(ω) such that δ(S) =  S.     

Lattices with Defining Relations Close to Distributivity

We consider the 3-generated lattices whose generators enjoy the defining relations of the type a∨(b∧c) = (a∨b)∧(a∨c). Moreover, if the lattice is finite then we obtain its diagram; otherwise, we prove that the corresponding lattice is infinite.     

Tensor products and relation quantales

A classical tensor product \({A \otimes B}\) of complete lattices A and B, consisting of all down-sets in \({A \times B}\) that are join-closed in either coordinate, is isomorphic to the complete lattice Gal(A,B) of Galois maps from A to B, turning arbitrary joins into meets. We introduce more general kinds of tensor products for closure spaces and for posets. They have the expected universal property for bimorphisms (separately continuous maps or maps preserving restricted joins in the two components) into complete lattices. The appropriate ingredient for quantale constructions is here distributivity at the bottom, a generalization of pseudocomplementedness. We show that the truncated tensor product of a complete lattice B with itself becomes a quantale with the closure of the relation product as multiplication iff B is pseudocomplemented, and that the tensor product has a unit element iff B is atomistic. The pseudocomplemented complete lattices form a semicategory in which the hom-set between two objects is their tensor product. The largest subcategory of that semicategory has as objects the atomic boolean complete lattices, which is equivalent to the category of sets and relations. More general results are obtained for closure spaces and posets.     

Symmetric decompositions and the strong Sperner property for noncrossing partition lattices

We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for \(d,n\ge 2\) admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property and their rank-generating polynomials are symmetric, unimodal, and \(\gamma \)-nonnegative. We use computer computations to complete the proof that every noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus answering affirmatively a question raised by D. Armstrong.     

Varieties of Birkhoff Systems Part I

A Birkhoff system is an algebra that has two binary operations ? and + , with each being commutative, associative, and idempotent, and together satisfying x?(x + y) = x+(x?y). Examples of Birkhoff systems include lattices, and quasilattices, with the latter being the regularization of the variety of lattices. A number of papers have explored the bottom part of the lattice of subvarieties of Birkhoff systems, in particular the role of meet and join distributive Birkhoff systems. Our purpose in this note is to further explore the lattice of subvarieties of Birkhoff systems. A primary tool is consideration of splittings and finite bichains, Birkhoff systems whose join and meet reducts are both chains. We produce an infinite family of subvarieties of Birkhoff systems generated by finite splitting bichains, and describe the poset of these subvarieties. Consideration of these splitting varieties also allows us to considerably extend knowledge of the lower part of the lattice of subvarieties of Birkhoff systems     

Partial Order Embeddings with Convex Range

A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between two lattices with convex range is a continuous lattice homomorphism. A number of posets are considered; for one of the simplest examples, we prove that every product order embedding σ : ?^? → ?^? with convex range is of the form

$$ \sigma(x)(n)=\left( (x\circ g_{\sigma})+y_{\sigma}\right)(n) ~~~~\text{if}~ n\in K_{\sigma}, $$

(1)

and σ(x)(n) = y _σ (n) otherwise, for all x ∈ ?^?, where K _σ ? ?, g _σ : K _σ → ? is a bijection and y _σ ∈ ?^?. The most complex poset examined here is the quotient of the lattice of Baire measurable functions, with codomain of the form ? ^I for some index set I, modulo equality on a comeager subset of the domain, with its ‘natural’ ordering.

     

Sums of sets of lattice points and unimodular coverings of polytopes

If P is a lattice polytope (that is, the convex hull of a finite set of lattice points in \({\mathbf{R}^n}\)), then every sum of h lattice points in P is a lattice point in the h-fold sumset hP. However, a lattice point in the h-fold sumset hP is not necessarily the sum of h lattice points in P. It is proved that if the polytope P is a union of unimodular simplices, then every lattice point in the h-fold sumset hP is the sum of h lattice points in P.     

Subdirectly irreducible commutative multiplicatively idempotent semirings

Commutative multiplicatively idempotent semirings were studied by the authors and F. ?vr?ek, where the connections to distributive lattices and unitary Boolean rings were established. The variety of these semirings has nice algebraic properties and hence there arose the question to describe this variety, possibly by its subdirectly irreducible members. For the subvariety of so-called Boolean semirings, the subdirectly irreducible members were described by F. Guzmán. He showed that there were just two subdirectly irreducible members, which are the 2-element distributive lattice and the 2-element Boolean ring. We are going to show that although commutative multiplicatively idempotent semirings are at first glance a slight modification of Boolean semirings, for each cardinal n > 1, there exist at least two subdirectly irreducible members of cardinality n and at least 2ⁿ such members if n is infinite. For \({n \in \{2, 3, 4\}}\) the number of subdirectly irreducible members of cardinality n is exactly 2.     

A New Approach to the Finite Lattice Representation Problem

It is an open problem to decide whether or not every finite lattice is isomorphic to the congruence lattice of a finite algebra. Pálfy and Pudlák have reduced this problem to the question: is every finite lattice isomorphic to an interval in the subgroup lattice of a finite group? It is generally believed that this question has a negative answer, and to date most work has been directed towards finding a lattice of height 2 that does not so arise. These efforts have culminated in the work of Lucchini and the present author which reduces the problem to a series of questions concerning the finite simple groups. However, these questions are not readily resolvable. In this paper we extend the scope of investigation to a much wider class of lattices in the hope of reducing to questions that can be resolved.     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.