Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Pretty easy question probably: How do you prove that $\phi(k)=(n-k)\mod{n}$ satisfies the homomorphism property for the binary structures $\langle\mathbb{Z}_n,+\rangle$ and $\langle\mathbb{Z}_n,+\rangle$?

share|cite|improve this question
I'm trying to prove it's an isomorphism. What I have now is $\phi(j+k)=(n-(j+k)(\mod{n})=(n-j-k)(\mod{n})$. I don't know how the transition from this to $\phi(j)+\phi(k)$ would be justified. I've proved the 1-1 and onto parts. – Mike 105 Sep 20 '12 at 0:25
I changed $<\mathbb{Z}_n,+>$ to $\langle\mathbb{Z}_n,+\rangle$. That is standard usage. – Michael Hardy Sep 20 '12 at 1:41
For general groups, the map $x \mapsto x^{-1}$ is not a homomorphism but for abelian groups it is. This is what you have here, written additively. – lhf Sep 20 '12 at 2:02
I'm new to LaTeX: How do you do those angle brackets? – Mike 105 Sep 20 '12 at 3:33
\langle \rangle – Douglas S. Stones Sep 20 '12 at 4:14
up vote 1 down vote accepted

You need to show that for all $a$ and $b$, we have $\phi(a+b)=\phi(a)+\phi(b)$. So, to use number-theoretic terminology, you need to show that if $x\equiv -a\pmod{n}$ and $y\equiv -b\pmod{n}$, then $x+y\equiv -(a+b)\pmod{n}$.

share|cite|improve this answer
Yes, working backwards worked for me. Thanks. – Mike 105 Sep 20 '12 at 0:52

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.