latticoid
A latticoid is a set with two binary operations, the meet and the join on satisfying the following conditions:
- 1.
(idempotence) for any ,
- 2.
(commutativity) and for any , and
- 3.
(absorption) for any .
A latticoid is like a lattice without the associativity assumption, i.e., a lattice is a latticoid that is both meet associative and join associative.
If one of the binary operations is associative, say is associative, we may define a latticoid as a poset as follows:
Clearly, is reflexive, as . If and , then , so is anti-symmetric. Finally, suppose and , then , or , is transitive
.
Once a latticoid is a poset, we may easily visualize it by a diagram (Hasse diagram), much like that of a lattice. Position above if and connect a line segment between and . The following is the diagram of a latticoid that is meet associative but not join associative:
It is not join associative because , whereas .
Given a latticoid , we can define a dual of by using the same underlying set, and define the meet of and in as the join of and in , and the join of and (in ) as the meet of and in . is a meet-associative latticoid iff is join-associative.