Free Completely Distributive Lattices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Subdirect-union Representation for Completely Distributive Complete Lattices

4. Proof of Theorem 2. Harish-Chandra [l] and others have proved that every Lie algebra over a field of characteristic zero has a faithful representation. Consequently by Lemma 4, 8 has a faithful representation x—*Qx whose matrices have elements in an algebraic extension $ of g such that t(QxQv) =0 for all x of 31 and all y of 8. We now apply another form of Cartan's criterion for solvability ...

متن کامل

Free Distributive Completions of Partial Complete Lattices

The free distributive completion of a partial complete lattice is the complete lattice that it is freely generated by the partial complete latticèin the most distributive way'. This can be described as being a universal solution in the sense of universal algebra. Free distributive completions generalize the constructions of tensor products and of free completely distributive complete lattices o...

متن کامل

Chain Conditions in the Distributive Free Product of Lattices

1. Introduction. A typical result of this paper is the following. Let Lt, i e I be distributive lattices satisfying the countable chain condition. Then the free product L of these lattices also satisfies the countable chain condition. To be able to state the general result we need some notations. Let trt be an infinite cardinal. A poset (partially ordered set) P is said to satisfy the m-chain c...

متن کامل

“ 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...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1979

ISSN: 0002-9939

DOI: 10.2307/2043137