Distributive lattices with strong endomorphism kernel property as direct sums
نویسنده
چکیده مقاله:
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of three lattices, a lattice with exactly one strong element, a lattice which is a direct sum of 2 element lattices with distinguished elements 1 and a lattice which is a direct sum of 2 element lattices with distinguished elements 0, and the sublattice of strong elements is isomorphic to a product of last two mentioned lattices.
منابع مشابه
Direct Product Decompositions of Infinitely Distributive Lattices
Let α be an infinite cardinal. Let Tα be the class of all lattices which are conditionally α-complete and infinitely distributive. We denote by T ′ σ the class of all lattices X such that X is infinitely distributive, σ-complete and has the least element. In this paper we deal with direct factors of lattices belonging to Tα. As an application, we prove a result of Cantor-Bernstein type for latt...
متن کاملDecompositions of Banach Lattices into Direct Sums
We consider the problem of decomposing a Banach lattice Z as a direct sum Z = X @ Y where X and Y are complemented subspaces satisfying a condition of incomparability (e.g. every operator from Y to X is strictly singular). We treat both the atomic and nonatomic cases. In particular we answer a question of Wojtaszczyk by showing that L1 fflL2 has unique structure as a nonatomic Banach lattice. O...
متن کاملThe Uniqueness of the Decomposition of Distributive Lattices into Sums of Boolean Lattices
Let A =< A,≤A> and B =< B,≤B> be lattices such that A ∩ B is a filter in A and an ideal in B, and the orderings ≤A and ≤B coincide on A ∩ B. Then ≤A ∪ ≤B ∪ (≤A ◦ ≤B), is a lattice ordering on A ∪ B and the resulting lattice, called a sum of A and B, is denoted by A ⊕ B. The sum operation was introduced by Wroński [5], and its special case with A∩B = {1A} = {0B} by Troelstra [4]. In particular, ...
متن کاملComposite Distributive Lattices as AnnotationDomains for
In a mediator system based on annotated logics it is a suitable requirement to allow annotations from diierent lattices in one program on a per-predicate basis. These lattices however may be related through common sublattices, hence demanding predicates which are able to carry combinations of annotations, or access to components of annotations. We show both demands to be satisiiable by using va...
متن کامل“ Complete - Simple ” Distributive Lattices
It is well known that the only simple distributive lattice is the twoelement chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences. In this paper we show the existence of infinite complete-simple distributive lattices. “COMPLETE-SIMPLE” DISTRIBUTIVE LATTICES G. GRÄTZER A...
متن کاملDistributive Lattices and Cohomology
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of modules over Dedekind rings. A generalized Chinese remainder theorem is derived as a consequence of the above resolution. The GelfandNaimark duality between finit...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 13 شماره 1
صفحات 45- 54
تاریخ انتشار 2020-07-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023