|
|
|
|
|
A lower semilattice is a partially ordered set S in which each pair of elements has a greatest lower bound.
A upper semilattice is a partially ordered set S in which each pair of elements has a least upper bound.
Note that it is not normally necessary to distinguish lower from upper semilattices, because one may be converted to the other by reversing the partial order. It is normal practise to refer to either structure as a semilattice and it should be clear from the context whether greatest lower bounds or least upper bounds exist.
Alternatively, a semilattice can be considered to be a commutative band, that is a semigroup which is commutative, and in which every element is idempotent. In this context, semilattices are important elements of semigroup theory and play a key role in the structure theory of commutative semigroups.
A partially ordered set which is both a lower semilattice and an upper semilattice is a lattice.
|
"semilattice" is owned by mclase.
|
|
(view preamble | get metadata)
Cross-references: lattice, commutative semigroups, theory, idempotent, semigroup, band, commutative, clear, structure, normal, partial order, necessary, least upper bound, greatest lower bound, partially ordered set
There are 12 references to this entry.
This is version 3 of semilattice, born on 2002-08-19, modified 2002-08-19.
Object id is 3317, canonical name is Semilattice.
Accessed 7831 times total.
Classification:
| AMS MSC: | 20M99 (Group theory and generalizations :: Semigroups :: Miscellaneous) | | | 06A12 (Order, lattices, ordered algebraic structures :: Ordered sets :: Semilattices) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
