---
title: Direct Products and Finite Abelian Groups
module: Products and Group Structure
moduleNumber: 5
lessonNumber: 1
order: 501
summary: >
  The direct product assembles a larger group from componentwise copies of
  smaller ones, and a recognition theorem reverses the process when two normal
  subgroups meet trivially and span the group. The Fundamental Theorem of
  Finitely Generated Abelian Groups then classifies every such group by two
  equivalent invariants, invariant factors and elementary divisors.
topics: [Products and Group Structure]
sources:
  - book: Dummit & Foote
    ref: "Ch. 5 — Direct and Semidirect Products; §5.1 Direct Products, §5.2 The Fundamental Theorem of Finitely Generated Abelian Groups, §5.4 Recognizing Direct Products"
  - book: Judson
    ref: "Ch. 9 — Isomorphisms; §9.2 Direct Products. Ch. 13 — The Structure of Groups; §13.1 Finite Abelian Groups"
draft: false
---

The direct product builds a larger group from smaller ones $H$ and $K$; a
recognition theorem reverses the process, splitting a group $G$ into subgroups
that determine it. Together they reduce the classification of finite abelian
groups to bookkeeping about prime powers.

## The external direct product

The construction takes tuples and multiplies them slot by slot.

> **Definition (External direct product).** For groups $G_1, \dots, G_n$ with
> operations $\ast_1, \dots, \ast_n$, the **direct product** $G_1 \times \cdots
> \times G_n$ is the set of $n$-tuples $(g_1, \dots, g_n)$ with $g_i \in G_i$,
> under componentwise multiplication
> $$
> (g_1, \dots, g_n)(h_1, \dots, h_n) = (g_1 \ast_1 h_1, \dots, g_n \ast_n h_n).
> $$

Each group axiom holds in the product because it holds in every factor: the
identity is $(1_1, \dots, 1_n)$, the inverse of $(g_1, \dots, g_n)$ is
$(g_1^{-1}, \dots, g_n^{-1})$, and associativity is checked coordinate by
coordinate.[^df-prod] The order multiplies.

> **Proposition (Order of a product).** If $G_1, \dots, G_n$ are finite groups
> then $|G_1 \times \cdots \times G_n| = |G_1|\,|G_2| \cdots |G_n|$, and the
> product is infinite as soon as any factor is.

The order of a single element also decouples. Writing $x = (x_1, \dots, x_n)$,
the $k$-th power is $x^k = (x_1^k, \dots, x_n^k)$, so $x^k = 1$ exactly when
every $x_i^k = 1$. Hence

$$
|x| = \operatorname{lcm}\bigl(|x_1|, |x_2|, \dots, |x_n|\bigr),
$$

infinite if any coordinate has infinite order.

### Factors as coordinate axes

Inside the product sit faithful copies of each factor, together with projection
maps onto each.[^df-axes]

> **Proposition (Embeddings and projections).** Let $G = G_1 \times \cdots
> \times G_n$. For each $i$:
>
> - The set of tuples with the identity in every slot except the $i$-th is a
>   subgroup isomorphic to $G_i$; identifying $G_i$ with this copy, $G_i
>   \trianglelefteq G$.
> - The map $\pi_i(g_1, \dots, g_n) = g_i$ is a surjective homomorphism with
>   $\ker \pi_i \cong \prod_{j \neq i} G_j$.
> - If $x \in G_i$ and $y \in G_j$ with $i \neq j$, then $xy = yx$.

The last point characterizes a direct product: elements drawn
from different factors commute, because they overlap in no coordinate. The name
"coordinate axes" is literal for $\mathbb{R} \times \mathbb{R}$, where the two
factors are the $x$- and $y$-axes — though there they are not the only copies of
$\mathbb{R}$, since every line through the origin is another.

Working inside $\mathbb{Z}_n \times \mathbb{Z}_m$, we let $x$ generate the first
factor and $y$ the second and write a general element as $x^a y^b$ in place of
the ordered pair, since $x$ and $y$ commute and each generates its own axis.

