Order of Group Element not less than Order of Power/Proof 1
Jump to navigation
Jump to search
Theorem
Let $\left({G, \circ}\right)$ be a group whose identity is $e$.
Let $g \in G$ be an element of $g$.
Let $\left\lvert{g}\right\rvert$ denote the order of $g$ in $G$.
Then:
- $\forall m \in \Z: \left\lvert{g^m}\right\rvert \le \left\lvert{g}\right\rvert$
where $g^m$ denotes the $m$th power of $g$ in $G$.
Proof
Let $\left\lvert{g}\right\rvert = n$.
Then from Order of Power of Group Element:
- $\forall m \in \Z: \left\lvert{g^m}\right\rvert = \dfrac n {\gcd \left\{ {m, n}\right\} }$
where $\gcd \left\{ {m, n}\right\}$ denotes the greatest common divisor of $m$ and $n$.
The result follows from Greatest Common Divisor is at least 1.
$\blacksquare$