Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 2.3.16 (Order of a product $xy$)

Exercise 2.3.16 (Order of a product $xy$)

Assume that | x | = n and | y | = m . Suppose that x and y commute: xy = yx . prove that | xy | divides the least common multiple of m and n . Need this be true if x and y do not commute? Give an example of commuting elements x , y such that the order of xy is not equal to the least common multiple of | x | and | y | .

Answers

Let n m denote the least common multiple of n and m .

Proof. The l.c.m. n m is a common multiple of n and m , so n m = λn , n m = μm for some integers n , m .

Since x n = 1 and y m = 1 , then x n m = ( x n ) λ = 1 and y n m = ( y m ) μ = 1 .

Moreover, x and y commute. Therefore ( xy ) k = x k y k for all integers k . Hence

( xy ) n m = x n m y n m = 1 .

Therefore | xy | divides n m .

As a counterexample if x and y do not commute, take x = ( 1 2 3 ) and y = ( 1 2 4 ) in the group S 4 . Then | x | = | y | = 3 , so | x | | y | = 3 . But

xy = ( 1 2 3 ) ( 1 2 4 ) = ( 1 3 ) ( 2 4 )

has order 2 , so 2 = | xy | | x | | y | = 3 .

Finally, consider the elements 2 ¯ , 3 ¯ 5 . Then 2 ¯ and 3 ¯ commute, but | 2 ¯ | = | 3 ¯ | = 5 , and | 2 ¯ 3 ¯ | = | 1 ¯ | = 1 is not the least common multiple of n = 5 and m = 5 . □

User profile picture
2025-10-19 09:56
Comments