J is an ideal.
An element of IJ is of the form i1j1 + i2j2 + ... + ikjk and each of these terms is in both I and J and hence in I
J.
If I = < 4 > in
and J = < 6 > then all products ij
IJ are divisible by 24. Thus IJ = < 24 >.
If an ideal contains both I and J all its elements must be divisible by 12. Thus I
J = < 12 >.
The integer 2
I + J and it is easy to see that all elements of I + J are divisble by 2. Thus I + J = < 2 >.
More generally, If I = < m > in
and J = < n > then IJ = < mn > , I
J = < lcm(m, n) > and I + J = < gcd(m, n > .
is a principal ideal domain. It is equivalent to the group theoretic result that any subgroup of a cyclic group is cyclic.
n (or subgroups of this cyclic group) take the ideals generated by all the divisors of n.
12 has subgroups generated by 1, 2, 3, 4, 6 and 12 = 0 of orders (respectively) 12, 6, 4, 3, 2 and 1.
and 3
are both infinite cyclic groups generated by 2 and 3 respectively.
3. However 22 = 4 would then have to map to 6
(
3)2.
A suitable group isomorphism is 1
(1, 1). Note that since 2, 3 are coprime the (additive) order of (1, 1) = 6.
Then an element a = (1 + 1 + ... + 1) maps to (a, a) and b maps to (b, b). The product ab maps to (ab, ab) which is where it has to go to be a ring isomorphism.
More generally, the same proof works for any pair of integers m, n which are coprime.
4 is the same. The other properties follow easily. Its kernel is the ideal generated by 3.
This "well-definition" fails working modulo 14. For example 2 = 16 mod 14 but not modulo 7. This means you get problems with the homomorphism property. For example 8
0 but 8 + 8 = 2
2
0 + 0.
is a field the kernel of any homomorphism is either {0} or
and so these clearly cannot be homomorphisms.
to
as you can verify.
i but 12
1
i2 = -1.
C1 , U3
C2 , U4
C2 , U5
C4 , U6
C2 , U7
C6 , U8
C2
C2 , U9 = C2
C3
C6 , U10
C4 , ...
Cn-1 . Then from Question 3 above if m, n are coprime Umn
Um
Un and that should enable you to take the calculation quite far.
12 onto
4 will have the ideal < 3 > as fernel and is the map of Qu 4 above.
0 for all x.
m onto
n if n divides m and then it is the map x
x mod n.
If the additive group is cyclic every element is of the form na for some integer n and the (ma).(na) = (mn)a2 and so if you know a2 the multipication is determined.
The additive group of a ring of order 3 must be cyclic so R = {0, a, 2a}. Then we can either take a2 = 0 or a2 = a. If we take a2 = 2a then we have (2a)2 = 4a2= 2a and so if we swap the generators a and 2a we get isomorphic rings. Thus there are two possible rings of order 3
For rings of order 4 with a cyclic additive group {0, a, 2a, 3a} we have a choice of 0, a or 2a for a2. Choosing a2 = 3a gives a ring isomorphic to the a2 = a case.
There are in fact eight rings whose additive group is the Klein 4-group.