Home page for accesible maths 1 Fields and Matrices

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

1.C Inverse matrices and triangular matrices

Recall that the inverse of a square matrix AMn(F), is another square matrix BMn(F) such that AB=BA=In, where In is the identity matrix. Here F is a field, such as F=. One can prove that if an inverse matrix exists then it is unique, so we are allowed to call it the inverse (see also Exercise 1.22), and we usually denote it by A-1. If A has an inverse, then we say it is invertible.

Theorem 1.12.

Let F be a field. If AMn(F), then A is invertible if and only if det(A)0.

We will not recall the definition of the determinant here. For that, see the MATH105 course notes.

When F=, the above theorem should be familiar. But consider what it says when F=. It says that the inverse matrix always has coefficients in the rational numbers, if your original matrix had only coefficients in the rational numbers. If you consider the steps involved during the algorithm for inverting matrices, this should come as no surprise.

Example 1.13.

Find the inverse of the matrix A=[30-11-1100-1]M3(Q).

Solution: We make the augmented matrix [A|I3], and find its reduced row echelon form, using e.r.o.’s (details not shown).

[30-11001-1101000-1001][100130-1301013-1-4300100-1].

Then the 3×3 matrix on the far right is the inverse of A. Since it is easy to make a mistake, it is always worth checking:

[30-11-1100-1][130-1313-1-4300-1]=[100010001].

Notice that A had all coefficients in F=Q, and therefore A-1 must also have all coefficients in F=Q (and it does).

Exercise 1.14:

For the field 𝔽5={0,1,2,3,4} of integers modulo 5, from Exercise 1.2, find the inverse of the matrix A:=[1234]M2(𝔽5). Note your answer must be a matrix whose entries are in the field 𝔽5. Check your answer is correct by multiplying AA-1=I2.

[End of Exercise]

Recall from MATH105 that for a matrix A=[aij], the entries a11,a22,a33,,ann are collectively called the diagonal of the matrix. Also, A is called a diagonal matrix if aij=0 whenever ij. The matrix is called upper triangular (respectively lower triangular) if the only non-zero entries occur on or above (resp.  below) the diagonal. We will use the same terminology for matrices with coefficients in any field.

Exercise 1.15:

Consider the following matrices in M3(F):

  1. [151023-5456]

  2. [20003000-2]

  3. [511051005]

  1. i.

    If F=, which of these matrices are diagonal? Upper triangular? Lower triangular?

  2. ii.

    If F=𝔽5 (see Exercise 1.2), how do your answers above change?

[End of Exercise]