[abstract algebra] Isomorphic group of units

nonequilibrium
Messages
1,412
Reaction score
2

Homework Statement


Given that gcd(n,m)=1, prove that \mathbb Z_{nm}^\times = \mathbb Z_n^\times \oplus \mathbb Z_m^\times.

Homework Equations


/

The Attempt at a Solution


I can prove both groups have the same amount of elements (using Euler's totient function), but I can't figure out how to prove the isomorphism. One way would be to construct the isomorphism, but I can't seem to find one.
 
Physics news on Phys.org
Perhaps consider function f: \mathbb Z_{nm}^\times \rightarrow \mathbb Z_n^\times \oplus \mathbb Z_m^\times such that f(a) = (a mod n, a mod m). Since if a \in \mathbb Z_{nm}^\times then a is relatively prime to mn, so there is an integer solution x,y to the equations ax +mny =1. Taking the equation, you can re-write it to mny = 1 - ax, which means ax is congruent 1 modulo m, and congruent 1 modulo n. So actually a has an inverse mod m and mod n (in this case x). So f maps units to units. You can prove surjectiveness by Chinese Remainder Theorem, and since sets are finite this would imply bijectivity.

/edit reworded slightly.
 
Last edited:
Thank you!
 
As a reminder to all homework helpers, we're supposed to help the student solve a problem, not to do it for them. Barre's post is a demonstration of exactly what not to do. Unfortunately, it's too late and the original poster has already received the complete solution to his homework problem. :frown:
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top