Order of a Group Element

Core Idea

The order of an element a in a group is the smallest positive integer n such that aⁿ = e, or infinity if no such n exists. The order of any element divides the order of the group, following from Lagrange's theorem.

How It's Best Learned

Compute orders explicitly in familiar groups: integers mod n under addition, nonzero integers mod p under multiplication, symmetry groups of polygons. Verify the divisibility claim in each case. Explore what it means for an element to have infinite order by working with the integers under addition.

Common Misconceptions

• Confusing the order of an element with the order of the group (the group's order is its size; an element's order is its period).
• Assuming the converse of Lagrange holds: if k divides |G|, there must be an element of order k. This is false in general (though true for prime k by Cauchy's theorem).
• Thinking infinite order means the element is "large" in some sense — the integer 1 under addition has infinite order in ℤ, while the same integer mod 12 has order 12.

Explainer

The order of a group element a is the smallest positive integer n such that applying the group operation to a with itself n times yields the identity element e. In multiplicative notation, this is aⁿ = e; in additive notation (like integers mod n), it's na = 0. If no such finite n exists, the element has infinite order. Think of it as asking: how many times must you repeat this operation before you cycle back to where you started?

From your work with cyclic groups, you know that the subgroup ⟨a⟩ = {e, a, a², ..., aⁿ⁻¹} generated by a has exactly n elements when a has order n. This is the cyclic group of order n, and its structure is completely determined by n. The element a of order n generates all of ⟨a⟩ and is itself a generator of that cyclic subgroup. Elements of order 1 are just the identity; elements of order 2 are called involutions (they are their own inverse, since a² = e implies a = a⁻¹).

The central divisibility result follows directly from Lagrange's theorem: since ⟨a⟩ is a subgroup of G, and the order of any subgroup divides the order of the group, the order of a must divide |G|. In a group of order 12, every element has order dividing 12 — possible orders are 1, 2, 3, 4, 6, or 12. You can immediately rule out orders like 5, 7, 8, 9, 10, or 11 without any computation. This constraint is immensely useful for classifying groups: knowing which orders are possible tells you which cyclic subgroups can exist.

A useful computation rule: if a has order n, then aᵏ has order n/gcd(n, k). So if a has order 12, then a⁴ has order 12/gcd(12,4) = 12/4 = 3. This lets you navigate the subgroup structure of cyclic groups precisely. Order of elements is fundamental to group theory — it characterizes the cyclic subgroup structure, drives the Sylow theorems (your downstream topic), and arises directly in applications like public-key cryptography, where security depends on the order of an element in a finite multiplicative group being large and unknown to an adversary.