HomeHelp
1

6.2. Revision: Determinants.

Before explaining how to find the eigenvalues of a linear transformation we need to review the notion of determinant. In a previous course you have met formulae for the determinants of 2x2 and 3x3 matrices:

   (a   b)
det  c  d  = ad- bc ,

(23)

and

   (            )
     a11  a12  a13
det( a21  a22  a23) =  a11a22a33 + a12a23a31 + a13a21a32
     a31  a32  a33
                                 - a13a22a31 - a12a21a33 - a23a32a11 .

(24)

This can be generalised to arbitrary square matrices; although we will not need the formulae in this course. What we will need are two basic properties of determinants. The first property is that the determinant is multiplicative.

Theorem 6.6. Let T,R ∈ Mn(ℝ)  be n× n  matrices. Then

det(TR) = (detT)(detR) .

This has several important consequences. The first is that the identity matrix I  has unit determinant, since TI = T  for all matrices T  . (Strictly speaking this uses the fact that there are some matrices T  with nonzero determinant.) Another consequence is that if T  is invertible, so that there exists T-1  with TT -1 = I  then

    -1   -1--- detT   = detT ,

(25)

whence, in particular, detT ⁄= 0  . In fact, this is an equivalent characterisation of invertible matrices:

Theorem 6.7. Let T ∈ Mn(ℝ)  be an n× n  matrix. Then T  is invertible if and only if detT ⁄= 0  .

One final consequence of Theorem 6.6 is that the determinant makes sense for a linear transformations T : V → V  in of an abstract vector space V  . To compute the determinant of T  we compute the determinant of the matrix of T  relative to a basis for V  . The choice of basis does not matter because if T  and T′ are the matrices relative to two bases, then they are related by equation (20). Taking the determinant of both sides, using multiplicativity twice (Theorem 6.6) and using equation (25) for the change of basis matrix S  , we arrive at the fact that detT′ = detT  , which we define as det T  .

A relatively efficient computational method to calculate the determinant of a square matrix T  is the following. First we bring T  to upper triangular form T′ using only elementary row operations of types (2) and (3). Then

           number of swaps                           ′
detT = (- 1)           × product of diagonal entries in T .

It follows from this method that the determinant of an n × n  matrix is an n  -multilinear function; in other words, if T ∈ Mn(ℝ)  and c ∈ ℝ  , then

det(cT) = cn detT .

We can now go back to our discussion of eigenvalues.