Find All Automorphisms of Cyclic Group of Order 10

  • Thread starter Thread starter Electromech1
  • Start date Start date
  • Tags Tags
    Cyclic Group
Click For Summary

Homework Help Overview

The discussion revolves around finding all automorphisms of a cyclic group of order 10. The original poster attempts to understand the nature of automorphisms in this context and how they relate to the group's generators.

Discussion Character

  • Conceptual clarification, Assumption checking, Exploratory

Approaches and Questions Raised

  • Participants explore the definition of automorphisms and their relationship with generators of the cyclic group. Questions arise about the specific form of automorphisms and the criteria for mapping elements within the group.

Discussion Status

Some participants have provided insights into the properties of generators and their role in defining automorphisms. There is an ongoing exploration of the implications of mapping generators to generators and the conditions under which these mappings hold.

Contextual Notes

There is a discussion about the understanding of generators and their relationship to the elements of the cyclic group, particularly focusing on the elements that are relatively prime to the group's order. The original poster expresses uncertainty about the definitions and implications of these concepts.

Electromech1
Messages
2
Reaction score
0

Homework Statement



Find all the automorphisms of a cyclic group of order 10.

Homework Equations



ψ(a)ψ(b)=ψ(ab)

For G= { 1, x, x^2,..., x^9}, and some function

ψ(a) = x^(a/10)

The Attempt at a Solution



I know that a homomorphism takes the form

Phi(a)*phi(b) = phi (ab) , and that an automorphism maps from G->G,

However, I don't understand what an automorphism for a cyclic group would even look like. I suppose it should be something of the form:

ψ(a) = x^(a/10)

and that a should be a specific power, but I have no idea where to go from here.

I appreciate any help. Thanks
 
Physics news on Phys.org
Think about it. An automorphism has to map a generator of the cyclic group to another generator. How many elements of your cyclic group are generators?
 
I don't have a solid understanding of generators. I understand that you need relatively prime powers to map out all the functions through multiplication. Going by this, I suppose the generators would be 1,3,5,7, & 9, all the odd numbers below 10. For what reason are would these be automorphisms though? Tell me if this is right:

[

If x^n is an automorphism, where n is an individual element of {1,3,5,7,9}, the function works by multiplying each term of G= {1,x,...,x^9} so that

phi(a) = x^n *x*a = x^ (n+a)


It's a homomorphism because:

phi(a) * phi (b) = x^(n+a) * x^(n+b) = x^( 2n+a+b)
and phi(ab) = x^(n + a +b) (I know 2n+a+b ≠ n+a+b, but it's the best I can come up with)

Then the function is bijective because if
phi(x) = x^n, phi(x)^-1 = x^-n or x^(10-x) because of the cyclic nature

Because it maps from G->G, it is homomorphic, and has an inverse, it is bijective automorphism for the cyclic group of order 10.

]

Am I at least heading in the right direction with this?
 
I would look at it this way. x is a generator because powers of x give you all of the elements of G. x^3 is also a generator. Take all of the powers of x^3 and show you can get every element of G as a power of x^3. E.g. x^7=(x^3)^9. And yes, the reason is because 10 and 3 are relatively prime. If you are uncomfortable with the notion of generators, you should verify this by writing out all of the powers. That means if you define phi(x)=x^3 you get an automorphism. If g is ANY generator and you define phi(x)=g, you get an automorphism. BTW x^5 is NOT a generator. Why not?
 
Last edited:

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K