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

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

### Linear Independence

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
- Linear Independence 0:32
- Definition
- Meaning
- Procedure for Determining if a Given List of Vectors is Linear Independence or Linear Dependence
- Example 1
- Example 2

### Linear Algebra Online Course

### Transcription: Linear Independence

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

*In the last lesson we talked about something called the span of a given set of vectors.*0004

*In other words, any linear combination of those particular vectors represents, all the vectors that can be represented by what actually spans.*0010

*Today we are going to be talking about a related concept, again, a very, very profoundly important concept called linear independence, and its dual, linear dependence.*0019

*So, let us write out some definitions and get started right away and jump into the examples, because again, examples are the things that make it very, very clear... I think.*0032

*So, let us define linear dependence. Even though we speak about linear independence, the actual definition is written in terms of linear dependence.*0041

*Well, let us actually -- okay -- vectors v1, v2... vk are linearly dependent.*0058

*We will often just say dependent or independent without saying linear. We are talking about linear algebra so it goes without saying.*0090

*If there exists constants, c1, c2... all the way to ck... not all 0 -- that is important, because that is easy -- such that c1v1 + c2v2 + ckvk = 0, or the 0 vector.*0096

*So, let us look at this again. So, if vectors v1 to vk, if I have a set of vectors and if I can somehow, if there exist constants -- no matter what they are, but not all of them 0.*0134

*If I can arrange them in such a way, some linear combination of them, if they add up to 0, we call that linearly dependent, okay?*0148

*A couple of vectors are linearly dependent, and let us talk about what that actually means. Okay.*0155

*Oh, by the way, if it is not the case, that is when they are linearly independent.*0165

*If you cannot find this, or if the only way to make this true is if all of the individual c's are 0, or there is no way to find it otherwise, that means that they are linearly independent.*0170

*Here is what the meaning is, just so you get an idea of what is going on.*0181

*If we solve this equation... actually, I am going to number this equation. I have not done this before but this is definitely 1 equation that we are going to want to number.*0189

*We will call it equation 1, because we are going to refer to it again and again. It is a very important equation.*0193

*If you solve this equation for any one of these vectors, so let us just choose one arbitrarily, let us choose that.*0200

*I am going to write that as c2v2 = well, we are going to move all of these over to the right... -c1v1 - c3v3 - so on, all the way to the end... -ckvk.*0209

*Then I am going to go ahead and divide by c2, so I get v2 = this whole thing.*0232

*Let me just... I hope you do not mind, I am going to call this whole thing the capital Z.*0241

*Z/c2, well, as you can see, if this is true, then you can always solve for one of these vectors and this vector is always going to be some linear combination of the other vectors.*0249

*That is what dependence means. Each of those vectors is dependent on the other vectors.*0265

*In other words, it can be represented as some combination of the others. That is why it is called dependent.*0271

*So, that is all that means. It is nothing strange, it makes perfect sense, and if this relationship does not exist, then it is independent.*0279

*In other words, 1 vector cannot be represented as a combination of the others. It is independent. That is what independence means.*0287

*Okay. Let us jump into examples, because that is what is important.*0297

*Actually, let me talk about it... let me list at least the procedure. It is analogous to what we did before.*0302

*The procedure for determining if a given list of vectors is linearly independent or linearly dependent... LD, LI... abbreviations.*0309

*The first thing we do, well, we form equation 1. Remember when we were dealing with span over on the right hand side?*0335

*We did not have 0, we had some arbitrary vector. Now, for linear independence or linear dependence, we set it equal to 0.*0343

*So, we form equation 1, which is a homogeneous system.*0352

*Then, 2, then we solve that system, and here are the results.*0365

*If you find out it only has the trivial solution, that means all of the c's the constants are 0... that implies that it is independent.*0373

*The other thing is, if there exists a non-trivial solution... just one, could be many, but if there is just one, so again, you remember this reverse e means there exists.*0391