## Recognizing a direct product internally

A single group $G$ may already be the product of two of its subgroups. The
criterion is the three features isolated above: two normal subgroups that
commute elementwise and meet only in the identity.

> **Theorem (Recognition of direct products).** Suppose $G$ has subgroups $H$
> and $K$ with
>
> - $H \trianglelefteq G$ and $K \trianglelefteq G$, and
> - $H \cap K = 1$.
>
> Then $HK \cong H \times K$.

The proof runs through two facts.[^df-recog] First, when $H, K
\trianglelefteq G$ with $H \cap K = 1$, every $h \in H$ and $k \in K$ commute:
the element $h^{-1}k^{-1}hk$ lies in $H$ (since $k^{-1}hk \in H$) and in $K$
(since $h^{-1}k^{-1}h \in K$), so it lies in $H \cap K = 1$. Second, each
element of $HK$ is written as $hk$ in exactly one way when $H \cap K = 1$. The
map $hk \mapsto (h,k)$ is then a well-defined bijective homomorphism.

$$
% caption: When $H, K \trianglelefteq G$ and $H \cap K = 1$, every $g \in G$
% factors uniquely as $hk$; the two normal subgroups tile $G$ into an $H$-by-$K$
% grid, which is the internal direct product.
\begin{tikzpicture}[scale=1.0, font=\small]
\definecolor{acc}{HTML}{4A6FA5}
% grid of hk cells
\foreach \i in {0,1,2} {
  \foreach \j in {0,1,2,3} {
    \draw[black, fill=acc!8] (\j*1.35,\i*0.9) rectangle (\j*1.35+1.35,\i*0.9+0.9);
  }
}
% row labels (K cosets across, H down) — use plain text to stay font-safe
\node[anchor=east, black] at (-0.15,0.45) {$h_1$};
\node[anchor=east, black] at (-0.15,1.35) {$h_2$};
\node[anchor=east, black] at (-0.15,2.25) {$h_3$};
\node[anchor=south, black] at (0.675,2.75) {$k_1$};
\node[anchor=south, black] at (2.025,2.75) {$k_2$};
\node[anchor=south, black] at (3.375,2.75) {$k_3$};
\node[anchor=south, black] at (4.725,2.75) {$k_4$};
% highlight one cell = one element hk
\draw[acc, very thick, fill=acc!22] (2.7,0.9) rectangle (4.05,1.8);
\node[acc] at (3.375,1.35) {$hk$};
% axis labels
\node[anchor=north, black] at (2.7,-0.2) {$K$ across};
\node[anchor=east, black] at (-0.9,1.35) {$H$ down};
\end{tikzpicture}
$$

The word **internal** direct product names $HK$ when $H, K \trianglelefteq G$
and $H \cap K = 1$; **external** names the tuple construction $H \times K$. The
theorem says the distinction is only notational: one writes elements as
products $hk$, the other as pairs $(h,k)$.

> **Worked example.** Recognizing $\mathbb{Z}_{12}$ as an internal direct
> product. Inside $\mathbb{Z}_{12}$ take $H = \langle 4\rangle = \{0,4,8\}$ of
> order $3$ and $K = \langle 3\rangle = \{0,3,6,9\}$ of order $4$. The group is
> abelian, so both subgroups are normal, and their intersection is trivial: the
> only element common to $\{0,4,8\}$ and $\{0,3,6,9\}$ is $0$. Then
> $$
> |HK| = \frac{|H|\,|K|}{|H \cap K|} = \frac{3 \cdot 4}{1} = 12 = |\mathbb{Z}_{12}|,
> $$
> so $HK = \mathbb{Z}_{12}$. The recognition theorem gives $\mathbb{Z}_{12} \cong
> H \times K \cong \mathbb{Z}_3 \times \mathbb{Z}_4$, matching $\gcd(3,4) = 1$.

