For more information, please see full course syllabus of Linear Algebra

For more information, please see full course syllabus of Linear Algebra

### Rank of a Matrix, Part II

Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.

- Intro 0:00
- Rank of a Matrix 0:17
- Example 1: Part A
- Example 1: Part B
- Rank of a Matrix Review: Rows, Columns, and Row Rank
- Procedure for Computing the Rank of a Matrix
- Theorem 1: Rank + Nullity = n
- Example 2
- Rank & Singularity
- Example 3
- Theorem 2
- List of Non-Singular Equivalences 24:24
- List of Non-Singular Equivalences

### Linear Algebra Online Course

### Transcription: Rank of a Matrix, Part II

*Welcome back to Educator.com, and welcome back to linear algebra.*0000

*This lesson, we are going to continue the discussion of row rank and column rank that we started in the last lesson.*0004

*So, this is going to be the rank of a matrix, part 2.*0010

*Let us just go ahead and jump right in -- go ahead and switch over to a blue ink here.*0015

*Recall from a previous lesson the following matrix.*0022

*So, we have a matrix a... it is (1,3,2,1), (-2,2,3,2), (0,8,7,0), (3,1,2,4), (-4,4,3,-3).*0032

*Okay. So, this is a 4 by 5.*0058

*A 4 by 5 matrix. Okay. Now, let us consider just the columns of this matrix.*0064

*I will call it the set c. So, we have the (1,3,2,1), we have (-2,2,3,2), we have (0,8,7,0), we have (3,1,2,4), (-4,4,3,-3).*0070

*What we have is 1, 2, 3, 4, 5 vectors in R4... 5 vector in R4. Okay.*0099

*Now, we said that the rows of a matrix form the span as we treat it as vectors, individual vectors... they span a space called the row space.*0112

*Well, similarly, the columns of the matrix, they span a space like we define in the previous lesson. They span a space, a subspace called... the column space.*0124

*Now, what we want to do is find a basis for the column space.*0137

*Consisting of arbitrary vectors... they do not necessarily have to be from this set.*0156

*We want to find a basis for the span of this set, but I do not necessarily want them to be from this set.*0162

*So, find a basis for the column space consisting of arbitrary vectors.*0168

*Now, if you remember from our last lesson, when we have a set of vectors, and we want to find a basis for the span of that set of vectors, but we do not care if the vectors in that basis come from the original set... we set up those vectors as rows.*0182

*Then, we do reduced row echelon form, and then the number of non-zero rows, those actually form a basis.*0202

*So, let us do that. Here, the column... the columns are this way.*0206

*We want to find a basis for the column space arbitrary vectors, so I am going to write the columns as rows, because that is the procedure.*0214

*So, I am going to write (1,3,2,1), (-2,2,3,2), (0,8,7,0), (3,1,2,4), (-4,4,3,-3).*0225

*I am going to convert that to reduced row echelon form, and I end up with (1,0,0,11/24), (0,1,0,-49/24), (0,0,1,7/3), and 0's everywhere else.*0248

*My 3 non-zero rows are these. They form a basis for the span of the columns, the original matrix.*0277

*So, I can choose the set (1,0,0,11/24)... that is one vector.*0292

*Notice, in the matrix I had written them as rows, but now I am just writing them as columns because I just tend to prefer writing them this way.*0310

*(0,1,0,-49/24), and (0,0,1,7/3), if I am not mistaken, that is correct.*0320

*Yes. This set forms a basis for the column space.*0332

*Column rank, three. There are three vectors in there.*0347

*Okay. Now, we want to find a basis for the original set of vectors consisting of vectors from that actual set... either all of them, or few of them.*0356

*So, when we do that, we set them up as columns, and we solve the associated homogeneous system.*0371

*So, here is what we are going to set up... (1,3,2,-1), (-2,2,3,2), (0,8,7,0), (3,1,2,4), (-4,4,3,3), and of course the associated system goes that way.*0377

*We convert to reduced row echelon form, we end up with the following.*0406

*We end up with (1,0,0,0), (0,1,0,0), (2,1,0,0), (0,0,1,0), (1,1,-1,0), and 0's in the final column.*0412

*Let us go to blue. Leading entry, leading entry, leading entry. In other words, the first, the second, and the fourth column.*0431

*Therefore, the first, second and fourth column form a basis. Therefore, I can take the vectors (1,3,2,-1), here.*0440

*I can take the vector (-2,2,3,2).*0460

