Zm × Zn is isomorphic to Zmn iff m and n are coprime
Dependencies:
- Isomorphism on Groups
- Cyclicness is invariant under isomorphism
- Order of element in external direct product
- Order of elements in cyclic group
- Cyclic groups are isomorphic to Z or Zn
- GCD times LCM equals product
$\mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn} \iff \gcd(m, n) = 1$
Proof
Proof of 'only if' part
$\mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn} \implies \mathbb{Z}_m \times \mathbb{Z}_n$ is cyclic.
Let $(a, b)$ be a generator of $\mathbb{Z}_m \times \mathbb{Z}_n$. Then $\operatorname{order}((a, b)) = mn$.
Let $o_a = \operatorname{order}(a)$ and $o_b = \operatorname{order}(b)$.
\begin{align} & o_a \mid m \wedge o_b \mid n \tag{$\mathbb{Z}_m$ and $\mathbb{Z}_n$ are cyclic} \\ &\Rightarrow o_a, o_b \mid \operatorname{lcm}(m, n) \\ &\Rightarrow \operatorname{lcm}(m, n) \textrm{ is a common multiple of } o_a \textrm{ and } o_b \\ &\Rightarrow \operatorname{lcm}(o_a, o_b) \le \operatorname{lcm}(m, n) \end{align}
$$\operatorname{order}((a, b)) = \operatorname{lcm}(o_a, o_b) \le \operatorname{lcm}(m, n) = \frac{mn}{\gcd(m, n)}$$
Therefore, $\gcd(m, n) = 1$.
Proof of 'if' part
Let $\gcd(m, n) = 1$.
Let $a$ and $b$ be generators of $\mathbb{Z}_m$ and $\mathbb{Z}_n$ respectively, $o_a = m$ and $o_b = n$.
\begin{align} & \operatorname{order}((a, b)) = \operatorname{lcm}(o_a, o_b) = \operatorname{lcm}(m, n) = \frac{mn}{\gcd(m, n)} = mn \\ &\Rightarrow \mathbb{Z}_m \times \mathbb{Z}_n = \langle (a, b) \rangle \wedge |\mathbb{Z}_m \times \mathbb{Z}_n| = mn \\ &\Rightarrow \mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn} \end{align}
Dependency for: None
Info:
- Depth: 9
- Number of transitive dependencies: 32
Transitive dependencies:
- Group
- Homomorphism on groups
- Mapping of power is power of mapping
- Isomorphism on Groups
- Cyclicness is invariant under isomorphism
- Identity of a group is unique
- Subgroup
- External direct product is a group
- Order of element in external direct product
- Inverse of a group element is unique
- Conditions for a subset to be a subgroup
- Cyclic Group
- Cyclic groups are isomorphic to Z or Zn
- Every number has a prime factorization
- Coprime
- Integer Division Theorem
- GCD is the smallest Linear Combination
- Common divisor divides GCD
- gcd(a1/d, a2/d, ..., an/d) = gcd(a1, a_2, ..., an)/d
- If x divides ab and x is coprime to a, then x divides b
- Order of elements in cyclic group
- Euclid's lemma
- Fundamental Theorem of Arithmetic
- Prime Factorization Exponent List (PFEL)
- PFEL of ratio is difference of PFEL
- PFEL of product is sum of PFEL
- Divisible iff PFEL is less than or equal
- PFEL of lcm is max of PFEL
- PFEL of gcd is min of PFEL
- LCM divides common multiple
- Product of coprime divisors is divisor
- GCD times LCM equals product