*So, if there exists a non-trivial solution, that implies that it is dependent.*0411

*Again, we are just solving linear systems. That is all we are doing, and the solutions to these linear systems give us all kinds of information about the underlying structure of this vector space.*0422

*Whether something spans it, whether something is linearly independent or dependent, and of course, all of these will make more sense as we delve deeper into the structure of the vector space. Okay.*0432

*So, let us start with our example... this is going to be not a continuation of what we did for the span, but I guess kind of a further discussion of it.*0442

*You remember in the last example of the last lesson, we found we had this homogeneous system and we found solutions for x, and we found 2 vectors that actually span the entire solution space, the null space.*0455

*Those vectors were as follows... (-1,1,0,0), (-2,0,1,1).*0472

*So, we know that these two vectors span the solution space to this particular equation based on what a was.*0485

*I will not write down what a is. It is not necessary.*0492

*Now, the question is... we know that they span the null space... the question is are they linearly independent or dependent.*0497

*So, our question here is... are these two vectors LI or LD.*0506

*Our procedure says form equation 1. So, form equation 1.*0523

*That is just c1 × this vector, (-1,1,0,0) + c2 × (-2,0,1,1)... and we set it equal to the 0 vector which is just all 0's.*0530

*So, we do not need the vector mark anymore... (0,0,0,0). Okay.*0546

*Then, what we end up having is the following... this is equivalent to the following... (-1,-2,0), we are just taking the coefficients, that is all we are doing.*0552

*(-1,0,0), (0,1,0), (0,1,0), and when we subject this to Gauss Jordan elimination, reduced row echelon, we end up with the following... c2 = 0, c1 = 0.*0566

*That means that all of the constants, we only have two constants in this case, so this is only the trivial solution.*0585

*Therefore, they are independent. There you go, that is it. It is that simple.*0596

*You set up the homogeneous system, you solve the homogeneous system, and you decide whether it is dependent or independent. Fantastic technique.*0605

*Okay. Let us consider the vector space of polynomials again. Let us consider p2, again.*0617

*p2, the set of all polynomials of degree < or = 2.*0626

*Let us look at 3 vectors in there... we have t ^{2} + t + 2.*0631

*We have p2t, which is equal to 2t ^{2} + t, we have p3t, which is equal to 3t^{2} + 2t + 2.*0642

*So, they are just, you know, random vectors in this particular space, in other words random polynomials.*0656

*Well, we want to know if these three as vectors are the linearly dependent or independent.*0661

*Well, do what we do. We set up equation 1, which is the following. We take arbitrary constants... c1 × p1t + c2 × p2t, we will write everything out here... we want things to be as explicit as possible.*0671

*Plus c3 × p3t, and we set it equal to 0, that is our homogeneous system.*0688

*Now, we actually expand this by putting in what these p1, p2, p3 are. Okay.*0695

*We get p1 × t ^{2} + t + 2 + c2 × 2t^{2} + t + c3 × 3t^{2} + 2t + 2 = 0.*0702

*Now, let us actually... this one I am going to do explicitly... there is no particular reason why, I just decided that it would be nice to do this one explicitly.*0725

*So, I have c1t ^{2} + c1t + 2c1 + 2c2t^{2} +c2t + 3c3t^{2} + 2c3t + 2c3 = 0.*0734

*Algebra makes me crazy, just like it makes you crazy, because there are a whole bunch of things floating around to keep track of it all.*0762

*Just go slowly and very carefully and be systematic. That is... do not ever do anything in your head.*0769

*That is the real secret to math, do not do anything in your head. You will not be impressing anyone.*0774

*I collect the terms... the t ^{2} terms, so I have that one, that one, and that one, and I end up with... so let me write these out as t^{2} × c1 + 2c2 + 3c3.*0780

*Then, I will take the t terms... there is a t, there is a t, there is a t, and I will write that as a second line here, just to be clear what it is that we are doing.*0800

