DMCA
Complete lattices (1992)
| Venue: | Journal of Formalized Mathematics |
| Citations: | 119 - 33 self |
BibTeX
@ARTICLE{Bancerek92completelattices,
author = {Grzegorz Bancerek},
title = {Complete lattices},
journal = {Journal of Formalized Mathematics},
year = {1992}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Summary. In the first section the lattice of subsets of distinct set is introduced. The join and meet operations are, respectively, union and intersection of sets, and the ordering relation is inclusion. It is shown that this lattice is Boolean, i.e. distributive and complementary. The second section introduces the poset generated in a distinct lattice by its ordering relation. Besides, it is proved that posets which have l.u.b.’s and g.l.b.’s for every two elements generate lattices with the same ordering relations. In the last section the concept of complete lattice is introduced and discussed. Finally, the fact that the function f from subsets of distinct set yielding elements of this set is a infinite union of some complete lattice, if f yields an element a for singleton {a} and f ( f ◦X) = f ( ⊔ X) for every subset X, is proved. Some concepts and proofs are based on [8] and [9].
