If $\gcd (s,t)=1$, then $U_s(st)\cong U(t)$
Proof.
Let $f:U_s(st)\to U(t)$, $f(x)= x\ \text{mod}t$.
i) $f$ is well-defined
$x\in U_s(st)$
$\Rightarrow \text{gcd}(x,st)=1$
$\Rightarrow \text{gcd}(x,t)=1$
$\Rightarrow \text{gcd}(f(x),t)=1$
$\Rightarrow f(x)\in U(t)$
ii) $f$ is a bijection ($f^{-1}$ is well-defined)
$y\in U(t)$
$\Rightarrow \text{gcd}(y,t)=1$
Let $0\le k<st$ be a value that satisfies $k\ \text{mod} t=y, k\ \text{mod} s=1$. Such $k$ uniquely exists in modulo $st$ by the Chinese Remainder Theorem. Let $f^{-1}(y)=k$.
$f^{-1}(y)\ \text{mod} t=y\Rightarrow\text{gcd}(f^{-1}(y),t)=\text{gcd}(y,t)=1$
$f^{-1}(y)\ \text{mod} s=1\Rightarrow\text{gcd}(f^{-1}(y),s)=1$
$\Rightarrow \text{gcd}(f^{-1}(y),st)=1$
$f^{-1}(y)\in U_s(st)$
iii) $f$ preserves operations
$f(w)f(z)=(w\ \text{mod} t)(z\ \text{mod} t)=wz\ \text{mod} t=f(wz)$
Therefore, $f$ is an isomorphism. $\blacksquare$
'math > number theory & abstract algebra' 카테고리의 다른 글
| 현대대수학 바이블 7.60-7.63 (0) | 2026.06.18 |
|---|---|
| 현대대수학 바이블 p7.10 (0) | 2026.06.08 |
| 위수가 4인 군은 모두 가환군이다. (0) | 2026.03.18 |
| The number of elements of order k in an abelian group. (0) | 2026.02.04 |
| Order of ab in abelian groups (0) | 2026.02.04 |