A more flexible statement replaces normality of both factors by a single normal
factor with a **complement**; that is the [semidirect
product](/abstract-algebra/products-and-group-structure/semidirect-products).
Normality of both sides forces commuting, and commuting is what makes the
product direct.

### The commutator subgroup

The recognition theorem is one instance of a general tool. For $x, y \in G$ the
**commutator** is $[x,y] = x^{-1}y^{-1}xy$, and it equals $1$ exactly when $x$
and $y$ commute. The subgroup $G' = \langle [x,y] : x,y \in G\rangle$ generated by
all commutators is the **commutator subgroup**.[^df-comm] Two facts are used
repeatedly:

- $G' \trianglelefteq G$ (in fact $G'$ is characteristic), and $G/G'$ is abelian.
- $G/H$ is abelian if and only if $G' \leq H$; so $G/G'$ is the largest abelian
  quotient of $G$.

For $G = D_8$, the center $Z(D_8) = \langle r^2\rangle$ has order $2$ and the
quotient $D_8/Z(D_8)$ is the Klein four-group, hence abelian, so $D_8' \leq
Z(D_8)$; since $D_8$ is non-abelian, $D_8' = Z(D_8) = \langle r^2\rangle$. The
commutator returns in the study of
[solvable groups](/abstract-algebra/products-and-group-structure/nilpotent-and-solvable-groups),
where iterating $G \mapsto G'$ builds the derived series.

## The Chinese Remainder Theorem for cyclic groups

A product of two cyclic groups is again cyclic exactly when the factor orders
are coprime.

> **Proposition (Coprime splitting).** For $m, n \in \mathbb{Z}^+$:
>
> - $\mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn}$ if and only if
>   $\gcd(m,n) = 1$.
> - If $n = p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ then $\mathbb{Z}_n \cong
>   \mathbb{Z}_{p_1^{\alpha_1}} \times \cdots \times \mathbb{Z}_{p_k^{\alpha_k}}$.

The proof is the order formula.[^df-crt] With $\mathbb{Z}_m = \langle x\rangle$
and $\mathbb{Z}_n = \langle y\rangle$, the element $xy$ has order
$\operatorname{lcm}(m,n)$. When $\gcd(m,n) = 1$ this equals $mn = |G|$, so $xy$
generates and $G$ is cyclic; when $\gcd(m,n) > 1$ the lcm is strictly less than
$mn$, so no element has order $mn$ and $G$ is not cyclic.

This is the group-theoretic form of the [Chinese Remainder
Theorem](/abstract-algebra/ring-theory/fractions-and-the-chinese-remainder-theorem):
choosing a residue modulo $m$ and one modulo $n$ independently is the same as
choosing a single residue modulo $mn$, precisely when $m$ and $n$ are coprime.
For example, $\mathbb{Z}_2 \times \mathbb{Z}_3 \cong \mathbb{Z}_6$, laid out as a
grid below.

$$
% caption: The bijection $\mathbb{Z}_2 \times \mathbb{Z}_3 \cong \mathbb{Z}_6$:
% each cell $(a \bmod 2, b \bmod 3)$ holds the unique $k \in \{0,\dots,5\}$ with
% $k \equiv a \pmod 2$ and $k \equiv b \pmod 3$. All six residues appear once.
\begin{tikzpicture}[scale=1.0, font=\small]
\definecolor{acc}{HTML}{4A6FA5}
% column headers b mod 3
\node[anchor=south, black] at (1.0,2.1) {$b=0$};
\node[anchor=south, black] at (2.2,2.1) {$b=1$};
\node[anchor=south, black] at (3.4,2.1) {$b=2$};
% row headers a mod 2
\node[anchor=east, black] at (0.3,1.5) {$a=0$};
\node[anchor=east, black] at (0.3,0.5) {$a=1$};
% cells: row a=0 -> 0,4,2 ; row a=1 -> 3,1,5
\foreach \c/\v in {1.0/0, 2.2/4, 3.4/2} {
  \draw[black, fill=acc!10] (\c-0.55,1.0) rectangle (\c+0.55,2.0);
  \node[acc] at (\c,1.5) {$\v$};
}
\foreach \c/\v in {1.0/3, 2.2/1, 3.4/5} {
  \draw[black, fill=acc!10] (\c-0.55,0.0) rectangle (\c+0.55,1.0);
  \node[acc] at (\c,0.5) {$\v$};
}
\end{tikzpicture}
$$

