Read More
Date: 14-2-2017
![]()
Date: 5-1-2022
![]()
Date: 11-1-2022
![]() |
A partially ordered set (or ordered set or poset for short) is called a complete lattice if every subset
of
has a least upper bound (supremum,
) and a greatest lower bound (infimum,
) in
.
Taking shows that every complete lattice
has a greatest element (maximum,
) and a least element (minimum,
).
Of course, every complete lattice is a lattice. Moreover, every lattice with a finite set
is a complete lattice.
REFERENCES:
Birkhoff, G. Lattice Theory, 3rd ed. Providence, RI: Amer. Math. Soc., 1967.
Grätzer, G. General Lattice Theory, 2nd ed. Boston, MA: Birkhäuser, 1998.
|
|
التوتر والسرطان.. علماء يحذرون من "صلة خطيرة"
|
|
|
|
|
مرآة السيارة: مدى دقة عكسها للصورة الصحيحة
|
|
|
|
|
نحو شراكة وطنية متكاملة.. الأمين العام للعتبة الحسينية يبحث مع وكيل وزارة الخارجية آفاق التعاون المؤسسي
|
|
|