## Matrices? But I hate those! : An Upsetting Adventure in Using Matrices to Represent Linear Maps.

### July 15, 2010

Okay. I get it. You’re sick and tired of matrices. We all are. You didn’t really like doing them in high school, it’s really tough to remember if one of them is or . But, you know what? You’re gonna have to tough it out. Because matrices really make everything that we’ve been doing with linear maps a whole hell of a lot easier. So let’s start digging a hole so big that we’ll never be able to get out of it.

First, you should already know what a matrix is. It’s just a formal object with some weird ways to multiply, add, and so forth. There’s also this thing called the determinant, and there’s just about a billion ways to find it. Here’s one that I’m pretty partial to.

Alright, now, let’s talk about something completely different. Let’s switch over to linear algebra. Okay, say we have two finite dimensional vector spaces and . Now, we obviously have a basis for each one of these, right? Let’s just write them down. is the basis for and is the basis for . Notice that these spaces do not have to have the same dimension! Now, let’s consider a linear map . Any one will do, just think of your favorite one.

Let’s take some arbitrary element . Okay, cool, we got now, so what can we do? Well, we can write in terms of the basis for as follows:

If we applied to , then what would happen?

right? So, really, if we want to know what happens to any element under , it suffices to simply see where takes each basis element! This makes sense, right? (If you want to build a barn, you can either paint the whole thing when it’s done or you can paint each individual plank of wood that makes it up before you build it. Does this make sense? If not, try to imagine your own reason.) So we really just need to figure out the following thing: for each what is ? Well, this is easy. is going to be in and so we can write it as a linear combination of the basis for . For example, we have . The coefficients are confusingly named because, secretly, I’m going to make them elements of a matrix soon.

So, let’s just sum this up for a second. We’re gonna have the following things by doing the same thing as we just did.

See the pattern here? Yeah. Okay, so, what we’re gonna do is, we’re going to make a matrix out of this information. We’re going to make the rows correspond to the basis elements of and the columns are going to correspond to how we write . Yeah, just look at it:

So, as we note, if we look at, say, the first column, we get all of the coefficients to the linear combination that makes up in . Make sure you know what the hell is going on here. I usually write "" above the -th column to remind myself that this is the expansion of , and sometimes I write next to the -th row to remind myself that the coefficient in that row is the coefficient of in the linear combination. We call this matrix the **matrix of **** with respect to the bases of **** and** . But because this name is pretty damn long, we just call it . You’re suppost’a write it , I think, but I really can’t be bothered to make the M that fancy. Notice, though, that this matrix depends **heavily** on the bases we picked for both and . What would have happened if we picked a different basis?

## Examples, Please!

An example will be much more useful than any of this formal defining, so let’s do just that. Let’s take as our first space with the standard basis and let’s take as our second space with the standard basis . Now, let’s define the linear map. Let’s let . You can check yourself that this is linear.

So, let’s see. which is simply the first basis element. which is simply the second element. Therefore, is equal to

Now, do you see what happened? We have the first column says that is equal to . We can essentially "read off" where the basis elements will go under a linear transform by looking at this matrix.

Let’s do one more example. Let’s take as our first space and as our second space. Let’s make them different though: let’s let the first one have the standard basis and let’s let the second one have the slightly different basis . First, check that this is, in fact, a basis. I’m not gonna do it, but it seems reasonable, right? If we need to write, say, we can just take and then add to get the desired element. Okay, so, remember those bases.

Okay, now, we’re going to have our linear map be . So, let’s figure out where the basis elements go: we have and then . So, the associated matrix will be

make sure you see where this comes from!

## Next Time…

Because I kind of want you to practice this (and because I’m pretty lazy) I’m going to write about upper triangular and diagonal matrices next time. Essentially, the idea is this: what happens if there is an invariant subspace of some map from to ? If the invariant subspace is generated by some basis elements then in our associated matrix, for every column that represents one of those , there will be zeros everywhere except, perhaps, for the rows corresponding to one of the ‘s, since, of course, can be written as a linear combination of *only *the basis elements that we’ve just described (since the subspace is invariant). Any time we have zeros in a matrix, it’s much nicer, so we’re going to try to partition our space into a bunch of invariant subspaces so that we can put lots of zeros in our associated matrix.

As a special treat, if we have enough zeros (a lot of them!) then we can even figure out the eigenvalues for the map! Talk about more bang for your buck! But this has to wait until next time. Suspense.