Read More
Date: 14-2-2017
1865
Date: 23-12-2021
1176
Date: 31-12-2021
1266
|
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.
|
|
5 علامات تحذيرية قد تدل على "مشكل خطير" في الكبد
|
|
|
|
|
لحماية التراث الوطني.. العتبة العباسية تعلن عن ترميم أكثر من 200 وثيقة خلال عام 2024
|
|
|