## You are here

Homesemigroup of transformations

## Primary tabs

# semigroup of transformations

Let $X$ be a set. A transformation of $X$ is a function from $X$ to $X$.

If $\alpha$ and $\beta$ are transformations on $X$, then their product $\alpha\beta$ is defined (writing functions on the right) by $(x)(\alpha\beta)=((x)\alpha)\beta$.

With this definition, the set of all transformations on $X$ becomes a semigroup, the *full semigroupf of transformations* on $X$, denoted $\mathcal{T}_{X}$.

More generally, a *semigroup of transformations* is any subsemigroup of a full set of transformations.

When $X$ is finite, say $X=\{x_{1},x_{2},\dots,x_{n}\}$, then the transformation $\alpha$ which maps $x_{i}$ to $y_{i}$ (with $y_{i}\in X$, of course) is often written:

$\alpha=\begin{pmatrix}x_{1}&x_{2}&\dots&x_{n}\\ y_{1}&y_{2}&\dots&y_{n}\end{pmatrix}$ |

With this notation it is quite easy to calculate products. For example, if $X=\{1,2,3,4\}$, then

$\begin{pmatrix}1&2&3&4\\ 3&2&1&2\end{pmatrix}\begin{pmatrix}1&2&3&4\\ 2&3&3&4\end{pmatrix}=\begin{pmatrix}1&2&3&4\\ 3&3&2&3\end{pmatrix}$ |

When $X$ is infinite, say $X=\{1,2,3,\ldots\}$, then this notation is still useful for illustration in cases where the transformation pattern is apparent. For example, if $\alpha\in\mathcal{T}_{X}$ is given by $\alpha\colon n\mapsto n+1$, we can write

$\alpha=\begin{pmatrix}1&2&3&4&\dots\\ 2&3&4&5&\dots\end{pmatrix}$ |

## Mathematics Subject Classification

20M20*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