Embedding Coproducts of Partition Lattices
نویسندگان
چکیده
We prove that the lattice EqΩ of all equivalence relations on an infinite set Ω contains, as a 0, 1-sublattice, the 0-coproduct of two copies of itself, thus answering a question by G.M. Bergman. Hence, by using methods initiated by de Bruijn and further developed by Bergman, we obtain that EqΩ also contains, as a sublattice, the coproduct of 2 Ω copies of itself.
منابع مشابه
Cover preserving embedding of modular lattices into partition lattices
Wild, M., Cover preserving embedding of modular lattices into partition lattices, Discrete Mathematics 112 (1993) 207-244. When is a finite modular lattice couer preserving embeddable into a partition lattice? We give some necessary, and slightly sharper sufficient conditions. For example, the class of cover preserving embeddable modular lattices strictly contains the class of acyclic modular l...
متن کاملTwo Embedding Theorems for Finite Lattices
Introduction. One of the important unsolved problems of lattice theory is the problem of embedding every finite lattice in a finite partition lattice. The partition lattice can be considered as the lattice of subspaces of a suitable geometry. By slightly loosening the conditions on this geometry it will be shown that every finite lattice can be embedded in the lattice of subspaces of a finite g...
متن کاملCoproducts of bounded distributive lattices: cancellation
Let L ∗ M denote the coproduct of the bounded distributive lattices L and M . At the 1981 Banff Conference on Ordered Sets, the following question was posed: What is the largest class L of finite distributive lattices such that, for every non-trivial Boolean lattice B and every L ∈ L, B ∗ L = B ∗ L′ implies L = L′? In this note, the problem is solved.
متن کاملCoproducts of Bounded Distributive Lattices
Let LM denote the coproduct of the bounded distributive lattices L and M. At the 1981 Bann Conference on Ordered Sets, the following question was posed: What is the largest class L of nite distributive lattices such that, for every non-trivial Boolean lattice B and every L 2 L, B L = B L 0 implies L = L 0 ? In this note, the problem is solved.
متن کاملGENERALIZED RESIDUATED LATTICES BASED F-TRANSFORM
The aim of the present work is to study the $F$-transform over a generalized residuated lattice. We discuss the properties that are common with the $F$-transform over a residuated lattice. We show that the $F^{uparrow}$-transform can be used in establishing a fuzzy (pre)order on the set of fuzzy sets.
متن کامل