Topper Copies

Show that a finite cyclic group of order 'n' is isomorphic to Zn, the group of integers modulo n

Aakash Om Trivedi, AIR 73, 2025

To show isomorphism, we have to show function exist, homo-morphism, one-to-one, onto.

let A be group which is finite cyclic of order 'n' B be group Zn.

$\therefore A = \langle a\rangle$ where a is generator

and $a^n = e$ [$\because$ A is cyclic]

$(A, \cdot) \to (B, +)$

let define a function such that $f(a^m) = m \pmod n$

(i) first, checking function validity

Assume $a^x = a^y$

$\therefore a^{x-y} = e \Rightarrow x-y$ [?] $n$ - (1)

[$\because$ if $a^m = e$ then $o(a) \mid m$]

Now, taking function on both side,

$f(a^x) = f(a^y)$

$x \pmod n = y \pmod n$

$\Rightarrow (x-y) \bmod n = 0$

$\Rightarrow x-y = kn \ldots (2)$

$\therefore$ By (1),(2) it is valid function

(ii) Now, checking homo-morphism.

To show,

$f(x \bullet y) = f(x) + f(y)$

assume $x = a^u$ , $y = a^v$ ($\because x,y \in\langle a\rangle$)

$f(x \cdot y)$

$\therefore f(a^u \cdot a^v) = f(a^{u+v})$

$= (u+v) \bmod n$

$= u \bmod n + v \bmod n$

[$\because (a+1) \bmod n = a \bmod n + 1 \bmod n$]

$\Rightarrow f(x) + f(y)$

$\therefore$ [$\because f(a^u) = u \bmod n$]

$\therefore f(x \cdot y) = f(x) + f(y)$

hence, homo-morphism

(iii) checking for onto-function

let $t \in Z_n$

$\therefore f(a^t) = t \bmod n$

$\therefore \forall t$ we have $a^t \in A$ such that its image is t.

$\therefore$ [Onto]

(iv) To prove, one to one

assume $f(x) = f(y)$

$x \bmod n = y \bmod n$

$\therefore x - y \mid n$

$\therefore x - y = kn$

Now, find $a^{x-y} = a^{kn} = (a^n)^k$

$= e$ ( $\because o(a) = n$)

$\therefore a^{x-y} = e$

$\Longrightarrow a^x = a^y$ ($\because$ Right multiplication by $a^y$)

$\Longrightarrow$ [$x = y$]

$\therefore f(x) = f(y)$ implies $x = y$ $\therefore$ [One to one]

Thus, as function f satisfy all properties

$\therefore$ [$A \cong Z_n$ (Isomorphic)]

$A = \langle a \rangle$