00:01
Hello, so we consider a given matrix and we're going to use the graham -schmidt process to find an orthogonal basis of the kernel of the matrix.
00:08
So to find the kernel, we consider solutions to a x equals zero, where x is going to be the vector, just a, b, c, d.
00:17
So to solve a x equals zero, we have a given matrix.
00:22
So 1 -1, 1, 0, 9 -0, 0.
00:38
That gives us, we get 0.
00:40
Plus b plus c plus d.
00:43
The first row, and then a minus b, minus c plus d.
00:46
Again, it's equal to zero, zero.
00:49
And then by the definition of equal matrices, we just equate the corresponding elements.
00:54
So we're going to have that a minus b, minus c plus d or zero, giving us that a plus d is going to, be equal to b plus c.
01:13
So we can substitute that into, substitute a plus d into a plus b plus c plus d equal zero, giving us then that b plus c plus b plus c equals 0.
01:25
So we get 2b plus 2c equals negative 2c, giving us that 2b equals negative c.
01:35
And then we can substitute back in...