For a finitely generated module over a principal ideal domain, its invariant factors are nonzero nonunits in a decomposition , ordered by . They are unique up to multiplication by units and describe the torsion submodule. Over , making act as a linear operator recovers the invariant factors of a linear operator used in its rational canonical form.
Module isomorphism Created 2026-10-05 Updated 2026-10-06
A module isomorphism is a bijection of modules over the same ring preserving addition and scalar multiplication. Its inverse preserves these operations too. When a linear operator gives a vector space an -module structure by , a module isomorphism is exactly an invertible linear map intertwining the two operators. This translates classification of modules into matrix similarity and rational canonical form.
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 4 11E a Solution Created 2026-09-24 Updated 2026-10-05
The structure theorem for finitely generated modules over a principal ideal domain applies in particular to a Euclidean domain : every finitely generated module has an isomorphismwith each nonzero and a nonunit. The rank of a free module and the invariant factors of a finitely generated module are unique up to multiplication by units; empty sums are allowed. This is the classification theorem being used, without a proof of that theorem.
The rational canonical form theorem states that for a linear operator on a finite-dimensional vector space over any field , there are unique monic nonconstant polynomials such that some basis givesHere, for , the companion matrix has ones on its subdiagonal and last column . The empty matrix covers a zero-dimensional space. Two linear operators have matrix similarity exactly when they have the same invariant factors of a linear operator.
For the proof, make an -module by . It is a finitely generated module, since a vector-space basis also generates it as a module. It is a torsion module: the powers of have linear dependence in the finite-dimensional space , so some nonzero polynomial annihilates every vector. Because is a Euclidean domain, the classification theorem givesThere is no free summand, since a nonzero free module over is not a torsion module. Choose monic generators of the ideals. On , the classes of form an -basis by polynomial division. Multiplication by is exactly in that basis, proving existence. Uniqueness in the classification theorem proves uniqueness of the rational canonical form. Finally, an -module isomorphism is precisely an invertible -linear map intertwining the operators, establishing the assertion about matrix similarity. In particular the characteristic polynomial is and the minimal polynomial is for nonzero .
Past exam of the mathematics course of the University of Cambridge 2020 ib Paper 1 9G Solution Created 2026-09-24 Updated 2026-09-29
The structure theorem for finitely generated modules over a principal ideal domain applies because every Euclidean domain is a principal ideal domain. It says that a finitely generated -module is isomorphic towhere the nonzero nonunits are unique up to multiplication by units. They are the invariant factors.
For , multiplication by is the linear map . Since is finite-dimensional over , is a finitely generated torsion module over the polynomial ring , so it has no free summand. Choosing each invariant factor to be monic givesThe basis of each cyclic summand makes multiplication by a companion matrix. Concatenating these bases therefore puts in rational canonical form.
On , a polynomial annihilates multiplication by exactly when it is divisible by . It follows that the minimal polynomial and characteristic polynomial areThe second identity follows blockwise from the characteristic polynomial of a companion matrix. Since every divides , the product annihilates every cyclic summand. Thus , which is the Cayley-Hamilton theorem.
For the displayed matrix, the given generators of are the columns ofElementary row and column operations over give the Smith normal formConsequently the nonunit invariant factors areand, as a check,