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:
“That anger can be expressed through words and non-destructive activities; that promises are intended to be kept; that cleanliness and good eating habits are aspects of self-esteem; that compassion is an attribute to be prized—all these lessons are ones children can learn far more readily through the living example of their parents than they ever can through formal instruction.”
—Fred Rogers (20th century)
“Although there is no universal agreement as to a definition of life, its biological manifestations are generally considered to be organization, metabolism, growth, irritability, adaptation, and reproduction.”
—The Columbia Encyclopedia, Fifth Edition, the first sentence of the article on “life” (based on wording in the First Edition, 1935)