2

Prove the following homomorphism is surjective. $$f : Z → \frac{Z}{3Z} × \frac{Z}{5Z}$$

I completely get the questions and i can prove it by working out a corresponding pre-image for all of $\frac{Z}{3Z} × \frac{Z}{5Z}$.

But how do i give a formal proof if i change the question and ask

for any $(p,q)=1$ Prove the following homomorphism is surjective. $$f : Z → \frac{Z}{pZ} × \frac{Z}{qZ}$$

I feel we may have to use Bezout's identity but don't know how to. any help appreciated

Thanks

Bill Dubuque
  • 282,220
Mr. Math
  • 1,785

3 Answers3

1

Hint: Use the Chinese remainder theorem to show that $f: {Z/pZ} \times {Z/qZ} \to Z/(pqZ)$ is bijective. That's all you should need.

user2566092
  • 26,450
1

Yes, we can trivially transform a Bezout identity to a CRT solution as below

$\quad \color{c00}{jp} + kq = 1\,\Rightarrow\, \begin{align}{\color{#c00}{kq\equiv 1}\pmod p}\\ \color{c00}{jp\equiv 1}\pmod q\end{align}\,\ $ thus $\,\ x = a\color{#c00}{kq} + bjp \ \Rightarrow \begin{align}&x\equiv a\!\!\!\pmod p\\ &x\equiv b\!\!\!\pmod q\end{align}$

i.e. $\ \ \ {\rm mod}\,\ (p,q)\!:\,\ \begin{align}\color{#c00}{kq \equiv (\color{#c00}1,0)}\\ \color{c00}{jp\equiv (0,1)}\end{align} \,\Longrightarrow\, (a,b) = a\color{#c00}{(1,0)}+b(0,1) \equiv a\color{#c00}{kq} + bjp $

which reveals innate CRT linearity, i.e. how the general solution $\,(a,b)\,$ can be generated as a linear combination of the "basis" solutions $\,(1,0)\,$ and $\,(0,1).\,$ This will become clearer when one studies the ring-theoretic form of CRT (and modules).

Bill Dubuque
  • 282,220
0

Since $\ker f = 15 \mathbb Z$ has index $15$, the image of $f$ has size $15$ and so $f$ is surjective.

The same argument works in general when $\gcd(p,q)=1$.

(Invoking the Chinese remainder theorem sounds wrong to me because the argument above gives the simplest proof of the Chinese remainder theorem when the ring is $\mathbb Z$.)

lhf
  • 221,500