## Another Look at the Rank-Nullity Theorem: Linear Maps.

### June 9, 2010

The last legit theorem we went over was the rank-nullity theorem. This time, we’re going to discuss a couple of cute theorems dealing with the rank-nullity theorem and its applications to vector spaces. **For this post’s sake, all vector spaces will be finite**.

## Bases!

First, let’s state a ridiculously important theorem:

**Thm**: If is a vector space, then it has a basis with finitely many elements.

The proof of this theorem uses the idea that we can keep making linearly independent bases that span more and more of the space. Eventually, this process will stop, and we’ll have a basis for the vector space. Speaking of which…

**Thm**: If is a vector space and the set is a spanning set (that is, every element in is a linear combination of some element in the set) then this set can be reduced to a basis for .

and

**Thm**: If is a vector space and the set is linearly independent in , then it can be extended to a basis for .

and

**Thm**: If is a vector space, then any spanning set of has a greater cardinality than any set of linearly independent vectors in .

These theorems are not hard to prove, and some of the best proofs I’ve seen for them can be found in *Linear Algebra Done Right* by Sheldon Axler. This, coincidentally, is the book that I’ve been going through to re-learn linear algebra. The last theorem is especially important: it should seem reasonable that spanning sets are intuitively “large” since they must span the entire vector space, and that linearly independent sets are “small” since each of their elements has to be somehow “independent” from the others — this theorem tells us what we intuitively feel is true: that EVERY spanning set has more elements than ANY linearly independent set. Now, we have a lot about bases and things like that: specifically, we can mess around with sets until we’re sure we have a basis for our vector space.

Before we can state one particularly awesome result, we need to have some notation for the “largeness of a set.” So, I will use the notation to mean “the number of elements in C.”

**Thm**: If is a vector space, then every basis has the same number of elements.

**Proof**: Suppose that there are two bases for , call them and . Since is a spanning set and is linearly independent, we must have that . On the other hand, since is a spanning set and is linearly independent, we must have that . Putting this together, we note that , which completes the proof.

So, this is a pretty nice theorem, no lies. And it allows us to give some general basis for any vector space since, up to some potential replacing and permuting, every basis is essentially the same. A little later, we will make this precise by noting that there is always a way to easily “change the basis” of a vector space.

At this point, we define the **dimension of a vector space**, and say that if is a basis for the vector space , then we define ; in other words, we define the dimension of to be the size of the basis set. Since every basis set is the same size, this is non-ambiguous.

## Linear Maps!

Some people might argue that vector spaces alone are kind of bland: after all, once you have a basis, that’s about it. You can do whatever you want inside of it, and everything will be kosher. Where’s the adventure in that? Are we satisfied to just sit at home in our nice little vector spaces or do we want to take our ships and travel to new and exotic vector spaces? Linear maps tell us how to translate things from one vector space (like our dear, sweet home) to another vector space (like a cave of wonders!). Spefically, we have the following:

A **linear map ** for some vector spaces and is a map such that the following hold for are scalars and are vectors: . Specifically, we have additivity (that ) and homogeneity (that ) which is pretty nice, all things considered.

There are a number of good examples of linear maps. For example, the identity map is a nice example, since .

Differentiation is another nice linear map: if we have some polynomial then let differentiation be defined by which will stand for the standard derivative. This is clearly a linear map, since and, if is another polynomial, then .

A last linear map to consider is something like “multiplication by x.” Let be a map such that for some polynomial . Let’s check that this is a linear map: given some other polynomial , we have that

and so this is a linear map. Pretty sweet, right?

Now, sometimes when we map things to other things, things become zero. Think about our differentiation map: whenever we take the derivative of a constant, we get zero. Upsetting, but true. We give a special name to this kind of thing: let the **nullity** of the map be defined as the set of vectors . In other words, *the nullity is the set of all vectors that go to zero when we apply the linear map*. You might be concerned because we’ve already used this word before, when we were talking about matrices: well, surprise, it turns out the be the same kind of deal as this since we can represent linear maps as matrices. More about this later, though.

Let’s call the **rank** of a linear map the set of all elements that are given as a “range” of our linear map. Specifically, the rank is equal to . Notice that , and, in fact, I will leave it to the reader to prove that if the linear map , then is a subspace of and is a subspace of . These two facts are *not* hard to prove, but definitely should be attempted by the reader! It’s enlightening.

Now, we’ve already stated the Rank-Nullity theorem but in a slightly different context. We now state and prove it for linear maps. In particular, check out the proof: it is pretty slick!

**Thm** (Rank-Nullity): Given is a linear map and and are vector spaces, then we have that . In other words, the dimension of the rank plus the dimension of the nullity of a map equals the dimension of the “domain” vector space.

** **

**Pf**: Let . Now, the nullity is a subspace of , so let be a basis for the nullity. Since the nullity is a subspace of , its basis must be linearly independent in . We can extend this linearly independent set into a basis for , and so let the extended basis for be .

If we were to show that is a basis for , then this would prove the theorem (as this shows the rank has dimension , the nullity has dimension , and their sum is the dimension of ), so let’s do just that. First, let’s show that this is a spanning set.

If , then we have that by our basis for . Now, consider

and since the first bunch of vectors are in the nullity, we have that these all go to 0. So we are left with

and since was arbitrary, we see that for any vector , can be written in that manner. Therefore, it must be the case that span . But what if these aren’t linearly independent? Suppose, for a contradiction, that these are not linearly independent basis vectors. Then, by an equivalent phrasing of linear independence, we have that for some set of scalars not all of which are 0, the following implications hold:

which means that is in the nullity of . Since is a basis for the nullity, we have that, for some suitable coefficients, that

and with some suitable rearranging, we have the equivalent looking

but since is a basis for it is linearly independent and so the above cannot hold! This is a contradiction! . This (finally) proves the theorem.

In the next post, we’ll look at some applications of this theorem and I’ll shell out some problems for the reader to try.