The Order of Elements in a Group
 Table of Contents

# The Order of Elements in a Group

 Definition: Let $(G, *)$ be a group and let $a \in G$. The Order of $a$ denoted by $|a|$ or $\mathrm{ord}(a)$ is the smallest positive integer $m$ such that $a^m = \underbrace{a \cdot a \cdot … \cdot a}_{m : \mathrm{many \: factors}} = e$ (where $e$ is the identity element of $G$). If no such $m$ exists then $a$ is said to have order $\infty$.

If the operation is multiplicative in nature then we usually define the order of $a \in G$ as above. If the operation is instead additive in nature then we define the order of $a \in G$ as the smallest positive integer $m$ such that $ma = \underbrace{(a + a + … + a)}_{m \: \mathrm{many}} = e$ or $\infty$ if no such positive integer $m$ exists.

## Example 1

If $G$ is any group with identity $e$ then the order of $e$ is $1$.

## Example 2

Consider the group $(\mathbb{Z}_5, +)$ where $+$ is defined for all $x, y \in \mathbb{Z}_5 = \{ 0, 1, 2, 3, 4 \}$ to be:

(1)
\begin{align} \quad x + y = (x + y) \mod 5 \end{align}

The order of $e = 0$ is trivially $1$. The order of $1$ is $5$ since:

(2)
\begin{align} \quad 1^5 = (1 + 1 + 1 + 1 + 1) = 0 \mod 5 \end{align}

The order of $2$ is also $5$. In fact, the orders of $3$ and $4$ are also $5$.

## Example 3

Consider the group $(\mathbb{Z}_6, +)$ where $+$ is defined for all $x, y \in \mathbb{Z}_6 = \{ 0, 1, 2, 3, 4, 5 \}$ to be:

(3)
\begin{align} \quad x + y = (x + y) \mod 6 \end{align}

You should verify that the order of $0$ is $1$, the order of $1$ is $6$, the order of $2$ is $3$, the order of $3$ is $2$, the order of $4$ is $3$, and the order of $5$ is $6$

## Example 4

Consider the group $(\mathbb{R}, +)$. Then every nonzero $x \in \mathbb{R}$ has order infinity since the equation $mx = 0$, $m \geq 1$, has no solution in $\mathbb{R} \setminus \{ 0 \}$.

## Example 5

Consider the group $(\mathbb{R} \setminus \{ 0 \}, \cdot)$. The order of $-1$ is $2$ since $(-1)^2 = 1$.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License