*c1 + c2 + 2c3... then I have plus the... well, the rest of the terms.*0811

*That one... and that one... and is there one that I am missing? No. It looks like it is okay.*0821

*So, it is going to be + 2c1 + 2c3 and all of this... sum... is equal to 0.*0829

*Again, that means that this is 0, this is 0, this is 0. That is what this system is.*0843

*So, we will write that, because everything is 0 on the right, so all of these have to be 0 in order to make this left side 0.*0850

*So, I get c1 + 2c2 + 2c3 = 0.*0858

*Note, we do not want these lines floating around. We want to be able to see everything here.*0867

*c1 + c2 + 2c3, is equal to 0.*0875

*2c1 + 2c3 = 0, this is of course equivalent to... I will just take the coefficients... (1,2,3,0), (1,1,2,0), (2,0,2,0), okay.*0885

*So, this is the system that we want to solve, and we are going to subject that to reduced row echelon.*0906

*So, I put a little arrow to let you know what is happening here and what you end up with is (1,0,1,0), (0,1,1,0), (0,0,0,0).*0913

*So, let us take a look at our reduced row echelon. We have this is fine, yes. That is a leading entry... that is fine, that is a leading entry.*0934

*There is no leading entry here. Remember when we solved reduced row echelon for a homogeneous system, this means we have infinite number of solutions, because this one can be any parameter.*0944

*If this is any parameter, well, I can choose any number for this one and then that this means these two will be based on this.*0954

*Therefore, we have infinite solutions. In other words, there does exist a non-trivial solution.*0963

*So, there exists a non-trivial solution, which implies dependence... that means that those three polynomials that I had, one of them can be expressed as a linear combination of the other two.*0974

*So, they are not completely independent. At least one of them depends on the others.*0996

*So, we have dependence. Again, today we talked about linear independence and dependence.*1006

*The previous lesson we talked about the span, so, make sure you recall... we are still studying a linear system when we do that, but with a span we choose an arbitrary vector... that is our solution on the right hand side of the equation, that linear combination that we write.*1013

*For linear dependence and independence we are solving a homogeneous system. We just set everything equal to 0. Make sure to keep those straight.*1028

*Thank you for joining us here for a discussion of Linear Algebra at Educator.com. We will see you next time.*1036

1 answer

Last reply by: Professor Hovasapian

Tue Sep 23, 2014 1:49 AM

Post by Sheena Patel on September 22, 2014

Would it be possible to just look at a matrix problem and figure it is non-trival, trival, linear independent or dependent, consistant, inconsisent all at once?

1 answer

Last reply by: Professor Hovasapian

Wed Sep 25, 2013 5:19 PM

Post by Christian Fischer on September 25, 2013

Hi Raffi, I know I have a bunch of questions but it's because I'm really into your lectures! There is one thing I can't understand mathematically from example 2 (14 minutes in)

If you have the sum of 3 terms t^2(---) + t(---) + (---) = 0

How can you then set each individual term equal to zero? I know from multiplication that if a*(x-a)= zero then both terms a=0 and (x-a) = 0, but I did not think it applied to addition?

Is there something I'm not seeing properly?

1 answer

Last reply by: Professor Hovasapian

Tue Sep 24, 2013 2:52 PM

Post by Vivek Sharma on September 24, 2013

Hi Prof .Raffi..i am doing linear algebra course from uni in australia ...i was very depressed about my performance as i have only a month in exams.. but now i believe after hearing your lectures that i am still in the market.

i will really appreciate if u can upload a video on inner product spaces and gram- schmidit process etc...

With kind regards....

1 answer

Last reply by: Mary Shriver

Mon Feb 18, 2013 12:14 AM

Post by Mary Shriver on February 17, 2013

For example 2 you have written a non trivial solution= dependence. I could just be confused and I will watch the example again but should it be independence when there are non trivial solutions. Your teachings are very helpful.