*The fourth column, (3,1,2,4)... this set forms a basis.*0467

*A good basis for the column space.*0475

*Column rank equals 3, because there are 3 vectors that go into the basis. Again, the rank is the dimension of that space.*0485

*Okay. Now, let us recap what we did. Just now, and from the previous lesson. Here is what we did.*0501

*We had a, okay? I will write it one more time. I know it is getting a little tedious, but I suppose it is always good to see it... (2,8,7,0), (3,1,2,4), (4,4,3,3).*0516

*We had this original matrix a. Okay, it is a 4 by 5 matrix.*0542

*The column... the row space consists of 4 vectors in R5.*0549

*The column space consists of 5 vectors in R4. Okay.*0555

*Using two different techniques, we found a basis for the row space, alright? that was in the previous lesson.*0566

*For the row space, we dealt with the rows using two different techniques. One, we set them up as rows, and we got vectors arbitrary vectors for a basis consisting of arbitrary vectors.*0600

*Then, we set up these rows as columns, we solve the associated system and we got a basis consisting of vectors from the original set.*0611

*So, 2 different techniques, we ended up with a row rank equal to 3.*0619

*Okay. Now the columns, like we said, the columns form a set of 1,2,3,4,5 vectors in R4.*0628

*Well, again, this was for rows, now for columns.*0640

*The problem we just did, using 2 different techniques, we found a basis in the column space.*0650

*Column rank is equal to 3. Let me stop this for a second.*0679

*Random matrix... random matrix a... the rows consist of 4 vectors in R5. Using the two techniques, we found a basis, and the basis consists of the 3 vectors a piece. Row rank was 3.*0686

*The columns, the columns are 5 vectors in R4. R5 and R4 have nothing to do with each other, they are completely different spaces.*0707

*I mean, their underlying structure might be the same, but they are completely different spaces. One has 4 elements, the vectors in the other space have 5 elements in them.*0715

*Using two different techniques, we found a basis for the column space. Column rank ends up being 3. Okay.*0723

*This 3, this is not a coincidence... not a coincidence.*0730

*As it turns out, for any random matrix, m by n, row rank equals the column rank.*0742

*So, let me put this in perspective for you. I took a rectangular array, random, in this case 4 by 5.*0760

*It could be 7 by 8... it could be 4 by 13... if I treat the rows as vectors, and if I treat the columns as vectors, and if I calculate...*0766

*If I find a basis for both of the bases that those two... a basis for the span of the collection of vectors that make up the rows... collection of vectors that make up the columns, they have nothing to do with each other.*0777

*Yet, they end up with the same number of vectors.*0793

*Well, the column rank is the row rank, now we call it the rank.*0796

*So, because it is the case, because the column space and the row space end up having the same number of vectors in their bases, we just call it the rank.*0800

*So, we no longer refer to it as the row rank of a matrix, or the column rank of a matrix, we call it the rank of a matrix.*0813

*Now, I want you to stop and think about how extraordinary this is.*0820

*A collection, a rectangular array of numbers... let us say 3 by 17.*0823

*You have some vectors in R3, and you have vectors in R17. They have absolutely nothing to do with each other, and yet a basis for this space that these vectors span... they end up with the same number of vectors.*0830

*There is no reason in the world for believing that that should be the case. There is no reason in the world for believing that that should be the case, and yet there it is.*0846

*Simply by virtue of a rectangular arrangement of numbers. That is extraordinary beyond belief, and we have not even gotten to the best part yet.*0852

*Now, we are just going to call it the rank from now on. So, I do not necessarily have to find the row rank and the column rank of a matrix, I can just take my pick.*0861

*So, let us just stick with rows. I go with rows. You are welcome to go with columns if you want.*0870

*Okay. So, as a recap... our procedure for computing the rank of a matrix a.*0874

*Okay. 1. Transform the matrix a to reduced row echelon matrix b.*0900

*2. The number of non-zero rows is the rank, that is it. Nice and easy.*0911

*Now, recall from a previous lesson. We defined something called the nullity, defined the nullity.*0928

*That was the dimension of the null space. In other words, it is the dimension of the solution space for the homogeneous system ax = 0.*0945

*Okay? Theorem. Profoundly important result, insanely beautiful result. We have to know this.*0975

*If you do not walk away with anything else from linear algebra, know this theorem, because I promise you, if you can drop this theorem in one of your classes in graduate school, you will make one hell of an impression on your professors.*0989

*They probably do not even know this themselves, some of them... but beautiful, beautiful theorem.*1000

