Elementary divisors

Template:Short description In algebra, the elementary divisors of a module over a principal ideal domain (PID) occur in one form of the structure theorem for finitely generated modules over a principal ideal domain.

If $R$ is a PID and $M$ a finitely generated $R$-module, then M is isomorphic to a finite direct sum of the form

$M\cong R^r\oplus \underset{i=1}{\overset{l}{⨁}}R/(q_i)\text{with }r,l\ge 0$,

where the $(q_i)$ are nonzero primary ideals.

The list of primary ideals is unique up to order (but a given ideal may be present more than once, so the list represents a multiset of primary ideals); the elements $q_i$ are unique only up to associatedness, and are called the elementary divisors. Note that in a PID, the nonzero primary ideals are powers of prime ideals, so the elementary divisors can be written as powers $q_i=p_i^{r_i}$ of irreducible elements. The nonnegative integer $r$ is called the free rank or Betti number of the module $M$.

The module is determined up to isomorphism by specifying its free rank Template:Math, and for class of associated irreducible elements Template:Math and each positive integer Template:Math the number of times that Template:Math occurs among the elementary divisors. The elementary divisors can be obtained from the list of invariant factors of the module by decomposing each of them as far as possible into pairwise relatively prime (non-unit) factors, which will be powers of irreducible elements. This decomposition corresponds to maximally decomposing each submodule corresponding to an invariant factor by using the Chinese remainder theorem for R. Conversely, knowing the multiset Template:Math of elementary divisors, the invariant factors can be found, starting from the final one (which is a multiple of all others), as follows. For each irreducible element Template:Math such that some power Template:Math occurs in Template:Math, take the highest such power, removing it from Template:Math, and multiply these powers together for all (classes of associated) Template:Math to give the final invariant factor; as long as Template:Math is non-empty, repeat to find the invariant factors before it.

See also

• Invariant factors
• Smith normal form

References

• Template:Cite book Chap.11, p.182.
• Chap. III.7, p.153 of Template:Lang Algebra

Template:Linear-algebra-stub