Exploring Homomorphisms and Automorphisms for Cyclic Groups

In summary, finding homomorphisms h: C_6 ----> Aut(C_n) can be challenging when n is a product of primes, but for specific values of n, such as n=12 and n=16, there are a set number of homomorphisms, which can be determined through the formula h_i(x) = z^k, where i is the index of the homomorphism and k is a multiple of n. Additionally, finding all homomorphisms h: C_5 --> Aut(C_11) requires finding all possible values of z^k, which can be determined to be 5 possible values.
  • #1
MidnightR
42
0
Describe explicitly all homomorphisms

h: C_6 ----> Aut(C_n)

The question asks when n=12,16

I was wondering if someone could explain how to do this? I've looked through the notes but struggling a tad

I think I could do this if it said for instance h: C_6 ----> C_n but Aut(C_12) = C_2 x C_2 which is a little confusing

Thanks
 
Physics news on Phys.org
  • #2
Can you articulate why you think finding homomorphisms
C_6 ---> C_2 x C_2​
is hard and confusing, but finding homomorphisms
C_6 ---> C_n​
is not?
 
  • #3
Hurkyl said:
Can you articulate why you think finding homomorphisms
C_6 ---> C_2 x C_2​
is hard and confusing, but finding homomorphisms
C_6 ---> C_n​
is not?

Lack of understanding & having an example for the latter but not the former xD

I think I've figured it out though

for n = 12 there are 4 homomorphisms

h_1(x) = 1
h_2(x) = z
h_3(x) = y
h_4(x) = zy

for n = 16 there are 8 homomorphisms

h_1(x) = 1
h_2(x) = z
h_3(x) = z^2
h_4(x) = z^3
h_5(x) = y
h_6(x) = zy
h_7(x) = z^2y
h_8(x) = z^3y

Would that be correct?

For the next question all homomorphism h: C_5 --> Aut(C_11) I get 5

h_1(x) = 1
h_2(x) = z^2
h_3(x) = z^4
h_4(x) = z^6
h_5(x) = z^8
 
Last edited:
  • #4
Can you say why you think that's the answer? Why must any homomorphism be named on that list, and why is everything named on that list a homomorphism?
 

FAQ: Exploring Homomorphisms and Automorphisms for Cyclic Groups

What is a homomorphism?

A homomorphism is a mathematical function that preserves the structure of a mathematical object. In other words, it maps elements from one mathematical structure to another while maintaining the operations and relations between those elements.

What is an automorphism?

An automorphism is a special type of homomorphism that maps a mathematical structure onto itself, preserving all of its properties and operations. In other words, it is a symmetry or transformation of the structure that leaves it unchanged.

What is the difference between a homomorphism and an isomorphism?

A homomorphism preserves structure, while an isomorphism does so and is also bijective, meaning it has a one-to-one correspondence between elements of the two structures. This means that an isomorphism not only maps elements, but also has an inverse mapping between the two structures.

How are homomorphisms and automorphisms used in mathematics?

Homomorphisms and automorphisms are used in many areas of mathematics, such as group theory, algebra, topology, and graph theory. They help to identify and understand the connections between different mathematical objects and structures, and can be used to simplify and solve complex problems.

Can homomorphisms and automorphisms be applied to real-world problems?

Yes, homomorphisms and automorphisms have applications in many real-world problems, particularly in computer science and engineering. For example, they are used in cryptography to create secure encryption algorithms, and in network theory to analyze and optimize communication networks. They can also be used in data analysis and pattern recognition to identify regularities and similarities between different data sets.

Back
Top