The group of units in the integers modulo n
In the previous sections, we’ve already seen that the set Zn=Z/nZ consists of the elements {0,1,2,…,n−1}, whereas Zn under addition modulo n (see this definition
:Addition_and_Multiplication_Modulo
) forms an abelian group with n elements. We can also multiply elements of Zn, but we don’t obtain a group necessarily for Zn under multiplication modulo n. For instance, the element 0 doesn’t have a multiplicative inverse. Or considering the set Z6, whose multiplication table is illustrated in 2nd example of this lemma
:Lemma_2_4_4
, we see that 1 fulfills the axiom of the identity element, but we also immediately observe that there aren’t existing inverse elements for 2,3, and 4.
Consequently, there’s no inverse for every element of Zn in general. According to this definition:Addition_and_Multiplication_Modulo, the multiplication in Zn is given by (a+nZ).
(b+nZ)=(a⋅b)+nZ. Therefore, for any n=kl with integers k>1 and l>1, it holds that
(k+nZ)⋅(l+nZ)=(k⋅l)+nZ=n+nZ=0+nZ=0.(1)
But if Zn under multiplication would form a group in general, there would’ve to exist an inverse element k−1 for k, such that
(k−1+nZ)⋅(k+nZ)=1+nZ.
Hence, we multiply both sides of equation (1) by (k−1+nZ), which yields.
(k−1+nZ)⋅(k+nZ)⋅(l+nZ)(1+nZ)⋅(l+nZ)(l+nZ)=(k−1+nZ)⋅0=0=0.
which contradicts to 1<l<n. As a result, there’s no inverse for k in general, and hence Zn under multiplication is not necessarily a group for any n∈N.
However, it’s possible to enforce a group structure if we constrain our attention only to the elements of Zn that have multiplicative inverses. As a result, we get a group under multiplication mod n, that is often referred to as being the multiplicative group of integers modulo n (or the group of nonzero congruence classes modulo n ), which we call the group of units in Zn, denoted by Un.