*The rank of a matrix a plus the nullity of a matrix a is equal to n.*1007

*So, think about what this means. If I have an m by n matrix, a 5 by 6 matrix... 5 by 6... 5 rows, 6 columns.*1018

*n is 6. The rank of that matrix plus the nullity of that matrix equals 6.*1028

*If I know that I have a matrix that is n = 6, and I find the nullity, I know what the rank is automatically, by virtue of this equation.*1038

*If I know what the rank is, I know what the nullity is. If I know what the rank and nullity is, I know what space I am dealing with.*1046

*If I have a rank of 5, and if I have a nullity of 3, then I know that I am dealing with an 8-dimensional space. Amazing, amazing, amazing theorem. Comes up in a lot of places.*1053

*Okay. Let us do some examples here.*1064

*Let us go... okay... simply by virtue of a random arrangement of numbers in a rectangular array that we call a matrix.*1069

*(1,1,4,1,2), (0,1,2,1,1), (0,0,0,1,2), (1,-1,0,0,2), (2,1,6,0,1)... okay.*1083

*Reduced row echelon. We have this random matrix, it is 1, 2, 3, 4, 5... 1, 2, 3, 4, 5... this is a 5 by 5 matrix, so here n = 5.*1106

*Okay. Reduced row echelon form, you get (1,0,2,0,1), (0,1,2,0,-1), (0,0,0,1,2), and we get (0,0,0,0,0), (0,0,0,0,0)...*1118

*We have 1, 2, 3 non-zero rows. Rank = 3.*1140

*Well, if rank = 3 and n = 5, I know that my solution space to the associated homogeneous system that goes with this matrix... I know that it has to have a dimension 2, because rank + nullity = n.*1149

*3 + 2 = 5. That is extraordinary. In fact, this is from a previous example.*1164

*If you go back to a previous lesson where we actually calculated the solution space, you will find that there were 2 vectors.*1173

*So, 2 vectors, dimension 2, here you have dimension 3 and it confirms the fact that 3 + 2 = 5.*1181

*Okay. Now, let us throw out a theorem here, that has to do with rank in singularity.*1189

*Actually, you know what, we define here... let me go to blue... rank and singularity, and if you remember singularity has to do with determinance.*1200

*So, a non-singular matrix is one whose determinant... well a non-singular matrix is one that actually has an inverse, that is the actual definition of singularity, something that has an inverse and that corresponds to a determinant not being equal to 0.*1220

*And... you remember that list of non-singular equivalences? We are actually going to recap it at the end of this lesson and add a few more things to it.*1235

*So, rank and singularity... a n by n, a n by n matrix is non-singular... it means it has an inverse, if and only if rank = n.*1241

*So, if I calculate the rank and the rank equals n, that means it is not singular. That means it has an inverse. That means its determinant is non-zero.*1260

*Okay. Let us do some quick examples of this one. We will let a equal (1,2,0,0,1,3,2,1,3).*1269

*We convert to reduced row echelon. We get (1,0,0,0,1,0,0,0,1).*1284

*Okay. There is 1, there is 2, there is 3 non-zero vectors in that reduced row echelon. Rank = 3.*1293

*Well, we have a 3 by 3, the rank = 3, therefore that implies that this is non-singular, and it implies that the solution space... okay... has only the trivial solution.*1305

*Again, this goes back to that list of equivalences. One thing implies a whole bunch of other things.*1330

*Okay. Another example. Let us let matrix b equal (1,2,0), (1,1,-3), (1,3,3).*1338

*Let us convert to reduced row echelon form. We end up with (1,0,-6), (0,1,3), we get (0,0,0).*1352

*We have that, we have that... we have 2. So, rank is equal to 2.*1364

*Well, the n is 3, the rank is 2. It is less than 3, it is not equal to 3, therefore... so 2 less than 3, it implies that a is singular.*1370

*It does not have an inverse. It implies that there does exist a non-trivial solution for the homogeneous system.*1386

*Okay. One more theorem here, that is very, very nice.*1402

*We will not necessarily do an example of this, but it is good to know.*1413

*The non-homogeneous system, ax = b, has a solution if and only if the rank of the matrix a is equal to the rank of the matrix a augmented by b.*1419

*So, if I take a, take the rank, and if I take a, make the augmented matrix, and then calculate the length of that matrix, if those are equal... then I know that the actual system has a solution.*1441

*Now, of course we have techniques for finding this solution, you know, and that is important, but sometimes it is nice just to know that it does have a solution.*1454

