Math 2.0

concept

Invariant factors and elementary divisors

Summary

Let GG be a finitely generated abelian group, and write G≅Zn⊕Z/k1Z⊕⋯⊕Z/kuZG \cong \mathbb{Z}^n \oplus \mathbb{Z}/k_1\mathbb{Z} \oplus \cdots \oplus \mathbb{Z}/k_u\mathbb{Z} with 1<k1∣k2∣⋯∣ku1 < k_1 \mid k_2 \mid \cdots \mid k_u. The integers k1,…,kuk_1, \ldots, k_u are the invariant factors of GG. In the other form G≅Zn⊕Z/q1Z⊕⋯⊕Z/qtZG \cong \mathbb{Z}^n \oplus \mathbb{Z}/q_1\mathbb{Z} \oplus \cdots \oplus \mathbb{Z}/q_t\mathbb{Z}, the prime powers q1,…,qtq_1, \ldots, q_t are the elementary divisors of GG.

Remarks

The structure theorem says that the rank nn, the invariant factors and the elementary divisors are unique, and that they determine GG up to isomorphism. The elementary divisors are the prime power factors of the invariant factors. For example, the invariant factors 2,122, 12 give the elementary divisors 2,4,32, 4, 3. For a finite group GG, the product of the invariant factors is ∣G∣|G|, and the largest invariant factor kuk_u is the exponent of GG. The same terms are used for finitely generated modules over a principal ideal domain.

Explanations

L1 human

There are two standard ways to write a finitely generated abelian group as a sum of cyclic groups. The invariant factors are orders that divide each other. The elementary divisors are prime power orders.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Finitely_generated_abelian_group, Primary decomposition
  2. Web https://en.wikipedia.org/wiki/Finitely_generated_abelian_group, Invariant factor decomposition
  3. Web https://en.wikipedia.org/wiki/Elementary_divisors, lead section