Munn Semigroup
   HOME

TheInfoList



OR:

In mathematics, the Munn
semigroup In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', ...
is the inverse semigroup of isomorphisms between principal ideals of a
semilattice In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a ...
(a commutative semigroup of idempotents). Munn semigroups are named for the Scottish mathematician Walter Douglas Munn (1929–2008).


Construction's steps

Let E be a semilattice. 1) For all ''e'' in ''E'', we define ''Ee'': =  which is a
principal ideal In mathematics, specifically ring theory, a principal ideal is an ideal I in a ring R that is generated by a single element a of R through multiplication by every element of R. The term also has another, similar meaning in order theory, where ...
of ''E''. 2) For all ''e'', ''f'' in ''E'', we define ''T''''e'',''f'' as the set of isomorphisms of ''Ee'' onto ''Ef''. 3) The Munn semigroup of the
semilattice In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a ...
''E'' is defined as: ''T''''E'' := \bigcup_ . The semigroup's operation is composition of partial mappings. In fact, we can observe that ''T''''E'' ⊆ ''I''''E'' where ''I''''E'' is the
symmetric inverse semigroup __NOTOC__ In abstract algebra, the set of all partial bijections on a set ''X'' ( one-to-one partial transformations) forms an inverse semigroup, called the symmetric inverse semigroup (actually a monoid) on ''X''. The conventional notation for the ...
because all isomorphisms are partial one-one maps from subsets of ''E'' onto subsets of ''E''. The
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
s of the Munn semigroup are the identity maps 1''Ee''.


Theorem

For every semilattice E, the semilattice of idempotents of T_E is isomorphic to E.


Example

Let E=\. Then E is a semilattice under the usual ordering of the natural numbers (0 < 1 < 2 < ...). The principal ideals of E are then En=\ for all n. So, the principal ideals Em and En are isomorphic if and only if m=n. Thus T_ = where 1_ is the identity map from En to itself, and T_=\emptyset if m\not=n. The semigroup product of 1_ and 1_ is 1_. In this example, T_E = \ \cong E.


References

*. *{{citation, last=Mitchell, first=James D., title=Munn semigroups of semilattices of size at most 7, url=http://www-groups.mcs.st-andrews.ac.uk/~jamesm/munn/index.php, year=2011. Semigroup theory