00:01
Hello, let's have a look at the question.
00:03
So the question state given is a v vector which consists of the elements 0, 3, minus 9 and 9 and we have to find the closest point to the v vector in the subspace w spanned by w is spanned by spanned by means it is a linear combination of minus 5, 4, 4, 1 and minus 6, 5, minus 5, 30.
00:35
Now here let us take that v1 vector is equals to minus 5, 4, 4 and 1 and v2 vector is equals to minus 6, 5, minus 5 and 30.
00:53
So now here we know that v1 vector dot v2 vector is equals to 0.
01:00
So therefore here we can write that v the vector dot v1 vector divided by v1 vector dot v1 vector multiplied with v1 vector added with v vector dot v2 vector and divided by v2 vector dot v2 vector and this is multiplied with v2 vector.
01:24
So here we can write the values as 0 plus 12 minus 36 plus 9 divided by here we have 25 plus 16 plus 16 and plus 1 and this is multiplied with minus 5, 4, 4 and 1.
01:44
Then this is added with here we have 0 plus 15 plus 45 plus 270 and this is divided by 36 plus 25 plus 25 and plus 900 and this will be multiplied with minus 6, 5, minus 5 and 30...