PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] a semilattice is a commutative band (Proof)

This note explains how a semilattice is the same as a commutative band.

Let $ S$ be a semilattice, with partial order $ <$ and each pair of elements $ x$ and $ y$ having a greatest lower bound $ x \wedge y$. Then it is easy to see that the operation $ \wedge$ defines a binary operation on $ S$ which makes it a commutative semigroup, and that every element is idempotent since $ x \wedge x = x$.

Conversely, if $ S$ is such a semigroup, define $ x \leq y$ iff $ x = xy$. Again, it is easy to see that this defines a partial order on $ S$, and that greatest lower bounds exist with respect to this partial order, and that in fact $ x \wedge y = xy$.



"a semilattice is a commutative band" is owned by mclase.
(view preamble)

View style:

See Also: lattice


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: iff, semigroup, idempotent, commutative semigroup, binary operation, operation, easy to see, greatest lower bound, partial order, band, commutative, semilattice
There are 2 references to this entry.

This is version 3 of a semilattice is a commutative band, born on 2002-08-19, modified 2002-08-20.
Object id is 3320, canonical name is ASemilatticeIsACommutativeBand.
Accessed 1930 times total.

Classification:
AMS MSC20M99 (Group theory and generalizations :: Semigroups :: Miscellaneous)
 06A12 (Order, lattices, ordered algebraic structures :: Ordered sets :: Semilattices)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)