If matrix A = ⎝ ⎜ ⎜ ⎜ ⎛ 2 0 1 7 2 0 1 7 ⋮ 2 0 1 7 1 2 ⋮ 2 0 1 7 2 3 ⋮ 2 0 1 8 ⋯ ⋯ ⋱ ⋯ 2 0 1 7 2 0 1 8 ⋮ 4 0 3 3 ⎠ ⎟ ⎟ ⎟ ⎞ , then compute dim ( ker ( A ) ) .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We can think of the matrix to be a matrix of a linear transformation( T ) from a vector space V of dimension 2 0 1 8 to another vector space W of dimension 2 0 1 7 .
Then we know that the rank of the matrix is equal to the rank of the linear transformation.
Now we apply elementary row operations to try and make the matrix RREF ( Row Reduced Echelon Form )
apply R i = R i − R 1 for i = 2 , 3 , . . . . 2 0 1 7 .
and then R i = R i − R 2 for i = 1 , 3 , 4 , . . . . 2 0 1 7 .
To see that all rows after row 2 are zero rows and it is easy to see that the rank of the matrix is 2 which is also equal to d i m ( I m ( T ) ) where T is the linear
transformation corresponding to the given matrix.
So using Rank Nullity theorem which states that d i m ( I m ( T ) ) + d i m ( K e r ( T ) ) = d i m ( V ) .
we see that d i m ( K e r ( T ) ) = 2 0 1 8 − 2 = 2 0 1 6 .
So the kernel of the matrix also has dimension 2 0 1 6
Problem Loading...
Note Loading...
Set Loading...
The basis of ker ( A ) contains all the redundant column vectors of A , namely any vector after column 2. This makes sense because any redundant column vector can be written as a non-trivial relation of the standard basis vectors. The dimension of the kernel is the number of vectors in the basis. So there are 2 0 1 6 of these vectors.