Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Complete lattice
Summary
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.
Complete lattices must not be confused with complete partial orders (cpos), which constitute a strictly more general class of partially ordered sets. More specific complete lattices are complete Boolean algebras and complete Heyting algebras (locales).
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 .
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 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.
In order theory, arbitrary meets can be expressed in terms of arbitrary joins and vice versa (for details, see completeness (order theory)). In effect, this means that it is sufficient to require the existence of either all meets or all joins to obtain the class of all complete lattices.
As a consequence, some authors use the terms complete meet-semilattice or complete join-semilattice as another way to refer to complete lattices. Though similar on objects, the terms entail different notions of homomorphism, as will be explained in the below section on morphisms.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.