When the factor orders share a prime, the product is not cyclic.

> **Worked example.** Why $\mathbb{Z}_4 \times \mathbb{Z}_6$ is not cyclic. The
> group has order $24$. The order of $(a,b)$ is $\operatorname{lcm}(|a|,|b|)$, so
> the largest element order is $\operatorname{lcm}(4,6) = 12$, attained by
> $(1,1)$. No element reaches order $24$, so the group is not cyclic — matching
> $\gcd(4,6) = 2 > 1$. Splitting the factors into prime powers,
> $$
> \mathbb{Z}_4 \times \mathbb{Z}_6 \cong \mathbb{Z}_4 \times \mathbb{Z}_2 \times
> \mathbb{Z}_3 \cong \mathbb{Z}_{12} \times \mathbb{Z}_2,
> $$
> whose invariant factors are $12, 2$ with $2 \mid 12$.

## The Fundamental Theorem of Finitely Generated Abelian Groups

Every finitely generated abelian group is a product of cyclic pieces, and the
list of pieces is unique once put in a canonical order. This is the complete
classification.

> **Theorem (Invariant factor form).** Let $G$ be a finitely generated abelian
> group. Then
> $$
> G \cong \mathbb{Z}^r \times \mathbb{Z}_{n_1} \times \mathbb{Z}_{n_2} \times
> \cdots \times \mathbb{Z}_{n_s},
> $$
> for integers $r \geq 0$ and $n_j \geq 2$ with $n_{i+1} \mid n_i$ for
> $1 \leq i \leq s-1$. The integer $r$ (the **free rank** or **Betti number**)
> and the ordered list $n_1, \dots, n_s$ (the **invariant factors**) are
> uniquely determined by $G$.

Two finitely generated abelian groups are isomorphic if and only if they have
the same free rank and the same list of invariant factors.[^df-ftfgag] The group
is finite exactly when $r = 0$, and then $|G| = n_1 n_2 \cdots n_s$. The
divisibility chain forces the largest factor to the front: every prime dividing
$|G|$ divides $n_1$, so $n_1$ is the **exponent** of $G$, the least $n$ with
$x^n = 1$ for all $x$.

The squarefree case follows at once.

> **Corollary.** If $n$ is a product of distinct primes then the only abelian
> group of order $n$, up to isomorphism, is the cyclic group $\mathbb{Z}_n$.

Because a squarefree $n$ cannot support any nontrivial divisibility chain — the
front factor $n_1$ must already be divisible by every prime, hence $n_1 = n$.

### The elementary divisor form

There is a second canonical form, obtained by splitting each cyclic factor into
prime-power pieces via the coprime-splitting proposition.

> **Theorem (Elementary divisor form).** Let $|G| = p_1^{\alpha_1} \cdots
> p_k^{\alpha_k}$. Then $G$ is the direct product of its Sylow subgroups,
> $G \cong A_1 \times \cdots \times A_k$ with $|A_i| = p_i^{\alpha_i}$, and each
> $A_i$ is a product of cyclic groups of $p_i$-power order. The full list of
> prime-power orders that appear — the **elementary divisors** — is unique.

The elementary divisors are the invariant factors of the Sylow subgroups. Their
advantage is computational: listing all abelian groups of order $p^\alpha$ is
the same as listing all **partitions** of $\alpha$, and this count does not
depend on $p$.[^df-elem] For a prime power $p^\alpha$, each partition
$\alpha = \beta_1 + \beta_2 + \cdots + \beta_t$ with $\beta_1 \geq \cdots \geq
\beta_t \geq 1$ names the group $\mathbb{Z}_{p^{\beta_1}} \times \cdots \times
\mathbb{Z}_{p^{\beta_t}}$.

