## You are here

Homesemilattice decomposition of a semigroup

## Primary tabs

# semilattice decomposition of a semigroup

A semigroup $S$ has a *semilattice decomposition* if we can write $S=\bigcup_{{\gamma\in\Gamma}}S_{\gamma}$ as a disjoint union of subsemigroups, indexed by elements of a semilattice $\Gamma$, with the additional condition that $x\in S_{\alpha}$ and $y\in S_{\beta}$ implies $xy\in S_{{\alpha\beta}}$.

Semilattice decompositions arise from homomorphims of semigroups onto semilattices. If $\phi\colon S\to\Gamma$ is a surjective homomorphism, then it is easy to see that we get a semilattice decomposition by putting $S_{\gamma}=\phi^{{-1}}(\gamma)$ for each $\gamma\in\Gamma$. Conversely, every semilattice decomposition defines a map from $S$ to the indexing set $\Gamma$ which is easily seen to be a homomorphism.

A third way to look at semilattice decompositions is to consider the congruence $\rho$ defined by the homomorphism $\phi\colon S\to\Gamma$. Because $\Gamma$ is a semilattice, $\phi(x^{2})=\phi(x)$ for all $x$, and so $\rho$ satisfies the constraint that $x\,\rho\,x^{2}$ for all $x\in S$. Also, $\phi(xy)=\phi(yx)$ so that $xy\,\rho\,yx$ for all $x,y\in S$.
A congruence $\rho$ which satisfies these two conditions is called a *semilattice congruence*.

Conversely, a semilattice congruence $\rho$ on $S$ gives rise to a homomorphism from $S$ to a semilattice $S/\rho$. The $\rho$-classes are the components of the decomposition.

## Mathematics Subject Classification

20M10*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier