Munn semigroup

Munn semigroup

In mathematics, the Munn semigroup is built from an arbitrary semilattice E.

Contents

Construction's steps

1) For all e in E, we define Ee: = {i ∈ E : i ≤ e} which is an principal ideal of E.

2)We define U the uniform relation on E. U: = { (ef) ∈ E × E : Ee ≃ Ef}

3) For all (ef) in U, we define Te,f as the set of isomorphisms of Ee onto Ef.

4) Finally, the Munn semigroup of the semilattice E is defined as: Te := ∐ { Te,f : (ef) ∈ U }.

The semigroup's operation is the composition of maps. In fact, we can observe that Te ⊆ Ie where Ie is the symmetric inverse semigroup because all isomorphisms are partial one-one maps from subsets of E onto subsets of E.

The idempotents of the Munn semigroup are the identity maps 1Ee.

Theorem

For every semilattice E, the idemtpotents' semilattice of TE is isomorph to E.

Example

Let E={0,1,2,...} a semilattice (0 < 1 < 2 < ...) Then for all n, En={0,1,2,...,n}

So, EmEn ⇔ m=n

Hence, U={(n,n) : n ∈ E} = 1E the identity map from E in E. In this case, we say that E is anti-uniform.

Finally, Tn,n = {1En} where 1En is the identity map between En and itself.

 \implies T_E = \{1_E0, 1_E1, 1_E2, \ldots \} \cong E. \,

Here we can remark that as the theorem stipulated, the semilattice of the idempotents of TE is isomorph to E. In fact, in this example, the whole semigroup is isomorph to E because it is only filled with idempotents.

References

  • Howie, John M. (1995), Introduction to semigroup theory, Oxford: Oxford science publication .

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Semigroup with involution — In mathematics, in semigroup theory, an involution in a semigroup is a transformation of the semigroup which is its own inverse and which is an anti automorphism of the semigroup. A semigroup in which an involution is defined is called a… …   Wikipedia

  • Inverse semigroup — In mathematics, an inverse semigroup S is a semigroup in which every element x in S has a unique inverse y in S in the sense that x = xyx and y = yxy. Inverse semigroups appear in a range of contexts; for example, they can be employed in the… …   Wikipedia

  • ПРОСТАЯ ПОЛУГРУППА — полугруппа, не содержащая собственных идеалов или конгруэнции того или иного фиксированного типа. В зависимости от рассматриваемого тина возникают различные типы П. и.: идеально простая не содержащая собственных двусторонних идеалов (термин П. п …   Математическая энциклопедия

  • Word problem (mathematics) — In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements, is the algorithmic problem of deciding whether two given representatives represent the same element of the set.… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”