a semilattice is a commutative band
This note explains how a semilattice is the same as a commutative band.
Let be a semilattice, with partial order![]()
and each pair of elements and having a greatest lower bound
![]()
.
Then it is easy to see that the operation
![]()
defines a binary operation
![]()
on which makes it a commutative semigroup, and that every element is idempotent
![]()
since .
Conversely, if is such a semigroup, define iff . Again, it is easy to see that this defines a partial order on , and that greatest lower bounds exist with respect to this partial order, and that in fact .
| Title | a semilattice is a commutative band |
|---|---|
| Canonical name | ASemilatticeIsACommutativeBand |
| Date of creation | 2013-03-22 12:57:28 |
| Last modified on | 2013-03-22 12:57:28 |
| Owner | mclase (549) |
| Last modified by | mclase (549) |
| Numerical id | 6 |
| Author | mclase (549) |
| Entry type | Proof |
| Classification | msc 20M99 |
| Classification | msc 06A12 |
| Related topic | Lattice |