Theorem

Let be a finitely generated abelian group. Then is isomorphic to a finite direct sum of cyclic group, where the finite cyclic summands (if any) are of order .

\begin{proof} By ^d4cf25, there exists an epimorphism and . By ^93020f, there exists a basis of and such that is a basis of . Thus and . \end{proof}

Lemma

For where are distinct primes and . Then .

Theorem

For a finitely generated abelian group , where and are primes. (It is possible that .)

\begin{proof} By ^08ebc2 and ^a1db34. \end{proof}

Next, we aim to show in ^79ab03 are all uniquely determined. Firstly, we have the following lemma.

Lemma

If is a finitely generated abelian group and , then

  • the following subsets are subgroups of :
    • (-torsion of )
    • (torsion subgroup of );
  • if , then ;
  • if is an isomorphism, then induces and .

\begin{proof} Easy. \end{proof}

Theorem

Let be a finitely generated abelian group. By ^08ebc2, where . By ^79ab03, . The numbers and are all uniquely determined.

\begin{proof} Part 1. is uniquely determined. By ^08ebc2, there exists some decomposition with free and torsion. By ^2332c5, . Then . Then is uniquely determined by ^14f54e.

Part 2. If and , then are unique. Choose one , then , as if . So in the end, it suffices to prove the following statement: if where and , then and . First, and . Thus . Let be the first integer such that if and . WLOG assume that . Then . Since and , does not exist by the proof of Part 1. Therefore, for all .

Part 3. where , then are unique. It suffices to show, if , then and . Pick a prime . Then where and and and . By Part 2, non-zero match each other.

Claim that and have the same prime divisors. Assume that there exists a prime such that and . Then by the argument above, we have that . If there exists another prime such that and , then , contradiction. So WLOG we may assume that is a proper divisor of and . It follows that , which is impossible. Repeat the procedure for , we prove that all and have the same prime divisors.

Run this argument for all , then and . \end{proof}

Remark. ’s are called invariant factors of , and ‘s are called elementary divisors.