Semilattice - Algebraic Definition

Algebraic Definition

A "meet-semilattice" is an algebraic structure 〈S, ∧〉 consisting of a set S with a binary operation ∧, called meet, such that for all members x, y, and z of S, the following identities hold:

Associativity
x ∧ (yz) = (xy) ∧ z
Commutativity
xy = yx
Idempotency
xx = x

A meet-semilattice 〈S, ∧〉 is bounded if S includes an identity element 1 such that x ∧ 1 = x for all x in S.

If the symbol ∨, called join, replaces ∧ in the definition just given, the structure is called a join-semilattice. One can be ambivalent about the particular choice of symbol for the operation, and speak simply of semilattices.

A semilattice is an idempotent, commutative semigroup. Alternatively, a semilattice is a commutative band. A bounded semilattice is an idempotent commutative monoid.

A partial order is induced on a meet-semilattice by setting xy whenever xy=x. For a join-semilattice, the order is induced by setting xy whenever xy=y. In a bounded meet-semilattice, the identity 1 is the greatest element of S. Similarly, an identity element in a join semilattice is a least element.

Read more about this topic:  Semilattice

Famous quotes containing the words algebraic and/or definition:

    I have no scheme about it,—no designs on men at all; and, if I had, my mode would be to tempt them with the fruit, and not with the manure. To what end do I lead a simple life at all, pray? That I may teach others to simplify their lives?—and so all our lives be simplified merely, like an algebraic formula? Or not, rather, that I may make use of the ground I have cleared, to live more worthily and profitably?
    Henry David Thoreau (1817–1862)

    I’m beginning to think that the proper definition of “Man” is “an animal that writes letters.”
    Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)