For $Z_5=\{0,1,..4\}$ and $z\in Z_n$. Prove that there exists a multiplicative inverse (except zero)

243 Views Asked by At

We define addition in $Z_5$ as addition and then modulo 5. Similarly we define multiplication as multiplication modulo 5. Then how do I proof the existence of multiplicative inverse? i.e $$\forall z \in Z_5-\{0\}\, \exists x\in Z_5\ni (zx \equiv 1 \pmod 5)$$ Or for every $z\in Z_5-\{0\}$, there exists $x\in Z_5$ such that $zx\equiv 1\pmod 5$.

I was able to prove the additive inverse, but I can't seem to remember this one.

1

There are 1 best solutions below

0
On BEST ANSWER

The general solution results from Bézout's identity, as mentioned in the comments, which itself results from $\mathbf Z$ being a Euclidean domain, hence a P.I.D., and this property:

In a principal ideal domain $R$, given two elements $a,b\in R$, a generator $d$ of the ideal $(a,b)$ is a common divisor of $a$ and $b$, and it is a greatest common divisor, in the sense that any common divisor of $a$ and $b$ is a divisor of $d$.

Thus two integers are coprime i.e. they have no common divisor but $\pm 1$, if and only if there exist integers $u,v$ such that $$um+vn=1.$$

Now in a ring $\mathbf Z/n\mathbf Z$, the units (i.e. the elements which have a multiplicative inverse) are the congruence classes of the elements $m$ which are coprime to $n$, because for such an element, we have a Bézout's relation which yields $\;um=1-vn$ so $\overline {um}=\overline u\,\overline m=\overline{1}$, which means the class of $u$ is the inverse of that of $m$.

In particular, if $n$ is prime, all non-zero elements in $\mathbf Z/n\mathbf Z$ have representatives in $\{1,\dots,n-1\}$ which are coprime to $n$, so they have in inverse modulo $n$. In other words,if $n$ is prime, the ring $\mathbf Z/n\mathbf Z$ is a field, and conversely.