Formal Definition
A partially ordered set (L, ≤) is a complete lattice if every subset A of L has both a greatest lower bound (the infimum, also called the meet) and a least upper bound (the supremum, also called the join) in (L, ≤).
The meet is denoted by, and the join by .
Note that in the special case where A is the empty set the meet of A will be the greatest element of L. Likewise, the join of the empty set yields the least element. Since the definition also assures the existence of binary meets and joins, complete lattices do thus form a special class of bounded lattices.
More implications of the above definition are discussed in the article on completeness properties in order theory.
Read more about this topic: Complete Lattice
Famous quotes containing the words formal and/or definition:
“There must be a profound recognition that parents are the first teachers and that education begins before formal schooling and is deeply rooted in the values, traditions, and norms of family and culture.”
—Sara Lawrence Lightfoot (20th century)
“I’m beginning to think that the proper definition of “Man” is “an animal that writes letters.””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)