$$
% caption: The three abelian groups of order $p^3$ come from the three
% partitions of the exponent $3$: the partition $3$ gives $\mathbb{Z}_{p^3}$,
% the partition $2+1$ gives $\mathbb{Z}_{p^2} \times \mathbb{Z}_p$, and
% $1+1+1$ gives $\mathbb{Z}_p \times \mathbb{Z}_p \times \mathbb{Z}_p$.
\begin{tikzpicture}[scale=1.0, font=\small,
  nd/.style={draw, black, inner sep=3pt, fill=acc!8},
  lf/.style={draw, acc, inner sep=3pt, fill=acc!14}]
\definecolor{acc}{HTML}{4A6FA5}
\node[nd] (root) at (0,3) {exponent $3$};
\node[nd] (a) at (-3.2,1.5) {$3$};
\node[nd] (b) at (0,1.5) {$2+1$};
\node[nd] (c) at (3.2,1.5) {$1+1+1$};
\node[lf] (ag) at (-3.2,0.3) {$\mathbb{Z}_{p^3}$};
\node[lf] (bg) at (0,0.3) {$\mathbb{Z}_{p^2}$, $\mathbb{Z}_p$};
\node[lf] (cg) at (3.2,0.3) {$\mathbb{Z}_p$, $\mathbb{Z}_p$, $\mathbb{Z}_p$};
\draw[black] (root) -- (a);
\draw[black] (root) -- (b);
\draw[black] (root) -- (c);
\draw[black, dashed] (a) -- (ag);
\draw[black, dashed] (b) -- (bg);
\draw[black, dashed] (c) -- (cg);
\end{tikzpicture}
$$

The two forms describe the same groups, so an explicit conversion relates them
by regrouping the prime-power blocks.

### Converting between the forms

Take $G \cong \mathbb{Z}_{30} \times \mathbb{Z}_{30} \times \mathbb{Z}_2$, of
order $2^3 \cdot 3^2 \cdot 5^2$. Splitting each $\mathbb{Z}_{30} \cong
\mathbb{Z}_2 \times \mathbb{Z}_3 \times \mathbb{Z}_5$ and grouping by prime
gives the elementary divisors. Reassembling into a divisibility chain gives the
invariant factors.

$$
% caption: Converting between the two canonical forms for one group: elementary
% divisors group by prime (columns); invariant factors read across the rows,
% padding short columns with $1$ so the products satisfy $n_{i+1} \mid n_i$.
\begin{tikzpicture}[scale=1.0, font=\small]
\definecolor{acc}{HTML}{4A6FA5}
% prime columns
\node[anchor=south, black] at (1.0,2.5) {$p=2$};
\node[anchor=south, black] at (2.6,2.5) {$p=3$};
\node[anchor=south, black] at (4.2,2.5) {$p=5$};
% column 2: 2,2,2 ; column 3: 3,3,1 ; column 5: 5,5,1
\foreach \r/\y in {0/2.0, 1/1.2, 2/0.4} {
  \draw[black, fill=acc!8] (0.45,\y-0.3) rectangle (1.55,\y+0.3);
  \draw[black, fill=acc!8] (2.05,\y-0.3) rectangle (3.15,\y+0.3);
  \draw[black, fill=acc!8] (3.65,\y-0.3) rectangle (4.75,\y+0.3);
}
\node[acc] at (1.0,2.0) {$2$}; \node[acc] at (2.6,2.0) {$3$}; \node[acc] at (4.2,2.0) {$5$};
\node[acc] at (1.0,1.2) {$2$}; \node[acc] at (2.6,1.2) {$3$}; \node[acc] at (4.2,1.2) {$5$};
\node[acc] at (1.0,0.4) {$2$}; \node[black] at (2.6,0.4) {$1$}; \node[black] at (4.2,0.4) {$1$};
% row products = invariant factors
\node[anchor=west, black] at (5.4,2.0) {$= 30$};
\node[anchor=west, black] at (5.4,1.2) {$= 30$};
\node[anchor=west, black] at (5.4,0.4) {$= 2$};
\draw[acc, thick, ->] (4.95,2.0) -- (5.35,2.0);
\draw[acc, thick, ->] (4.95,1.2) -- (5.35,1.2);
\draw[acc, thick, ->] (4.95,0.4) -- (5.35,0.4);
\end{tikzpicture}
$$

