1. ## automorphism proof

Theorem: for any positive integer n, $\displaystyle Aut(Z_{n})$ is isomorphic to $\displaystyle U(n)$.

Q: Prove that every element $\displaystyle g\in\\Aut(Z_{n})$ is determined by $\displaystyle g(1)$; meaning, $\displaystyle g(1)$ results in a well-defined automorphism of $\displaystyle Z_{n}$.

A: let $\displaystyle g\in\\Aut(Z_{n})$ be arbitrary. Then $\displaystyle f:Z_{n}\rightarrow\Z_{n}$ is an isomorphism. So, to show if something is well-defined I need to show if a=c, b=d, then a*b=c*d. I am not sure what to my a,b, and c's are. I know $\displaystyle f(k)=kf(1)$. so, do I let $\displaystyle f(m)=mf(1)$ and $\displaystyle f(p)=pf(1)$. Now, I want to show $\displaystyle f(p)*f(q)=mf(1)*pf(1)$?

Thanks

2. Originally Posted by Danneedshelp
Theorem: for any positive integer n, $\displaystyle Aut(Z_{n})$ is isomorphic to $\displaystyle U(n)$.

Q: Prove that every element $\displaystyle g\in\\Aut(Z_{n})$ is determined by $\displaystyle g(1)$; meaning, $\displaystyle g(1)$ results in a well-defined automorphism of $\displaystyle Z_{n}$.

A: let $\displaystyle g\in\\Aut(Z_{n})$ be arbitrary. Then $\displaystyle f:Z_{n}\rightarrow\Z_{n}$ is an isomorphism. So, to show if something is well-defined I need to show if a=c, b=d, then a*b=c*d. I am not sure what to my a,b, and c's are. I know $\displaystyle f(k)=kf(1)$. so, do I let $\displaystyle f(m)=mf(1)$ and $\displaystyle f(p)=pf(1)$. Now, I want to show $\displaystyle f(p)*f(q)=mf(1)*pf(1)$?

Thanks
I'm sorry, what is $\displaystyle U(n)$? That can't be universal notation considering the very common Lie group called the Unitary Group is denoted $\displaystyle U(n)$.

3. $\displaystyle U(n)$ represents the group of units modulo n. So, for example, $\displaystyle U(10)=\{1,3,7,9\}$.

Sorry for not stating that.

4. I think that your analysis of the problem is a little bit too complicated. For an easy example, let us look at the group $\displaystyle \mathbb{Z}_{10}$. If $\displaystyle f:\mathbb{Z}_{10}\to \mathbb{Z}_{10}$ is an automorphism, it must send a generator to a generator. To be explicit, a number $\displaystyle a$ is a generator of $\displaystyle \mathbb{Z}_n$ if and only if $\displaystyle \gcd(a,n)=1$. In our case, $\displaystyle a$ is a generator if and only if $\displaystyle \gcd(a,10)=1$. This means that $\displaystyle a=1, 3, 5, 7, 9$. So, we have the following possibilities: $\displaystyle f(1)=1$, $\displaystyle f(1)=3$, $\displaystyle f(1)=5$, $\displaystyle f(1)=7$, or $\displaystyle f(1)=9$. If you try composing these maps, you will find that you recover the multiplication table for your $\displaystyle U_{10}$.

Give it a try. Good luck!

5. Originally Posted by Drexel28
I'm sorry, what is $\displaystyle U(n)$? That can't be universal notation considering the very common Lie group called the Unitary Group is denoted $\displaystyle U(n)$.
$\displaystyle U(R)$ is common for denoting the group of units of a ring. I suppose this is just a perversion of that.