The Unapologetic Mathematician

Mathematics for the interested outsider

The Determinant of a Noninvertible Transformation

We’ve defined and calculated the determinant representation of \mathrm{GL}(V) for a finite-dimensional vector space V. But we can extend this definition to apply to any linear transformation sending V to itself.

So what happens when T:V\rightarrow V fails to be invertible? Its image must miss some vectors in V. That is, we have a nontrivial kernel. The index of T is zero, so a trivial kernel would mean a trivial cokernel. We would then have a one-to-one and onto linear transformation, and T would be invertible.

Let’s take a basis of \mathrm{Ker}(T). Since this is a linearly independent set spanning a subspace of V, it can be completed to a basis \{e_i\} for all of V. Now we can use this basis of V to write out the matrix of T and use our formula from last time to calculate \det(T).

The ith column of the matrix is the vector T(e_i) written out in terms of our basis. But since the first few basis vectors are in the kernel of T we have at least T(e_1)=0. So the first column of the matrix must be all zeroes. Now as we pick a permutation and walk down the rows, some row is going to tell us to multiply by the entry in the first column, which we have just seen is zero. That is, for every permutation, the term in our determinant formula for that permutation is zero, and so the sum of them all — the determinant itself — must also be zero.

Notice that this still lets us think of the determinant as preserving multiplications in the algebra of endomorphisms of V. Any noninvertible linear transformation is sent to zero. The product of a noninvertible transformation and any other transformation will be noninvertible, and the product of their determinants will be zero. This also gives us a test for invertibility! Take the linear transformation T and run it through the determinant function. If the result is zero, then T is noninvertible. If the result is nonzero, then T is invertible.

About these ads

January 14, 2009 - Posted by | Algebra, Linear Algebra

1 Comment »

  1. [...] Now, as I stated yesterday most of these eigenspaces will be trivial, just as the kernel may be trivial. The interesting stuff happens when is nontrivial. In this case, we’ll call an eigenvalue of the transformation (thus the eigenvalues of a transformation are those which correspond to nonzero eigenvectors). So how can we tell whether or not a kernel is trivial? Well, we know that the kernel of an endomorphism is trivial if and only if the endomorphism is invertible. And the determinant provides a test for invertibility! [...]

    Pingback by Determining Eigenvalues « The Unapologetic Mathematician | January 27, 2009 | Reply


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

Join 388 other followers

%d bloggers like this: