Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 4.4.17 ($\mathrm{Aut}(Z_n)$ for $n = 2,3,4,5,6$)

Exercise 4.4.17 ($\mathrm{Aut}(Z_n)$ for $n = 2,3,4,5,6$)

Let G = x be a cyclic group of order n . For n = 2 , 3 , 4 , 5 , 6 write out the elements of Aut ( G ) explicitly (by Proposition 16 above we know Aut ( G ) ( 𝑛ℤ ) × , so for each element a in ( 𝑛ℤ ) × , write out explicitly what the automorphism ψ a does to the elements { 1 , x , x 2 , , x n 1 } of G ).

Answers

Proof. I rewrite the proof of Proposition 16, in a more detailed way.

Here Z n = x , where | x | = n .

If a satisfies a n = 1 , we define

ψ a { Z n Z n y y a (1)

Then

  • For all y , z Z n , since Z n is abelian,

    ψ a ( y ) ψ a ( z ) = y a z a = ( 𝑦𝑧 ) a = ψ a ( 𝑦𝑧 ) ,

    so ψ a is a homomorphism.

  • ψ a is injective: since a n = 1 , there are integers b and c such that 𝑎𝑏 𝑐𝑛 = 1 . Suppose that ψ a ( y ) = ψ a ( z ) . Then y a = z a , thus y 𝑎𝑏 = z 𝑎𝑏 . Since y n = z n = 1 ,

    y = y ( y n ) c = y 1 + 𝑐𝑛 = y 𝑎𝑏 = ( y a ) b = ( z a ) b = z 𝑎𝑏 = z 1 + 𝑐𝑛 = z ( z n ) c = z .

    This shows that ψ a is injective.

  • Since Z n is a finite set, and ψ a = Z n Z n is injective, ψ a is also surjective, so

ψ a Aut ( Z n ) .

Consider now the map

ψ { ( 𝑛ℤ ) × Aut ( Z n ) a ¯ ψ a

(Then ψ = Ψ 1 , for the map Ψ defined in the text.)

  • ψ is well defined: If a ¯ = b ¯ , then b = a + 𝑘𝑛 for some integer k , thus for all y Z n , ψ b ( y ) = y b = y a + 𝑘𝑛 = y a ( y n ) k = y a = ψ a ( y ) , so ψ a = ψ b .
  • ψ is injective: For all a ¯ , b ¯ 𝑛ℤ , if ψ ( a ¯ ) = ψ ( b ¯ ) , then ψ a ( y ) = ψ b ( y ) for all y Z n . In particular x a = ψ a ( x ) = ψ b ( x ) = x b , where | x | = n , thus a b ( 𝑚𝑜𝑑 n ) , so a ¯ = b ¯ . This shows that ψ is injective.
  • ψ is surjective: Let σ be any element of Aut ( Z n ) . Then σ ( x ) = x a for some a . Moreover n = | x | = | σ ( x ) | = | x a | = n a n , thus a n = 1 . Moreover, for all integers k , ψ a ( x k ) = ( x k ) a = x 𝑘𝑎 = ( x a ) k = σ ( x ) k = σ ( x k ) . Since every element y of Z n is of the form y = x k for some integer k , this shows that σ = ψ a = ψ ( a ¯ ) , where a ¯ ( 𝑛ℤ ) × , so ψ is surjective.
  • ψ is a homomorphism: If a ¯ , b ¯ ( 𝑛ℤ ) × , then for all y Z n ,

    [ ψ ( a ¯ ) ψ ( b ¯ ] ( y ) = = ψ a ( ψ b ( y ) ) = ( y b ) a = y 𝑎𝑏 = ψ 𝑎𝑏 ( y ) = [ ψ ( 𝑎𝑏 ¯ ) ] ( y ) .

    Therefore ψ ( a ¯ ) ψ ( b ¯ = ψ ( 𝑎𝑏 ¯ ) , so ψ is a homomorphism.

In conclusion, ψ is an isomorphism. This proves

Aut ( Z n ) ( 𝑛ℤ ) × .

Therefore the order of Aut ( Z n ) is

| Aut ( Z n ) | = | ( 𝑛ℤ ) × | = φ ( n ) .

Now we write the solution of the exercise.

  • If n = 2 ,

    then φ ( n ) = 1 , thus Aut ( G ) = { id G } .

  • If n = 3 ,

    then G = x = { 1 , x , x 2 } , where x 3 = 1 and φ ( n ) = 2 , thus

    Aut ( G ) = { ψ 1 , ψ 2 } ,

    where ψ 1 ( y ) = y 1 = y for all y G , so ψ 1 = id G .

    For all y Z n , ψ 2 ( y ) = y 2 , so

    ψ 2 ( 1 ) = 1 , ψ 2 ( x ) = x 2 , ψ 2 ( x 2 ) = x 4 = x .

    So ψ 2 exchanges x and x 2 . if we label 1 , x , x 2 with 0 , 1 , 2 , this shows that

    Aut ( Z 3 ) ( 1 2 ) Z 2 .

  • If n = 4 ,

    then G = { 1 , x , x 2 , x 3 } , where x 4 = 1 and φ ( n ) = 2 , thus Aut ( G ) = { ψ 1 , ψ 3 } , where ψ 1 = id G , and ψ 3 ( y ) = y 3 for all y G , so

    ψ 3 ( 1 ) = 1 , ψ 3 ( x ) = x 3 , ψ 3 ( x 2 ) = x 2 , ψ 3 ( x 3 ) = x .

    If we label 1 , x , x 2 , x 3 with 0 , 1 , 2 , 3 , then

    Aut ( G ) ( 1 3 ) Z 2 .

  • If n = 5 ,

    then G = x = { 1 , x , x 2 , x 3 , x 4 } , where x 5 = 1 and φ ( n ) = 4 , thus

    Aut ( G ) = { ψ 1 , ψ 2 , ψ 3 , ψ 4 } ,

    where ψ k ( y ) = y k for all y G , so

    ψ 1 ( 1 ) = 1 , ψ 1 ( x ) = x , ψ 1 ( x 2 ) = x 2 , ψ 1 ( x 3 ) = x 3 , ψ 1 ( x 4 ) = x 4 , ψ 2 ( 1 ) = 1 , ψ 2 ( x ) = x 2 , ψ 2 ( x 2 ) = x 4 , ψ 2 ( x 3 ) = x , ψ 2 ( x 4 ) = x 3 , ψ 3 ( 1 ) = 1 , ψ 3 ( x ) = x 3 , ψ 3 ( x 2 ) = x , ψ 3 ( x 3 ) = x 4 , ψ 3 ( x 4 ) = x 2 , ψ 4 ( 1 ) = 1 , ψ 4 ( x ) = x 4 , ψ 4 ( x 2 ) = x 3 , ψ 4 ( x 3 ) = x 2 , ψ 4 ( x 4 ) = x ,

    With the labelling 1 , 2 , 3 , 4 for x , x 2 , x 3 , x 4 , we obtain

    Aut ( G ) { ( ) , ( 1 2 4 3 ) , ( 1 3 4 2 ) , ( 1 4 ) ( 2 3 ) } = ( 1 2 4 3 ) Z 4 .

  • If n = 6 ,

    then G = x = { 1 , x , x 2 , x 3 , x 4 , x 5 } , where x 6 = 1 and φ ( n ) = 2 , thus

    Aut ( G ) = { ψ 1 , ψ 5 } ,

    where ψ k ( y ) = y k for all y G , so

    ψ 1 ( 1 ) = 1 , ψ 1 ( x ) = x , ψ 1 ( x 2 ) = x 2 , ψ 1 ( x 3 ) = x 3 , ψ 1 ( x 4 ) = x 4 , ψ 1 ( x 5 ) = x 5 ψ 5 ( 1 ) = 1 , ψ 5 ( x ) = x 5 , ψ 5 ( x 2 ) = x 4 , ψ 5 ( x 3 ) = x 3 , ψ 5 ( x 4 ) = x 2 , ψ 5 ( x 5 ) = x

    With the labelling 1 , 2 , 3 , 4 , 5 for x , x 2 , x 3 , x 4 , x 5 , we obtain

    Aut ( G ) ( 1 5 ) ( 2 4 ) Z 2 .

User profile picture
2026-02-23 10:17
Comments