# Commutativity of Powers in Semigroup

 It has been suggested that this page or section be merged into Powers of Commuting Elements of Semigroup Commute. (Discuss)

## Theorem

Let $\left ({S, \circ}\right)$ be a semigroup.

Let $a, b \in S$ both be cancellable elements of $S$.

Then:

$\forall m, n \in \N_{>0}: a^m \circ b^n = b^n \circ a^m \iff a \circ b = b \circ a$

## Proof

### Necessary Condition

Let $a, b \in S: a \circ b = b \circ a$.

$\forall m, n \in \N_{>0}: a^m \circ b^n = b^n \circ a^m$

$\Box$

### Sufficient Condition

For the above relationships and equalities to hold, it follows that $a$ and $b$ must commute.

The result follows.

$\blacksquare$