Orders of Elements in Abstract Algebra
Imagine students, that you keep applying a group action over and over again—like rotating a square, or adding the same number again and again in modular arithmetic 🔁. At some point, you may come back to where you started. The number of steps it takes to return is called the order of the element. This idea is one of the most important links between group behavior, cosets, and Lagrange’s Theorem.
What you will learn
By the end of this lesson, students, you should be able to:
- Explain what the order of an element means in a group.
- Find the order of an element in common examples.
- Use the definition of order to solve group problems.
- Connect element orders to cosets and Lagrange’s Theorem.
- Recognize why orders help describe the structure of a group.
What is the order of an element?
In a group $G$ with identity element $e$, the order of an element $a \in G$ is the smallest positive integer $n$ such that
$$a^n = e.$$
If no such positive integer exists, then $a$ is said to have infinite order.
This definition uses repeated group operation. In multiplicative notation, we write powers like $a^2 = aa$, $a^3 = aaa$, and so on. In additive groups, the idea is similar but written as repeated addition. For example, in an additive group, the order of $a$ is the smallest positive integer $n$ such that
$$na = 0.$$
Here, $0$ is the identity element in additive notation.
A simple way to think about order is this: the order counts how many times you need to combine an element with itself before you get back to the identity 🎯.
Example in modular arithmetic
Consider the additive group $\mathbb{Z}_{6} = \{0,1,2,3,4,5\}$ under addition modulo $6$.
Take the element $2$. We compute:
$$1\cdot 2 = 2,$$
$$2\cdot 2 = 4,$$
$$3\cdot 2 = 0 \pmod{6}.$$
So the order of $2$ in $\mathbb{Z}_{6}$ is $3$.
Why? Because $3$ is the smallest positive integer with
$$3(2) = 0 \pmod{6}.$$
Now take the element $1$ in $\mathbb{Z}_{6}$. Then:
$$6\cdot 1 = 0 \pmod{6},$$
and no smaller positive integer works. So the order of $1$ is $6$.
How to find the order of an element
There are several common methods for finding the order of an element, depending on the group.
1. Direct computation
If the group is small, list powers of the element until you reach the identity.
For example, in a group of symmetries, you might repeatedly rotate or reflect an object until it looks the same again.
Suppose $r$ represents a rotation by $90^\circ$ of a square. Then:
$$r^1 = 90^\circ,$$
$$r^2 = 180^\circ,$$
$$r^3 = 270^\circ,$$
$$r^4 = 360^\circ = e.$$
So the order of $r$ is $4$.
2. Use known group structure
In cyclic groups, orders are often easy to determine. In the cyclic group $\mathbb{Z}_n$ under addition modulo $n$, the order of an element $k$ is
$$\frac{n}{\gcd(n,k)}.$$
For example, in $\mathbb{Z}_{12}$, the order of $4$ is
$$\frac{12}{\gcd(12,4)} = \frac{12}{4} = 3.$$
Indeed,
$$3\cdot 4 = 12 \equiv 0 \pmod{12}.$$
3. Use subgroup information
If you know the subgroup generated by $a$, written $\langle a \rangle$, then the order of $a$ is exactly the number of elements in $\langle a \rangle$.
For example, if
$$\langle a \rangle = \{e,a,a^2,a^3\},$$
then the order of $a$ is $4$.
This is because the powers repeat after $4$ steps.
The subgroup generated by an element
The set of all powers of an element $a$ forms a subgroup called the cyclic subgroup generated by $a$:
$$\langle a \rangle = \{a^n \mid n \in \mathbb{Z}\}.$$
If $a$ has finite order $n$, then
$$\langle a \rangle = \{e,a,a^2,\dots,a^{n-1}\}.$$
This subgroup is important because it shows how one element can generate a whole piece of the group structure.
Example: In $\mathbb{Z}_{8}$, the element $3$ has order $8$ because
$$\gcd(8,3)=1,$$
so
$$\langle 3 \rangle = \{0,3,6,1,4,7,2,5\} = \mathbb{Z}_8.$$
That means $3$ generates the entire group. students, this is a great example of how one element can “reach” every part of a cyclic group 🔄.
Connection to Lagrange’s Theorem
Now let’s connect orders of elements to cosets and Lagrange’s Theorem.
Lagrange’s Theorem says that if $H$ is a subgroup of a finite group $G$, then
$$|H| \mid |G|,$$
which means the order of $H$ divides the order of $G$.
Since $\langle a \rangle$ is a subgroup of $G$, it follows that the order of $a$ divides the order of $G$ whenever $G$ is finite.
So if $|G| = 12$, then the order of any element of $G$ must be one of the divisors of $12$:
$$1,2,3,4,6,12.$$
This is very useful. For example, in a group of order $12$, you can immediately rule out an element of order $5$ or $7$, because those numbers do not divide $12$.
Why this matters
Suppose you are studying a group $G$ with $|G| = 15$. If an element $a \in G$ has finite order, then its order must divide $15$. So possible orders are
$$1,3,5,15.$$
If someone claims an element has order $6$, you can reject that claim using Lagrange’s Theorem.
This is a powerful way to test whether a result is possible without doing many calculations.
Orders and cosets
Cosets are part of the same story because the size of a subgroup determines how the group is split into pieces.
If $H$ is a subgroup of $G$, then a left coset of $H$ in $G$ has the form
$$gH = \{gh : h \in H\},$$
and a right coset has the form
$$Hg = \{hg : h \in H\}.$$
When $H = \langle a \rangle$, the subgroup generated by an element, cosets help organize the group into equal-sized blocks. The size of each coset is
$$|H|,$$
which is the order of the element if $H = \langle a \rangle$.
So if an element $a$ has order $n$, then the subgroup $\langle a \rangle$ has $n$ elements, and the cosets of $\langle a \rangle$ each have $n$ elements too.
This is a direct connection between element order and the partitioning idea behind cosets.
Example
Let $G = \mathbb{Z}_{12}$ and let $H = \langle 4 \rangle$.
We found earlier that $4$ has order $3$, so
$$H = \{0,4,8\}.$$
The index of $H$ in $G$ is
$$[G:H] = \frac{|G|}{|H|} = \frac{12}{3} = 4.$$
So there are $4$ distinct cosets, each with $3$ elements. The order of $4$ tells us the size of the subgroup, and the subgroup size tells us how many cosets appear.
Common mistakes to avoid
Here are a few things students should watch carefully for:
- The order of an element is not the same as the order of the whole group.
- The smallest positive $n$ matters. If $a^6=e$ and $a^3=e$, then the order is $3$, not $6$.
- In additive groups, use $na=0$ instead of $a^n=e$.
- The order can be infinite in some groups, such as $(\mathbb{Z}, +)$, where no positive integer $n$ satisfies $n\cdot 1 = 0$.
- Lagrange’s Theorem applies to finite groups, so the divisibility conclusion is for finite groups.
Conclusion
The order of an element tells you how long it takes for repetition to return to the identity. It is a central idea in group theory because it reveals the structure created by repeated use of an element. students, once you know the order of an element, you can understand its cyclic subgroup, predict possible behaviors in a finite group, and apply Lagrange’s Theorem to check whether certain orders are possible.
Orders of elements fit naturally into the study of cosets because the subgroup generated by an element has a size equal to that order, and cosets divide the group into equal pieces. That makes element order a bridge between individual elements and the larger structure of the group 🌟.
Study Notes
- The order of an element $a$ is the smallest positive integer $n$ such that $a^n = e$.
- In additive notation, the order is the smallest positive integer $n$ such that $na = 0$.
- If no such $n$ exists, the element has infinite order.
- The subgroup generated by $a$ is $\langle a \rangle = \{a^n \mid n \in \mathbb{Z}\}$.
- If $a$ has finite order $n$, then $\langle a \rangle = \{e,a,a^2,\dots,a^{n-1}\}$.
- In a finite group $G$, the order of any element divides $|G|$ by Lagrange’s Theorem.
- Left cosets have the form $gH$ and right cosets have the form $Hg$.
- If $H = \langle a \rangle$, then $|H|$ equals the order of $a$.
- The index of $H$ in $G$ is $[G:H] = \frac{|G|}{|H|}$ when $G$ is finite.
- Orders of elements help organize groups into cyclic subgroups and equal-sized cosets.