Reading down the columns, the elementary divisors are $2,2,2,3,3,5,5$; reading
across the rows, the invariant factors are $30, 30, 2$ (each divides the one
above). The same group, two descriptions:

| Form | Rule | Result for this $G$ |
| --- | --- | --- |
| Invariant factors | $n_{i+1} \mid n_i$, product $= \lvert G\rvert$ | $\mathbb{Z}_{30} \times \mathbb{Z}_{30} \times \mathbb{Z}_2$ |
| Elementary divisors | prime powers, grouped by prime | $\mathbb{Z}_2^{\,3} \times \mathbb{Z}_3^{\,2} \times \mathbb{Z}_5^{\,2}$ |

To decide whether two products of cyclic groups are isomorphic, compute either
invariant. For instance $\mathbb{Z}_6 \times \mathbb{Z}_{15}$ has elementary
divisors $2,3,3,5$, while $\mathbb{Z}_{10} \times \mathbb{Z}_9$ has $2,5,9$; the
lists differ, so the groups differ — visibly, the second has an element of order
$9$ and the first does not.

## Enumerating abelian groups of a fixed order

The elementary divisor form turns enumeration into a product of partition
counts. If $n = p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ and $q_i$ is the number of
partitions of $\alpha_i$, then the number of abelian groups of order $n$ is
$q_1 q_2 \cdots q_k$, since a group is chosen by independently picking a
partition at each prime.

For $n = 1800 = 2^3 \cdot 3^2 \cdot 5^2$: the exponent $3$ has three partitions,
each of $2$ has two, so there are $3 \cdot 2 \cdot 2 = 12$ abelian groups of
order $1800$. The choices at each prime:

| Prime power | Partitions of exponent | Abelian pieces |
| --- | --- | --- |
| $2^3$ | $3$; $2,1$; $1,1,1$ | $\mathbb{Z}_8$; $\mathbb{Z}_4 \times \mathbb{Z}_2$; $\mathbb{Z}_2^{\,3}$ |
| $3^2$ | $2$; $1,1$ | $\mathbb{Z}_9$; $\mathbb{Z}_3 \times \mathbb{Z}_3$ |
| $5^2$ | $2$; $1,1$ | $\mathbb{Z}_{25}$; $\mathbb{Z}_5 \times \mathbb{Z}_5$ |

Each of the $12$ groups is one choice from each row, multiplied together. The
count depends only on the exponent pattern of $n$, not on the primes — every
order of the form $p^3 q^2 r^2$ with distinct primes has exactly $12$ abelian
groups.

> **Worked example.** The six abelian groups of order $360$, in both canonical
> forms. Factor $360 = 2^3 \cdot 3^2 \cdot 5$. The exponent $3$ has three
> partitions, the exponent $2$ has two, and the exponent $1$ has one, so there
> are $3 \cdot 2 \cdot 1 = 6$ groups. A partition at each prime fixes the
> elementary divisors; reading the prime-power blocks across divisibility-ordered
> rows recovers the invariant factors. For the richest case, elementary divisors
> $2,2,2,3,3,5$ regroup as $n_1 = 2\cdot3\cdot5 = 30$, $n_2 = 2\cdot3 = 6$, and
> $n_3 = 2$, giving the chain $2 \mid 6 \mid 30$ with product $360$.

