order of elements in finite groups


This article proves two elementary results regarding the orders of group elements in finite groupsMathworldPlanetmath.

Theorem 1

Let G be a finite group, and let a∈G and b∈G be elements of G that commute with each other. Let m=|a|, n=|b|. If gcd⁡(m,n)=1, then m⁢n=|a⁢b|.

Proof. Note first that

(a⁢b)m⁢n=am⁢n⁢bm⁢n=(am)n⁢(bn)m=eG

since a and b commute with each other. Thus |a⁢b|≤m⁢n. Now suppose |a⁢b|=k. Then

eG=(a⁢b)k=(a⁢b)k⁢m=ak⁢m⁢bk⁢m=bk⁢m

and thus n|km. But gcd⁡(m,n)=1, so n|k. Similarly, m|k and thus mn|k=|ab|. These two results together imply that m⁢n=k.

Theorem 2

Let G be a finite abelian group. If G contains elements of orders m and n, then it contains an element of order lcm⁢(m,n).

Proof. Choose a and b of orders m and n respectively, and write

lcm⁢(m,n)=∏piki

where the pi are distinct primes. Thus for each i, either piki∣m or piki∣n. Thus either am/piki or bn/piki has order piki. Let this element be ci. Now, the orders of the ci are pairwise coprime by construction, so

|∏ci|=∏|ci|=lcm⁢(m,n)

and thus ∏ci is the required element.

Title order of elements in finite groups
Canonical name OrderOfElementsInFiniteGroups
Date of creation 2013-03-22 16:34:02
Last modified on 2013-03-22 16:34:02
Owner rm50 (10146)
Last modified by rm50 (10146)
Numerical id 5
Author rm50 (10146)
Entry type Theorem
Classification msc 20A05