notegroup-theory

Isomorphism Classes of Finite Commutative Groups

Theorem

Let be a commutative group with elements, then there exist unique integers such that and

Example 1

List the isomorphism classes of finite commutative groups with 6 elements.

but .

Therefore by the theorem above, every finite commutative group with 6 elements is cyclic of order (isomorphic to )

Question

How about ?

Answer: We found last time that , because and recall the Chinese Remainder Theorem: if , , then .

Example 2

List isomorphism classes of commutative groups with 8 elements.

We want to decompose with , , and in particular .

The only ways to write 8 as products of integers in weakly decreasing order is,

Thus, by the theorem, if is commutative with 8 elements, , or , or

Note that .

Example 3

(this is equivalent to odd) (note this has 8 elements)

So this is isomorphic to one of those we listed previously, in particular it is isomorphic to .

Why? If not, then it is isomorphic to or .

If the latter is true, then for all but , we have a contradiction.

Otherwise, we check for all , so there is no element of order 8, so is not cyclic. . If then .

$3^4 = 81 =80 + 1 = 16*5 +1 \equiv 1 \bmod 16$
$\implies 1 \equiv (-3)^4=13^4$

$5^4 = 25^2 \equiv 9^2 = 81 \equiv 1 \bmod 16$
$\implies 1 \equiv (-5)^4 \equiv 11^4 \bmod 16$

$9^2=81\equiv 1 \bmod 16 \implies 9^4 \equiv 1^2 \equiv 1 \bmod 16$
$\implies 1 \equiv (-9)^4\equiv 7^4$

Example 4

List isomorphism classes of commutative groups with 120 elements.

Solution: with and , , etc.

The divisibility conditions force Options are:

Then every commutative group with 120 elements is isomorphic to exactly one of , , or .

Example 5

is isomorphic to exactly one on the above list.

(note that 4,3,5 are pairwise coprime)

By the Chinese Remainder Theorem,

Thus, we have that .

Proof of Uniqueness

If and

We have, with with

, , etc. , , etc.

We want that and for all .

Observation: smallest

Example 6

We saw that we have , , and are the only isomorphism classes of commutative groups with 120 elements. These all have different exponents (120, 60, and 30, respectively) which means they are not isomorphic.

Example 7

Every finite commutative group with 16 elements is isomorphic to either , , , , or .

The exponents of each of these are respectively, 16, 8, 4, 4, and 2. Note that and have the same exponent.

How many elements of order 4 do they each have?

In , have order 4 for any . Excluding repetitions, this leaves us with 12 such elements. In have order 4 for any . This leaves us with 8 such elements.

Thus, we have that and are not isomorphic.

Proof of Existence

First Step: We break into simpler parts.

where are distinct primes, for all .

Using the fact from (P-Torsion Subgroup) that , for some for some is stable under products.

(b) Assume .

Conversely, if for some

Next time we show .

Show

Define are the distinct prime factors of .

Because is commutative, we have easily that is a morphism.

Assume . .

Let for

divisor of since commute, this is a divisor of , so .

An inductive argument implies that for all , which implies , thus is injective.

Now show is surjective. Let where . By Lagrange’s theorem, we have that

which are pairwise coprime factors.

By the Chinese Remainder Theorem,

\begin{align*} p_{1}&= \psi(1,0,\ldots,0)\\ &\vdots \\ p_{r} &= \psi(0,0,\ldots,0,1) \end{align*} $$ Note, the $p_{i}$ above could be a $\beta_{i}$... (Missed some lines that reach the below) In $\mathbb{Z}\implies \gamma_{1}\beta_{1} + \ldots + \gamma_{r}\beta_{r}=1 \bmod n \implies \gamma_{1}\beta_{1} + \ldots +\gamma_{r}\beta_{r}=1+nk$ for some $k\in \mathbb{Z}$. $g=g^{-1}$ and $g^n = e$ $\implies g=g^{1+nk} = g^{\gamma_{1}\beta_{1}+\ldots + \gamma_{r} \beta_{r}}= g^{\gamma_{1}\beta_{1}}\cdot\ldots \cdot g^{\gamma_{r}\beta_{r}}$ *Question:* What is the order of $g^{\beta_{1}}$? $(1,0,\ldots,0) \in \mathbb{Z}_{p_{2}}\alpha_{1}\times \ldots \times \mathbb{Z}_{p_{r}}\alpha_{r}$ has order $p_{1}^{\alpha_{1}} \implies \beta_{1}\in \mathbb{Z}_{n}$ also has order $p_{1}^{\alpha_{1}} \bmod n$. $\implies p_{1}^{\alpha_{1}} \cdot \beta_{1} \equiv 0 \bmod n$. $\beta_{1}=n\cdot s$ for some $s\in \mathbb{Z}$ $\implies (g^{{\beta_{1}}})^{p_{1}^{\alpha_{1}}}$ From remark in [[Proof of P-group Theorem]], $G \simeq G[p_{1}] \times\ldots \times G[p_{r}]$ We can use the Chinese Remainder Theorem to regroup as $\mathbb{Z}_{d_{1}}\times \ldots \times \mathbb{Z}_{d_{m}}$, with $d_{m}\mid d_{m-1}\mid\ldots\mid d_{2}\mid d_{1}$ and $d_{1}\cdot \ldots \cdot d_{m} = p$. #### Example Say $G=G[2] \times G[3] \times G[5]$ which respectively are $\mathbb{Z}_{4}\times \mathbb{Z}_{2}, \mathbb{Z}_{9}\times \mathbb{Z}_{9} \times \mathbb{Z}_{3},\mathbb{Z}_{5}\times \mathbb{Z}_{5}$. Arrange the indices as In columns $4,9,5$ are pairwise coprime, as are $2,9,5$, and $1,3,1$. Thus, by the Chinese Remainder Theorem $\mathbb{Z}_{4}\times \mathbb{Z}_{9}\times \mathbb{Z}_{5} \simeq \mathbb{Z}_{4\cdot{9}\cdot{5}} = \mathbb{Z}_{180}$ $\mathbb{Z}_{}$