Order of a Group Element

Core Idea

The order of element a is the smallest positive integer n with aⁿ = e. Infinite order elements exist in infinite groups. The order divides |G| for finite groups; elements of order n generate cyclic subgroups of order n.

How It's Best Learned

Compute orders in Z/nZ and symmetric groups. Verify that the set {e, a, a², ..., a^n-1} forms a cyclic subgroup of order n.

Common Misconceptions

• Confusing the order of an element with the order of the group containing it.
• Assuming the order is always positive; we define it only for finite orders.

Explainer

From cyclic groups, you already know that a single element a can generate an entire group by repeatedly applying the group operation: a, a², a³, and so on. The order of an element formalizes how long this process takes before you return to the identity. Formally, ord(a) is the smallest positive integer n such that aⁿ = e. If no such n exists, a has infinite order. Think of it as the "period" of a in the group — after n steps, you're back where you started.

Computing order is concrete and mechanical. In ℤ/12ℤ (integers mod 12 under addition), the element 4 has order 3, because 4+4+4 = 12 ≡ 0 (mod 12) — three steps to reach the identity. The element 5 has order 12, because gcd(5,12) = 1, so 5 generates the whole group before returning to 0. In the symmetric group S₃, a 3-cycle like (1 2 3) has order 3 (apply it three times and every element returns to its original position), while a transposition (1 2) has order 2. In general, the order of a k-cycle in Sₙ is k, and the order of a product of disjoint cycles is the least common multiple of their lengths.

A crucial structural fact: the powers {e, a, a², ..., aⁿ⁻¹} form a cyclic subgroup of order n. This subgroup is generated by a and is isomorphic to ℤ/nℤ. So the order of an element is simultaneously the size of the smallest subgroup containing it. This connects order to subgroup structure: every element carves out a cyclic subgroup whose size equals the element's order.

The deepest consequence is Lagrange's theorem (which you'll encounter next): the order of any subgroup divides the order of the group. Since ord(a) is the size of a subgroup, it follows that ord(a) divides |G| for any finite group G. This is a powerful constraint — it immediately rules out certain element orders. In a group of order 15, elements can only have orders 1, 3, 5, or 15. You can't have an element of order 4 in a group of size 15, because 4 does not divide 15. Order arithmetic is one of the main tools for deducing the structure of finite groups without constructing them explicitly.