Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 1.1.32 ($|x| \leq G$)

Exercise 1.1.32 ($|x| \leq G$)

If x is an element of finite order n in G , prove that the elements 1 , x , x 2 , , x n 1 are all distinct. Deduce that | x | G .

Answers

Proof. Assume for the sake of contradiction that there are integers i , j such that

1 i < j n 1 and x i = x j .

Then j i > 0 and x j i = 1 . By definition of the order, n j i , but j i < j n , so j i < n . This is a contradiction, which proves that the elements 1 , x , x 2 , , x n 1 are all distinct.

This shows that the set { 1 , x , x 2 , , x n 1 } has n elements, and { 1 , x , x 2 , , x n 1 } G , therefore

n = | x | | G | .

User profile picture
2026-01-07 12:45
Comments