*Okay. Now, let us talk about our list of non-singular equivalences, and let us add to that list.*1464

*So, list of non-singular equivalences. This is for a n by n... you remember, because an n by n matrix is the only one for which a determinant is actually defined. Okay.*1471

*All of the following are equivalent. In other words, one is the same as the other.*1489

*Each one implies each and every other one.*1496

*One, well, a is non-singular.*1502

*Two, ax = 0, the homogeneous system has only the trivial solution... and you remember the trivial solution is just 0, all 0's.*1511

*Three, a is row-equivalent to i _{n}, the identity matrix. That is the one with all 1's in the main diagonal. Everything else is 0.*1532

*Four, ax = b, the associated non-homogeneous solution has a weak solution... only 1.*1552

*Five, the determinant of a is non-zero.*1569

*Six, a has rank n.*1578

*Seven, a has nullity 0.*1585

*Eight, rows of a form a linearly independent set of vectors in RN.*1593

*Nine, the columns do the same thing. The columns of a form a linearly independent -- I will just abbreviate it as LI -- set of vectors in RN.*1625

*So, I can make all of these statements if I have some random a matrix, which is n by n, let us say 5 by 5.*1646

*If I know that it is... let us say I know... I calculate its rank and its rank ends up being n. I know that all of these other things are true.*1656

*A is non-singular, that means that it has an inverse. I know that the associated homogeneous system has the trivial solution only.*1665

*I know that I can convert a to the identity matrix, in this case i5... I know that the associated non-homogeneous solution for any particular b has one and only one solution.*1671

*I know that the determinant is not 0.*1683

* I know that the nullity, the solution space is 0, which is the same as the... yeah, only the trivial solution.*1686

*I know that the rows of a form a linearly independent set of vectors in RN.*1694

*I know that the columns of a form a linearly independent set of vectors in RN.*1699

*So, again, we have a matrix... the rows are a set of vectors, and they behave a certain way, they span a space. The dimension of that space is the row rank.*1708

*The columns of that matrix span a space. The dimension of that subspace is called the column rank.*1720

*The row rank and the column rank end up being the same, no matter what rectangular array we have. We call that the rank.*1731

*The rank + the nullity, which is the dimension of the solution space, of the associated homogeneous system is always equal to n.*1740

*That is amazing. That is beautiful, and it is going to have even further consequences as we see in our subsequent lessons.*1754

*Thank you for joining us here at Educator.com, thank you for joining us for linear algebra, we will see you next time, bye-bye.*1760

1 answer

Last reply by: Professor Hovasapian

Sat Aug 8, 2015 10:15 PM

Post by matt kruk on July 19, 2015

hi professor so if a system of equations only has the trivial solution is it still possible to solve it in differential equations. for example variation of parameters relies on having the solutions to the homogeneous system. would you just be forced to use undetermined coefficients to solve the system?

2 answers

Last reply by: Matt C

Thu Apr 4, 2013 7:06 PM

Post by Matt C on April 3, 2013

I am just curious on this question? Is it possible to take a basis of a null space and work all the way back into the rref form? But you are not giving the size of the matrix, just the basis of the null space. I know, I can figure out the number of free variables and the how many columns are in the matrix, but is it possible to figure out how many pivots and rows are in the matrix? I was just bored so I tried to work backwards, but seem to be getting stuck.

1 answer

Last reply by: Professor Hovasapian

Wed Apr 3, 2013 12:58 AM

Post by Matt C on April 2, 2013

For the first example part I entered the matrix into my calculator and put it in row reduce echelon form and I did not get what you did. I then went back in the notes (because you used this matrix in the previous episode) and I noticed that you forgot to put a negative in front of the 1 in row 4 column 1 in the 4x5 matrix. So the last row in the 4x5 matrix should be (-1,2,0,4,-3). That seems to work. Let me know if that is correct please.

1 answer

Last reply by: Professor Hovasapian

Mon Dec 3, 2012 12:39 AM

Post by Eduardo Voloch on December 2, 2012

There is an error on "b)", 4th row, 5th column, should be -3 and not 3. Excellent video though. Really well explained. Thank you so much!

0 answers

Post by Ken Mullin on January 21, 2012

Very well demonstated and explained.

However, unless row and column manipulations were "drilled" to watchers in earlier videos (I skipped immediately to this section, having some familiarity with the topic), I'm wondering how many may be following the final matrix appearance in RREF.