Let's say we have 3 vectors and we make up a matrix where we depict the vectors as the columns of the matrix. If we calculate the determinant of the matrix and we get a non-zero number, does that mean that the vectors are linearly independent?
[Math] Does the determinant of a matrix made up of column vectors being non-zero imply that the vectors are independent
determinantlinear algebramatricesvectors
Related Solutions
It's easy to understand if you understand linear transformations.
What are vectors?
This is how you would think of a vector right? One arrow pointing into space:
$\begin{bmatrix} x\\y\\z \end{bmatrix}$
But you can also describe them as one arrow for each dimension:
$x\begin{bmatrix} 1\\0\\0\end{bmatrix} + y\begin{bmatrix} 0\\1\\0 \end{bmatrix}+ z\begin{bmatrix} 0\\0\\1\end{bmatrix}$
Now here we used the unit vectors for each dimension as a base.
What's a linear transformation?
With that model of vectors it's easy to describe linear transformations. Let's look at a 3x3 matrix A. When you apply the transformation A to a vector v you get a new vector v': Av=v'. Usually you learn to compute it by multiplying components of each row with the components of the column-vector and adding them:
$\begin{bmatrix}a&b&c\\d&e&f\\g&h&i\end{bmatrix} \begin{bmatrix}x\\y\\z \end{bmatrix} = \begin{bmatrix}ax+by+cz\\dx+ey+fz\\gx+hy+iz\end{bmatrix}$
But if you look at that new vector on the right you see that it's the same as
$x\begin{bmatrix} a\\d\\g\end{bmatrix} + y\begin{bmatrix} b\\e\\h \end{bmatrix}+ z\begin{bmatrix} c\\f\\i\end{bmatrix}$
Does this look familiar? Yes the matrix is just a base of 3 column vectors, with which you can map all vectors to a set of new vectors, linearly, by multiplying the components with the vectors replacing the original unit vectors. If it looks like this:
$\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}$
,which is the Identity matrix, then of course nothing will happen. You just get the same vectors, because the new base is the same as the original unit vector base.
What's the meaning of the determinant?
You probably know how to calculate the determinant, or you can find it easily on the internet anyway. But what does it describe? In 2-dimensional space, two 2-dimensional vectors could describe a parallelogram. in 3-dimensional space, three 3-dimensional vectors could describe a parallelepiped. Those have an Area A or a Volume V respectively. Now the determinant of a transformation matrix describes how much the Area or Volume will get scaled by applying the transformation onto such a set of vectors.
What does a determinant of 0 mean?
If you read the last paragraph you could probably deduce: a determinant of zero means the Volume or Area becomes 0. When does that happen? Of course only when at least one dimension is lost!
When is that dimension lost?
Originally we have The Identity matrix $\begin{bmatrix} 1&0\\0&1 \end{bmatrix}$, which consists of 2 independent vectors, spanning a plane on which all kinds of parallelograms are located. There are many other pairs of vectors that can do the same thing. What happens when 2 column vectors are dependent? They will show at the same direction and therefore don't span a plane anymore, only a line!
Mathematically: If you apply that kind of matrix as a transformation to 2 vectors, you hopefully remember, that you simply get a new vector by adding the products of your vector components with each base vector. But since each base vector is just a scaled version of another one, so their sum will also be a scaled version of that vector.
Do you understand now? If you have 2 vectors, which describe a parallelogram with an area A and apply a transformation with a matrix with 2 dependent column vectors, you will end up with 2 vectors on the same line, meaning the new "parallelogram" has an area of 0. You lost a dimension: The determinant is 0.
Let's say the matrix has $m$ rows and $n$ columns. Either $m < n$, $m > n$, or $m = n$.
If $m < n$, then we have $n$ columns which lie in $\mathbb{R}^m$. Since $\mathbb{R}^m$ has dimension $m$, we can't have more than $m$ linearly independent vectors in $\mathbb{R}^m$. So the $n$ columns must be linearly dependent, a contradiction. Thus, we cannot have $m < n$.
If $m > n$, then we have $m$ rows which lie in $\mathbb{R}^n$. Since $\mathbb{R}^n$ has dimension $n$, we can't have more than $n$ linearly independent vectors in $\mathbb{R}^n$. So the $m$ rows must be linearly dependent, a contradiction. Thus, we cannot have $m > n$.
The only remaining possibility is $m = n$, which means that the matrix must be square.
Best Answer
Yes. If the columns are linearly dependent, then we can show that the determinant is $0$. So if the determinant is not $0$ then the columns are linearly independent.
If the columns of the matrix are $\vec{c}_1, \vec{c}_2, \ldots, \vec{c}_n$ and there are scalars $a_1, a_2, \ldots, a_n$ such that
$$a_1 \vec{c}_1 + a_2 \vec{c}_2 + \cdots + a_n \vec{c}_n = \vec{0}$$
then we see that the vector
$$\langle a_1, a_2, \ldots , a_n\rangle^T$$
is an eigenvector of the matrix with eigenvalue $0$. Since $0$ is an eigenvalue, the determinant is $0$.