Proving Automorphism of Z_n with r in U(n)

  • Thread starter Thread starter johnnyboy2005
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving that a mapping defined by (alpha)(s) = sr mod n for all s in Zn is an automorphism of Zn, where r is an element in U(n). The context is within group theory, particularly focusing on the structure of the additive group Zn.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants explore the nature of the mapping as a homomorphism and discuss the requirements for it to be an isomorphism, including being one-to-one and onto. There are questions about the clarity of definitions and the necessity of showing certain properties explicitly.

Discussion Status

The discussion is ongoing, with participants providing guidance on how to approach proving the mapping is a homomorphism and questioning the assumptions made about bijectiveness. Some participants suggest that the original poster clarify their reasoning and explicitly demonstrate the required properties.

Contextual Notes

There is an emphasis on the need to treat Zn correctly as an additive group and the importance of showing that the mapping is invertible, given that r is in U(n). Participants also note the potential confusion in terminology and the need for precise mathematical language.

johnnyboy2005
Messages
29
Reaction score
0
hey, was just hoping i could get a little help getting started on this one...

Let r be an element in U(n). Prove that the mapping (alpha):Zn-->Zn defined by (alpha)(s) = sr mod n for all s in Zn is an automorphism of Zn.

not expecting the answer, maybe to just push me in the right direction...thanks so much:approve:
 
Physics news on Phys.org
This is simply treating Zn as an additive group, right? (You should right Z/n or Z/nZ or Z/(n))

Show it is a homomorphism and show it is either invertible (easy given the other use of the word invertible in the question) or just show it is a bijection.
 
Show that its 1-1 onto and operation preserving. since r is in U(n) then r^-1 exists and you will need that little tid bit to show 1-1 then since Zn are finite you get onto.
 
so i actually left this question for a bit. This is my soln' so far...

to show it is an automorphism the groups must be one to one and onto (easy to show) and to show that the function is map preserving I'm saying that for any a and b in Z(n) you will have
(alpha)(a+b) = (alpha)(a) + (alpha)(b) = (a)r mod n + (b)r mod n = (a + b)rmodn which is in the automorphism
 
johnnyboy2005 said:
so i actually left this question for a bit. This is my soln' so far...
to show it is an automorphism the groups must be one to one and onto

groups are not one to one and onto, even if we assume that you mean are in bijective correspondence this does not mean any map between them is an isomorphism. if you are proving a map is an isomorphism it might behove you to mention the map in the alleged proof.

(easy to show) and to show that the function is map preserving I'm saying that for any a and b in Z(n) you will have
(alpha)(a+b) = (alpha)(a) + (alpha)(b) = (a)r mod n + (b)r mod n = (a + b)rmodn which is in the automorphism

what do you mean by "in the automorphism"? Surely you aren't treating maps as sets.

It is a one line proof: (a+b)r=ar+br, and -ar=-(ar) are just general facts of mulitiplying numbers, so trivially it is a homomorphism, now why is it an isomorphism?
 
it is an isomorphism because it is one to one and onto...
 
and have you proved that? i don't think you can get away with saying it is easy to show without showing it; i would be sceptical that you had done so given the presentation of your argument, and the fact that if it were so easy why didn't you write it out? it'd be good if you didn't show one to one and onto but actually pointed out that the map is invertible.
 

Similar threads

Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K