Recall that similar matrices represent the same abstract linear operator up to a change of basis. We generalize this notion to maps between different spaces:

Definition 405.1(Equivalent matrices).

Two matrices are equivalent if they represent the same homomorphism of free modules up to a choice of basis. In other words, is of the form , where and are invertible matrices.

This is clearly an equivalence relation. Thus, an ‘abstract’ homomorphism between two free modules is not represented by one matrix as much as by the whole equivalence class with respect to this relation.

Our goal is now the following: given a homomorphism between two free modules, find ‘special’ bases in and so that the matrix of takes a particularly convenient form.

Given a matrix with entries in , recall that the following elementary (row/column) operations can be realized by (left/right) multiplication by (invertible) elementary matrices:

  • swap tow rows (columns) of ;
  • add to one row (column) a multiple of another row (column);
  • multiply all entries in one row (column) of by a unit of .

Thus, it follows that if can be obtained from by a sequence of elementary operations, then and are equivalent. When is a field, is generated by elementary matrices ( Aluffi (2009) VI.2.9), and the converse is true too: two matrices are equivalent over a field iff they are linked by a sequence of elementary operations. If the process described in the proof of Aluffi (2009) VI.2.9 is applied to any rectangular matrix, we get the following1

Proposition 405.2(Aluffi (2009) VI.2.10).

Over a field, every matrix is equivalent to a matrix of the form

where .

We can’t hope for such a result when working with arbitrary rings: We can’t do it for integer matrices. However, over euclidean domains, we can get pretty close - we can coax via elementary operations any matrix into what we call Smith normal form.

Proposition 405.3(Artin (2011) 14.4.6).

Let be a Euclidean domain, and let . Then is equivalent to a matrix of the form

with . This is called the Smith normal form of the matrix.

5393e0

This achieves the ‘nice form’ we were seeking, and since matrix equivalence is an equivalence relation, classifies all matrices in with smith normal form matrices being canonical representatives of the equivalence classes.

Remark 405.4.

We now see that is generated by elementary matrices if is a euclidean domain. However, this is not the case for PIDs. It is possible to produce a Smith normal form for any matrix with entries in a PID, but we will need more than elementary row and column operations.


Proposition 405.5(Artin (2011) 14.4.9).

Let be an matrix, and let and be invertible integer matrices such that has the ‘diagonal from’.

  1. The integer solutions of the homogeneous equation are the integer vectors whose first coordinates are zero.
  2. The integer solutions of the homogeneous equation are those of the form , where .
  3. The image of multiplication by consists of the integer combinations of the vectors . The image of of multiplication by consists of the vectors , where is in

Footnotes

  1. We’ve already seen this before!


References

Aluffi, P. (2009). Algebra: Chapter 0. American Mathematical Society.
Artin, M. (2011). Algebra (2. ed). Pearson Education, Prentice Hall.