| Elementary divisors | Invariant factors | Group |
| --- | --- | --- |
| $8,\ 9,\ 5$ | $360$ | $\mathbb{Z}_{360}$ |
| $8,\ 3,3,\ 5$ | $120,\ 3$ | $\mathbb{Z}_{120} \times \mathbb{Z}_3$ |
| $4,2,\ 9,\ 5$ | $180,\ 2$ | $\mathbb{Z}_{180} \times \mathbb{Z}_2$ |
| $4,2,\ 3,3,\ 5$ | $60,\ 6$ | $\mathbb{Z}_{60} \times \mathbb{Z}_6$ |
| $2,2,2,\ 9,\ 5$ | $90,\ 2,\ 2$ | $\mathbb{Z}_{90} \times \mathbb{Z}_2 \times \mathbb{Z}_2$ |
| $2,2,2,\ 3,3,\ 5$ | $30,\ 6,\ 2$ | $\mathbb{Z}_{30} \times \mathbb{Z}_6 \times \mathbb{Z}_2$ |

```algorithm
caption: $\textsc{AbelianGroups}(n)$ — enumerate abelian groups of order $n$
factor $n = p_1^{\alpha_1} \cdots p_k^{\alpha_k}$
for each prime power $p_i^{\alpha_i}$ do
  list every partition $\alpha_i = \beta_1 + \cdots + \beta_t$, $\beta_1 \geq \cdots \geq \beta_t \geq 1$
  each partition gives the piece $\mathbb{Z}_{p_i^{\beta_1}} \times \cdots \times \mathbb{Z}_{p_i^{\beta_t}}$
form all products taking one piece per prime // Cartesian product of the lists
return the products // distinct choices give nonisomorphic groups
```

The same partition data reappears with a twist in the [structure theorem for
modules over a
PID](/abstract-algebra/modules-over-pids/structure-theorem-over-pids), where the
role of $\mathbb{Z}$ is played by an arbitrary principal ideal domain and finite
abelian groups become the special case $R = \mathbb{Z}$.

## The scope of the classification

For any $n$, the abelian groups of order $n$ are listed explicitly and finitely.
Recovering which isomorphism type a given group belongs to may still require
substantial computation when $n$ carries large prime powers, since the number of
types grows with the partition counts.

The abelian case is closed; the non-abelian case is not. A direct product of
abelian groups stays abelian, since a product is abelian if and only if every
factor is. To build non-abelian groups from abelian pieces, we loosen the
construction, keeping only one factor normal and letting the other act on it:
the [semidirect
product](/abstract-algebra/products-and-group-structure/semidirect-products).

[^df-prod]: **Dummit & Foote**, _Abstract Algebra_, §5.1 — Direct Products, Proposition 1: componentwise operations inherit each group axiom from the factors, and the order of the product is the product of the orders.
[^df-axes]: **Dummit & Foote**, §5.1, Proposition 2: the coordinate-axis subgroups isomorphic to each $G_i$, the projection homomorphisms $\pi_i$ with kernels the complementary product, and the commuting of elements from distinct factors.
[^df-recog]: **Dummit & Foote**, §5.4 — Recognizing Direct Products, Theorem 9 and Proposition 8: two normal subgroups with trivial intersection give $HK \cong H \times K$, with unique factorization $g = hk$.
[^df-comm]: **Dummit & Foote**, §5.4, Proposition 7: the commutator subgroup $G'$ is characteristic, $G/G'$ is the largest abelian quotient, and $G/H$ is abelian iff $G' \leq H$.
[^df-crt]: **Dummit & Foote**, §5.2, Proposition 6: $\mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn}$ iff $\gcd(m,n)=1$, and the prime-power splitting of a cyclic group; the group form of the Chinese Remainder Theorem.
[^df-ftfgag]: **Dummit & Foote**, §5.2, Theorem 3: the invariant factor decomposition of a finitely generated abelian group and its uniqueness (free rank and ordered invariant factors). See also **Judson**, §13.1 — Finite Abelian Groups, Theorem 13.5.
[^df-elem]: **Dummit & Foote**, §5.2, Theorem 5: the elementary divisor decomposition, the direct product of Sylow subgroups, and the bijection between abelian groups of order $p^\alpha$ and partitions of $\alpha$.