PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Viewing Version 1 of '$C_{mn}\cong C_m\times C_n$ when $m, n$ are relatively prime'
[ view '$C_{mn}\cong C_m\times C_n$ when $m, n$ are relatively prime' | back to history ]

Title of object: $C_{mn}\cong C_m\times C_n$ when $m, n$ are relatively prime
Canonical Name: C_mncongC_mtimesC_nWhenMNAreRelativelyPrime
Type: Definition

Created on: 2008-04-16 13:49:12
Modified on: 2008-04-16 13:49:12

Creator: yesitis
Modifier: yesitis
Author: yesitis

Classification: msc:20A05

Preamble:

% this is the default PlanetMath preamble. as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here
Content:

We show that the cyclic group $C_{mn}$, where gcd$(m, n)=1$, is isomorphic to $C_m\times C_n$, where $C_m$ and $C_n$ are cyclic groups of orders $m$ and $n$, respectively.

Let $C_m=\langle x\rangle$ and $C_n=\langle y\rangle$. Then the external direct product $C_m\times C_n$ consists of elements $(x^i, y^j)$, where $0\leq x\leq m-1, 0\leq y\leq n-1$.

Next, we show that $C_m\times C_n$, a group, is cyclic. We do so by showing that it is generated by an element, namely $(x, y)$:
if $(x, y)$ generates $C_m\times C_n$, then for each $(x^i, y^j)\in C_m\times C_n$, we must have $(x^i, y^j)=(x, y)^k$ for some $k\in\{0, 1, 2, \ldots, mn-1\}$. Such $k$, if exists, would satisfy
\begin{eqnarray*}
k &\equiv& i\;(mod\;m) \\
k &\equiv& j\;(mod\;n).
\end{eqnarray*}
Indeed, by the Chinese Remainder Theorem, such $k$ exists and is unique modulo $mn$. (Here is where the relative primality of $m, n$ comes into play.) Thus, $C_m\times C_n$ is generated by $(x, y)$, so it is cyclic.

The order of $C_m\times C_n$ is $mn$, so is the order of $C_{mn}$. Since cyclic groups of the same order are isomorphic, we finally have $C_{mn}\cong C_m\times C_n$.